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