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