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