Translate the following inference to logic notation: For all x, if x_8 were a janitor, then x_8 is making tea. For all x, x_8 will climb a mountain if and only if x_8 is a lawyer. For all x, if x_8 climbs a mountain, then x_8 is not making tea. For all x, x_8 is a poet or x_8 is a janitor. For all x, if x_8 were a poet, then x_8 is making tea. Therefore for all x, x_8 is not a lawyer.
forall x: P(x) -> Q(x). forall x: R(x) <-> S(x). forall x: R(x) -> ~Q(x). forall x: T(x) or P(x). forall x: T(x) -> Q(x). Therefore forall x: ~S(x).