Translate the following inference to logic notation: For all x, x_7 will not sleep. There is at least one x for which x_7 is a bartender. For all x, x_7 is not a sailor or x_7 will take a plane. For all x, x_7 is a sailor. Therefore there is at least one x for which x_7 is a bartender and x_7 will take a plane.
forall x: ~P(x). exists x: Q(x). forall x: ~R(x) or S(x). forall x: R(x). Therefore exists x: Q(x) and S(x).