Translate the following inference to logic notation: For all x, x_15 is poor. There is at least one x for which x_15 will play tennis if and only if x_15 will work. For all x, x_15 will work or x_15 will not climb a mountain. For all x, if x_15 plays tennis, then x_15 is not poor. For all x, if x_15 works, then x_15 is climbing a mountain. Therefore there is at least one x for which x_15 will not climb a mountain.
forall x: P(x). exists x: Q(x) <-> R(x). forall x: R(x) or ~S(x). forall x: Q(x) -> ~P(x). forall x: R(x) -> S(x). Therefore exists x: ~S(x).