module IDX = Index.Index(B)
module Unif = FoUnif.Founif(B)
module Subst = FoSubst.Subst(B)
+ module Order = Orderings.Orderings(B)
let all_positions t f =
let rec aux pos ctx = function
let r = Subst.apply_subst subst r in
let l = Subst.apply_subst subst l in
let ty = Subst.apply_subst subst ty in
- (0, Terms.Equation (l,r,ty,Terms.Incomparable), vl, proof))
+ let o = Order.compare_terms l r in
+ (* can unif compute the right vl for both sides? *)
+ (0, Terms.Equation (l,r,ty,o), vl, proof))
res
in
(* fresh ID and metas and compute orientataion of new_clauses *)