Translate the following inference to logic notation: For all x, if z were curious, then z is cooking. For all x, if z were a poet, then z is curious. For all x, if z cooks, then z is a poet. For all x, z is not curious. Therefore for all x, z is not a poet.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: Q(x) -> R(x). forall x: ~P(x). Therefore forall x: ~R(x).