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