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