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