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