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