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