Translate the following inference to logic notation: For all x, if x_10 plays squash, then x_10 is excited. For all x, if x_10 were a doctor, then x_10 is playing squash. For all x, if x_10 were excited, then x_10 is a carpenter. For all x, x_10 is a server. For all x, if x_10 were a carpenter, then x_10 is a doctor. For all x, if x_10 were excited, then x_10 is not a server. Therefore for all x, x_10 will not play squash.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: Q(x) -> S(x). forall x: T(x). forall x: S(x) -> R(x). forall x: Q(x) -> ~T(x). Therefore forall x: ~P(x).