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