Translate the following inference to logic notation: For all x, x_9 is a sailor. For all x, x_9 will listen to a song. There is at least one x for which x_9 will play a game or x_9 is a janitor. For all x, x_9 will not play a game. Therefore there is at least one x for which x_9 is a janitor and x_9 is a sailor.
forall x: P(x). forall x: Q(x). exists x: R(x) or S(x). forall x: ~R(x). Therefore exists x: S(x) and P(x).