Translate the following inference to logic notation: For all x, if x were rich, then x is a server. For all x, x will go running or x is rich. There is at least one x for which if x goes running, then x is a server. Therefore there is at least one x for which x is a server.
forall x: P(x) -> Q(x). forall x: R(x) or P(x). exists x: R(x) -> Q(x). Therefore exists x: Q(x).