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