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