Translate the following inference to logic notation: For all x, z will not go running. For all x, z will go running if and only if z will take a plane. For all x, z will take a plane or z_4 will read a book. Therefore there is at least one x for which z_4 will read a book.
forall x: ~P(x). forall x: P(x) <-> Q(x). forall x: Q(x) or R(x). Therefore exists x: R(x).