type 'a substitution = (int * 'a foterm) list
-type comparison = Lt | Eq | Gt | Incomparable
+type comparison = Lt | Eq | Gt | Incomparable | Invertible
-type rule = SuperpositionRight | SuperpositionLeft | Demodulation
+type rule = Superposition | Demodulation
+
+(* A Discrimination tree is a map: foterm |-> (dir, clause) *)
type direction = Left2Right | Right2Left | Nodir
+
type position = int list
type 'a proof =
type 'a passive_clause = int * 'a unit_clause (* weight * equation *)
+val is_eq_clause : 'a unit_clause -> bool
+val vars_of_term : 'a foterm -> int list
+
module M : Map.S with type key = int
-type 'a bag = 'a unit_clause M.t
+type 'a bag = int (* max ID *)
+ * (('a unit_clause * bool * int) M.t)
+
+(* also gives a fresh ID to the clause *)
+ val add_to_bag :
+ 'a unit_clause -> 'a bag ->
+ 'a bag * 'a unit_clause
+
+ val replace_in_bag :
+ 'a unit_clause * bool * int -> 'a bag ->
+ 'a bag
+
+ val get_from_bag :
+ int -> 'a bag -> 'a unit_clause * bool * int
+
+ val empty_bag : 'a bag
module type Blob =
sig
type t
val eq : t -> t -> bool
val compare : t -> t -> int
- val is_eq_predicate : t -> bool
+ val eqP : t
(* TODO: consider taking in input an imperative buffer for Format
* val pp : Format.formatter -> t -> unit
* *)
+ val is_eq : t foterm -> (t foterm * t foterm * t foterm) option
val pp : t -> string
- val embed : t -> t foterm
+ type input
+ val embed : input -> t foterm
(* saturate [proof] [type] -> [proof] * [type] *)
- val saturate : t -> t -> t foterm * t foterm
+ val saturate : input -> input -> t foterm * t foterm
+
end