Abstract Classically, in saturation-based proof systems, unification has been considered atomic. However, it is also possible to move the calculus level, turning steps of algorithm into inferences. For calculi that rely on procedures returning large or even infinite sets unifiers, integrating an attractive method dovetailing and inference. This applies, for example, AC-superposition higher-orde...