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