Translate the following inference to logic notation: For all x, if x_11 drinks water, then x_11 is not climbing a mountain. For all x, if x_11 takes a plane, then x_11 is drinking water. There is at least one x for which x_11 is a writer. For all x, if x_11 were a writer, then x_11 is climbing a mountain. Therefore there is at least one x for which x_11 will not take a plane.
forall x: P(x) -> ~Q(x). forall x: R(x) -> P(x). exists x: S(x). forall x: S(x) -> Q(x). Therefore exists x: ~R(x).