Translate the following inference to logic notation: For all x, y_4 will go running or y_4 will not make tea. For all x, y_4 will not make tea. For all x, if y_4 goes running, then y_4 is making tea. Therefore for all x, y_4 will not go running.
forall x: P(x) or ~Q(x). forall x: ~Q(x). forall x: P(x) -> Q(x). Therefore forall x: ~P(x).