Translate the following inference to logic notation: For all x, if x_16 climbs a mountain, then x_16 is a janitor. For all x, x_16 is a sailor if and only if x_16 will drive a car. There is at least one x for which if x_16 were a janitor, then x_16 is not a sailor. For all x, x_16 will drive a car. Therefore there is at least one x for which x_16 will not climb a mountain.
forall x: P(x) -> Q(x). forall x: R(x) <-> S(x). exists x: Q(x) -> ~R(x). forall x: S(x). Therefore exists x: ~P(x).