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