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