(* $Id$ *)
-module Index(B : Terms.Blob) = struct
+module Index(B : Orderings.Blob) = struct
module U = FoUtils.Utils(B)
+ module Unif = FoUnif.Founif(B)
+ module Pp = Pp.Pp(B)
module ClauseOT =
struct
type data = ClauseSet.elt and
type dataset = ClauseSet.t
= Make(FotermIndexable)(ClauseSet)
-
- let index_unit_clause t = function
+
+ let index_unit_clause maxvar t = function
| (_,Terms.Equation (l,_,_,Terms.Gt),_,_) as c ->
DT.index t l (Terms.Left2Right, c)
| (_,Terms.Equation (_,r,_,Terms.Lt),_,_) as c ->
DT.index t r (Terms.Right2Left, c)
- | (_,Terms.Equation (l,r,_,Terms.Incomparable),_,_) as c ->
+ | (_,Terms.Equation (l,r,_,Terms.Incomparable),vl,_) as c ->
+(* if are_invertible maxvar vl l r then
+ (prerr_endline ("Invertible " ^ (Pp.pp_foterm l) ^ "=" ^
+ (Pp.pp_foterm r));
+ DT.index t l (Terms.Left2Right, c))
+ else *)
DT.index
(DT.index t l (Terms.Left2Right, c))
r (Terms.Right2Left, c)
+ | (_,Terms.Equation (l,r,_,Terms.Invertible),vl,_) as c ->
+ DT.index t l (Terms.Left2Right, c)
| (_,Terms.Equation (_,r,_,Terms.Eq),_,_) -> assert false
| (_,Terms.Predicate p,_,_) as c ->
DT.index t p (Terms.Nodir, c)
;;
+ type active_set = B.t Terms.unit_clause list * DT.t
+
end