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