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