Translate the following inference to logic notation: For all x, if x_15 drinks water, then x_15 is playing tennis. For all x, x_15 will go running if and only if x_15 will play tennis. There is at least one x for which x_15 will drink water or x_15 will go running. For all x, x_15 will not play tennis. Therefore there is at least one x for which x_15 is excited.
forall x: P(x) -> Q(x). forall x: R(x) <-> Q(x). exists x: P(x) or R(x). forall x: ~Q(x). Therefore exists x: S(x).