Proof. Let n be a total number of distinct variables, p be a total number of
symbols and q be a total size of input terms. During unification no new vertex
...
Proof. Let n be a total number of distinct variables, p be a total number of
symbols and q be a total size of input terms. During unification no new vertex
...