Translate the following inference to logic notation: For all x, if x_7 reads a book, then x_7 is sleeping. There is at least one x for which if x_7 drives a car, then x_7 is reading a book. For all x, x_7 will drive a car or x_7 will not cook. Therefore there is at least one x for which if x_7 cooks, then x_7 is sleeping.
forall x: P(x) -> Q(x). exists x: R(x) -> P(x). forall x: R(x) or ~S(x). Therefore exists x: S(x) -> Q(x).