Translate the following inference to logic notation: For all x, if x_8 plays a game, then x_8 is taking a plane. For all x, if x_8 climbs a mountain, then x_8 is playing squash. For all x, if x_8 plays squash, then x_8 is playing a game. There is at least one x for which if x_8 takes a plane, then x_8 is climbing a mountain. Therefore there is at least one x for which if x_8 plays a game, then x_8 is climbing a mountain.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: S(x) -> P(x). exists x: Q(x) -> R(x). Therefore exists x: P(x) -> R(x).