Translate the following inference to logic notation: For all x, if x_5 were a lawyer, then x_5 is making tea. For all x, if x_5 makes tea, then x_5 is excited. For all x, if x_5 were excited, then x_5 is not playing squash. For all x, x_5 will play squash. Therefore for all x, x_5 is not a lawyer.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> ~S(x). forall x: S(x). Therefore forall x: ~P(x).