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