Translate the following inference to logic notation: For all x, z_2 is a soldier. There is at least one x for which z_2 is a poet. For all x, if z_2 were a poet, then z_2 is a server. Therefore there is at least one x for which z_2 is a soldier and z_2 is a server.
forall x: P(x). exists x: Q(x). forall x: Q(x) -> R(x). Therefore exists x: P(x) and R(x).