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