Translate the following inference to logic notation: For all x, x_8 will climb a mountain or x_8 will make tea. For all x, if x_8 climbs a mountain, then x_8 is curious. For all x, x_8 will go running. There is at least one x for which if x_8 makes tea, then x_8 is curious. Therefore there is at least one x for which x_8 is curious and x_8 will go running.
forall x: P(x) or Q(x). forall x: P(x) -> R(x). forall x: S(x). exists x: Q(x) -> R(x). Therefore exists x: R(x) and S(x).