Translate the following inference to logic notation: For all x, x_4 is a server. For all x, x_4 is not a poet. There is at least one x for which x_4 is a poet or x_4 is an astronaut. Therefore there is at least one x for which x_4 is an astronaut and x_4 is a server.
forall x: P(x). forall x: ~Q(x). exists x: Q(x) or R(x). Therefore exists x: R(x) and P(x).