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