Translate the following inference to logic notation: For all x, x_12 will drive a car or x_12 will play tennis. For all x, if x_12 plays tennis, then x_12 is reading a book. For all x, x_12 is a janitor. There is at least one x for which if x_12 drives a car, then x_12 is not a janitor. Therefore there is at least one x for which x_12 will read a book.
forall x: P(x) or Q(x). forall x: Q(x) -> R(x). forall x: S(x). exists x: P(x) -> ~S(x). Therefore exists x: R(x).