Translate the following inference to logic notation: For all x, x_16 will not drink water or x_16 will write a letter. For all x, x_16 will read a book if and only if x_16 will play squash. For all x, x_16 will drink water or x_16 will read a book. There is at least one x for which if x_16 were poor, then x_16 is playing squash. For all x, if x_16 goes running, then x_16 is poor. For all x, if x_16 writes a letter, then x_16 is running. Therefore there is at least one x for which x_16 will play squash.
forall x: ~P(x) or Q(x). forall x: R(x) <-> S(x). forall x: P(x) or R(x). exists x: T(x) -> S(x). forall x: U(x) -> T(x). forall x: Q(x) -> U(x). Therefore exists x: S(x).