Translate the following inference to logic notation: There is at least one x for which x_11 will make tea. For all x, x_11 will drive a car or x_11 will take a plane. For all x, x_11 will not drive a car. For all x, if x_11 makes tea, then x_11 is climbing a mountain. Therefore there is at least one x for which x_11 will climb a mountain and x_11 will take a plane.
exists x: P(x). forall x: Q(x) or R(x). forall x: ~Q(x). forall x: P(x) -> S(x). Therefore exists x: S(x) and R(x).