Translate the following inference to logic notation: For all x, if x_8 were excited, then x_8 is poor. For all x, x_8 is not poor. For all x, if x_8 makes tea, then x_8 is excited. There is at least one x for which if x_8 reads a book, then x_8 is making tea. For all x, if x_8 were poor, then x_8 is reading a book. Therefore there is at least one x for which x_8 will not make tea.
forall x: P(x) -> Q(x). forall x: ~Q(x). forall x: R(x) -> P(x). exists x: S(x) -> R(x). forall x: Q(x) -> S(x). Therefore exists x: ~R(x).