For any twotermsorformulas without quantifiers and , the following holds. (i) The unification algorithm , applied to , , terminates after a finite number of steps. (ii) is unifiable iff so indicates upon termination. Moreover, the substitution σ then available as output is a most general unifier of .