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