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