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