Translate the following inference to logic notation: For all x, x_5 is a scientist. There is at least one x for which if x_5 climbs a mountain, then x_5 is not driving a car. For all x, if x_5 were happy, then x_5 is driving a car. For all x, if x_5 were a scientist, then x_5 is driving a car. Therefore there is at least one x for which x_5 will not climb a mountain.
forall x: P(x). exists x: Q(x) -> ~R(x). forall x: S(x) -> R(x). forall x: P(x) -> R(x). Therefore exists x: ~Q(x).