Translate the following inference to logic notation: For all x, x_10 will not play a game or x_10 will play tennis. For all x, if x_10 works, then x_10 is not a server. For all x, x_10 will play a game or x_10 will work. There is at least one x for which x_10 is a server. Therefore there is at least one x for which x_10 will play tennis.
forall x: ~P(x) or Q(x). forall x: R(x) -> ~S(x). forall x: P(x) or R(x). exists x: S(x). Therefore exists x: Q(x).