Translate the following inference to logic notation: For all x, x_3 will go running or x_3 will not drink water. For all x, if x_3 goes running, then x_3 is drinking water. There is at least one x for which x_3 will not go running. Therefore there is at least one x for which x_3 will not drink water.
forall x: P(x) or ~Q(x). forall x: P(x) -> Q(x). exists x: ~P(x). Therefore exists x: ~Q(x).