Translate the following inference to logic notation: For all x, if x sleeps, then x is playing a game. For all x, if x were a soldier, then x is playing a game. For all x, if x drinks water, then x is not playing a game. There is at least one x for which x will sleep or x is a soldier. Therefore there is at least one x for which x will not drink water.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: S(x) -> ~Q(x). exists x: P(x) or R(x). Therefore exists x: ~S(x).