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