Translate the following inference to logic notation: For all x, x_5 is not a bartender. For all x, x_5 will write a letter or x_5 is a janitor. There is at least one x for which x_5 will listen to a song. For all x, if x_5 writes a letter, then x_5 is a bartender. Therefore there is at least one x for which x_5 will listen to a song and x_5 is a janitor.
forall x: ~P(x). forall x: Q(x) or R(x). exists x: S(x). forall x: Q(x) -> P(x). Therefore exists x: S(x) and R(x).