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
25 let debug s = prerr_endline s;;
28 let rec list_first f = function
30 | x::tl -> match f x with Some _ as x -> x | _ -> list_first f tl
33 let first_position pos ctx t f =
34 let rec aux pos ctx = function
35 | Terms.Leaf _ as t -> f t pos ctx
38 match f t pos ctx with
41 let rec first pre post = function
44 let newctx = fun x -> ctx (Terms.Node (pre@[x]@post)) in
45 match aux (List.length pre :: pos) newctx t with
48 if post = [] then None (* tl is also empty *)
49 else first (pre @ [t]) (List.tl post) tl
51 first [] (List.tl l) l
56 let all_positions pos ctx t f =
57 let rec aux pos ctx = function
58 | Terms.Leaf _ as t -> f t pos ctx
63 (fun (acc,pre,post) t -> (* Invariant: pre @ [t] @ post = l *)
64 let newctx = fun x -> ctx (Terms.Node (pre@[x]@post)) in
65 let acc = aux (List.length pre :: pos) newctx t @ acc in
66 if post = [] then acc, l, []
67 else acc, pre @ [t], List.tl post)
68 (f t pos ctx, [], List.tl l) l
76 let rec aux acc = function
78 | Terms.Var i -> if (List.mem i acc) then acc else i::acc
79 | Terms.Node l -> List.fold_left aux acc l
83 let build_clause bag filter rule t subst vl id id2 pos dir =
84 let proof = Terms.Step(rule,id,id2,dir,pos,subst) in
85 let t = Subst.apply_subst subst t in
89 | Terms.Node [ Terms.Leaf eq ; ty; l; r ] when B.eq B.eqP eq ->
90 let o = Order.compare_terms l r in
91 Terms.Equation (l, r, ty, o)
92 | t -> Terms.Predicate t
95 Utils.add_to_bag bag (0, literal, vars_of_term t, proof)
99 ((*prerr_endline ("Filtering: " ^ Pp.pp_foterm t);*)None)
103 (* ============ simplification ================= *)
105 let demod table varlist subterm pos context =
106 let cands = IDX.DT.retrieve_generalizations table subterm in
108 (fun (dir, (id,lit,vl,_)) ->
110 | Terms.Predicate _ -> assert false
111 | Terms.Equation (l,r,_,o) ->
112 let side, newside = if dir=Terms.Left2Right then l,r else r,l in
115 Unif.unification (varlist@vl) varlist subterm side
117 if o = Terms.Incomparable then
118 let side = Subst.apply_subst subst side in
119 let newside = Subst.apply_subst subst newside in
120 let o = Order.compare_terms newside side in
121 (* Riazanov, pp. 45 (ii) *)
123 Some (context newside, subst, varlist, id, pos, dir)
125 ((*prerr_endline ("Filtering: " ^
126 Pp.pp_foterm side ^ " =(< || =)" ^
127 Pp.pp_foterm newside ^ " coming from " ^
128 Pp.pp_unit_clause uc );*)None)
130 Some (context newside, subst, varlist, id, pos, dir)
131 with FoUnif.UnificationFailure _ -> None)
132 (IDX.ClauseSet.elements cands)
135 let demodulate_once ~jump_to_right bag (id, literal, vl, pr) table =
136 (* debug ("Demodulating : " ^ (Pp.pp_unit_clause (id, literal, vl, pr)));*)
138 | Terms.Predicate t -> assert false
139 | Terms.Equation (l,r,ty,_) ->
140 let left_position = if jump_to_right then None else
142 (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; x; r ]) l
145 match left_position with
146 | Some (newt, subst, varlist, id2, pos, dir) ->
148 match build_clause bag (fun _ -> true) Terms.Demodulation
149 newt subst varlist id id2 pos dir
151 | None -> assert false
152 | Some x -> Some (x,false)
156 [3] (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; l; x ]) r
160 | Some (newt, subst, varlist, id2, pos, dir) ->
161 match build_clause bag (fun _ -> true)
162 Terms.Demodulation newt subst varlist id id2 pos dir
164 | None -> assert false
165 | Some x -> Some (x,true)
168 let rec demodulate ~jump_to_right bag clause table =
169 match demodulate_once ~jump_to_right bag clause table with
170 | None -> bag, clause
171 | Some ((bag, clause),r) -> demodulate ~jump_to_right:r
175 let demodulate bag clause table = demodulate ~jump_to_right:false
180 let is_identity_clause ~unify = function
181 | _, Terms.Equation (_,_,_,Terms.Eq), _, _ -> true
182 | _, Terms.Equation (l,r,_,_), vl, proof when unify ->
183 (try ignore(Unif.unification vl [] l r); true
184 with FoUnif.UnificationFailure _ -> false)
185 | _, Terms.Equation (_,_,_,_), _, _ -> false
186 | _, Terms.Predicate _, _, _ -> assert false
189 let build_new_clause bag maxvar filter rule t subst vl id id2 pos dir =
190 let maxvar, vl, relocsubst = Utils.relocate maxvar vl in
191 let subst = Subst.concat relocsubst subst in
192 match build_clause bag filter rule t subst vl id id2 pos dir with
193 | Some (bag, c) -> Some ((bag, maxvar), c)
197 let fold_build_new_clause bag maxvar id rule filter res =
198 let (bag, maxvar), res =
199 HExtlib.filter_map_acc
200 (fun (bag, maxvar) (t,subst,vl,id2,pos,dir) ->
201 build_new_clause bag maxvar filter rule t subst vl id id2 pos dir)
208 let rewrite_eq ~unify l r ty vl table =
209 let retrieve = if unify then IDX.DT.retrieve_unifiables
210 else IDX.DT.retrieve_generalizations in
211 let lcands = retrieve table l in
212 let rcands = retrieve table r in
214 let id, dir, l, r, vl =
216 | (d, (id,Terms.Equation (l,r,ty,_),vl,_))-> id, d, l, r, vl
219 let reverse = (dir = Terms.Left2Right) = b in
220 let l, r, proof_rewrite_dir = if reverse then l,r,Terms.Left2Right
221 else r,l, Terms.Right2Left in
222 (id,proof_rewrite_dir,Terms.Node [ Terms.Leaf B.eqP; ty; l; r ], vl)
224 let cands1 = List.map (f true) (IDX.ClauseSet.elements lcands) in
225 let cands2 = List.map (f false) (IDX.ClauseSet.elements rcands) in
226 let t = Terms.Node [ Terms.Leaf B.eqP; ty; l; r ] in
227 let locked_vars = if unify then [] else vl in
228 let rec aux = function
230 | (id2,dir,c,vl1)::tl ->
232 let subst,vl1 = Unif.unification (vl@vl1) locked_vars c t in
233 Some (id2, dir, subst)
234 with FoUnif.UnificationFailure _ -> aux tl
236 aux (cands1 @ cands2)
239 let is_subsumed ~unify bag maxvar (id, lit, vl, _) table =
241 | Terms.Predicate _ -> assert false
242 | Terms.Equation (l,r,ty,_) ->
243 match rewrite_eq ~unify l r ty vl table with
245 | Some (id2, dir, subst) ->
246 let id_t = Terms.Node [ Terms.Leaf B.eqP; ty; r; r ] in
247 build_new_clause bag maxvar (fun _ -> true)
248 Terms.Superposition id_t subst [] id id2 [2] dir
250 (* id refers to a clause proving contextl l = contextr r *)
252 let rec deep_eq ~unify l r ty pos contextl contextr table acc =
255 | Some(bag,maxvar,(id,lit,vl,p),subst) ->
256 let l = Subst.apply_subst subst l in
257 let r = Subst.apply_subst subst r in
259 let subst1,vl1 = Unif.unification vl [] l r in
261 match lit with Terms.Predicate _ -> assert false
262 | Terms.Equation (l,r,ty,o) ->
263 Terms.Equation (FoSubst.apply_subst subst1 l,
264 FoSubst.apply_subst subst1 r, ty, o)
266 Some(bag,maxvar,(id,lit,vl1,p),Subst.concat subst1 subst)
267 with FoUnif.UnificationFailure _ ->
268 match rewrite_eq ~unify l r ty vl table with
269 | Some (id2, dir, subst1) ->
270 let newsubst = Subst.concat subst1 subst in
272 FoSubst.apply_subst newsubst
273 (Terms.Node[Terms.Leaf B.eqP;ty;contextl r;contextr r])
276 build_new_clause bag maxvar (fun _ -> true)
277 Terms.Superposition id_t
278 subst1 [] id id2 (pos@[2]) dir
280 | Some ((bag, maxvar), c) ->
281 Some(bag,maxvar,c,newsubst)
282 | None -> assert false)
285 | Terms.Node (a::la), Terms.Node (b::lb) when
286 a = b && List.length la = List.length lb ->
289 (fun (acc,pre,postl,postr) a b ->
291 fun x -> contextl(Terms.Node (pre@(x::postl))) in
293 fun x -> contextr(Terms.Node (pre@(x::postr))) in
294 let newpos = List.length pre::pos in
296 if l = [] then [] else List.tl l in
297 (deep_eq ~unify a b ty
298 newpos newcl newcr table acc,pre@[b],
299 footail postl, footail postr))
300 (acc,[a],List.tl la,List.tl lb) la lb
305 let rec orphan_murder bag acc i =
306 match Terms.M.find i bag with
307 | (_,_,_,Terms.Exact _),discarded -> (discarded,acc)
308 | (_,_,_,Terms.Step (_,i1,i2,_,_,_)),true -> (true,acc)
309 | (_,_,_,Terms.Step (_,i1,i2,_,_,_)),false ->
310 if (List.mem i acc) then (false,acc)
311 else match orphan_murder bag acc i1 with
312 | (true,acc) -> (true,acc)
314 let (res,acc) = orphan_murder bag acc i2 in
315 if res then res,acc else res,i::acc
318 let orphan_murder bag actives cl =
319 let (id,_,_,_) = cl in
320 let actives = List.map (fun (i,_,_,_) -> i) actives in
321 let (res,_) = orphan_murder bag actives id in
322 if res then debug "Orphan murdered"; res
325 (* demodulate and check for subsumption *)
326 let simplify table maxvar bag clause =
327 if is_identity_clause ~unify:false clause then bag,None
328 (* else if orphan_murder bag actives clause then bag,None *)
329 else let bag, clause = demodulate bag clause table in
330 if is_identity_clause ~unify:false clause then bag,None
332 match is_subsumed ~unify:false bag maxvar clause table with
333 | None -> bag, Some clause
334 | Some _ -> bag, None
337 let simplify table maxvar bag clause =
338 match simplify table maxvar bag clause with
339 | bag, None -> let (id,_,_,_) = clause in
340 Terms.M.add id (clause,true) bag, None
341 | bag, Some clause -> bag, Some clause
342 (*let (id,_,_,_) = clause in
343 if orphan_murder bag clause then
344 Terms.M.add id (clause,true) bag, Some clause
345 else bag, Some clause*)
348 let one_pass_simplification new_clause (alist,atable) bag maxvar =
349 match simplify atable maxvar bag new_clause with
350 | bag,None -> bag,None (* new_clause has been discarded *)
351 | bag,(Some clause) ->
352 let ctable = IDX.index_unit_clause IDX.DT.empty clause in
353 let bag, alist, atable =
355 (fun (bag, alist, atable) c ->
356 match simplify ctable maxvar bag c with
357 |bag,None -> (bag,alist,atable)
358 (* an active clause as been discarded *)
360 bag, c :: alist, IDX.index_unit_clause atable c)
361 (bag,[],IDX.DT.empty) alist
363 bag, Some (clause, (alist,atable))
366 let simplification_step ~new_cl cl (alist,atable) bag maxvar new_clause =
368 if new_cl then atable else
369 IDX.index_unit_clause atable cl
371 (* Simplification of new_clause with : *
372 * - actives and cl if new_clause is not cl *
373 * - only actives otherwise *)
375 simplify atable1 maxvar bag new_clause with
376 | bag,None -> bag,(Some cl, None) (* new_clause has been discarded *)
378 (* Simplification of each active clause with clause *
379 * which is the simplified form of new_clause *)
380 let ctable = IDX.index_unit_clause IDX.DT.empty clause in
381 let bag, newa, alist, atable =
383 (fun (bag, newa, alist, atable) c ->
384 match simplify ctable maxvar bag c with
385 |bag,None -> (bag, newa, alist, atable)
386 (* an active clause as been discarded *)
389 bag, newa, c :: alist,
390 IDX.index_unit_clause atable c
392 bag, c1 :: newa, alist, atable)
393 (bag,[],[],IDX.DT.empty) alist
396 bag, (Some cl, Some (clause, (alist,atable), newa))
398 (* if new_clause is not cl, we simplify cl with clause *)
399 match simplify ctable maxvar bag cl with
401 (* cl has been discarded *)
402 bag,(None, Some (clause, (alist,atable), newa))
404 bag,(Some cl1, Some (clause, (alist,atable), newa))
407 let keep_simplified cl (alist,atable) bag maxvar =
408 let rec keep_simplified_aux ~new_cl cl (alist,atable) bag newc =
410 match simplification_step ~new_cl cl (alist,atable) bag maxvar cl with
411 | _,(None, _) -> assert false
412 | bag,(Some _, None) -> bag,None
413 | bag,(Some _, Some (clause, (alist,atable), newa)) ->
414 keep_simplified_aux ~new_cl:(cl!=clause) clause (alist,atable)
418 | [] -> bag, Some (cl, (alist,atable))
420 match simplification_step ~new_cl cl
421 (alist,atable) bag maxvar hd with
422 | _,(None,None) -> assert false
423 | bag,(Some _,None) ->
424 keep_simplified_aux ~new_cl cl (alist,atable) bag tl
425 | bag,(None, Some _) -> bag,None
426 | bag,(Some cl1, Some (clause, (alist,atable), newa)) ->
428 (clause::alist, IDX.index_unit_clause atable clause)
430 keep_simplified_aux ~new_cl:(cl!=cl1) cl1 (alist,atable)
433 keep_simplified_aux ~new_cl:true cl (alist,atable) bag []
436 let are_alpha_eq cl1 cl2 =
437 let get_term (_,lit,_,_) =
439 | Terms.Predicate _ -> assert false
440 | Terms.Equation (l,r,ty,_) ->
441 Terms.Node [Terms.Leaf B.eqP; ty; l ; r]
443 try ignore(Unif.alpha_eq (get_term cl1) (get_term cl2)) ; true
444 with FoUnif.UnificationFailure _ -> false
447 (* this is like simplify but raises Success *)
448 let simplify_goal ~no_demod maxvar table bag g_actives clause =
450 if no_demod then bag, clause else demodulate bag clause table
452 if List.exists (are_alpha_eq clause) g_actives then None else
453 if (is_identity_clause ~unify:true clause)
454 then raise (Success (bag, maxvar, clause))
456 let (id,lit,vl,_) = clause in
459 | Terms.Equation(l,r,ty,_) -> l,r,ty
462 match deep_eq ~unify:true l r ty [] (fun x -> x) (fun x -> x)
463 table (Some(bag,maxvar,clause,Subst.id_subst)) with
464 | None -> Some (bag,clause)
465 | Some (bag,maxvar,cl,subst) ->
466 prerr_endline "Goal subsumed";
467 raise (Success (bag,maxvar,cl))
469 else match is_subsumed ~unify:true bag maxvar clause table with
470 | None -> Some (bag, clause)
471 | Some ((bag,maxvar),c) ->
472 prerr_endline "Goal subsumed";
473 raise (Success (bag,maxvar,c))
477 (* =================== inference ===================== *)
479 (* this is OK for both the sup_left and sup_right inference steps *)
480 let superposition table varlist subterm pos context =
481 let cands = IDX.DT.retrieve_unifiables table subterm in
483 (fun (dir, (id,lit,vl,_ (*as uc*))) ->
485 | Terms.Predicate _ -> assert false
486 | Terms.Equation (l,r,_,o) ->
487 let side, newside = if dir=Terms.Left2Right then l,r else r,l in
490 Unif.unification (varlist@vl) [] subterm side
492 if o = Terms.Incomparable then
493 let side = Subst.apply_subst subst side in
494 let newside = Subst.apply_subst subst newside in
495 let o = Order.compare_terms side newside in
496 (* XXX: check Riazanov p. 33 (iii) *)
497 if o <> Terms.Lt && o <> Terms.Eq then
498 Some (context newside, subst, varlist, id, pos, dir)
500 ((*prerr_endline ("Filtering: " ^
501 Pp.pp_foterm side ^ " =(< || =)" ^
502 Pp.pp_foterm newside ^ " coming from " ^
503 Pp.pp_unit_clause uc );*)None)
505 Some (context newside, subst, varlist, id, pos, dir)
506 with FoUnif.UnificationFailure _ -> None)
507 (IDX.ClauseSet.elements cands)
510 (* Superposes selected equation with equalities in table *)
511 let superposition_with_table bag maxvar (id,selected,vl,_) table =
513 | Terms.Predicate _ -> assert false
514 | Terms.Equation (l,r,ty,Terms.Lt) ->
515 fold_build_new_clause bag maxvar id Terms.Superposition
518 (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; l; x ])
519 r (superposition table vl))
520 | Terms.Equation (l,r,ty,Terms.Gt) ->
521 fold_build_new_clause bag maxvar id Terms.Superposition
524 (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; x; r ])
525 l (superposition table vl))
526 | Terms.Equation (l,r,ty,Terms.Incomparable) ->
527 fold_build_new_clause bag maxvar id Terms.Superposition
528 (function (* Riazanov: p.33 condition (iv) *)
529 | Terms.Node [Terms.Leaf eq; ty; l; r ] when B.eq B.eqP eq ->
530 Order.compare_terms l r <> Terms.Eq
533 (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; l; x ])
534 r (superposition table vl)) @
536 (fun x -> Terms.Node [ Terms.Leaf B.eqP; ty; x; r ])
537 l (superposition table vl)))
541 (* the current equation is normal w.r.t. demodulation with atable
542 * (and is not the identity) *)
543 let infer_right bag maxvar current (alist,atable) =
544 (* We demodulate actives clause with current until all *
545 * active clauses are reduced w.r.t each other *)
546 (* let bag, (alist,atable) = keep_simplified (alist,atable) bag [current] in *)
547 let ctable = IDX.index_unit_clause IDX.DT.empty current in
548 (* let bag, (alist, atable) =
550 HExtlib.filter_map_acc (simplify ctable) bag alist
552 bag, (alist, List.fold_left IDX.index_unit_clause IDX.DT.empty alist)
554 debug "Simplified active clauses with fact";
555 (* We superpose active clauses with current *)
556 let bag, maxvar, new_clauses =
558 (fun (bag, maxvar, acc) active ->
559 let bag, maxvar, newc =
560 superposition_with_table bag maxvar active ctable
562 bag, maxvar, newc @ acc)
563 (bag, maxvar, []) alist
565 debug "First superpositions";
566 (* We add current to active clauses so that it can be *
567 * superposed with itself *)
569 current :: alist, IDX.index_unit_clause atable current
572 let fresh_current, maxvar = Utils.fresh_unit_clause maxvar current in
573 (* We need to put fresh_current into the bag so that all *
574 * variables clauses refer to are known. *)
575 let bag, fresh_current = Utils.add_to_bag bag fresh_current in
576 (* We superpose current with active clauses *)
577 let bag, maxvar, additional_new_clauses =
578 superposition_with_table bag maxvar fresh_current atable
580 debug "Another superposition";
581 let new_clauses = new_clauses @ additional_new_clauses in
582 debug (Printf.sprintf "Demodulating %d clauses"
583 (List.length new_clauses));
584 let bag, new_clauses =
585 HExtlib.filter_map_monad (simplify atable maxvar) bag new_clauses
587 debug "Demodulated new clauses";
588 bag, maxvar, (alist, atable), new_clauses
591 let infer_left bag maxvar goal (_alist, atable) =
592 (* We superpose the goal with active clauses *)
593 let bag, maxvar, new_goals =
594 superposition_with_table bag maxvar goal atable
596 debug "Superposed goal with active clauses";
597 (* We simplify the new goals with active clauses *)
601 match simplify_goal ~no_demod:false maxvar atable bag [] g with
602 | None -> assert false
603 | Some (bag,g) -> bag,g::acc)
606 debug "Simplified new goals with active clauses";
607 bag, maxvar, List.rev new_goals