1 (* Copyright (C) 2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
26 (* let _profiler = <:profiler<_profiler>>;; *)
30 (* set to false to disable paramodulation inside auto_tac *)
32 let connect_to_auto = true;;
34 let debug_print = Utils.debug_print;;
36 (* profiling statistics... *)
37 let infer_time = ref 0.;;
38 let forward_simpl_time = ref 0.;;
39 let forward_simpl_new_time = ref 0.;;
40 let backward_simpl_time = ref 0.;;
41 let passive_maintainance_time = ref 0.;;
43 (* limited-resource-strategy related globals *)
44 let processed_clauses = ref 0;; (* number of equalities selected so far... *)
45 let time_limit = ref 0.;; (* in seconds, settable by the user... *)
46 let start_time = ref 0.;; (* time at which the execution started *)
47 let elapsed_time = ref 0.;;
48 (* let maximal_weight = ref None;; *)
49 let maximal_retained_equality = ref None;;
51 (* equality-selection related globals *)
52 let use_fullred = ref true;;
53 let weight_age_ratio = ref 6 (* 5 *);; (* settable by the user *)
54 let weight_age_counter = ref !weight_age_ratio ;;
55 let symbols_ratio = ref 0 (* 3 *);;
56 let symbols_counter = ref 0;;
58 (* non-recursive Knuth-Bendix term ordering by default *)
59 (* Utils.compare_terms := Utils.rpo;; *)
60 (* Utils.compare_terms := Utils.nonrec_kbo;; *)
61 (* Utils.compare_terms := Utils.ao;; *)
64 let derived_clauses = ref 0;;
65 let kept_clauses = ref 0;;
67 (* index of the greatest Cic.Meta created - TODO: find a better way! *)
70 (* varbiables controlling the search-space *)
71 let maxdepth = ref 3;;
72 let maxwidth = ref 3;;
74 type theorem = Cic.term * Cic.term * Cic.metasenv;;
76 let symbols_of_equality equality =
77 let (_, _, (_, left, right, _), _,_) = Equality.open_equality equality in
78 let m1 = Utils.symbols_of_term left in
83 let c = Utils.TermMap.find k res in
84 Utils.TermMap.add k (c+v) res
86 Utils.TermMap.add k v res)
87 (Utils.symbols_of_term right) m1
93 module OrderedEquality = struct
94 type t = Equality.equality
97 match Equality.meta_convertibility_eq eq1 eq2 with
100 let w1, _, (ty,left, right, _), m1,_ = Equality.open_equality eq1 in
101 let w2, _, (ty',left', right', _), m2,_ = Equality.open_equality eq2 in
102 match Pervasives.compare w1 w2 with
104 let res = (List.length m1) - (List.length m2) in
105 if res <> 0 then res else
106 Equality.compare eq1 eq2
110 module EqualitySet = Set.Make(OrderedEquality);;
112 type passive_table = Equality.equality list * EqualitySet.t
113 type active_table = Equality.equality list * Indexing.Index.t
115 Equality.goal_proof * Equality.proof * int * Subst.substitution * Cic.metasenv
117 | ParamodulationFailure of string * active_table * passive_table
118 | ParamodulationSuccess of new_proof * active_table * passive_table
121 let list_of_passive (l,s) = l
124 let make_passive eq_list =
126 List.fold_left (fun s e -> EqualitySet.add e s) EqualitySet.empty eq_list
128 (* we have the invariant that the list and the set have the same
130 EqualitySet.elements set, set
133 let make_empty_active () = [], Indexing.empty ;;
134 let make_active eq_list =
135 eq_list, List.fold_left Indexing.index Indexing.empty eq_list
138 let size_of_passive (passive_list, _) = List.length passive_list;;
139 let size_of_active (active_list, _) = List.length active_list;;
141 let passive_is_empty = function
142 | [], s when EqualitySet.is_empty s -> true
143 | [], s -> assert false (* the set and the list should be in sync *)
147 type goals = Equality.goal list * Equality.goal list
149 let no_more_passive_goals g = match g with | _,[] -> true | _ -> false;;
152 let age_factor = 0.01;;
155 selects one equality from passive. The selection strategy is a combination
156 of weight, age and goal-similarity
159 let rec select env g passive =
160 processed_clauses := !processed_clauses + 1;
163 match (List.rev goals) with goal::_ -> goal | _ -> assert false
166 let pos_list, pos_set = passive in
167 let remove eq l = List.filter (fun e -> Equality.compare e eq <> 0) l in
168 if !weight_age_ratio > 0 then
169 weight_age_counter := !weight_age_counter - 1;
170 match !weight_age_counter with
172 weight_age_counter := !weight_age_ratio;
173 let skip_giant pos_list pos_set =
175 | (hd:EqualitySet.elt)::tl ->
176 let w,_,_,_,_ = Equality.open_equality hd in
178 hd, (tl, EqualitySet.remove hd pos_set)
182 ("+++ skipping giant of size "^string_of_int w^" +++");
184 select env g (tl@[hd],pos_set)
187 skip_giant pos_list pos_set)
190 let rec skip_giant pos_list pos_set =
192 | (hd:EqualitySet.elt)::tl ->
193 let w,_,_,_,_ = Equality.open_equality hd in
194 let pos_set = EqualitySet.remove hd pos_set in
199 ("+++ skipping giant of size "^string_of_int w^" +++");
200 skip_giant tl pos_set)
203 skip_giant pos_list pos_set)
207 | _ when (!symbols_counter > 0) ->
208 (symbols_counter := !symbols_counter - 1;
209 let cardinality map =
210 Utils.TermMap.fold (fun k v res -> res + v) map 0
213 let _, _, term = goal in
214 Utils.symbols_of_term term
216 let card = cardinality symbols in
217 let foldfun k v (r1, r2) =
218 if Utils.TermMap.mem k symbols then
219 let c = Utils.TermMap.find k symbols in
220 let c1 = abs (c - v) in
226 let f equality (i, e) =
228 Utils.TermMap.fold foldfun (symbols_of_equality equality) (0, 0)
230 let c = others + (abs (common - card)) in
231 if c < i then (c, equality)
234 let e1 = EqualitySet.min_elt pos_set in
237 Utils.TermMap.fold foldfun (symbols_of_equality e1) (0, 0)
239 (others + (abs (common - card))), e1
241 let _, current = EqualitySet.fold f pos_set initial in
243 (remove current pos_list, EqualitySet.remove current pos_set))
246 symbols_counter := !symbols_ratio;
248 let w1,_,_,_,_ = Equality.open_equality e1 in
249 let w2,_,_,_,_ = Equality.open_equality e2 in
250 if w1 < w2 then e1 else e2
252 let rec my_min_elt min = function
254 | hd::tl -> my_min_elt (my_min hd min) tl
256 (* let current = EqualitySet.min_elt pos_set in *)
257 let current = my_min_elt (List.hd pos_list) (List.tl pos_list) in
258 current,(remove current pos_list, EqualitySet.remove current pos_set)
262 let filter_dependent bag passive id =
263 let pos_list, pos_set = passive in
264 let passive,no_pruned =
266 (fun eq ((list,set),no) ->
267 if Equality.depend bag eq id then
268 (list, EqualitySet.remove eq set), no + 1
271 pos_list (([],pos_set),0)
274 if no_pruned > 0 then
275 prerr_endline ("+++ pruning "^ string_of_int no_pruned ^" passives +++");
281 (* adds to passive a list of equalities new_pos *)
282 let add_to_passive passive new_pos preferred =
283 let pos_list, pos_set = passive in
284 let ok set equality = not (EqualitySet.mem equality set) in
285 let pos = List.filter (ok pos_set) new_pos in
286 let add set equalities =
287 List.fold_left (fun s e -> EqualitySet.add e s) set equalities
289 let pos_head, pos_tail =
291 (fun e -> List.exists (fun x -> Equality.compare x e = 0) preferred)
294 pos_head @ pos_list @ pos_tail, add pos_set pos
298 (* removes from passive equalities that are estimated impossible to activate
299 within the current time limit *)
300 let prune_passive howmany (active, _) passive =
301 let (pl, ps), tbl = passive in
302 let howmany = float_of_int howmany
303 and ratio = float_of_int !weight_age_ratio in
306 int_of_float (if t -. v < 0.5 then t else v)
308 let in_weight = round (howmany *. ratio /. (ratio +. 1.))
309 and in_age = round (howmany /. (ratio +. 1.)) in
311 (lazy (Printf.sprintf "in_weight: %d, in_age: %d\n" in_weight in_age));
312 let counter = ref !symbols_ratio in
317 counter := !counter - 1;
318 if !counter = 0 then counter := !symbols_ratio in
319 let e = EqualitySet.min_elt ps in
320 let ps' = pickw (w-1) (EqualitySet.remove e ps) in
321 EqualitySet.add e ps'
323 let e = EqualitySet.min_elt ps in
324 let ps' = pickw (w-1) (EqualitySet.remove e ps) in
325 EqualitySet.add e ps'
329 let ps = pickw in_weight ps in
330 let rec picka w s l =
334 | hd::tl when not (EqualitySet.mem hd s) ->
335 let w, s, l = picka (w-1) s tl in
336 w, EqualitySet.add hd s, hd::l
338 let w, s, l = picka w s tl in
343 let _, ps, pl = picka in_age ps pl in
344 if not (EqualitySet.is_empty ps) then
345 maximal_retained_equality := Some (EqualitySet.max_elt ps);
348 (fun e tbl -> Indexing.index tbl e) ps Indexing.empty
354 (** inference of new equalities between current and some in active *)
355 let infer bag eq_uri env current (active_list, active_table) =
357 if Utils.debug_metas then
358 (ignore(Indexing.check_target bag c current "infer1");
359 ignore(List.map (function current -> Indexing.check_target bag c current "infer2") active_list));
361 let maxm, copy_of_current = Equality.fix_metas bag !maxmeta current in
363 let active_table = Indexing.index active_table copy_of_current in
364 (* let _ = <:start<current contro active>> in *)
366 Indexing.superposition_right bag eq_uri !maxmeta env active_table current
368 (* let _ = <:stop<current contro active>> in *)
369 if Utils.debug_metas then
372 Indexing.check_target bag c current "sup0") res);
374 let rec infer_positive table = function
378 Indexing.superposition_right bag
379 ~subterms_only:true eq_uri !maxmeta env table equality
382 if Utils.debug_metas then
386 Indexing.check_target bag c current "sup2") res);
387 let pos = infer_positive table tl in
391 let maxm, copy_of_current = Equality.fix_metas !maxmeta current in
394 let curr_table = Indexing.index Indexing.empty current in
395 (* let _ = <:start<active contro current>> in *)
396 let pos = infer_positive curr_table ((*copy_of_current::*)active_list) in
397 (* let _ = <:stop<active contro current>> in *)
398 if Utils.debug_metas then
401 Indexing.check_target bag c current "sup3") pos);
404 derived_clauses := !derived_clauses + (List.length new_pos);
405 match !maximal_retained_equality with
408 ignore(assert false);
409 (* if we have a maximal_retained_equality, we can discard all equalities
410 "greater" than it, as they will never be reached... An equality is
411 greater than maximal_retained_equality if it is bigger
412 wrt. OrderedEquality.compare and it is less similar than
413 maximal_retained_equality to the current goal *)
414 List.filter (fun e -> OrderedEquality.compare e eq <= 0) new_pos
417 let check_for_deep_subsumption env active_table eq =
418 let _,_,(eq_ty, left, right, order),metas,id = Equality.open_equality eq in
419 let check_subsumed deep l r =
421 Equality.mk_tmp_equality(0,(eq_ty,l,r,Utils.Incomparable),metas)in
422 match Indexing.subsumption env active_table eqtmp with
426 let rec aux b (ok_so_far, subsumption_used) t1 t2 =
428 | t1, t2 when not ok_so_far -> ok_so_far, subsumption_used
429 | t1, t2 when subsumption_used -> t1 = t2, subsumption_used
430 | Cic.Appl (h1::l),Cic.Appl (h2::l') ->
431 let rc = check_subsumed b t1 t2 in
437 (fun (ok_so_far, subsumption_used) t t' ->
438 aux true (ok_so_far, subsumption_used) t t')
439 (ok_so_far, subsumption_used) l l'
440 with Invalid_argument _ -> false,subsumption_used)
442 false, subsumption_used
443 | _ -> false, subsumption_used
445 fst (aux false (true,false) left right)
448 (** simplifies current using active and passive *)
449 let forward_simplify bag eq_uri env current (active_list, active_table) =
450 let _, context, _ = env in
451 let demodulate table current =
452 let newmeta, newcurrent =
453 Indexing.demodulation_equality bag eq_uri !maxmeta env table current
456 if Equality.is_identity env newcurrent then None else Some newcurrent
459 if Utils.debug_metas then
460 ignore (Indexing.check_target bag context current "demod0");
461 let res = demodulate active_table current in
462 if Utils.debug_metas then
463 ignore ((function None -> () | Some x ->
464 ignore (Indexing.check_target bag context x "demod1");()) res);
467 let res = demod current in
471 if Indexing.in_index active_table c ||
472 check_for_deep_subsumption env active_table c
479 (** simplifies new using active and passive *)
480 let forward_simplify_new bag eq_uri env new_pos active =
481 if Utils.debug_metas then
485 (fun current -> Indexing.check_target bag c current "forward new pos")
488 let active_list, active_table = active in
489 let demodulate table target =
490 let newmeta, newtarget =
491 Indexing.demodulation_equality bag eq_uri !maxmeta env table target
496 (* we could also demodulate using passive. Currently we don't *)
497 let new_pos = List.map (demodulate active_table) new_pos in
501 if not (Equality.is_identity env e) then
504 EqualitySet.empty new_pos
506 let new_pos = EqualitySet.elements new_pos_set in
508 let subs e = Indexing.subsumption env active_table e = None in
509 let is_duplicate e = not (Indexing.in_index active_table e) in
510 List.filter subs (List.filter is_duplicate new_pos)
514 (** simplifies a goal with equalities in active and passive *)
515 let rec simplify_goal bag env goal (active_list, active_table) =
516 let demodulate table goal = Indexing.demodulation_goal bag env table goal in
517 let changed, goal = demodulate active_table goal in
522 snd (simplify_goal bag env goal (active_list, active_table))
526 let simplify_goals bag env goals active =
527 let a_goals, p_goals = goals in
528 let p_goals = List.map (fun g -> snd (simplify_goal bag env g active)) p_goals in
529 let a_goals = List.map (fun g -> snd (simplify_goal bag env g active)) a_goals in
534 (** simplifies active usign new *)
535 let backward_simplify_active
536 bag eq_uri env new_pos new_table min_weight active
538 let active_list, active_table = active in
539 let active_list, newa, pruned =
541 (fun equality (res, newn,pruned) ->
542 let ew, _, _, _,id = Equality.open_equality equality in
543 if ew < min_weight then
544 equality::res, newn,pruned
547 forward_simplify bag eq_uri env equality (new_pos, new_table)
549 | None -> res, newn, id::pruned
551 if Equality.compare equality e = 0 then
554 res, e::newn, pruned)
555 active_list ([], [],[])
558 List.exists (Equality.meta_convertibility_eq eq1) where
561 let _, _, _, _,id = Equality.open_equality eq in id
563 let ((active1,pruned),tbl), newa =
565 (fun eq ((res,pruned), tbl) ->
566 if List.mem eq res then
567 (res, (id_of_eq eq)::pruned),tbl
568 else if (Equality.is_identity env eq) || (find eq res) then (
569 (res, (id_of_eq eq)::pruned),tbl
572 (eq::res,pruned), Indexing.index tbl eq)
573 active_list (([],pruned), Indexing.empty),
576 if (Equality.is_identity env eq) then p
581 | [] -> (active1,tbl), None, pruned
582 | _ -> (active1,tbl), Some newa, pruned
586 (** simplifies passive using new *)
587 let backward_simplify_passive
588 bag eq_uri env new_pos new_table min_weight passive
590 let (pl, ps), passive_table = passive in
591 let f equality (resl, ress, newn) =
592 let ew, _, _, _ , _ = Equality.open_equality equality in
593 if ew < min_weight then
594 equality::resl, ress, newn
597 forward_simplify bag eq_uri env equality (new_pos, new_table)
599 | None -> resl, EqualitySet.remove equality ress, newn
602 equality::resl, ress, newn
604 let ress = EqualitySet.remove equality ress in
607 let pl, ps, newp = List.fold_right f pl ([], ps, []) in
610 (fun tbl e -> Indexing.index tbl e) Indexing.empty pl
613 | [] -> ((pl, ps), passive_table), None
614 | _ -> ((pl, ps), passive_table), Some (newp)
617 let build_table equations =
620 let ew, _, _, _ , _ = Equality.open_equality e in
621 e::l, Indexing.index t e, min ew w)
622 ([], Indexing.empty, 1000000) equations
626 let backward_simplify bag eq_uri env new' active =
627 let new_pos, new_table, min_weight = build_table new' in
628 let active, newa, pruned =
629 backward_simplify_active bag eq_uri env new_pos new_table min_weight active
634 let close bag eq_uri env new' given =
635 let new_pos, new_table, min_weight =
638 let ew, _, _, _ , _ = Equality.open_equality e in
639 e::l, Indexing.index t e, min ew w)
640 ([], Indexing.empty, 1000000) (snd new')
644 let pos = infer bag eq_uri env c (new_pos,new_table) in
649 let is_commutative_law eq =
650 let w, proof, (eq_ty, left, right, order), metas , _ =
651 Equality.open_equality eq
653 match left,right with
654 Cic.Appl[f1;Cic.Meta _ as a1;Cic.Meta _ as b1],
655 Cic.Appl[f2;Cic.Meta _ as a2;Cic.Meta _ as b2] ->
656 f1 = f2 && a1 = b2 && a2 = b1
660 let prova bag eq_uri env new' active =
661 let given = List.filter is_commutative_law (fst active) in
665 (Printf.sprintf "symmetric:\n%s\n"
668 (fun e -> Equality.string_of_equality ~env e)
670 close bag eq_uri env new' given
673 (* returns an estimation of how many equalities in passive can be activated
674 within the current time limit *)
675 let get_selection_estimate () =
676 elapsed_time := (Unix.gettimeofday ()) -. !start_time;
677 (* !processed_clauses * (int_of_float (!time_limit /. !elapsed_time)) *)
679 ceil ((float_of_int !processed_clauses) *.
680 ((!time_limit (* *. 2. *)) /. !elapsed_time -. 1.)))
684 (** initializes the set of goals *)
685 let make_goals goal =
687 and passive = [0, [goal]] in
691 let make_goal_set goal =
695 (** initializes the set of theorems *)
696 let make_theorems theorems =
701 let activate_goal (active, passive) =
704 | goal_conj::tl -> true, (goal_conj::active, tl)
705 | [] -> false, (active, passive)
707 true, (active,passive)
711 let activate_theorem (active, passive) =
713 | theorem::tl -> true, (theorem::active, tl)
714 | [] -> false, (active, passive)
719 let simplify_theorems bag env theorems ?passive (active_list, active_table) =
720 let pl, passive_table =
723 | Some ((pn, _), (pp, _), pt) -> pn @ pp, Some pt
725 let a_theorems, p_theorems = theorems in
726 let demodulate table theorem =
727 let newmeta, newthm =
728 Indexing.demodulation_theorem bag !maxmeta env table theorem in
730 theorem != newthm, newthm
732 let foldfun table (a, p) theorem =
733 let changed, theorem = demodulate table theorem in
734 if changed then (a, theorem::p) else (theorem::a, p)
736 let mapfun table theorem = snd (demodulate table theorem) in
737 match passive_table with
739 let p_theorems = List.map (mapfun active_table) p_theorems in
740 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems
741 | Some passive_table ->
742 let p_theorems = List.map (mapfun active_table) p_theorems in
743 let p_theorems, a_theorems =
744 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems in
745 let p_theorems = List.map (mapfun passive_table) p_theorems in
746 List.fold_left (foldfun passive_table) ([], p_theorems) a_theorems
750 let rec simpl bag eq_uri env e others others_simpl =
751 let active = others @ others_simpl in
755 if Equality.is_identity env e then t else Indexing.index t e)
756 Indexing.empty active
759 forward_simplify bag eq_uri env e (active, tbl)
764 | None -> simpl bag eq_uri env hd tl others_simpl
765 | Some e -> simpl bag eq_uri env hd tl (e::others_simpl)
769 | None -> others_simpl
770 | Some e -> e::others_simpl
774 let simplify_equalities bag eq_uri env equalities =
777 (Printf.sprintf "equalities:\n%s\n"
779 (List.map Equality.string_of_equality equalities))));
780 Utils.debug_print (lazy "SIMPLYFYING EQUALITIES...");
781 match equalities with
785 List.rev (simpl bag eq_uri env hd tl [])
789 (Printf.sprintf "equalities AFTER:\n%s\n"
791 (List.map Equality.string_of_equality res))));
795 let print_goals goals =
802 (* (string_of_proof p) ^ ", " ^ *) (CicPp.ppterm t)) gl
804 Printf.sprintf "%d: %s" d (String.concat "; " gl')) goals))
807 let pp_goal_set msg goals names =
808 let active_goals, passive_goals = goals in
809 debug_print (lazy ("////" ^ msg));
810 debug_print (lazy ("ACTIVE G: " ^
811 (String.concat "\n " (List.map (fun (_,_,g) -> CicPp.pp g names)
813 debug_print (lazy ("PASSIVE G: " ^
814 (String.concat "\n " (List.map (fun (_,_,g) -> CicPp.pp g names)
818 let check_if_goal_is_subsumed bag ((_,ctx,_) as env) table (goalproof,menv,ty) =
819 (* let names = Utils.names_of_context ctx in *)
821 | Cic.Appl[Cic.MutInd(uri,_,_);eq_ty;left;right]
822 when LibraryObjects.is_eq_URI uri ->
824 Equality.mk_equality bag
825 (0,Equality.Exact (Cic.Implicit None),(eq_ty,left,right,Utils.Eq),menv)
827 match Indexing.subsumption env table goal_equation with
828 (* match Indexing.unification env table goal_equation with *)
829 | Some (subst, equality, swapped ) ->
832 ("GOAL SUBSUMED IS: "^Equality.string_of_equality goal_equation ~env);
834 ("GOAL IS SUBSUMED BY: "^Equality.string_of_equality equality ~env);
835 prerr_endline ("SUBST:"^Subst.ppsubst ~names subst);
837 let (_,p,(ty,l,r,_),m,id) = Equality.open_equality equality in
838 let cicmenv = Subst.apply_subst_metasenv subst (m @ menv) in
841 Equality.symmetric bag eq_ty l id uri m
845 Some (goalproof, p, id, subst, cicmenv)
850 let find_all_subsumed bag maxm env table (goalproof,menv,ty) =
852 | Cic.Appl[Cic.MutInd(uri,_,_);eq_ty;left;right]
853 when LibraryObjects.is_eq_URI uri ->
855 (Equality.mk_equality bag
856 (0,Equality.Exact (Cic.Implicit None),(eq_ty,left,right,Utils.Eq),menv))
859 (fun (subst, equality, swapped ) ->
860 let (_,p,(ty,l,r,_),m,id) = Equality.open_equality equality in
861 let cicmenv = Subst.apply_subst_metasenv subst (m @ menv) in
862 Indexing.check_for_duplicates cicmenv "from subsumption";
865 Equality.symmetric bag eq_ty l id uri m
868 in (goalproof, p, id, subst, cicmenv))
869 (Indexing.subsumption_all env table goal_equation)
870 (* (Indexing.unification_all env table goal_equation) *)
875 let check_if_goal_is_identity env = function
876 | (goalproof,m,Cic.Appl[Cic.MutInd(uri,_,ens);eq_ty;left;right])
877 when left = right && LibraryObjects.is_eq_URI uri ->
878 let reflproof = Equality.Exact (Equality.refl_proof uri eq_ty left) in
879 Some (goalproof, reflproof, 0, Subst.empty_subst,m)
880 | (goalproof,m,Cic.Appl[Cic.MutInd(uri,_,ens);eq_ty;left;right])
881 when LibraryObjects.is_eq_URI uri ->
882 (let _,context,_ = env in
885 Founif.unification [] m context left right CicUniv.empty_ugraph
887 let reflproof = Equality.Exact (Equality.refl_proof uri eq_ty left) in
888 let m = Subst.apply_subst_metasenv s m in
889 Some (goalproof, reflproof, 0, s,m)
890 with CicUnification.UnificationFailure _ -> None)
894 let rec check goal = function
898 | None -> check goal tl
899 | (Some p) as ok -> ok
902 let simplify_goal_set bag env goals active =
903 let active_goals, passive_goals = goals in
904 let find (_,_,g) where =
905 List.exists (fun (_,_,g1) -> Equality.meta_convertibility g g1) where
907 (* prova:tengo le passive semplificate
909 List.map (fun g -> snd (simplify_goal env g active)) passive_goals
912 (fun (acc_a,acc_p) goal ->
913 match simplify_goal bag env goal active with
916 if find g acc_p then acc_a,acc_p else acc_a,g::acc_p
918 if find g acc_a then acc_a,acc_p else g::acc_a,acc_p)
919 ([],passive_goals) active_goals
922 let check_if_goals_set_is_solved bag env active goals =
923 let active_goals, passive_goals = goals in
930 check_if_goal_is_identity env;
931 check_if_goal_is_subsumed bag env (snd active)])
932 (* provare active and passive?*)
936 let infer_goal_set bag env active goals =
937 let active_goals, passive_goals = goals in
938 let rec aux = function
939 | [] -> active_goals, []
941 let changed,selected = simplify_goal bag env hd active in
944 prerr_endline ("--------------- goal semplificato");
946 let (_,_,t1) = selected in
948 List.exists (fun (_,_,t) -> Equality.meta_convertibility t t1)
954 let passive_goals = tl in
955 let new_passive_goals =
956 if Utils.metas_of_term t1 = [] then passive_goals
958 let newmaxmeta,new' =
959 Indexing.superposition_left bag env (snd active) selected
962 maxmeta := newmaxmeta;
965 selected::active_goals, new_passive_goals
970 let infer_goal_set_with_current bag env current goals active =
971 let active_goals, passive_goals = simplify_goal_set bag env goals active in
972 let l,table,_ = build_table [current] in
976 let newmaxmeta, new' = Indexing.superposition_left bag env table g !maxmeta in
977 maxmeta := newmaxmeta;
979 passive_goals active_goals
984 let ids = List.map (fun _,_,i,_,_ -> i) p in
988 let ids_of_goal_set (ga,gp) =
989 List.flatten (List.map ids_of_goal ga) @
990 List.flatten (List.map ids_of_goal gp)
993 let size_of_goal_set_a (l,_) = List.length l;;
994 let size_of_goal_set_p (_,l) = List.length l;;
996 let pp_goals label goals context =
997 let names = Utils.names_of_context context in
1001 (Printf.sprintf "Current goal: %s = %s\n" label (CicPp.pp g names))))
1006 (Printf.sprintf "PASSIVE goal: %s = %s\n" label (CicPp.pp g names))))
1010 let print_status iterno goals active passive =
1012 (Printf.sprintf "\n%d #ACTIVES: %d #PASSIVES: %d #GOALSET: %d(%d)"
1013 iterno (size_of_active active) (size_of_passive passive)
1014 (size_of_goal_set_a goals) (size_of_goal_set_p goals)))
1017 (** given-clause algorithm with full reduction strategy: NEW implementation *)
1018 (* here goals is a set of goals in OR *)
1020 bag eq_uri ((_,context,_) as env) goals passive active
1021 goal_steps saturation_steps max_time
1023 let initial_time = Unix.gettimeofday () in
1024 let iterations_left iterno =
1025 let now = Unix.gettimeofday () in
1026 let time_left = max_time -. now in
1027 let time_spent_until_now = now -. initial_time in
1028 let iteration_medium_cost =
1029 time_spent_until_now /. (float_of_int iterno)
1031 let iterations_left = time_left /. iteration_medium_cost in
1032 int_of_float iterations_left
1034 let rec step goals passive active g_iterno s_iterno =
1035 if g_iterno > goal_steps && s_iterno > saturation_steps then
1036 (ParamodulationFailure ("No more iterations to spend",active,passive))
1037 else if Unix.gettimeofday () > max_time then
1038 (ParamodulationFailure ("No more time to spend",active,passive))
1041 print_status (max g_iterno s_iterno) goals active passive
1042 (* Printf.eprintf ".%!"; *)
1044 (* PRUNING OF PASSIVE THAT WILL NEVER BE PROCESSED *)
1046 let selection_estimate = iterations_left (max g_iterno s_iterno) in
1047 let kept = size_of_passive passive in
1048 if kept > selection_estimate then
1050 (*Printf.eprintf "Too many passive equalities: pruning...";
1051 prune_passive selection_estimate active*) passive
1056 kept_clauses := (size_of_passive passive) + (size_of_active active);
1058 if g_iterno < goal_steps then
1059 infer_goal_set bag env active goals
1063 match check_if_goals_set_is_solved bag env active goals with
1066 (Printf.sprintf "\nFound a proof in: %f\n"
1067 (Unix.gettimeofday() -. initial_time)));
1068 ParamodulationSuccess (p,active,passive)
1071 if passive_is_empty passive then
1072 if no_more_passive_goals goals then
1073 ParamodulationFailure
1074 ("No more passive equations/goals",active,passive)
1075 (*maybe this is a success! *)
1077 step goals passive active (g_iterno+1) (s_iterno+1)
1080 (* COLLECTION OF GARBAGED EQUALITIES *)
1081 if max g_iterno s_iterno mod 40 = 0 then
1083 print_status (max g_iterno s_iterno) goals active passive;
1084 let active = List.map Equality.id_of (fst active) in
1085 let passive = List.map Equality.id_of (fst passive) in
1086 let goal = ids_of_goal_set goals in
1087 Equality.collect bag active passive goal
1090 if s_iterno < saturation_steps then
1091 let current, passive = select env goals passive in
1092 (* SIMPLIFICATION OF CURRENT *)
1095 Equality.string_of_equality ~env current));
1096 forward_simplify bag eq_uri env current active, passive
1101 | None -> step goals passive active (g_iterno+1) (s_iterno+1)
1103 (* GENERATION OF NEW EQUATIONS *)
1104 (* prerr_endline "infer"; *)
1105 let new' = infer bag eq_uri env current active in
1106 (* prerr_endline "infer goal"; *)
1108 match check_if_goals_set_is_solved env active goals with
1111 (Printf.sprintf "Found a proof in: %f\n"
1112 (Unix.gettimeofday() -. initial_time));
1113 ParamodulationSuccess p
1118 let al, tbl = active in
1119 al @ [current], Indexing.index tbl current
1122 infer_goal_set_with_current bag env current goals active
1125 (* FORWARD AND BACKWARD SIMPLIFICATION *)
1126 (* prerr_endline "fwd/back simpl"; *)
1127 let rec simplify new' active passive =
1129 forward_simplify_new bag eq_uri env new' active
1131 let active, newa, pruned =
1132 backward_simplify bag eq_uri env new' active
1135 List.fold_left (filter_dependent bag) passive pruned
1138 | None -> active, passive, new'
1139 | Some p -> simplify (new' @ p) active passive
1141 let active, passive, new' =
1142 simplify new' active passive
1145 (* prerr_endline "simpl goal with new"; *)
1147 let a,b,_ = build_table new' in
1148 (* let _ = <:start<simplify_goal_set new>> in *)
1149 let rc = simplify_goal_set bag env goals (a,b) in
1150 (* let _ = <:stop<simplify_goal_set new>> in *)
1153 let passive = add_to_passive passive new' [] in
1154 step goals passive active (g_iterno+1) (s_iterno+1)
1157 step goals passive active 1 1
1160 let rec saturate_equations bag eq_uri env goal accept_fun passive active =
1161 elapsed_time := Unix.gettimeofday () -. !start_time;
1162 if !elapsed_time > !time_limit then
1165 let current, passive = select env ([goal],[]) passive in
1166 let res = forward_simplify bag eq_uri env current active in
1169 saturate_equations bag eq_uri env goal accept_fun passive active
1171 Utils.debug_print (lazy (Printf.sprintf "selected: %s"
1172 (Equality.string_of_equality ~env current)));
1173 let new' = infer bag eq_uri env current active in
1175 if Equality.is_identity env current then active
1177 let al, tbl = active in
1178 al @ [current], Indexing.index tbl current
1180 (* alla fine new' contiene anche le attive semplificate!
1181 * quindi le aggiungo alle passive insieme alle new *)
1182 let rec simplify new' active passive =
1183 let new' = forward_simplify_new bag eq_uri env new' active in
1184 let active, newa, pruned =
1185 backward_simplify bag eq_uri env new' active in
1187 List.fold_left (filter_dependent bag) passive pruned in
1189 | None -> active, passive, new'
1190 | Some p -> simplify (new' @ p) active passive
1192 let active, passive, new' = simplify new' active passive in
1196 (Printf.sprintf "active:\n%s\n"
1199 (fun e -> Equality.string_of_equality ~env e)
1205 (Printf.sprintf "new':\n%s\n"
1208 (fun e -> "Negative " ^
1209 (Equality.string_of_equality ~env e)) new'))))
1211 let new' = List.filter accept_fun new' in
1212 let passive = add_to_passive passive new' [] in
1213 saturate_equations bag eq_uri env goal accept_fun passive active
1216 let default_depth = !maxdepth
1217 and default_width = !maxwidth;;
1221 symbols_counter := 0;
1222 weight_age_counter := !weight_age_ratio;
1223 processed_clauses := 0;
1226 maximal_retained_equality := None;
1228 forward_simpl_time := 0.;
1229 forward_simpl_new_time := 0.;
1230 backward_simpl_time := 0.;
1231 passive_maintainance_time := 0.;
1232 derived_clauses := 0;
1236 let eq_of_goal = function
1237 | Cic.Appl [Cic.MutInd(uri,0,_);_;_;_] when LibraryObjects.is_eq_URI uri ->
1239 | _ -> raise (ProofEngineTypes.Fail (lazy ("The goal is not an equality ")))
1242 let eq_and_ty_of_goal = function
1243 | Cic.Appl [Cic.MutInd(uri,0,_);t;_;_] when LibraryObjects.is_eq_URI uri ->
1245 | _ -> raise (ProofEngineTypes.Fail (lazy ("The goal is not an equality ")))
1248 (* fix proof takes in input a term and try to build a metasenv for it *)
1250 let fix_proof metasenv context all_implicits p =
1251 let rec aux metasenv n p =
1254 if all_implicits then
1255 metasenv,Cic.Implicit None
1258 CicMkImplicit.identity_relocation_list_for_metavariable context
1260 let meta = CicSubstitution.lift n (Cic.Meta (i,irl)) in
1263 let _ = CicUtil.lookup_meta i metasenv in metasenv
1264 with CicUtil.Meta_not_found _ ->
1265 debug_print (lazy ("not found: "^(string_of_int i)));
1266 let metasenv,j = CicMkImplicit.mk_implicit_type metasenv [] context in
1267 (i,context,Cic.Meta(j,irl))::metasenv
1273 (fun a (metasenv,l) ->
1274 let metasenv,a' = aux metasenv n a in
1277 in metasenv,Cic.Appl l
1278 | Cic.Lambda(name,s,t) ->
1279 let metasenv,s = aux metasenv n s in
1280 let metasenv,t = aux metasenv (n+1) t in
1281 metasenv,Cic.Lambda(name,s,t)
1282 | Cic.Prod(name,s,t) ->
1283 let metasenv,s = aux metasenv n s in
1284 let metasenv,t = aux metasenv (n+1) t in
1285 metasenv,Cic.Prod(name,s,t)
1286 | Cic.LetIn(name,s,ty,t) ->
1287 let metasenv,s = aux metasenv n s in
1288 let metasenv,ty = aux metasenv n ty in
1289 let metasenv,t = aux metasenv (n+1) t in
1290 metasenv,Cic.LetIn(name,s,ty,t)
1291 | Cic.Const(uri,ens) ->
1294 (fun (v,a) (metasenv,ens) ->
1295 let metasenv,a' = aux metasenv n a in
1296 metasenv,(v,a')::ens)
1299 metasenv,Cic.Const(uri,ens)
1305 let fix_metasenv context metasenv =
1308 let m,t = fix_proof m context false t in
1309 let m = List.filter (fun (j,_,_) -> j<>i) m in
1315 (* status: input proof status
1316 * goalproof: forward steps on goal
1317 * newproof: backward steps
1318 * subsumption_id: the equation used if goal is closed by subsumption
1319 * (0 if not closed by subsumption) (DEBUGGING: can be safely removed)
1320 * subsumption_subst: subst to make newproof and goalproof match
1321 * proof_menv: final metasenv
1326 goalproof newproof subsumption_id subsumption_subst proof_menv
1328 if proof_menv = [] then debug_print (lazy "+++++++++++++++VUOTA")
1329 else debug_print (lazy (CicMetaSubst.ppmetasenv [] proof_menv));
1330 let proof, goalno = status in
1331 let uri, metasenv, _subst, meta_proof, term_to_prove, attrs = proof in
1332 let _, context, type_of_goal = CicUtil.lookup_meta goalno metasenv in
1333 let eq_uri = eq_of_goal type_of_goal in
1334 let names = Utils.names_of_context context in
1335 debug_print (lazy "Proof:");
1337 (Equality.pp_proof bag names goalproof newproof subsumption_subst
1338 subsumption_id type_of_goal));
1340 prerr_endline ("max weight: " ^
1341 (string_of_int (Equality.max_weight goalproof newproof)));
1343 (* generation of the CIC proof *)
1344 (* let metasenv' = List.filter (fun i,_,_ -> i<>goalno) metasenv in *)
1346 List.filter (fun i -> i <> goalno)
1347 (ProofEngineHelpers.compare_metasenvs
1348 ~newmetasenv:metasenv ~oldmetasenv:proof_menv) in
1349 let goal_proof, side_effects_t =
1350 let initial = Equality.add_subst subsumption_subst newproof in
1351 Equality.build_goal_proof bag
1352 eq_uri goalproof initial type_of_goal side_effects
1355 (* Equality.draw_proof bag names goalproof newproof subsumption_id; *)
1356 let goal_proof = Subst.apply_subst subsumption_subst goal_proof in
1357 (* assert (metasenv=[]); *)
1358 let real_menv = fix_metasenv context (proof_menv@metasenv) in
1359 let real_menv,goal_proof =
1360 fix_proof real_menv context false goal_proof in
1362 let real_menv,fixed_proof = fix_proof proof_menv context false goal_proof in
1363 (* prerr_endline ("PROOF: " ^ CicPp.pp goal_proof names); *)
1365 let pp_error goal_proof names error exn =
1366 prerr_endline "THE PROOF DOES NOT TYPECHECK! <begin>";
1367 prerr_endline (CicPp.pp goal_proof names);
1368 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1369 prerr_endline error;
1370 prerr_endline "THE PROOF DOES NOT TYPECHECK! <end>";
1373 let old_insert_coercions = !CicRefine.insert_coercions in
1374 let goal_proof,goal_ty,real_menv,_ =
1375 (* prerr_endline ("parte la refine per: " ^ (CicPp.pp goal_proof names)); *)
1377 debug_print (lazy (CicPp.ppterm goal_proof));
1378 CicRefine.insert_coercions := false;
1380 CicRefine.type_of_aux'
1381 real_menv context goal_proof CicUniv.empty_ugraph
1383 CicRefine.insert_coercions := old_insert_coercions;
1386 | CicRefine.RefineFailure s
1387 | CicRefine.Uncertain s
1388 | CicRefine.AssertFailure s as exn ->
1389 CicRefine.insert_coercions := old_insert_coercions;
1390 pp_error goal_proof names (Lazy.force s) exn
1391 | CicUtil.Meta_not_found i as exn ->
1392 CicRefine.insert_coercions := old_insert_coercions;
1393 pp_error goal_proof names ("META NOT FOUND: "^string_of_int i) exn
1394 | Invalid_argument "list_fold_left2" as exn ->
1395 CicRefine.insert_coercions := old_insert_coercions;
1396 pp_error goal_proof names "Invalid_argument: list_fold_left2" exn
1398 CicRefine.insert_coercions := old_insert_coercions;
1401 let subst_side_effects,real_menv,_ =
1403 CicUnification.fo_unif_subst [] context real_menv
1404 goal_ty type_of_goal CicUniv.empty_ugraph
1406 | CicUnification.UnificationFailure s
1407 | CicUnification.Uncertain s
1408 | CicUnification.AssertFailure s -> assert false
1409 (* fail "Maybe the local context of metas in the goal was not an IRL" s *)
1411 Utils.debug_print (lazy "+++++++++++++ FINE UNIF");
1413 (goalno,(context,goal_proof,type_of_goal))::subst_side_effects
1416 let metas_of_proof = Utils.metas_of_term goal_proof in
1418 let proof, real_metasenv =
1419 ProofEngineHelpers.subst_meta_and_metasenv_in_proof
1420 proof goalno final_subst
1421 (List.filter (fun i,_,_ -> i<>goalno ) real_menv)
1424 (ProofEngineHelpers.compare_metasenvs
1425 ~oldmetasenv:metasenv ~newmetasenv:real_metasenv) in
1428 List.map (fun i,_,_ -> i) real_metasenv in
1430 final_subst, proof, open_goals
1435 let metas_still_open_in_proof = Utils.metas_of_term goal_proof in
1436 (* prerr_endline (CicPp.pp goal_proof names); *)
1437 let goal_proof = (* Subst.apply_subst subsumption_subst *) goal_proof in
1438 let side_effects_t =
1439 List.map (Subst.apply_subst subsumption_subst) side_effects_t
1441 (* replacing fake mets with real ones *)
1442 (* prerr_endline "replacing metas..."; *)
1443 let irl=CicMkImplicit.identity_relocation_list_for_metavariable context in
1444 if proof_menv = [] then prerr_endline "VUOTA";
1445 CicMetaSubst.ppmetasenv [] proof_menv;
1446 let what, with_what =
1448 (fun (acc1,acc2) i ->
1449 (Cic.Meta(i,[]))::acc1, (Cic.Implicit None)::acc2)
1451 metas_still_open_in_proof
1455 List.mem i metas_still_open_in_proof
1456 (*&& not(List.mem i metas_still_open_in_goal)*))
1460 let goal_proof_menv =
1462 (fun (i,_,_) -> List.mem i metas_still_open_in_proof)
1466 (* we need this fake equality since the metas of the hypothesis may be
1467 * with a real local context *)
1468 ProofEngineReduction.replace_lifting
1469 ~equality:(fun x y ->
1470 match x,y with Cic.Meta(i,_),Cic.Meta(j,_) -> i=j | _-> false)
1471 ~what ~with_what ~where
1473 let goal_proof = replace goal_proof in
1474 (* ok per le meta libere... ma per quelle che c'erano e sono rimaste?
1475 * what mi pare buono, sostituisce solo le meta farlocche *)
1476 let side_effects_t = List.map replace side_effects_t in
1478 List.filter (fun i -> i <> goalno)
1479 (ProofEngineHelpers.compare_metasenvs
1480 ~oldmetasenv:metasenv ~newmetasenv:goal_proof_menv)
1484 * String.concat "," (List.map string_of_int free_metas) ); *)
1485 (* check/refine/... build the new proof *)
1487 ProofEngineReduction.replace
1488 ~what:side_effects ~with_what:side_effects_t
1489 ~equality:(fun i t -> match t with Cic.Meta(j,_)->j=i|_->false)
1492 let goal_proof,goal_ty,real_menv,_ =
1493 prerr_endline "parte la refine";
1495 CicRefine.type_of_aux' metasenv context goal_proof
1496 CicUniv.empty_ugraph
1498 | CicUtil.Meta_not_found _
1499 | CicRefine.RefineFailure _
1500 | CicRefine.Uncertain _
1501 | CicRefine.AssertFailure _
1502 | Invalid_argument "list_fold_left2" as exn ->
1503 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1504 prerr_endline (CicPp.pp goal_proof names);
1505 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1508 prerr_endline "+++++++++++++ METASENV";
1510 (CicMetaSubst.ppmetasenv [] real_menv);
1511 let subst_side_effects,real_menv,_ =
1513 prerr_endline ("XX type_of_goal " ^ CicPp.ppterm type_of_goal);
1514 prerr_endline ("XX replaced_goal " ^ CicPp.ppterm replaced_goal);
1515 prerr_endline ("XX metasenv " ^
1516 CicMetaSubst.ppmetasenv [] (metasenv @ free_metas_menv));
1519 CicUnification.fo_unif_subst [] context real_menv
1520 goal_ty type_of_goal CicUniv.empty_ugraph
1522 | CicUnification.UnificationFailure s
1523 | CicUnification.Uncertain s
1524 | CicUnification.AssertFailure s -> assert false
1525 (* fail "Maybe the local context of metas in the goal was not an IRL" s *)
1528 (goalno,(context,goal_proof,type_of_goal))::subst_side_effects
1531 let metas_of_proof = Utils.metas_of_term goal_proof in
1533 let proof, real_metasenv =
1534 ProofEngineHelpers.subst_meta_and_metasenv_in_proof
1535 proof goalno (CicMetaSubst.apply_subst final_subst)
1536 (List.filter (fun i,_,_ -> i<>goalno ) real_menv)
1539 List.map (fun i,_,_ -> i) real_metasenv in
1542 HExtlib.list_uniq (List.sort Pervasives.compare metas_of_proof)
1545 match free_meta with Some(Cic.Meta(m,_)) when m<>goalno ->[m] | _ ->[]
1550 "GOALS APERTI: %s\nMETASENV PRIMA:\n%s\nMETASENV DOPO:\n%s\n"
1551 (String.concat ", " (List.map string_of_int open_goals))
1552 (CicMetaSubst.ppmetasenv [] metasenv)
1553 (CicMetaSubst.ppmetasenv [] real_metasenv);
1555 final_subst, proof, open_goals
1559 (* **************** HERE ENDS THE PARAMODULATION STUFF ******************** *)
1561 (* exported functions *)
1563 let pump_actives context bag maxm active passive saturation_steps max_time =
1569 (fun acc e -> let _,_,_,menv,_ = Equality.open_equality e in
1570 List.fold_left (fun acc (i,_,_) -> max i acc) acc menv)
1573 (* let active_l = fst active in *)
1574 (* let passive_l = fst passive in *)
1575 (* let ma = max_l active_l in *)
1576 (* let mp = max_l passive_l in *)
1577 match LibraryObjects.eq_URI () with
1578 | None -> active, passive, !maxmeta
1580 let env = [],context,CicUniv.empty_ugraph in
1582 given_clause bag eq_uri env ([],[])
1583 passive active 0 saturation_steps max_time
1585 | ParamodulationFailure (_,a,p) ->
1587 | ParamodulationSuccess _ ->
1591 let all_subsumed bag maxm status active passive =
1593 let proof, goalno = status in
1594 let uri, metasenv, _subst, meta_proof, term_to_prove, attrs = proof in
1595 let _, context, type_of_goal = CicUtil.lookup_meta goalno metasenv in
1596 let env = metasenv,context,CicUniv.empty_ugraph in
1597 let cleaned_goal = Utils.remove_local_context type_of_goal in
1598 let canonical_menv,other_menv =
1599 List.partition (fun (_,c,_) -> c = context) metasenv in
1600 (* prerr_endline ("other menv = " ^ (CicMetaSubst.ppmetasenv [] other_menv)); *)
1601 let metasenv = List.map (fun (i,_,ty)-> (i,[],ty)) canonical_menv in
1602 let goal = [], List.filter (fun (i,_,_)->i<>goalno) metasenv, cleaned_goal in
1603 debug_print (lazy (string_of_int (List.length (fst active))));
1604 (* we simplify using both actives passives *)
1607 (fun (l,tbl) eq -> eq::l,(Indexing.index tbl eq))
1608 active (list_of_passive passive) in
1609 let (_,_,ty) = goal in
1610 debug_print (lazy ("prima " ^ CicPp.ppterm ty));
1611 let _,goal = simplify_goal bag env goal table in
1612 let (_,_,ty) = goal in
1613 debug_print (lazy ("in mezzo " ^ CicPp.ppterm ty));
1614 let subsumed = find_all_subsumed bag !maxmeta env (snd table) goal in
1615 debug_print (lazy ("dopo " ^ CicPp.ppterm ty));
1616 let subsumed_or_id =
1617 match (check_if_goal_is_identity env goal) with
1619 | Some id -> id::subsumed in
1620 debug_print (lazy "dopo subsumed");
1624 (goalproof,newproof,subsumption_id,subsumption_subst, proof_menv) ->
1625 let subst, proof, gl =
1627 status goalproof newproof subsumption_id subsumption_subst proof_menv
1629 let uri, metasenv, subst, meta_proof, term_to_prove, attrs = proof in
1633 (fun x,_,_ -> not (List.exists (fun y,_,_ -> x=y) other_menv)) metasenv
1635 let proof = uri, newmetasenv, subst, meta_proof, term_to_prove, attrs in
1636 (subst, proof,gl)) subsumed_or_id
1642 bag maxm status active passive goal_steps saturation_steps max_time
1646 let active_l = fst active in
1650 (fun acc e -> let _,_,_,menv,_ = Equality.open_equality e in
1651 List.fold_left (fun acc (i,_,_) -> max i acc) acc menv)
1654 let passive_l = fst passive in
1655 let ma = max_l active_l in
1656 let mp = max_l passive_l in
1658 let proof, goalno = status in
1659 let uri, metasenv, _subst, meta_proof, term_to_prove, attrs = proof in
1660 let _, context, type_of_goal = CicUtil.lookup_meta goalno metasenv in
1661 let eq_uri = eq_of_goal type_of_goal in
1662 let cleaned_goal = Utils.remove_local_context type_of_goal in
1663 let canonical_menv,other_menv =
1664 List.partition (fun (_,c,_) -> c = context) metasenv in
1665 (* prerr_endline ("other menv = " ^ (CicMetaSubst.ppmetasenv [] other_menv)); *)
1666 Utils.set_goal_symbols cleaned_goal; (* DISACTIVATED *)
1667 let canonical_menv = List.map (fun (i,_,ty)-> (i,[],ty)) canonical_menv in
1668 let metasenv' = List.filter (fun (i,_,_)->i<>goalno) canonical_menv in
1669 let goal = [], metasenv', cleaned_goal in
1670 let env = metasenv,context,CicUniv.empty_ugraph in
1671 debug_print (lazy ">>>>>> ACTIVES >>>>>>>>");
1672 List.iter (fun e -> debug_print (lazy (Equality.string_of_equality ~env e)))
1674 debug_print (lazy ">>>>>>>>>>>>>>");
1675 let goals = make_goal_set goal in
1677 given_clause bag eq_uri env goals passive active
1678 goal_steps saturation_steps max_time
1680 | ParamodulationFailure (_,a,p) ->
1681 None, a, p, !maxmeta
1682 | ParamodulationSuccess
1683 ((goalproof,newproof,subsumption_id,subsumption_subst, proof_menv),a,p) ->
1684 let subst, proof, gl =
1686 status goalproof newproof subsumption_id subsumption_subst proof_menv
1688 let uri, metasenv, subst, meta_proof, term_to_prove, attrs = proof in
1689 let proof = uri, other_menv@metasenv, subst, meta_proof, term_to_prove, attrs in
1690 Some (subst, proof,gl),a,p, !maxmeta
1694 let add_to_passive eql passives =
1695 add_to_passive passives eql eql