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