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