Translate the following inference to logic notation: For all x, x_10 will read a book. For all x, x_10 will work or x_10 will drive a car. For all x, x_10 is not a taxi driver. For all x, x_10 is a taxi driver if and only if x_10 will work. Therefore James is reading a book.
forall x: P(x). forall x: Q(x) or R(x). forall x: ~S(x). forall x: S(x) <-> Q(x). Therefore P(a).