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