Translate the following inference to logic notation: There is at least one x for which z will drive a car or z will climb a mountain. For all x, z will play squash if and only if z is bored. For all x, if z drives a car, then z is bored. For all x, if z climbs a mountain, then z is playing squash. Therefore there is at least one x for which z will play squash.
exists x: P(x) or Q(x). forall x: R(x) <-> S(x). forall x: P(x) -> S(x). forall x: Q(x) -> R(x). Therefore exists x: R(x).