Translate the following inference to logic notation: For all x, x_6 is not a carpenter. For all x, if x_6 sleeps, then x_6 is making tea. For all x, x_6 will sleep. For all x, x_6 is a carpenter or x_6 is sad. Therefore for all x, x_6 is sad and x_6 will make tea.
forall x: ~P(x). forall x: Q(x) -> R(x). forall x: Q(x). forall x: P(x) or S(x). Therefore forall x: S(x) and R(x).