Translate the following inference to logic notation: For all x, if x_11 reads a book, then x_11 is cooking. There is at least one x for which if x_11 cooks, then x_11 is reading a book. For all x, if x_11 cooks, then x_11 is fast. For all x, x_11 is not fast. For all x, if x_11 cooks, then x_11 is reading a book. Therefore there is at least one x for which x_11 will not read a book.
forall x: P(x) -> Q(x). exists x: Q(x) -> P(x). forall x: Q(x) -> R(x). forall x: ~R(x). forall x: Q(x) -> P(x). Therefore exists x: ~P(x).