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