Translate the following inference to logic notation: For all x, x_6 is a poet or x_6 will not go running. For all x, x_6 is not a poet. For all x, if x_6 makes tea, then x_6 is running. Therefore for all x, x_6 will not make tea.
forall x: P(x) or ~Q(x). forall x: ~P(x). forall x: R(x) -> Q(x). Therefore forall x: ~R(x).