Translate the following inference to logic notation: For all x, if y_3 goes running, then y_3 is climbing a mountain. There is at least one x for which if y_3 were a musician, then y_3 is playing squash. For all x, if y_3 were a politician, then y_3 is running. For all x, if y_3 climbs a mountain, then y_3 is a musician. Therefore there is at least one x for which if y_3 were a politician, then y_3 is playing squash.
forall x: P(x) -> Q(x). exists x: R(x) -> S(x). forall x: T(x) -> P(x). forall x: Q(x) -> R(x). Therefore exists x: T(x) -> S(x).