Translate the following inference to logic notation: For all x, x_5 will not make tea or x_5 is a janitor. For all x, x_5 will not listen to a song or x_5 will drink water. There is at least one x for which x_5 will listen to a song or x_5 will make tea. For all x, x_5 will not drink water or x_5 will cook. Therefore there is at least one x for which x_5 is a janitor or x_5 will cook.
forall x: ~P(x) or Q(x). forall x: ~R(x) or S(x). exists x: R(x) or P(x). forall x: ~S(x) or T(x). Therefore exists x: Q(x) or T(x).