Translate the following inference to logic notation: There is at least one x for which x_12 will not write a letter. For all x, x_12 will play a game if and only if x_12 will write a letter. For all x, x_12 will drive a car if and only if x_12 will play a game. Therefore there is at least one x for which x_12 will not drive a car.
exists x: ~P(x). forall x: Q(x) <-> P(x). forall x: R(x) <-> Q(x). Therefore exists x: ~R(x).