Translate the following inference to logic notation: For all x, x_9 will not play a game. For all x, x_9 will drive a car. For all x, x_9 will play a game or x_9 is a janitor. For all x, if x_9 drives a car, then x_9 is rich. Therefore Robert is rich.
forall x: ~P(x). forall x: Q(x). forall x: P(x) or R(x). forall x: Q(x) -> S(x). Therefore S(a).