Translate the following inference to logic notation: For all x, if x_8 were happy, then x_8 is running. For all x, x_8 will make tea. For all x, if x_8 goes running, then x_8 is a poet. For all x, x_8 is happy. Therefore Karen is making tea.
forall x: P(x) -> Q(x). forall x: R(x). forall x: Q(x) -> S(x). forall x: P(x). Therefore R(a).