Translate the following inference to logic notation: For all x, x_12 will climb a mountain or x_12 is a server. For all x, if x_12 were a server, then x_12 is a carpenter. There is at least one x for which if x_12 climbs a mountain, then x_12 is not an office clerk. For all x, x_12 is an office clerk. Therefore there is at least one x for which x_12 is a carpenter.
forall x: P(x) or Q(x). forall x: Q(x) -> R(x). exists x: P(x) -> ~S(x). forall x: S(x). Therefore exists x: R(x).