Translate the following inference to logic notation: For all x, if y makes tea, then x_1 is running. For all x, if x_1 were a lawyer, then y is making tea. For all x, x_1 will go running or x_1 is a lawyer. For all x, if x_1 goes running, then y is making tea. Therefore there is at least one x for which y will make tea.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: Q(x) or R(x). forall x: Q(x) -> P(x). Therefore exists x: P(x).