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 (*EqualitySet.elements set*) eq_list, set (* see applys.ma *)
130 let make_empty_active () = [], Indexing.empty ;;
131 let make_active eq_list =
132 eq_list, List.fold_left Indexing.index Indexing.empty eq_list
135 let size_of_passive (passive_list, _) = List.length passive_list;;
136 let size_of_active (active_list, _) = List.length active_list;;
137 let passive_is_empty = function
138 | [], s when EqualitySet.is_empty s -> true
139 | [], s -> assert false (* the set and the list should be in sync *)
143 type goals = Equality.goal list * Equality.goal list
145 let no_more_passive_goals g = match g with | _,[] -> true | _ -> false;;
148 let age_factor = 0.01;;
151 selects one equality from passive. The selection strategy is a combination
152 of weight, age and goal-similarity
155 let rec select env g passive =
156 processed_clauses := !processed_clauses + 1;
159 match (List.rev goals) with goal::_ -> goal | _ -> assert false
162 let pos_list, pos_set = passive in
163 let remove eq l = List.filter (fun e -> Equality.compare e eq <> 0) l in
164 if !weight_age_ratio > 0 then
165 weight_age_counter := !weight_age_counter - 1;
166 match !weight_age_counter with
168 weight_age_counter := !weight_age_ratio;
169 let skip_giant pos_list pos_set =
171 | (hd:EqualitySet.elt)::tl ->
172 let w,_,_,_,_ = Equality.open_equality hd in
174 hd, (tl, EqualitySet.remove hd pos_set)
178 ("+++ skipping giant of size "^string_of_int w^" +++");
180 select env g (tl@[hd],pos_set)
183 skip_giant pos_list pos_set)
186 let rec skip_giant pos_list pos_set =
188 | (hd:EqualitySet.elt)::tl ->
189 let w,_,_,_,_ = Equality.open_equality hd in
190 let pos_set = EqualitySet.remove hd pos_set in
195 ("+++ skipping giant of size "^string_of_int w^" +++");
196 skip_giant tl pos_set)
199 skip_giant pos_list pos_set)
203 | _ when (!symbols_counter > 0) ->
204 (symbols_counter := !symbols_counter - 1;
205 let cardinality map =
206 Utils.TermMap.fold (fun k v res -> res + v) map 0
209 let _, _, term = goal in
210 Utils.symbols_of_term term
212 let card = cardinality symbols in
213 let foldfun k v (r1, r2) =
214 if Utils.TermMap.mem k symbols then
215 let c = Utils.TermMap.find k symbols in
216 let c1 = abs (c - v) in
222 let f equality (i, e) =
224 Utils.TermMap.fold foldfun (symbols_of_equality equality) (0, 0)
226 let c = others + (abs (common - card)) in
227 if c < i then (c, equality)
230 let e1 = EqualitySet.min_elt pos_set in
233 Utils.TermMap.fold foldfun (symbols_of_equality e1) (0, 0)
235 (others + (abs (common - card))), e1
237 let _, current = EqualitySet.fold f pos_set initial in
239 (remove current pos_list, EqualitySet.remove current pos_set))
242 symbols_counter := !symbols_ratio;
244 let w1,_,_,_,_ = Equality.open_equality e1 in
245 let w2,_,_,_,_ = Equality.open_equality e2 in
246 if w1 < w2 then e1 else e2
248 let rec my_min_elt min = function
250 | hd::tl -> my_min_elt (my_min hd min) tl
252 (* let current = EqualitySet.min_elt pos_set in *)
253 let current = my_min_elt (List.hd pos_list) (List.tl pos_list) in
254 current,(remove current pos_list, EqualitySet.remove current pos_set)
258 let filter_dependent bag passive id =
259 let pos_list, pos_set = passive in
260 let passive,no_pruned =
262 (fun eq ((list,set),no) ->
263 if Equality.depend bag eq id then
264 (list, EqualitySet.remove eq set), no + 1
267 pos_list (([],pos_set),0)
270 if no_pruned > 0 then
271 prerr_endline ("+++ pruning "^ string_of_int no_pruned ^" passives +++");
277 (* adds to passive a list of equalities new_pos *)
278 let add_to_passive passive new_pos preferred =
279 let pos_list, pos_set = passive in
280 let ok set equality = not (EqualitySet.mem equality set) in
281 let pos = List.filter (ok pos_set) new_pos in
282 let add set equalities =
283 List.fold_left (fun s e -> EqualitySet.add e s) set equalities
285 let pos_head, pos_tail =
287 (fun e -> List.exists (fun x -> Equality.compare x e = 0) preferred)
290 pos_head @ pos_list @ pos_tail, add pos_set pos
294 (* removes from passive equalities that are estimated impossible to activate
295 within the current time limit *)
296 let prune_passive howmany (active, _) passive =
297 let (pl, ps), tbl = passive in
298 let howmany = float_of_int howmany
299 and ratio = float_of_int !weight_age_ratio in
302 int_of_float (if t -. v < 0.5 then t else v)
304 let in_weight = round (howmany *. ratio /. (ratio +. 1.))
305 and in_age = round (howmany /. (ratio +. 1.)) in
307 (lazy (Printf.sprintf "in_weight: %d, in_age: %d\n" in_weight in_age));
308 let counter = ref !symbols_ratio in
313 counter := !counter - 1;
314 if !counter = 0 then counter := !symbols_ratio in
315 let e = EqualitySet.min_elt ps in
316 let ps' = pickw (w-1) (EqualitySet.remove e ps) in
317 EqualitySet.add e ps'
319 let e = EqualitySet.min_elt ps in
320 let ps' = pickw (w-1) (EqualitySet.remove e ps) in
321 EqualitySet.add e ps'
325 let ps = pickw in_weight ps in
326 let rec picka w s l =
330 | hd::tl when not (EqualitySet.mem hd s) ->
331 let w, s, l = picka (w-1) s tl in
332 w, EqualitySet.add hd s, hd::l
334 let w, s, l = picka w s tl in
339 let _, ps, pl = picka in_age ps pl in
340 if not (EqualitySet.is_empty ps) then
341 maximal_retained_equality := Some (EqualitySet.max_elt ps);
344 (fun e tbl -> Indexing.index tbl e) ps Indexing.empty
350 (** inference of new equalities between current and some in active *)
351 let infer bag eq_uri env current (active_list, active_table) =
353 if Utils.debug_metas then
354 (ignore(Indexing.check_target bag c current "infer1");
355 ignore(List.map (function current -> Indexing.check_target bag c current "infer2") active_list));
357 let maxm, copy_of_current = Equality.fix_metas bag !maxmeta current in
359 let active_table = Indexing.index active_table copy_of_current in
360 (* let _ = <:start<current contro active>> in *)
362 Indexing.superposition_right bag eq_uri !maxmeta env active_table current
364 (* let _ = <:stop<current contro active>> in *)
365 if Utils.debug_metas then
368 Indexing.check_target bag c current "sup0") res);
370 let rec infer_positive table = function
374 Indexing.superposition_right bag
375 ~subterms_only:true eq_uri !maxmeta env table equality
378 if Utils.debug_metas then
382 Indexing.check_target bag c current "sup2") res);
383 let pos = infer_positive table tl in
387 let maxm, copy_of_current = Equality.fix_metas !maxmeta current in
390 let curr_table = Indexing.index Indexing.empty current in
391 (* let _ = <:start<active contro current>> in *)
392 let pos = infer_positive curr_table ((*copy_of_current::*)active_list) in
393 (* let _ = <:stop<active contro current>> in *)
394 if Utils.debug_metas then
397 Indexing.check_target bag c current "sup3") pos);
400 derived_clauses := !derived_clauses + (List.length new_pos);
401 match !maximal_retained_equality with
404 ignore(assert false);
405 (* if we have a maximal_retained_equality, we can discard all equalities
406 "greater" than it, as they will never be reached... An equality is
407 greater than maximal_retained_equality if it is bigger
408 wrt. OrderedEquality.compare and it is less similar than
409 maximal_retained_equality to the current goal *)
410 List.filter (fun e -> OrderedEquality.compare e eq <= 0) new_pos
413 let check_for_deep_subsumption env active_table eq =
414 let _,_,(eq_ty, left, right, order),metas,id = Equality.open_equality eq in
415 let check_subsumed deep l r =
417 Equality.mk_tmp_equality(0,(eq_ty,l,r,Utils.Incomparable),metas)in
418 match Indexing.subsumption env active_table eqtmp with
422 let rec aux b (ok_so_far, subsumption_used) t1 t2 =
424 | t1, t2 when not ok_so_far -> ok_so_far, subsumption_used
425 | t1, t2 when subsumption_used -> t1 = t2, subsumption_used
426 | Cic.Appl (h1::l),Cic.Appl (h2::l') ->
427 let rc = check_subsumed b t1 t2 in
433 (fun (ok_so_far, subsumption_used) t t' ->
434 aux true (ok_so_far, subsumption_used) t t')
435 (ok_so_far, subsumption_used) l l'
436 with Invalid_argument _ -> false,subsumption_used)
438 false, subsumption_used
439 | _ -> false, subsumption_used
441 fst (aux false (true,false) left right)
444 (** simplifies current using active and passive *)
445 let forward_simplify bag eq_uri env current (active_list, active_table) =
446 let _, context, _ = env in
447 let demodulate table current =
448 let newmeta, newcurrent =
449 Indexing.demodulation_equality bag eq_uri !maxmeta env table current
452 if Equality.is_identity env newcurrent then None else Some newcurrent
455 if Utils.debug_metas then
456 ignore (Indexing.check_target bag context current "demod0");
457 let res = demodulate active_table current in
458 if Utils.debug_metas then
459 ignore ((function None -> () | Some x ->
460 ignore (Indexing.check_target bag context x "demod1");()) res);
463 let res = demod current in
467 if Indexing.in_index active_table c ||
468 check_for_deep_subsumption env active_table c
475 (** simplifies new using active and passive *)
476 let forward_simplify_new bag eq_uri env new_pos active =
477 if Utils.debug_metas then
481 (fun current -> Indexing.check_target bag c current "forward new pos")
484 let active_list, active_table = active in
485 let demodulate table target =
486 let newmeta, newtarget =
487 Indexing.demodulation_equality bag eq_uri !maxmeta env table target
492 (* we could also demodulate using passive. Currently we don't *)
493 let new_pos = List.map (demodulate active_table) new_pos in
497 if not (Equality.is_identity env e) then
500 EqualitySet.empty new_pos
502 let new_pos = EqualitySet.elements new_pos_set in
504 let subs e = Indexing.subsumption env active_table e = None in
505 let is_duplicate e = not (Indexing.in_index active_table e) in
506 List.filter subs (List.filter is_duplicate new_pos)
510 (** simplifies a goal with equalities in active and passive *)
511 let rec simplify_goal bag env goal (active_list, active_table) =
512 let demodulate table goal = Indexing.demodulation_goal bag env table goal in
513 let changed, goal = demodulate active_table goal in
518 snd (simplify_goal bag env goal (active_list, active_table))
522 let simplify_goals bag env goals active =
523 let a_goals, p_goals = goals in
524 let p_goals = List.map (fun g -> snd (simplify_goal bag env g active)) p_goals in
525 let a_goals = List.map (fun g -> snd (simplify_goal bag env g active)) a_goals in
530 (** simplifies active usign new *)
531 let backward_simplify_active
532 bag eq_uri env new_pos new_table min_weight active
534 let active_list, active_table = active in
535 let active_list, newa, pruned =
537 (fun equality (res, newn,pruned) ->
538 let ew, _, _, _,id = Equality.open_equality equality in
539 if ew < min_weight then
540 equality::res, newn,pruned
543 forward_simplify bag eq_uri env equality (new_pos, new_table)
545 | None -> res, newn, id::pruned
547 if Equality.compare equality e = 0 then
550 res, e::newn, pruned)
551 active_list ([], [],[])
554 List.exists (Equality.meta_convertibility_eq eq1) where
557 let _, _, _, _,id = Equality.open_equality eq in id
559 let ((active1,pruned),tbl), newa =
561 (fun eq ((res,pruned), tbl) ->
562 if List.mem eq res then
563 (res, (id_of_eq eq)::pruned),tbl
564 else if (Equality.is_identity env eq) || (find eq res) then (
565 (res, (id_of_eq eq)::pruned),tbl
568 (eq::res,pruned), Indexing.index tbl eq)
569 active_list (([],pruned), Indexing.empty),
572 if (Equality.is_identity env eq) then p
577 | [] -> (active1,tbl), None, pruned
578 | _ -> (active1,tbl), Some newa, pruned
582 (** simplifies passive using new *)
583 let backward_simplify_passive
584 bag eq_uri env new_pos new_table min_weight passive
586 let (pl, ps), passive_table = passive in
587 let f equality (resl, ress, newn) =
588 let ew, _, _, _ , _ = Equality.open_equality equality in
589 if ew < min_weight then
590 equality::resl, ress, newn
593 forward_simplify bag eq_uri env equality (new_pos, new_table)
595 | None -> resl, EqualitySet.remove equality ress, newn
598 equality::resl, ress, newn
600 let ress = EqualitySet.remove equality ress in
603 let pl, ps, newp = List.fold_right f pl ([], ps, []) in
606 (fun tbl e -> Indexing.index tbl e) Indexing.empty pl
609 | [] -> ((pl, ps), passive_table), None
610 | _ -> ((pl, ps), passive_table), Some (newp)
613 let build_table equations =
616 let ew, _, _, _ , _ = Equality.open_equality e in
617 e::l, Indexing.index t e, min ew w)
618 ([], Indexing.empty, 1000000) equations
622 let backward_simplify bag eq_uri env new' active =
623 let new_pos, new_table, min_weight = build_table new' in
624 let active, newa, pruned =
625 backward_simplify_active bag eq_uri env new_pos new_table min_weight active
630 let close bag eq_uri env new' given =
631 let new_pos, new_table, min_weight =
634 let ew, _, _, _ , _ = Equality.open_equality e in
635 e::l, Indexing.index t e, min ew w)
636 ([], Indexing.empty, 1000000) (snd new')
640 let pos = infer bag eq_uri env c (new_pos,new_table) in
645 let is_commutative_law eq =
646 let w, proof, (eq_ty, left, right, order), metas , _ =
647 Equality.open_equality eq
649 match left,right with
650 Cic.Appl[f1;Cic.Meta _ as a1;Cic.Meta _ as b1],
651 Cic.Appl[f2;Cic.Meta _ as a2;Cic.Meta _ as b2] ->
652 f1 = f2 && a1 = b2 && a2 = b1
656 let prova bag eq_uri env new' active =
657 let given = List.filter is_commutative_law (fst active) in
661 (Printf.sprintf "symmetric:\n%s\n"
664 (fun e -> Equality.string_of_equality ~env e)
666 close bag eq_uri env new' given
669 (* returns an estimation of how many equalities in passive can be activated
670 within the current time limit *)
671 let get_selection_estimate () =
672 elapsed_time := (Unix.gettimeofday ()) -. !start_time;
673 (* !processed_clauses * (int_of_float (!time_limit /. !elapsed_time)) *)
675 ceil ((float_of_int !processed_clauses) *.
676 ((!time_limit (* *. 2. *)) /. !elapsed_time -. 1.)))
680 (** initializes the set of goals *)
681 let make_goals goal =
683 and passive = [0, [goal]] in
687 let make_goal_set goal =
691 (** initializes the set of theorems *)
692 let make_theorems theorems =
697 let activate_goal (active, passive) =
700 | goal_conj::tl -> true, (goal_conj::active, tl)
701 | [] -> false, (active, passive)
703 true, (active,passive)
707 let activate_theorem (active, passive) =
709 | theorem::tl -> true, (theorem::active, tl)
710 | [] -> false, (active, passive)
715 let simplify_theorems bag env theorems ?passive (active_list, active_table) =
716 let pl, passive_table =
719 | Some ((pn, _), (pp, _), pt) -> pn @ pp, Some pt
721 let a_theorems, p_theorems = theorems in
722 let demodulate table theorem =
723 let newmeta, newthm =
724 Indexing.demodulation_theorem bag !maxmeta env table theorem in
726 theorem != newthm, newthm
728 let foldfun table (a, p) theorem =
729 let changed, theorem = demodulate table theorem in
730 if changed then (a, theorem::p) else (theorem::a, p)
732 let mapfun table theorem = snd (demodulate table theorem) in
733 match passive_table with
735 let p_theorems = List.map (mapfun active_table) p_theorems in
736 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems
737 | Some passive_table ->
738 let p_theorems = List.map (mapfun active_table) p_theorems in
739 let p_theorems, a_theorems =
740 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems in
741 let p_theorems = List.map (mapfun passive_table) p_theorems in
742 List.fold_left (foldfun passive_table) ([], p_theorems) a_theorems
746 let rec simpl bag eq_uri env e others others_simpl =
747 let active = others @ others_simpl in
751 if Equality.is_identity env e then t else Indexing.index t e)
752 Indexing.empty active
755 forward_simplify bag eq_uri env e (active, tbl)
760 | None -> simpl bag eq_uri env hd tl others_simpl
761 | Some e -> simpl bag eq_uri env hd tl (e::others_simpl)
765 | None -> others_simpl
766 | Some e -> e::others_simpl
770 let simplify_equalities bag eq_uri env equalities =
773 (Printf.sprintf "equalities:\n%s\n"
775 (List.map Equality.string_of_equality equalities))));
776 Utils.debug_print (lazy "SIMPLYFYING EQUALITIES...");
777 match equalities with
781 List.rev (simpl bag eq_uri env hd tl [])
785 (Printf.sprintf "equalities AFTER:\n%s\n"
787 (List.map Equality.string_of_equality res))));
791 let print_goals goals =
798 (* (string_of_proof p) ^ ", " ^ *) (CicPp.ppterm t)) gl
800 Printf.sprintf "%d: %s" d (String.concat "; " gl')) goals))
803 let pp_goal_set msg goals names =
804 let active_goals, passive_goals = goals in
805 debug_print (lazy ("////" ^ msg));
806 debug_print (lazy ("ACTIVE G: " ^
807 (String.concat "\n " (List.map (fun (_,_,g) -> CicPp.pp g names)
809 debug_print (lazy ("PASSIVE G: " ^
810 (String.concat "\n " (List.map (fun (_,_,g) -> CicPp.pp g names)
814 let check_if_goal_is_subsumed bag ((_,ctx,_) as env) table (goalproof,menv,ty) =
815 (* let names = Utils.names_of_context ctx in *)
817 | Cic.Appl[Cic.MutInd(uri,_,_);eq_ty;left;right]
818 when LibraryObjects.is_eq_URI uri ->
820 Equality.mk_equality bag
821 (0,Equality.Exact (Cic.Implicit None),(eq_ty,left,right,Utils.Eq),menv)
823 (* match Indexing.subsumption env table goal_equation with*)
824 match Indexing.unification env table goal_equation with
825 | Some (subst, equality, swapped ) ->
828 ("GOAL SUBSUMED IS: "^Equality.string_of_equality goal_equation ~env);
830 ("GOAL IS SUBSUMED BY: "^Equality.string_of_equality equality ~env);
831 prerr_endline ("SUBST:"^Subst.ppsubst ~names subst);
833 let (_,p,(ty,l,r,_),m,id) = Equality.open_equality equality in
834 let cicmenv = Subst.apply_subst_metasenv subst (m @ menv) in
837 Equality.symmetric bag eq_ty l id uri m
841 Some (goalproof, p, id, subst, cicmenv)
846 let find_all_subsumed bag env table (goalproof,menv,ty) =
848 | Cic.Appl[Cic.MutInd(uri,_,_);eq_ty;left;right]
849 when LibraryObjects.is_eq_URI uri ->
851 Equality.mk_equality bag
852 (0,Equality.Exact (Cic.Implicit None),(eq_ty,left,right,Utils.Eq),menv)
855 (fun (subst, equality, swapped ) ->
856 let (_,p,(ty,l,r,_),m,id) = Equality.open_equality equality in
857 let cicmenv = Subst.apply_subst_metasenv subst (m @ menv) in
860 Equality.symmetric bag eq_ty l id uri m
863 in (goalproof, p, id, subst, cicmenv))
864 (Indexing.unification_all env table goal_equation)
869 let check_if_goal_is_identity env = function
870 | (goalproof,m,Cic.Appl[Cic.MutInd(uri,_,ens);eq_ty;left;right])
871 when left = right && LibraryObjects.is_eq_URI uri ->
872 let reflproof = Equality.Exact (Equality.refl_proof uri eq_ty left) in
873 Some (goalproof, reflproof, 0, Subst.empty_subst,m)
874 | (goalproof,m,Cic.Appl[Cic.MutInd(uri,_,ens);eq_ty;left;right])
875 when LibraryObjects.is_eq_URI uri ->
876 (let _,context,_ = env in
879 Founif.unification m m context left right CicUniv.empty_ugraph
881 let reflproof = Equality.Exact (Equality.refl_proof uri eq_ty left) in
882 let m = Subst.apply_subst_metasenv s m in
883 Some (goalproof, reflproof, 0, s,m)
888 let rec check goal = function
892 | None -> check goal tl
893 | (Some p) as ok -> ok
896 let simplify_goal_set bag env goals active =
897 let active_goals, passive_goals = goals in
898 let find (_,_,g) where =
899 List.exists (fun (_,_,g1) -> Equality.meta_convertibility g g1) where
901 (* prova:tengo le passive semplificate
903 List.map (fun g -> snd (simplify_goal env g active)) passive_goals
906 (fun (acc_a,acc_p) goal ->
907 match simplify_goal bag env goal active with
910 if find g acc_p then acc_a,acc_p else acc_a,g::acc_p
912 if find g acc_a then acc_a,acc_p else g::acc_a,acc_p)
913 ([],passive_goals) active_goals
916 let check_if_goals_set_is_solved bag env active goals =
917 let active_goals, passive_goals = goals in
924 check_if_goal_is_identity env;
925 check_if_goal_is_subsumed bag env (snd active)])
926 (* provare active and passive?*)
930 let infer_goal_set bag env active goals =
931 let active_goals, passive_goals = goals in
932 let rec aux = function
933 | [] -> active_goals, []
935 let changed,selected = simplify_goal bag env hd active in
938 prerr_endline ("--------------- goal semplificato");
940 let (_,_,t1) = selected in
942 List.exists (fun (_,_,t) -> Equality.meta_convertibility t t1)
948 let passive_goals = tl in
949 let new_passive_goals =
950 if Utils.metas_of_term t1 = [] then passive_goals
952 let newmaxmeta,new' =
953 Indexing.superposition_left bag env (snd active) selected
956 maxmeta := newmaxmeta;
959 selected::active_goals, new_passive_goals
964 let infer_goal_set_with_current bag env current goals active =
965 let active_goals, passive_goals = simplify_goal_set bag env goals active in
966 let l,table,_ = build_table [current] in
970 let newmaxmeta, new' = Indexing.superposition_left bag env table g !maxmeta in
971 maxmeta := newmaxmeta;
973 passive_goals active_goals
978 let ids = List.map (fun _,_,i,_,_ -> i) p in
982 let ids_of_goal_set (ga,gp) =
983 List.flatten (List.map ids_of_goal ga) @
984 List.flatten (List.map ids_of_goal gp)
987 let size_of_goal_set_a (l,_) = List.length l;;
988 let size_of_goal_set_p (_,l) = List.length l;;
990 let pp_goals label goals context =
991 let names = Utils.names_of_context context in
995 (Printf.sprintf "Current goal: %s = %s\n" label (CicPp.pp g names))))
1000 (Printf.sprintf "PASSIVE goal: %s = %s\n" label (CicPp.pp g names))))
1004 let print_status iterno goals active passive =
1006 (Printf.sprintf "\n%d #ACTIVES: %d #PASSIVES: %d #GOALSET: %d(%d)"
1007 iterno (size_of_active active) (size_of_passive passive)
1008 (size_of_goal_set_a goals) (size_of_goal_set_p goals)))
1011 (** given-clause algorithm with full reduction strategy: NEW implementation *)
1012 (* here goals is a set of goals in OR *)
1014 bag eq_uri ((_,context,_) as env) goals passive active
1015 goal_steps saturation_steps max_time
1017 let initial_time = Unix.gettimeofday () in
1018 let iterations_left iterno =
1019 let now = Unix.gettimeofday () in
1020 let time_left = max_time -. now in
1021 let time_spent_until_now = now -. initial_time in
1022 let iteration_medium_cost =
1023 time_spent_until_now /. (float_of_int iterno)
1025 let iterations_left = time_left /. iteration_medium_cost in
1026 int_of_float iterations_left
1028 let rec step goals passive active g_iterno s_iterno =
1029 if g_iterno > goal_steps && s_iterno > saturation_steps then
1030 (ParamodulationFailure ("No more iterations to spend",active,passive))
1031 else if Unix.gettimeofday () > max_time then
1032 (ParamodulationFailure ("No more time to spend",active,passive))
1035 print_status (max g_iterno s_iterno) goals active passive
1036 (* Printf.eprintf ".%!"; *)
1038 (* PRUNING OF PASSIVE THAT WILL NEVER BE PROCESSED *)
1040 let selection_estimate = iterations_left (max g_iterno s_iterno) in
1041 let kept = size_of_passive passive in
1042 if kept > selection_estimate then
1044 (*Printf.eprintf "Too many passive equalities: pruning...";
1045 prune_passive selection_estimate active*) passive
1050 kept_clauses := (size_of_passive passive) + (size_of_active active);
1052 if g_iterno < goal_steps then
1053 infer_goal_set bag env active goals
1057 match check_if_goals_set_is_solved bag env active goals with
1060 (Printf.sprintf "\nFound a proof in: %f\n"
1061 (Unix.gettimeofday() -. initial_time)));
1062 ParamodulationSuccess (p,active,passive)
1065 if passive_is_empty passive then
1066 if no_more_passive_goals goals then
1067 ParamodulationFailure
1068 ("No more passive equations/goals",active,passive)
1069 (*maybe this is a success! *)
1071 step goals passive active (g_iterno+1) (s_iterno+1)
1074 (* COLLECTION OF GARBAGED EQUALITIES *)
1075 if max g_iterno s_iterno mod 40 = 0 then
1077 print_status (max g_iterno s_iterno) goals active passive;
1078 let active = List.map Equality.id_of (fst active) in
1079 let passive = List.map Equality.id_of (fst passive) in
1080 let goal = ids_of_goal_set goals in
1081 Equality.collect bag active passive goal
1084 if s_iterno < saturation_steps then
1085 let current, passive = select env goals passive in
1086 (* SIMPLIFICATION OF CURRENT *)
1089 Equality.string_of_equality ~env current));
1090 forward_simplify bag eq_uri env current active, passive
1095 | None -> step goals passive active (g_iterno+1) (s_iterno+1)
1097 (* GENERATION OF NEW EQUATIONS *)
1098 (* prerr_endline "infer"; *)
1099 let new' = infer bag eq_uri env current active in
1100 (* prerr_endline "infer goal"; *)
1102 match check_if_goals_set_is_solved env active goals with
1105 (Printf.sprintf "Found a proof in: %f\n"
1106 (Unix.gettimeofday() -. initial_time));
1107 ParamodulationSuccess p
1112 let al, tbl = active in
1113 al @ [current], Indexing.index tbl current
1116 infer_goal_set_with_current bag env current goals active
1119 (* FORWARD AND BACKWARD SIMPLIFICATION *)
1120 (* prerr_endline "fwd/back simpl"; *)
1121 let rec simplify new' active passive =
1123 forward_simplify_new bag eq_uri env new' active
1125 let active, newa, pruned =
1126 backward_simplify bag eq_uri env new' active
1129 List.fold_left (filter_dependent bag) passive pruned
1132 | None -> active, passive, new'
1133 | Some p -> simplify (new' @ p) active passive
1135 let active, passive, new' =
1136 simplify new' active passive
1139 (* prerr_endline "simpl goal with new"; *)
1141 let a,b,_ = build_table new' in
1142 (* let _ = <:start<simplify_goal_set new>> in *)
1143 let rc = simplify_goal_set bag env goals (a,b) in
1144 (* let _ = <:stop<simplify_goal_set new>> in *)
1147 let passive = add_to_passive passive new' [] in
1148 step goals passive active (g_iterno+1) (s_iterno+1)
1151 step goals passive active 1 1
1154 let rec saturate_equations bag eq_uri env goal accept_fun passive active =
1155 elapsed_time := Unix.gettimeofday () -. !start_time;
1156 if !elapsed_time > !time_limit then
1159 let current, passive = select env ([goal],[]) passive in
1160 let res = forward_simplify bag eq_uri env current active in
1163 saturate_equations bag eq_uri env goal accept_fun passive active
1165 Utils.debug_print (lazy (Printf.sprintf "selected: %s"
1166 (Equality.string_of_equality ~env current)));
1167 let new' = infer bag eq_uri env current active in
1169 if Equality.is_identity env current then active
1171 let al, tbl = active in
1172 al @ [current], Indexing.index tbl current
1174 (* alla fine new' contiene anche le attive semplificate!
1175 * quindi le aggiungo alle passive insieme alle new *)
1176 let rec simplify new' active passive =
1177 let new' = forward_simplify_new bag eq_uri env new' active in
1178 let active, newa, pruned =
1179 backward_simplify bag eq_uri env new' active in
1181 List.fold_left (filter_dependent bag) passive pruned in
1183 | None -> active, passive, new'
1184 | Some p -> simplify (new' @ p) active passive
1186 let active, passive, new' = simplify new' active passive in
1190 (Printf.sprintf "active:\n%s\n"
1193 (fun e -> Equality.string_of_equality ~env e)
1199 (Printf.sprintf "new':\n%s\n"
1202 (fun e -> "Negative " ^
1203 (Equality.string_of_equality ~env e)) new'))))
1205 let new' = List.filter accept_fun new' in
1206 let passive = add_to_passive passive new' [] in
1207 saturate_equations bag eq_uri env goal accept_fun passive active
1210 let default_depth = !maxdepth
1211 and default_width = !maxwidth;;
1215 symbols_counter := 0;
1216 weight_age_counter := !weight_age_ratio;
1217 processed_clauses := 0;
1220 maximal_retained_equality := None;
1222 forward_simpl_time := 0.;
1223 forward_simpl_new_time := 0.;
1224 backward_simpl_time := 0.;
1225 passive_maintainance_time := 0.;
1226 derived_clauses := 0;
1230 let eq_of_goal = function
1231 | Cic.Appl [Cic.MutInd(uri,0,_);_;_;_] when LibraryObjects.is_eq_URI uri ->
1233 | _ -> raise (ProofEngineTypes.Fail (lazy ("The goal is not an equality ")))
1236 let eq_and_ty_of_goal = function
1237 | Cic.Appl [Cic.MutInd(uri,0,_);t;_;_] when LibraryObjects.is_eq_URI uri ->
1239 | _ -> raise (ProofEngineTypes.Fail (lazy ("The goal is not an equality ")))
1242 (* fix proof takes in input a term and try to build a metasenv for it *)
1244 let fix_proof metasenv context all_implicits p =
1245 let rec aux metasenv n p =
1248 if all_implicits then
1249 metasenv,Cic.Implicit None
1252 CicMkImplicit.identity_relocation_list_for_metavariable context
1254 let meta = CicSubstitution.lift n (Cic.Meta (i,irl)) in
1257 let _ = CicUtil.lookup_meta i metasenv in metasenv
1258 with CicUtil.Meta_not_found _ ->
1259 debug_print (lazy ("not found: "^(string_of_int i)));
1260 let metasenv,j = CicMkImplicit.mk_implicit_type metasenv [] context in
1261 (i,context,Cic.Meta(j,irl))::metasenv
1267 (fun a (metasenv,l) ->
1268 let metasenv,a' = aux metasenv n a in
1271 in metasenv,Cic.Appl l
1272 | Cic.Lambda(name,s,t) ->
1273 let metasenv,s = aux metasenv n s in
1274 let metasenv,t = aux metasenv (n+1) t in
1275 metasenv,Cic.Lambda(name,s,t)
1276 | Cic.Prod(name,s,t) ->
1277 let metasenv,s = aux metasenv n s in
1278 let metasenv,t = aux metasenv (n+1) t in
1279 metasenv,Cic.Prod(name,s,t)
1280 | Cic.LetIn(name,s,t) ->
1281 let metasenv,s = aux metasenv n s in
1282 let metasenv,t = aux metasenv (n+1) t in
1283 metasenv,Cic.LetIn(name,s,t)
1284 | Cic.Const(uri,ens) ->
1287 (fun (v,a) (metasenv,ens) ->
1288 let metasenv,a' = aux metasenv n a in
1289 metasenv,(v,a')::ens)
1292 metasenv,Cic.Const(uri,ens)
1298 let fix_metasenv metasenv =
1301 let m,t = fix_proof m c false t in
1302 let m = List.filter (fun (j,_,_) -> j<>i) m in
1307 (* status: input proof status
1308 * goalproof: forward steps on goal
1309 * newproof: backward steps
1310 * subsumption_id: the equation used if goal is closed by subsumption
1311 * (0 if not closed by subsumption) (DEBUGGING: can be safely removed)
1312 * subsumption_subst: subst to make newproof and goalproof match
1313 * proof_menv: final metasenv
1318 goalproof newproof subsumption_id subsumption_subst proof_menv
1320 if proof_menv = [] then debug_print (lazy "+++++++++++++++VUOTA")
1321 else debug_print (lazy (CicMetaSubst.ppmetasenv [] proof_menv));
1322 let proof, goalno = status in
1323 let uri, metasenv, _subst, meta_proof, term_to_prove, attrs = proof in
1324 let _, context, type_of_goal = CicUtil.lookup_meta goalno metasenv in
1325 let eq_uri = eq_of_goal type_of_goal in
1326 let names = Utils.names_of_context context in
1327 debug_print (lazy "Proof:");
1329 (Equality.pp_proof bag names goalproof newproof subsumption_subst
1330 subsumption_id type_of_goal));
1332 prerr_endline ("max weight: " ^
1333 (string_of_int (Equality.max_weight goalproof newproof)));
1335 (* generation of the CIC proof *)
1336 (* let metasenv' = List.filter (fun i,_,_ -> i<>goalno) metasenv in *)
1338 List.filter (fun i -> i <> goalno)
1339 (ProofEngineHelpers.compare_metasenvs
1340 ~newmetasenv:metasenv ~oldmetasenv:proof_menv) in
1341 let goal_proof, side_effects_t =
1342 let initial = Equality.add_subst subsumption_subst newproof in
1343 Equality.build_goal_proof bag
1344 eq_uri goalproof initial type_of_goal side_effects
1347 (* Equality.draw_proof bag names goalproof newproof subsumption_id; *)
1348 let goal_proof = Subst.apply_subst subsumption_subst goal_proof in
1349 let real_menv = fix_metasenv (proof_menv@metasenv) in
1350 let real_menv,goal_proof =
1351 fix_proof real_menv context false goal_proof in
1353 let real_menv,fixed_proof = fix_proof proof_menv context false goal_proof in
1354 (* prerr_endline ("PROOF: " ^ CicPp.pp goal_proof names); *)
1356 let pp_error goal_proof names error exn =
1357 prerr_endline "THE PROOF DOES NOT TYPECHECK! <begin>";
1358 prerr_endline (CicPp.pp goal_proof names);
1359 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1360 prerr_endline error;
1361 prerr_endline "THE PROOF DOES NOT TYPECHECK! <end>";
1364 let old_insert_coercions = !CicRefine.insert_coercions in
1365 let goal_proof,goal_ty,real_menv,_ =
1366 (* prerr_endline ("parte la refine per: " ^ (CicPp.pp goal_proof names)); *)
1368 debug_print (lazy (CicPp.ppterm goal_proof));
1369 CicRefine.insert_coercions := false;
1371 CicRefine.type_of_aux'
1372 real_menv context goal_proof CicUniv.empty_ugraph
1374 CicRefine.insert_coercions := old_insert_coercions;
1377 | CicRefine.RefineFailure s
1378 | CicRefine.Uncertain s
1379 | CicRefine.AssertFailure s as exn ->
1380 CicRefine.insert_coercions := old_insert_coercions;
1381 pp_error goal_proof names (Lazy.force s) exn
1382 | CicUtil.Meta_not_found i as exn ->
1383 CicRefine.insert_coercions := old_insert_coercions;
1384 pp_error goal_proof names ("META NOT FOUND: "^string_of_int i) exn
1385 | Invalid_argument "list_fold_left2" as exn ->
1386 CicRefine.insert_coercions := old_insert_coercions;
1387 pp_error goal_proof names "Invalid_argument: list_fold_left2" exn
1389 CicRefine.insert_coercions := old_insert_coercions;
1392 let subst_side_effects,real_menv,_ =
1394 CicUnification.fo_unif_subst [] context real_menv
1395 goal_ty type_of_goal CicUniv.empty_ugraph
1397 | CicUnification.UnificationFailure s
1398 | CicUnification.Uncertain s
1399 | CicUnification.AssertFailure s -> assert false
1400 (* fail "Maybe the local context of metas in the goal was not an IRL" s *)
1402 Utils.debug_print (lazy "+++++++++++++ FINE UNIF");
1404 (goalno,(context,goal_proof,type_of_goal))::subst_side_effects
1407 let metas_of_proof = Utils.metas_of_term goal_proof in
1409 let proof, real_metasenv =
1410 ProofEngineHelpers.subst_meta_and_metasenv_in_proof
1411 proof goalno final_subst
1412 (List.filter (fun i,_,_ -> i<>goalno ) real_menv)
1415 (ProofEngineHelpers.compare_metasenvs
1416 ~oldmetasenv:metasenv ~newmetasenv:real_metasenv) in
1419 List.map (fun i,_,_ -> i) real_metasenv in
1421 final_subst, proof, open_goals
1426 let metas_still_open_in_proof = Utils.metas_of_term goal_proof in
1427 (* prerr_endline (CicPp.pp goal_proof names); *)
1428 let goal_proof = (* Subst.apply_subst subsumption_subst *) goal_proof in
1429 let side_effects_t =
1430 List.map (Subst.apply_subst subsumption_subst) side_effects_t
1432 (* replacing fake mets with real ones *)
1433 (* prerr_endline "replacing metas..."; *)
1434 let irl=CicMkImplicit.identity_relocation_list_for_metavariable context in
1435 if proof_menv = [] then prerr_endline "VUOTA";
1436 CicMetaSubst.ppmetasenv [] proof_menv;
1437 let what, with_what =
1439 (fun (acc1,acc2) i ->
1440 (Cic.Meta(i,[]))::acc1, (Cic.Implicit None)::acc2)
1442 metas_still_open_in_proof
1446 List.mem i metas_still_open_in_proof
1447 (*&& not(List.mem i metas_still_open_in_goal)*))
1451 let goal_proof_menv =
1453 (fun (i,_,_) -> List.mem i metas_still_open_in_proof)
1457 (* we need this fake equality since the metas of the hypothesis may be
1458 * with a real local context *)
1459 ProofEngineReduction.replace_lifting
1460 ~equality:(fun x y ->
1461 match x,y with Cic.Meta(i,_),Cic.Meta(j,_) -> i=j | _-> false)
1462 ~what ~with_what ~where
1464 let goal_proof = replace goal_proof in
1465 (* ok per le meta libere... ma per quelle che c'erano e sono rimaste?
1466 * what mi pare buono, sostituisce solo le meta farlocche *)
1467 let side_effects_t = List.map replace side_effects_t in
1469 List.filter (fun i -> i <> goalno)
1470 (ProofEngineHelpers.compare_metasenvs
1471 ~oldmetasenv:metasenv ~newmetasenv:goal_proof_menv)
1475 * String.concat "," (List.map string_of_int free_metas) ); *)
1476 (* check/refine/... build the new proof *)
1478 ProofEngineReduction.replace
1479 ~what:side_effects ~with_what:side_effects_t
1480 ~equality:(fun i t -> match t with Cic.Meta(j,_)->j=i|_->false)
1483 let goal_proof,goal_ty,real_menv,_ =
1484 prerr_endline "parte la refine";
1486 CicRefine.type_of_aux' metasenv context goal_proof
1487 CicUniv.empty_ugraph
1489 | CicUtil.Meta_not_found _
1490 | CicRefine.RefineFailure _
1491 | CicRefine.Uncertain _
1492 | CicRefine.AssertFailure _
1493 | Invalid_argument "list_fold_left2" as exn ->
1494 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1495 prerr_endline (CicPp.pp goal_proof names);
1496 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1499 prerr_endline "+++++++++++++ METASENV";
1501 (CicMetaSubst.ppmetasenv [] real_menv);
1502 let subst_side_effects,real_menv,_ =
1504 prerr_endline ("XX type_of_goal " ^ CicPp.ppterm type_of_goal);
1505 prerr_endline ("XX replaced_goal " ^ CicPp.ppterm replaced_goal);
1506 prerr_endline ("XX metasenv " ^
1507 CicMetaSubst.ppmetasenv [] (metasenv @ free_metas_menv));
1510 CicUnification.fo_unif_subst [] context real_menv
1511 goal_ty type_of_goal CicUniv.empty_ugraph
1513 | CicUnification.UnificationFailure s
1514 | CicUnification.Uncertain s
1515 | CicUnification.AssertFailure s -> assert false
1516 (* fail "Maybe the local context of metas in the goal was not an IRL" s *)
1519 (goalno,(context,goal_proof,type_of_goal))::subst_side_effects
1522 let metas_of_proof = Utils.metas_of_term goal_proof in
1524 let proof, real_metasenv =
1525 ProofEngineHelpers.subst_meta_and_metasenv_in_proof
1526 proof goalno (CicMetaSubst.apply_subst final_subst)
1527 (List.filter (fun i,_,_ -> i<>goalno ) real_menv)
1530 List.map (fun i,_,_ -> i) real_metasenv in
1533 HExtlib.list_uniq (List.sort Pervasives.compare metas_of_proof)
1536 match free_meta with Some(Cic.Meta(m,_)) when m<>goalno ->[m] | _ ->[]
1541 "GOALS APERTI: %s\nMETASENV PRIMA:\n%s\nMETASENV DOPO:\n%s\n"
1542 (String.concat ", " (List.map string_of_int open_goals))
1543 (CicMetaSubst.ppmetasenv [] metasenv)
1544 (CicMetaSubst.ppmetasenv [] real_metasenv);
1546 final_subst, proof, open_goals
1550 (* **************** HERE ENDS THE PARAMODULATION STUFF ******************** *)
1552 (* exported functions *)
1554 let pump_actives context bag maxm active passive saturation_steps max_time =
1560 (fun acc e -> let _,_,_,menv,_ = Equality.open_equality e in
1561 List.fold_left (fun acc (i,_,_) -> max i acc) acc menv)
1564 (* let active_l = fst active in *)
1565 (* let passive_l = fst passive in *)
1566 (* let ma = max_l active_l in *)
1567 (* let mp = max_l passive_l in *)
1568 match LibraryObjects.eq_URI () with
1569 | None -> active, passive, !maxmeta
1571 let env = [],context,CicUniv.empty_ugraph in
1573 given_clause bag eq_uri env ([],[])
1574 passive active 0 saturation_steps max_time
1576 | ParamodulationFailure (_,a,p) ->
1578 | ParamodulationSuccess _ ->
1582 let all_subsumed bag maxm status active passive =
1584 let proof, goalno = status in
1585 let uri, metasenv, _subst, meta_proof, term_to_prove, attrs = proof in
1586 let _, context, type_of_goal = CicUtil.lookup_meta goalno metasenv in
1587 let env = metasenv,context,CicUniv.empty_ugraph in
1588 let cleaned_goal = Utils.remove_local_context type_of_goal in
1589 let goal = [], List.filter (fun (i,_,_)->i<>goalno) metasenv, cleaned_goal in
1590 debug_print (lazy (string_of_int (List.length (fst active))));
1591 (* we simplify using both actives passives *)
1594 (fun (l,tbl) eq -> eq::l,(Indexing.index tbl eq))
1595 active (list_of_passive passive) in
1596 let _,goal = simplify_goal bag env goal table in
1597 let (_,_,ty) = goal in
1598 debug_print (lazy (CicPp.ppterm ty));
1599 let subsumed = find_all_subsumed bag env (snd table) goal in
1600 let subsumed_or_id =
1601 match (check_if_goal_is_identity env goal) with
1603 | Some id -> id::subsumed in
1607 (goalproof,newproof,subsumption_id,subsumption_subst, proof_menv) ->
1609 status goalproof newproof subsumption_id subsumption_subst proof_menv)
1615 bag maxm status active passive goal_steps saturation_steps max_time
1619 let active_l = fst active in
1623 (fun acc e -> let _,_,_,menv,_ = Equality.open_equality e in
1624 List.fold_left (fun acc (i,_,_) -> max i acc) acc menv)
1627 let passive_l = fst passive in
1628 let ma = max_l active_l in
1629 let mp = max_l passive_l in
1631 let proof, goalno = status in
1632 let uri, metasenv, _subst, meta_proof, term_to_prove, attrs = proof in
1633 let _, context, type_of_goal = CicUtil.lookup_meta goalno metasenv in
1634 let eq_uri = eq_of_goal type_of_goal in
1635 let cleaned_goal = Utils.remove_local_context type_of_goal in
1636 Utils.set_goal_symbols cleaned_goal; (* DISACTIVATED *)
1637 let metasenv' = List.filter (fun (i,_,_)->i<>goalno) metasenv in
1638 let goal = [], metasenv', cleaned_goal in
1639 let env = metasenv,context,CicUniv.empty_ugraph in
1640 debug_print (lazy ">>>>>> ACTIVES >>>>>>>>");
1641 List.iter (fun e -> debug_print (lazy (Equality.string_of_equality ~env e)))
1643 debug_print (lazy ">>>>>>>>>>>>>>");
1644 let goals = make_goal_set goal in
1646 (* given_caluse non prende in input maxm ????? *)
1647 given_clause bag eq_uri env goals passive active
1648 goal_steps saturation_steps max_time
1650 | ParamodulationFailure (_,a,p) ->
1651 None, a, p, !maxmeta
1652 | ParamodulationSuccess
1653 ((goalproof,newproof,subsumption_id,subsumption_subst, proof_menv),a,p) ->
1654 let subst, proof, gl =
1656 status goalproof newproof subsumption_id subsumption_subst proof_menv
1658 Some (subst, proof,gl),a,p, !maxmeta
1661 let add_to_passive eql passives =
1662 add_to_passive passives eql eql