Translate the following inference to logic notation: For all x, x_10 is a server or x_10 is not excited. For all x, if x_10 makes tea, then x_10 is a lawyer. For all x, x_10 is excited or x_10 will make tea. For all x, x_10 is a server or x_10 is not a lawyer. Therefore for all x, x_10 is a server.
forall x: P(x) or ~Q(x). forall x: R(x) -> S(x). forall x: Q(x) or R(x). forall x: P(x) or ~S(x). Therefore forall x: P(x).