1 (* Copyright (C) 2002, 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/.
31 if debug then prerr_endline (Lazy.force s);;
34 let mk_irl ctx = CicMkImplicit.identity_relocation_list_for_metavariable ctx;;
35 let ugraph = CicUniv.oblivion_ugraph;;
36 let typeof = CicTypeChecker.type_of_aux';;
38 let names = List.map (function None -> None | Some (x,_) -> Some x) ctx in
41 let is_propositional context sort =
42 match CicReduction.whd context sort with
44 | Cic.Sort (Cic.CProp _) -> true
47 let is_in_prop context subst metasenv ty =
48 let sort,u = typeof ~subst metasenv context ty CicUniv.oblivion_ugraph in
49 is_propositional context sort
52 exception NotConvertible;;
54 let check_proof_is_valid proof metasenv context goalty =
58 let ty,u = typeof metasenv context proof CicUniv.oblivion_ugraph in
59 let b,_ = CicReduction.are_convertible context ty goalty u in
60 if not b then raise NotConvertible else b
63 List.map (function None -> None | Some (x,_) -> Some x) context
65 debug_print (lazy ("PROOF:" ^ CicPp.pp proof names));
66 (* debug_print (lazy ("PROOFTY:" ^ CicPp.pp ty names)); *)
67 debug_print (lazy ("GOAL:" ^ CicPp.pp goalty names));
68 debug_print (lazy ("MENV:" ^ CicMetaSubst.ppmetasenv [] metasenv));
74 let assert_proof_is_valid proof metasenv context goalty =
75 assert (check_proof_is_valid proof metasenv context goalty)
78 let assert_subst_are_disjoint subst subst' =
81 (fun (i,_) -> List.for_all (fun (j,_) -> i<>j) subst')
86 let split_goals_in_prop metasenv subst gl =
89 let _,context,ty = CicUtil.lookup_meta g metasenv in
91 let sort,u = typeof ~subst metasenv context ty ugraph in
92 is_propositional context sort
94 | CicTypeChecker.AssertFailure s
95 | CicTypeChecker.TypeCheckerFailure s ->
97 (lazy ("NON TIPA" ^ ppterm context (CicMetaSubst.apply_subst subst ty)));
100 (* FIXME... they should type! *)
104 let split_goals_with_metas metasenv subst gl =
107 let _,context,ty = CicUtil.lookup_meta g metasenv in
108 let ty = CicMetaSubst.apply_subst subst ty in
109 CicUtil.is_meta_closed ty)
113 let order_new_goals metasenv subst open_goals ppterm =
114 let prop,rest = split_goals_in_prop metasenv subst open_goals in
115 let closed_prop, open_prop = split_goals_with_metas metasenv subst prop in
116 let closed_type, open_type = split_goals_with_metas metasenv subst rest in
118 (List.map (fun x -> x,P) (open_prop @ closed_prop))
120 (List.map (fun x -> x,T) (open_type @ closed_type))
125 let _,_,ty = CicUtil.lookup_meta i metasenv in i,ty,sort) open_goals
127 debug_print (lazy (" OPEN: "^
131 | (i,t,P) -> string_of_int i ^ ":"^ppterm t^ "Prop"
132 | (i,t,T) -> string_of_int i ^ ":"^ppterm t^ "Type")
137 let is_an_equational_goal = function
138 | Cic.Appl [Cic.MutInd(u,_,_);_;_;_] when LibraryObjects.is_eq_URI u -> true
142 type auto_params = Cic.term list * (string * string) list
144 let elems = ref [] ;;
146 (* closing a term w.r.t. its metavariables
147 very naif version: it does not take dependencies properly into account *)
149 let naif_closure ?(prefix_name="xxx_") t metasenv context =
150 let in_term t (i,_,_) =
151 List.exists (fun (j,_) -> j=i) (CicUtil.metas_of_term t)
153 let metasenv = List.filter (in_term t) metasenv in
154 let metasenv = ProofEngineHelpers.sort_metasenv metasenv in
155 let n = List.length metasenv in
156 let what = List.map (fun (i,cc,ty) -> Cic.Meta(i,[])) metasenv in
159 (fun (i,acc) (_,cc,ty) -> (i-1,Cic.Rel i::acc))
162 let t = CicSubstitution.lift n t in
164 ProofEngineReduction.replace_lifting
165 ~equality:(fun c t1 t2 ->
167 | Cic.Meta(i,_),Cic.Meta(j,_) -> i = j
169 ~context ~what ~with_what ~where:t
173 (fun (n,t) (_,cc,ty) ->
174 n-1, Cic.Lambda(Cic.Name (prefix_name^string_of_int n),
175 CicSubstitution.lift n ty,t))
178 t, List.length metasenv
181 let lambda_close ?prefix_name t menv ctx =
182 let t, num_lambdas = naif_closure ?prefix_name t menv ctx in
184 (fun (t,i) -> function
185 | None -> CicSubstitution.subst (Cic.Implicit None) t,i (* delift *)
186 | Some (name, Cic.Decl ty) -> Cic.Lambda (name, ty, t),i+1
187 | Some (name, Cic.Def (bo, ty)) -> Cic.LetIn (name, bo, ty, t),i+1)
191 (* functions for retrieving theorems *)
194 exception FillingFailure of AutoCache.cache * AutomationCache.tables
196 let rec unfold context = function
197 | Cic.Prod(name,s,t) ->
198 let t' = unfold ((Some (name,Cic.Decl s))::context) t in
200 | t -> ProofEngineReduction.unfold context t
202 let find_library_theorems dbd proof goal =
203 let univ = MetadataQuery.universe_of_goal ~dbd false proof goal in
204 let terms = List.map CicUtil.term_of_uri univ in
207 (t,fst(CicTypeChecker.type_of_aux' [] [] t CicUniv.oblivion_ugraph)))
210 let find_context_theorems context metasenv =
213 (fun (res,i) ctxentry ->
215 | Some (_,Cic.Decl t) ->
216 (Cic.Rel i, CicSubstitution.lift i t)::res,i+1
217 | Some (_,Cic.Def (_,t)) ->
218 (Cic.Rel i, CicSubstitution.lift i t)::res,i+1
223 let rec is_an_equality = function
224 | Cic.Appl [Cic.MutInd (uri, _, _); _; _; _]
225 when (LibraryObjects.is_eq_URI uri) -> true
226 | Cic.Prod (_, _, t) -> is_an_equality t
230 let partition_equalities =
231 List.partition (fun (_,ty) -> is_an_equality ty)
234 let default_auto tables _ cache _ _ _ _ = [],cache,tables ;;
236 (* giusto per provare che succede
237 let is_unit_equation context metasenv oldnewmeta term =
238 let head, metasenv, args, newmeta =
239 TermUtil.saturate_term oldnewmeta metasenv context term 0
242 List.filter (fun (i,_,_) -> i >= oldnewmeta) metasenv
244 Some (args,metasenv,newmetas,head,newmeta) *)
246 let is_unit_equation context metasenv oldnewmeta term =
247 let head, metasenv, args, newmeta =
248 TermUtil.saturate_term oldnewmeta metasenv context term 0
250 let propositional_args =
254 let _,_,mt = CicUtil.lookup_meta i metasenv in
256 CicTypeChecker.type_of_aux' metasenv context mt
257 CicUniv.oblivion_ugraph
259 if is_propositional context sort then Some i else None
263 if propositional_args = [] then
265 List.filter (fun (i,_,_) -> i >= oldnewmeta) metasenv
267 Some (args,metasenv,newmetas,head,newmeta)
271 let get_candidates skip_trie_filtering universe cache t =
272 let t = if skip_trie_filtering then Cic.Meta(0,[]) else t in
274 (Universe.get_candidates universe t)@(AutoCache.get_candidates cache t)
277 (lazy ("candidates for " ^ (CicPp.ppterm t) ^ " = " ^
278 (String.concat "\n" (List.map CicPp.ppterm candidates)))) in
279 debug_print debug_msg;
283 let only signature context metasenv t =
286 CicTypeChecker.type_of_aux' metasenv context t CicUniv.oblivion_ugraph
288 let consts = MetadataConstraints.constants_of ty in
289 let b = MetadataConstraints.UriManagerSet.subset consts signature in
290 (* if b then (prerr_endline ("keeping " ^ (CicPp.ppterm t)); b) *)
293 let ty' = unfold context ty in
294 let consts' = MetadataConstraints.constants_of ty' in
295 let b = MetadataConstraints.UriManagerSet.subset consts' signature in
297 if not b then prerr_endline ("filtering " ^ (CicPp.ppterm t))
298 else prerr_endline ("keeping " ^ (CicPp.ppterm t));
302 | CicTypeChecker.TypeCheckerFailure _ -> assert false
303 | ProofEngineTypes.Fail _ -> false (* unfold may fail *)
306 let not_default_eq_term t =
308 let uri = CicUtil.uri_of_term t in
309 not (LibraryObjects.in_eq_URIs uri)
310 with Invalid_argument _ -> true
312 let retrieve_equations dont_filter signature universe cache context metasenv =
313 match LibraryObjects.eq_URI() with
316 let eq_uri = UriManager.strip_xpointer eq_uri in
317 let fake= Cic.Meta(-1,[]) in
318 let fake_eq = Cic.Appl [Cic.MutInd (eq_uri,0, []);fake;fake;fake] in
319 let candidates = get_candidates false universe cache fake_eq in
320 if dont_filter then candidates
321 else let eq_uri = UriManager.uri_of_uriref eq_uri 0 None in
322 (* let candidates = List.filter not_default_eq_term candidates in *)
324 (only (MetadataConstraints.UriManagerSet.add eq_uri signature)
325 context metasenv) candidates
327 let build_equality bag head args proof newmetas =
329 | Cic.Appl [Cic.MutInd (uri, _, _); ty; t1; t2] ->
331 if args = [] then proof else Cic.Appl (proof::args)
333 let o = !Utils.compare_terms t1 t2 in
334 let stat = (ty,t1,t2,o) in
335 (* let w = compute_equality_weight stat in *)
337 let proof = Equality.Exact p in
338 let bag, e = Equality.mk_equality bag (w, proof, stat, newmetas) in
339 (* to clean the local context of metas *)
340 Equality.fix_metas bag e
344 let partition_unit_equalities context metasenv newmeta bag equations =
346 (fun (bag,units,other,maxmeta)(t,ty) ->
347 if not (CicUtil.is_meta_closed t && CicUtil.is_meta_closed ty) then
350 ("Skipping " ^ CicMetaSubst.ppterm_in_context ~metasenv [] t context
351 ^ " since it is not meta closed")
353 bag, units,(t,ty)::other,maxmeta
355 match is_unit_equation context metasenv maxmeta ty with
356 | Some (args,metasenv,newmetas,head,newmeta') ->
358 build_equality bag head args t newmetas in
359 bag, equality::units,other,maxmeta
361 bag, units,(t,ty)::other,maxmeta)
362 (bag,[],[],newmeta) equations
365 let init_cache_and_tables
366 ?dbd ~use_library ~use_context
367 automation_cache restricted_univ (proof, goal)
369 let _, metasenv, subst, _, _, _ = proof in
370 let _,context,_ = CicUtil.lookup_meta goal metasenv in
371 let is_prop m s c t =
373 CicTypeChecker.type_of_aux' m ~subst:s c t CicUniv.oblivion_ugraph
376 CicTypeChecker.type_of_aux' m ~subst:s c ty CicUniv.oblivion_ugraph
378 match CicReduction.whd ~subst c sort with
379 | Cic.Sort Cic.Prop | Cic.Sort (Cic.CProp _) -> true
382 if restricted_univ = [] then
384 if use_context then find_context_theorems context metasenv else []
387 match use_library, dbd with
388 | true, Some dbd -> find_library_theorems dbd metasenv goal
391 let cache = AutoCache.cache_empty in
392 let cache = cache_add_list cache context (ct@lt) in
393 let automation_cache, _ =
395 (fun (c,maxmeta) (t,ty) ->
396 let head, metasenv, args, maxmeta =
397 TermUtil.saturate_term maxmeta metasenv context ty 0
399 if List.exists (is_prop metasenv subst context) args then
402 let st = if args = [] then t else Cic.Appl (t::args) in
403 AutomationCache.add_term_to_active
404 c metasenv [] context st (Some head), maxmeta)
405 (automation_cache,CicMkImplicit.new_meta metasenv subst) ct
407 (* AutomationCache.pp_cache automation_cache; *)
408 automation_cache.AutomationCache.univ,
409 automation_cache.AutomationCache.tables,
412 let metasenv, t_ty, s_t_ty, _ =
414 (fun (metasenv as orig,acc, sacc, maxmeta) t ->
416 CicTypeChecker.type_of_aux'
417 metasenv ~subst:[] context t CicUniv.oblivion_ugraph
419 let head, metasenv, args, maxmeta =
420 TermUtil.saturate_term maxmeta metasenv context ty 0
422 if List.exists (is_prop metasenv subst context) args then
423 orig, (t,ty)::acc, sacc, maxmeta
425 let st = if args = [] then t else Cic.Appl (t::args) in
426 metasenv, (t, ty)::acc, (st,head)::sacc, maxmeta)
427 (metasenv, [],[], CicMkImplicit.new_meta metasenv subst) restricted_univ
429 let automation_cache = AutomationCache.empty () in
430 let automation_cache =
431 let universe = automation_cache.AutomationCache.univ in
433 Universe.index_list universe context t_ty
435 { automation_cache with AutomationCache.univ = universe }
437 let automation_cache =
440 AutomationCache.add_term_to_active c metasenv [] context t (Some ty))
441 automation_cache s_t_ty
443 (* AutomationCache.pp_cache automation_cache; *)
444 automation_cache.AutomationCache.univ,
445 automation_cache.AutomationCache.tables,
446 cache_add_list cache_empty context t_ty
449 (* let signature = MetadataQuery.signature_of metasenv goal in *)
450 (* let newmeta = CicMkImplicit.new_meta metasenv [] in *)
452 retrieve_equations dont_filter (* true *) signature universe cache context metasenv
455 (lazy ("ho trovato equazioni n. "^(string_of_int (List.length equations))));
460 CicTypeChecker.type_of_aux'
461 metasenv context t CicUniv.oblivion_ugraph
463 (* retrieve_equations could also return flexible terms *)
464 if is_an_equality ty then Some(t,ty)
467 let ty' = unfold context ty in
468 if is_an_equality ty' then Some(t,ty') else None
469 with ProofEngineTypes.Fail _ -> None)
472 let bag = Equality.mk_equality_bag () in
473 let units, other_equalities, newmeta =
474 partition_unit_equalities context metasenv newmeta bag eqs_and_types
476 (* SIMPLIFICATION STEP
478 let env = (metasenv, context, CicUniv.oblivion_ugraph) in
479 let eq_uri = HExtlib.unopt (LibraryObjects.eq_URI()) in
480 Saturation.simplify_equalities bag eq_uri env units
483 let passive = Saturation.make_passive units in
484 let no = List.length units in
485 let active = Saturation.make_active [] in
486 let active,passive,newmeta =
487 if paramod then active,passive,newmeta
489 Saturation.pump_actives
490 context bag newmeta active passive (no+1) infinity
492 (active,passive,bag),cache,newmeta
495 let fill_hypothesis context metasenv term tables (universe:Universe.universe) cache auto fast =
496 let actives, passives, bag = tables in
497 let bag, head, metasenv, args =
498 Equality.saturate_term bag metasenv context term
500 let tables = actives, passives, bag in
501 let propositional_args =
505 let _,_,mt = CicUtil.lookup_meta i metasenv in
507 CicTypeChecker.type_of_aux' metasenv context mt
508 CicUniv.oblivion_ugraph
510 if is_propositional context sort then Some i else None
514 let results,cache,tables =
515 if propositional_args = [] then
516 let _,_,bag = tables in
517 let newmetas = Equality.filter_metasenv_gt_maxmeta bag metasenv in
518 [args,metasenv,newmetas,head],cache,tables
522 None,metasenv,term,term (* term non e' significativo *)
526 {AutoTypes.default_flags() with
527 AutoTypes.timeout = Unix.gettimeofday() +. 1.0;
528 maxwidth = 2;maxdepth = 2;
529 use_paramod=true;use_only_paramod=false}
531 {AutoTypes.default_flags() with
532 AutoTypes.timeout = Unix.gettimeofday() +. 1.0;
533 maxwidth = 2;maxdepth = 4;
534 use_paramod=true;use_only_paramod=false}
536 match auto tables universe cache context metasenv propositional_args flags with
537 | [],cache,tables -> raise (FillingFailure (cache,tables))
538 | substs,cache,tables ->
539 let actives, passaives, bag = tables in
542 (fun subst (bag,acc) ->
544 CicMetaSubst.apply_subst_metasenv subst metasenv
546 let head = CicMetaSubst.apply_subst subst head in
547 let newmetas = Equality.filter_metasenv_gt_maxmeta bag metasenv in
548 let args = List.map (CicMetaSubst.apply_subst subst) args in
549 let newm = CicMkImplicit.new_meta metasenv subst in
550 let bag = Equality.push_maxmeta bag newm in
551 bag, ((args,metasenv,newmetas,head) :: acc))
554 let tables = actives, passives, bag in
560 let build_equalities auto context metasenv tables universe cache equations =
562 (fun (tables,facts,cache) (t,ty) ->
563 (* in any case we add the equation to the cache *)
564 let cache = AutoCache.cache_add_list cache context [(t,ty)] in
566 let saturated, cache, tables =
567 fill_hypothesis context metasenv ty tables universe cache auto true
571 (fun (acc, tables) (args,metasenv,newmetas,head) ->
572 let actives, passives, bag = tables in
574 build_equality bag head args t newmetas
576 let tables = actives, passives, bag in
577 equality::acc,tables)
578 ([],tables) saturated
580 (tables, eqs@facts, cache)
581 with FillingFailure (cache,tables) ->
582 (* if filling hypothesis fails we add the equation to
586 (tables,[],cache) equations
588 let close_more tables context status auto universe cache =
589 let proof, goalno = status in
590 let _, metasenv,_subst,_,_, _ = proof in
591 let signature = MetadataQuery.signature_of metasenv goalno in
593 retrieve_equations false signature universe cache context metasenv
599 CicTypeChecker.type_of_aux' metasenv context t
600 CicUniv.oblivion_ugraph in
601 (* retrieve_equations could also return flexible terms *)
602 if is_an_equality ty then Some(t,ty) else None)
604 let tables, units, cache =
605 build_equalities auto context metasenv tables universe cache eqs_and_types
607 let active,passive,bag = tables in
608 let passive = Saturation.add_to_passive units passive in
609 let no = List.length units in
610 let active, passive, bag =
611 Saturation.pump_actives context bag active passive (no+1) infinity
613 (active,passive,bag), cache
616 let find_context_equalities dbd tables context proof (universe:Universe.universe) cache
618 let module C = Cic in
619 let module S = CicSubstitution in
620 let module T = CicTypeChecker in
621 let _,metasenv,_subst,_,_, _ = proof in
622 (* if use_auto is true, we try to close the hypothesis of equational
623 statements using auto; a naif, and probably wrong approach *)
624 let rec aux tables cache index = function
625 | [] -> tables, [], cache
626 | (Some (_, C.Decl (term)))::tl ->
629 (Printf.sprintf "Examining: %d (%s)" index (CicPp.ppterm term)));
630 let do_find tables context term =
632 | C.Prod (name, s, t) when is_an_equality t ->
634 let term = S.lift index term in
635 let saturated, cache, tables =
636 fill_hypothesis context metasenv term
637 tables universe cache default_auto false
639 let actives, passives, bag = tables in
642 (fun (bag,acc) (args,metasenv,newmetas,head) ->
644 build_equality bag head args (Cic.Rel index) newmetas
649 let tables = actives, passives, bag in
651 with FillingFailure (cache,tables) ->
653 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
654 when LibraryObjects.is_eq_URI uri ->
655 let term = S.lift index term in
656 let actives, passives, bag = tables in
658 build_equality bag term [] (Cic.Rel index) []
660 let tables = actives, passives, bag in
662 | _ -> tables, [], cache
664 let tables, eqs, cache = do_find tables context term in
665 let tables, rest, cache = aux tables cache (index+1) tl in
666 tables, List.map (fun x -> index,x) eqs @ rest, cache
668 aux tables cache (index+1) tl
670 let tables, il, cache = aux tables cache 1 context in
671 let indexes, equalities = List.split il in
672 tables, indexes, equalities, cache
675 (********** PARAMETERS PASSING ***************)
677 let bool params name default =
679 let s = List.assoc name params in
680 if s = "" || s = "1" || s = "true" || s = "yes" || s = "on" then true
681 else if s = "0" || s = "false" || s = "no" || s= "off" then false
683 let msg = "Unrecognized value for parameter "^name^"\n" in
684 let msg = msg^"Accepted values are 1,true,yes,on and 0,false,no,off" in
685 raise (ProofEngineTypes.Fail (lazy msg))
686 with Not_found -> default
689 let string params name default =
690 try List.assoc name params with
691 | Not_found -> default
694 let int params name default =
695 try int_of_string (List.assoc name params) with
696 | Not_found -> default
698 raise (ProofEngineTypes.Fail (lazy (name ^ " must be an integer")))
701 let flags_of_params params ?(for_applyS=false) () =
702 let int = int params in
703 let bool = bool params in
704 let close_more = bool "close_more" false in
705 let use_paramod = bool "use_paramod" true in
706 let skip_trie_filtering = bool "skip_trie_filtering" false in
707 let skip_context = bool "skip_context" false in
708 let use_only_paramod =
709 if for_applyS then true else bool "paramodulation" false in
710 let use_library = bool "library"
711 ((AutoTypes.default_flags()).AutoTypes.use_library) in
712 let depth = int "depth" ((AutoTypes.default_flags()).AutoTypes.maxdepth) in
713 let width = int "width" ((AutoTypes.default_flags()).AutoTypes.maxwidth) in
714 let size = int "size" ((AutoTypes.default_flags()).AutoTypes.maxsize) in
715 let gsize = int "gsize" ((AutoTypes.default_flags()).AutoTypes.maxgoalsizefactor) in
716 let do_type = bool "type" false in
717 let timeout = int "timeout" 0 in
718 { AutoTypes.maxdepth =
719 if use_only_paramod then 2 else depth;
720 AutoTypes.maxwidth = width;
721 AutoTypes.maxsize = size;
724 if for_applyS then Unix.gettimeofday () +. 30.0
728 Unix.gettimeofday() +. (float_of_int timeout);
729 AutoTypes.use_library = use_library;
730 AutoTypes.use_paramod = use_paramod;
731 AutoTypes.use_only_paramod = use_only_paramod;
732 AutoTypes.close_more = close_more;
733 AutoTypes.dont_cache_failures = false;
734 AutoTypes.maxgoalsizefactor = gsize;
735 AutoTypes.do_types = do_type;
736 AutoTypes.skip_trie_filtering = skip_trie_filtering;
737 AutoTypes.skip_context = skip_context;
741 let eq_of_goal = function
742 | Cic.Appl [Cic.MutInd(uri,0,_);_;_;_] when LibraryObjects.is_eq_URI uri ->
744 | _ -> raise (ProofEngineTypes.Fail (lazy ("The goal is not an equality ")))
747 (* performs steps of rewrite with the universe, obtaining if possible
749 let solve_rewrite ~automation_cache ~params:(univ,params) (proof,goal)=
750 let steps = int_of_string (string params "steps" "4") in
751 let use_context = bool params "use_context" true in
752 let universe, tables, cache =
753 init_cache_and_tables ~use_library:false ~use_context
754 automation_cache univ (proof,goal)
756 let actives, passives, bag = tables in
757 let pa,metasenv,subst,pb,pc,pd = proof in
758 let _,context,ty = CicUtil.lookup_meta goal metasenv in
759 let metasenv = CicMetaSubst.apply_subst_metasenv subst metasenv in
760 let context = CicMetaSubst.apply_subst_context subst context in
761 let ty = CicMetaSubst.apply_subst subst ty in
762 let eq_uri = eq_of_goal ty in
763 let initgoal = [], metasenv, ty in
765 let equalities = (Saturation.list_of_passive passives) in
766 List.fold_left (fun tbl eq -> Indexing.index tbl eq) (snd actives) equalities
768 let env = metasenv,context,CicUniv.oblivion_ugraph in
769 debug_print (lazy ("demod to solve: " ^ CicPp.ppterm ty));
770 match Indexing.solve_demodulating bag env table initgoal steps with
771 | Some (bag, gproof, metasenv, sub_subst, proof) ->
772 let subst_candidates,extra_infos =
776 if i <> goal && c = context then Some (i,(c,ty)) else None)
779 let proofterm,proto_subst =
780 let proof = Equality.add_subst sub_subst proof in
781 Equality.build_goal_proof
782 bag eq_uri gproof proof ty subst_candidates context metasenv
784 let proofterm = Subst.apply_subst sub_subst proofterm in
787 (fun (i,((c,ty),t)) ->
789 | Cic.Meta (j,_) when i=j -> None
790 | _ -> Some (i,(c,t,ty)))
791 (List.combine subst_candidates
792 (List.combine extra_infos proto_subst))
794 let subst = subst @ extrasubst in
795 let metasenv = CicMetaSubst.apply_subst_metasenv subst metasenv in
796 let proofterm, _, metasenv,subst, _ =
797 CicRefine.type_of metasenv subst context proofterm
798 CicUniv.oblivion_ugraph
800 let status = (pa,metasenv,subst,pb,pc,pd), goal in
801 ProofEngineTypes.apply_tactic
802 (PrimitiveTactics.apply_tac ~term:proofterm) status
805 (ProofEngineTypes.Fail (lazy
806 ("Unable to solve with " ^ string_of_int steps ^ " demodulations")))
809 (* Demodulate thorem *)
810 let open_type ty bo =
811 let rec open_type_aux context ty k args =
813 | Cic.Prod (n,s,t) ->
815 FreshNamesGenerator.mk_fresh_name [] context n ~typ:s ~subst:[] in
816 let entry = match n' with
817 | Cic.Name _ -> Some (n',(Cic.Decl s))
818 | Cic.Anonymous -> None
820 open_type_aux (entry::context) t (k+1) ((Cic.Rel k)::args)
821 | Cic.LetIn (n,s,sty,t) ->
822 let entry = Some (n,(Cic.Def (s,sty)))
824 open_type_aux (entry::context) t (k+1) args
825 | _ -> context, ty, args
827 let context, ty, args = open_type_aux [] ty 1 [] in
829 | [] -> context, ty, bo
830 | _ -> context, ty, Cic.Appl (bo::args)
833 let rec close_type bo ty context =
835 | [] -> assert_proof_is_valid bo [] [] ty; (bo,ty)
836 | Some (n,(Cic.Decl s))::tl ->
837 close_type (Cic.Lambda (n,s,bo)) (Cic.Prod (n,s,ty)) tl
838 | Some (n,(Cic.Def (s,sty)))::tl ->
839 close_type (Cic.LetIn (n,s,sty,bo)) (Cic.LetIn (n,s,sty,ty)) tl
843 let is_subsumed univ context ty =
844 let candidates = Universe.get_candidates univ ty in
848 | Some found -> Some found
852 CicMkImplicit.identity_relocation_list_for_metavariable in
853 let metasenv = [(0,context,ty)] in
855 None,metasenv,[] , (lazy (Cic.Meta(0,mk_irl context))),ty,[]
857 let (_,metasenv,subst,_,_,_), open_goals =
858 ProofEngineTypes.apply_tactic
859 (PrimitiveTactics.apply_tac ~term:cand)
862 let prop_goals, other =
863 split_goals_in_prop metasenv subst open_goals
865 if prop_goals = [] then Some cand else None
867 | ProofEngineTypes.Fail s -> None
868 | CicUnification.Uncertain s -> None
872 let demodulate_theorem ~automation_cache uri =
874 match LibraryObjects.eq_URI () with
876 | None -> raise (ProofEngineTypes.Fail (lazy "equality not declared")) in
877 let obj,_ = CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri
881 | Cic.Constant(n, _, ty ,_, _) -> open_type ty (Cic.Const(uri,[]))
882 | _ -> raise (ProofEngineTypes.Fail (lazy "not a theorem"))
884 if CicUtil.is_closed ty then
885 raise (ProofEngineTypes.Fail (lazy ("closed term: dangerous reduction")));
886 let initgoal = [], [], ty in
887 (* compute the signature *)
889 let ty_set = MetadataConstraints.constants_of ty in
890 let hyp_set = MetadataQuery.signature_of_hypothesis context [] in
891 let set = MetadataConstraints.UriManagerSet.union ty_set hyp_set in
892 MetadataQuery.close_with_types set [] context
894 (* retrieve equations from the universe universe *)
895 (* XXX automation_cache *)
896 let universe = automation_cache.AutomationCache.univ in
898 retrieve_equations true signature universe AutoCache.cache_empty context []
901 (lazy ("ho trovato equazioni n. "^(string_of_int (List.length equations))));
906 CicTypeChecker.type_of_aux' [] context t CicUniv.oblivion_ugraph
908 (* retrieve_equations could also return flexible terms *)
909 if is_an_equality ty then Some(t,ty)
912 let ty' = unfold context ty in
913 if is_an_equality ty' then Some(t,ty') else None
914 with ProofEngineTypes.Fail _ -> None)
917 let bag = Equality.mk_equality_bag () in
919 let bag, units, _, newmeta =
920 partition_unit_equalities context [] (CicMkImplicit.new_meta [] []) bag eqs_and_types
924 (fun tbl eq -> Indexing.index tbl eq)
927 let changed,(newproof,newmetasenv, newty) =
929 ([],context,CicUniv.oblivion_ugraph) table initgoal in
932 let oldproof = Equality.Exact bo in
934 Equality.build_goal_proof (~contextualize:false) (~forward:true) bag
935 eq_uri newproof oldproof ty [] context newmetasenv
937 if newmetasenv <> [] then
938 raise (ProofEngineTypes.Fail (lazy ("metasenv not empty")))
941 assert_proof_is_valid proofterm newmetasenv context newty;
942 match is_subsumed universe context newty with
944 (ProofEngineTypes.Fail (lazy ("subsumed by " ^ CicPp.ppterm t)))
945 | None -> close_type proofterm newty context
948 else (* if newty = ty then *)
949 raise (ProofEngineTypes.Fail (lazy "no progress"))
950 (*else ProofEngineTypes.apply_tactic
951 (ReductionTactics.simpl_tac
952 ~pattern:(ProofEngineTypes.conclusion_pattern None)) initialstatus*)
957 let demodulate ~dbd ~automation_cache ~params:(univ, params) (proof,goal)=
958 let universe, tables, cache =
959 init_cache_and_tables
960 ~dbd ~use_library:false ~use_context:true
961 automation_cache univ (proof,goal)
964 match LibraryObjects.eq_URI () with
966 | None -> raise (ProofEngineTypes.Fail (lazy "equality not declared")) in
967 let active, passive, bag = tables in
968 let curi,metasenv,subst,pbo,pty, attrs = proof in
969 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
970 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
971 let initgoal = [], metasenv, ty in
972 let equalities = (Saturation.list_of_passive passive) in
973 (* we demodulate using both actives passives *)
974 let env = metasenv,context,CicUniv.empty_ugraph in
975 debug_print (lazy ("PASSIVES:" ^ string_of_int(List.length equalities)));
976 List.iter (fun e -> debug_print (lazy (Equality.string_of_equality ~env e)))
980 (fun tbl eq -> Indexing.index tbl eq)
981 (snd active) equalities
983 let changed,(newproof,newmetasenv, newty) =
984 (* Indexing.demodulation_goal bag *)
986 (metasenv,context,CicUniv.oblivion_ugraph) table initgoal
990 let maxm = CicMkImplicit.new_meta metasenv subst in
991 let opengoal = Equality.Exact (Cic.Meta(maxm,irl)) in
992 let subst_candidates = List.map (fun (i,_,_) -> i) metasenv in
993 let subst_candidates = List.filter (fun x-> x <> goal) subst_candidates in
994 let proofterm, proto_subst =
995 Equality.build_goal_proof (~contextualize:false) bag
996 eq_uri newproof opengoal ty subst_candidates context metasenv
998 (* XXX understan what to do with proto subst *)
999 let metasenv = (maxm,context,newty)::metasenv in
1000 let proofterm, _, metasenv, subst, _ =
1001 CicRefine.type_of metasenv subst context proofterm
1002 CicUniv.oblivion_ugraph
1004 let extended_status = (curi,metasenv,subst,pbo,pty, attrs),goal in
1006 ProofEngineTypes.apply_tactic
1007 (PrimitiveTactics.apply_tac ~term:proofterm) extended_status
1012 raise (ProofEngineTypes.Fail (lazy "no progress"))
1015 let demodulate_tac ~dbd ~params:(_,flags as params) ~automation_cache =
1016 ProofEngineTypes.mk_tactic
1018 let all = bool flags "all" false in
1020 solve_rewrite ~params ~automation_cache status
1022 demodulate ~dbd ~params ~automation_cache status)
1024 (***************** applyS *******************)
1027 dbd automation_cache params proof goal newmeta' metasenv' subst
1028 context term' ty termty goal_arity
1030 let consthead,newmetasenv,arguments,_ =
1031 TermUtil.saturate_term newmeta' metasenv' context termty goal_arity in
1033 match arguments with
1035 | _ -> Cic.Appl (term'::arguments)
1038 let rec aux t = function
1040 let t = CicReduction.normalize ~delta:false context t in
1042 | Cic.Appl (hd1::_), Cic.Appl (hd2::_) when hd1 <> hd2 ->
1043 let t = ProofEngineReduction.unfold context t in
1045 | Cic.Appl (hd1'::_) when hd1' = hd2 -> t
1046 | _ -> raise (ProofEngineTypes.Fail (lazy "incompatible head")))
1049 match CicReduction.whd context t with
1050 | Cic.Prod (_,_,tgt) ->
1051 aux (CicSubstitution.subst arg tgt) tl
1054 aux termty arguments
1056 let goal_for_paramod =
1057 match LibraryObjects.eq_URI () with
1059 Cic.Appl [Cic.MutInd (uri,0,[]); Cic.Implicit (Some `Type); consthead; ty]
1060 | None -> raise (ProofEngineTypes.Fail (lazy "No equality defined"))
1063 let goal_for_paramod, _, newmetasenv, subst, _ =
1064 CicRefine.type_of newmetasenv subst context goal_for_paramod
1065 CicUniv.oblivion_ugraph
1067 let newmeta = CicMkImplicit.new_meta newmetasenv subst in
1068 let metasenv_for_paramod = (newmeta,context,goal_for_paramod)::newmetasenv in
1070 let uri,_,_,p,ty, attrs = proof in
1071 uri,metasenv_for_paramod,subst,p,ty, attrs
1073 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
1075 prerr_endline ("------ prima di rewrite su ------ " ^ string_of_int goal);
1076 prerr_endline ("menv:\n"^CicMetaSubst.ppmetasenv [] metasenv_for_paramod);
1077 prerr_endline ("subst:\n"^CicMetaSubst.ppsubst
1078 ~metasenv:(metasenv_for_paramod)
1082 let (proof''',goals) =
1083 ProofEngineTypes.apply_tactic
1084 (EqualityTactics.rewrite_tac ~direction:`RightToLeft
1085 ~pattern:(ProofEngineTypes.conclusion_pattern None)
1086 (Cic.Meta(newmeta,irl)) []) (proof'',goal)
1088 let goal = match goals with [g] -> g | _ -> assert false in
1090 ProofEngineTypes.apply_tactic
1091 (PrimitiveTactics.apply_tac term'')
1096 let (_,m,_,_,_,_ as p) =
1097 let pu,metasenv,subst,proof,px,py = proof'''' in
1098 let metasenv = CicMetaSubst.apply_subst_metasenv subst metasenv in
1099 let proof'''' = pu,metasenv,subst,proof,px,py in
1100 let univ, params = params in
1101 let use_context = bool params "use_context" true in
1102 let universe, (active,passive,bag), cache =
1103 init_cache_and_tables ~use_library:false ~use_context
1104 automation_cache univ (proof'''',newmeta)
1107 Saturation.given_clause bag (proof'''',newmeta) active passive
1110 | None, active, passive, bag ->
1111 raise (ProofEngineTypes.Fail (lazy ("paramod fails")))
1112 | Some(subst',(pu,metasenv,_,proof,px, py),open_goals),active,
1114 assert_subst_are_disjoint subst subst';
1115 let subst = subst@subst' in
1116 pu,metasenv,subst,proof,px,py
1120 let (_,m,_,_,_,_ as p),_ =
1121 solve_rewrite ~params ~automation_cache (proof'''',newmeta)
1126 ProofEngineHelpers.compare_metasenvs ~oldmetasenv:metasenv' ~newmetasenv:m
1130 CicRefine.RefineFailure msg ->
1131 raise (ProofEngineTypes.Fail msg)
1135 ~dbd ~term ~automation_cache ~params (proof, goal)
1137 let module T = CicTypeChecker in
1138 let module R = CicReduction in
1139 let module C = Cic in
1140 let (_,metasenv,subst,_,_, _) = proof in
1141 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
1142 let newmeta = CicMkImplicit.new_meta metasenv subst in
1143 let exp_named_subst_diff,newmeta',newmetasenvfragment,term' =
1145 C.Var (uri,exp_named_subst) ->
1146 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
1147 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
1150 exp_named_subst_diff,newmeta',newmetasenvfragment,
1151 C.Var (uri,exp_named_subst')
1152 | C.Const (uri,exp_named_subst) ->
1153 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
1154 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
1157 exp_named_subst_diff,newmeta',newmetasenvfragment,
1158 C.Const (uri,exp_named_subst')
1159 | C.MutInd (uri,tyno,exp_named_subst) ->
1160 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
1161 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
1164 exp_named_subst_diff,newmeta',newmetasenvfragment,
1165 C.MutInd (uri,tyno,exp_named_subst')
1166 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
1167 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
1168 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
1171 exp_named_subst_diff,newmeta',newmetasenvfragment,
1172 C.MutConstruct (uri,tyno,consno,exp_named_subst')
1173 | _ -> [],newmeta,[],term
1175 let metasenv' = metasenv@newmetasenvfragment in
1177 CicTypeChecker.type_of_aux'
1178 metasenv' ~subst context term' CicUniv.oblivion_ugraph
1180 let termty = CicSubstitution.subst_vars exp_named_subst_diff termty in
1182 let rec count_prods context ty =
1183 match CicReduction.whd ~subst context ty with
1184 | Cic.Prod (n,s,t) -> 1 + count_prods (Some (n,Cic.Decl s)::context) t
1187 count_prods context ty
1189 apply_smart_aux dbd automation_cache params proof goal
1190 newmeta' metasenv' subst context term' ty termty goal_arity
1193 let applyS_tac ~dbd ~term ~params ~automation_cache =
1194 ProofEngineTypes.mk_tactic
1197 apply_smart ~dbd ~term ~params ~automation_cache status
1199 | CicUnification.UnificationFailure msg
1200 | CicTypeChecker.TypeCheckerFailure msg ->
1201 raise (ProofEngineTypes.Fail msg))
1205 (****************** AUTO ********************)
1207 let calculate_timeout flags =
1208 if flags.timeout = 0. then
1209 (debug_print (lazy "AUTO WITH NO TIMEOUT");
1210 {flags with timeout = infinity})
1214 let is_equational_case goalty flags =
1215 let ensure_equational t =
1216 if is_an_equational_goal t then true
1219 (flags.use_paramod && is_an_equational_goal goalty) ||
1220 (flags.use_only_paramod && ensure_equational goalty)
1223 type menv = Cic.metasenv
1224 type subst = Cic.substitution
1225 type goal = ProofEngineTypes.goal * int * AutoTypes.sort
1226 let candidate_no = ref 0;;
1227 type candidate = int * Cic.term Lazy.t
1228 type cache = AutoCache.cache
1231 (* the goal (mainly for depth) and key of the goal *)
1232 goal * AutoCache.cache_key
1234 (* goal has to be proved *)
1236 (* goal has to be cached as a success obtained using candidate as the first
1238 | S of goal * AutoCache.cache_key * candidate * int
1240 (* menv, subst, size, operations done (only S), operations to do, failures to cache if any op fails *)
1241 menv * subst * int * op list * op list * fail list
1243 (* list of computations that may lead to the solution: all op list will
1244 * end with the same (S(g,_)) *)
1247 (* menv, subst, alternatives, tables, cache *)
1248 | Proved of menv * subst * elem list * AutomationCache.tables * cache
1249 | Gaveup of AutomationCache.tables * cache
1252 (* the status exported to the external observer *)
1254 (* context, (goal,candidate) list, and_list, history *)
1255 Cic.context * (int * Cic.term * bool * int * (int * Cic.term Lazy.t) list) list *
1256 (int * Cic.term * int) list * Cic.term Lazy.t list
1259 let rec aux acc = function
1260 | (D g)::tl -> aux (acc@[g]) tl
1266 List.filter (function (_,_,P) -> true | _ -> false) l
1270 let rec aux acc = function
1271 | (D g)::tl -> aux (acc@[g]) tl
1272 | (S _)::tl -> aux acc tl
1278 let calculate_goal_ty (goalno,_,_) s m =
1280 let _,cc,goalty = CicUtil.lookup_meta goalno m in
1281 (* XXX applicare la subst al contesto? *)
1282 Some (cc, CicMetaSubst.apply_subst s goalty)
1283 with CicUtil.Meta_not_found i when i = goalno -> None
1286 let calculate_closed_goal_ty (goalno,_,_) s =
1288 let cc,_,goalty = List.assoc goalno s in
1289 (* XXX applicare la subst al contesto? *)
1290 Some (cc, CicMetaSubst.apply_subst s goalty)
1295 let pp_status ctx status =
1297 let names = Utils.names_of_context ctx in
1300 ProofEngineReduction.replace
1301 ~equality:(fun a b -> match b with Cic.Meta _ -> true | _ -> false)
1302 ~what:[Cic.Rel 1] ~with_what:[Cic.Implicit None] ~where:x
1306 let string_of_do m s (gi,_,_ as g) d =
1307 match calculate_goal_ty g s m with
1308 | Some (_,gty) -> Printf.sprintf "D(%d, %s, %d)" gi (pp gty) d
1309 | None -> Printf.sprintf "D(%d, _, %d)" gi d
1311 let string_of_s m su k (ci,ct) gi =
1312 Printf.sprintf "S(%d, %s, %s, %d)" gi (pp k) (pp (Lazy.force ct)) ci
1314 let string_of_ol m su l =
1318 | D (g,d,s) -> string_of_do m su (g,d,s) d
1319 | S ((gi,_,_),k,c,_) -> string_of_s m su k c gi)
1322 let string_of_fl m s fl =
1324 (List.map (fun ((i,_,_),ty) ->
1325 Printf.sprintf "(%d, %s)" i (pp ty)) fl)
1327 let rec aux = function
1329 | (m,s,_,_,ol,fl)::tl ->
1330 Printf.eprintf "< [%s] ;;; [%s]>\n"
1331 (string_of_ol m s ol) (string_of_fl m s fl);
1334 Printf.eprintf "-------------------------- status -------------------\n";
1336 Printf.eprintf "-----------------------------------------------------\n";
1339 let auto_status = ref [] ;;
1340 let auto_context = ref [];;
1341 let in_pause = ref false;;
1342 let pause b = in_pause := b;;
1343 let cond = Condition.create ();;
1344 let mutex = Mutex.create ();;
1345 let hint = ref None;;
1346 let prune_hint = ref [];;
1348 let step _ = Condition.signal cond;;
1349 let give_hint n = hint := Some n;;
1350 let give_prune_hint hint =
1351 prune_hint := hint :: !prune_hint
1358 Condition.wait cond mutex;
1363 let get_auto_status _ =
1364 let status = !auto_status in
1365 let and_list,elems,last =
1368 | (m,s,_,don,gl,fail)::tl ->
1371 (fun (id,d,_ as g) ->
1372 match calculate_goal_ty g s m with
1373 | Some (_,x) -> Some (id,x,d) | None -> None)
1377 (* these are the S goalsin the or list *)
1380 (fun (m,s,_,don,gl,fail) ->
1382 (function S (g,k,c,_) -> Some (g,k,c) | _ -> None)
1383 (List.rev don @ gl))
1386 (* this function eats id from a list l::[id,x] returning x, l *)
1387 let eat_tail_if_eq id l =
1388 let rec aux (s, l) = function
1390 | ((id1,_,_),k1,c)::tl when id = id1 ->
1392 | None -> aux (Some c,l) tl
1393 | Some _ -> assert false)
1394 | ((id1,_,_),k1,c as e)::tl -> aux (s, e::l) tl
1396 let c, l = aux (None, []) l in
1399 let eat_in_parallel id l =
1400 let rec aux (b,eaten, new_l as acc) l =
1404 match eat_tail_if_eq id l with
1405 | None, l -> aux (b@[false], eaten, new_l@[l]) tl
1406 | Some t,l -> aux (b@[true],eaten@[t], new_l@[l]) tl
1410 let rec eat_all rows l =
1414 match List.rev elem with
1415 | ((to_eat,depth,_),k,_)::next_lunch ->
1416 let b, eaten, l = eat_in_parallel to_eat l in
1417 let eaten = HExtlib.list_uniq eaten in
1418 let eaten = List.rev eaten in
1419 let b = true (* List.hd (List.rev b) *) in
1420 let rows = rows @ [to_eat,k,b,depth,eaten] in
1422 | [] -> eat_all rows or_list
1424 eat_all [] (List.rev orlist)
1428 (function (S (_,_,(_,c),_)) -> Some c | _ -> None)
1431 (* let rows = List.filter (fun (_,l) -> l <> []) rows in *)
1432 and_list, rows, history
1434 !auto_context, elems, and_list, last
1437 (* Works if there is no dependency over proofs *)
1438 let is_a_green_cut goalty =
1439 CicUtil.is_meta_closed goalty
1441 let rec first_s = function
1442 | (D _)::tl -> first_s tl
1443 | (S (g,k,c,s))::tl -> Some ((g,k,c,s),tl)
1446 let list_union l1 l2 =
1447 (* TODO ottimizzare compare *)
1448 HExtlib.list_uniq (List.sort compare (l1 @ l1))
1450 let rec eq_todo l1 l2 =
1452 | (D g1) :: tl1,(D g2) :: tl2 when g1=g2 -> eq_todo tl1 tl2
1453 | (S (g1,k1,(c1,lt1),i1)) :: tl1, (S (g2,k2,(c2,lt2),i2)) :: tl2
1454 when i1 = i2 && g1 = g2 && k1 = k2 && c1 = c2 ->
1455 if Lazy.force lt1 = Lazy.force lt2 then eq_todo tl1 tl2 else false
1459 let eat_head todo id fl orlist =
1460 let rec aux acc = function
1462 | (m, s, _, _, todo1, fl1)::tl as orlist ->
1463 let rec aux1 todo1 =
1464 match first_s todo1 with
1465 | None -> orlist, acc
1466 | Some (((gno,_,_),_,_,_), todo11) ->
1467 (* TODO confronto tra todo da ottimizzare *)
1468 if gno = id && eq_todo todo11 todo then
1469 aux (list_union fl1 acc) tl
1477 let close_proof p ty menv context =
1479 List.map fst (CicUtil.metas_of_term p @ CicUtil.metas_of_term ty)
1481 let menv = List.filter (fun (i,_,_) -> List.exists ((=)i) metas) menv in
1482 naif_closure p menv context
1484 (* XXX capire bene quando aggiungere alla cache *)
1485 let add_to_cache_and_del_from_orlist_if_green_cut
1486 g s m cache key todo orlist fl ctx size minsize
1488 let cache = cache_remove_underinspection cache key in
1489 (* prima per fare la irl usavamo il contesto vero e proprio e non quello
1491 match calculate_closed_goal_ty g s with
1492 | None -> assert false
1493 | Some (canonical_ctx , gty) ->
1494 let goalno,depth,sort = g in
1495 let irl = mk_irl canonical_ctx in
1496 let goal = Cic.Meta(goalno, irl) in
1497 let proof = CicMetaSubst.apply_subst s goal in
1498 let green_proof, closed_proof =
1499 let b = is_a_green_cut proof in
1501 b, (* close_proof proof gty m ctx *) proof
1505 debug_print (lazy ("TENTATIVE CACHE: " ^ CicPp.ppterm key));
1506 if is_a_green_cut key then
1507 (* if the initia goal was closed, we cut alternatives *)
1508 let _ = debug_print (lazy ("MANGIO: " ^ string_of_int goalno)) in
1509 let orlist, fl = eat_head todo goalno fl orlist in
1511 if size < minsize then
1512 (debug_print (lazy ("NO CACHE: 2 (size <= minsize)"));cache)
1514 (* if the proof is closed we cache it *)
1515 if green_proof then cache_add_success cache key proof
1516 else (* cache_add_success cache key closed_proof *)
1517 (debug_print (lazy ("NO CACHE: (no gree proof)"));cache)
1519 cache, orlist, fl, true
1522 debug_print (lazy ("TENTATIVE CACHE: " ^ CicPp.ppterm gty));
1523 if size < minsize then
1524 (debug_print (lazy ("NO CACHE: (size <= minsize)")); cache) else
1525 (* if the substituted goal and the proof are closed we cache it *)
1526 if is_a_green_cut gty then
1527 if green_proof then cache_add_success cache gty proof
1528 else (* cache_add_success cache gty closed_proof *)
1529 (debug_print (lazy ("NO CACHE: (no green proof (gty))"));cache)
1533 CicTypeChecker.type_of_aux' ~subst:s
1534 m ctx closed_proof CicUniv.oblivion_ugraph
1536 if is_a_green_cut ty then
1537 cache_add_success cache ty closed_proof
1540 | CicTypeChecker.TypeCheckerFailure _ ->*)
1541 (debug_print (lazy ("NO CACHE: (no green gty )"));cache)
1543 cache, orlist, fl, false
1545 let close_failures (fl : fail list) (cache : cache) =
1547 (fun cache ((gno,depth,_),gty) ->
1548 if CicUtil.is_meta_closed gty then
1549 ( debug_print (lazy ("FAIL: INDUCED: " ^ string_of_int gno));
1550 cache_add_failure cache gty depth)
1555 let put_in_subst subst metasenv (goalno,_,_) canonical_ctx t ty =
1556 let entry = goalno, (canonical_ctx, t,ty) in
1557 assert_subst_are_disjoint subst [entry];
1558 let subst = entry :: subst in
1560 let metasenv = CicMetaSubst.apply_subst_metasenv subst metasenv in
1565 let mk_fake_proof metasenv subst (goalno,_,_) goalty context =
1566 None,metasenv,subst ,(lazy (Cic.Meta(goalno,mk_irl context))),goalty, []
1570 tables cache depth fake_proof goalno goalty subst context
1573 let active,passive,bag = tables in
1574 let ppterm = ppterm context in
1575 let status = (fake_proof,goalno) in
1576 if flags.use_only_paramod then
1578 debug_print (lazy ("PARAMODULATION SU: " ^
1579 string_of_int goalno ^ " " ^ ppterm goalty ));
1580 let goal_steps, saturation_steps, timeout =
1581 max_int,max_int,flags.timeout
1584 Saturation.given_clause bag status active passive
1585 goal_steps saturation_steps timeout
1587 | None, active, passive, bag ->
1588 [], (active,passive,bag), cache, flags
1589 | Some(subst',(_,metasenv,_subst,proof,_, _),open_goals),active,
1591 assert_subst_are_disjoint subst subst';
1592 let subst = subst@subst' in
1594 order_new_goals metasenv subst open_goals ppterm
1597 List.map (fun (x,sort) -> x,depth-1,sort) open_goals
1600 [(!candidate_no,proof),metasenv,subst,open_goals],
1601 (active,passive,bag), cache, flags
1605 debug_print (lazy ("NARROWING DEL GOAL: " ^
1606 string_of_int goalno ^ " " ^ ppterm goalty ));
1607 let goal_steps, saturation_steps, timeout =
1611 Saturation.given_clause bag status active passive
1612 goal_steps saturation_steps timeout
1614 | None, active, passive, bag ->
1615 [], (active,passive,bag), cache, flags
1616 | Some(subst',(_,metasenv,_subst,proof,_, _),open_goals),active,
1618 assert_subst_are_disjoint subst subst';
1619 let subst = subst@subst' in
1621 order_new_goals metasenv subst open_goals ppterm
1624 List.map (fun (x,sort) -> x,depth-1,sort) open_goals
1627 [(!candidate_no,proof),metasenv,subst,open_goals],
1628 (active,passive,bag), cache, flags
1632 let params = ([],["use_context","false"]) in
1633 let automation_cache = {
1634 AutomationCache.tables = tables ;
1635 AutomationCache.univ = Universe.empty; }
1638 let ((_,metasenv,subst,_,_,_),open_goals) =
1640 solve_rewrite ~params ~automation_cache
1641 (fake_proof, goalno)
1643 let proof = lazy (Cic.Meta (-1,[])) in
1644 [(!candidate_no,proof),metasenv,subst,[]],tables, cache, flags
1645 with ProofEngineTypes.Fail _ -> [], tables, cache, flags
1647 let res = Saturation.all_subsumed bag status active passive in
1650 (fun (subst',(_,metasenv,_subst,proof,_, _),open_goals) ->
1651 assert_subst_are_disjoint subst subst';
1652 let subst = subst@subst' in
1654 order_new_goals metasenv subst open_goals ppterm
1657 List.map (fun (x,sort) -> x,depth-1,sort) open_goals
1660 (!candidate_no,proof),metasenv,subst,open_goals)
1663 res', (active,passive,bag), cache, flags
1669 let sort_new_elems =
1670 List.sort (fun (_,_,_,l1) (_,_,_,l2) ->
1671 let p1 = List.length (prop_only l1) in
1672 let p2 = List.length (prop_only l2) in
1673 if p1 = p2 then List.length l1 - List.length l2 else p1-p2)
1677 let try_candidate dbd
1678 goalty tables subst fake_proof goalno depth context cand
1680 let ppterm = ppterm context in
1682 let actives, passives, bag = tables in
1683 let (_,metasenv,subst,_,_,_), open_goals =
1684 ProofEngineTypes.apply_tactic
1685 (PrimitiveTactics.apply_tac ~term:cand)
1688 let tables = actives, passives,
1689 Equality.push_maxmeta bag
1690 (max (Equality.maxmeta bag) (CicMkImplicit.new_meta metasenv subst))
1692 debug_print (lazy (" OK: " ^ ppterm cand));
1693 let metasenv = CicRefine.pack_coercion_metasenv metasenv in
1694 let open_goals = order_new_goals metasenv subst open_goals ppterm in
1695 let open_goals = List.map (fun (x,sort) -> x,depth-1,sort) open_goals in
1697 Some ((!candidate_no,lazy cand),metasenv,subst,open_goals), tables
1699 | ProofEngineTypes.Fail s -> None,tables
1700 | CicUnification.Uncertain s -> None,tables
1703 let applicative_case dbd
1704 tables depth subst fake_proof goalno goalty metasenv context universe
1709 | Cic.Appl (hd::tl) ->
1710 Cic.Appl (hd :: HExtlib.mk_list (Cic.Meta (0,[])) (List.length tl))
1714 get_candidates flags.skip_trie_filtering universe cache goalty_aux
1718 (fun (tables,elems) cand ->
1720 try_candidate dbd goalty
1721 tables subst fake_proof goalno depth context cand
1723 | None, tables -> tables, elems
1724 | Some x, tables -> tables, x::elems)
1725 (tables,[]) candidates
1727 let elems = sort_new_elems elems in
1728 elems, tables, cache
1731 let try_smart_candidate dbd
1732 goalty tables subst fake_proof goalno depth context cand
1734 let ppterm = ppterm context in
1736 let params = ([],[]) in
1737 let automation_cache = {
1738 AutomationCache.tables = tables ;
1739 AutomationCache.univ = Universe.empty; }
1741 debug_print (lazy ("candidato per " ^ string_of_int goalno
1742 ^ ": " ^ CicPp.ppterm cand));
1744 let (_,metasenv,subst,_,_,_) = fake_proof in
1745 prerr_endline ("metasenv:\n" ^ CicMetaSubst.ppmetasenv [] metasenv);
1746 prerr_endline ("subst:\n" ^ CicMetaSubst.ppsubst ~metasenv subst);
1748 let ((_,metasenv,subst,_,_,_),open_goals) =
1749 apply_smart ~dbd ~term:cand ~params ~automation_cache
1750 (fake_proof, goalno)
1752 let metasenv = CicRefine.pack_coercion_metasenv metasenv in
1753 let open_goals = order_new_goals metasenv subst open_goals ppterm in
1754 let open_goals = List.map (fun (x,sort) -> x,depth-1,sort) open_goals in
1756 Some ((!candidate_no,lazy cand),metasenv,subst,open_goals), tables
1758 | ProofEngineTypes.Fail s -> None,tables
1759 | CicUnification.Uncertain s -> None,tables
1762 let smart_applicative_case dbd
1763 tables depth subst fake_proof goalno goalty metasenv context universe
1766 let signature = MetadataQuery.signature_of metasenv goalno in
1769 | Cic.Appl (hd::tl) ->
1770 Cic.Appl (hd :: HExtlib.mk_list (Cic.Meta (0,[])) (List.length tl))
1773 let smart_candidates =
1774 get_candidates flags.skip_trie_filtering universe cache goalty_aux
1777 get_candidates flags.skip_trie_filtering universe cache goalty
1779 let smart_candidates =
1781 (fun x -> not(List.mem x candidates)) smart_candidates
1783 let candidates = List.filter (only signature context metasenv) candidates in
1784 let smart_candidates =
1785 List.filter (only signature context metasenv) smart_candidates
1788 let penalty cand depth =
1789 if only signature context metasenv cand then depth else ((prerr_endline (
1790 "penalizzo " ^ CicPp.ppterm cand));depth -1)
1795 (fun (tables,elems) cand ->
1797 try_candidate dbd goalty
1798 tables subst fake_proof goalno depth context cand
1801 (* if normal application fails we try to be smart *)
1802 (match try_smart_candidate dbd goalty
1803 tables subst fake_proof goalno depth context cand
1805 | None, tables -> tables, elems
1806 | Some x, tables -> tables, x::elems)
1807 | Some x, tables -> tables, x::elems)
1808 (tables,[]) candidates
1810 let tables, smart_elems =
1812 (fun (tables,elems) cand ->
1814 try_smart_candidate dbd goalty
1815 tables subst fake_proof goalno depth context cand
1817 | None, tables -> tables, elems
1818 | Some x, tables -> tables, x::elems)
1819 (tables,[]) smart_candidates
1821 let elems = sort_new_elems (elems @ smart_elems) in
1822 elems, tables, cache
1825 let equational_and_applicative_case dbd
1826 universe flags m s g gty tables cache context
1828 let goalno, depth, sort = g in
1829 let fake_proof = mk_fake_proof m s g gty context in
1830 if is_equational_case gty flags then
1831 let elems,tables,cache, flags =
1832 equational_case tables cache
1833 depth fake_proof goalno gty s context flags
1835 let more_elems, tables, cache =
1836 if flags.use_only_paramod then
1839 applicative_case dbd
1840 tables depth s fake_proof goalno
1841 gty m context universe cache flags
1843 elems@more_elems, tables, cache, flags
1845 let elems, tables, cache =
1846 match LibraryObjects.eq_URI () with
1848 smart_applicative_case dbd tables depth s fake_proof goalno
1849 gty m context universe cache flags
1851 applicative_case dbd tables depth s fake_proof goalno
1852 gty m context universe cache flags
1854 elems, tables, cache, flags
1856 let rec condition_for_hint i = function
1858 | S (_,_,(j,_),_):: tl -> j <> i (* && condition_for_hint i tl *)
1859 | _::tl -> condition_for_hint i tl
1861 let remove_s_from_fl (id,_,_) (fl : fail list) =
1862 let rec aux = function
1864 | ((id1,_,_),_)::tl when id = id1 -> tl
1865 | hd::tl -> hd :: aux tl
1870 let prunable_for_size flags s m todo =
1871 let rec aux b = function
1872 | (S _)::tl -> aux b tl
1873 | (D (_,_,T))::tl -> aux b tl
1875 (match calculate_goal_ty g s m with
1877 | Some (canonical_ctx, gty) ->
1879 Utils.weight_of_term
1880 ~consider_metas:false ~count_metas_occurrences:true gty in
1881 let newb = b || gsize > flags.maxgoalsizefactor in
1888 let prunable ty todo =
1889 let rec aux b = function
1890 | (S(_,k,_,_))::tl -> aux (b || Equality.meta_convertibility k ty) tl
1891 | (D (_,_,T))::tl -> aux b tl
1899 let prunable menv subst ty todo =
1900 let rec aux = function
1901 | (S(_,k,_,_))::tl ->
1902 (match Equality.meta_convertibility_subst k ty menv with
1905 no_progress variant tl (* || aux tl*))
1906 | (D (_,_,T))::tl -> aux tl
1908 and no_progress variant = function
1909 | [] -> (*prerr_endline "++++++++++++++++++++++++ no_progress";*) true
1910 | D ((n,_,P) as g)::tl ->
1911 (match calculate_goal_ty g subst menv with
1912 | None -> no_progress variant tl
1914 (match calculate_goal_ty g variant menv with
1915 | None -> assert false
1917 if gty = gty' then no_progress variant tl
1919 (prerr_endline (string_of_int n);
1920 prerr_endline (CicPp.ppterm gty);
1921 prerr_endline (CicPp.ppterm gty');
1922 prerr_endline "---------- subst";
1923 prerr_endline (CicMetaSubst.ppsubst ~metasenv:menv subst);
1924 prerr_endline "---------- variant";
1925 prerr_endline (CicMetaSubst.ppsubst ~metasenv:menv variant);
1926 prerr_endline "---------- menv";
1927 prerr_endline (CicMetaSubst.ppmetasenv [] menv);
1928 no_progress variant tl) *)
1930 | _::tl -> no_progress variant tl
1935 let condition_for_prune_hint prune (m, s, size, don, todo, fl) =
1937 HExtlib.filter_map (function S (_,_,(c,_),_) -> Some c | _ -> None) todo
1939 List.for_all (fun i -> List.for_all (fun j -> i<>j) prune) s
1941 let filter_prune_hint c l =
1942 let prune = !prune_hint in
1943 prune_hint := []; (* possible race... *)
1944 if prune = [] then c,l
1946 cache_reset_underinspection c,
1947 List.filter (condition_for_prune_hint prune) l
1949 let auto_main dbd tables context flags universe cache elems =
1950 auto_context := context;
1951 let rec aux tables flags cache (elems : status) =
1952 pp_status context elems;
1953 (* DEBUGGING CODE: uncomment these two lines to stop execution at each iteration
1954 auto_status := elems;
1957 let cache, elems = filter_prune_hint cache elems in
1959 | (m, s, size, don, todo, fl)::orlist when !hint <> None ->
1960 debug_print (lazy "skip");
1962 | Some i when condition_for_hint i todo ->
1963 aux tables flags cache orlist
1966 aux tables flags cache elems)
1968 (* complete failure *)
1969 debug_print (lazy "give up");
1970 Gaveup (tables, cache)
1971 | (m, s, _, _, [],_)::orlist ->
1972 (* complete success *)
1973 debug_print (lazy "success");
1974 Proved (m, s, orlist, tables, cache)
1975 | (m, s, size, don, (D (_,_,T))::todo, fl)::orlist
1976 when not flags.AutoTypes.do_types ->
1977 (* skip since not Prop, don't even check if closed by side-effect *)
1978 debug_print (lazy "skip existential goal");
1979 aux tables flags cache ((m, s, size, don, todo, fl)::orlist)
1980 | (m, s, size, don, (S(g, key, c,minsize) as op)::todo, fl)::orlist ->
1981 (* partial success, cache g and go on *)
1982 let cache, orlist, fl, sibling_pruned =
1983 add_to_cache_and_del_from_orlist_if_green_cut
1984 g s m cache key todo orlist fl context size minsize
1986 debug_print (lazy (AutoCache.cache_print context cache));
1987 let fl = remove_s_from_fl g fl in
1988 let don = if sibling_pruned then don else op::don in
1989 aux tables flags cache ((m, s, size, don, todo, fl)::orlist)
1990 | (m, s, size, don, todo, fl)::orlist
1991 when List.length(prop_only (d_goals todo)) > flags.maxwidth ->
1992 debug_print (lazy ("FAIL: WIDTH"));
1993 (* too many goals in and generated by last th *)
1994 let cache = close_failures fl cache in
1995 aux tables flags cache orlist
1996 | (m, s, size, don, todo, fl)::orlist when size > flags.maxsize ->
1998 (lazy ("FAIL: SIZE: "^string_of_int size ^
1999 " > " ^ string_of_int flags.maxsize ));
2000 (* we already have a too large proof term *)
2001 let cache = close_failures fl cache in
2002 aux tables flags cache orlist
2003 | _ when Unix.gettimeofday () > flags.timeout ->
2005 debug_print (lazy ("FAIL: TIMEOUT"));
2006 Gaveup (tables, cache)
2007 | (m, s, size, don, (D (gno,depth,_ as g))::todo, fl)::orlist as status ->
2009 debug_print (lazy "attack goal");
2010 match calculate_goal_ty g s m with
2012 (* closed by side effect *)
2013 debug_print (lazy ("SUCCESS: SIDE EFFECT: " ^ string_of_int gno));
2014 aux tables flags cache ((m,s,size,don,todo, fl)::orlist)
2015 | Some (canonical_ctx, gty) ->
2017 Utils.weight_of_term ~consider_metas:false ~count_metas_occurrences:true gty
2019 if gsize > flags.maxgoalsizefactor then
2020 (debug_print (lazy ("FAIL: SIZE: goal: "^string_of_int gsize));
2021 aux tables flags cache orlist)
2022 else if prunable_for_size flags s m todo then
2023 (debug_print (lazy ("POTO at depth: "^(string_of_int depth)));
2024 aux tables flags cache orlist)
2026 (* still to be proved *)
2027 (debug_print (lazy ("EXAMINE: "^CicPp.ppterm gty));
2028 match cache_examine cache gty with
2029 | Failed_in d when d >= depth ->
2031 debug_print (lazy ("FAIL: DEPTH (cache): "^string_of_int gno));
2032 let cache = close_failures fl cache in
2033 aux tables flags cache orlist
2034 | UnderInspection ->
2036 debug_print (lazy ("FAIL: LOOP: " ^ string_of_int gno));
2037 let cache = close_failures fl cache in
2038 aux tables flags cache orlist
2040 debug_print (lazy ("SUCCESS: CACHE HIT: " ^ string_of_int gno));
2041 let s, m = put_in_subst s m g canonical_ctx t gty in
2042 aux tables flags cache ((m, s, size, don,todo, fl)::orlist)
2044 | Failed_in _ when depth > 0 ->
2045 ( (* more depth or is the first time we see the goal *)
2046 if prunable m s gty todo then
2048 "FAIL: LOOP: one father is equal"));
2049 aux tables flags cache orlist)
2051 let cache = cache_add_underinspection cache gty depth in
2052 auto_status := status;
2055 (lazy ("INSPECTING: " ^
2056 string_of_int gno ^ "("^ string_of_int size ^ "): "^
2058 (* elems are possible computations for proving gty *)
2059 let elems, tables, cache, flags =
2060 equational_and_applicative_case dbd
2061 universe flags m s g gty tables cache context
2064 (* this goal has failed *)
2065 let cache = close_failures ((g,gty)::fl) cache in
2066 aux tables flags cache orlist
2068 (* elems = (cand,m,s,gl) *)
2069 let size_gl l = List.length
2070 (List.filter (function (_,_,P) -> true | _ -> false) l)
2073 let inj_gl gl = List.map (fun g -> D g) gl in
2074 let rec map = function
2075 | [] -> assert false
2076 | (cand,m,s,gl)::[] ->
2077 (* in the last one we add the failure *)
2079 inj_gl gl @ (S(g,gty,cand,size+1))::todo
2081 (* we are the last in OR, we fail on g and
2082 * also on all failures implied by g *)
2083 (m,s, size + size_gl gl, don, todo, (g,gty)::fl)
2085 | (cand,m,s,gl)::tl ->
2086 (* we add the S step after gl and before todo *)
2088 inj_gl gl @ (S(g,gty,cand,size+1))::todo
2090 (* since we are not the last in OR, we do not
2092 (m,s, size + size_gl gl, don, todo, []) :: map tl
2096 aux tables flags cache elems)
2099 debug_print (lazy ("FAIL: DEPTH: " ^ string_of_int gno));
2100 let cache = close_failures fl cache in
2101 aux tables flags cache orlist)
2103 (aux tables flags cache elems : auto_result)
2108 auto_all_solutions dbd tables universe cache context metasenv gl flags
2110 let goals = order_new_goals metasenv [] gl CicPp.ppterm in
2113 (fun (x,s) -> D (x,flags.maxdepth,s)) goals
2115 let elems = [metasenv,[],1,[],goals,[]] in
2116 let rec aux tables solutions cache elems flags =
2117 match auto_main dbd tables context flags universe cache elems with
2118 | Gaveup (tables,cache) ->
2119 solutions,cache, tables
2120 | Proved (metasenv,subst,others,tables,cache) ->
2121 if Unix.gettimeofday () > flags.timeout then
2122 ((subst,metasenv)::solutions), cache, tables
2124 aux tables ((subst,metasenv)::solutions) cache others flags
2126 let rc = aux tables [] cache elems flags in
2128 | [],cache,tables -> [],cache,tables
2129 | solutions, cache,tables ->
2132 (fun (subst,newmetasenv) ->
2134 ProofEngineHelpers.compare_metasenvs ~oldmetasenv:metasenv ~newmetasenv
2136 if opened = [] then Some subst else None)
2139 solutions,cache,tables
2142 (******************* AUTO ***************)
2144 let auto dbd flags metasenv tables universe cache context metasenv gl =
2145 let initial_time = Unix.gettimeofday() in
2146 let goals = order_new_goals metasenv [] gl CicPp.ppterm in
2147 let goals = List.map (fun (x,s) -> D(x,flags.maxdepth,s)) goals in
2148 let elems = [metasenv,[],1,[],goals,[]] in
2149 match auto_main dbd tables context flags universe cache elems with
2150 | Proved (metasenv,subst,_, tables,cache) ->
2152 ("TIME:"^string_of_float(Unix.gettimeofday()-.initial_time)));
2153 Some (subst,metasenv), cache
2154 | Gaveup (tables,cache) ->
2156 ("TIME:"^string_of_float(Unix.gettimeofday()-.initial_time)));
2160 let auto_tac ~(dbd:HSql.dbd) ~params:(univ,params) ~automation_cache (proof, goal) =
2161 let flags = flags_of_params params () in
2162 let use_library = flags.use_library in
2163 let universe, tables, cache =
2164 init_cache_and_tables
2165 ~dbd ~use_library ~use_context:(not flags.skip_context)
2166 automation_cache univ (proof, goal)
2168 let _,metasenv,subst,_,_, _ = proof in
2169 let _,context,goalty = CicUtil.lookup_meta goal metasenv in
2171 if flags.close_more then
2173 tables context (proof, goal)
2174 (auto_all_solutions dbd) universe cache
2175 else tables,cache in
2176 let initial_time = Unix.gettimeofday() in
2177 let (_,oldmetasenv,_,_,_, _) = proof in
2180 metasenv,subst,1,[],[D (goal,flags.maxdepth,P)],[]
2182 match auto_main dbd tables context flags universe cache [elem] with
2183 | Proved (metasenv,subst,_, tables,cache) ->
2185 ("TIME:"^string_of_float(Unix.gettimeofday()-.initial_time)));
2186 let proof,metasenv =
2187 ProofEngineHelpers.subst_meta_and_metasenv_in_proof
2188 proof goal subst metasenv
2191 ProofEngineHelpers.compare_metasenvs ~oldmetasenv
2192 ~newmetasenv:metasenv
2195 | Gaveup (tables,cache) ->
2198 string_of_float(Unix.gettimeofday()-.initial_time)));
2199 raise (ProofEngineTypes.Fail (lazy "Auto gave up"))
2202 let auto_tac ~dbd ~params ~automation_cache =
2203 ProofEngineTypes.mk_tactic (auto_tac ~params ~dbd ~automation_cache);;
2205 let pp_proofterm = Equality.pp_proofterm;;
2207 let revision = "$Revision$";;
2208 let size_and_depth context metasenv t = 100, 100