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>>;;
33 (* set to false to disable paramodulation inside auto_tac *)
34 let connect_to_auto = true;;
37 (* profiling statistics... *)
38 let infer_time = ref 0.;;
39 let forward_simpl_time = ref 0.;;
40 let forward_simpl_new_time = ref 0.;;
41 let backward_simpl_time = ref 0.;;
42 let passive_maintainance_time = ref 0.;;
44 (* limited-resource-strategy related globals *)
45 let processed_clauses = ref 0;; (* number of equalities selected so far... *)
46 let time_limit = ref 0.;; (* in seconds, settable by the user... *)
47 let start_time = ref 0.;; (* time at which the execution started *)
48 let elapsed_time = ref 0.;;
49 (* let maximal_weight = ref None;; *)
50 let maximal_retained_equality = ref None;;
52 (* equality-selection related globals *)
53 let use_fullred = ref true;;
54 let weight_age_ratio = ref 6 (* 5 *);; (* settable by the user *)
55 let weight_age_counter = ref !weight_age_ratio ;;
56 let symbols_ratio = ref 0 (* 3 *);;
57 let symbols_counter = ref 0;;
59 (* non-recursive Knuth-Bendix term ordering by default *)
60 (* Utils.compare_terms := Utils.rpo;; *)
61 (* Utils.compare_terms := Utils.nonrec_kbo;; *)
62 (* Utils.compare_terms := Utils.ao;; *)
65 let derived_clauses = ref 0;;
66 let kept_clauses = ref 0;;
68 (* index of the greatest Cic.Meta created - TODO: find a better way! *)
71 (* varbiables controlling the search-space *)
72 let maxdepth = ref 3;;
73 let maxwidth = ref 3;;
76 Equality.goal_proof * Equality.proof * int * Subst.substitution * Cic.metasenv
78 | ParamodulationFailure of string
79 | ParamodulationSuccess of new_proof
82 type goal = Equality.goal_proof * Cic.metasenv * Cic.term;;
84 type theorem = Cic.term * Cic.term * Cic.metasenv;;
86 let symbols_of_equality equality =
87 let (_, _, (_, left, right, _), _,_) = Equality.open_equality equality in
88 let m1 = symbols_of_term left in
93 let c = TermMap.find k res in
94 TermMap.add k (c+v) res
97 (symbols_of_term right) m1
103 module OrderedEquality = struct
104 type t = Equality.equality
106 let compare eq1 eq2 =
107 match Equality.meta_convertibility_eq eq1 eq2 with
110 let w1, _, (ty,left, right, _), m1,_ = Equality.open_equality eq1 in
111 let w2, _, (ty',left', right', _), m2,_ = Equality.open_equality eq2 in
112 match Pervasives.compare w1 w2 with
114 let res = (List.length m1) - (List.length m2) in
115 if res <> 0 then res else
116 Equality.compare eq1 eq2
120 module EqualitySet = Set.Make(OrderedEquality);;
122 exception Empty_list;;
124 let passive_is_empty = function
130 let size_of_passive ((passive_list, ps), _) = List.length passive_list
131 (* EqualitySet.cardinal ps *)
135 let size_of_active (active_list, _) = List.length active_list
138 let age_factor = 0.01;;
141 selects one equality from passive. The selection strategy is a combination
142 of weight, age and goal-similarity
145 let rec select env (goals,_) passive =
146 processed_clauses := !processed_clauses + 1;
148 match (List.rev goals) with goal::_ -> goal | _ -> assert false
150 let (pos_list, pos_set), passive_table = passive in
151 let remove eq l = List.filter (fun e -> Equality.compare e eq <> 0) l in
152 if !weight_age_ratio > 0 then
153 weight_age_counter := !weight_age_counter - 1;
154 match !weight_age_counter with
156 weight_age_counter := !weight_age_ratio;
157 let rec skip_giant pos_list pos_set passive_table =
159 | (hd:EqualitySet.elt)::tl ->
160 let w,_,_,_,_ = Equality.open_equality hd in
162 Indexing.remove_index passive_table hd
164 let pos_set = EqualitySet.remove hd pos_set in
166 hd, ((tl, pos_set), passive_table)
168 (prerr_endline ("\n\n\nGIANT SKIPPED: "^string_of_int w^"\n\n\n");
169 skip_giant tl pos_set passive_table)
172 skip_giant pos_list pos_set passive_table)
173 | _ when (!symbols_counter > 0) ->
174 (symbols_counter := !symbols_counter - 1;
175 let cardinality map =
176 TermMap.fold (fun k v res -> res + v) map 0
179 let _, _, term = goal in
182 let card = cardinality symbols in
183 let foldfun k v (r1, r2) =
184 if TermMap.mem k symbols then
185 let c = TermMap.find k symbols in
186 let c1 = abs (c - v) in
192 let f equality (i, e) =
194 TermMap.fold foldfun (symbols_of_equality equality) (0, 0)
196 let c = others + (abs (common - card)) in
197 if c < i then (c, equality)
200 let e1 = EqualitySet.min_elt pos_set in
203 TermMap.fold foldfun (symbols_of_equality e1) (0, 0)
205 (others + (abs (common - card))), e1
207 let _, current = EqualitySet.fold f pos_set initial in
209 Indexing.remove_index passive_table current
212 ((remove current pos_list, EqualitySet.remove current pos_set),
215 symbols_counter := !symbols_ratio;
216 let current = EqualitySet.min_elt pos_set in
218 Indexing.remove_index passive_table current
221 ((remove current pos_list, EqualitySet.remove current pos_set),
225 let filter_dependent passive id =
226 prerr_endline ("+++++++++++++++passives "^
227 ( string_of_int (size_of_passive passive)));
228 let (pos_list, pos_set), passive_table = passive in
231 (fun eq ((list,set),table) ->
232 if Equality.depend eq id then
233 (let _,_,_,_,id_eq = Equality.open_equality eq in
235 prerr_endline ("\n\n--------filtering "^(string_of_int id_eq));
237 EqualitySet.remove eq set),
238 Indexing.remove_index table eq))
240 ((eq::list, set),table))
241 pos_list (([],pos_set),passive_table) in
242 prerr_endline ("+++++++++++++++passives "^
243 ( string_of_int (size_of_passive passive)));
248 (* initializes the passive set of equalities *)
249 let make_passive pos =
250 let set_of equalities =
251 List.fold_left (fun s e -> EqualitySet.add e s) EqualitySet.empty equalities
254 List.fold_left (fun tbl e -> Indexing.index tbl e) Indexing.empty pos
266 (* adds to passive a list of equalities new_pos *)
267 let add_to_passive passive new_pos =
268 let (pos_list, pos_set), table = passive in
269 let ok set equality = not (EqualitySet.mem equality set) in
270 let pos = List.filter (ok pos_set) new_pos in
272 List.fold_left (fun tbl e -> Indexing.index tbl e) table pos
274 let add set equalities =
275 List.fold_left (fun s e -> EqualitySet.add e s) set equalities
277 (pos_list @ pos, add pos_set pos),
282 (* removes from passive equalities that are estimated impossible to activate
283 within the current time limit *)
284 let prune_passive howmany (active, _) passive =
285 let (pl, ps), tbl = passive in
286 let howmany = float_of_int howmany
287 and ratio = float_of_int !weight_age_ratio in
290 int_of_float (if t -. v < 0.5 then t else v)
292 let in_weight = round (howmany *. ratio /. (ratio +. 1.))
293 and in_age = round (howmany /. (ratio +. 1.)) in
295 (lazy (Printf.sprintf "in_weight: %d, in_age: %d\n" in_weight in_age));
296 let counter = ref !symbols_ratio in
301 counter := !counter - 1;
302 if !counter = 0 then counter := !symbols_ratio in
303 let e = EqualitySet.min_elt ps in
304 let ps' = pickw (w-1) (EqualitySet.remove e ps) in
305 EqualitySet.add e ps'
307 let e = EqualitySet.min_elt ps in
308 let ps' = pickw (w-1) (EqualitySet.remove e ps) in
309 EqualitySet.add e ps'
313 let ps = pickw in_weight ps in
314 let rec picka w s l =
318 | hd::tl when not (EqualitySet.mem hd s) ->
319 let w, s, l = picka (w-1) s tl in
320 w, EqualitySet.add hd s, hd::l
322 let w, s, l = picka w s tl in
327 let _, ps, pl = picka in_age ps pl in
328 if not (EqualitySet.is_empty ps) then
329 maximal_retained_equality := Some (EqualitySet.max_elt ps);
332 (fun e tbl -> Indexing.index tbl e) ps Indexing.empty
338 (** inference of new equalities between current and some in active *)
339 let infer env current (active_list, active_table) =
341 if Utils.debug_metas then
342 (ignore(Indexing.check_target c current "infer1");
343 ignore(List.map (function current -> Indexing.check_target c current "infer2") active_list));
345 let maxm, copy_of_current = Equality.fix_metas !maxmeta current in
347 let active_table = Indexing.index active_table copy_of_current in
348 let _ = <:start<current contro active>> in
350 Indexing.superposition_right !maxmeta env active_table current
352 let _ = <:stop<current contro active>> in
353 if Utils.debug_metas then
356 Indexing.check_target c current "sup0") res);
358 let rec infer_positive table = function
362 Indexing.superposition_right ~subterms_only:true !maxmeta env table equality
365 if Utils.debug_metas then
369 Indexing.check_target c current "sup2") res);
370 let pos = infer_positive table tl in
374 let maxm, copy_of_current = Equality.fix_metas !maxmeta current in
377 let curr_table = Indexing.index Indexing.empty current in
378 let _ = <:start<active contro current>> in
379 let pos = infer_positive curr_table ((*copy_of_current::*)active_list) in
380 let _ = <:stop<active contro current>> in
381 if Utils.debug_metas then
384 Indexing.check_target c current "sup3") pos);
387 derived_clauses := !derived_clauses + (List.length new_pos);
388 match !maximal_retained_equality with
391 ignore(assert false);
392 (* if we have a maximal_retained_equality, we can discard all equalities
393 "greater" than it, as they will never be reached... An equality is
394 greater than maximal_retained_equality if it is bigger
395 wrt. OrderedEquality.compare and it is less similar than
396 maximal_retained_equality to the current goal *)
397 List.filter (fun e -> OrderedEquality.compare e eq <= 0) new_pos
400 let check_for_deep_subsumption env active_table eq =
401 let _,_,(eq_ty, left, right, order),metas,id = Equality.open_equality eq in
402 let check_subsumed deep l r =
404 Equality.mk_tmp_equality(0,(eq_ty,l,r,Utils.Incomparable),metas)in
405 match Indexing.subsumption env active_table eqtmp with
409 let rec aux b (ok_so_far, subsumption_used) t1 t2 =
411 | t1, t2 when not ok_so_far -> ok_so_far, subsumption_used
412 | t1, t2 when subsumption_used -> t1 = t2, subsumption_used
413 | Cic.Appl (h1::l),Cic.Appl (h2::l') ->
414 let rc = check_subsumed b t1 t2 in
420 (fun (ok_so_far, subsumption_used) t t' ->
421 aux true (ok_so_far, subsumption_used) t t')
422 (ok_so_far, subsumption_used) l l'
423 with Invalid_argument _ -> false,subsumption_used)
425 false, subsumption_used
426 | _ -> false, subsumption_used
428 fst (aux false (true,false) left right)
431 (* buttare via sign *)
433 (** simplifies current using active and passive *)
434 let forward_simplify env (sign,current) ?passive (active_list, active_table) =
435 let _, context, _ = env in
439 | Some ((_, _), pt) -> Some pt
441 let demodulate table current =
442 let newmeta, newcurrent =
443 Indexing.demodulation_equality !maxmeta env table sign current in
445 if Equality.is_identity env newcurrent then
450 let rec demod current =
451 if Utils.debug_metas then
452 ignore (Indexing.check_target context current "demod0");
453 let res = demodulate active_table current in
454 if Utils.debug_metas then
455 ignore ((function None -> () | Some x ->
456 ignore (Indexing.check_target context x "demod1");()) res);
460 match passive_table with
462 | Some passive_table ->
463 match demodulate passive_table newcurrent with
465 | Some newnewcurrent ->
466 if Equality.compare newcurrent newnewcurrent <> 0 then
468 else Some newnewcurrent
470 let res = demod current in
474 if Indexing.in_index active_table c then
477 match passive_table with
479 if check_for_deep_subsumption env active_table c then
484 if Indexing.subsumption env active_table c = None then
489 | Some passive_table ->
490 if Indexing.in_index passive_table c then None
492 if check_for_deep_subsumption env active_table c then
495 (* if Indexing.subsumption env active_table c = None then*)
496 (match Indexing.subsumption env passive_table c with
500 (*prerr_endline "\n\nPESCO DALLE PASSIVE LA PIU' GENERALE\n\n";
508 (** simplifies new using active and passive *)
509 let forward_simplify_new env new_pos ?passive active =
510 if Utils.debug_metas then
514 (fun current -> Indexing.check_target c current "forward new pos")
517 let active_list, active_table = active in
521 | Some ((_, _), pt) -> Some pt
523 let demodulate sign table target =
524 let newmeta, newtarget =
525 Indexing.demodulation_equality !maxmeta env table sign target in
529 (* we could also demodulate using passive. Currently we don't *)
531 List.map (demodulate Positive active_table) new_pos
536 if not (Equality.is_identity env e) then
539 EqualitySet.empty new_pos
541 let new_pos = EqualitySet.elements new_pos_set in
544 match passive_table with
546 (fun e -> (Indexing.subsumption env active_table e = None))
547 | Some passive_table ->
548 (fun e -> ((Indexing.subsumption env active_table e = None) &&
549 (Indexing.subsumption env passive_table e = None)))
552 match passive_table with
554 (fun e -> not (Indexing.in_index active_table e))
555 | Some passive_table ->
557 not ((Indexing.in_index active_table e) ||
558 (Indexing.in_index passive_table e)))
560 List.filter subs (List.filter is_duplicate new_pos)
564 (** simplifies a goal with equalities in active and passive *)
565 let rec simplify_goal env goal ?passive (active_list, active_table) =
569 | Some ((_, _), pt) -> Some pt
571 let demodulate table goal = Indexing.demodulation_goal env table goal in
573 match passive_table with
574 | None -> demodulate active_table goal
575 | Some passive_table ->
576 let changed, goal = demodulate active_table goal in
577 (* let changed', goal = demodulate passive_table goal in*)
578 (changed (*|| changed'*)), goal
584 snd (simplify_goal env goal ?passive (active_list, active_table))
588 let simplify_goals env goals ?passive active =
589 let a_goals, p_goals = goals in
592 (fun g -> snd (simplify_goal env g ?passive active))
597 (fun g -> snd (simplify_goal env g ?passive active))
604 (** simplifies active usign new *)
605 let backward_simplify_active env new_pos new_table min_weight active =
606 let active_list, active_table = active in
607 let active_list, newa, pruned =
609 (fun equality (res, newn,pruned) ->
610 let ew, _, _, _,id = Equality.open_equality equality in
611 if ew < min_weight then
612 equality::res, newn,pruned
614 match forward_simplify env (Utils.Positive, equality) (new_pos, new_table) with
615 | None -> res, newn, id::pruned
617 if Equality.compare equality e = 0 then
620 res, e::newn, pruned)
621 active_list ([], [],[])
624 List.exists (Equality.meta_convertibility_eq eq1) where
627 let _, _, _, _,id = Equality.open_equality eq in id
629 let ((active1,pruned),tbl), newa =
631 (fun eq ((res,pruned), tbl) ->
632 if List.mem eq res then
633 (res, (id_of_eq eq)::pruned),tbl
634 else if (Equality.is_identity env eq) || (find eq res) then (
635 (res, (id_of_eq eq)::pruned),tbl
638 (eq::res,pruned), Indexing.index tbl eq)
639 active_list (([],pruned), Indexing.empty),
642 if (Equality.is_identity env eq) then p
647 | [] -> (active1,tbl), None, pruned
648 | _ -> (active1,tbl), Some newa, pruned
652 (** simplifies passive using new *)
653 let backward_simplify_passive env new_pos new_table min_weight passive =
654 let (pl, ps), passive_table = passive in
655 let f sign equality (resl, ress, newn) =
656 let ew, _, _, _ , _ = Equality.open_equality equality in
657 if ew < min_weight then
658 equality::resl, ress, newn
660 match forward_simplify env (sign, equality) (new_pos, new_table) with
661 | None -> resl, EqualitySet.remove equality ress, newn
664 equality::resl, ress, newn
666 let ress = EqualitySet.remove equality ress in
669 let pl, ps, newp = List.fold_right (f Positive) pl ([], ps, []) in
672 (fun tbl e -> Indexing.index tbl e) Indexing.empty pl
675 | [] -> ((pl, ps), passive_table), None
676 | _ -> ((pl, ps), passive_table), Some (newp)
679 let build_table equations =
682 let ew, _, _, _ , _ = Equality.open_equality e in
683 e::l, Indexing.index t e, min ew w)
684 ([], Indexing.empty, 1000000) equations
688 let backward_simplify env new' ?passive active =
689 let new_pos, new_table, min_weight = build_table new' in
693 let ew, _, _, _ , _ = Equality.open_equality e in
694 e::l, Indexing.index t e, min ew w)
695 ([], Indexing.empty, 1000000) new'
698 let active, newa, pruned =
699 backward_simplify_active env new_pos new_table min_weight active in
702 active, (make_passive []), newa, None, pruned
704 active, passive, newa, None, pruned
707 backward_simplify_passive env new_pos new_table min_weight passive in
708 active, passive, newa, newp *)
712 let close env new' given =
713 let new_pos, new_table, min_weight =
716 let ew, _, _, _ , _ = Equality.open_equality e in
717 e::l, Indexing.index t e, min ew w)
718 ([], Indexing.empty, 1000000) (snd new')
722 let pos = infer env c (new_pos,new_table) in
727 let is_commutative_law eq =
728 let w, proof, (eq_ty, left, right, order), metas , _ =
729 Equality.open_equality eq
731 match left,right with
732 Cic.Appl[f1;Cic.Meta _ as a1;Cic.Meta _ as b1],
733 Cic.Appl[f2;Cic.Meta _ as a2;Cic.Meta _ as b2] ->
734 f1 = f2 && a1 = b2 && a2 = b1
738 let prova env new' active =
739 let given = List.filter is_commutative_law (fst active) in
743 (Printf.sprintf "symmetric:\n%s\n"
746 (fun e -> Equality.string_of_equality ~env e)
751 (* returns an estimation of how many equalities in passive can be activated
752 within the current time limit *)
753 let get_selection_estimate () =
754 elapsed_time := (Unix.gettimeofday ()) -. !start_time;
755 (* !processed_clauses * (int_of_float (!time_limit /. !elapsed_time)) *)
757 ceil ((float_of_int !processed_clauses) *.
758 ((!time_limit (* *. 2. *)) /. !elapsed_time -. 1.)))
762 (** initializes the set of goals *)
763 let make_goals goal =
765 and passive = [0, [goal]] in
769 let make_goal_set goal =
773 (** initializes the set of theorems *)
774 let make_theorems theorems =
779 let activate_goal (active, passive) =
782 | goal_conj::tl -> true, (goal_conj::active, tl)
783 | [] -> false, (active, passive)
785 true, (active,passive)
789 let activate_theorem (active, passive) =
791 | theorem::tl -> true, (theorem::active, tl)
792 | [] -> false, (active, passive)
797 let simplify_theorems env theorems ?passive (active_list, active_table) =
798 let pl, passive_table =
801 | Some ((pn, _), (pp, _), pt) ->
802 let pn = List.map (fun e -> (Negative, e)) pn
803 and pp = List.map (fun e -> (Positive, e)) pp in
806 let a_theorems, p_theorems = theorems in
807 let demodulate table theorem =
808 let newmeta, newthm =
809 Indexing.demodulation_theorem !maxmeta env table theorem in
811 theorem != newthm, newthm
813 let foldfun table (a, p) theorem =
814 let changed, theorem = demodulate table theorem in
815 if changed then (a, theorem::p) else (theorem::a, p)
817 let mapfun table theorem = snd (demodulate table theorem) in
818 match passive_table with
820 let p_theorems = List.map (mapfun active_table) p_theorems in
821 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems
822 | Some passive_table ->
823 let p_theorems = List.map (mapfun active_table) p_theorems in
824 let p_theorems, a_theorems =
825 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems in
826 let p_theorems = List.map (mapfun passive_table) p_theorems in
827 List.fold_left (foldfun passive_table) ([], p_theorems) a_theorems
831 let rec simpl env e others others_simpl =
832 let active = others @ others_simpl in
835 (fun t e -> Indexing.index t e)
836 Indexing.empty active
838 let res = forward_simplify env (Positive,e) (active, tbl) in
842 | None -> simpl env hd tl others_simpl
843 | Some e -> simpl env hd tl (e::others_simpl)
847 | None -> others_simpl
848 | Some e -> e::others_simpl
852 let simplify_equalities env equalities =
855 (Printf.sprintf "equalities:\n%s\n"
857 (List.map Equality.string_of_equality equalities))));
858 debug_print (lazy "SIMPLYFYING EQUALITIES...");
859 match equalities with
863 List.rev (simpl env hd tl [])
867 (Printf.sprintf "equalities AFTER:\n%s\n"
869 (List.map Equality.string_of_equality res))));
873 let print_goals goals =
880 (* (string_of_proof p) ^ ", " ^ *) (CicPp.ppterm t)) gl
882 Printf.sprintf "%d: %s" d (String.concat "; " gl')) goals))
885 let check_if_goal_is_subsumed ((_,ctx,_) as env) table (goalproof,menv,ty) =
887 let names = names_of_context ctx in
888 Printf.eprintf "check_goal_subsumed: %s\n" (CicPp.pp ty names);
891 | Cic.Appl[Cic.MutInd(uri,_,_);eq_ty;left;right]
892 when UriManager.eq uri (Utils.eq_URI ()) ->
895 (0,Equality.Exact (Cic.Implicit None),(eq_ty,left,right,Eq),menv)
897 (* match Indexing.subsumption env table goal_equation with*)
898 match Indexing.unification env table goal_equation with
899 | Some (subst, equality, swapped ) ->
901 ("GOAL SUBSUMED BY: " ^ Equality.string_of_equality equality);
902 prerr_endline ("SUBST:" ^ Subst.ppsubst subst);
903 let (_,p,(ty,l,r,_),m,id) = Equality.open_equality equality in
904 let cicmenv = Subst.apply_subst_metasenv subst (m @ menv) in
907 Equality.symmetric eq_ty l id uri m
911 Some (goalproof, p, id, subst, cicmenv)
918 (** given-clause algorithm with full reduction strategy *)
919 let rec given_clause_fullred dbd env goals theorems ~passive active =
920 let goals = simplify_goals env goals ~passive active in
921 let _,context,_ = env in
923 (Equality.goal_proof * Cic.metasenv * Cic.term) list *
924 (Equality.goal_proof * Cic.metasenv * Cic.term) list) = activate_goal
927 (Equality.goal_proof * Cic.metasenv * Cic.term) list *
928 (Equality.goal_proof * Cic.metasenv * Cic.term) list)
930 (* let theorems = simplify_theorems env theorems ~passive active in *)
932 let names = List.map (HExtlib.map_option (fun (name,_) -> name)) context in
933 let _, _, t = List.hd (fst goals) in
934 let _ = prerr_endline ("goal activated = " ^ (CicPp.pp t names)) in
938 (* (Printf.sprintf "\ngoals = \nactive\n%s\npassive\n%s\n" *)
939 (* (print_goals (fst goals)) (print_goals (snd goals)))); *)
940 (* let current = List.hd (fst goals) in *)
941 (* let p, _, t = List.hd (snd current) in *)
944 (* (Printf.sprintf "goal activated:\n%s\n%s\n" *)
945 (* (CicPp.ppterm t) (string_of_proof p))); *)
948 (* apply_goal_to_theorems dbd env theorems ~passive active goals in *)
949 let iseq uri = UriManager.eq uri (Utils.eq_URI ()) in
951 | (goalproof,m,Cic.Appl[Cic.MutInd(uri,_,ens);eq_ty;left;right])::_
952 when left = right && iseq uri ->
953 let reflproof = Equality.Exact (Equality.refl_proof eq_ty left) in
954 true, Some (goalproof, reflproof, 0, Subst.empty_subst,m)
956 (match check_if_goal_is_subsumed env (snd active) goal with
959 prerr_endline "Proof found by subsumption!";
964 ( prerr_endline "esco qui";
966 let s = Printf.sprintf "actives:\n%s\n"
969 (fun (s, e) -> (string_of_sign s) ^ " " ^
970 (string_of_equality ~env e))
972 let sp = Printf.sprintf "passives:\n%s\n"
975 (string_of_equality ~env)
976 (let x,y,_ = passive in (fst x)@(fst y)))) in
980 | None -> assert false
981 | Some p -> ParamodulationSuccess p)
983 given_clause_fullred_aux dbd env goals theorems passive active
985 (* let ok', theorems = activate_theorem theorems in *)
987 (* let ok, goals = apply_theorem_to_goals env theorems active goals in *)
990 (* match (fst goals) with *)
991 (* | (_, [proof, _, _])::_ -> Some proof *)
992 (* | _ -> assert false *)
994 (* ParamodulationSuccess (proof, env) *)
996 (* given_clause_fullred_aux env goals theorems passive active *)
998 if (passive_is_empty passive) then ParamodulationFailure ""
999 else given_clause_fullred_aux dbd env goals theorems passive active
1001 and given_clause_fullred_aux dbd env goals theorems passive active =
1002 prerr_endline (string_of_int !counter ^
1003 " MAXMETA: " ^ string_of_int !maxmeta ^
1004 " #ACTIVES: " ^ string_of_int (size_of_active active) ^
1005 " #PASSIVES: " ^ string_of_int (size_of_passive passive));
1008 if !counter mod 10 = 0 then
1010 let size = HExtlib.estimate_size (passive,active) in
1011 let sizep = HExtlib.estimate_size (passive) in
1012 let sizea = HExtlib.estimate_size (active) in
1013 let (l1,s1),(l2,s2), t = passive in
1014 let sizetbl = HExtlib.estimate_size t in
1015 let sizel = HExtlib.estimate_size (l1,l2) in
1016 let sizes = HExtlib.estimate_size (s1,s2) in
1018 prerr_endline ("SIZE: " ^ string_of_int size);
1019 prerr_endline ("SIZE P: " ^ string_of_int sizep);
1020 prerr_endline ("SIZE A: " ^ string_of_int sizea);
1021 prerr_endline ("SIZE TBL: " ^ string_of_int sizetbl ^
1022 " SIZE L: " ^ string_of_int sizel ^
1023 " SIZE S:" ^ string_of_int sizes);
1026 if (size_of_active active) mod 50 = 0 then
1027 (let s = Printf.sprintf "actives:\n%s\n"
1030 (fun (s, e) -> (string_of_sign s) ^ " " ^
1031 (string_of_equality ~env e))
1033 let sp = Printf.sprintf "passives:\n%s\n"
1036 (string_of_equality ~env)
1037 (let x,y,_ = passive in (fst x)@(fst y)))) in
1039 prerr_endline sp); *)
1040 let time1 = Unix.gettimeofday () in
1041 let (_,context,_) = env in
1042 let selection_estimate = get_selection_estimate () in
1043 let kept = size_of_passive passive in
1045 if !time_limit = 0. || !processed_clauses = 0 then
1047 else if !elapsed_time > !time_limit then (
1048 debug_print (lazy (Printf.sprintf "Time limit (%.2f) reached: %.2f\n"
1049 !time_limit !elapsed_time));
1051 ) else if kept > selection_estimate then (
1053 (lazy (Printf.sprintf ("Too many passive equalities: pruning..." ^^
1054 "(kept: %d, selection_estimate: %d)\n")
1055 kept selection_estimate));
1056 prune_passive selection_estimate active passive
1061 let time2 = Unix.gettimeofday () in
1062 passive_maintainance_time := !passive_maintainance_time +. (time2 -. time1);
1064 kept_clauses := (size_of_passive passive) + (size_of_active active);
1065 match passive_is_empty passive with
1066 | true -> ParamodulationFailure ""
1067 (* given_clause_fullred dbd env goals theorems passive active *)
1069 let current, passive = select env goals passive in
1071 ("Selected = " ^ Equality.string_of_equality ~env current);
1073 (let w,p,(t,l,r,o),m = current in
1074 " size w: " ^ string_of_int (HExtlib.estimate_size w)^
1075 " size p: " ^ string_of_int (HExtlib.estimate_size p)^
1076 " size t: " ^ string_of_int (HExtlib.estimate_size t)^
1077 " size l: " ^ string_of_int (HExtlib.estimate_size l)^
1078 " size r: " ^ string_of_int (HExtlib.estimate_size r)^
1079 " size o: " ^ string_of_int (HExtlib.estimate_size o)^
1080 " size m: " ^ string_of_int (HExtlib.estimate_size m)^
1081 " size m-c: " ^ string_of_int
1082 (HExtlib.estimate_size (List.map (fun (x,_,_) -> x) m)))) *)
1083 let time1 = Unix.gettimeofday () in
1084 let res = forward_simplify env (Positive, current) ~passive active in
1085 let time2 = Unix.gettimeofday () in
1086 forward_simpl_time := !forward_simpl_time +. (time2 -. time1);
1089 (* weight_age_counter := !weight_age_counter + 1; *)
1090 given_clause_fullred dbd env goals theorems passive active
1092 (* prerr_endline (Printf.sprintf "selected simpl: %s"
1093 (Equality.string_of_equality ~env current));*)
1094 let t1 = Unix.gettimeofday () in
1095 let new' = infer env current active in
1099 (Printf.sprintf "new' (senza semplificare):\n%s\n"
1102 (fun e -> "Positive " ^
1103 (Equality.string_of_equality ~env e)) new'))))
1105 let t2 = Unix.gettimeofday () in
1106 infer_time := !infer_time +. (t2 -. t1);
1108 if Equality.is_identity env current then active
1110 let al, tbl = active in
1111 al @ [current], Indexing.index tbl current
1113 let rec simplify new' active passive =
1114 let t1 = Unix.gettimeofday () in
1115 let new' = forward_simplify_new env new'~passive active in
1116 let t2 = Unix.gettimeofday () in
1117 forward_simpl_new_time :=
1118 !forward_simpl_new_time +. (t2 -. t1);
1119 let t1 = Unix.gettimeofday () in
1120 let active, passive, newa, retained, pruned =
1121 backward_simplify env new' ~passive active in
1123 List.fold_left filter_dependent passive pruned in
1124 let t2 = Unix.gettimeofday () in
1125 backward_simpl_time := !backward_simpl_time +. (t2 -. t1);
1126 match newa, retained with
1127 | None, None -> active, passive, new'
1130 if Utils.debug_metas then
1133 (fun x->Indexing.check_target context x "simplify1")
1136 simplify (new' @ p) active passive
1137 | Some p, Some rp ->
1138 simplify (new' @ p @ rp) active passive
1140 let active, passive, new' = simplify new' active passive in
1142 let a,b,_ = build_table new' in
1143 simplify_goals env goals ~passive (a,b)
1147 let new1 = prova env new' active in
1148 let new' = (fst new') @ (fst new1), (snd new') @ (snd new1) in
1154 (Printf.sprintf "new1:\n%s\n"
1157 (fun e -> "Negative " ^
1158 (string_of_equality ~env e)) neg) @
1160 (fun e -> "Positive " ^
1161 (string_of_equality ~env e)) pos)))))
1164 let k = size_of_passive passive in
1165 if k < (kept - 1) then
1166 processed_clauses := !processed_clauses + (kept - 1 - k);
1171 (Printf.sprintf "active:\n%s\n"
1174 (fun e -> (Equality.string_of_equality ~env e))
1180 (Printf.sprintf "new':\n%s\n"
1183 (fun e -> "Negative " ^
1184 (Equality.string_of_equality ~env e)) new')))))
1186 let passive = add_to_passive passive new' in
1187 given_clause_fullred dbd env goals theorems passive active
1191 let profiler0 = HExtlib.profile "P/Saturation.given_clause_fullred"
1193 let given_clause_fullred dbd env goals theorems passive active =
1194 profiler0.HExtlib.profile
1195 (given_clause_fullred dbd env goals theorems passive) active
1198 let iseq uri = UriManager.eq uri (Utils.eq_URI ());;
1200 let check_if_goal_is_identity env = function
1201 | (goalproof,m,Cic.Appl[Cic.MutInd(uri,_,ens);eq_ty;left;right])
1202 when left = right && iseq uri ->
1203 let reflproof = Equality.Exact (Equality.refl_proof eq_ty left) in
1204 Some (goalproof, reflproof, 0, Subst.empty_subst,m)
1208 let rec check goal = function
1212 | None -> check goal tl
1213 | (Some p) as ok -> ok
1216 let simplify_goal_set env goals passive active =
1217 let active_goals, passive_goals = goals in
1218 let find (_,_,g) where =
1219 List.exists (fun (_,_,g1) -> Equality.meta_convertibility g g1) where
1224 match simplify_goal env goal ~passive active with
1225 | _, g -> if find g acc then acc else g::acc)
1226 (* active_goals active_goals *)
1229 if List.length active_goals <> List.length simplified then
1230 prerr_endline "SEMPLIFICANDO HO SCARTATO...";
1231 (simplified,passive_goals)
1233 HExtlib.list_uniq ~eq:(fun (_,_,t1) (_,_,t2) -> t1 = t2)
1234 (List.sort (fun (_,_,t1) (_,_,t2) -> compare t1 t1)
1235 ((*goals @*) simplified))
1239 let check_if_goals_set_is_solved env active goals =
1240 let active_goals, passive_goals = goals in
1247 check_if_goal_is_identity env;
1248 check_if_goal_is_subsumed env (snd active)])
1252 let infer_goal_set env active goals =
1253 let active_goals, passive_goals = goals in
1254 let rec aux = function
1256 | ((_,_,t1) as hd)::tl when
1258 (fun (_,_,t) -> Equality.meta_convertibility t t1)
1261 let selected = hd in
1262 let passive_goals = tl in
1263 let new' = Indexing.superposition_left env (snd active) selected in
1264 selected::active_goals, passive_goals @ new'
1270 let infer_goal_set_with_current env current goals =
1271 let active_goals, passive_goals = goals in
1272 let _,table,_ = build_table [current] in
1276 let new' = Indexing.superposition_left env table g in
1278 passive_goals active_goals
1283 let size_of_goal_set_a (l,_) = List.length l;;
1284 let size_of_goal_set_p (_,l) = List.length l;;
1286 (** given-clause algorithm with full reduction strategy: NEW implementation *)
1287 (* here goals is a set of goals in OR *)
1289 ((_,context,_) as env) goals theorems passive active max_iterations max_time
1291 let initial_time = Unix.gettimeofday () in
1292 let iterations_left iterno =
1293 let now = Unix.gettimeofday () in
1294 let time_left = max_time -. now in
1295 let time_spent_until_now = now -. initial_time in
1296 let iteration_medium_cost =
1297 time_spent_until_now /. (float_of_int iterno)
1299 let iterations_left = time_left /. iteration_medium_cost in
1300 int_of_float iterations_left
1302 let rec step goals theorems passive active iterno =
1303 if iterno > max_iterations then
1304 (ParamodulationFailure "No more iterations to spend")
1305 else if Unix.gettimeofday () > max_time then
1306 (ParamodulationFailure "No more time to spend")
1308 let _ = prerr_endline "simpl goal with active" in
1309 let _ = <:start<simplify goal set active>> in
1310 let goals = simplify_goal_set env goals passive active in
1311 let _ = <:stop<simplify goal set active>> in
1312 match check_if_goals_set_is_solved env active goals with
1315 (Printf.sprintf "Found a proof in: %f\n"
1316 (Unix.gettimeofday() -. initial_time));
1318 ParamodulationSuccess p
1321 (Printf.sprintf "%d #ACTIVES: %d #PASSIVES: %d #GOALSET: %d(%d)\n"
1322 iterno (size_of_active active) (size_of_passive passive)
1323 (size_of_goal_set_a goals) (size_of_goal_set_p goals));
1324 (* PRUNING OF PASSIVE THAT WILL NEVER BE PROCESSED *)
1326 let selection_estimate = iterations_left iterno in
1327 let kept = size_of_passive passive in
1328 if kept > selection_estimate then
1330 (*Printf.eprintf "Too many passive equalities: pruning...";
1331 prune_passive selection_estimate active*) passive
1336 kept_clauses := (size_of_passive passive) + (size_of_active active);
1338 if passive_is_empty passive then
1339 ParamodulationFailure "No more passive"(*maybe this is a success! *)
1342 let goals = infer_goal_set env active goals in
1343 let current, passive = select env goals passive in
1344 prerr_endline (Printf.sprintf "Selected = %s\n"
1345 (Equality.string_of_equality ~env current));
1346 (* SIMPLIFICATION OF CURRENT *)
1348 forward_simplify env (Positive, current) ~passive active
1351 | None -> step goals theorems passive active (iterno+1)
1353 (* GENERATION OF NEW EQUATIONS *)
1354 prerr_endline "infer";
1355 let new' = infer env current active in
1356 prerr_endline "infer goal";
1357 let goals = infer_goal_set_with_current env current goals in
1359 let al, tbl = active in
1360 al @ [current], Indexing.index tbl current
1362 (* FORWARD AND BACKWARD SIMPLIFICATION *)
1363 prerr_endline "fwd/back simpl";
1364 let rec simplify new' active passive =
1365 let new' = forward_simplify_new env new' ~passive active in
1366 let active, passive, newa, retained, pruned =
1367 backward_simplify env new' ~passive active
1370 List.fold_left filter_dependent passive pruned
1372 match newa, retained with
1373 | None, None -> active, passive, new'
1375 | None, Some p -> simplify (new' @ p) active passive
1376 | Some p, Some rp -> simplify (new' @ p @ rp) active passive
1378 let active, passive, new' = simplify new' active passive in
1379 prerr_endline "simpl goal with new";
1381 let a,b,_ = build_table new' in
1382 let _ = <:start<simplify_goal_set new>> in
1383 <:stop<simplify_goal_set new
1384 simplify_goal_set env goals passive (a,b)
1387 let passive = add_to_passive passive new' in
1388 step goals theorems passive active (iterno+1)
1391 step goals theorems passive active 1
1394 let rec saturate_equations env goal accept_fun passive active =
1395 elapsed_time := Unix.gettimeofday () -. !start_time;
1396 if !elapsed_time > !time_limit then
1399 let current, passive = select env ([goal],[]) passive in
1400 let res = forward_simplify env (Positive, current) ~passive active in
1403 saturate_equations env goal accept_fun passive active
1405 debug_print (lazy (Printf.sprintf "selected: %s"
1406 (Equality.string_of_equality ~env current)));
1407 let new' = infer env current active in
1409 if Equality.is_identity env current then active
1411 let al, tbl = active in
1412 al @ [current], Indexing.index tbl current
1414 let rec simplify new' active passive =
1415 let new' = forward_simplify_new env new' ~passive active in
1416 let active, passive, newa, retained, pruned =
1417 backward_simplify env new' ~passive active in
1419 List.fold_left filter_dependent passive pruned in
1420 match newa, retained with
1421 | None, None -> active, passive, new'
1423 | None, Some p -> simplify (new' @ p) active passive
1424 | Some p, Some rp -> simplify (new' @ p @ rp) active passive
1426 let active, passive, new' = simplify new' active passive in
1430 (Printf.sprintf "active:\n%s\n"
1433 (fun e -> Equality.string_of_equality ~env e)
1439 (Printf.sprintf "new':\n%s\n"
1442 (fun e -> "Negative " ^
1443 (Equality.string_of_equality ~env e)) new'))))
1445 let new' = List.filter accept_fun new' in
1446 let passive = add_to_passive passive new' in
1447 saturate_equations env goal accept_fun passive active
1450 let main dbd full term metasenv ugraph = ()
1452 let main dbd full term metasenv ugraph =
1453 let module C = Cic in
1454 let module T = CicTypeChecker in
1455 let module PET = ProofEngineTypes in
1456 let module PP = CicPp in
1457 let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
1458 let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
1459 let proof, goals = status in
1460 let goal' = List.nth goals 0 in
1461 let _, metasenv, meta_proof, _ = proof in
1462 let _, context, goal = CicUtil.lookup_meta goal' metasenv in
1463 let eq_indexes, equalities, maxm = find_equalities context proof in
1464 let lib_eq_uris, library_equalities, maxm =
1466 find_library_equalities dbd context (proof, goal') (maxm+2)
1468 let library_equalities = List.map snd library_equalities in
1469 maxmeta := maxm+2; (* TODO ugly!! *)
1470 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
1471 let new_meta_goal, metasenv, type_of_goal =
1472 let _, context, ty = CicUtil.lookup_meta goal' metasenv in
1475 (Printf.sprintf "\n\nTIPO DEL GOAL: %s\n\n" (CicPp.ppterm ty)));
1476 Cic.Meta (maxm+1, irl),
1477 (maxm+1, context, ty)::metasenv,
1480 let env = (metasenv, context, ugraph) in
1481 let t1 = Unix.gettimeofday () in
1484 let theorems = find_library_theorems dbd env (proof, goal') lib_eq_uris in
1485 let context_hyp = find_context_hypotheses env eq_indexes in
1486 context_hyp @ theorems, []
1489 let us = UriManager.string_of_uri (LibraryObjects.eq_URI ()) in
1490 UriManager.uri_of_string (us ^ "#xpointer(1/1/1)")
1492 let t = CicUtil.term_of_uri refl_equal in
1493 let ty, _ = CicTypeChecker.type_of_aux' [] [] t CicUniv.empty_ugraph in
1496 let t2 = Unix.gettimeofday () in
1499 (Printf.sprintf "Time to retrieve theorems: %.9f\n" (t2 -. t1)));
1504 "Theorems:\n-------------------------------------\n%s\n"
1509 "Term: %s, type: %s" (CicPp.ppterm t) (CicPp.ppterm ty))
1514 ([],Equality.BasicProof (Equality.empty_subst ,new_meta_goal)), [], goal
1516 let equalities = simplify_equalities env
1517 (equalities@library_equalities) in
1518 let active = make_active () in
1519 let passive = make_passive equalities in
1520 Printf.printf "\ncurrent goal: %s\n"
1521 (let _, _, g = goal in CicPp.ppterm g);
1522 Printf.printf "\ncontext:\n%s\n" (PP.ppcontext context);
1523 Printf.printf "\nmetasenv:\n%s\n" (print_metasenv metasenv);
1524 Printf.printf "\nequalities:\n%s\n"
1527 (Equality.string_of_equality ~env) equalities));
1528 (* (equalities @ library_equalities))); *)
1529 print_endline "--------------------------------------------------";
1530 let start = Unix.gettimeofday () in
1531 print_endline "GO!";
1532 start_time := Unix.gettimeofday ();
1534 let goals = make_goals goal in
1535 (if !use_fullred then given_clause_fullred else given_clause_fullred)
1536 dbd env goals theorems passive active
1538 let finish = Unix.gettimeofday () in
1541 | ParamodulationFailure ->
1542 Printf.printf "NO proof found! :-(\n\n"
1543 | ParamodulationSuccess (Some ((cicproof,cicmenv),(proof, env))) ->
1544 Printf.printf "OK, found a proof!\n";
1545 let oldproof = Equation.build_proof_term proof in
1546 let newproof,_,newenv,_ =
1547 CicRefine.type_of_aux'
1548 cicmenv context cicproof CicUniv.empty_ugraph
1550 (* REMEMBER: we have to instantiate meta_proof, we should use
1551 apply the "apply" tactic to proof and status
1553 let names = names_of_context context in
1554 prerr_endline "OLD PROOF";
1555 print_endline (PP.pp proof names);
1556 prerr_endline "NEW PROOF";
1557 print_endline (PP.pp newproof names);
1561 let (_, _, _, menv,_) = Equality.open_equality eq in
1568 CicTypeChecker.type_of_aux' newmetasenv context proof ugraph
1570 print_endline (string_of_float (finish -. start));
1572 "\nGOAL was: %s\nPROOF has type: %s\nconvertible?: %s\n\n"
1573 (CicPp.pp type_of_goal names) (CicPp.pp ty names)
1575 (fst (CicReduction.are_convertible
1576 context type_of_goal ty ug)));
1578 Printf.printf "\nEXCEPTION!!! %s\n" (Printexc.to_string e);
1579 Printf.printf "MAXMETA USED: %d\n" !maxmeta;
1580 print_endline (string_of_float (finish -. start));*)
1584 | ParamodulationSuccess None ->
1585 Printf.printf "Success, but no proof?!?\n\n"
1590 ((Printf.sprintf ("infer_time: %.9f\nforward_simpl_time: %.9f\n" ^^
1591 "forward_simpl_new_time: %.9f\n" ^^
1592 "backward_simpl_time: %.9f\n")
1593 !infer_time !forward_simpl_time !forward_simpl_new_time
1594 !backward_simpl_time) ^
1595 (Printf.sprintf "passive_maintainance_time: %.9f\n"
1596 !passive_maintainance_time) ^
1597 (Printf.sprintf " successful unification/matching time: %.9f\n"
1598 !Indexing.match_unif_time_ok) ^
1599 (Printf.sprintf " failed unification/matching time: %.9f\n"
1600 !Indexing.match_unif_time_no) ^
1601 (Printf.sprintf " indexing retrieval time: %.9f\n"
1602 !Indexing.indexing_retrieval_time) ^
1603 (Printf.sprintf " demodulate_term.build_newtarget_time: %.9f\n"
1604 !Indexing.build_newtarget_time) ^
1605 (Printf.sprintf "derived %d clauses, kept %d clauses.\n"
1606 !derived_clauses !kept_clauses))
1610 print_endline ("EXCEPTION: " ^ (Printexc.to_string exc));
1616 let default_depth = !maxdepth
1617 and default_width = !maxwidth;;
1621 symbols_counter := 0;
1622 weight_age_counter := !weight_age_ratio;
1623 processed_clauses := 0;
1626 maximal_retained_equality := None;
1628 forward_simpl_time := 0.;
1629 forward_simpl_new_time := 0.;
1630 backward_simpl_time := 0.;
1631 passive_maintainance_time := 0.;
1632 derived_clauses := 0;
1638 dbd ?(full=false) ?(depth=default_depth) ?(width=default_width) status =
1639 let module C = Cic in
1641 Indexing.init_index ();
1645 (* CicUnification.unif_ty := false;*)
1646 let proof, goalno = status in
1647 let uri, metasenv, meta_proof, term_to_prove = proof in
1648 let _, context, type_of_goal = CicUtil.lookup_meta goalno metasenv in
1649 let names = names_of_context context in
1650 let eq_indexes, equalities, maxm = find_equalities context proof in
1651 let ugraph = CicUniv.empty_ugraph in
1652 let env = (metasenv, context, ugraph) in
1653 let goal = [], List.filter (fun (i,_,_)->i<>goalno) metasenv, type_of_goal in
1655 let t1 = Unix.gettimeofday () in
1656 let lib_eq_uris, library_equalities, maxm =
1657 find_library_equalities dbd context (proof, goalno) (maxm+2)
1659 let library_equalities = List.map snd library_equalities in
1660 let t2 = Unix.gettimeofday () in
1662 let equalities = simplify_equalities env (equalities@library_equalities) in
1665 (Printf.sprintf "Time to retrieve equalities: %.9f\n" (t2 -. t1)));
1666 let t1 = Unix.gettimeofday () in
1669 let thms = find_library_theorems dbd env (proof, goalno) lib_eq_uris in
1670 let context_hyp = find_context_hypotheses env eq_indexes in
1671 context_hyp @ thms, []
1674 let us = UriManager.string_of_uri (Utils.eq_URI ()) in
1675 UriManager.uri_of_string (us ^ "#xpointer(1/1/1)")
1677 let t = CicUtil.term_of_uri refl_equal in
1678 let ty, _ = CicTypeChecker.type_of_aux' [] [] t CicUniv.empty_ugraph in
1681 let t2 = Unix.gettimeofday () in
1686 "Theorems:\n-------------------------------------\n%s\n"
1691 "Term: %s, type: %s"
1692 (CicPp.ppterm t) (CicPp.ppterm ty))
1696 (Printf.sprintf "Time to retrieve theorems: %.9f\n" (t2 -. t1)));
1698 let active = make_active () in
1699 let passive = make_passive equalities in
1700 let start = Unix.gettimeofday () in
1703 let goals = make_goals goal in
1704 given_clause_fullred dbd env goals theorems passive active
1706 let goals = make_goal_set goal in
1707 let max_iterations = 10000 in
1708 let max_time = Unix.gettimeofday () +. 300. (* minutes *) in
1709 given_clause env goals theorems passive active max_iterations max_time
1711 let finish = Unix.gettimeofday () in
1712 (res, finish -. start)
1715 | ParamodulationFailure s ->
1716 raise (ProofEngineTypes.Fail (lazy ("NO proof found: " ^ s)))
1717 | ParamodulationSuccess
1718 (goalproof,newproof,subsumption_id,subsumption_subst, proof_menv) ->
1719 prerr_endline "OK, found a proof!";
1721 (Equality.pp_proof names goalproof newproof subsumption_subst
1722 subsumption_id type_of_goal);
1723 prerr_endline (CicMetaSubst.ppmetasenv [] proof_menv);
1724 prerr_endline "ENDOFPROOFS";
1725 (* generation of the CIC proof *)
1727 List.filter (fun i -> i <> goalno)
1728 (ProofEngineHelpers.compare_metasenvs
1729 ~newmetasenv:metasenv ~oldmetasenv:proof_menv)
1731 let goal_proof, side_effects_t =
1732 let initial = Equality.add_subst subsumption_subst newproof in
1733 Equality.build_goal_proof goalproof initial type_of_goal side_effects
1735 (*prerr_endline (CicPp.pp goal_proof names);*)
1737 let goal_proof = (* Subst.apply_subst subsumption_subst *) goal_proof in
1738 let side_effects_t =
1739 List.map (Subst.apply_subst subsumption_subst) side_effects_t
1741 (* replacing fake mets with real ones *)
1742 prerr_endline "replacing metas...";
1743 let irl=CicMkImplicit.identity_relocation_list_for_metavariable context in
1744 let goal_proof_menv, what, with_what,free_meta =
1746 (fun (acc1,acc2,acc3,uniq) (i,_,ty) ->
1749 acc1, (Cic.Meta(i,[]))::acc2, m::acc3, uniq
1751 [i,context,ty], (Cic.Meta(i,[]))::acc2,
1752 (Cic.Meta(i,irl)) ::acc3,Some (Cic.Meta(i,irl)))
1753 ([],[],[],None) proof_menv
1756 (* we need this fake equality since the metas of the hypothesis may be
1757 * with a real local context *)
1758 ProofEngineReduction.replace_lifting
1759 ~equality:(fun x y ->
1760 match x,y with Cic.Meta(i,_),Cic.Meta(j,_) -> i=j | _-> false)
1761 ~what ~with_what ~where
1763 let goal_proof = replace goal_proof in
1764 (* ok per le meta libere... ma per quelle che c'erano e sono rimaste?
1765 * what mi pare buono, sostituisce solo le meta farlocche *)
1766 let side_effects_t = List.map replace side_effects_t in
1768 List.filter (fun i -> i <> goalno)
1769 (ProofEngineHelpers.compare_metasenvs
1770 ~oldmetasenv:metasenv ~newmetasenv:goal_proof_menv)
1772 prerr_endline ("freemetas: " ^ String.concat "," (List.map string_of_int free_metas) );
1773 (* check/refine/... build the new proof *)
1775 ProofEngineReduction.replace
1776 ~what:side_effects ~with_what:side_effects_t
1777 ~equality:(fun i t -> match t with Cic.Meta(j,_)->j=i|_->false)
1780 let subst_side_effects,real_menv,_ =
1781 let fail t s = raise (ProofEngineTypes.Fail (lazy (t^Lazy.force s))) in
1782 let free_metas_menv =
1783 List.map (fun i -> CicUtil.lookup_meta i goal_proof_menv) free_metas
1786 CicUnification.fo_unif_subst [] context (metasenv @ free_metas_menv)
1787 replaced_goal type_of_goal CicUniv.empty_ugraph
1789 | CicUnification.UnificationFailure s
1790 | CicUnification.Uncertain s
1791 | CicUnification.AssertFailure s ->
1792 fail "Maybe the local context of metas in the goal was not an IRL" s
1795 (goalno,(context,goal_proof,type_of_goal))::subst_side_effects
1797 prerr_endline ("MENVreal_menv: " ^ CicMetaSubst.ppmetasenv [] real_menv);
1800 CicTypeChecker.type_of_aux' real_menv context goal_proof
1801 CicUniv.empty_ugraph
1803 | CicUtil.Meta_not_found _
1804 | CicTypeChecker.TypeCheckerFailure _
1805 | CicTypeChecker.AssertFailure _
1806 | Invalid_argument "list_fold_left2" as exn ->
1807 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1808 prerr_endline (CicPp.pp goal_proof names);
1809 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1812 let proof, real_metasenv =
1813 ProofEngineHelpers.subst_meta_and_metasenv_in_proof
1814 proof goalno (CicMetaSubst.apply_subst final_subst) real_menv
1817 match free_meta with Some(Cic.Meta(m,_)) when m<>goalno ->[m] | _ ->[]
1820 "GOALS APERTI: %s\nMETASENV PRIMA:\n%s\nMETASENV DOPO:\n%s\n"
1821 (String.concat ", " (List.map string_of_int open_goals))
1822 (CicMetaSubst.ppmetasenv [] metasenv)
1823 (CicMetaSubst.ppmetasenv [] real_metasenv);
1824 prerr_endline (Printf.sprintf "\nTIME NEEDED: %8.2f" time);
1828 let retrieve_and_print dbd term metasenv ugraph =
1829 let module C = Cic in
1830 let module T = CicTypeChecker in
1831 let module PET = ProofEngineTypes in
1832 let module PP = CicPp in
1833 let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
1834 let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
1835 let proof, goals = status in
1836 let goal' = List.nth goals 0 in
1837 let uri, metasenv, meta_proof, term_to_prove = proof in
1838 let _, context, type_of_goal = CicUtil.lookup_meta goal' metasenv in
1839 let eq_indexes, equalities, maxm = find_equalities context proof in
1840 let ugraph = CicUniv.empty_ugraph in
1841 let env = (metasenv, context, ugraph) in
1842 let t1 = Unix.gettimeofday () in
1843 let lib_eq_uris, library_equalities, maxm =
1844 find_library_equalities dbd context (proof, goal') (maxm+2) in
1845 let t2 = Unix.gettimeofday () in
1847 let equalities = (* equalities @ *) library_equalities in
1850 (Printf.sprintf "\n\nequalities:\n%s\n"
1854 (* Printf.sprintf "%s: %s" *)
1855 (UriManager.string_of_uri u)
1856 (* (string_of_equality e) *)
1859 debug_print (lazy "RETR: SIMPLYFYING EQUALITIES...");
1860 let rec simpl e others others_simpl =
1862 let active = List.map (fun (u, e) -> (Positive, e))
1863 (others @ others_simpl) in
1866 (fun t (_, e) -> Indexing.index t e)
1867 Indexing.empty active
1869 let res = forward_simplify env (Positive, e) (active, tbl) in
1873 | None -> simpl hd tl others_simpl
1874 | Some e -> simpl hd tl ((u, e)::others_simpl)
1878 | None -> others_simpl
1879 | Some e -> (u, e)::others_simpl
1883 match equalities with
1886 let others = tl in (* List.map (fun e -> (Positive, e)) tl in *)
1888 List.rev (simpl (*(Positive,*) hd others [])
1892 (Printf.sprintf "\nequalities AFTER:\n%s\n"
1896 Printf.sprintf "%s: %s"
1897 (UriManager.string_of_uri u)
1898 (Equality.string_of_equality e)
1904 (Printf.sprintf "Time to retrieve equalities: %.9f\n" (t2 -. t1)))
1908 let main_demod_equalities dbd term metasenv ugraph =
1909 let module C = Cic in
1910 let module T = CicTypeChecker in
1911 let module PET = ProofEngineTypes in
1912 let module PP = CicPp in
1913 let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
1914 let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
1915 let proof, goals = status in
1916 let goal' = List.nth goals 0 in
1917 let _, metasenv, meta_proof, _ = proof in
1918 let _, context, goal = CicUtil.lookup_meta goal' metasenv in
1919 let eq_indexes, equalities, maxm = find_equalities context proof in
1920 let lib_eq_uris, library_equalities, maxm =
1921 find_library_equalities dbd context (proof, goal') (maxm+2)
1923 let library_equalities = List.map snd library_equalities in
1924 maxmeta := maxm+2; (* TODO ugly!! *)
1925 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
1926 let new_meta_goal, metasenv, type_of_goal =
1927 let _, context, ty = CicUtil.lookup_meta goal' metasenv in
1930 (Printf.sprintf "\n\nTRYING TO INFER EQUALITIES MATCHING: %s\n\n"
1931 (CicPp.ppterm ty)));
1932 Cic.Meta (maxm+1, irl),
1933 (maxm+1, context, ty)::metasenv,
1936 let env = (metasenv, context, ugraph) in
1938 let goal = [], [], goal
1940 let equalities = simplify_equalities env (equalities@library_equalities) in
1941 let active = make_active () in
1942 let passive = make_passive equalities in
1943 Printf.printf "\ncontext:\n%s\n" (PP.ppcontext context);
1944 Printf.printf "\nmetasenv:\n%s\n" (print_metasenv metasenv);
1945 Printf.printf "\nequalities:\n%s\n"
1948 (Equality.string_of_equality ~env) equalities));
1949 print_endline "--------------------------------------------------";
1950 print_endline "GO!";
1951 start_time := Unix.gettimeofday ();
1952 if !time_limit < 1. then time_limit := 60.;
1954 saturate_equations env goal (fun e -> true) passive active
1958 List.fold_left (fun s e -> EqualitySet.add e s)
1959 EqualitySet.empty equalities
1962 if not (EqualitySet.mem e initial) then EqualitySet.add e s else s
1968 EqualitySet.elements (List.fold_left addfun EqualitySet.empty p)
1972 EqualitySet.elements (List.fold_left addfun EqualitySet.empty l)
1974 Printf.printf "\n\nRESULTS:\nActive:\n%s\n\nPassive:\n%s\n"
1975 (String.concat "\n" (List.map (Equality.string_of_equality ~env) active))
1976 (* (String.concat "\n"
1977 (List.map (fun e -> CicPp.ppterm (term_of_equality e)) active)) *)
1978 (* (String.concat "\n" (List.map (string_of_equality ~env) passive)); *)
1980 (List.map (fun e -> CicPp.ppterm (Equality.term_of_equality e)) passive));
1984 debug_print (lazy ("EXCEPTION: " ^ (Printexc.to_string e)))
1988 let demodulate_tac ~dbd ~pattern ((proof,goal)(*s initialstatus*)) =
1989 let module I = Inference in
1990 let curi,metasenv,pbo,pty = proof in
1991 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
1992 let eq_indexes, equalities, maxm = I.find_equalities context proof in
1993 let lib_eq_uris, library_equalities, maxm =
1994 I.find_library_equalities dbd context (proof, goal) (maxm+2) in
1995 if library_equalities = [] then prerr_endline "VUOTA!!!";
1996 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
1997 let library_equalities = List.map snd library_equalities in
1998 let initgoal = [], [], ty in
1999 let env = (metasenv, context, CicUniv.empty_ugraph) in
2000 let equalities = simplify_equalities env (equalities@library_equalities) in
2003 (fun tbl eq -> Indexing.index tbl eq)
2004 Indexing.empty equalities
2006 let changed,(newproof,newmetasenv, newty) =
2007 Indexing.demodulation_goal
2008 (metasenv,context,CicUniv.empty_ugraph) table initgoal
2012 let opengoal = Equality.Exact (Cic.Meta(maxm,irl)) in
2014 Equality.build_goal_proof newproof opengoal ty [] in
2015 let extended_metasenv = (maxm,context,newty)::metasenv in
2016 let extended_status =
2017 (curi,extended_metasenv,pbo,pty),goal in
2018 let (status,newgoals) =
2019 ProofEngineTypes.apply_tactic
2020 (PrimitiveTactics.apply_tac ~term:proofterm)
2022 (status,maxm::newgoals)
2024 else (* if newty = ty then *)
2025 raise (ProofEngineTypes.Fail (lazy "no progress"))
2026 (*else ProofEngineTypes.apply_tactic
2027 (ReductionTactics.simpl_tac ~pattern)
2031 let demodulate_tac ~dbd ~pattern =
2032 ProofEngineTypes.mk_tactic (demodulate_tac ~dbd ~pattern)
2036 <:show<Saturation.>> ^ Indexing.get_stats () ^ Inference.get_stats ();;