Translate the following inference to logic notation: For all x, x_11 will not play squash. For all x, if x_11 plays tennis, then x_11 is drinking water. For all x, x_11 will play squash or x_11 will play a game. There is at least one x for which x_11 will play tennis. Therefore there is at least one x for which x_11 will play a game and x_11 will drink water.
forall x: ~P(x). forall x: Q(x) -> R(x). forall x: P(x) or S(x). exists x: Q(x). Therefore exists x: S(x) and R(x).