Translate the following inference to logic notation: For all x, if x_6 cooks, then x_6 is playing tennis. For all x, if x_6 were a server, then x_6 is playing tennis. For all x, x_6 is not sad or x_6 is a server. For all x, if x_6 were a janitor, then x_6 is not playing tennis. For all x, x_6 is sad or x_6 will cook. Therefore for all x, x_6 is not a janitor.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: ~S(x) or R(x). forall x: T(x) -> ~Q(x). forall x: S(x) or P(x). Therefore forall x: ~T(x).