Translate the following inference to logic notation: For all x, x_18 will climb a mountain or x_18 will work. There is at least one x for which x_18 is not a poet. For all x, x_18 will take a plane. For all x, if x_18 climbs a mountain, then x_18 is a poet. For all x, if x_18 were a poet, then x_18 is climbing a mountain. Therefore there is at least one x for which x_18 will work and x_18 will take a plane.
forall x: P(x) or Q(x). exists x: ~R(x). forall x: S(x). forall x: P(x) -> R(x). forall x: R(x) -> P(x). Therefore exists x: Q(x) and S(x).