Translate the following inference to logic notation: For all x, x_6 will not go running or x_6 will read a book. There is at least one x for which x_6 will go running or x_6 is a taxi driver. For all x, x_6 is a taxi driver if and only if x_6 will drive a car. For all x, x_6 will not drive a car. Therefore there is at least one x for which x_6 will read a book.
forall x: ~P(x) or Q(x). exists x: P(x) or R(x). forall x: R(x) <-> S(x). forall x: ~S(x). Therefore exists x: Q(x).