Translate the following inference to logic notation: There is at least one x for which if x plays squash, then x is running. For all x, x will not climb a mountain. For all x, x will play squash if and only if x will climb a mountain. For all x, if x goes running, then x is playing squash. Therefore there is at least one x for which x will not go running.
exists x: P(x) -> Q(x). forall x: ~R(x). forall x: P(x) <-> R(x). forall x: Q(x) -> P(x). Therefore exists x: ~Q(x).