Translate the following inference to logic notation: For all x, y is not a server. There is at least one x for which y is a server and y is a politician. Therefore there is at least one x for which y will go running.
forall x: ~P(x). exists x: P(x) and Q(x). Therefore exists x: R(x).