Translate the following inference to logic notation: For all x, x_5 is not a poet. For all x, if x_5 sleeps, then x_5 is a poet. For all x, x_5 will sleep or x_5 is not curious. Therefore for all x, x_5 is not curious.
forall x: ~P(x). forall x: Q(x) -> P(x). forall x: Q(x) or ~R(x). Therefore forall x: ~R(x).