Translate the following inference to logic notation: For all x, if x_5 were curious, then x_5 is making tea. There is at least one x for which x_5 is curious or x_5 will read a book. For all x, if x_5 makes tea, then x_5 is curious. For all x, if x_5 reads a book, then x_5 is making tea. Therefore there is at least one x for which x_5 will make tea.
forall x: P(x) -> Q(x). exists x: P(x) or R(x). forall x: Q(x) -> P(x). forall x: R(x) -> Q(x). Therefore exists x: Q(x).