Translate the following inference to logic notation: For all x, if x_9 makes tea, then x_9 is not a server. For all x, x_9 will work. There is at least one x for which x_9 is a mechanic if and only if x_9 will make tea. For all x, x_9 is a server. Therefore there is at least one x for which x_9 is not a mechanic.
forall x: P(x) -> ~Q(x). forall x: R(x). exists x: S(x) <-> P(x). forall x: Q(x). Therefore exists x: ~S(x).