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