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