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);;
33 let is_propositional context sort =
34 match CicReduction.whd context sort with
36 | Cic.Sort (Cic.CProp _) -> true
41 type auto_params = Cic.term list * (string * string) list
45 (* closing a term w.r.t. its metavariables
46 very naif version: it does not take dependencies properly into account *)
48 let naif_closure ?(prefix_name="xxx_") t metasenv context =
49 let metasenv = ProofEngineHelpers.sort_metasenv metasenv in
50 let n = List.length metasenv in
51 let what = List.map (fun (i,cc,ty) -> Cic.Meta(i,[])) metasenv in
54 (fun (i,acc) (_,cc,ty) -> (i-1,Cic.Rel i::acc))
57 let t = CicSubstitution.lift n t in
59 ProofEngineReduction.replace_lifting
60 ~equality:(fun c t1 t2 ->
62 | Cic.Meta(i,_),Cic.Meta(j,_) -> i = j
64 ~context ~what ~with_what ~where:t
68 (fun (n,t) (_,cc,ty) ->
69 n-1, Cic.Lambda(Cic.Name (prefix_name^string_of_int n),
70 CicSubstitution.lift n ty,t))
76 let lambda_close ?prefix_name t menv ctx =
77 let t = naif_closure ?prefix_name t menv ctx in
79 (fun (t,i) -> function
80 | None -> CicSubstitution.subst (Cic.Implicit None) t,i (* delift *)
81 | Some (name, Cic.Decl ty) -> Cic.Lambda (name, ty, t),i+1
82 | Some (name, Cic.Def (bo, ty)) -> Cic.LetIn (name, bo, ty, t),i+1)
83 (t,List.length menv) ctx
86 (* functions for retrieving theorems *)
88 exception FillingFailure of AutoCache.cache * int
90 let rec unfold context = function
91 | Cic.Prod(name,s,t) ->
92 let t' = unfold ((Some (name,Cic.Decl s))::context) t in
94 | t -> ProofEngineReduction.unfold context t
96 let find_library_theorems dbd proof goal =
97 let univ = MetadataQuery.universe_of_goal ~dbd false proof goal in
98 let terms = List.map CicUtil.term_of_uri univ in
101 (t,fst(CicTypeChecker.type_of_aux' [] [] t CicUniv.oblivion_ugraph)))
104 let find_context_theorems context metasenv =
107 (fun (res,i) ctxentry ->
109 | Some (_,Cic.Decl t) ->
110 (Cic.Rel i, CicSubstitution.lift i t)::res,i+1
111 | Some (_,Cic.Def (_,t)) ->
112 (Cic.Rel i, CicSubstitution.lift i t)::res,i+1
117 let rec is_an_equality = function
118 | Cic.Appl [Cic.MutInd (uri, _, _); _; _; _]
119 when (LibraryObjects.is_eq_URI uri) -> true
120 | Cic.Prod (_, _, t) -> is_an_equality t
124 let partition_equalities =
125 List.partition (fun (_,ty) -> is_an_equality ty)
128 let default_auto maxm _ _ cache _ _ _ _ = [],cache,maxm ;;
131 let is_unit_equation context metasenv oldnewmeta term =
132 let head, metasenv, args, newmeta =
133 TermUtil.saturate_term oldnewmeta metasenv context term 0
135 let propositional_args =
139 let _,_,mt = CicUtil.lookup_meta i metasenv in
141 CicTypeChecker.type_of_aux' metasenv context mt
142 CicUniv.oblivion_ugraph
144 if is_propositional context sort then Some i else None
148 if propositional_args = [] then
150 List.filter (fun (i,_,_) -> i >= oldnewmeta) metasenv
152 Some (args,metasenv,newmetas,head,newmeta)
156 let get_candidates universe cache t =
158 (Universe.get_candidates universe t)@(AutoCache.get_candidates cache t)
161 (lazy ("candidates for " ^ (CicPp.ppterm t) ^ " = " ^
162 (String.concat "\n" (List.map CicPp.ppterm candidates)))) in
163 debug_print debug_msg;
167 let only signature context metasenv t =
170 CicTypeChecker.type_of_aux' metasenv context t CicUniv.oblivion_ugraph
172 let consts = MetadataConstraints.constants_of ty in
173 let b = MetadataConstraints.UriManagerSet.subset consts signature in
176 let ty' = unfold context ty in
177 let consts' = MetadataConstraints.constants_of ty' in
178 MetadataConstraints.UriManagerSet.subset consts' signature
180 | CicTypeChecker.TypeCheckerFailure _ -> assert false
181 | ProofEngineTypes.Fail _ -> false (* unfold may fail *)
184 let not_default_eq_term t =
186 let uri = CicUtil.uri_of_term t in
187 not (LibraryObjects.in_eq_URIs uri)
188 with Invalid_argument _ -> true
190 let retrieve_equations dont_filter signature universe cache context metasenv =
191 match LibraryObjects.eq_URI() with
194 let eq_uri = UriManager.strip_xpointer eq_uri in
195 let fake= Cic.Meta(-1,[]) in
196 let fake_eq = Cic.Appl [Cic.MutInd (eq_uri,0, []);fake;fake;fake] in
197 let candidates = get_candidates universe cache fake_eq in
198 if dont_filter then candidates
200 let candidates = List.filter not_default_eq_term candidates in
201 List.filter (only signature context metasenv) candidates
203 let build_equality bag head args proof newmetas maxmeta =
205 | Cic.Appl [Cic.MutInd (uri, _, _); ty; t1; t2] ->
207 if args = [] then proof else Cic.Appl (proof::args)
209 let o = !Utils.compare_terms t1 t2 in
210 let stat = (ty,t1,t2,o) in
211 (* let w = compute_equality_weight stat in *)
213 let proof = Equality.Exact p in
214 let e = Equality.mk_equality bag (w, proof, stat, newmetas) in
215 (* to clean the local context of metas *)
216 Equality.fix_metas bag maxmeta e
220 let partition_unit_equalities context metasenv newmeta bag equations =
222 (fun (units,other,maxmeta)(t,ty) ->
223 if not (CicUtil.is_meta_closed t && CicUtil.is_meta_closed ty) then
226 ("Skipping " ^ CicMetaSubst.ppterm_in_context ~metasenv [] t context
227 ^ " since it is not meta closed")
229 units,(t,ty)::other,maxmeta
231 match is_unit_equation context metasenv maxmeta ty with
232 | Some (args,metasenv,newmetas,head,newmeta') ->
233 let maxmeta,equality =
234 build_equality bag head args t newmetas newmeta' in
235 equality::units,other,maxmeta
237 units,(t,ty)::other,maxmeta)
238 ([],[],newmeta) equations
241 (Saturation.make_active [],
242 Saturation.make_passive [],
243 Equality.mk_equality_bag)
245 let init_cache_and_tables
246 ?dbd use_library paramod use_context dont_filter universe (proof, goal)
248 (* the local cache in initially empty *)
249 let cache = AutoCache.cache_empty in
250 let _, metasenv, _subst,_, _, _ = proof in
251 let signature = MetadataQuery.signature_of metasenv goal in
252 let newmeta = CicMkImplicit.new_meta metasenv [] in
253 let _,context,_ = CicUtil.lookup_meta goal metasenv in
254 let ct = if use_context then find_context_theorems context metasenv else [] in
256 (lazy ("ho trovato nel contesto " ^ (string_of_int (List.length ct))));
258 match use_library, dbd with
259 | true, Some dbd -> find_library_theorems dbd metasenv goal
263 (lazy ("ho trovato nella libreria " ^ (string_of_int (List.length lt))));
264 let cache = cache_add_list cache context (ct@lt) in
266 retrieve_equations dont_filter signature universe cache context metasenv
269 (lazy ("ho trovato equazioni n. "^(string_of_int (List.length equations))));
274 CicTypeChecker.type_of_aux'
275 metasenv context t CicUniv.oblivion_ugraph
277 (* retrieve_equations could also return flexible terms *)
278 if is_an_equality ty then Some(t,ty)
281 let ty' = unfold context ty in
282 if is_an_equality ty' then Some(t,ty') else None
283 with ProofEngineTypes.Fail _ -> None)
286 let bag = Equality.mk_equality_bag () in
287 let units, other_equalities, newmeta =
288 partition_unit_equalities context metasenv newmeta bag eqs_and_types
290 (* SIMPLIFICATION STEP
292 let env = (metasenv, context, CicUniv.oblivion_ugraph) in
293 let eq_uri = HExtlib.unopt (LibraryObjects.eq_URI()) in
294 Saturation.simplify_equalities bag eq_uri env units
297 let passive = Saturation.make_passive units in
298 let no = List.length units in
299 let active = Saturation.make_active [] in
300 let active,passive,newmeta =
301 if paramod then active,passive,newmeta
303 Saturation.pump_actives
304 context bag newmeta active passive (no+1) infinity
306 (active,passive,bag),cache,newmeta
308 let fill_hypothesis context metasenv oldnewmeta term tables (universe:Universe.universe) cache auto fast =
309 let head, metasenv, args, newmeta =
310 TermUtil.saturate_term oldnewmeta metasenv context term 0
312 let propositional_args =
316 let _,_,mt = CicUtil.lookup_meta i metasenv in
318 CicTypeChecker.type_of_aux' metasenv context mt
319 CicUniv.oblivion_ugraph
321 if is_propositional context sort then Some i else None
325 let results,cache,newmeta =
326 if propositional_args = [] then
327 let newmetas = List.filter (fun (i,_,_) -> i >= oldnewmeta) metasenv in
328 [args,metasenv,newmetas,head,newmeta],cache,newmeta
332 None,metasenv,term,term (* term non e' significativo *)
336 {AutoTypes.default_flags() with
337 AutoTypes.timeout = Unix.gettimeofday() +. 1.0;
338 maxwidth = 2;maxdepth = 2;
339 use_paramod=true;use_only_paramod=false}
341 {AutoTypes.default_flags() with
342 AutoTypes.timeout = Unix.gettimeofday() +. 1.0;
343 maxwidth = 2;maxdepth = 4;
344 use_paramod=true;use_only_paramod=false}
346 match auto newmeta tables universe cache context metasenv propositional_args flags with
347 | [],cache,newmeta -> raise (FillingFailure (cache,newmeta))
348 | substs,cache,newmeta ->
352 CicMetaSubst.apply_subst_metasenv subst metasenv
354 let head = CicMetaSubst.apply_subst subst head in
356 List.filter (fun (i,_,_) ->i >= oldnewmeta) metasenv
358 let args = List.map (CicMetaSubst.apply_subst subst) args in
359 let newm = CicMkImplicit.new_meta metasenv subst in
360 args,metasenv,newmetas,head,max newm newmeta)
361 substs, cache, newmeta
363 results,cache,newmeta
365 let build_equalities auto context metasenv tables universe cache newmeta equations =
367 (fun (facts,cache,newmeta) (t,ty) ->
368 (* in any case we add the equation to the cache *)
369 let cache = AutoCache.cache_add_list cache context [(t,ty)] in
371 let saturated,cache,newmeta =
372 fill_hypothesis context metasenv newmeta ty tables universe cache auto true
374 let (active,passive,bag) = tables in
375 let eqs,bag,newmeta =
377 (fun (acc,bag,newmeta) (args,metasenv,newmetas,head,newmeta') ->
378 let maxmeta,equality =
379 build_equality bag head args t newmetas newmeta'
381 equality::acc,bag,maxmeta)
382 ([],bag,newmeta) saturated
384 (eqs@facts, cache, newmeta)
385 with FillingFailure (cache,newmeta) ->
386 (* if filling hypothesis fails we add the equation to
388 (facts,cache,newmeta)
390 ([],cache,newmeta) equations
392 let close_more tables maxmeta context status auto universe cache =
393 let (active,passive,bag) = tables in
394 let proof, goalno = status in
395 let _, metasenv,_subst,_,_, _ = proof in
396 let signature = MetadataQuery.signature_of metasenv goalno in
398 retrieve_equations false signature universe cache context metasenv
404 CicTypeChecker.type_of_aux' metasenv context t
405 CicUniv.oblivion_ugraph in
406 (* retrieve_equations could also return flexible terms *)
407 if is_an_equality ty then Some(t,ty) else None)
409 let units, cache, maxm =
410 build_equalities auto context metasenv tables universe cache maxmeta eqs_and_types in
411 debug_print (lazy (">>>>>>> gained from a new context saturation >>>>>>>>>" ^
412 string_of_int maxm));
414 (fun e -> debug_print (lazy (Equality.string_of_equality e)))
416 debug_print (lazy ">>>>>>>>>>>>>>>>>>>>>>");
417 let passive = Saturation.add_to_passive units passive in
418 let no = List.length units in
419 debug_print (lazy ("No = " ^ (string_of_int no)));
420 let active,passive,newmeta =
421 Saturation.pump_actives context bag maxm active passive (no+1) infinity
423 (active,passive,bag),cache,newmeta
425 let find_context_equalities
426 maxmeta bag context proof (universe:Universe.universe) cache
428 let module C = Cic in
429 let module S = CicSubstitution in
430 let module T = CicTypeChecker in
431 let _,metasenv,_subst,_,_, _ = proof in
432 let newmeta = max (ProofEngineHelpers.new_meta_of_proof ~proof) maxmeta in
433 (* if use_auto is true, we try to close the hypothesis of equational
434 statements using auto; a naif, and probably wrong approach *)
435 let rec aux cache index newmeta = function
436 | [] -> [], newmeta,cache
437 | (Some (_, C.Decl (term)))::tl ->
440 (Printf.sprintf "Examining: %d (%s)" index (CicPp.ppterm term)));
441 let do_find context term =
443 | C.Prod (name, s, t) when is_an_equality t ->
446 let term = S.lift index term in
447 let saturated,cache,newmeta =
448 fill_hypothesis context metasenv newmeta term
449 empty_tables universe cache default_auto false
453 (fun (acc,newmeta) (args,metasenv,newmetas,head,newmeta') ->
454 let newmeta, equality =
456 bag head args (Cic.Rel index) newmetas (max newmeta newmeta')
458 equality::acc, newmeta + 1)
459 ([],newmeta) saturated
462 with FillingFailure (cache,newmeta) ->
464 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
465 when LibraryObjects.is_eq_URI uri ->
466 let term = S.lift index term in
468 build_equality bag term [] (Cic.Rel index) [] newmeta
470 [e], (newmeta+1),cache
471 | _ -> [], newmeta, cache
473 let eqs, newmeta, cache = do_find context term in
474 let rest, newmeta,cache = aux cache (index+1) newmeta tl in
475 List.map (fun x -> index,x) eqs @ rest, newmeta, cache
477 aux cache (index+1) newmeta tl
479 let il, maxm, cache =
480 aux cache 1 newmeta context
482 let indexes, equalities = List.split il in
483 indexes, equalities, maxm, cache
486 (********** PARAMETERS PASSING ***************)
488 let bool params name default =
490 let s = List.assoc name params in
491 if s = "" || s = "1" || s = "true" || s = "yes" || s = "on" then true
492 else if s = "0" || s = "false" || s = "no" || s= "off" then false
494 let msg = "Unrecognized value for parameter "^name^"\n" in
495 let msg = msg^"Accepted values are 1,true,yes,on and 0,false,no,off" in
496 raise (ProofEngineTypes.Fail (lazy msg))
497 with Not_found -> default
500 let string params name default =
501 try List.assoc name params with
502 | Not_found -> default
505 let int params name default =
506 try int_of_string (List.assoc name params) with
507 | Not_found -> default
509 raise (ProofEngineTypes.Fail (lazy (name ^ " must be an integer")))
512 let flags_of_params params ?(for_applyS=false) () =
513 let int = int params in
514 let bool = bool params in
515 let close_more = bool "close_more" false in
516 let use_paramod = bool "use_paramod" true in
517 let use_only_paramod =
518 if for_applyS then true else bool "paramodulation" false in
519 let use_library = bool "library"
520 ((AutoTypes.default_flags()).AutoTypes.use_library) in
521 let depth = int "depth" ((AutoTypes.default_flags()).AutoTypes.maxdepth) in
522 let width = int "width" ((AutoTypes.default_flags()).AutoTypes.maxwidth) in
523 let size = int "size" ((AutoTypes.default_flags()).AutoTypes.maxsize) in
524 let gsize = int "gsize" ((AutoTypes.default_flags()).AutoTypes.maxgoalsizefactor) in
525 let do_type = bool "type" false in
526 let timeout = int "timeout" 0 in
527 { AutoTypes.maxdepth =
528 if use_only_paramod then 2 else depth;
529 AutoTypes.maxwidth = width;
530 AutoTypes.maxsize = size;
533 if for_applyS then Unix.gettimeofday () +. 30.0
537 Unix.gettimeofday() +. (float_of_int timeout);
538 AutoTypes.use_library = use_library;
539 AutoTypes.use_paramod = use_paramod;
540 AutoTypes.use_only_paramod = use_only_paramod;
541 AutoTypes.close_more = close_more;
542 AutoTypes.dont_cache_failures = false;
543 AutoTypes.maxgoalsizefactor = gsize;
544 AutoTypes.do_types = do_type;
547 let universe_of_params metasenv context universe tl =
548 if tl = [] then universe else
552 fst (CicTypeChecker.type_of_aux' metasenv context term
553 CicUniv.oblivion_ugraph))
556 Universe.index_list Universe.empty context (List.combine tl tys)
560 (***************** applyS *******************)
562 let new_metasenv_and_unify_and_t
563 dbd flags universe proof goal ?tables newmeta' metasenv'
564 context term' ty termty goal_arity
566 let (consthead,newmetasenv,arguments,_) =
567 TermUtil.saturate_term newmeta' metasenv' context termty goal_arity in
569 match arguments with [] -> term' | _ -> Cic.Appl (term'::arguments)
571 let proof',oldmetasenv =
572 let (puri,metasenv,_subst,pbo,pty, attrs) = proof in
573 (puri,newmetasenv,_subst,pbo,pty, attrs),metasenv
575 let goal_for_paramod =
576 match LibraryObjects.eq_URI () with
578 Cic.Appl [Cic.MutInd (uri,0,[]); Cic.Sort Cic.Prop; consthead; ty]
579 | None -> raise (ProofEngineTypes.Fail (lazy "No equality defined"))
581 let newmeta = CicMkImplicit.new_meta newmetasenv (*subst*) [] in
582 let metasenv_for_paramod = (newmeta,context,goal_for_paramod)::newmetasenv in
584 let uri,_,_subst,p,ty, attrs = proof' in
585 uri,metasenv_for_paramod,_subst,p,ty, attrs
587 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
589 ProofEngineTypes.apply_tactic
590 (EqualityTactics.rewrite_tac ~direction:`RightToLeft
591 ~pattern:(ProofEngineTypes.conclusion_pattern None)
592 (Cic.Meta(newmeta,irl)) [])
595 let goal = match goals with [g] -> g | _ -> assert false in
597 ProofEngineTypes.apply_tactic
598 (PrimitiveTactics.apply_tac term'')
602 let (active, passive,bag), cache, maxmeta =
603 init_cache_and_tables ~dbd flags.use_library true true false universe
606 Saturation.given_clause bag maxmeta (proof'''',newmeta) active passive
607 max_int max_int flags.timeout
610 raise (ProofEngineTypes.Fail (lazy ("FIXME: propaga le tabelle")))
611 | Some (_,proof''''',_), active,passive,_ ->
613 ProofEngineHelpers.compare_metasenvs ~oldmetasenv
614 ~newmetasenv:(let _,m,_subst,_,_, _ = proof''''' in m), active, passive
617 let rec count_prods context ty =
618 match CicReduction.whd context ty with
619 Cic.Prod (n,s,t) -> 1 + count_prods (Some (n,Cic.Decl s)::context) t
623 ~dbd ~term ~subst ~universe ?tables ~params:(univ,params) (proof, goal)
625 let module T = CicTypeChecker in
626 let module R = CicReduction in
627 let module C = Cic in
628 let (_,metasenv,_subst,_,_, _) = proof in
629 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
630 let flags = flags_of_params params ~for_applyS:true () in
631 let universe = universe_of_params metasenv context universe univ in
632 let newmeta = CicMkImplicit.new_meta metasenv subst in
633 let exp_named_subst_diff,newmeta',newmetasenvfragment,term' =
635 C.Var (uri,exp_named_subst) ->
636 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
637 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
640 exp_named_subst_diff,newmeta',newmetasenvfragment,
641 C.Var (uri,exp_named_subst')
642 | C.Const (uri,exp_named_subst) ->
643 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
644 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
647 exp_named_subst_diff,newmeta',newmetasenvfragment,
648 C.Const (uri,exp_named_subst')
649 | C.MutInd (uri,tyno,exp_named_subst) ->
650 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
651 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
654 exp_named_subst_diff,newmeta',newmetasenvfragment,
655 C.MutInd (uri,tyno,exp_named_subst')
656 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
657 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
658 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
661 exp_named_subst_diff,newmeta',newmetasenvfragment,
662 C.MutConstruct (uri,tyno,consno,exp_named_subst')
663 | _ -> [],newmeta,[],term
665 let metasenv' = metasenv@newmetasenvfragment in
667 CicTypeChecker.type_of_aux' metasenv' context term' CicUniv.oblivion_ugraph
669 let termty = CicSubstitution.subst_vars exp_named_subst_diff termty in
670 let goal_arity = count_prods context ty in
671 let proof, gl, active, passive =
672 new_metasenv_and_unify_and_t dbd flags universe proof goal ?tables
673 newmeta' metasenv' context term' ty termty goal_arity
675 proof, gl, active, passive
678 (****************** AUTO ********************)
680 let mk_irl ctx = CicMkImplicit.identity_relocation_list_for_metavariable ctx;;
681 let ugraph = CicUniv.oblivion_ugraph;;
682 let typeof = CicTypeChecker.type_of_aux';;
684 let names = List.map (function None -> None | Some (x,_) -> Some x) ctx in
687 let is_in_prop context subst metasenv ty =
688 let sort,u = typeof ~subst metasenv context ty CicUniv.oblivion_ugraph in
689 is_propositional context sort
692 let assert_proof_is_valid proof metasenv context goalty =
695 let ty,u = typeof metasenv context proof CicUniv.oblivion_ugraph in
696 let b,_ = CicReduction.are_convertible context ty goalty u in
700 List.map (function None -> None | Some (x,_) -> Some x) context
702 debug_print (lazy ("PROOF:" ^ CicPp.pp proof names));
703 debug_print (lazy ("PROOFTY:" ^ CicPp.pp ty names));
704 debug_print (lazy ("GOAL:" ^ CicPp.pp goalty names));
705 debug_print (lazy ("MENV:" ^ CicMetaSubst.ppmetasenv [] metasenv));
712 let assert_subst_are_disjoint subst subst' =
715 (fun (i,_) -> List.for_all (fun (j,_) -> i<>j) subst')
720 let split_goals_in_prop metasenv subst gl =
723 let _,context,ty = CicUtil.lookup_meta g metasenv in
725 let sort,u = typeof ~subst metasenv context ty ugraph in
726 is_propositional context sort
728 | CicTypeChecker.AssertFailure s
729 | CicTypeChecker.TypeCheckerFailure s ->
731 (lazy ("NON TIPA" ^ ppterm context (CicMetaSubst.apply_subst subst ty)));
734 (* FIXME... they should type! *)
738 let split_goals_with_metas metasenv subst gl =
741 let _,context,ty = CicUtil.lookup_meta g metasenv in
742 let ty = CicMetaSubst.apply_subst subst ty in
743 CicUtil.is_meta_closed ty)
747 let order_new_goals metasenv subst open_goals ppterm =
748 let prop,rest = split_goals_in_prop metasenv subst open_goals in
749 let closed_prop, open_prop = split_goals_with_metas metasenv subst prop in
750 let closed_type, open_type = split_goals_with_metas metasenv subst rest in
752 (List.map (fun x -> x,P) (open_prop @ closed_prop))
754 (List.map (fun x -> x,T) (open_type @ closed_type))
759 let _,_,ty = CicUtil.lookup_meta i metasenv in i,ty,sort) open_goals
761 debug_print (lazy (" OPEN: "^
765 | (i,t,P) -> string_of_int i ^ ":"^ppterm t^ "Prop"
766 | (i,t,T) -> string_of_int i ^ ":"^ppterm t^ "Type")
771 let is_an_equational_goal = function
772 | Cic.Appl [Cic.MutInd(u,_,_);_;_;_] when LibraryObjects.is_eq_URI u -> true
777 let prop = function (_,depth,P) -> depth < 9 | _ -> false;;
780 let calculate_timeout flags =
781 if flags.timeout = 0. then
782 (debug_print (lazy "AUTO WITH NO TIMEOUT");
783 {flags with timeout = infinity})
787 let is_equational_case goalty flags =
788 let ensure_equational t =
789 if is_an_equational_goal t then true
792 let msg="Not an equational goal.\nYou cant use the paramodulation flag"in
793 raise (ProofEngineTypes.Fail (lazy msg))
796 (flags.use_paramod && is_an_equational_goal goalty) ||
797 (flags.use_only_paramod && ensure_equational goalty)
800 let cache_add_success sort cache k v =
801 if sort = P then cache_add_success cache k v else cache_remove_underinspection
806 type menv = Cic.metasenv
807 type subst = Cic.substitution
808 type goal = ProofEngineTypes.goal * int * AutoTypes.sort
809 let candidate_no = ref 0;;
810 type candidate = int * Cic.term
811 type cache = AutoCache.cache
813 Saturation.active_table * Saturation.passive_table * Equality.equality_bag
816 (* the goal (mainly for depth) and key of the goal *)
817 goal * AutoCache.cache_key
819 (* goal has to be proved *)
821 (* goal has to be cached as a success obtained using candidate as the first
823 | S of goal * AutoCache.cache_key * candidate * int
825 (* menv, subst, size, operations done (only S), operations to do, failures to cache if any op fails *)
826 menv * subst * int * op list * op list * fail list
828 (* list of computations that may lead to the solution: all op list will
829 * end with the same (S(g,_)) *)
832 (* menv, subst, alternatives, tables, cache, maxmeta *)
833 | Proved of menv * subst * elem list * tables * cache * int
834 | Gaveup of tables * cache * int
837 (* the status exported to the external observer *)
839 (* context, (goal,candidate) list, and_list, history *)
840 Cic.context * (int * Cic.term * bool * int * (int * Cic.term) list) list *
841 (int * Cic.term * int) list * Cic.term list
844 let rec aux acc = function
845 | (D g)::tl -> aux (acc@[g]) tl
851 List.filter (function (_,_,P) -> true | _ -> false) l
855 let rec aux acc = function
856 | (D g)::tl -> aux (acc@[g]) tl
857 | (S _)::tl -> aux acc tl
862 let calculate_goal_ty (goalno,_,_) s m =
864 let _,cc,goalty = CicUtil.lookup_meta goalno m in
865 (* XXX applicare la subst al contesto? *)
866 Some (cc, CicMetaSubst.apply_subst s goalty)
867 with CicUtil.Meta_not_found i when i = goalno -> None
869 let calculate_closed_goal_ty (goalno,_,_) s =
871 let cc,_,goalty = List.assoc goalno s in
872 (* XXX applicare la subst al contesto? *)
873 Some (cc, CicMetaSubst.apply_subst s goalty)
874 with Not_found -> None
876 let pp_status ctx status =
878 let names = Utils.names_of_context ctx in
881 ProofEngineReduction.replace
882 ~equality:(fun a b -> match b with Cic.Meta _ -> true | _ -> false)
883 ~what:[Cic.Rel 1] ~with_what:[Cic.Implicit None] ~where:x
887 let string_of_do m s (gi,_,_ as g) d =
888 match calculate_goal_ty g s m with
889 | Some (_,gty) -> Printf.sprintf "D(%d, %s, %d)" gi (pp gty) d
890 | None -> Printf.sprintf "D(%d, _, %d)" gi d
892 let string_of_s m su k (ci,ct) gi =
893 Printf.sprintf "S(%d, %s, %s, %d)" gi (pp k) (pp ct) ci
895 let string_of_ol m su l =
899 | D (g,d,s) -> string_of_do m su (g,d,s) d
900 | S ((gi,_,_),k,c,_) -> string_of_s m su k c gi)
903 let string_of_fl m s fl =
905 (List.map (fun ((i,_,_),ty) ->
906 Printf.sprintf "(%d, %s)" i (pp ty)) fl)
908 let rec aux = function
910 | (m,s,_,_,ol,fl)::tl ->
911 Printf.eprintf "< [%s] ;;; [%s]>\n"
912 (string_of_ol m s ol) (string_of_fl m s fl);
915 Printf.eprintf "-------------------------- status -------------------\n";
917 Printf.eprintf "-----------------------------------------------------\n";
920 let auto_status = ref [] ;;
921 let auto_context = ref [];;
922 let in_pause = ref false;;
923 let pause b = in_pause := b;;
924 let cond = Condition.create ();;
925 let mutex = Mutex.create ();;
926 let hint = ref None;;
927 let prune_hint = ref [];;
929 let step _ = Condition.signal cond;;
930 let give_hint n = hint := Some n;;
931 let give_prune_hint hint =
932 prune_hint := hint :: !prune_hint
939 Condition.wait cond mutex;
944 let get_auto_status _ =
945 let status = !auto_status in
946 let and_list,elems,last =
949 | (m,s,_,don,gl,fail)::tl ->
952 (fun (id,d,_ as g) ->
953 match calculate_goal_ty g s m with
954 | Some (_,x) -> Some (id,x,d) | None -> None)
958 (* these are the S goalsin the or list *)
961 (fun (m,s,_,don,gl,fail) ->
963 (function S (g,k,c,_) -> Some (g,k,c) | _ -> None)
967 (* this function eats id from a list l::[id,x] returning x, l *)
968 let eat_tail_if_eq id l =
969 let rec aux (s, l) = function
971 | ((id1,_,_),k1,c)::tl when id = id1 ->
973 | None -> aux (Some c,l) tl
974 | Some _ -> assert false)
975 | ((id1,_,_),k1,c as e)::tl -> aux (s, e::l) tl
977 let c, l = aux (None, []) l in
980 let eat_in_parallel id l =
981 let rec aux (b,eaten, new_l as acc) l =
985 match eat_tail_if_eq id l with
986 | None, l -> aux (b@[false], eaten, new_l@[l]) tl
987 | Some t,l -> aux (b@[true],eaten@[t], new_l@[l]) tl
991 let rec eat_all rows l =
995 match List.rev elem with
996 | ((to_eat,depth,_),k,_)::next_lunch ->
997 let b, eaten, l = eat_in_parallel to_eat l in
998 let eaten = HExtlib.list_uniq eaten in
999 let eaten = List.rev eaten in
1000 let b = true (* List.hd (List.rev b) *) in
1001 let rows = rows @ [to_eat,k,b,depth,eaten] in
1003 | [] -> eat_all rows or_list
1005 eat_all [] (List.rev orlist)
1009 (function (S (_,_,(_,c),_)) -> Some c | _ -> None)
1012 (* let rows = List.filter (fun (_,l) -> l <> []) rows in *)
1013 and_list, rows, history
1015 !auto_context, elems, and_list, last
1018 (* Works if there is no dependency over proofs *)
1019 let is_a_green_cut goalty =
1020 CicUtil.is_meta_closed goalty
1022 let rec first_s = function
1023 | (D _)::tl -> first_s tl
1024 | (S (g,k,c,s))::tl -> Some ((g,k,c,s),tl)
1027 let list_union l1 l2 =
1028 (* TODO ottimizzare compare *)
1029 HExtlib.list_uniq (List.sort compare (l1 @ l1))
1031 let eat_head todo id fl orlist =
1032 let rec aux acc = function
1034 | (m, s, _, _, todo1, fl1)::tl as orlist ->
1035 let rec aux1 todo1 =
1036 match first_s todo1 with
1037 | None -> orlist, acc
1038 | Some (((gno,_,_),_,_,_), todo11) ->
1039 (* TODO confronto tra todo da ottimizzare *)
1040 if gno = id && todo11 = todo then
1041 aux (list_union fl1 acc) tl
1049 let close_proof p ty menv context =
1051 List.map fst (CicUtil.metas_of_term p @ CicUtil.metas_of_term ty)
1053 let menv = List.filter (fun (i,_,_) -> List.exists ((=)i) metas) menv in
1054 naif_closure p menv context
1056 (* XXX capire bene quando aggiungere alla cache *)
1057 let add_to_cache_and_del_from_orlist_if_green_cut
1058 g s m cache key todo orlist fl ctx size minsize
1060 let cache = cache_remove_underinspection cache key in
1061 (* prima per fare la irl usavamo il contesto vero e proprio e non quello
1063 match calculate_closed_goal_ty g s with
1064 | None -> assert false
1065 | Some (canonical_ctx , gty) ->
1066 let goalno,depth,sort = g in
1067 let irl = mk_irl canonical_ctx in
1068 let goal = Cic.Meta(goalno, irl) in
1069 let proof = CicMetaSubst.apply_subst s goal in
1070 let green_proof, closed_proof =
1071 let b = is_a_green_cut proof in
1073 b, (* close_proof proof gty m ctx *) proof
1077 debug_print (lazy ("TENTATIVE CACHE: " ^ CicPp.ppterm key));
1078 if is_a_green_cut key then
1079 (* if the initia goal was closed, we cut alternatives *)
1080 let _ = debug_print (lazy ("MANGIO: " ^ string_of_int goalno)) in
1081 let orlist, fl = eat_head todo goalno fl orlist in
1083 if size < minsize then
1084 (debug_print (lazy ("NO CACHE: 2 (size <= minsize)"));cache)
1086 (* if the proof is closed we cache it *)
1087 if green_proof then cache_add_success cache key proof
1088 else (* cache_add_success cache key closed_proof *)
1089 (debug_print (lazy ("NO CACHE: (no gree proof)"));cache)
1091 cache, orlist, fl, true
1094 debug_print (lazy ("TENTATIVE CACHE: " ^ CicPp.ppterm gty));
1095 if size < minsize then
1096 (debug_print (lazy ("NO CACHE: (size <= minsize)")); cache) else
1097 (* if the substituted goal and the proof are closed we cache it *)
1098 if is_a_green_cut gty then
1099 if green_proof then cache_add_success cache gty proof
1100 else (* cache_add_success cache gty closed_proof *)
1101 (debug_print (lazy ("NO CACHE: (no green proof (gty))"));cache)
1105 CicTypeChecker.type_of_aux' ~subst:s
1106 m ctx closed_proof CicUniv.oblivion_ugraph
1108 if is_a_green_cut ty then
1109 cache_add_success cache ty closed_proof
1112 | CicTypeChecker.TypeCheckerFailure _ ->*)
1113 (debug_print (lazy ("NO CACHE: (no green gty )"));cache)
1115 cache, orlist, fl, false
1117 let close_failures (fl : fail list) (cache : cache) =
1119 (fun cache ((gno,depth,_),gty) ->
1120 debug_print (lazy ("FAIL: INDUCED: " ^ string_of_int gno));
1121 cache_add_failure cache gty depth)
1124 let put_in_subst subst metasenv (goalno,_,_) canonical_ctx t ty =
1125 let entry = goalno, (canonical_ctx, t,ty) in
1126 assert_subst_are_disjoint subst [entry];
1127 let subst = entry :: subst in
1128 let metasenv = CicMetaSubst.apply_subst_metasenv subst metasenv in
1131 let mk_fake_proof metasenv subst (goalno,_,_) goalty context =
1132 None,metasenv,subst ,Cic.Meta(goalno,mk_irl context),goalty, []
1135 tables maxm cache depth fake_proof goalno goalty subst context
1138 let active,passive,bag = tables in
1139 let ppterm = ppterm context in
1140 let status = (fake_proof,goalno) in
1141 if flags.use_only_paramod then
1143 debug_print (lazy ("PARAMODULATION SU: " ^
1144 string_of_int goalno ^ " " ^ ppterm goalty ));
1145 let goal_steps, saturation_steps, timeout =
1146 max_int,max_int,flags.timeout
1149 Saturation.given_clause bag maxm status active passive
1150 goal_steps saturation_steps timeout
1152 | None, active, passive, maxmeta ->
1153 [], (active,passive,bag), cache, maxmeta, flags
1154 | Some(subst',(_,metasenv,_subst,proof,_, _),open_goals),active,
1156 assert_subst_are_disjoint subst subst';
1157 let subst = subst@subst' in
1159 order_new_goals metasenv subst open_goals ppterm
1162 List.map (fun (x,sort) -> x,depth-1,sort) open_goals
1165 [(!candidate_no,proof),metasenv,subst,open_goals],
1166 (active,passive,bag),
1167 cache, maxmeta, flags
1173 ("SUBSUMPTION SU: " ^ string_of_int goalno ^ " " ^ ppterm goalty));
1175 Saturation.all_subsumed bag maxm status active passive
1177 assert (maxmeta >= maxm);
1180 (fun (subst',(_,metasenv,_subst,proof,_, _),open_goals) ->
1181 assert_subst_are_disjoint subst subst';
1182 let subst = subst@subst' in
1184 order_new_goals metasenv subst open_goals ppterm
1187 List.map (fun (x,sort) -> x,depth-1,sort) open_goals
1190 (!candidate_no,proof),metasenv,subst,open_goals)
1193 res', (active,passive,bag), cache, maxmeta, flags
1198 goalty tables maxm subst fake_proof goalno depth context cand
1200 let ppterm = ppterm context in
1202 let subst,((_,metasenv,_,_,_,_), open_goals),maxmeta =
1203 (PrimitiveTactics.apply_with_subst ~subst ~maxmeta:maxm ~term:cand)
1206 debug_print (lazy (" OK: " ^ ppterm cand));
1207 let metasenv = CicRefine.pack_coercion_metasenv metasenv in
1208 let open_goals = order_new_goals metasenv subst open_goals ppterm in
1209 let open_goals = List.map (fun (x,sort) -> x,depth-1,sort) open_goals in
1211 Some ((!candidate_no,cand),metasenv,subst,open_goals), tables , maxmeta
1213 | ProofEngineTypes.Fail s -> None,tables, maxm
1214 | CicUnification.Uncertain s -> None,tables, maxm
1217 let sort_new_elems =
1218 List.sort (fun (_,_,_,l1) (_,_,_,l2) ->
1219 List.length (prop_only l1) - List.length (prop_only l2))
1222 let applicative_case
1223 tables maxm depth subst fake_proof goalno goalty metasenv context universe
1226 let candidates = get_candidates universe cache goalty in
1227 let tables, elems, maxm =
1229 (fun (tables,elems,maxm) cand ->
1231 try_candidate goalty
1232 tables maxm subst fake_proof goalno depth context cand
1234 | None, tables,maxm -> tables,elems, maxm
1235 | Some x, tables, maxm -> tables,x::elems, maxm)
1236 (tables,[],maxm) candidates
1238 let elems = sort_new_elems elems in
1239 elems, tables, cache, maxm
1242 let equational_and_applicative_case
1243 universe flags m s g gty tables cache maxm context
1245 let goalno, depth, sort = g in
1246 let fake_proof = mk_fake_proof m s g gty context in
1247 if is_equational_case gty flags then
1248 let elems,tables,cache,maxm1, flags =
1249 equational_case tables maxm cache
1250 depth fake_proof goalno gty s context flags
1253 let more_elems, tables, cache, maxm1 =
1254 if flags.use_only_paramod then
1255 [],tables, cache, maxm
1258 tables maxm depth s fake_proof goalno
1259 gty m context universe cache
1262 elems@more_elems, tables, cache, maxm, flags
1264 let elems, tables, cache, maxm =
1265 applicative_case tables maxm depth s fake_proof goalno
1266 gty m context universe cache
1268 elems, tables, cache, maxm, flags
1270 let rec condition_for_hint i = function
1272 | S (_,_,(j,_),_):: tl -> j <> i (* && condition_for_hint i tl *)
1273 | _::tl -> condition_for_hint i tl
1275 let remove_s_from_fl (id,_,_) (fl : fail list) =
1276 let rec aux = function
1278 | ((id1,_,_),_)::tl when id = id1 -> tl
1279 | hd::tl -> hd :: aux tl
1284 let prunable_for_size flags s m todo =
1285 let rec aux b = function
1286 | (S _)::tl -> aux b tl
1287 | (D (_,_,T))::tl -> aux b tl
1289 (match calculate_goal_ty g s m with
1291 | Some (canonical_ctx, gty) ->
1293 Utils.weight_of_term
1294 ~consider_metas:false ~count_metas_occurrences:true gty in
1295 let newb = b || gsize > flags.maxgoalsizefactor in
1302 let prunable ty todo =
1303 let rec aux b = function
1304 | (S(_,k,_,_))::tl -> aux (b || Equality.meta_convertibility k ty) tl
1305 | (D (_,_,T))::tl -> aux b tl
1313 let prunable menv subst ty todo =
1314 let rec aux = function
1315 | (S(_,k,_,_))::tl ->
1316 (match Equality.meta_convertibility_subst k ty menv with
1319 no_progress variant tl (* || aux tl*))
1320 | (D (_,_,T))::tl -> aux tl
1322 and no_progress variant = function
1323 | [] -> (*prerr_endline "++++++++++++++++++++++++ no_progress";*) true
1324 | D ((n,_,P) as g)::tl ->
1325 (match calculate_goal_ty g subst menv with
1326 | None -> no_progress variant tl
1328 (match calculate_goal_ty g variant menv with
1329 | None -> assert false
1332 no_progress variant tl
1334 | _::tl -> no_progress variant tl
1339 let condition_for_prune_hint prune (m, s, size, don, todo, fl) =
1341 HExtlib.filter_map (function S (_,_,(c,_),_) -> Some c | _ -> None) todo
1343 List.for_all (fun i -> List.for_all (fun j -> i<>j) prune) s
1345 let filter_prune_hint l =
1346 let prune = !prune_hint in
1347 prune_hint := []; (* possible race... *)
1348 if prune = [] then l
1349 else List.filter (condition_for_prune_hint prune) l
1351 let auto_main tables maxm context flags universe cache elems =
1352 auto_context := context;
1353 let rec aux tables maxm flags cache (elems : status) =
1354 (* pp_status context elems; *)
1355 (* DEBUGGING CODE: uncomment these two lines to stop execution at each iteration
1356 auto_status := elems;
1359 let elems = filter_prune_hint elems in
1361 | (m, s, size, don, todo, fl)::orlist when !hint <> None ->
1363 | Some i when condition_for_hint i todo ->
1364 aux tables maxm flags cache orlist
1367 aux tables maxm flags cache elems)
1369 (* complete failure *)
1370 Gaveup (tables, cache, maxm)
1371 | (m, s, _, _, [],_)::orlist ->
1372 (* complete success *)
1373 Proved (m, s, orlist, tables, cache, maxm)
1374 | (m, s, size, don, (D (_,_,T))::todo, fl)::orlist
1375 when not flags.AutoTypes.do_types ->
1376 (* skip since not Prop, don't even check if closed by side-effect *)
1377 aux tables maxm flags cache ((m, s, size, don, todo, fl)::orlist)
1378 | (m, s, size, don, (S(g, key, c,minsize) as op)::todo, fl)::orlist ->
1379 (* partial success, cache g and go on *)
1380 let cache, orlist, fl, sibling_pruned =
1381 add_to_cache_and_del_from_orlist_if_green_cut
1382 g s m cache key todo orlist fl context size minsize
1384 debug_print (lazy (AutoCache.cache_print context cache));
1385 let fl = remove_s_from_fl g fl in
1386 let don = if sibling_pruned then don else op::don in
1387 aux tables maxm flags cache ((m, s, size, don, todo, fl)::orlist)
1388 | (m, s, size, don, todo, fl)::orlist
1389 when List.length(prop_only (d_goals todo)) > flags.maxwidth ->
1390 debug_print (lazy ("FAIL: WIDTH"));
1391 (* too many goals in and generated by last th *)
1392 let cache = close_failures fl cache in
1393 aux tables maxm flags cache orlist
1394 | (m, s, size, don, todo, fl)::orlist when size > flags.maxsize ->
1396 (lazy ("FAIL: SIZE: "^string_of_int size ^
1397 " > " ^ string_of_int flags.maxsize ));
1398 (* we already have a too large proof term *)
1399 let cache = close_failures fl cache in
1400 aux tables maxm flags cache orlist
1401 | _ when Unix.gettimeofday () > flags.timeout ->
1403 debug_print (lazy ("FAIL: TIMEOUT"));
1404 Gaveup (tables, cache, maxm)
1405 | (m, s, size, don, (D (gno,depth,_ as g))::todo, fl)::orlist as status ->
1407 match calculate_goal_ty g s m with
1409 (* closed by side effect *)
1410 debug_print (lazy ("SUCCESS: SIDE EFFECT: " ^ string_of_int gno));
1411 aux tables maxm flags cache ((m,s,size,don,todo, fl)::orlist)
1412 | Some (canonical_ctx, gty) ->
1414 Utils.weight_of_term ~consider_metas:false ~count_metas_occurrences:true gty
1416 if gsize > flags.maxgoalsizefactor then
1417 (debug_print (lazy ("FAIL: SIZE: goal: "^string_of_int gsize));
1418 aux tables maxm flags cache orlist)
1419 else if prunable_for_size flags s m todo then
1420 (debug_print (lazy ("POTO at depth: "^(string_of_int depth)));
1421 aux tables maxm flags cache orlist)
1423 (* still to be proved *)
1424 (debug_print (lazy ("EXAMINE: "^CicPp.ppterm gty));
1425 match cache_examine cache gty with
1426 | Failed_in d when d >= depth ->
1428 debug_print (lazy ("FAIL: DEPTH (cache): "^string_of_int gno));
1429 let cache = close_failures fl cache in
1430 aux tables maxm flags cache orlist
1431 | UnderInspection ->
1433 debug_print (lazy ("FAIL: LOOP: " ^ string_of_int gno));
1434 let cache = close_failures fl cache in
1435 aux tables maxm flags cache orlist
1437 debug_print (lazy ("SUCCESS: CACHE HIT: " ^ string_of_int gno));
1438 let s, m = put_in_subst s m g canonical_ctx t gty in
1439 aux tables maxm flags cache ((m, s, size, don,todo, fl)::orlist)
1441 | Failed_in _ when depth > 0 ->
1442 ( (* more depth or is the first time we see the goal *)
1443 if prunable m s gty todo then
1445 "FAIL: LOOP: one father is equal"));
1446 aux tables maxm flags cache orlist)
1448 let cache = cache_add_underinspection cache gty depth in
1449 auto_status := status;
1452 (lazy ("INSPECTING: " ^
1453 string_of_int gno ^ "("^ string_of_int size ^ "): "^
1455 (* elems are possible computations for proving gty *)
1456 let elems, tables, cache, maxm, flags =
1457 equational_and_applicative_case
1458 universe flags m s g gty tables cache maxm context
1461 (* this goal has failed *)
1462 let cache = close_failures ((g,gty)::fl) cache in
1463 aux tables maxm flags cache orlist
1465 (* elems = (cand,m,s,gl) *)
1466 let size_gl l = List.length
1467 (List.filter (function (_,_,P) -> true | _ -> false) l)
1470 let inj_gl gl = List.map (fun g -> D g) gl in
1471 let rec map = function
1472 | [] -> assert false
1473 | (cand,m,s,gl)::[] ->
1474 (* in the last one we add the failure *)
1476 inj_gl gl @ (S(g,gty,cand,size+1))::todo
1478 (* we are the last in OR, we fail on g and
1479 * also on all failures implied by g *)
1480 (m,s, size + size_gl gl, don, todo, (g,gty)::fl)
1482 | (cand,m,s,gl)::tl ->
1483 (* we add the S step after gl and before todo *)
1485 inj_gl gl @ (S(g,gty,cand,size+1))::todo
1487 (* since we are not the last in OR, we do not
1489 (m,s, size + size_gl gl, don, todo, []) :: map tl
1493 aux tables maxm flags cache elems)
1496 debug_print (lazy ("FAIL: DEPTH: " ^ string_of_int gno));
1497 let cache = close_failures fl cache in
1498 aux tables maxm flags cache orlist)
1500 (aux tables maxm flags cache elems : auto_result)
1505 auto_all_solutions maxm tables universe cache context metasenv gl flags
1507 let goals = order_new_goals metasenv [] gl CicPp.ppterm in
1510 (fun (x,s) -> D (x,flags.maxdepth,s)) goals
1512 let elems = [metasenv,[],1,[],goals,[]] in
1513 let rec aux tables maxm solutions cache elems flags =
1514 match auto_main tables maxm context flags universe cache elems with
1515 | Gaveup (tables,cache,maxm) ->
1516 solutions,cache,maxm
1517 | Proved (metasenv,subst,others,tables,cache,maxm) ->
1518 if Unix.gettimeofday () > flags.timeout then
1519 ((subst,metasenv)::solutions), cache, maxm
1521 aux tables maxm ((subst,metasenv)::solutions) cache others flags
1523 let rc = aux tables maxm [] cache elems flags in
1525 | [],cache,maxm -> [],cache,maxm
1526 | solutions,cache,maxm ->
1529 (fun (subst,newmetasenv) ->
1531 ProofEngineHelpers.compare_metasenvs ~oldmetasenv:metasenv ~newmetasenv
1533 if opened = [] then Some subst else None)
1536 solutions,cache,maxm
1539 (* }}} ****************** AUTO ***************)
1541 let auto flags metasenv tables universe cache context metasenv gl =
1542 let initial_time = Unix.gettimeofday() in
1543 let goals = order_new_goals metasenv [] gl CicPp.ppterm in
1544 let goals = List.map (fun (x,s) -> D(x,flags.maxdepth,s)) goals in
1545 let elems = [metasenv,[],1,[],goals,[]] in
1546 match auto_main tables 0 context flags universe cache elems with
1547 | Proved (metasenv,subst,_, tables,cache,_) ->
1549 ("TIME:"^string_of_float(Unix.gettimeofday()-.initial_time)));
1550 Some (subst,metasenv), cache
1551 | Gaveup (tables,cache,maxm) ->
1553 ("TIME:"^string_of_float(Unix.gettimeofday()-.initial_time)));
1557 let applyS_tac ~dbd ~term ~params ~universe =
1558 ProofEngineTypes.mk_tactic
1562 apply_smart ~dbd ~term ~subst:[] ~params ~universe status
1566 | CicUnification.UnificationFailure msg
1567 | CicTypeChecker.TypeCheckerFailure msg ->
1568 raise (ProofEngineTypes.Fail msg))
1570 let auto_tac ~(dbd:HSql.dbd) ~params:(univ,params) ~universe (proof, goal) =
1571 let _,metasenv,_subst,_,_, _ = proof in
1572 let _,context,goalty = CicUtil.lookup_meta goal metasenv in
1573 let universe = universe_of_params metasenv context universe univ in
1574 let flags = flags_of_params params () in
1575 let use_library = flags.use_library in
1576 let tables,cache,newmeta =
1577 init_cache_and_tables ~dbd use_library flags.use_only_paramod true
1578 false universe (proof, goal) in
1579 let tables,cache,newmeta =
1580 if flags.close_more then
1582 tables newmeta context (proof, goal)
1583 auto_all_solutions universe cache
1584 else tables,cache,newmeta in
1585 let initial_time = Unix.gettimeofday() in
1586 let (_,oldmetasenv,_subst,_,_, _) = proof in
1589 metasenv,[],1,[],[D (goal,flags.maxdepth,P)],[]
1591 match auto_main tables newmeta context flags universe cache [elem] with
1592 | Proved (metasenv,subst,_, tables,cache,_) ->
1594 ("TIME:"^string_of_float(Unix.gettimeofday()-.initial_time));*)
1595 let proof,metasenv =
1596 ProofEngineHelpers.subst_meta_and_metasenv_in_proof
1597 proof goal subst metasenv
1600 ProofEngineHelpers.compare_metasenvs ~oldmetasenv
1601 ~newmetasenv:metasenv
1604 | Gaveup (tables,cache,maxm) ->
1607 string_of_float(Unix.gettimeofday()-.initial_time)));
1608 raise (ProofEngineTypes.Fail (lazy "Auto gave up"))
1611 let auto_tac ~dbd ~params ~universe =
1612 ProofEngineTypes.mk_tactic (auto_tac ~params ~dbd ~universe);;
1614 let eq_of_goal = function
1615 | Cic.Appl [Cic.MutInd(uri,0,_);_;_;_] when LibraryObjects.is_eq_URI uri ->
1617 | _ -> raise (ProofEngineTypes.Fail (lazy ("The goal is not an equality ")))
1620 (* performs steps of rewrite with the universe, obtaining if possible
1622 let solve_rewrite_tac ~universe ~params:(univ,params) (proof,goal as status)=
1623 let _,metasenv,_subst,_,_,_ = proof in
1624 let _,context,ty = CicUtil.lookup_meta goal metasenv in
1625 let steps = int_of_string (string params "steps" "1") in
1626 let universe = universe_of_params metasenv context universe univ in
1627 let eq_uri = eq_of_goal ty in
1628 let (active,passive,bag), cache, maxm =
1629 (* we take the whole universe (no signature filtering) *)
1630 init_cache_and_tables false true false true universe (proof,goal)
1632 let initgoal = [], metasenv, ty in
1634 let equalities = (Saturation.list_of_passive passive) in
1635 (* we demodulate using both actives passives *)
1636 List.fold_left (fun tbl eq -> Indexing.index tbl eq) (snd active) equalities
1638 let env = metasenv,context,CicUniv.oblivion_ugraph in
1639 match Indexing.solve_demodulating bag env table initgoal steps with
1640 | Some (proof, metasenv, newty) ->
1643 | Cic.Appl[Cic.MutInd _;eq_ty;left;_] ->
1644 Equality.Exact (Equality.refl_proof eq_uri eq_ty left)
1648 Equality.build_goal_proof
1649 bag eq_uri proof refl newty [] context metasenv
1651 ProofEngineTypes.apply_tactic
1652 (PrimitiveTactics.apply_tac ~term:proofterm) status
1655 (ProofEngineTypes.Fail (lazy
1656 ("Unable to solve with " ^ string_of_int steps ^ " demodulations")))
1658 let solve_rewrite_tac ~params ~universe () =
1659 ProofEngineTypes.mk_tactic (solve_rewrite_tac ~universe ~params)
1663 let demodulate_tac ~dbd ~universe ~params:(univ, params) (proof,goal)=
1664 let curi,metasenv,_subst,pbo,pty, attrs = proof in
1665 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
1666 let universe = universe_of_params metasenv context universe univ in
1667 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
1668 let initgoal = [], metasenv, ty in
1669 let eq_uri = eq_of_goal ty in
1670 let (active,passive,bag), cache, maxm =
1671 init_cache_and_tables
1672 ~dbd false true true false universe (proof,goal)
1674 let equalities = (Saturation.list_of_passive passive) in
1675 (* we demodulate using both actives passives *)
1678 (fun tbl eq -> Indexing.index tbl eq)
1679 (snd active) equalities
1681 let changed,(newproof,newmetasenv, newty) =
1682 Indexing.demodulation_goal bag
1683 (metasenv,context,CicUniv.oblivion_ugraph) table initgoal
1687 let opengoal = Equality.Exact (Cic.Meta(maxm,irl)) in
1689 Equality.build_goal_proof bag
1690 eq_uri newproof opengoal ty [] context metasenv
1692 let extended_metasenv = (maxm,context,newty)::metasenv in
1693 let extended_status =
1694 (curi,extended_metasenv,_subst,pbo,pty, attrs),goal in
1695 let (status,newgoals) =
1696 ProofEngineTypes.apply_tactic
1697 (PrimitiveTactics.apply_tac ~term:proofterm)
1699 (status,maxm::newgoals)
1701 else (* if newty = ty then *)
1702 raise (ProofEngineTypes.Fail (lazy "no progress"))
1703 (*else ProofEngineTypes.apply_tactic
1704 (ReductionTactics.simpl_tac
1705 ~pattern:(ProofEngineTypes.conclusion_pattern None)) initialstatus*)
1708 let demodulate_tac ~dbd ~params ~universe =
1709 ProofEngineTypes.mk_tactic (demodulate_tac ~dbd ~params ~universe);;
1711 let pp_proofterm = Equality.pp_proofterm;;
1713 let revision = "$Revision$";;
1714 let size_and_depth context metasenv t = 100, 100