Translate the following inference to logic notation: For all x, x will drink water or x will climb a mountain. For all x, if x drinks water, then x is a taxi driver. For all x, if x were a taxi driver, then x is drinking water. There is at least one x for which if x climbs a mountain, then x is a taxi driver. Therefore there is at least one x for which x is a taxi driver.
forall x: P(x) or Q(x). forall x: P(x) -> R(x). forall x: R(x) -> P(x). exists x: Q(x) -> R(x). Therefore exists x: R(x).