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