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