Translate the following inference to logic notation: For all x, x_9 will take a plane or x_9 will sleep. There is at least one x for which if x_9 takes a plane, then x_9 is a poet. For all x, x_9 is not a poet. For all x, if x_9 were a poet, then x_9 is taking a plane. Therefore there is at least one x for which x_9 will sleep.
forall x: P(x) or Q(x). exists x: P(x) -> R(x). forall x: ~R(x). forall x: R(x) -> P(x). Therefore exists x: Q(x).