Translate the following inference to logic notation: For all x, z_1 will not go running. For all x, if z_1 goes running, then z_1 is a mechanic. For all x, if z_1 were a mechanic, then z_1 is running. For all x, if z_1 reads a book, then z_1 is a mechanic. Therefore for all x, z_1 will not read a book.
forall x: ~P(x). forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: R(x) -> Q(x). Therefore forall x: ~R(x).