Translate the following inference to logic notation: For all x, x_8 is a lawyer or x_8 is curious. For all x, x_8 is happy. For all x, if x_8 were curious, then x_8 is a server. For all x, x_8 is a server if and only if x_8 is a lawyer. Therefore for all x, x_8 is a server and x_8 is happy.
forall x: P(x) or Q(x). forall x: R(x). forall x: Q(x) -> S(x). forall x: S(x) <-> P(x). Therefore forall x: S(x) and R(x).