Translate the following inference to logic notation: For all x, x_12 will play a game and x_12 will sleep. There is at least one x for which if x_12 plays a game, then x_12 is playing tennis. For all x, if x_12 plays tennis, then x_12 is driving a car. Therefore there is at least one x for which x_12 will drive a car.
forall x: P(x) and Q(x). exists x: P(x) -> R(x). forall x: R(x) -> S(x). Therefore exists x: S(x).