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