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