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