Translate the following inference to logic notation: For all x, if x_9 reads a book, then x_9 is a sailor. There is at least one x for which x_9 will work or x_9 will read a book. For all x, if x_9 plays a game, then x_9 is a sailor. For all x, if x_9 were a sailor, then x_9 is playing a game. For all x, if x_9 works, then x_9 is playing a game. Therefore there is at least one x for which x_9 is a sailor.
forall x: P(x) -> Q(x). exists x: R(x) or P(x). forall x: S(x) -> Q(x). forall x: Q(x) -> S(x). forall x: R(x) -> S(x). Therefore exists x: Q(x).