Translate the following inference to logic notation: For all x, x_8 will make tea. For all x, x_8 is not fast. For all x, if x_8 makes tea, then x_8 is playing a game. There is at least one x for which x_8 is fast or x_8 will read a book. Therefore there is at least one x for which x_8 will play a game and x_8 will read a book.
forall x: P(x). forall x: ~Q(x). forall x: P(x) -> R(x). exists x: Q(x) or S(x). Therefore exists x: R(x) and S(x).