Translate the following inference to logic notation: For all x, x_19 will play a game or x_19 is a server. There is at least one x for which x_19 will not drink water. For all x, x_19 will drink water if and only if x_19 will play a game. For all x, x_19 is an astronaut and x_19 is a lawyer. Therefore there is at least one x for which x_19 is a server and x_19 is an astronaut.
forall x: P(x) or Q(x). exists x: ~R(x). forall x: R(x) <-> P(x). forall x: S(x) and T(x). Therefore exists x: Q(x) and S(x).