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