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