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