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;;
35 (* profiling statistics... *)
36 let infer_time = ref 0.;;
37 let forward_simpl_time = ref 0.;;
38 let forward_simpl_new_time = ref 0.;;
39 let backward_simpl_time = ref 0.;;
40 let passive_maintainance_time = ref 0.;;
42 (* limited-resource-strategy related globals *)
43 let processed_clauses = ref 0;; (* number of equalities selected so far... *)
44 let time_limit = ref 0.;; (* in seconds, settable by the user... *)
45 let start_time = ref 0.;; (* time at which the execution started *)
46 let elapsed_time = ref 0.;;
47 (* let maximal_weight = ref None;; *)
48 let maximal_retained_equality = ref None;;
50 (* equality-selection related globals *)
51 let use_fullred = ref true;;
52 let weight_age_ratio = ref 6 (* 5 *);; (* settable by the user *)
53 let weight_age_counter = ref !weight_age_ratio ;;
54 let symbols_ratio = ref 0 (* 3 *);;
55 let symbols_counter = ref 0;;
57 (* non-recursive Knuth-Bendix term ordering by default *)
58 (* Utils.compare_terms := Utils.rpo;; *)
59 (* Utils.compare_terms := Utils.nonrec_kbo;; *)
60 (* Utils.compare_terms := Utils.ao;; *)
63 let derived_clauses = ref 0;;
64 let kept_clauses = ref 0;;
66 (* index of the greatest Cic.Meta created - TODO: find a better way! *)
69 (* varbiables controlling the search-space *)
70 let maxdepth = ref 3;;
71 let maxwidth = ref 3;;
74 Equality.goal_proof * Equality.proof * int * Subst.substitution * Cic.metasenv
76 | ParamodulationFailure of string
77 | ParamodulationSuccess of new_proof
80 (* type goal = Equality.goal_proof * Cic.metasenv * Cic.term;; *)
82 type theorem = Cic.term * Cic.term * Cic.metasenv;;
84 let symbols_of_equality equality =
85 let (_, _, (_, left, right, _), _,_) = Equality.open_equality equality in
86 let m1 = Utils.symbols_of_term left in
91 let c = Utils.TermMap.find k res in
92 Utils.TermMap.add k (c+v) res
94 Utils.TermMap.add k v res)
95 (Utils.symbols_of_term right) m1
101 module OrderedEquality = struct
102 type t = Equality.equality
104 let compare eq1 eq2 =
105 match Equality.meta_convertibility_eq eq1 eq2 with
108 let w1, _, (ty,left, right, _), m1,_ = Equality.open_equality eq1 in
109 let w2, _, (ty',left', right', _), m2,_ = Equality.open_equality eq2 in
110 match Pervasives.compare w1 w2 with
112 let res = (List.length m1) - (List.length m2) in
113 if res <> 0 then res else
114 Equality.compare eq1 eq2
118 module EqualitySet = Set.Make(OrderedEquality);;
120 exception Empty_list;;
122 let passive_is_empty = function
127 let no_more_passive_goals = function
132 let size_of_passive ((passive_list, ps), _) = List.length passive_list
133 (* EqualitySet.cardinal ps *)
137 let size_of_active (active_list, _) = List.length active_list
140 let age_factor = 0.01;;
143 selects one equality from passive. The selection strategy is a combination
144 of weight, age and goal-similarity
147 let rec select env (goals,_) passive =
148 processed_clauses := !processed_clauses + 1;
150 match (List.rev goals) with goal::_ -> goal | _ -> assert false
152 let (pos_list, pos_set), passive_table = passive in
153 let remove eq l = List.filter (fun e -> Equality.compare e eq <> 0) l in
154 if !weight_age_ratio > 0 then
155 weight_age_counter := !weight_age_counter - 1;
156 match !weight_age_counter with
158 weight_age_counter := !weight_age_ratio;
159 let rec skip_giant pos_list pos_set passive_table =
161 | (hd:EqualitySet.elt)::tl ->
162 let w,_,_,_,_ = Equality.open_equality hd in
164 Indexing.remove_index passive_table hd
166 let pos_set = EqualitySet.remove hd pos_set in
168 hd, ((tl, pos_set), passive_table)
170 (prerr_endline ("\n\n\nGIANT SKIPPED: "^string_of_int w^"\n\n\n");
171 skip_giant tl pos_set passive_table)
174 skip_giant pos_list pos_set passive_table)
175 | _ when (!symbols_counter > 0) ->
176 (symbols_counter := !symbols_counter - 1;
177 let cardinality map =
178 Utils.TermMap.fold (fun k v res -> res + v) map 0
181 let _, _, term = goal in
182 Utils.symbols_of_term term
184 let card = cardinality symbols in
185 let foldfun k v (r1, r2) =
186 if Utils.TermMap.mem k symbols then
187 let c = Utils.TermMap.find k symbols in
188 let c1 = abs (c - v) in
194 let f equality (i, e) =
196 Utils.TermMap.fold foldfun (symbols_of_equality equality) (0, 0)
198 let c = others + (abs (common - card)) in
199 if c < i then (c, equality)
202 let e1 = EqualitySet.min_elt pos_set in
205 Utils.TermMap.fold foldfun (symbols_of_equality e1) (0, 0)
207 (others + (abs (common - card))), e1
209 let _, current = EqualitySet.fold f pos_set initial in
211 Indexing.remove_index passive_table current
214 ((remove current pos_list, EqualitySet.remove current pos_set),
217 symbols_counter := !symbols_ratio;
219 let w1,_,_,_,_ = Equality.open_equality e1 in
220 let w2,_,_,_,_ = Equality.open_equality e2 in
221 if w1 < w2 then e1 else e2
223 let rec my_min_elt min = function
225 | hd::tl -> my_min_elt (my_min hd min) tl
227 (* let current = EqualitySet.min_elt pos_set in *)
228 let current = my_min_elt (List.hd pos_list) (List.tl pos_list) in
230 Indexing.remove_index passive_table current
233 ((remove current pos_list, EqualitySet.remove current pos_set),
237 let filter_dependent passive id =
238 prerr_endline ("+++++++++++++++passives "^
239 ( string_of_int (size_of_passive passive)));
240 let (pos_list, pos_set), passive_table = passive in
243 (fun eq ((list,set),table) ->
244 if Equality.depend eq id then
245 (let _,_,_,_,id_eq = Equality.open_equality eq in
247 prerr_endline ("\n\n--------filtering "^(string_of_int id_eq));
249 EqualitySet.remove eq set),
250 Indexing.remove_index table eq))
252 ((eq::list, set),table))
253 pos_list (([],pos_set),passive_table) in
254 prerr_endline ("+++++++++++++++passives "^
255 ( string_of_int (size_of_passive passive)));
260 (* initializes the passive set of equalities *)
261 let make_passive pos =
262 let set_of equalities =
263 List.fold_left (fun s e -> EqualitySet.add e s) EqualitySet.empty equalities
266 List.fold_left (fun tbl e -> Indexing.index tbl e) Indexing.empty pos
278 (* adds to passive a list of equalities new_pos *)
279 let add_to_passive passive new_pos =
280 let (pos_list, pos_set), table = passive in
281 let ok set equality = not (EqualitySet.mem equality set) in
282 let pos = List.filter (ok pos_set) new_pos in
284 List.fold_left (fun tbl e -> Indexing.index tbl e) table pos
286 let add set equalities =
287 List.fold_left (fun s e -> EqualitySet.add e s) set equalities
289 (pos_list @ pos, 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 eq_uri env current (active_list, active_table) =
353 if Utils.debug_metas then
354 (ignore(Indexing.check_target c current "infer1");
355 ignore(List.map (function current -> Indexing.check_target c current "infer2") active_list));
357 let maxm, copy_of_current = Equality.fix_metas !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 eq_uri !maxmeta env active_table current
364 let _ = <:stop<current contro active>> in
365 if Utils.debug_metas then
368 Indexing.check_target c current "sup0") res);
370 let rec infer_positive table = function
374 Indexing.superposition_right
375 ~subterms_only:true eq_uri !maxmeta env table equality
378 if Utils.debug_metas then
382 Indexing.check_target 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 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 (* buttare via sign *)
446 (** simplifies current using active and passive *)
448 eq_uri env (sign,current) ?passive (active_list, active_table)
450 let _, context, _ = env in
454 | Some ((_, _), pt) -> Some pt
456 let demodulate table current =
457 let newmeta, newcurrent =
458 Indexing.demodulation_equality eq_uri !maxmeta env table sign current in
460 if Equality.is_identity env newcurrent then
465 let rec demod current =
466 if Utils.debug_metas then
467 ignore (Indexing.check_target context current "demod0");
468 let res = demodulate active_table current in
469 if Utils.debug_metas then
470 ignore ((function None -> () | Some x ->
471 ignore (Indexing.check_target context x "demod1");()) res);
475 match passive_table with
477 | Some passive_table ->
478 match demodulate passive_table newcurrent with
480 | Some newnewcurrent ->
481 if Equality.compare newcurrent newnewcurrent <> 0 then
483 else Some newnewcurrent
485 let res = demod current in
489 if Indexing.in_index active_table c then
492 match passive_table with
494 if check_for_deep_subsumption env active_table c then
499 if Indexing.subsumption env active_table c = None then
504 | Some passive_table ->
505 if Indexing.in_index passive_table c then None
507 if check_for_deep_subsumption env active_table c then
510 (* if Indexing.subsumption env active_table c = None then*)
511 (match Indexing.subsumption env passive_table c with
515 (*prerr_endline "\n\nPESCO DALLE PASSIVE LA PIU' GENERALE\n\n";
523 (** simplifies new using active and passive *)
524 let forward_simplify_new eq_uri env new_pos ?passive active =
525 if Utils.debug_metas then
529 (fun current -> Indexing.check_target c current "forward new pos")
532 let active_list, active_table = active in
536 | Some ((_, _), pt) -> Some pt
538 let demodulate sign table target =
539 let newmeta, newtarget =
540 Indexing.demodulation_equality eq_uri !maxmeta env table sign target
545 (* we could also demodulate using passive. Currently we don't *)
547 List.map (demodulate Utils.Positive active_table) new_pos
552 if not (Equality.is_identity env e) then
555 EqualitySet.empty new_pos
557 let new_pos = EqualitySet.elements new_pos_set in
560 match passive_table with
562 (fun e -> (Indexing.subsumption env active_table e = None))
563 | Some passive_table ->
564 (fun e -> ((Indexing.subsumption env active_table e = None) &&
565 (Indexing.subsumption env passive_table e = None)))
568 match passive_table with
570 (fun e -> not (Indexing.in_index active_table e))
571 | Some passive_table ->
573 not ((Indexing.in_index active_table e) ||
574 (Indexing.in_index passive_table e)))
576 List.filter subs (List.filter is_duplicate new_pos)
580 (** simplifies a goal with equalities in active and passive *)
581 let rec simplify_goal env goal ?passive (active_list, active_table) =
585 | Some ((_, _), pt) -> Some pt
587 let demodulate table goal = Indexing.demodulation_goal env table goal in
589 match passive_table with
590 | None -> demodulate active_table goal
591 | Some passive_table ->
592 let changed, goal = demodulate active_table goal in
593 (* let changed', goal = demodulate passive_table goal in*)
594 (changed (*|| changed'*)), goal
600 snd (simplify_goal env goal ?passive (active_list, active_table))
604 let simplify_goals env goals ?passive active =
605 let a_goals, p_goals = goals in
608 (fun g -> snd (simplify_goal env g ?passive active))
613 (fun g -> snd (simplify_goal env g ?passive active))
620 (** simplifies active usign new *)
621 let backward_simplify_active eq_uri env new_pos new_table min_weight active =
622 let active_list, active_table = active in
623 let active_list, newa, pruned =
625 (fun equality (res, newn,pruned) ->
626 let ew, _, _, _,id = Equality.open_equality equality in
627 if ew < min_weight then
628 equality::res, newn,pruned
632 eq_uri env (Utils.Positive, equality) (new_pos, new_table)
634 | None -> res, newn, id::pruned
636 if Equality.compare equality e = 0 then
639 res, e::newn, pruned)
640 active_list ([], [],[])
643 List.exists (Equality.meta_convertibility_eq eq1) where
646 let _, _, _, _,id = Equality.open_equality eq in id
648 let ((active1,pruned),tbl), newa =
650 (fun eq ((res,pruned), tbl) ->
651 if List.mem eq res then
652 (res, (id_of_eq eq)::pruned),tbl
653 else if (Equality.is_identity env eq) || (find eq res) then (
654 (res, (id_of_eq eq)::pruned),tbl
657 (eq::res,pruned), Indexing.index tbl eq)
658 active_list (([],pruned), Indexing.empty),
661 if (Equality.is_identity env eq) then p
666 | [] -> (active1,tbl), None, pruned
667 | _ -> (active1,tbl), Some newa, pruned
671 (** simplifies passive using new *)
672 let backward_simplify_passive eq_uri env new_pos new_table min_weight passive =
673 let (pl, ps), passive_table = passive in
674 let f sign equality (resl, ress, newn) =
675 let ew, _, _, _ , _ = Equality.open_equality equality in
676 if ew < min_weight then
677 equality::resl, ress, newn
680 forward_simplify eq_uri env (sign, equality) (new_pos, new_table)
682 | None -> resl, EqualitySet.remove equality ress, newn
685 equality::resl, ress, newn
687 let ress = EqualitySet.remove equality ress in
690 let pl, ps, newp = List.fold_right (f Utils.Positive) pl ([], ps, []) in
693 (fun tbl e -> Indexing.index tbl e) Indexing.empty pl
696 | [] -> ((pl, ps), passive_table), None
697 | _ -> ((pl, ps), passive_table), Some (newp)
700 let build_table equations =
703 let ew, _, _, _ , _ = Equality.open_equality e in
704 e::l, Indexing.index t e, min ew w)
705 ([], Indexing.empty, 1000000) equations
709 let backward_simplify eq_uri env new' ?passive active =
710 let new_pos, new_table, min_weight = build_table new' in
714 let ew, _, _, _ , _ = Equality.open_equality e in
715 e::l, Indexing.index t e, min ew w)
716 ([], Indexing.empty, 1000000) new'
719 let active, newa, pruned =
720 backward_simplify_active eq_uri env new_pos new_table min_weight active
724 active, (make_passive []), newa, None, pruned
726 active, passive, newa, None, pruned
729 backward_simplify_passive env new_pos new_table min_weight passive in
730 active, passive, newa, newp *)
733 let close eq_uri env new' given =
734 let new_pos, new_table, min_weight =
737 let ew, _, _, _ , _ = Equality.open_equality e in
738 e::l, Indexing.index t e, min ew w)
739 ([], Indexing.empty, 1000000) (snd new')
743 let pos = infer eq_uri env c (new_pos,new_table) in
748 let is_commutative_law eq =
749 let w, proof, (eq_ty, left, right, order), metas , _ =
750 Equality.open_equality eq
752 match left,right with
753 Cic.Appl[f1;Cic.Meta _ as a1;Cic.Meta _ as b1],
754 Cic.Appl[f2;Cic.Meta _ as a2;Cic.Meta _ as b2] ->
755 f1 = f2 && a1 = b2 && a2 = b1
759 let prova eq_uri env new' active =
760 let given = List.filter is_commutative_law (fst active) in
764 (Printf.sprintf "symmetric:\n%s\n"
767 (fun e -> Equality.string_of_equality ~env e)
769 close eq_uri env new' given
772 (* returns an estimation of how many equalities in passive can be activated
773 within the current time limit *)
774 let get_selection_estimate () =
775 elapsed_time := (Unix.gettimeofday ()) -. !start_time;
776 (* !processed_clauses * (int_of_float (!time_limit /. !elapsed_time)) *)
778 ceil ((float_of_int !processed_clauses) *.
779 ((!time_limit (* *. 2. *)) /. !elapsed_time -. 1.)))
783 (** initializes the set of goals *)
784 let make_goals goal =
786 and passive = [0, [goal]] in
790 let make_goal_set goal =
794 (** initializes the set of theorems *)
795 let make_theorems theorems =
800 let activate_goal (active, passive) =
803 | goal_conj::tl -> true, (goal_conj::active, tl)
804 | [] -> false, (active, passive)
806 true, (active,passive)
810 let activate_theorem (active, passive) =
812 | theorem::tl -> true, (theorem::active, tl)
813 | [] -> false, (active, passive)
818 let simplify_theorems env theorems ?passive (active_list, active_table) =
819 let pl, passive_table =
822 | Some ((pn, _), (pp, _), pt) ->
823 let pn = List.map (fun e -> (Utils.Negative, e)) pn
824 and pp = List.map (fun e -> (Utils.Positive, e)) pp in
827 let a_theorems, p_theorems = theorems in
828 let demodulate table theorem =
829 let newmeta, newthm =
830 Indexing.demodulation_theorem !maxmeta env table theorem in
832 theorem != newthm, newthm
834 let foldfun table (a, p) theorem =
835 let changed, theorem = demodulate table theorem in
836 if changed then (a, theorem::p) else (theorem::a, p)
838 let mapfun table theorem = snd (demodulate table theorem) in
839 match passive_table with
841 let p_theorems = List.map (mapfun active_table) p_theorems in
842 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems
843 | Some passive_table ->
844 let p_theorems = List.map (mapfun active_table) p_theorems in
845 let p_theorems, a_theorems =
846 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems in
847 let p_theorems = List.map (mapfun passive_table) p_theorems in
848 List.fold_left (foldfun passive_table) ([], p_theorems) a_theorems
852 let rec simpl eq_uri env e others others_simpl =
853 let active = others @ others_simpl in
856 (fun t e -> Indexing.index t e)
857 Indexing.empty active
859 let res = forward_simplify eq_uri env (Utils.Positive,e) (active, tbl) in
863 | None -> simpl eq_uri env hd tl others_simpl
864 | Some e -> simpl eq_uri env hd tl (e::others_simpl)
868 | None -> others_simpl
869 | Some e -> e::others_simpl
873 let simplify_equalities eq_uri env equalities =
876 (Printf.sprintf "equalities:\n%s\n"
878 (List.map Equality.string_of_equality equalities))));
879 Utils.debug_print (lazy "SIMPLYFYING EQUALITIES...");
880 match equalities with
884 List.rev (simpl eq_uri env hd tl [])
888 (Printf.sprintf "equalities AFTER:\n%s\n"
890 (List.map Equality.string_of_equality res))));
894 let print_goals goals =
901 (* (string_of_proof p) ^ ", " ^ *) (CicPp.ppterm t)) gl
903 Printf.sprintf "%d: %s" d (String.concat "; " gl')) goals))
906 let pp_goal_set msg goals names =
907 let active_goals, passive_goals = goals in
908 prerr_endline ("////" ^ msg);
909 prerr_endline ("ACTIVE G: " ^
910 (String.concat "\n " (List.map (fun (_,_,g) -> CicPp.pp g names)
912 prerr_endline ("PASSIVE G: " ^
913 (String.concat "\n " (List.map (fun (_,_,g) -> CicPp.pp g names)
917 let check_if_goal_is_subsumed ((_,ctx,_) as env) table (goalproof,menv,ty) =
918 let names = Utils.names_of_context ctx in
920 | Cic.Appl[Cic.MutInd(uri,_,_);eq_ty;left;right]
921 when LibraryObjects.is_eq_URI uri ->
924 (0,Equality.Exact (Cic.Implicit None),(eq_ty,left,right,Utils.Eq),menv)
926 (* match Indexing.subsumption env table goal_equation with*)
927 match Indexing.unification env table goal_equation with
928 | Some (subst, equality, swapped ) ->
930 ("GOAL SUBSUMED IS: " ^ Equality.string_of_equality goal_equation ~env);
932 ("GOAL IS SUBSUMED BY: " ^ Equality.string_of_equality equality ~env);
933 prerr_endline ("SUBST:" ^ Subst.ppsubst ~names subst);
934 let (_,p,(ty,l,r,_),m,id) = Equality.open_equality equality in
935 let cicmenv = Subst.apply_subst_metasenv subst (m @ menv) in
938 Equality.symmetric eq_ty l id uri m
942 Some (goalproof, p, id, subst, cicmenv)
947 let check_if_goal_is_identity env = function
948 | (goalproof,m,Cic.Appl[Cic.MutInd(uri,_,ens);eq_ty;left;right])
949 when left = right && LibraryObjects.is_eq_URI uri ->
950 let reflproof = Equality.Exact (Equality.refl_proof uri eq_ty left) in
951 Some (goalproof, reflproof, 0, Subst.empty_subst,m)
952 | (goalproof,m,Cic.Appl[Cic.MutInd(uri,_,ens);eq_ty;left;right])
953 when LibraryObjects.is_eq_URI uri ->
954 (let _,context,_ = env in
957 Inference.unification m m context left right CicUniv.empty_ugraph
959 let reflproof = Equality.Exact (Equality.refl_proof uri eq_ty left) in
960 let m = Subst.apply_subst_metasenv s m in
961 Some (goalproof, reflproof, 0, s,m)
966 let rec check goal = function
970 | None -> check goal tl
971 | (Some p) as ok -> ok
974 let simplify_goal_set env goals ?passive active =
975 let active_goals, passive_goals = goals in
976 let find (_,_,g) where =
977 List.exists (fun (_,_,g1) -> Equality.meta_convertibility g g1) where
982 match simplify_goal env goal ?passive active with
984 if changed then prerr_endline "???????????????cambiato ancora";
985 if find g acc then acc else g::acc)
986 (* active_goals active_goals *)
989 if List.length active_goals <> List.length simplified then
990 prerr_endline "SEMPLIFICANDO HO SCARTATO...";
991 (simplified,passive_goals)
993 HExtlib.list_uniq ~eq:(fun (_,_,t1) (_,_,t2) -> t1 = t2)
994 (List.sort (fun (_,_,t1) (_,_,t2) -> compare t1 t1)
995 ((*goals @*) simplified))
999 let check_if_goals_set_is_solved env active goals =
1000 let active_goals, passive_goals = goals in
1007 check_if_goal_is_identity env;
1008 check_if_goal_is_subsumed env (snd active)])
1012 let infer_goal_set env active goals =
1013 let active_goals, passive_goals = goals in
1014 let rec aux = function
1015 | [] -> active_goals, []
1017 let changed,selected = simplify_goal env hd active in
1019 prerr_endline ("--------------- goal semplificato");
1020 let (_,_,t1) = selected in
1022 List.exists (fun (_,_,t) -> Equality.meta_convertibility t t1)
1028 let passive_goals = tl in
1029 let new_passive_goals =
1030 if Utils.metas_of_term t1 = [] then passive_goals
1032 let newmaxmeta,new' =
1033 Indexing.superposition_left env (snd active) selected
1036 maxmeta := newmaxmeta;
1037 passive_goals @ new'
1039 selected::active_goals, new_passive_goals
1045 let infer_goal_set env active goals =
1046 let active_goals, passive_goals = goals in
1047 let rec aux = function
1049 | ((_,_,t1) as hd)::tl when
1052 Equality.meta_convertibility t t1)
1055 let selected = hd in
1056 let passive_goals = tl in
1057 let new_passive_goals =
1058 if CicUtil.is_meta_closed t1 then
1061 let new' = Indexing.superposition_left env (snd active) selected in
1062 passive_goals @ new'
1064 selected::active_goals, new_passive_goals
1071 let infer_goal_set_with_current env current goals active =
1072 let active_goals, passive_goals = goals in
1073 let active_goals, _ =
1074 simplify_goal_set env goals active
1076 let l,table,_ = build_table [current] in
1080 let newmaxmeta, new' = Indexing.superposition_left env table g !maxmeta in
1081 maxmeta := newmaxmeta;
1083 passive_goals active_goals
1088 let ids = List.map (fun _,_,i,_,_ -> i) p in
1092 let ids_of_goal_set (ga,gp) =
1093 List.flatten (List.map ids_of_goal ga) @
1094 List.flatten (List.map ids_of_goal gp)
1097 let size_of_goal_set_a (l,_) = List.length l;;
1098 let size_of_goal_set_p (_,l) = List.length l;;
1100 (** given-clause algorithm with full reduction strategy: NEW implementation *)
1101 (* here goals is a set of goals in OR *)
1103 eq_uri ((_,context,_) as env) goals theorems passive active max_iterations max_time
1105 let names = Utils.names_of_context context in
1106 let initial_time = Unix.gettimeofday () in
1107 let iterations_left iterno =
1108 let now = Unix.gettimeofday () in
1109 let time_left = max_time -. now in
1110 let time_spent_until_now = now -. initial_time in
1111 let iteration_medium_cost =
1112 time_spent_until_now /. (float_of_int iterno)
1114 let iterations_left = time_left /. iteration_medium_cost in
1115 int_of_float iterations_left
1117 let rec step goals theorems passive active iterno =
1118 if iterno > max_iterations then
1119 (ParamodulationFailure "No more iterations to spend")
1120 else if Unix.gettimeofday () > max_time then
1121 (ParamodulationFailure "No more time to spend")
1124 let _ = prerr_endline "simpl goal with active" in
1125 let _ = <:start<simplify goal set active>> in
1126 let goals = simplify_goal_set env goals passive active in
1127 let _ = <:stop<simplify goal set active>> in
1131 (Printf.sprintf "%d #ACTIVES: %d #PASSIVES: %d #GOALSET: %d(%d)\n"
1132 iterno (size_of_active active) (size_of_passive passive)
1133 (size_of_goal_set_a goals) (size_of_goal_set_p goals))
1135 (* PRUNING OF PASSIVE THAT WILL NEVER BE PROCESSED *)
1137 let selection_estimate = iterations_left iterno in
1138 let kept = size_of_passive passive in
1139 if kept > selection_estimate then
1141 (*Printf.eprintf "Too many passive equalities: pruning...";
1142 prune_passive selection_estimate active*) passive
1147 kept_clauses := (size_of_passive passive) + (size_of_active active);
1148 let goals = infer_goal_set env active goals in
1149 match check_if_goals_set_is_solved env active goals with
1152 (Printf.sprintf "Found a proof in: %f\n"
1153 (Unix.gettimeofday() -. initial_time));
1154 ParamodulationSuccess p
1157 if passive_is_empty passive then
1158 if no_more_passive_goals goals then
1159 ParamodulationFailure "No more passive equations/goals"
1160 (*maybe this is a success! *)
1162 step goals theorems passive active (iterno+1)
1165 (* COLLECTION OF GARBAGED EQUALITIES *)
1166 if iterno mod 40 = 0 then
1168 let active = List.map Equality.id_of (fst active) in
1169 let passive = List.map Equality.id_of (fst (fst passive)) in
1170 let goal = ids_of_goal_set goals in
1171 Equality.collect active passive goal
1173 let current, passive = select env goals passive in
1177 prerr_endline (Printf.sprintf "Current goal = %s\n"
1178 (CicPp.pp g names)))
1182 prerr_endline (Printf.sprintf "Passive goal = %s\n"
1183 (CicPp.pp g names)))
1185 prerr_endline (Printf.sprintf "Selected = %s\n"
1186 (Equality.string_of_equality ~env current))
1188 (* SIMPLIFICATION OF CURRENT *)
1190 forward_simplify eq_uri env (Utils.Positive, current) active
1193 | None -> step goals theorems passive active (iterno+1)
1195 (* GENERATION OF NEW EQUATIONS *)
1196 prerr_endline "infer";
1197 let new' = infer eq_uri env current active in
1198 prerr_endline "infer goal";
1200 match check_if_goals_set_is_solved env active goals with
1203 (Printf.sprintf "Found a proof in: %f\n"
1204 (Unix.gettimeofday() -. initial_time));
1205 ParamodulationSuccess p
1209 let al, tbl = active in
1210 al @ [current], Indexing.index tbl current
1213 infer_goal_set_with_current env current goals active
1215 (* FORWARD AND BACKWARD SIMPLIFICATION *)
1216 prerr_endline "fwd/back simpl";
1217 let rec simplify new' active passive =
1219 forward_simplify_new eq_uri env new' ~passive active
1221 let active, passive, newa, retained, pruned =
1222 backward_simplify eq_uri env new' ~passive active
1225 List.fold_left filter_dependent passive pruned
1227 match newa, retained with
1228 | None, None -> active, passive, new'
1230 | None, Some p -> simplify (new' @ p) active passive
1231 | Some p, Some rp -> simplify (new' @ p @ rp) active passive
1233 let active, passive, new' = simplify new' active passive in
1234 prerr_endline "simpl goal with new";
1236 let a,b,_ = build_table new' in
1237 let _ = <:start<simplify_goal_set new>> in
1238 let rc = simplify_goal_set env goals ~passive (a,b) in
1239 let _ = <:stop<simplify_goal_set new>> in
1242 let passive = add_to_passive passive new' in
1243 step goals theorems passive active (iterno+1)
1246 step goals theorems passive active 1
1249 let rec saturate_equations eq_uri env goal accept_fun passive active =
1250 elapsed_time := Unix.gettimeofday () -. !start_time;
1251 if !elapsed_time > !time_limit then
1254 let current, passive = select env ([goal],[]) passive in
1255 let res = forward_simplify eq_uri env (Utils.Positive, current) ~passive active in
1258 saturate_equations eq_uri env goal accept_fun passive active
1260 Utils.debug_print (lazy (Printf.sprintf "selected: %s"
1261 (Equality.string_of_equality ~env current)));
1262 let new' = infer eq_uri env current active in
1264 if Equality.is_identity env current then active
1266 let al, tbl = active in
1267 al @ [current], Indexing.index tbl current
1269 (* alla fine new' contiene anche le attive semplificate!
1270 * quindi le aggiungo alle passive insieme alle new *)
1271 let rec simplify new' active passive =
1272 let new' = forward_simplify_new eq_uri env new' ~passive active in
1273 let active, passive, newa, retained, pruned =
1274 backward_simplify eq_uri env new' ~passive active in
1276 List.fold_left filter_dependent passive pruned in
1277 match newa, retained with
1278 | None, None -> active, passive, new'
1280 | None, Some p -> simplify (new' @ p) active passive
1281 | Some p, Some rp -> simplify (new' @ p @ rp) active passive
1283 let active, passive, new' = simplify new' active passive in
1287 (Printf.sprintf "active:\n%s\n"
1290 (fun e -> Equality.string_of_equality ~env e)
1296 (Printf.sprintf "new':\n%s\n"
1299 (fun e -> "Negative " ^
1300 (Equality.string_of_equality ~env e)) new'))))
1302 let new' = List.filter accept_fun new' in
1303 let passive = add_to_passive passive new' in
1304 saturate_equations eq_uri env goal accept_fun passive active
1307 let main dbd full term metasenv ugraph = ()
1309 let main dbd full term metasenv ugraph =
1310 let module C = Cic in
1311 let module T = CicTypeChecker in
1312 let module PET = ProofEngineTypes in
1313 let module PP = CicPp in
1314 let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
1315 let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
1316 let proof, goals = status in
1317 let goal' = List.nth goals 0 in
1318 let _, metasenv, meta_proof, _ = proof in
1319 let _, context, goal = CicUtil.lookup_meta goal' metasenv in
1320 let eq_indexes, equalities, maxm = Inference.find_equalities context proof in
1321 let lib_eq_uris, library_equalities, maxm =
1323 Inference.find_library_equalities dbd context (proof, goal') (maxm+2)
1325 let library_equalities = List.map snd library_equalities in
1326 maxmeta := maxm+2; (* TODO ugly!! *)
1327 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
1328 let new_meta_goal, metasenv, type_of_goal =
1329 let _, context, ty = CicUtil.lookup_meta goal' metasenv in
1332 (Printf.sprintf "\n\nTIPO DEL GOAL: %s\n\n" (CicPp.ppterm ty)));
1333 Cic.Meta (maxm+1, irl),
1334 (maxm+1, context, ty)::metasenv,
1337 let env = (metasenv, context, ugraph) in
1338 let t1 = Unix.gettimeofday () in
1341 let theorems = Inference.find_library_theorems dbd env (proof, goal') lib_eq_uris in
1342 let context_hyp = Inference.find_context_hypotheses env eq_indexes in
1343 context_hyp @ theorems, []
1346 let us = UriManager.string_of_uri (LibraryObjects.eq_URI ()) in
1347 UriManager.uri_of_string (us ^ "#xpointer(1/1/1)")
1349 let t = CicUtil.term_of_uri refl_equal in
1350 let ty, _ = CicTypeChecker.type_of_aux' [] [] t CicUniv.empty_ugraph in
1353 let t2 = Unix.gettimeofday () in
1356 (Printf.sprintf "Time to retrieve theorems: %.9f\n" (t2 -. t1)));
1361 "Theorems:\n-------------------------------------\n%s\n"
1366 "Term: %s, type: %s" (CicPp.ppterm t) (CicPp.ppterm ty))
1371 ([],Equality.BasicProof (Equality.empty_subst ,new_meta_goal)), [], goal
1373 let equalities = simplify_equalities env
1374 (equalities@library_equalities) in
1375 let active = make_active () in
1376 let passive = make_passive equalities in
1377 Printf.printf "\ncurrent goal: %s\n"
1378 (let _, _, g = goal in CicPp.ppterm g);
1379 Printf.printf "\ncontext:\n%s\n" (PP.ppcontext context);
1380 Printf.printf "\nmetasenv:\n%s\n" (Utils.print_metasenv metasenv);
1381 Printf.printf "\nequalities:\n%s\n"
1384 (Equality.string_of_equality ~env) equalities));
1385 (* (equalities @ library_equalities))); *)
1386 print_endline "--------------------------------------------------";
1387 let start = Unix.gettimeofday () in
1388 print_endline "GO!";
1389 start_time := Unix.gettimeofday ();
1391 let goals = make_goals goal in
1392 (if !use_fullred then given_clause_fullred else given_clause_fullred)
1393 dbd env goals theorems passive active
1395 let finish = Unix.gettimeofday () in
1398 | ParamodulationFailure ->
1399 Printf.printf "NO proof found! :-(\n\n"
1400 | ParamodulationSuccess (Some ((cicproof,cicmenv),(proof, env))) ->
1401 Printf.printf "OK, found a proof!\n";
1402 let oldproof = Equation.build_proof_term proof in
1403 let newproof,_,newenv,_ =
1404 CicRefine.type_of_aux'
1405 cicmenv context cicproof CicUniv.empty_ugraph
1407 (* REMEMBER: we have to instantiate meta_proof, we should use
1408 apply the "apply" tactic to proof and status
1410 let names = Utils.names_of_context context in
1411 prerr_endline "OLD PROOF";
1412 print_endline (PP.pp proof names);
1413 prerr_endline "NEW PROOF";
1414 print_endline (PP.pp newproof names);
1418 let (_, _, _, menv,_) = Equality.open_equality eq in
1425 CicTypeChecker.type_of_aux' newmetasenv context proof ugraph
1427 print_endline (string_of_float (finish -. start));
1429 "\nGOAL was: %s\nPROOF has type: %s\nconvertible?: %s\n\n"
1430 (CicPp.pp type_of_goal names) (CicPp.pp ty names)
1432 (fst (CicReduction.are_convertible
1433 context type_of_goal ty ug)));
1435 Printf.printf "\nEXCEPTION!!! %s\n" (Printexc.to_string e);
1436 Printf.printf "MAXMETA USED: %d\n" !maxmeta;
1437 print_endline (string_of_float (finish -. start));*)
1441 | ParamodulationSuccess None ->
1442 Printf.printf "Success, but no proof?!?\n\n"
1447 ((Printf.sprintf ("infer_time: %.9f\nforward_simpl_time: %.9f\n" ^^
1448 "forward_simpl_new_time: %.9f\n" ^^
1449 "backward_simpl_time: %.9f\n")
1450 !infer_time !forward_simpl_time !forward_simpl_new_time
1451 !backward_simpl_time) ^
1452 (Printf.sprintf "passive_maintainance_time: %.9f\n"
1453 !passive_maintainance_time) ^
1454 (Printf.sprintf " successful unification/matching time: %.9f\n"
1455 !Indexing.match_unif_time_ok) ^
1456 (Printf.sprintf " failed unification/matching time: %.9f\n"
1457 !Indexing.match_unif_time_no) ^
1458 (Printf.sprintf " indexing retrieval time: %.9f\n"
1459 !Indexing.indexing_retrieval_time) ^
1460 (Printf.sprintf " demodulate_term.build_newtarget_time: %.9f\n"
1461 !Indexing.build_newtarget_time) ^
1462 (Printf.sprintf "derived %d clauses, kept %d clauses.\n"
1463 !derived_clauses !kept_clauses))
1467 print_endline ("EXCEPTION: " ^ (Printexc.to_string exc));
1473 let default_depth = !maxdepth
1474 and default_width = !maxwidth;;
1478 symbols_counter := 0;
1479 weight_age_counter := !weight_age_ratio;
1480 processed_clauses := 0;
1483 maximal_retained_equality := None;
1485 forward_simpl_time := 0.;
1486 forward_simpl_new_time := 0.;
1487 backward_simpl_time := 0.;
1488 passive_maintainance_time := 0.;
1489 derived_clauses := 0;
1494 let eq_of_goal = function
1495 | Cic.Appl [Cic.MutInd(uri,0,_);_;_;_] when LibraryObjects.is_eq_URI uri ->
1497 | _ -> raise (ProofEngineTypes.Fail (lazy ("The goal is not an equality ")))
1500 let eq_and_ty_of_goal = function
1501 | Cic.Appl [Cic.MutInd(uri,0,_);t;_;_] when LibraryObjects.is_eq_URI uri ->
1503 | _ -> raise (ProofEngineTypes.Fail (lazy ("The goal is not an equality ")))
1508 dbd ?(full=false) ?(depth=default_depth) ?(width=default_width) status =
1509 let module C = Cic in
1511 Indexing.init_index ();
1514 (* CicUnification.unif_ty := false;*)
1515 let proof, goalno = status in
1516 let uri, metasenv, meta_proof, term_to_prove = proof in
1517 let _, context, type_of_goal = CicUtil.lookup_meta goalno metasenv in
1518 let eq_uri = eq_of_goal type_of_goal in
1519 let names = Utils.names_of_context context in
1520 let eq_indexes, equalities, maxm = Inference.find_equalities context proof in
1521 let ugraph = CicUniv.empty_ugraph in
1522 let env = (metasenv, context, ugraph) in
1523 let cleaned_goal = Utils.remove_local_context type_of_goal in
1524 let goal = [], List.filter (fun (i,_,_)->i<>goalno) metasenv, cleaned_goal in
1526 let t1 = Unix.gettimeofday () in
1527 let lib_eq_uris, library_equalities, maxm =
1528 Inference.find_library_equalities caso_strano dbd context (proof, goalno) (maxm+2)
1530 let library_equalities = List.map snd library_equalities in
1531 let t2 = Unix.gettimeofday () in
1534 simplify_equalities eq_uri env (equalities@library_equalities)
1538 (Printf.sprintf "Time to retrieve equalities: %.9f\n" (t2 -. t1)));
1539 let t1 = Unix.gettimeofday () in
1542 let thms = Inference.find_library_theorems dbd env (proof, goalno) lib_eq_uris in
1543 let context_hyp = Inference.find_context_hypotheses env eq_indexes in
1544 context_hyp @ thms, []
1546 let refl_equal = LibraryObjects.eq_refl_URI ~eq:eq_uri in
1547 let t = CicUtil.term_of_uri refl_equal in
1548 let ty, _ = CicTypeChecker.type_of_aux' [] [] t CicUniv.empty_ugraph in
1551 let t2 = Unix.gettimeofday () in
1556 "Theorems:\n-------------------------------------\n%s\n"
1561 "Term: %s, type: %s"
1562 (CicPp.ppterm t) (CicPp.ppterm ty))
1566 (Printf.sprintf "Time to retrieve theorems: %.9f\n" (t2 -. t1)));
1568 let active = make_active () in
1569 let passive = make_passive equalities in
1570 let start = Unix.gettimeofday () in
1573 let goals = make_goals goal in
1574 given_clause_fullred dbd env goals theorems passive active
1576 let goals = make_goal_set goal in
1577 let max_iterations = 10000 in
1578 let max_time = Unix.gettimeofday () +. 300. (* minutes *) in
1580 eq_uri env goals theorems passive active max_iterations max_time
1582 let finish = Unix.gettimeofday () in
1583 (res, finish -. start)
1586 | ParamodulationFailure s ->
1587 raise (ProofEngineTypes.Fail (lazy ("NO proof found: " ^ s)))
1588 | ParamodulationSuccess
1589 (goalproof,newproof,subsumption_id,subsumption_subst, proof_menv) ->
1590 prerr_endline "OK, found a proof!";
1592 (Equality.pp_proof names goalproof newproof subsumption_subst
1593 subsumption_id type_of_goal);
1594 prerr_endline "ENDOFPROOFS";
1595 (* generation of the CIC proof *)
1597 List.filter (fun i -> i <> goalno)
1598 (ProofEngineHelpers.compare_metasenvs
1599 ~newmetasenv:metasenv ~oldmetasenv:proof_menv)
1601 let goal_proof, side_effects_t =
1602 let initial = Equality.add_subst subsumption_subst newproof in
1603 Equality.build_goal_proof
1604 eq_uri goalproof initial type_of_goal side_effects
1606 prerr_endline ("PROOF: " ^ CicPp.pp goal_proof names);
1607 let goal_proof = Subst.apply_subst subsumption_subst goal_proof in
1608 let metas_still_open_in_proof = Utils.metas_of_term goal_proof in
1609 (*prerr_endline (CicPp.pp goal_proof names);*)
1611 let goal_proof = (* Subst.apply_subst subsumption_subst *) goal_proof in
1612 let side_effects_t =
1613 List.map (Subst.apply_subst subsumption_subst) side_effects_t
1615 (* replacing fake mets with real ones *)
1616 prerr_endline "replacing metas...";
1617 let irl=CicMkImplicit.identity_relocation_list_for_metavariable context in
1618 let goal_proof_menv, what, with_what,free_meta =
1620 (fun (acc1,acc2,acc3,uniq) (i,_,ty) ->
1623 acc1, (Cic.Meta(i,[]))::acc2, m::acc3, uniq
1625 [i,context,ty], (Cic.Meta(i,[]))::acc2,
1626 (Cic.Meta(i,irl)) ::acc3,Some (Cic.Meta(i,irl)))
1629 (fun (i,_,_) -> List.mem i metas_still_open_in_proof)
1633 (* we need this fake equality since the metas of the hypothesis may be
1634 * with a real local context *)
1635 ProofEngineReduction.replace_lifting
1636 ~equality:(fun x y ->
1637 match x,y with Cic.Meta(i,_),Cic.Meta(j,_) -> i=j | _-> false)
1638 ~what ~with_what ~where
1640 let goal_proof = replace goal_proof in
1641 (* ok per le meta libere... ma per quelle che c'erano e sono rimaste?
1642 * what mi pare buono, sostituisce solo le meta farlocche *)
1643 let side_effects_t = List.map replace side_effects_t in
1645 List.filter (fun i -> i <> goalno)
1646 (ProofEngineHelpers.compare_metasenvs
1647 ~oldmetasenv:metasenv ~newmetasenv:goal_proof_menv)
1649 prerr_endline ("freemetas: " ^ String.concat "," (List.map string_of_int free_metas) );
1650 (* check/refine/... build the new proof *)
1652 ProofEngineReduction.replace
1653 ~what:side_effects ~with_what:side_effects_t
1654 ~equality:(fun i t -> match t with Cic.Meta(j,_)->j=i|_->false)
1657 let subst_side_effects,real_menv,_ =
1658 let fail t s = raise (ProofEngineTypes.Fail (lazy (t^Lazy.force s))) in
1659 let free_metas_menv =
1660 List.map (fun i -> CicUtil.lookup_meta i goal_proof_menv) free_metas
1663 CicUnification.fo_unif_subst [] context (metasenv @ free_metas_menv)
1664 replaced_goal type_of_goal CicUniv.empty_ugraph
1666 | CicUnification.UnificationFailure s
1667 | CicUnification.Uncertain s
1668 | CicUnification.AssertFailure s ->
1669 fail "Maybe the local context of metas in the goal was not an IRL" s
1672 (goalno,(context,goal_proof,type_of_goal))::subst_side_effects
1674 prerr_endline ("MENVreal_menv: " ^ CicMetaSubst.ppmetasenv [] real_menv);
1677 CicTypeChecker.type_of_aux' real_menv context goal_proof
1678 CicUniv.empty_ugraph
1680 | CicUtil.Meta_not_found _
1681 | CicTypeChecker.TypeCheckerFailure _
1682 | CicTypeChecker.AssertFailure _
1683 | Invalid_argument "list_fold_left2" as exn ->
1684 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1685 prerr_endline (CicPp.pp goal_proof names);
1686 prerr_endline "THE PROOF DOES NOT TYPECHECK!";
1689 let proof, real_metasenv =
1690 ProofEngineHelpers.subst_meta_and_metasenv_in_proof
1691 proof goalno (CicMetaSubst.apply_subst final_subst) real_menv
1694 match free_meta with Some(Cic.Meta(m,_)) when m<>goalno ->[m] | _ ->[]
1697 "GOALS APERTI: %s\nMETASENV PRIMA:\n%s\nMETASENV DOPO:\n%s\n"
1698 (String.concat ", " (List.map string_of_int open_goals))
1699 (CicMetaSubst.ppmetasenv [] metasenv)
1700 (CicMetaSubst.ppmetasenv [] real_metasenv);
1701 prerr_endline (Printf.sprintf "\nTIME NEEDED: %8.2f" time);
1705 let retrieve_and_print dbd term metasenv ugraph =
1706 let module C = Cic in
1707 let module T = CicTypeChecker in
1708 let module PET = ProofEngineTypes in
1709 let module PP = CicPp in
1710 let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
1711 let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
1712 let proof, goals = status in
1713 let goal' = List.nth goals 0 in
1714 let uri, metasenv, meta_proof, term_to_prove = proof in
1715 let _, context, type_of_goal = CicUtil.lookup_meta goal' metasenv in
1716 let eq_uri = eq_of_goal type_of_goal in
1717 let eq_indexes, equalities, maxm = Inference.find_equalities context proof in
1718 let ugraph = CicUniv.empty_ugraph in
1719 let env = (metasenv, context, ugraph) in
1720 let t1 = Unix.gettimeofday () in
1721 let lib_eq_uris, library_equalities, maxm =
1722 Inference.find_library_equalities false dbd context (proof, goal') (maxm+2) in
1723 let t2 = Unix.gettimeofday () in
1725 let equalities = (* equalities @ *) library_equalities in
1728 (Printf.sprintf "\n\nequalities:\n%s\n"
1732 (* Printf.sprintf "%s: %s" *)
1733 (UriManager.string_of_uri u)
1734 (* (string_of_equality e) *)
1737 Utils.debug_print (lazy "RETR: SIMPLYFYING EQUALITIES...");
1738 let rec simpl e others others_simpl =
1740 let active = List.map (fun (u, e) -> (Utils.Positive, e))
1741 (others @ others_simpl) in
1744 (fun t (_, e) -> Indexing.index t e)
1745 Indexing.empty active
1747 let res = forward_simplify eq_uri env (Utils.Positive, e) (active, tbl) in
1751 | None -> simpl hd tl others_simpl
1752 | Some e -> simpl hd tl ((u, e)::others_simpl)
1756 | None -> others_simpl
1757 | Some e -> (u, e)::others_simpl
1761 match equalities with
1764 let others = tl in (* List.map (fun e -> (Utils.Positive, e)) tl in *)
1766 List.rev (simpl (*(Positive,*) hd others [])
1770 (Printf.sprintf "\nequalities AFTER:\n%s\n"
1774 Printf.sprintf "%s: %s"
1775 (UriManager.string_of_uri u)
1776 (Equality.string_of_equality e)
1782 (Printf.sprintf "Time to retrieve equalities: %.9f\n" (t2 -. t1)))
1786 let main_demod_equalities dbd term metasenv ugraph =
1787 let module C = Cic in
1788 let module T = CicTypeChecker in
1789 let module PET = ProofEngineTypes in
1790 let module PP = CicPp in
1791 let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
1792 let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
1793 let proof, goals = status in
1794 let goal' = List.nth goals 0 in
1795 let _, metasenv, meta_proof, _ = proof in
1796 let _, context, goal = CicUtil.lookup_meta goal' metasenv in
1797 let eq_uri = eq_of_goal goal in
1798 let eq_indexes, equalities, maxm = Inference.find_equalities context proof in
1799 let lib_eq_uris, library_equalities, maxm =
1800 Inference.find_library_equalities false dbd context (proof, goal') (maxm+2)
1802 let library_equalities = List.map snd library_equalities in
1803 maxmeta := maxm+2; (* TODO ugly!! *)
1804 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
1805 let new_meta_goal, metasenv, type_of_goal =
1806 let _, context, ty = CicUtil.lookup_meta goal' metasenv in
1809 (Printf.sprintf "\n\nTRYING TO INFER EQUALITIES MATCHING: %s\n\n"
1810 (CicPp.ppterm ty)));
1811 Cic.Meta (maxm+1, irl),
1812 (maxm+1, context, ty)::metasenv,
1815 let env = (metasenv, context, ugraph) in
1817 let goal = [], [], goal
1820 simplify_equalities eq_uri env (equalities@library_equalities)
1822 let active = make_active () in
1823 let passive = make_passive equalities in
1824 Printf.printf "\ncontext:\n%s\n" (PP.ppcontext context);
1825 Printf.printf "\nmetasenv:\n%s\n" (Utils.print_metasenv metasenv);
1826 Printf.printf "\nequalities:\n%s\n"
1829 (Equality.string_of_equality ~env) equalities));
1830 print_endline "--------------------------------------------------";
1831 print_endline "GO!";
1832 start_time := Unix.gettimeofday ();
1833 if !time_limit < 1. then time_limit := 60.;
1835 saturate_equations eq_uri env goal (fun e -> true) passive active
1839 List.fold_left (fun s e -> EqualitySet.add e s)
1840 EqualitySet.empty equalities
1843 if not (EqualitySet.mem e initial) then EqualitySet.add e s else s
1849 EqualitySet.elements (List.fold_left addfun EqualitySet.empty p)
1853 EqualitySet.elements (List.fold_left addfun EqualitySet.empty l)
1855 Printf.printf "\n\nRESULTS:\nActive:\n%s\n\nPassive:\n%s\n"
1856 (String.concat "\n" (List.map (Equality.string_of_equality ~env) active))
1857 (* (String.concat "\n"
1858 (List.map (fun e -> CicPp.ppterm (term_of_equality e)) active)) *)
1859 (* (String.concat "\n" (List.map (string_of_equality ~env) passive)); *)
1862 (fun e -> CicPp.ppterm (Equality.term_of_equality eq_uri e))
1867 Utils.debug_print (lazy ("EXCEPTION: " ^ (Printexc.to_string e)))
1871 let demodulate_tac ~dbd ((proof,goal)(*s initialstatus*)) =
1872 let curi,metasenv,pbo,pty = proof in
1873 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
1874 let eq_uri = eq_of_goal ty in
1875 let eq_indexes, equalities, maxm =
1876 Inference.find_equalities context proof
1878 let lib_eq_uris, library_equalities, maxm =
1879 Inference.find_library_equalities false dbd context (proof, goal) (maxm+2) in
1880 if library_equalities = [] then prerr_endline "VUOTA!!!";
1881 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
1882 let library_equalities = List.map snd library_equalities in
1883 let initgoal = [], [], ty in
1884 let env = (metasenv, context, CicUniv.empty_ugraph) in
1886 simplify_equalities eq_uri env (equalities@library_equalities)
1890 (fun tbl eq -> Indexing.index tbl eq)
1891 Indexing.empty equalities
1893 let changed,(newproof,newmetasenv, newty) =
1894 Indexing.demodulation_goal
1895 (metasenv,context,CicUniv.empty_ugraph) table initgoal
1899 let opengoal = Equality.Exact (Cic.Meta(maxm,irl)) in
1901 Equality.build_goal_proof eq_uri newproof opengoal ty []
1903 let extended_metasenv = (maxm,context,newty)::metasenv in
1904 let extended_status =
1905 (curi,extended_metasenv,pbo,pty),goal in
1906 let (status,newgoals) =
1907 ProofEngineTypes.apply_tactic
1908 (PrimitiveTactics.apply_tac ~term:proofterm)
1910 (status,maxm::newgoals)
1912 else (* if newty = ty then *)
1913 raise (ProofEngineTypes.Fail (lazy "no progress"))
1914 (*else ProofEngineTypes.apply_tactic
1915 (ReductionTactics.simpl_tac
1916 ~pattern:(ProofEngineTypes.conclusion_pattern None)) initialstatus*)
1919 let demodulate_tac ~dbd = ProofEngineTypes.mk_tactic (demodulate_tac ~dbd);;
1921 let rec find_in_ctx i name = function
1922 | [] -> raise (ProofEngineTypes.Fail (lazy ("Hypothesis not found: " ^ name)))
1923 | Some (Cic.Name name', _)::tl when name = name' -> i
1924 | _::tl -> find_in_ctx (i+1) name tl
1927 let rec position_of i x = function
1928 | [] -> assert false
1929 | j::tl when j <> x -> position_of (i+1) x tl
1934 * auto superposition target = NAME
1935 * [table = NAME_LIST] [demod_table = NAME_LIST] [subterms_only]
1937 * - if table is omitted no superposition will be performed
1938 * - if demod_table is omitted no demodulation will be prformed
1939 * - subterms_only is passed to Indexing.superposition_right
1941 * lists are coded using _ (example: H_H1_H2)
1944 let superposition_tac ~target ~table ~subterms_only ~demod_table status =
1946 Indexing.init_index ();
1947 let proof,goalno = status in
1948 let curi,metasenv,pbo,pty = proof in
1949 let metano,context,ty = CicUtil.lookup_meta goalno metasenv in
1950 let eq_uri,tty = eq_and_ty_of_goal ty in
1951 let env = (metasenv, context, CicUniv.empty_ugraph) in
1952 let names = Utils.names_of_context context in
1953 let eq_index, equalities, maxm = Inference.find_equalities context proof in
1955 let what = find_in_ctx 1 target context in
1956 List.nth equalities (position_of 0 what eq_index)
1961 let others = Str.split (Str.regexp "_") table in
1962 List.map (fun other -> find_in_ctx 1 other context) others
1965 (fun other -> List.nth equalities (position_of 0 other eq_index))
1970 let index = List.fold_left Indexing.index Indexing.empty eq_other in
1972 if table = "" then maxm,[eq_what] else
1973 Indexing.superposition_right
1974 ~subterms_only eq_uri maxm env index eq_what
1976 prerr_endline ("Superposition right:");
1977 prerr_endline ("\n eq: " ^ Equality.string_of_equality eq_what ~env);
1978 prerr_endline ("\n table: ");
1979 List.iter (fun e -> prerr_endline (" " ^ Equality.string_of_equality e ~env)) eq_other;
1980 prerr_endline ("\n result: ");
1981 List.iter (fun e -> prerr_endline (Equality.string_of_equality e ~env)) eql;
1982 prerr_endline ("\n result (cut&paste): ");
1985 let t = Equality.term_of_equality eq_uri e in
1986 prerr_endline (CicPp.pp t names))
1988 prerr_endline ("\n result proofs: ");
1990 prerr_endline (let _,p,_,_,_ = Equality.open_equality e in
1991 let s = match p with Equality.Exact _ -> Subst.empty_subst | Equality.Step (s,_) -> s in
1992 Subst.ppsubst s ^ "\n" ^
1993 CicPp.pp (Equality.build_proof_term eq_uri [] 0 p) names)) eql;
1994 if demod_table <> "" then
1997 let demod = Str.split (Str.regexp "_") demod_table in
1998 List.map (fun other -> find_in_ctx 1 other context) demod
2002 (fun demod -> List.nth equalities (position_of 0 demod eq_index))
2005 let table = List.fold_left Indexing.index Indexing.empty eq_demod in
2008 (fun (maxm,acc) e ->
2010 Indexing.demodulation_equality
2011 eq_uri maxm env table Utils.Positive e
2016 let eql = List.rev eql in
2017 prerr_endline ("\n result [demod]: ");
2019 (fun e -> prerr_endline (Equality.string_of_equality e ~env)) eql;
2020 prerr_endline ("\n result [demod] (cut&paste): ");
2023 let t = Equality.term_of_equality eq_uri e in
2024 prerr_endline (CicPp.pp t names))
2031 <:show<Saturation.>> ^ Indexing.get_stats () ^ Inference.get_stats () ^
2032 Equality.get_stats ()