Translate the following inference to logic notation: For all x, x_6 will drive a car. For all x, if x_6 were a janitor, then x_6 is not a politician. For all x, x_6 is a politician or x_6 will not drive a car. Therefore for all x, x_6 is not a janitor.
forall x: P(x). forall x: Q(x) -> ~R(x). forall x: R(x) or ~P(x). Therefore forall x: ~Q(x).