Translate the following inference to logic notation: For all x, if x_5 drives a car, then x_5 is drinking water. For all x, if x_5 were a mechanic, then x_5 is drinking water. For all x, if x_5 plays a game, then x_5 is a mechanic. There is at least one x for which if x_5 were a writer, then x_5 is not drinking water. For all x, x_5 will drive a car or x_5 will play a game. Therefore there is at least one x for which x_5 is not a writer.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: S(x) -> R(x). exists x: T(x) -> ~Q(x). forall x: P(x) or S(x). Therefore exists x: ~T(x).