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