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