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