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