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