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