Translate the following inference to logic notation: For all x, if y were a poet, then y is drinking water. There is at least one x for which if y cooks, then y is a poet. For all x, y is not a poet. For all x, if y drinks water, then y is cooking. Therefore there is at least one x for which y will not drink water.
forall x: P(x) -> Q(x). exists x: R(x) -> P(x). forall x: ~P(x). forall x: Q(x) -> R(x). Therefore exists x: ~Q(x).