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