Translate the following inference to logic notation: For all x, x_4 will not sleep or x_4 will work. For all x, x_4 will not write a letter or x_4 will read a book. For all x, if x_4 reads a book, then x_4 is a taxi driver. For all x, if x_4 works, then x_4 is a taxi driver. For all x, x_4 will sleep or x_4 will write a letter. Therefore for all x, x_4 is a taxi driver.
forall x: ~P(x) or Q(x). forall x: ~R(x) or S(x). forall x: S(x) -> T(x). forall x: Q(x) -> T(x). forall x: P(x) or R(x). Therefore forall x: T(x).