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