Translate the following inference to logic notation: For all x, x_8 will make tea or x_8 is a poet. For all x, if x_8 makes tea, then x_8 is bored. For all x, x_8 is a nurse if and only if x_8 is happy. For all x, if x_8 were a nurse, then x_8 is not bored. For all x, if x_8 were a poet, then x_8 is bored. Therefore for all x, x_8 is not happy.
forall x: P(x) or Q(x). forall x: P(x) -> R(x). forall x: S(x) <-> T(x). forall x: S(x) -> ~R(x). forall x: Q(x) -> R(x). Therefore forall x: ~T(x).