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