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/.
34 let check_equation env equation msg =
35 let w, proof, (eq_ty, left, right, order), metas = equation in
36 let metasenv, context, ugraph = env in
37 let metasenv' = metasenv @ metas in
39 CicTypeChecker.type_of_aux' metasenv' context left ugraph;
40 CicTypeChecker.type_of_aux' metasenv' context right ugraph;
43 CicUtil.Meta_not_found _ as exn ->
46 prerr_endline (CicPp.ppterm left);
47 prerr_endline (CicPp.ppterm right);
52 (* set to false to disable paramodulation inside auto_tac *)
53 let connect_to_auto = true;;
56 (* profiling statistics... *)
57 let infer_time = ref 0.;;
58 let forward_simpl_time = ref 0.;;
59 let forward_simpl_new_time = ref 0.;;
60 let backward_simpl_time = ref 0.;;
61 let passive_maintainance_time = ref 0.;;
63 (* limited-resource-strategy related globals *)
64 let processed_clauses = ref 0;; (* number of equalities selected so far... *)
65 let time_limit = ref 0.;; (* in seconds, settable by the user... *)
66 let start_time = ref 0.;; (* time at which the execution started *)
67 let elapsed_time = ref 0.;;
68 (* let maximal_weight = ref None;; *)
69 let maximal_retained_equality = ref None;;
71 (* equality-selection related globals *)
72 let use_fullred = ref true;;
73 let weight_age_ratio = ref 4 (* 5 *);; (* settable by the user *)
74 let weight_age_counter = ref !weight_age_ratio ;;
75 let symbols_ratio = ref 0 (* 3 *);;
76 let symbols_counter = ref 0;;
78 (* non-recursive Knuth-Bendix term ordering by default *)
79 (* Utils.compare_terms := Utils.rpo;; *)
80 (* Utils.compare_terms := Utils.nonrec_kbo;; *)
81 (* Utils.compare_terms := Utils.ao;; *)
84 let derived_clauses = ref 0;;
85 let kept_clauses = ref 0;;
87 (* index of the greatest Cic.Meta created - TODO: find a better way! *)
90 (* varbiables controlling the search-space *)
91 let maxdepth = ref 3;;
92 let maxwidth = ref 3;;
96 | ParamodulationFailure
97 | ParamodulationSuccess of Inference.proof option * environment
100 type goal = proof * Cic.metasenv * Cic.term;;
102 type theorem = Cic.term * Cic.term * Cic.metasenv;;
104 let symbols_of_equality (_, _, (_, left, right, _), _) =
105 let m1 = symbols_of_term left in
110 let c = TermMap.find k res in
111 TermMap.add k (c+v) res
114 (symbols_of_term right) m1
120 module OrderedEquality = struct
121 type t = Inference.equality
123 let compare eq1 eq2 =
124 match meta_convertibility_eq eq1 eq2 with
127 let w1, _, (ty, left, right, _), m1 = eq1
128 and w2, _, (ty', left', right', _), m2 = eq2 in
129 match Pervasives.compare w1 w2 with
131 let res = (List.length m1) - (List.length m2) in
132 if res <> 0 then res else Pervasives.compare eq1 eq2
137 module OrderedEquality = struct
138 type t = Inference.equality
141 let w, _, (ty, left, right, o), _ = eq in
148 | Incomparable -> None
150 let compare eq1 eq2 =
151 let w1, _, (ty, left, right, o1), m1 = eq1
152 and w2, _, (ty', left', right', o2), m2 = eq2 in
153 match Pervasives.compare w1 w2 with
155 (match minor eq1, minor eq2 with
156 | Some t1, Some t2 ->
157 fst (Utils.weight_of_term t1) - fst (Utils.weight_of_term t2)
161 (List.length m2) - (List.length m1) )
164 let compare eq1 eq2 =
165 match compare eq1 eq2 with
166 0 -> Pervasives.compare eq1 eq2
171 module EqualitySet = Set.Make(OrderedEquality);;
173 exception Empty_list;;
175 let passive_is_empty = function
176 | ([], _), ([], _), _ -> true
181 let size_of_passive ((_, ns), (_, ps), _) =
182 (EqualitySet.cardinal ns) + (EqualitySet.cardinal ps)
186 let size_of_active (active_list, _) =
187 List.length active_list
190 let age_factor = 0.01;;
192 let min_elt weight l =
195 [] -> raise Empty_list
197 let wa = float_of_int (weight a) in
200 (fun (current,w) arg ->
202 let w1 = weight arg in
203 let wa = (float_of_int w1) +. !x *. age_factor in
204 if wa < w then (arg,wa) else (current,w))
209 let compare eq1 eq2 =
210 let w1, _, (ty, left, right, _), m1, _ = eq1 in
211 let w2, _, (ty', left', right', _), m2, _ = eq2 in
212 match Pervasives.compare w1 w2 with
213 | 0 -> (List.length m1) - (List.length m2)
219 selects one equality from passive. The selection strategy is a combination
220 of weight, age and goal-similarity
222 let rec select env goals passive (active, _) =
223 processed_clauses := !processed_clauses + 1;
225 match (List.rev goals) with (_, goal::_)::_ -> goal | _ -> assert false
227 let (neg_list, neg_set), (pos_list, pos_set), passive_table = passive in
229 List.filter (fun e -> e <> eq) l
231 if !weight_age_ratio > 0 then
232 weight_age_counter := !weight_age_counter - 1;
233 match !weight_age_counter with
235 weight_age_counter := !weight_age_ratio;
236 match neg_list, pos_list with
238 (* Negatives aren't indexed, no need to remove them... *)
240 ((tl, EqualitySet.remove hd neg_set), (pos, pos_set), passive_table)
241 | [], (hd:EqualitySet.elt)::tl ->
244 Indexing.remove_index passive_table hd
246 (([], neg_set), (tl, EqualitySet.remove hd pos_set), passive_table)
247 | _, _ -> assert false
249 | _ when (!symbols_counter > 0) && (EqualitySet.is_empty neg_set) ->
250 (symbols_counter := !symbols_counter - 1;
251 let cardinality map =
252 TermMap.fold (fun k v res -> res + v) map 0
255 let _, _, term = goal in
258 let card = cardinality symbols in
259 let foldfun k v (r1, r2) =
260 if TermMap.mem k symbols then
261 let c = TermMap.find k symbols in
262 let c1 = abs (c - v) in
268 let f equality (i, e) =
270 TermMap.fold foldfun (symbols_of_equality equality) (0, 0)
272 let c = others + (abs (common - card)) in
273 if c < i then (c, equality)
276 let e1 = EqualitySet.min_elt pos_set in
279 TermMap.fold foldfun (symbols_of_equality e1) (0, 0)
281 (others + (abs (common - card))), e1
283 let _, current = EqualitySet.fold f pos_set initial in
285 Indexing.remove_index passive_table current
289 (remove current pos_list, EqualitySet.remove current pos_set),
293 symbols_counter := !symbols_ratio;
294 let set_selection set = EqualitySet.min_elt set in
295 (* let set_selection l = min_elt (fun (w,_,_,_) -> w) l in *)
296 if EqualitySet.is_empty neg_set then
297 let current = set_selection pos_set in
300 (remove current pos_list, EqualitySet.remove current pos_set),
301 Indexing.remove_index passive_table current
303 (Positive, current), passive
305 let current = set_selection neg_set in
307 (remove current neg_list, EqualitySet.remove current neg_set),
311 (Negative, current), passive
315 (* initializes the passive set of equalities *)
316 let make_passive neg pos =
317 let set_of equalities =
318 List.fold_left (fun s e -> EqualitySet.add e s) EqualitySet.empty equalities
321 List.fold_left (fun tbl e -> Indexing.index tbl e) Indexing.empty pos
334 (* adds to passive a list of equalities: new_neg is a list of negative
335 equalities, new_pos a list of positive equalities *)
336 let add_to_passive passive (new_neg, new_pos) =
337 let (neg_list, neg_set), (pos_list, pos_set), table = passive in
338 let ok set equality = not (EqualitySet.mem equality set) in
339 let neg = List.filter (ok neg_set) new_neg
340 and pos = List.filter (ok pos_set) new_pos in
342 List.fold_left (fun tbl e -> Indexing.index tbl e) table pos
344 let add set equalities =
345 List.fold_left (fun s e -> EqualitySet.add e s) set equalities
347 (neg @ neg_list, add neg_set neg),
348 (pos_list @ pos, add pos_set pos),
353 (* removes from passive equalities that are estimated impossible to activate
354 within the current time limit *)
355 let prune_passive howmany (active, _) passive =
356 let (nl, ns), (pl, ps), tbl = passive in
357 let howmany = float_of_int howmany
358 and ratio = float_of_int !weight_age_ratio in
361 int_of_float (if t -. v < 0.5 then t else v)
363 let in_weight = round (howmany *. ratio /. (ratio +. 1.))
364 and in_age = round (howmany /. (ratio +. 1.)) in
366 (lazy (Printf.sprintf "in_weight: %d, in_age: %d\n" in_weight in_age));
369 | (Negative, e)::_ ->
370 let symbols = symbols_of_equality e in
371 let card = TermMap.fold (fun k v res -> res + v) symbols 0 in
375 let counter = ref !symbols_ratio in
376 let rec pickw w ns ps =
378 if not (EqualitySet.is_empty ns) then
379 let e = EqualitySet.min_elt ns in
380 let ns', ps = pickw (w-1) (EqualitySet.remove e ns) ps in
381 EqualitySet.add e ns', ps
382 else if !counter > 0 then
384 counter := !counter - 1;
385 if !counter = 0 then counter := !symbols_ratio
389 let e = EqualitySet.min_elt ps in
390 let ns, ps' = pickw (w-1) ns (EqualitySet.remove e ps) in
391 ns, EqualitySet.add e ps'
393 let foldfun k v (r1, r2) =
394 if TermMap.mem k symbols then
395 let c = TermMap.find k symbols in
396 let c1 = abs (c - v) in
402 let f equality (i, e) =
404 TermMap.fold foldfun (symbols_of_equality equality) (0, 0)
406 let c = others + (abs (common - card)) in
407 if c < i then (c, equality)
410 let e1 = EqualitySet.min_elt ps in
413 TermMap.fold foldfun (symbols_of_equality e1) (0, 0)
415 (others + (abs (common - card))), e1
417 let _, e = EqualitySet.fold f ps initial in
418 let ns, ps' = pickw (w-1) ns (EqualitySet.remove e ps) in
419 ns, EqualitySet.add e ps'
421 let e = EqualitySet.min_elt ps in
422 let ns, ps' = pickw (w-1) ns (EqualitySet.remove e ps) in
423 ns, EqualitySet.add e ps'
425 EqualitySet.empty, EqualitySet.empty
427 let ns, ps = pickw in_weight ns ps in
428 let rec picka w s l =
432 | hd::tl when not (EqualitySet.mem hd s) ->
433 let w, s, l = picka (w-1) s tl in
434 w, EqualitySet.add hd s, hd::l
436 let w, s, l = picka w s tl in
441 let in_age, ns, nl = picka in_age ns nl in
442 let _, ps, pl = picka in_age ps pl in
443 if not (EqualitySet.is_empty ps) then
444 maximal_retained_equality := Some (EqualitySet.max_elt ps);
447 (fun e tbl -> Indexing.index tbl e) ps Indexing.empty
449 (nl, ns), (pl, ps), tbl
453 (** inference of new equalities between current and some in active *)
454 let infer env sign current (active_list, active_table) =
456 if Utils.debug_metas then
457 (ignore(Indexing.check_target c current "infer1");
458 ignore(List.map (function (_,current) -> Indexing.check_target c current "infer2") active_list));
459 let new_neg, new_pos =
463 Indexing.superposition_left !maxmeta env active_table current in
464 if Utils.debug_metas then
467 Indexing.check_target c current "sup-1") res);
472 Indexing.superposition_right !maxmeta env active_table current in
473 if Utils.debug_metas then
476 Indexing.check_target c current "sup0") res);
478 let rec infer_positive table = function
480 | (Negative, equality)::tl ->
482 Indexing.superposition_left !maxmeta env table equality in
484 if Utils.debug_metas then
487 Indexing.check_target c current "supl") res);
488 let neg, pos = infer_positive table tl in
490 | (Positive, equality)::tl ->
492 Indexing.superposition_right !maxmeta env table equality in
494 if Utils.debug_metas then
498 Indexing.check_target c current "sup2") res);
499 let neg, pos = infer_positive table tl in
502 let maxm, copy_of_current = Inference.fix_metas !maxmeta current in
504 let curr_table = Indexing.index Indexing.empty current in
506 infer_positive curr_table ((sign,copy_of_current)::active_list)
508 if Utils.debug_metas then
511 Indexing.check_target c current "sup3") pos);
514 derived_clauses := !derived_clauses + (List.length new_neg) +
515 (List.length new_pos);
516 match !maximal_retained_equality with
518 if Utils.debug_metas then
521 Indexing.check_target c current "sup4") new_pos);
524 Indexing.check_target c current "sup5") new_neg));
527 ignore(assert false);
528 (* if we have a maximal_retained_equality, we can discard all equalities
529 "greater" than it, as they will never be reached... An equality is
530 greater than maximal_retained_equality if it is bigger
531 wrt. OrderedEquality.compare and it is less similar than
532 maximal_retained_equality to the current goal *)
534 match active_list with
535 | (Negative, e)::_ ->
536 let symbols = symbols_of_equality e in
537 let card = TermMap.fold (fun k v res -> res + v) symbols 0 in
544 List.filter (fun e -> OrderedEquality.compare e eq <= 0) new_pos
547 if OrderedEquality.compare e eq <= 0 then
550 let foldfun k v (r1, r2) =
551 if TermMap.mem k symbols then
552 let c = TermMap.find k symbols in
553 let c1 = abs (c - v) in
561 TermMap.fold foldfun (symbols_of_equality eq) (0, 0) in
562 others + (abs (common - card))
565 TermMap.fold foldfun (symbols_of_equality e) (0, 0) in
566 let c = others + (abs (common - card)) in
567 if c < initial then true else false
569 List.filter filterfun new_pos
575 let contains_empty env (negative, positive) =
576 let metasenv, context, ugraph = env in
580 (fun (w, proof, (ty, left, right, ordering), m) ->
581 fst (CicReduction.are_convertible context left right ugraph))
590 (** simplifies current using active and passive *)
591 let forward_simplify env (sign, current) ?passive (active_list, active_table) =
592 let _, context, _ = env in
593 let pl, passive_table =
596 | Some ((pn, _), (pp, _), pt) ->
597 let pn = List.map (fun e -> (Negative, e)) pn
598 and pp = List.map (fun e -> (Positive, e)) pp in
601 let all = if pl = [] then active_list else active_list @ pl in
603 let demodulate table current =
604 let newmeta, newcurrent =
605 Indexing.demodulation_equality !maxmeta env table sign current in
607 if is_identity env newcurrent then
608 if sign = Negative then Some (sign, newcurrent)
612 (* (Printf.sprintf "\ncurrent was: %s\nnewcurrent is: %s\n" *)
613 (* (string_of_equality current) *)
614 (* (string_of_equality newcurrent))); *)
617 (* (Printf.sprintf "active is: %s" *)
618 (* (String.concat "\n" *)
619 (* (List.map (fun (_, e) -> (string_of_equality e)) active_list)))); *)
623 Some (sign, newcurrent)
626 if Utils.debug_metas then
627 ignore (Indexing.check_target context current "demod0");
628 let res = demodulate active_table current in
629 if Utils.debug_metas then
630 ignore ((function None -> () | Some (_,x) ->
631 Indexing.check_target context x "demod1";()) res);
634 | Some (sign, newcurrent) ->
635 match passive_table with
637 | Some passive_table -> demodulate passive_table newcurrent
641 | Some (Negative, c) ->
644 (fun (s, eq) -> s = Negative && meta_convertibility_eq eq c)
647 if ok then res else None
648 | Some (Positive, c) ->
649 if Indexing.in_index active_table c then
652 match passive_table with
654 if fst (Indexing.subsumption env active_table c) then
658 | Some passive_table ->
659 if Indexing.in_index passive_table c then None
661 let r1, _ = Indexing.subsumption env active_table c in
663 let r2, _ = Indexing.subsumption env passive_table c in
664 if r2 then None else res
667 type fs_time_info_t = {
668 mutable build_all: float;
669 mutable demodulate: float;
670 mutable subsumption: float;
673 let fs_time_info = { build_all = 0.; demodulate = 0.; subsumption = 0. };;
676 (** simplifies new using active and passive *)
677 let forward_simplify_new env (new_neg, new_pos) ?passive active =
678 if Utils.debug_metas then
683 Indexing.check_target c current "forward new neg") new_neg);
685 (fun current -> Indexing.check_target c current "forward new pos")
688 let t1 = Unix.gettimeofday () in
690 let active_list, active_table = active in
691 let pl, passive_table =
694 | Some ((pn, _), (pp, _), pt) ->
695 let pn = List.map (fun e -> (Negative, e)) pn
696 and pp = List.map (fun e -> (Positive, e)) pp in
700 let t2 = Unix.gettimeofday () in
701 fs_time_info.build_all <- fs_time_info.build_all +. (t2 -. t1);
703 let demodulate sign table target =
704 let newmeta, newtarget =
705 Indexing.demodulation_equality !maxmeta env table sign target in
709 let t1 = Unix.gettimeofday () in
711 let new_neg, new_pos =
712 let new_neg = List.map (demodulate Negative active_table) new_neg
713 and new_pos = List.map (demodulate Positive active_table) new_pos in
716 match passive_table with
717 | None -> new_neg, new_pos
718 | Some passive_table ->
719 List.map (demodulate Negative passive_table) new_neg,
720 List.map (demodulate Positive passive_table) new_pos *)
723 let t2 = Unix.gettimeofday () in
724 fs_time_info.demodulate <- fs_time_info.demodulate +. (t2 -. t1);
729 if not (Inference.is_identity env e) then
730 if EqualitySet.mem e s then s
731 else EqualitySet.add e s
733 EqualitySet.empty new_pos
735 let new_pos = EqualitySet.elements new_pos_set in
738 match passive_table with
740 (fun e -> not (fst (Indexing.subsumption env active_table e)))
741 | Some passive_table ->
742 (fun e -> not ((fst (Indexing.subsumption env active_table e)) ||
743 (fst (Indexing.subsumption env passive_table e))))
745 (* let t1 = Unix.gettimeofday () in *)
746 (* let t2 = Unix.gettimeofday () in *)
747 (* fs_time_info.subsumption <- fs_time_info.subsumption +. (t2 -. t1); *)
749 match passive_table with
751 (fun e -> not (Indexing.in_index active_table e))
752 | Some passive_table ->
754 not ((Indexing.in_index active_table e) ||
755 (Indexing.in_index passive_table e)))
757 new_neg, List.filter subs (List.filter is_duplicate new_pos)
761 (** simplifies active usign new *)
762 let backward_simplify_active env new_pos new_table min_weight active =
763 let active_list, active_table = active in
764 let active_list, newa =
766 (fun (s, equality) (res, newn) ->
767 let ew, _, _, _ = equality in
768 if ew < min_weight then
769 (s, equality)::res, newn
771 match forward_simplify env (s, equality) (new_pos, new_table) with
781 List.exists (fun (s, e) -> meta_convertibility_eq eq1 e) where
785 (fun (s, eq) (res, tbl) ->
786 if List.mem (s, eq) res then
788 else if (is_identity env eq) || (find eq res) then (
792 (s, eq)::res, if s = Negative then tbl else Indexing.index tbl eq)
793 active_list ([], Indexing.empty),
795 (fun (s, eq) (n, p) ->
796 if (s <> Negative) && (is_identity env eq) then (
799 if s = Negative then eq::n, p
804 | [], [] -> active, None
805 | _ -> active, Some newa
809 (** simplifies passive using new *)
810 let backward_simplify_passive env new_pos new_table min_weight passive =
811 let (nl, ns), (pl, ps), passive_table = passive in
812 let f sign equality (resl, ress, newn) =
813 let ew, _, _, _ = equality in
814 if ew < min_weight then
815 equality::resl, ress, newn
817 match forward_simplify env (sign, equality) (new_pos, new_table) with
818 | None -> resl, EqualitySet.remove equality ress, newn
821 equality::resl, ress, newn
823 let ress = EqualitySet.remove equality ress in
826 let nl, ns, newn = List.fold_right (f Negative) nl ([], ns, [])
827 and pl, ps, newp = List.fold_right (f Positive) pl ([], ps, []) in
830 (fun tbl e -> Indexing.index tbl e) Indexing.empty pl
832 match newn, newp with
833 | [], [] -> ((nl, ns), (pl, ps), passive_table), None
834 | _, _ -> ((nl, ns), (pl, ps), passive_table), Some (newn, newp)
838 let backward_simplify env new' ?passive active =
839 let new_pos, new_table, min_weight =
842 let ew, _, _, _ = e in
843 (Positive, e)::l, Indexing.index t e, min ew w)
844 ([], Indexing.empty, 1000000) (snd new')
847 backward_simplify_active env new_pos new_table min_weight active in
850 active, (make_passive [] []), newa, None
852 active, passive, newa, None
855 backward_simplify_passive env new_pos new_table min_weight passive in
856 active, passive, newa, newp *)
860 let close env new' given =
861 let new_pos, new_table, min_weight =
864 let ew, _, _, _ = e in
865 (Positive, e)::l, Indexing.index t e, min ew w)
866 ([], Indexing.empty, 1000000) (snd new')
870 let neg,pos = infer env s c (new_pos,new_table) in
875 let is_commutative_law eq =
876 let w, proof, (eq_ty, left, right, order), metas = snd eq in
877 match left,right with
878 Cic.Appl[f1;Cic.Meta _ as a1;Cic.Meta _ as b1],
879 Cic.Appl[f2;Cic.Meta _ as a2;Cic.Meta _ as b2] ->
880 f1 = f2 && a1 = b2 && a2 = b1
884 let prova env new' active =
885 let given = List.filter is_commutative_law (fst active) in
889 (Printf.sprintf "symmetric:\n%s\n"
892 (fun (s, e) -> (string_of_sign s) ^ " " ^
893 (string_of_equality ~env e))
898 (* returns an estimation of how many equalities in passive can be activated
899 within the current time limit *)
900 let get_selection_estimate () =
901 elapsed_time := (Unix.gettimeofday ()) -. !start_time;
902 (* !processed_clauses * (int_of_float (!time_limit /. !elapsed_time)) *)
904 ceil ((float_of_int !processed_clauses) *.
905 ((!time_limit (* *. 2. *)) /. !elapsed_time -. 1.)))
909 (** initializes the set of goals *)
910 let make_goals goal =
912 and passive = [0, [goal]] in
917 (** initializes the set of theorems *)
918 let make_theorems theorems =
923 let activate_goal (active, passive) =
925 | goal_conj::tl -> true, (goal_conj::active, tl)
926 | [] -> false, (active, passive)
930 let activate_theorem (active, passive) =
932 | theorem::tl -> true, (theorem::active, tl)
933 | [] -> false, (active, passive)
937 (** simplifies a goal with equalities in active and passive *)
938 let simplify_goal env goal ?passive (active_list, active_table) =
939 let pl, passive_table =
942 | Some ((pn, _), (pp, _), pt) ->
943 let pn = List.map (fun e -> (Negative, e)) pn
944 and pp = List.map (fun e -> (Positive, e)) pp in
948 let demodulate table goal =
949 let newmeta, newgoal =
950 Indexing.demodulation_goal !maxmeta env table goal in
952 goal != newgoal, newgoal
955 match passive_table with
956 | None -> demodulate active_table goal
957 | Some passive_table ->
958 let changed, goal = demodulate active_table goal in
959 let changed', goal = demodulate passive_table goal in
960 (changed || changed'), goal
966 let simplify_goals env goals ?passive active =
967 let a_goals, p_goals = goals in
972 List.map (fun g -> snd (simplify_goal env g ?passive active)) gl in
978 (fun (a, p) (d, gl) ->
979 let changed = ref false in
983 let c, g = simplify_goal env g ?passive active in
984 changed := !changed || c; g) gl in
985 if !changed then (a, (d, gl)::p) else ((d, gl)::a, p))
986 ([], p_goals) a_goals
992 let simplify_theorems env theorems ?passive (active_list, active_table) =
993 let pl, passive_table =
996 | Some ((pn, _), (pp, _), pt) ->
997 let pn = List.map (fun e -> (Negative, e)) pn
998 and pp = List.map (fun e -> (Positive, e)) pp in
1001 let a_theorems, p_theorems = theorems in
1002 let demodulate table theorem =
1003 let newmeta, newthm =
1004 Indexing.demodulation_theorem !maxmeta env table theorem in
1006 theorem != newthm, newthm
1008 let foldfun table (a, p) theorem =
1009 let changed, theorem = demodulate table theorem in
1010 if changed then (a, theorem::p) else (theorem::a, p)
1012 let mapfun table theorem = snd (demodulate table theorem) in
1013 match passive_table with
1015 let p_theorems = List.map (mapfun active_table) p_theorems in
1016 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems
1017 | Some passive_table ->
1018 let p_theorems = List.map (mapfun active_table) p_theorems in
1019 let p_theorems, a_theorems =
1020 List.fold_left (foldfun active_table) ([], p_theorems) a_theorems in
1021 let p_theorems = List.map (mapfun passive_table) p_theorems in
1022 List.fold_left (foldfun passive_table) ([], p_theorems) a_theorems
1026 let rec simpl env e others others_simpl =
1027 let active = others @ others_simpl in
1030 (fun t (_, e) -> Indexing.index t e)
1031 Indexing.empty active
1033 let res = forward_simplify env e (active, tbl) in
1037 | None -> simpl env hd tl others_simpl
1038 | Some e -> simpl env hd tl (e::others_simpl)
1042 | None -> others_simpl
1043 | Some e -> e::others_simpl
1047 let simplify_equalities env equalities =
1050 (Printf.sprintf "equalities:\n%s\n"
1052 (List.map string_of_equality equalities))));
1053 debug_print (lazy "SIMPLYFYING EQUALITIES...");
1054 match equalities with
1057 let others = List.map (fun e -> (Positive, e)) tl in
1059 List.rev (List.map snd (simpl env (Positive, hd) others []))
1063 (Printf.sprintf "equalities AFTER:\n%s\n"
1065 (List.map string_of_equality res))));
1069 (* applies equality to goal to see if the goal can be closed *)
1070 let apply_equality_to_goal env equality goal =
1071 let module C = Cic in
1072 let module HL = HelmLibraryObjects in
1073 let module I = Inference in
1074 let metasenv, context, ugraph = env in
1075 let _, proof, (ty, left, right, _), metas = equality in
1077 C.Appl [C.MutInd (LibraryObjects.eq_URI (), 0, []); ty; left; right] in
1078 let gproof, gmetas, gterm = goal in
1081 (* (Printf.sprintf "APPLY EQUALITY TO GOAL: %s, %s" *)
1082 (* (string_of_equality equality) (CicPp.ppterm gterm))); *)
1084 let subst, metasenv', _ =
1085 let menv = metasenv @ metas @ gmetas in
1086 Inference.unification metas gmetas context eqterm gterm ugraph
1090 | I.BasicProof t -> I.BasicProof (CicMetaSubst.apply_subst subst t)
1091 | I.ProofBlock (s, uri, nt, t, pe, p) ->
1092 I.ProofBlock (subst @ s, uri, nt, t, pe, p)
1096 let rec repl = function
1097 | I.ProofGoalBlock (_, gp) -> I.ProofGoalBlock (newproof, gp)
1098 | I.NoProof -> newproof
1099 | I.BasicProof p -> newproof
1100 | I.SubProof (t, i, p) -> I.SubProof (t, i, repl p)
1105 true, subst, newgproof
1106 with CicUnification.UnificationFailure _ ->
1107 false, [], I.NoProof
1112 let new_meta metasenv =
1113 let m = CicMkImplicit.new_meta metasenv [] in
1115 while !maxmeta <= m do incr maxmeta done;
1120 (* applies a theorem or an equality to goal, returning a list of subgoals or
1121 an indication of failure *)
1122 let apply_to_goal env theorems ?passive active goal =
1123 let metasenv, context, ugraph = env in
1124 let proof, metas, term = goal in
1127 (* (Printf.sprintf "apply_to_goal with goal: %s" *)
1128 (* (\* (string_of_proof proof) *\)(CicPp.ppterm term))); *)
1131 CicMkImplicit.identity_relocation_list_for_metavariable context in
1132 let proof', newmeta =
1133 let rec get_meta = function
1134 | SubProof (t, i, p) ->
1135 let t', i' = get_meta p in
1136 if i' = -1 then t, i else t', i'
1137 | ProofGoalBlock (_, p) -> get_meta p
1138 | _ -> Cic.Implicit None, -1
1140 let p, m = get_meta proof in
1142 let n = new_meta (metasenv @ metas) in
1143 Cic.Meta (n, irl), n
1147 let metasenv = (newmeta, context, term)::metasenv @ metas in
1148 let bit = new_meta metasenv, context, term in
1149 let metasenv' = bit::metasenv in
1150 ((None, metasenv', Cic.Meta (newmeta, irl), term), newmeta)
1152 let rec aux = function
1154 | (theorem, thmty, _)::tl ->
1156 let subst, (newproof, newgoals) =
1157 PrimitiveTactics.apply_tac_verbose_with_subst ~term:theorem status
1159 if newgoals = [] then
1160 let _, _, p, _ = newproof in
1162 let rec repl = function
1163 | Inference.ProofGoalBlock (_, gp) ->
1164 Inference.ProofGoalBlock (Inference.BasicProof p, gp)
1165 | Inference.NoProof -> Inference.BasicProof p
1166 | Inference.BasicProof _ -> Inference.BasicProof p
1167 | Inference.SubProof (t, i, p2) ->
1168 Inference.SubProof (t, i, repl p2)
1173 let _, m = status in
1174 let subst = List.filter (fun (i, _) -> i = m) subst in
1175 `Ok (subst, [newp, metas, term])
1177 let _, menv, p, _ = newproof in
1179 CicMkImplicit.identity_relocation_list_for_metavariable context
1184 let _, _, ty = CicUtil.lookup_meta i menv in
1186 let rec gp = function
1187 | SubProof (t, i, p) ->
1188 SubProof (t, i, gp p)
1189 | ProofGoalBlock (sp1, sp2) ->
1190 ProofGoalBlock (sp1, gp sp2)
1193 SubProof (p, i, BasicProof (Cic.Meta (i, irl)))
1194 | ProofSymBlock (s, sp) ->
1195 ProofSymBlock (s, gp sp)
1196 | ProofBlock (s, u, nt, t, pe, sp) ->
1197 ProofBlock (s, u, nt, t, pe, gp sp)
1205 let w, m = weight_of_term t in
1206 w + 2 * (List.length m)
1209 (fun (_, _, t1) (_, _, t2) ->
1210 Pervasives.compare (weight t1) (weight t2))
1213 let best = aux tl in
1215 | `Ok (_, _) -> best
1216 | `No -> `GoOn ([subst, goals])
1217 | `GoOn sl -> `GoOn ((subst, goals)::sl)
1218 with ProofEngineTypes.Fail msg ->
1222 if Inference.term_is_equality term then
1223 let rec appleq_a = function
1224 | [] -> false, [], []
1225 | (Positive, equality)::tl ->
1226 let ok, s, newproof = apply_equality_to_goal env equality goal in
1227 if ok then true, s, [newproof, metas, term] else appleq_a tl
1228 | _::tl -> appleq_a tl
1230 let rec appleq_p = function
1231 | [] -> false, [], []
1233 let ok, s, newproof = apply_equality_to_goal env equality goal in
1234 if ok then true, s, [newproof, metas, term] else appleq_p tl
1236 let al, _ = active in
1238 | None -> appleq_a al
1239 | Some (_, (pl, _), _) ->
1240 let r, s, l = appleq_a al in if r then r, s, l else appleq_p pl
1244 if r = true then `Ok (s, l) else aux theorems
1248 (* sorts a conjunction of goals in order to detect earlier if it is
1249 unsatisfiable. Non-predicate goals are placed at the end of the list *)
1250 let sort_goal_conj (metasenv, context, ugraph) (depth, gl) =
1253 (fun (_, e1, g1) (_, e2, g2) ->
1255 CicTypeChecker.type_of_aux' (e1 @ metasenv) context g1 ugraph
1257 CicTypeChecker.type_of_aux' (e2 @ metasenv) context g2 ugraph
1261 CicReduction.are_convertible context (Cic.Sort Cic.Prop) ty1 ugraph
1266 CicReduction.are_convertible context (Cic.Sort Cic.Prop) ty2 ugraph
1270 if prop1 = 0 && prop2 = 0 then
1271 let e1 = if Inference.term_is_equality g1 then 0 else 1
1272 and e2 = if Inference.term_is_equality g2 then 0 else 1 in
1282 let is_meta_closed goals =
1283 List.for_all (fun (_, _, g) -> CicUtil.is_meta_closed g) goals
1287 (* applies a series of theorems/equalities to a conjunction of goals *)
1288 let rec apply_to_goal_conj env theorems ?passive active (depth, goals) =
1289 let aux (goal, r) tl =
1290 let propagate_subst subst (proof, metas, term) =
1291 let rec repl = function
1292 | NoProof -> NoProof
1294 BasicProof (CicMetaSubst.apply_subst subst t)
1295 | ProofGoalBlock (p, pb) ->
1296 let pb' = repl pb in
1297 ProofGoalBlock (p, pb')
1298 | SubProof (t, i, p) ->
1299 let t' = CicMetaSubst.apply_subst subst t in
1302 | ProofSymBlock (ens, p) -> ProofSymBlock (ens, repl p)
1303 | ProofBlock (s, u, nty, t, pe, p) ->
1304 ProofBlock (subst @ s, u, nty, t, pe, p)
1305 in (repl proof, metas, term)
1307 (* let r = apply_to_goal env theorems ?passive active goal in *) (
1309 | `No -> `No (depth, goals)
1314 let tl = List.map (propagate_subst s) tl in
1315 sort_goal_conj env (depth+1, gl @ tl)) sl
1318 | `Ok (subst, gl) ->
1322 let p, _, _ = List.hd gl in
1324 let rec repl = function
1325 | SubProof (_, _, p) -> repl p
1326 | ProofGoalBlock (p1, p2) ->
1327 ProofGoalBlock (repl p1, repl p2)
1330 build_proof_term (repl p)
1333 let rec get_meta = function
1334 | SubProof (_, i, p) ->
1335 let i' = get_meta p in
1336 if i' = -1 then i else i'
1337 (* max i (get_meta p) *)
1338 | ProofGoalBlock (_, p) -> get_meta p
1344 let _, (context, _, _) = List.hd subst in
1345 [i, (context, subproof, Cic.Implicit None)]
1347 let tl = List.map (propagate_subst subst) tl in
1348 let conj = sort_goal_conj env (depth(* +1 *), tl) in
1352 if depth > !maxdepth || (List.length goals) > !maxwidth then
1355 let rec search_best res = function
1358 let r = apply_to_goal env theorems ?passive active goal in
1360 | `Ok _ -> (goal, r)
1361 | `No -> search_best res tl
1365 | _, `Ok _ -> assert false
1368 if (List.length l) < (List.length l2) then goal, r else res
1370 search_best newres tl
1372 let hd = List.hd goals in
1373 let res = hd, (apply_to_goal env theorems ?passive active hd) in
1377 | _, _ -> search_best res (List.tl goals)
1379 let res = aux best (List.filter (fun g -> g != (fst best)) goals) in
1381 | `GoOn ([conj]) when is_meta_closed (snd conj) &&
1382 (List.length (snd conj)) < (List.length goals)->
1383 apply_to_goal_conj env theorems ?passive active conj
1389 module OrderedGoals = struct
1390 type t = int * (Inference.proof * Cic.metasenv * Cic.term) list
1397 else let r = (List.length l1) - (List.length l2) in
1403 (fun (_, _, t1) (_, _, t2) ->
1404 let r = Pervasives.compare t1 t2 in
1413 module GoalsSet = Set.Make(OrderedGoals);;
1416 exception SearchSpaceOver;;
1421 let apply_to_goals env is_passive_empty theorems active goals =
1422 debug_print (lazy "\n\n\tapply_to_goals\n\n");
1423 let add_to set goals =
1424 List.fold_left (fun s g -> GoalsSet.add g s) set goals
1426 let rec aux set = function
1428 debug_print (lazy "HERE!!!");
1429 if is_passive_empty then raise SearchSpaceOver else false, set
1431 let res = apply_to_goal_conj env theorems active goals in
1437 | (d, (p, _, t)::_) -> d, p, t
1442 (Printf.sprintf "\nOK!!!!\ndepth: %d\nProof: %s\ngoal: %s\n"
1443 d (string_of_proof p) (CicPp.ppterm t)))
1445 true, GoalsSet.singleton newgoals
1447 let set' = add_to set (goals::tl) in
1448 let set' = add_to set' newgoals in
1453 let n = List.length goals in
1454 let res, goals = aux (add_to GoalsSet.empty goals) goals in
1455 let goals = GoalsSet.elements goals in
1456 debug_print (lazy "\n\tapply_to_goals end\n");
1457 let m = List.length goals in
1458 if m = n && is_passive_empty then
1459 raise SearchSpaceOver
1466 (* sorts the list of passive goals to minimize the search for a proof (doesn't
1467 work that well yet...) *)
1468 let sort_passive_goals goals =
1470 (fun (d1, l1) (d2, l2) ->
1472 and r2 = (List.length l1) - (List.length l2) in
1473 let foldfun ht (_, _, t) =
1474 let _ = List.map (fun i -> Hashtbl.replace ht i 1) (metas_of_term t)
1477 let m1 = Hashtbl.length (List.fold_left foldfun (Hashtbl.create 3) l1)
1478 and m2 = Hashtbl.length (List.fold_left foldfun (Hashtbl.create 3) l2)
1479 in let r3 = m1 - m2 in
1481 else if r2 <> 0 then r2
1483 (* let _, _, g1 = List.hd l1 *)
1484 (* and _, _, g2 = List.hd l2 in *)
1485 (* let e1 = if Inference.term_is_equality g1 then 0 else 1 *)
1486 (* and e2 = if Inference.term_is_equality g2 then 0 else 1 *)
1487 (* in let r4 = e1 - e2 in *)
1488 (* if r4 <> 0 then r3 else r1) *)
1493 let print_goals goals =
1500 (* (string_of_proof p) ^ ", " ^ *) (CicPp.ppterm t)) gl
1502 Printf.sprintf "%d: %s" d (String.concat "; " gl')) goals))
1506 (* tries to prove the first conjunction in goals with applications of
1507 theorems/equalities, returning new sub-goals or an indication of success *)
1508 let apply_goal_to_theorems dbd env theorems ?passive active goals =
1509 let theorems, _ = theorems in
1510 let a_goals, p_goals = goals in
1511 let goal = List.hd a_goals in
1512 let not_in_active gl =
1516 if (List.length gl) = (List.length gl') then
1517 List.for_all2 (fun (_, _, g1) (_, _, g2) -> g1 = g2) gl gl'
1523 let res = apply_to_goal_conj env theorems ?passive active goal in
1526 true, ([newgoals], [])
1528 false, (a_goals, p_goals)
1533 (d <= !maxdepth) && (List.length gl) <= !maxwidth &&
1536 let p_goals = newgoals @ p_goals in
1537 let p_goals = sort_passive_goals p_goals in
1538 false, (a_goals, p_goals)
1544 let apply_theorem_to_goals env theorems active goals =
1545 let a_goals, p_goals = goals in
1546 let theorem = List.hd (fst theorems) in
1547 let theorems = [theorem] in
1548 let rec aux p = function
1549 | [] -> false, ([], p)
1551 let res = apply_to_goal_conj env theorems active goal in
1553 | `Ok newgoals -> true, ([newgoals], [])
1555 | `GoOn newgoals -> aux (newgoals @ p) tl
1557 let ok, (a, p) = aux p_goals a_goals in
1563 (fun (d1, l1) (d2, l2) ->
1566 else let r = (List.length l1) - (List.length l2) in
1572 (fun (_, _, t1) (_, _, t2) ->
1573 let r = Pervasives.compare t1 t2 in
1574 if r <> 0 then (res := r; true) else false) l1 l2
1578 ok, (a_goals, p_goals)
1582 (* given-clause algorithm with lazy reduction strategy *)
1583 let rec given_clause dbd env goals theorems passive active =
1584 let _,context,_ = env in
1585 let goals = simplify_goals env goals active in
1586 let ok, goals = activate_goal goals in
1587 (* let theorems = simplify_theorems env theorems active in *)
1589 let ok, goals = apply_goal_to_theorems dbd env theorems active goals in
1592 match (fst goals) with
1593 | (_, [proof, _, _])::_ -> Some proof
1596 ParamodulationSuccess (proof, env)
1598 given_clause_aux dbd env goals theorems passive active
1600 (* let ok', theorems = activate_theorem theorems in *)
1601 let ok', theorems = false, theorems in
1603 let ok, goals = apply_theorem_to_goals env theorems active goals in
1606 match (fst goals) with
1607 | (_, [proof, _, _])::_ -> Some proof
1610 ParamodulationSuccess (proof, env)
1612 given_clause_aux dbd env goals theorems passive active
1614 if (passive_is_empty passive) then ParamodulationFailure
1615 else given_clause_aux dbd env goals theorems passive active
1617 and given_clause_aux dbd env goals theorems passive active =
1618 let _,context,_ = env in
1619 let time1 = Unix.gettimeofday () in
1621 let selection_estimate = get_selection_estimate () in
1622 let kept = size_of_passive passive in
1624 if !time_limit = 0. || !processed_clauses = 0 then
1626 else if !elapsed_time > !time_limit then (
1627 debug_print (lazy (Printf.sprintf "Time limit (%.2f) reached: %.2f\n"
1628 !time_limit !elapsed_time));
1630 ) else if kept > selection_estimate then (
1632 (lazy (Printf.sprintf ("Too many passive equalities: pruning..." ^^
1633 "(kept: %d, selection_estimate: %d)\n")
1634 kept selection_estimate));
1635 prune_passive selection_estimate active passive
1640 let time2 = Unix.gettimeofday () in
1641 passive_maintainance_time := !passive_maintainance_time +. (time2 -. time1);
1643 kept_clauses := (size_of_passive passive) + (size_of_active active);
1644 match passive_is_empty passive with
1645 | true -> (* ParamodulationFailure *)
1646 given_clause dbd env goals theorems passive active
1648 let (sign, current), passive = select env (fst goals) passive active in
1649 let names = List.map (HExtlib.map_option (fun (name,_) -> name)) context in
1650 prerr_endline ("Selected = " ^
1651 (CicPp.pp (Inference.term_of_equality current) names));
1652 let time1 = Unix.gettimeofday () in
1653 let res = forward_simplify env (sign, current) ~passive active in
1654 let time2 = Unix.gettimeofday () in
1655 forward_simpl_time := !forward_simpl_time +. (time2 -. time1);
1658 given_clause dbd env goals theorems passive active
1659 | Some (sign, current) ->
1660 if (sign = Negative) && (is_identity env current) then (
1662 (lazy (Printf.sprintf "OK!!! %s %s" (string_of_sign sign)
1663 (string_of_equality ~env current)));
1664 let _, proof, _, _ = current in
1665 ParamodulationSuccess (Some proof, env)
1668 (lazy "\n================================================");
1669 debug_print (lazy (Printf.sprintf "selected: %s %s"
1670 (string_of_sign sign)
1671 (string_of_equality ~env current)));
1673 let t1 = Unix.gettimeofday () in
1674 let new' = infer env sign current active in
1675 let t2 = Unix.gettimeofday () in
1676 infer_time := !infer_time +. (t2 -. t1);
1678 let res, goal' = contains_empty env new' in
1682 | Some goal -> let _, proof, _, _ = goal in Some proof
1685 ParamodulationSuccess (proof, env)
1687 let t1 = Unix.gettimeofday () in
1688 let new' = forward_simplify_new env new' active in
1689 let t2 = Unix.gettimeofday () in
1691 forward_simpl_new_time :=
1692 !forward_simpl_new_time +. (t2 -. t1)
1696 | Negative -> active
1698 let t1 = Unix.gettimeofday () in
1699 let active, _, newa, _ =
1700 backward_simplify env ([], [current]) active
1702 let t2 = Unix.gettimeofday () in
1703 backward_simpl_time :=
1704 !backward_simpl_time +. (t2 -. t1);
1708 let al, tbl = active in
1709 let nn = List.map (fun e -> Negative, e) n in
1714 Indexing.index tbl e)
1719 match contains_empty env new' with
1722 let al, tbl = active in
1724 | Negative -> (sign, current)::al, tbl
1726 al @ [(sign, current)], Indexing.index tbl current
1728 let passive = add_to_passive passive new' in
1729 given_clause dbd env goals theorems passive active
1734 let _, proof, _, _ = goal in Some proof
1737 ParamodulationSuccess (proof, env)
1742 (** given-clause algorithm with full reduction strategy *)
1743 let rec given_clause_fullred dbd env goals theorems passive active =
1744 let goals = simplify_goals env goals ~passive active in
1745 let _,context,_ = env in
1746 let ok, goals = activate_goal goals in
1747 (* let theorems = simplify_theorems env theorems ~passive active in *)
1749 let names = List.map (HExtlib.map_option (fun (name,_) -> name)) context in
1750 let _, _, t = List.hd (snd (List.hd (fst goals))) in
1751 let _ = prerr_endline ("goal activated = " ^ (CicPp.pp t names)) in
1755 (* (Printf.sprintf "\ngoals = \nactive\n%s\npassive\n%s\n" *)
1756 (* (print_goals (fst goals)) (print_goals (snd goals)))); *)
1757 (* let current = List.hd (fst goals) in *)
1758 (* let p, _, t = List.hd (snd current) in *)
1761 (* (Printf.sprintf "goal activated:\n%s\n%s\n" *)
1762 (* (CicPp.ppterm t) (string_of_proof p))); *)
1765 apply_goal_to_theorems dbd env theorems ~passive active goals
1769 match (fst goals) with
1770 | (_, [proof, _, _])::_ -> Some proof
1773 ( prerr_endline "esco qui";
1775 let s = Printf.sprintf "actives:\n%s\n"
1778 (fun (s, e) -> (string_of_sign s) ^ " " ^
1779 (string_of_equality ~env e))
1781 let sp = Printf.sprintf "passives:\n%s\n"
1784 (string_of_equality ~env)
1785 (let x,y,_ = passive in (fst x)@(fst y)))) in
1787 prerr_endline sp; *)
1788 ParamodulationSuccess (proof, env))
1790 given_clause_fullred_aux dbd env goals theorems passive active
1792 (* let ok', theorems = activate_theorem theorems in *)
1794 (* let ok, goals = apply_theorem_to_goals env theorems active goals in *)
1797 (* match (fst goals) with *)
1798 (* | (_, [proof, _, _])::_ -> Some proof *)
1799 (* | _ -> assert false *)
1801 (* ParamodulationSuccess (proof, env) *)
1803 (* given_clause_fullred_aux env goals theorems passive active *)
1805 if (passive_is_empty passive) then ParamodulationFailure
1806 else given_clause_fullred_aux dbd env goals theorems passive active
1808 and given_clause_fullred_aux dbd env goals theorems passive active =
1809 prerr_endline ("MAXMETA: " ^ string_of_int !maxmeta ^
1810 " LOCALMAX: " ^ string_of_int !Indexing.local_max ^
1811 " #ACTIVES: " ^ string_of_int (size_of_active active) ^
1812 " #PASSIVES: " ^ string_of_int (size_of_passive passive));
1814 if (size_of_active active) mod 50 = 0 then
1815 (let s = Printf.sprintf "actives:\n%s\n"
1818 (fun (s, e) -> (string_of_sign s) ^ " " ^
1819 (string_of_equality ~env e))
1821 let sp = Printf.sprintf "passives:\n%s\n"
1824 (string_of_equality ~env)
1825 (let x,y,_ = passive in (fst x)@(fst y)))) in
1827 prerr_endline sp); *)
1828 let time1 = Unix.gettimeofday () in
1829 let (_,context,_) = env in
1830 let selection_estimate = get_selection_estimate () in
1831 let kept = size_of_passive passive in
1833 if !time_limit = 0. || !processed_clauses = 0 then
1835 else if !elapsed_time > !time_limit then (
1836 debug_print (lazy (Printf.sprintf "Time limit (%.2f) reached: %.2f\n"
1837 !time_limit !elapsed_time));
1839 ) else if kept > selection_estimate then (
1841 (lazy (Printf.sprintf ("Too many passive equalities: pruning..." ^^
1842 "(kept: %d, selection_estimate: %d)\n")
1843 kept selection_estimate));
1844 prune_passive selection_estimate active passive
1849 let time2 = Unix.gettimeofday () in
1850 passive_maintainance_time := !passive_maintainance_time +. (time2 -. time1);
1852 kept_clauses := (size_of_passive passive) + (size_of_active active);
1853 match passive_is_empty passive with
1854 | true -> (* ParamodulationFailure *)
1855 given_clause_fullred dbd env goals theorems passive active
1857 let (sign, current), passive = select env (fst goals) passive active in
1858 let names = List.map (HExtlib.map_option (fun (name,_) -> name)) context in
1859 prerr_endline ("Selected = " ^ (string_of_sign sign) ^ " " ^
1860 string_of_equality ~env current);
1861 (* (CicPp.pp (Inference.term_of_equality current) names));*)
1862 let time1 = Unix.gettimeofday () in
1863 let res = forward_simplify env (sign, current) ~passive active in
1864 let time2 = Unix.gettimeofday () in
1865 forward_simpl_time := !forward_simpl_time +. (time2 -. time1);
1868 (* weight_age_counter := !weight_age_counter + 1; *)
1869 given_clause_fullred dbd env goals theorems passive active
1870 | Some (sign, current) ->
1871 if (sign = Negative) && (is_identity env current) then (
1873 (lazy (Printf.sprintf "OK!!! %s %s" (string_of_sign sign)
1874 (string_of_equality ~env current)));
1875 let _, proof, _, _ = current in
1876 ParamodulationSuccess (Some proof, env)
1879 (lazy "\n================================================");
1880 debug_print (lazy (Printf.sprintf "selected: %s %s"
1881 (string_of_sign sign)
1882 (string_of_equality ~env current)));
1884 let t1 = Unix.gettimeofday () in
1885 let new' = infer env sign current active in
1891 (Printf.sprintf "new' (senza semplificare):\n%s\n"
1894 (fun e -> "Negative " ^
1895 (string_of_equality ~env e)) neg) @
1897 (fun e -> "Positive " ^
1898 (string_of_equality ~env e)) pos)))))
1900 let t2 = Unix.gettimeofday () in
1901 infer_time := !infer_time +. (t2 -. t1);
1903 if is_identity env current then active
1905 let al, tbl = active in
1907 | Negative -> (sign, current)::al, tbl
1909 al @ [(sign, current)], Indexing.index tbl current
1911 let rec simplify new' active passive =
1912 let t1 = Unix.gettimeofday () in
1913 let new' = forward_simplify_new env new' ~passive active in
1914 let t2 = Unix.gettimeofday () in
1915 forward_simpl_new_time :=
1916 !forward_simpl_new_time +. (t2 -. t1);
1917 let t1 = Unix.gettimeofday () in
1918 let active, passive, newa, retained =
1919 backward_simplify env new' ~passive active in
1920 let t2 = Unix.gettimeofday () in
1921 backward_simpl_time := !backward_simpl_time +. (t2 -. t1);
1922 match newa, retained with
1923 | None, None -> active, passive, new'
1925 | None, Some (n, p) ->
1926 let nn, np = new' in
1927 if Utils.debug_metas then
1929 List.map (fun x -> Indexing.check_target context x "simplify1")n;
1930 List.map (fun x -> Indexing.check_target context x "simplify2")p);
1931 simplify (nn @ n, np @ p) active passive
1932 | Some (n, p), Some (rn, rp) ->
1933 let nn, np = new' in
1934 simplify (nn @ n @ rn, np @ p @ rp) active passive
1936 let active, passive, new' = simplify new' active passive in
1938 let new1 = prova env new' active in
1939 let new' = (fst new') @ (fst new1), (snd new') @ (snd new1) in
1945 (Printf.sprintf "new1:\n%s\n"
1948 (fun e -> "Negative " ^
1949 (string_of_equality ~env e)) neg) @
1951 (fun e -> "Positive " ^
1952 (string_of_equality ~env e)) pos)))))
1955 let k = size_of_passive passive in
1956 if k < (kept - 1) then
1957 processed_clauses := !processed_clauses + (kept - 1 - k);
1962 (Printf.sprintf "active:\n%s\n"
1965 (fun (s, e) -> (string_of_sign s) ^ " " ^
1966 (string_of_equality ~env e))
1974 (Printf.sprintf "new':\n%s\n"
1977 (fun e -> "Negative " ^
1978 (string_of_equality ~env e)) neg) @
1980 (fun e -> "Positive " ^
1981 (string_of_equality ~env e)) pos)))))
1983 match contains_empty env new' with
1985 let passive = add_to_passive passive new' in
1986 given_clause_fullred dbd env goals theorems passive active
1990 | Some goal -> let _, proof, _, _ = goal in Some proof
1993 ParamodulationSuccess (proof, env)
1998 let rec saturate_equations env goal accept_fun passive active =
1999 elapsed_time := Unix.gettimeofday () -. !start_time;
2000 if !elapsed_time > !time_limit then
2003 let (sign, current), passive = select env [1, [goal]] passive active in
2004 let res = forward_simplify env (sign, current) ~passive active in
2007 saturate_equations env goal accept_fun passive active
2008 | Some (sign, current) ->
2009 assert (sign = Positive);
2011 (lazy "\n================================================");
2012 debug_print (lazy (Printf.sprintf "selected: %s %s"
2013 (string_of_sign sign)
2014 (string_of_equality ~env current)));
2015 let new' = infer env sign current active in
2017 if is_identity env current then active
2019 let al, tbl = active in
2020 al @ [(sign, current)], Indexing.index tbl current
2022 let rec simplify new' active passive =
2023 let new' = forward_simplify_new env new' ~passive active in
2024 let active, passive, newa, retained =
2025 backward_simplify env new' ~passive active in
2026 match newa, retained with
2027 | None, None -> active, passive, new'
2029 | None, Some (n, p) ->
2030 let nn, np = new' in
2031 simplify (nn @ n, np @ p) active passive
2032 | Some (n, p), Some (rn, rp) ->
2033 let nn, np = new' in
2034 simplify (nn @ n @ rn, np @ p @ rp) active passive
2036 let active, passive, new' = simplify new' active passive in
2040 (Printf.sprintf "active:\n%s\n"
2043 (fun (s, e) -> (string_of_sign s) ^ " " ^
2044 (string_of_equality ~env e))
2052 (Printf.sprintf "new':\n%s\n"
2055 (fun e -> "Negative " ^
2056 (string_of_equality ~env e)) neg) @
2058 (fun e -> "Positive " ^
2059 (string_of_equality ~env e)) pos)))))
2061 let new' = match new' with _, pos -> [], List.filter accept_fun pos in
2062 let passive = add_to_passive passive new' in
2063 saturate_equations env goal accept_fun passive active
2069 let main dbd full term metasenv ugraph =
2070 let module C = Cic in
2071 let module T = CicTypeChecker in
2072 let module PET = ProofEngineTypes in
2073 let module PP = CicPp in
2074 let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
2075 let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
2076 let proof, goals = status in
2077 let goal' = List.nth goals 0 in
2078 let _, metasenv, meta_proof, _ = proof in
2079 let _, context, goal = CicUtil.lookup_meta goal' metasenv in
2080 let eq_indexes, equalities, maxm = find_equalities context proof in
2081 let lib_eq_uris, library_equalities, maxm =
2083 find_library_equalities dbd context (proof, goal') (maxm+2)
2085 let library_equalities = List.map snd library_equalities in
2086 maxmeta := maxm+2; (* TODO ugly!! *)
2087 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
2088 let new_meta_goal, metasenv, type_of_goal =
2089 let _, context, ty = CicUtil.lookup_meta goal' metasenv in
2092 (Printf.sprintf "\n\nTIPO DEL GOAL: %s\n\n" (CicPp.ppterm ty)));
2093 Cic.Meta (maxm+1, irl),
2094 (maxm+1, context, ty)::metasenv,
2097 let env = (metasenv, context, ugraph) in
2098 let t1 = Unix.gettimeofday () in
2101 let theorems = find_library_theorems dbd env (proof, goal') lib_eq_uris in
2102 let context_hyp = find_context_hypotheses env eq_indexes in
2103 context_hyp @ theorems, []
2106 let us = UriManager.string_of_uri (LibraryObjects.eq_URI ()) in
2107 UriManager.uri_of_string (us ^ "#xpointer(1/1/1)")
2109 let t = CicUtil.term_of_uri refl_equal in
2110 let ty, _ = CicTypeChecker.type_of_aux' [] [] t CicUniv.empty_ugraph in
2113 let t2 = Unix.gettimeofday () in
2116 (Printf.sprintf "Time to retrieve theorems: %.9f\n" (t2 -. t1)));
2121 "Theorems:\n-------------------------------------\n%s\n"
2126 "Term: %s, type: %s" (CicPp.ppterm t) (CicPp.ppterm ty))
2130 let goal = Inference.BasicProof new_meta_goal, [], goal in
2131 let equalities = simplify_equalities env
2132 (equalities@library_equalities) in
2133 let active = make_active () in
2134 let passive = make_passive [] equalities in
2135 Printf.printf "\ncurrent goal: %s\n"
2136 (let _, _, g = goal in CicPp.ppterm g);
2137 Printf.printf "\ncontext:\n%s\n" (PP.ppcontext context);
2138 Printf.printf "\nmetasenv:\n%s\n" (print_metasenv metasenv);
2139 Printf.printf "\nequalities:\n%s\n"
2142 (string_of_equality ~env) equalities));
2143 (* (equalities @ library_equalities))); *)
2144 print_endline "--------------------------------------------------";
2145 let start = Unix.gettimeofday () in
2146 print_endline "GO!";
2147 start_time := Unix.gettimeofday ();
2149 let goals = make_goals goal in
2150 (if !use_fullred then given_clause_fullred else given_clause)
2151 dbd env goals theorems passive active
2153 let finish = Unix.gettimeofday () in
2156 | ParamodulationFailure ->
2157 Printf.printf "NO proof found! :-(\n\n"
2158 | ParamodulationSuccess (Some proof, env) ->
2159 let proof = Inference.build_proof_term proof in
2160 Printf.printf "OK, found a proof!\n";
2161 (* REMEMBER: we have to instantiate meta_proof, we should use
2162 apply the "apply" tactic to proof and status
2164 let names = names_of_context context in
2165 print_endline (PP.pp proof names);
2168 (fun m (_, _, _, menv) -> m @ menv) metasenv equalities
2173 CicTypeChecker.type_of_aux' newmetasenv context proof ugraph
2175 print_endline (string_of_float (finish -. start));
2177 "\nGOAL was: %s\nPROOF has type: %s\nconvertible?: %s\n\n"
2178 (CicPp.pp type_of_goal names) (CicPp.pp ty names)
2180 (fst (CicReduction.are_convertible
2181 context type_of_goal ty ug)));
2183 Printf.printf "\nEXCEPTION!!! %s\n" (Printexc.to_string e);
2184 Printf.printf "MAXMETA USED: %d\n" !maxmeta;
2185 print_endline (string_of_float (finish -. start));*)
2189 | ParamodulationSuccess (None, env) ->
2190 Printf.printf "Success, but no proof?!?\n\n"
2195 ((Printf.sprintf ("infer_time: %.9f\nforward_simpl_time: %.9f\n" ^^
2196 "forward_simpl_new_time: %.9f\n" ^^
2197 "backward_simpl_time: %.9f\n")
2198 !infer_time !forward_simpl_time !forward_simpl_new_time
2199 !backward_simpl_time) ^
2200 (Printf.sprintf "beta_expand_time: %.9f\n"
2201 !Indexing.beta_expand_time) ^
2202 (Printf.sprintf "passive_maintainance_time: %.9f\n"
2203 !passive_maintainance_time) ^
2204 (Printf.sprintf " successful unification/matching time: %.9f\n"
2205 !Indexing.match_unif_time_ok) ^
2206 (Printf.sprintf " failed unification/matching time: %.9f\n"
2207 !Indexing.match_unif_time_no) ^
2208 (Printf.sprintf " indexing retrieval time: %.9f\n"
2209 !Indexing.indexing_retrieval_time) ^
2210 (Printf.sprintf " demodulate_term.build_newtarget_time: %.9f\n"
2211 !Indexing.build_newtarget_time) ^
2212 (Printf.sprintf "derived %d clauses, kept %d clauses.\n"
2213 !derived_clauses !kept_clauses))
2217 print_endline ("EXCEPTION: " ^ (Printexc.to_string exc));
2223 let default_depth = !maxdepth
2224 and default_width = !maxwidth;;
2228 Indexing.local_max := 100;
2229 symbols_counter := 0;
2230 weight_age_counter := !weight_age_ratio;
2231 processed_clauses := 0;
2234 maximal_retained_equality := None;
2236 forward_simpl_time := 0.;
2237 forward_simpl_new_time := 0.;
2238 backward_simpl_time := 0.;
2239 passive_maintainance_time := 0.;
2240 derived_clauses := 0;
2242 Indexing.beta_expand_time := 0.;
2243 Inference.metas_of_proof_time := 0.;
2247 dbd ?(full=false) ?(depth=default_depth) ?(width=default_width) status =
2248 let module C = Cic in
2250 Indexing.init_index ();
2253 let proof, goal = status in
2255 let uri, metasenv, meta_proof, term_to_prove = proof in
2256 let _, context, goal = CicUtil.lookup_meta goal' metasenv in
2257 let eq_indexes, equalities, maxm = find_equalities context proof in
2258 let new_meta_goal, metasenv, type_of_goal =
2260 CicMkImplicit.identity_relocation_list_for_metavariable context in
2261 let _, context, ty = CicUtil.lookup_meta goal' metasenv in
2263 (lazy (Printf.sprintf "\n\nTIPO DEL GOAL: %s\n" (CicPp.ppterm ty)));
2264 Cic.Meta (maxm+1, irl),
2265 (maxm+1, context, ty)::metasenv,
2268 let ugraph = CicUniv.empty_ugraph in
2269 let env = (metasenv, context, ugraph) in
2270 let goal = Inference.BasicProof new_meta_goal, [], goal in
2272 let t1 = Unix.gettimeofday () in
2273 let lib_eq_uris, library_equalities, maxm =
2274 find_library_equalities dbd context (proof, goal') (maxm+2)
2276 let library_equalities = List.map snd library_equalities in
2277 let t2 = Unix.gettimeofday () in
2279 let equalities = simplify_equalities env (equalities@library_equalities) in
2282 (Printf.sprintf "Time to retrieve equalities: %.9f\n" (t2 -. t1)));
2283 let t1 = Unix.gettimeofday () in
2286 let thms = find_library_theorems dbd env (proof, goal') lib_eq_uris in
2287 let context_hyp = find_context_hypotheses env eq_indexes in
2288 context_hyp @ thms, []
2291 let us = UriManager.string_of_uri (LibraryObjects.eq_URI ()) in
2292 UriManager.uri_of_string (us ^ "#xpointer(1/1/1)")
2294 let t = CicUtil.term_of_uri refl_equal in
2295 let ty, _ = CicTypeChecker.type_of_aux' [] [] t CicUniv.empty_ugraph in
2298 let t2 = Unix.gettimeofday () in
2303 "Theorems:\n-------------------------------------\n%s\n"
2308 "Term: %s, type: %s"
2309 (CicPp.ppterm t) (CicPp.ppterm ty))
2313 (Printf.sprintf "Time to retrieve theorems: %.9f\n" (t2 -. t1)));
2315 let active = make_active () in
2316 let passive = make_passive [] equalities in
2317 let start = Unix.gettimeofday () in
2319 let goals = make_goals goal in
2320 given_clause_fullred dbd env goals theorems passive active
2322 let finish = Unix.gettimeofday () in
2323 (res, finish -. start)
2326 | ParamodulationSuccess (Some proof, env) ->
2327 debug_print (lazy "OK, found a proof!");
2328 let proof = Inference.build_proof_term proof in
2329 let names = names_of_context context in
2332 match new_meta_goal with
2333 | C.Meta (i, _) -> i | _ -> assert false
2335 List.filter (fun (i, _, _) -> i <> i1 && i <> goal') metasenv
2340 CicTypeChecker.type_of_aux' newmetasenv context proof ugraph
2342 debug_print (lazy (CicPp.pp proof [](* names *)));
2346 "\nGOAL was: %s\nPROOF has type: %s\nconvertible?: %s\n"
2347 (CicPp.pp type_of_goal names) (CicPp.pp ty names)
2349 (fst (CicReduction.are_convertible
2350 context type_of_goal ty ug)))));
2351 let equality_for_replace i t1 =
2353 | C.Meta (n, _) -> n = i
2357 ProofEngineReduction.replace
2358 ~equality:equality_for_replace
2359 ~what:[goal'] ~with_what:[proof]
2364 (Printf.sprintf "status:\n%s\n%s\n%s\n%s\n"
2365 (match uri with Some uri -> UriManager.string_of_uri uri
2367 (print_metasenv newmetasenv)
2368 (CicPp.pp real_proof [](* names *))
2369 (CicPp.pp term_to_prove names)));
2370 ((uri, newmetasenv, real_proof, term_to_prove), [])
2371 with CicTypeChecker.TypeCheckerFailure _ ->
2372 debug_print (lazy "THE PROOF DOESN'T TYPECHECK!!!");
2373 debug_print (lazy (CicPp.pp proof names));
2374 raise (ProofEngineTypes.Fail
2375 (lazy "Found a proof, but it doesn't typecheck"))
2377 let tall = fs_time_info.build_all in
2378 let tdemodulate = fs_time_info.demodulate in
2379 let tsubsumption = fs_time_info.subsumption in
2383 (Printf.sprintf "\nTIME NEEDED: %.9f" time) ^
2384 (Printf.sprintf "\ntall: %.9f" tall) ^
2385 (Printf.sprintf "\ntdemod: %.9f" tdemodulate) ^
2386 (Printf.sprintf "\ntsubsumption: %.9f" tsubsumption) ^
2387 (Printf.sprintf "\ninfer_time: %.9f" !infer_time) ^
2388 (Printf.sprintf "\nbeta_expand_time: %.9f\n"
2389 !Indexing.beta_expand_time) ^
2390 (Printf.sprintf "\nmetas_of_proof: %.9f\n"
2391 !Inference.metas_of_proof_time) ^
2392 (Printf.sprintf "\nforward_simpl_times: %.9f" !forward_simpl_time) ^
2393 (Printf.sprintf "\nforward_simpl_new_times: %.9f"
2394 !forward_simpl_new_time) ^
2395 (Printf.sprintf "\nbackward_simpl_times: %.9f" !backward_simpl_time) ^
2396 (Printf.sprintf "\npassive_maintainance_time: %.9f"
2397 !passive_maintainance_time))
2401 raise (ProofEngineTypes.Fail (lazy "NO proof found"))
2404 (* dummy function called within matita to trigger linkage *)
2408 let retrieve_and_print dbd term metasenv ugraph =
2409 let module C = Cic in
2410 let module T = CicTypeChecker in
2411 let module PET = ProofEngineTypes in
2412 let module PP = CicPp in
2413 let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
2414 let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
2415 let proof, goals = status in
2416 let goal' = List.nth goals 0 in
2417 let uri, metasenv, meta_proof, term_to_prove = proof in
2418 let _, context, goal = CicUtil.lookup_meta goal' metasenv in
2419 let eq_indexes, equalities, maxm = find_equalities context proof in
2420 let new_meta_goal, metasenv, type_of_goal =
2422 CicMkImplicit.identity_relocation_list_for_metavariable context in
2423 let _, context, ty = CicUtil.lookup_meta goal' metasenv in
2425 (lazy (Printf.sprintf "\n\nTIPO DEL GOAL: %s\n" (CicPp.ppterm ty)));
2426 Cic.Meta (maxm+1, irl),
2427 (maxm+1, context, ty)::metasenv,
2430 let ugraph = CicUniv.empty_ugraph in
2431 let env = (metasenv, context, ugraph) in
2432 let t1 = Unix.gettimeofday () in
2433 let lib_eq_uris, library_equalities, maxm =
2434 find_library_equalities dbd context (proof, goal') (maxm+2) in
2435 let t2 = Unix.gettimeofday () in
2437 let equalities = (* equalities @ *) library_equalities in
2440 (Printf.sprintf "\n\nequalities:\n%s\n"
2444 (* Printf.sprintf "%s: %s" *)
2445 (UriManager.string_of_uri u)
2446 (* (string_of_equality e) *)
2449 debug_print (lazy "RETR: SIMPLYFYING EQUALITIES...");
2450 let rec simpl e others others_simpl =
2452 let active = List.map (fun (u, e) -> (Positive, e))
2453 (others @ others_simpl) in
2456 (fun t (_, e) -> Indexing.index t e)
2457 Indexing.empty active
2459 let res = forward_simplify env (Positive, e) (active, tbl) in
2463 | None -> simpl hd tl others_simpl
2464 | Some e -> simpl hd tl ((u, (snd e))::others_simpl)
2468 | None -> others_simpl
2469 | Some e -> (u, (snd e))::others_simpl
2473 match equalities with
2476 let others = tl in (* List.map (fun e -> (Positive, e)) tl in *)
2478 List.rev (simpl (*(Positive,*) hd others [])
2482 (Printf.sprintf "\nequalities AFTER:\n%s\n"
2486 Printf.sprintf "%s: %s"
2487 (UriManager.string_of_uri u)
2488 (string_of_equality e)
2494 (Printf.sprintf "Time to retrieve equalities: %.9f\n" (t2 -. t1)))
2498 let main_demod_equalities dbd term metasenv ugraph =
2499 let module C = Cic in
2500 let module T = CicTypeChecker in
2501 let module PET = ProofEngineTypes in
2502 let module PP = CicPp in
2503 let proof = None, (1, [], term)::metasenv, C.Meta (1, []), term in
2504 let status = PET.apply_tactic (PrimitiveTactics.intros_tac ()) (proof, 1) in
2505 let proof, goals = status in
2506 let goal' = List.nth goals 0 in
2507 let _, metasenv, meta_proof, _ = proof in
2508 let _, context, goal = CicUtil.lookup_meta goal' metasenv in
2509 let eq_indexes, equalities, maxm = find_equalities context proof in
2510 let lib_eq_uris, library_equalities, maxm =
2511 find_library_equalities dbd context (proof, goal') (maxm+2)
2513 let library_equalities = List.map snd library_equalities in
2514 maxmeta := maxm+2; (* TODO ugly!! *)
2515 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
2516 let new_meta_goal, metasenv, type_of_goal =
2517 let _, context, ty = CicUtil.lookup_meta goal' metasenv in
2520 (Printf.sprintf "\n\nTRYING TO INFER EQUALITIES MATCHING: %s\n\n"
2521 (CicPp.ppterm ty)));
2522 Cic.Meta (maxm+1, irl),
2523 (maxm+1, context, ty)::metasenv,
2526 let env = (metasenv, context, ugraph) in
2528 let goal = Inference.BasicProof new_meta_goal, [], goal in
2529 let equalities = simplify_equalities env (equalities@library_equalities) in
2530 let active = make_active () in
2531 let passive = make_passive [] equalities in
2532 Printf.printf "\ncontext:\n%s\n" (PP.ppcontext context);
2533 Printf.printf "\nmetasenv:\n%s\n" (print_metasenv metasenv);
2534 Printf.printf "\nequalities:\n%s\n"
2537 (string_of_equality ~env) equalities));
2538 print_endline "--------------------------------------------------";
2539 print_endline "GO!";
2540 start_time := Unix.gettimeofday ();
2541 if !time_limit < 1. then time_limit := 60.;
2543 saturate_equations env goal (fun e -> true) passive active
2547 List.fold_left (fun s e -> EqualitySet.add e s)
2548 EqualitySet.empty equalities
2551 if not (EqualitySet.mem e initial) then EqualitySet.add e s else s
2556 | (n, _), (p, _), _ ->
2557 EqualitySet.elements (List.fold_left addfun EqualitySet.empty p)
2560 let l = List.map snd (fst ra) in
2561 EqualitySet.elements (List.fold_left addfun EqualitySet.empty l)
2563 Printf.printf "\n\nRESULTS:\nActive:\n%s\n\nPassive:\n%s\n"
2564 (String.concat "\n" (List.map (string_of_equality ~env) active))
2565 (* (String.concat "\n"
2566 (List.map (fun e -> CicPp.ppterm (term_of_equality e)) active)) *)
2567 (* (String.concat "\n" (List.map (string_of_equality ~env) passive)); *)
2569 (List.map (fun e -> CicPp.ppterm (term_of_equality e)) passive));
2573 debug_print (lazy ("EXCEPTION: " ^ (Printexc.to_string e)))
2577 let demodulate_tac ~dbd ~pattern ((proof,goal) as initialstatus) =
2578 let module I = Inference in
2579 let curi,metasenv,pbo,pty = proof in
2580 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
2581 let eq_indexes, equalities, maxm = I.find_equalities context proof in
2582 let lib_eq_uris, library_equalities, maxm =
2583 I.find_library_equalities dbd context (proof, goal) (maxm+2) in
2584 if library_equalities = [] then prerr_endline "VUOTA!!!";
2585 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
2586 let library_equalities = List.map snd library_equalities in
2587 let goalterm = Cic.Meta (metano,irl) in
2588 let initgoal = Inference.BasicProof goalterm, [], ty in
2589 let env = (metasenv, context, CicUniv.empty_ugraph) in
2590 let equalities = simplify_equalities env (equalities@library_equalities) in
2593 (fun tbl eq -> Indexing.index tbl eq)
2594 Indexing.empty equalities
2596 let newmeta,(newproof,newmetasenv, newty) = Indexing.demodulation_goal
2597 maxm (metasenv,context,CicUniv.empty_ugraph) table initgoal
2599 if newmeta != maxm then
2601 let opengoal = Cic.Meta(maxm,irl) in
2603 Inference.build_proof_term ~noproof:opengoal newproof in
2604 let extended_metasenv = (maxm,context,newty)::metasenv in
2605 let extended_status =
2606 (curi,extended_metasenv,pbo,pty),goal in
2607 let (status,newgoals) =
2608 ProofEngineTypes.apply_tactic
2609 (PrimitiveTactics.apply_tac ~term:proofterm)
2611 (status,maxm::newgoals)
2613 else if newty = ty then
2614 raise (ProofEngineTypes.Fail (lazy "no progress"))
2615 else ProofEngineTypes.apply_tactic
2616 (ReductionTactics.simpl_tac ~pattern)
2620 let demodulate_tac ~dbd ~pattern =
2621 ProofEngineTypes.mk_tactic (demodulate_tac ~dbd ~pattern)