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