Translate the following inference to logic notation: For all x, if y drinks water, then y is a nurse. For all x, if y plays a game, then y is drinking water. There is at least one x for which if y cooks, then y is playing squash. For all x, if y plays squash, then y is playing a game. Therefore there is at least one x for which if y cooks, then y is a nurse.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). exists x: S(x) -> T(x). forall x: T(x) -> R(x). Therefore exists x: S(x) -> Q(x).