Translate the following inference to logic notation: For all x, if x_4 cooks, then x_4 is making tea. There is at least one x for which x_4 will go running. For all x, x_4 will cook or x_4 will read a book. For all x, if x_4 reads a book, then x_4 is making tea. Therefore there is at least one x for which x_4 will go running and x_4 will make tea.
forall x: P(x) -> Q(x). exists x: R(x). forall x: P(x) or S(x). forall x: S(x) -> Q(x). Therefore exists x: R(x) and Q(x).