Translate the following inference to logic notation: There is at least one x for which z is poor or z will not go running. For all x, if z climbs a mountain, then z is running. For all x, if z goes running, then z is climbing a mountain. Therefore there is at least one x for which if z climbs a mountain, then z is poor.
exists x: P(x) or ~Q(x). forall x: R(x) -> Q(x). forall x: Q(x) -> R(x). Therefore exists x: R(x) -> P(x).