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