Translate the following inference to logic notation: For all x, x_24 is a soldier or x_24 will drink water. For all x, x_24 will play tennis if and only if x_24 is rich. For all x, x_24 is a soldier if and only if x_24 will listen to a song. For all x, if x_24 drinks water, then x_24 is playing tennis. There is at least one x for which x_24 will not listen to a song. Therefore there is at least one x for which x_24 is rich.
forall x: P(x) or Q(x). forall x: R(x) <-> S(x). forall x: P(x) <-> T(x). forall x: Q(x) -> R(x). exists x: ~T(x). Therefore exists x: S(x).