Translate the following inference to logic notation: For all x, if x_9 climbs a mountain, then x_9 is a writer. For all x, if x_9 drives a car, then x_9 is curious. For all x, if x_9 were a writer, then x_9 is curious. For all x, x_9 will climb a mountain. Therefore Michael is curious.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: Q(x) -> S(x). forall x: P(x). Therefore S(a).