Translate the following inference to logic notation: There is at least one x for which if x_5 takes a plane, then x_5 is climbing a mountain. For all x, if x_5 climbs a mountain, then x_5 is a carpenter. For all x, x_5 will take a plane or x_5 is a writer. For all x, if x_5 drinks water, then x_5 is a carpenter. For all x, if x_5 were a writer, then x_5 is drinking water. Therefore there is at least one x for which x_5 is a carpenter.
exists x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: P(x) or S(x). forall x: T(x) -> R(x). forall x: S(x) -> T(x). Therefore exists x: R(x).