2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
12 (* $Id: index.mli 9822 2009-06-03 15:37:06Z tassi $ *)
14 module Superposition (B : Terms.Blob) =
16 module IDX = Index.Index(B)
17 module Unif = FoUnif.Founif(B)
18 module Subst = FoSubst (*.Subst(B)*)
19 module Order = Orderings.Orderings(B)
20 module Utils = FoUtils.Utils(B)
23 exception Success of B.t Terms.bag * int * B.t Terms.unit_clause
26 () (* prerr_endline s *)
29 let rec list_first f = function
31 | x::tl -> match f x with Some _ as x -> x | _ -> list_first f tl
34 let first_position pos ctx t f =
35 let rec aux pos ctx = function
36 | Terms.Leaf _ as t -> f t pos ctx
39 match f t pos ctx with
42 let rec first pre post = function
45 let newctx = fun x -> ctx (Terms.Node (pre@[x]@post)) in
46 match aux (List.length pre :: pos) newctx t with
49 if post = [] then None (* tl is also empty *)
50 else first (pre @ [t]) (List.tl post) tl
52 first [] (List.tl l) l
57 let all_positions pos ctx t f =
58 let rec aux pos ctx = function
59 | Terms.Leaf _ as t -> f t pos ctx
64 (fun (acc,pre,post) t -> (* Invariant: pre @ [t] @ post = l *)
65 let newctx = fun x -> ctx (Terms.Node (pre@[x]@post)) in
66 let acc = aux (List.length pre :: pos) newctx t @ acc in
67 if post = [] then acc, l, []
68 else acc, pre @ [t], List.tl post)
69 (f t pos ctx, [], List.tl l) l
77 let rec aux acc = function
79 | Terms.Var i -> if (List.mem i acc) then acc else i::acc
80 | Terms.Node l -> List.fold_left aux acc l
84 let build_clause bag filter rule t subst vl id id2 pos dir =
85 let proof = Terms.Step(rule,id,id2,dir,pos,subst) in
86 let t = Subst.apply_subst subst t in
90 | Terms.Node [ Terms.Leaf eq ; ty; l; r ] when B.eq B.eqP eq ->
91 let o = Order.compare_terms l r in
92 Terms.Equation (l, r, ty, o)
93 | t -> Terms.Predicate t
96 Utils.add_to_bag bag (0, literal, vars_of_term t, proof)
100 ((*prerr_endline ("Filtering: " ^ Pp.pp_foterm t);*)None)
104 (* ============ simplification ================= *)
106 let demod table varlist subterm pos context =
107 let cands = IDX.DT.retrieve_generalizations table subterm in
109 (fun (dir, (id,lit,vl,_)) ->
111 | Terms.Predicate _ -> assert false
112 | Terms.Equation (l,r,_,o) ->
113 let side, newside = if dir=Terms.Left2Right then l,r else r,l in
116 Unif.unification (varlist@vl) varlist subterm side
118 if o = Terms.Incomparable then
119 let side = Subst.apply_subst subst side in
120 let newside = Subst.apply_subst subst newside in
121 let o = Order.compare_terms newside side in
122 (* Riazanov, pp. 45 (ii) *)
124 Some (context newside, subst, varlist, id, pos, dir)
126 ((*prerr_endline ("Filtering: " ^
127 Pp.pp_foterm side ^ " =(< || =)" ^
128 Pp.pp_foterm newside ^ " coming from " ^
129 Pp.pp_unit_clause uc );*)None)
131 Some (context newside, subst, varlist, id, pos, dir)
132 with FoUnif.UnificationFailure _ -> None)
133 (IDX.ClauseSet.elements cands)
136 (* XXX: possible optimization, if the literal has a "side" already
137 * in normal form we should not traverse it again *)
138 let demodulate_once bag (id, literal, vl, pr) table =
139 (* debug ("Demodulating : " ^ (Pp.pp_unit_clause (id, literal, vl, pr)));*)
142 | Terms.Predicate t -> t
143 | Terms.Equation (l,r,ty,_) -> Terms.Node [ Terms.Leaf B.eqP; ty; l; r ]
145 match first_position [] (fun x -> x) t (demod table vl) with
147 | Some (newt, subst, varlist, id2, pos, dir) ->
148 build_clause bag (fun _ -> true) Terms.Demodulation
149 newt subst varlist id id2 pos dir
152 let rec demodulate bag clause table =
153 match demodulate_once bag clause table with
154 | None -> bag, clause
155 | Some (bag, clause) -> demodulate bag clause table
159 let is_identity_clause = function
160 | _, Terms.Equation (_,_,_,Terms.Eq), _, _ -> true
161 | _, Terms.Predicate _, _, _ -> assert false
165 let is_subsumed ~unify (id, lit, vl, _) table =
167 | Terms.Predicate _ -> assert false
168 | Terms.Equation (l,r,ty,_) ->
169 let retrieve = if unify then IDX.DT.retrieve_unifiables
170 else IDX.DT.retrieve_generalizations in
171 let lcands = retrieve table l in
172 let rcands = retrieve table r in
176 | (d, (_,Terms.Equation (l,r,ty,_),vl,_))-> d, l, r, vl
179 let l, r = if (dir = Terms.Left2Right) = b then l,r else r,l in
180 Terms.Node [ Terms.Leaf B.eqP; ty; l; r ], vl
182 let cands1 = List.map (f true) (IDX.ClauseSet.elements lcands) in
183 let cands2 = List.map (f false) (IDX.ClauseSet.elements rcands) in
184 let t = Terms.Node [ Terms.Leaf B.eqP; ty; l; r ] in
185 let locked_vars = if unify then [] else vl in
188 try ignore(Unif.unification (vl@vl1) locked_vars c t); true
189 with FoUnif.UnificationFailure _ -> false)
193 (* demodulate and check for subsumption *)
194 let simplify table bag clause =
195 let bag, clause = demodulate bag clause table in
196 if is_identity_clause clause then None
198 if is_subsumed ~unify:false clause table then None
199 else Some (bag, clause)
202 let one_pass_simplification new_clause (alist,atable) bag =
203 match simplify atable bag new_clause with
204 | None -> None (* new_clause has been discarded *)
205 | Some (bag, clause) ->
206 let ctable = IDX.index_unit_clause IDX.DT.empty clause in
207 let bag, alist, atable =
209 (fun (bag, alist, atable as acc) c ->
210 match simplify ctable bag c with
211 |None -> acc (* an active clause as been discarded *)
213 bag, c :: alist, IDX.index_unit_clause atable c)
214 (bag,[],IDX.DT.empty) alist
216 Some (clause, bag, (alist,atable))
219 let simplification_step ~new_cl cl (alist,atable) bag new_clause =
221 if new_cl then atable else
222 IDX.index_unit_clause atable cl
224 (* Simplification of new_clause with : *
225 * - actives and cl if new_clause is not cl *
226 * - only actives otherwise *)
227 match simplify atable1 bag new_clause with
228 | None -> (Some cl, None) (* new_clause has been discarded *)
229 | Some (bag, clause) ->
230 (* Simplification of each active clause with clause *
231 * which is the simplified form of new_clause *)
232 let ctable = IDX.index_unit_clause IDX.DT.empty clause in
233 let bag, newa, alist, atable =
235 (fun (bag, newa, alist, atable as acc) c ->
236 match simplify ctable bag c with
237 |None -> acc (* an active clause as been discarded *)
240 bag, newa, c :: alist,
241 IDX.index_unit_clause atable c
243 bag, c1 :: newa, alist, atable)
244 (bag,[],[],IDX.DT.empty) alist
247 (Some cl, Some (clause, (alist,atable), newa, bag))
249 (* if new_clause is not cl, we simplify cl with clause *)
250 match simplify ctable bag cl with
252 (* cl has been discarded *)
253 (None, Some (clause, (alist,atable), newa, bag))
255 (Some cl1, Some (clause, (alist,atable), newa, bag))
258 let keep_simplified cl (alist,atable) bag =
259 let rec keep_simplified_aux ~new_cl cl (alist,atable) bag newc =
261 match simplification_step ~new_cl cl (alist,atable) bag cl with
262 | (None, _) -> assert false
263 | (Some _, None) -> None
264 | (Some _, Some (clause, (alist,atable), newa, bag)) ->
265 keep_simplified_aux ~new_cl:(cl!=clause) clause (alist,atable)
269 | [] -> Some (cl, bag, (alist,atable))
271 match simplification_step ~new_cl cl
272 (alist,atable) bag hd with
273 | (None,None) -> assert false
275 keep_simplified_aux ~new_cl cl (alist,atable) bag tl
276 | (None, Some _) -> None
277 | (Some cl1, Some (clause, (alist,atable), newa, bag)) ->
279 (clause::alist, IDX.index_unit_clause atable clause)
281 keep_simplified_aux ~new_cl:(cl!=cl1) cl1 (alist,atable)
284 keep_simplified_aux ~new_cl:true cl (alist,atable) bag []
287 (* this is like simplify but raises Success *)
288 let simplify_goal maxvar table bag clause =
289 let bag, clause = demodulate bag clause table in
290 if (is_identity_clause clause) || (is_subsumed ~unify:true clause table)
291 then raise (Success (bag, maxvar, clause))
295 (* =================== inference ===================== *)
297 (* this is OK for both the sup_left and sup_right inference steps *)
298 let superposition table varlist subterm pos context =
299 let cands = IDX.DT.retrieve_unifiables table subterm in
301 (fun (dir, (id,lit,vl,_ (*as uc*))) ->
303 | Terms.Predicate _ -> assert false
304 | Terms.Equation (l,r,_,o) ->
305 let side, newside = if dir=Terms.Left2Right then l,r else r,l in
308 Unif.unification (varlist@vl) [] subterm side
310 if o = Terms.Incomparable then
311 let side = Subst.apply_subst subst side in
312 let newside = Subst.apply_subst subst newside in
313 let o = Order.compare_terms side newside in
314 (* XXX: check Riazanov p. 33 (iii) *)
315 if o <> Terms.Lt && o <> Terms.Eq then
316 Some (context newside, subst, varlist, id, pos, dir)
318 ((*prerr_endline ("Filtering: " ^
319 Pp.pp_foterm side ^ " =(< || =)" ^
320 Pp.pp_foterm newside ^ " coming from " ^
321 Pp.pp_unit_clause uc );*)None)
323 Some (context newside, subst, varlist, id, pos, dir)
324 with FoUnif.UnificationFailure _ -> None)
325 (IDX.ClauseSet.elements cands)
328 let build_new_clause bag maxvar filter rule t subst vl id id2 pos dir =
329 let maxvar, vl, relocsubst = Utils.relocate maxvar vl in
330 let subst = Subst.concat relocsubst subst in
331 match build_clause bag filter rule t subst vl id id2 pos dir with
332 | Some (bag, c) -> Some ((bag, maxvar), c)
337 let fold_build_new_clause bag maxvar id rule filter res =
338 let (bag, maxvar), res =
339 HExtlib.filter_map_acc
340 (fun (bag, maxvar) (t,subst,vl,id2,pos,dir) ->
341 build_new_clause bag maxvar filter rule t subst vl id id2 pos dir)
347 (* Superposes selected equation with equalities in table *)
348 let superposition_with_table bag maxvar (id,selected,vl,_) table =
350 | Terms.Predicate _ -> assert false
351 | Terms.Equation (l,r,ty,Terms.Lt) ->
352 fold_build_new_clause bag maxvar id Terms.Superposition
355 (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; l; x ])
356 r (superposition table vl))
357 | Terms.Equation (l,r,ty,Terms.Gt) ->
358 fold_build_new_clause bag maxvar id Terms.Superposition
361 (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; x; r ])
362 l (superposition table vl))
363 | Terms.Equation (l,r,ty,Terms.Incomparable) ->
364 fold_build_new_clause bag maxvar id Terms.Superposition
365 (function (* Riazanov: p.33 condition (iv) *)
366 | Terms.Node [Terms.Leaf eq; ty; l; r ] when B.eq B.eqP eq ->
367 Order.compare_terms l r <> Terms.Eq
370 (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; l; x ])
371 r (superposition table vl)) @
373 (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; x; r ])
374 l (superposition table vl)))
378 (* the current equation is normal w.r.t. demodulation with atable
379 * (and is not the identity) *)
380 let infer_right bag maxvar current (alist,atable) =
381 (* We demodulate actives clause with current until all *
382 * active clauses are reduced w.r.t each other *)
383 (* let bag, (alist,atable) = keep_simplified (alist,atable) bag [current] in *)
384 let ctable = IDX.index_unit_clause IDX.DT.empty current in
385 (* let bag, (alist, atable) =
387 HExtlib.filter_map_acc (simplify ctable) bag alist
389 bag, (alist, List.fold_left IDX.index_unit_clause IDX.DT.empty alist)
391 debug "Simplified active clauses with fact";
392 (* We superpose active clauses with current *)
393 let bag, maxvar, new_clauses =
395 (fun (bag, maxvar, acc) active ->
396 let bag, maxvar, newc =
397 superposition_with_table bag maxvar active ctable
399 bag, maxvar, newc @ acc)
400 (bag, maxvar, []) alist
402 debug "First superpositions";
403 (* We add current to active clauses so that it can be *
404 * superposed with itself *)
406 current :: alist, IDX.index_unit_clause atable current
409 let fresh_current, maxvar = Utils.fresh_unit_clause maxvar current in
410 (* We need to put fresh_current into the bag so that all *
411 * variables clauses refer to are known. *)
412 let bag, fresh_current = Utils.add_to_bag bag fresh_current in
413 (* We superpose current with active clauses *)
414 let bag, maxvar, additional_new_clauses =
415 superposition_with_table bag maxvar fresh_current atable
417 debug "Another superposition";
418 let new_clauses = new_clauses @ additional_new_clauses in
419 let bag, new_clauses =
420 HExtlib.filter_map_acc (simplify atable) bag new_clauses
422 debug "Demodulated new clauses";
423 bag, maxvar, (alist, atable), new_clauses
426 let infer_left bag maxvar goal (_alist, atable) =
427 (* We superpose the goal with active clauses *)
428 let bag, maxvar, new_goals =
429 superposition_with_table bag maxvar goal atable
431 (* We demodulate the goal with active clauses *)
435 let bag, g = demodulate bag g atable in
439 bag, maxvar, List.rev new_goals