Translate the following inference to logic notation: For all x, if x_4 were a musician, then x_4 is climbing a mountain. For all x, x_4 will climb a mountain or x_4 will not play squash. For all x, if x_4 were a lawyer, then x_4 is a musician. For all x, if x_4 climbs a mountain, then x_4 is working. There is at least one x for which x_4 will play squash or x_4 is a lawyer. Therefore there is at least one x for which x_4 will work.
forall x: P(x) -> Q(x). forall x: Q(x) or ~R(x). forall x: S(x) -> P(x). forall x: Q(x) -> T(x). exists x: R(x) or S(x). Therefore exists x: T(x).