Translate the following inference to logic notation: For all x, x will play tennis or x is not a taxi driver. There is at least one x for which if x makes tea, then x is playing tennis. For all x, x is a taxi driver or x will make tea. Therefore there is at least one x for which x will play tennis.
forall x: P(x) or ~Q(x). exists x: R(x) -> P(x). forall x: Q(x) or R(x). Therefore exists x: P(x).