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