(* $Id: terms.ml 9836 2009-06-05 15:33:35Z denes $ *)
+let rec lexicograph f l1 l2 =
+ match l1, l2 with
+ | [], [] -> 0
+ | x::xs, y::ys ->
+ let c = f x y in
+ if c <> 0 then c else lexicograph f xs ys
+ | [],_ -> ~-1
+ | _,[] -> 1
+;;
+
+let mk_id =
+ let id = ref 0 in
+ fun () -> incr id; !id
+;;
module Utils (B : Terms.Blob) = struct
- module Subst = FoSubst.Subst(B) ;;
+ module Subst = FoSubst;; (*.Subst(B) ;;*)
module Order = Orderings.Orderings(B) ;;
let rec eq_foterm x y =
| _ -> false
;;
- let rec lexicograph f l1 l2 =
- match l1, l2 with
- | [], [] -> 0
- | x::xs, y::ys ->
- let c = f x y in
- if c <> 0 then c else lexicograph f xs ys
- | [],_ -> ~-1
- | _,[] -> 1
- ;;
let rec compare_foterm x y =
match x, y with
;;
(* may be moved inside the bag *)
- let mk_id =
- let id = ref 0 in
- fun () -> incr id; !id
- ;;
-
let mk_unit_clause maxvar ty proofterm =
let varlist =
let rec aux acc = function
fresh_unit_clause maxvar (mk_id (), lit, varlist, proof)
;;
- let add_to_bag =
- let id = ref 0 in
- fun bag (_,lit,vl,proof) ->
- incr id;
- let clause = (!id, lit, vl, proof) in
- let bag = Terms.M.add !id clause bag in
+ let add_to_bag bag (_,lit,vl,proof) =
+ let id = mk_id () in
+ let clause = (id, lit, vl, proof) in
+ let bag = Terms.M.add id clause bag in
bag, clause
;;
let empty_bag = Terms.M.empty ;;
+ let mk_passive_clause cl =
+ (Order.compute_unit_clause_weight cl, cl)
+ ;;
+
+ let compare_passive_clauses_weight (w1,(id1,_,_,_)) (w2,(id2,_,_,_)) =
+ if w1 = w2 then id1 - id2
+ else w1 - w2
+ ;;
+
+ let compare_passive_clauses_age (_,(id1,_,_,_)) (_,(id2,_,_,_)) =
+ id1 - id2
+ ;;
+
end