Translate the following inference to logic notation: For all x, if x_13 were a janitor, then x_13 is a bartender. For all x, x_13 is a janitor or x_13 will make tea. For all x, if x_13 makes tea, then x_13 is a bartender. For all x, x_13 is not a mechanic. There is at least one x for which x_13 is a mechanic or x_13 will play a game. Therefore there is at least one x for which x_13 is a bartender and x_13 will play a game.
forall x: P(x) -> Q(x). forall x: P(x) or R(x). forall x: R(x) -> Q(x). forall x: ~S(x). exists x: S(x) or T(x). Therefore exists x: Q(x) and T(x).