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