Translate the following inference to logic notation: For all x, if x_15 works, then x_15 is making tea. For all x, if x_15 works, then x_15 is cooking. For all x, x_15 will cook or x_15 is not sad. There is at least one x for which if x_15 cooks, then x_15 is working. Therefore there is at least one x for which if x_15 were sad, then x_15 is making tea.
forall x: P(x) -> Q(x). forall x: P(x) -> R(x). forall x: R(x) or ~S(x). exists x: R(x) -> P(x). Therefore exists x: S(x) -> Q(x).