Translate the following inference to logic notation: For all x, if x_10 drives a car, then x_10 is reading a book. For all x, x_10 is a taxi driver if and only if x_10 will drive a car. There is at least one x for which x_10 will not read a book. For all x, if x_10 reads a book, then x_10 is a police officer. For all x, if x_10 were a police officer, then x_10 is driving a car. Therefore there is at least one x for which x_10 is not a taxi driver.
forall x: P(x) -> Q(x). forall x: R(x) <-> P(x). exists x: ~Q(x). forall x: Q(x) -> S(x). forall x: S(x) -> P(x). Therefore exists x: ~R(x).