Translate the following inference to logic notation: For all x, x_10 will climb a mountain. For all x, if x_10 cooks, then x_10 is curious. There is at least one x for which x_10 will cook. Therefore there is at least one x for which x_10 is curious.
forall x: P(x). forall x: Q(x) -> R(x). exists x: Q(x). Therefore exists x: R(x).