Translate the following inference to logic notation: For all x, x is not a server. For all x, x is a taxi driver if and only if x will drive a car. There is at least one x for which x is a server if and only if x will drive a car. Therefore there is at least one x for which x is not a taxi driver.
forall x: ~P(x). forall x: Q(x) <-> R(x). exists x: P(x) <-> R(x). Therefore exists x: ~Q(x).