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