Translate the following inference to logic notation: For all x, if x_6 plays tennis, then x_6 is taking a plane. For all x, if x_6 listens to a song, then x_6 is taking a plane. For all x, x_6 will play tennis or x_6 will listen to a song. There is at least one x for which x_6 is a soldier. Therefore there is at least one x for which x_6 will take a plane.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: P(x) or R(x). exists x: S(x). Therefore exists x: Q(x).