Translate the following inference to logic notation: For all x, x_5 will not play squash. There is at least one x for which x_5 is a bartender if and only if x_5 is poor. For all x, if x_5 plays squash, then x_5 is poor. For all x, if x_5 were poor, then x_5 is playing squash. Therefore there is at least one x for which x_5 is not a bartender.
forall x: ~P(x). exists x: Q(x) <-> R(x). forall x: P(x) -> R(x). forall x: R(x) -> P(x). Therefore exists x: ~Q(x).