Translate the following inference to logic notation: For all x, x_6 will play a game or x_6 will play tennis. For all x, if x_6 were poor, then x_6 is climbing a mountain. For all x, x_6 will not play a game or x_6 is poor. For all x, if x_6 plays tennis, then x_6 is climbing a mountain. Therefore Linda is climbing a mountain.
forall x: P(x) or Q(x). forall x: R(x) -> S(x). forall x: ~P(x) or R(x). forall x: Q(x) -> S(x). Therefore S(a).