Translate the following inference to logic notation: For all x, z_2 will not make tea. There is at least one x for which z_2 is a bartender if and only if z_2 will go running. For all x, z_2 will make tea if and only if z_2 is a bartender. For all x, if z_2 goes running, then z_2 is reading a book. For all x, if z_2 reads a book, then z_2 is running. Therefore there is at least one x for which z_2 will not read a book.
forall x: ~P(x). exists x: Q(x) <-> R(x). forall x: P(x) <-> Q(x). forall x: R(x) -> S(x). forall x: S(x) -> R(x). Therefore exists x: ~S(x).