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