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