Translate the following inference to logic notation: For all x, x_6 is excited or x_6 will play a game. For all x, if x_6 were excited, then x_6 is not a taxi driver. There is at least one x for which if x_6 plays a game, then x_6 is taking a plane. For all x, x_6 is a taxi driver. Therefore there is at least one x for which x_6 will take a plane.
forall x: P(x) or Q(x). forall x: P(x) -> ~R(x). exists x: Q(x) -> S(x). forall x: R(x). Therefore exists x: S(x).