Translate the following inference to logic notation: For all x, x_1 will make tea. There is at least one x for which x_1 will not make tea. Therefore there is at least one x for which x_1 will cook.
forall x: P(x). exists x: ~P(x). Therefore exists x: Q(x).