Translate the following inference to logic notation: For all x, if x_10 were poor, then x_10 is playing a game. For all x, x_10 will read a book if and only if x_10 will drink water. There is at least one x for which x_10 is not poor. For all x, if x_10 drinks water, then x_10 is poor. For all x, if x_10 plays a game, then x_10 is drinking water. Therefore there is at least one x for which x_10 will not read a book.
forall x: P(x) -> Q(x). forall x: R(x) <-> S(x). exists x: ~P(x). forall x: S(x) -> P(x). forall x: Q(x) -> S(x). Therefore exists x: ~R(x).