Translate the following inference to logic notation: For all x, x_17 will not take a plane. For all x, x_17 will take a plane or x_17 is rich. There is at least one x for which x_17 is rich if and only if x_17 is a police officer. For all x, if x_17 drives a car, then x_17 is not a police officer. Therefore there is at least one x for which x_17 will not drive a car.
forall x: ~P(x). forall x: P(x) or Q(x). exists x: Q(x) <-> R(x). forall x: S(x) -> ~R(x). Therefore exists x: ~S(x).