Translate the following inference to logic notation: For all x, x_11 will play tennis or x_11 is not a writer. For all x, x_11 is not a doctor. For all x, if x_11 were a server, then x_11 is a writer. For all x, if x_11 plays tennis, then x_11 is a server. For all x, x_11 is a doctor if and only if x_11 is a server. Therefore for all x, x_11 will not play tennis.
forall x: P(x) or ~Q(x). forall x: ~R(x). forall x: S(x) -> Q(x). forall x: P(x) -> S(x). forall x: R(x) <-> S(x). Therefore forall x: ~P(x).