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