Translate the following inference to logic notation: For all x, if x_7 climbs a mountain, then x_7 is a janitor. For all x, x_7 is not a lawyer or x_7 will play squash. For all x, if x_7 plays squash, then x_7 is climbing a mountain. For all x, if x_7 were a janitor, then x_7 is climbing a mountain. For all x, x_7 is a lawyer or x_7 is a janitor. Therefore for all x, x_7 will climb a mountain.
forall x: P(x) -> Q(x). forall x: ~R(x) or S(x). forall x: S(x) -> P(x). forall x: Q(x) -> P(x). forall x: R(x) or Q(x). Therefore forall x: P(x).