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