Translate the following inference to logic notation: For all x, if x_17 were a taxi driver, then x_17 is not a carpenter. For all x, x_17 is rich or x_17 is a carpenter. For all x, x_17 is rich if and only if x_17 will climb a mountain. There is at least one x for which x_17 will not climb a mountain. Therefore there is at least one x for which x_17 is not a taxi driver.
forall x: P(x) -> ~Q(x). forall x: R(x) or Q(x). forall x: R(x) <-> S(x). exists x: ~S(x). Therefore exists x: ~P(x).