Translate the following inference to logic notation: There is at least one x for which if x_5 drives a car, then x_5 is a janitor. For all x, if x_5 were excited, then x_5 is a poet. For all x, if x_5 were a janitor, then x_5 is excited. For all x, x_5 is not a poet. Therefore there is at least one x for which x_5 will not drive a car.
exists x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: Q(x) -> R(x). forall x: ~S(x). Therefore exists x: ~P(x).