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