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