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