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