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