Translate the following inference to logic notation: For all x, if y were curious, then y is making tea. For all x, if y sleeps, then y is making tea. For all x, y is curious or y will sleep. For all x, if y makes tea, then y is curious. Therefore for all x, y will make tea.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: P(x) or R(x). forall x: Q(x) -> P(x). Therefore forall x: Q(x).