Translate the following inference to logic notation: There is at least one x for which if x_7 were an electrician, then x_7 is running. For all x, x_7 is an electrician or x_7 will climb a mountain. For all x, x_7 is a taxi driver. For all x, if x_7 climbs a mountain, then x_7 is running. Therefore there is at least one x for which x_7 is a taxi driver and x_7 will go running.
exists x: P(x) -> Q(x). forall x: P(x) or R(x). forall x: S(x). forall x: R(x) -> Q(x). Therefore exists x: S(x) and Q(x).