Translate the following inference to logic notation: For all x, if z were a server, then z is not reading a book. There is at least one x for which z is a poet if and only if z will read a book. For all x, z is a poet. Therefore there is at least one x for which z is not a server.
forall x: P(x) -> ~Q(x). exists x: R(x) <-> Q(x). forall x: R(x). Therefore exists x: ~P(x).