Translate the following inference to logic notation: For all x, if x_7 goes running, then x_7 is playing squash. For all x, if x_7 plays squash, then x_7 is a sailor. There is at least one x for which if x_7 were a sailor, then x_7 is playing a game. For all x, if x_7 plays a game, then x_7 is running. Therefore there is at least one x for which if x_7 were a sailor, then x_7 is playing a game.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). exists x: R(x) -> S(x). forall x: S(x) -> P(x). Therefore exists x: R(x) -> S(x).