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