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 ;;
130 (* giusto per provare che succede
131 let is_unit_equation context metasenv oldnewmeta term =
132 let head, metasenv, args, newmeta =
133 TermUtil.saturate_term oldnewmeta metasenv context term 0
136 List.filter (fun (i,_,_) -> i >= oldnewmeta) metasenv
138 Some (args,metasenv,newmetas,head,newmeta) *)
140 let is_unit_equation context metasenv oldnewmeta term =
141 let head, metasenv, args, newmeta =
142 TermUtil.saturate_term oldnewmeta metasenv context term 0
144 let propositional_args =
148 let _,_,mt = CicUtil.lookup_meta i metasenv in
150 CicTypeChecker.type_of_aux' metasenv context mt
151 CicUniv.oblivion_ugraph
153 if is_propositional context sort then Some i else None
157 if propositional_args = [] then
159 List.filter (fun (i,_,_) -> i >= oldnewmeta) metasenv
161 Some (args,metasenv,newmetas,head,newmeta)
165 let get_candidates universe cache t =
167 (Universe.get_candidates universe t)@(AutoCache.get_candidates cache t)
170 (lazy ("candidates for " ^ (CicPp.ppterm t) ^ " = " ^
171 (String.concat "\n" (List.map CicPp.ppterm candidates)))) in
172 debug_print debug_msg;
176 let only signature context metasenv t =
179 CicTypeChecker.type_of_aux' metasenv context t CicUniv.oblivion_ugraph
181 let consts = MetadataConstraints.constants_of ty in
182 let b = MetadataConstraints.UriManagerSet.subset consts signature in
185 let ty' = unfold context ty in
186 let consts' = MetadataConstraints.constants_of ty' in
187 MetadataConstraints.UriManagerSet.subset consts' signature
189 | CicTypeChecker.TypeCheckerFailure _ -> assert false
190 | ProofEngineTypes.Fail _ -> false (* unfold may fail *)
193 let not_default_eq_term t =
195 let uri = CicUtil.uri_of_term t in
196 not (LibraryObjects.in_eq_URIs uri)
197 with Invalid_argument _ -> true
199 let retrieve_equations dont_filter signature universe cache context metasenv =
200 match LibraryObjects.eq_URI() with
203 let eq_uri = UriManager.strip_xpointer eq_uri in
204 let fake= Cic.Meta(-1,[]) in
205 let fake_eq = Cic.Appl [Cic.MutInd (eq_uri,0, []);fake;fake;fake] in
206 let candidates = get_candidates universe cache fake_eq in
207 if dont_filter then candidates
209 let candidates = List.filter not_default_eq_term candidates in
210 List.filter (only signature context metasenv) candidates
212 let build_equality bag head args proof newmetas maxmeta =
214 | Cic.Appl [Cic.MutInd (uri, _, _); ty; t1; t2] ->
216 if args = [] then proof else Cic.Appl (proof::args)
218 let o = !Utils.compare_terms t1 t2 in
219 let stat = (ty,t1,t2,o) in
220 (* let w = compute_equality_weight stat in *)
222 let proof = Equality.Exact p in
223 let e = Equality.mk_equality bag (w, proof, stat, newmetas) in
224 (* to clean the local context of metas *)
225 Equality.fix_metas bag maxmeta e
229 let partition_unit_equalities context metasenv newmeta bag equations =
231 (fun (units,other,maxmeta)(t,ty) ->
232 if not (CicUtil.is_meta_closed t && CicUtil.is_meta_closed ty) then
235 ("Skipping " ^ CicMetaSubst.ppterm_in_context ~metasenv [] t context
236 ^ " since it is not meta closed")
238 units,(t,ty)::other,maxmeta
240 match is_unit_equation context metasenv maxmeta ty with
241 | Some (args,metasenv,newmetas,head,newmeta') ->
242 let maxmeta,equality =
243 build_equality bag head args t newmetas newmeta' in
244 equality::units,other,maxmeta
246 units,(t,ty)::other,maxmeta)
247 ([],[],newmeta) equations
250 (Saturation.make_active [],
251 Saturation.make_passive [],
252 Equality.mk_equality_bag)
255 let init_cache_and_tables
256 ?dbd use_library paramod use_context dont_filter universe (proof, goal)
258 (* the local cache in initially empty *)
259 let cache = AutoCache.cache_empty in
260 let _, metasenv, _subst,_, _, _ = proof in
261 let signature = MetadataQuery.signature_of metasenv goal in
262 let newmeta = CicMkImplicit.new_meta metasenv [] in
263 let _,context,_ = CicUtil.lookup_meta goal metasenv in
264 let ct = if use_context then find_context_theorems context metasenv else [] in
266 (lazy ("ho trovato nel contesto " ^ (string_of_int (List.length ct))));
268 match use_library, dbd with
269 | true, Some dbd -> find_library_theorems dbd metasenv goal
273 (lazy ("ho trovato nella libreria " ^ (string_of_int (List.length lt))));
274 let cache = cache_add_list cache context (ct@lt) in
276 retrieve_equations dont_filter signature universe cache context metasenv
279 (lazy ("ho trovato equazioni n. "^(string_of_int (List.length equations))));
284 CicTypeChecker.type_of_aux'
285 metasenv context t CicUniv.oblivion_ugraph
287 (* retrieve_equations could also return flexible terms *)
288 if is_an_equality ty then Some(t,ty)
291 let ty' = unfold context ty in
292 if is_an_equality ty' then Some(t,ty') else None
293 with ProofEngineTypes.Fail _ -> None)
296 let bag = Equality.mk_equality_bag () in
297 let units, other_equalities, newmeta =
298 partition_unit_equalities context metasenv newmeta bag eqs_and_types
300 (* SIMPLIFICATION STEP
302 let env = (metasenv, context, CicUniv.oblivion_ugraph) in
303 let eq_uri = HExtlib.unopt (LibraryObjects.eq_URI()) in
304 Saturation.simplify_equalities bag eq_uri env units
307 let passive = Saturation.make_passive units in
308 let no = List.length units in
309 let active = Saturation.make_active [] in
310 let active,passive,newmeta =
311 if paramod then active,passive,newmeta
313 Saturation.pump_actives
314 context bag newmeta active passive (no+1) infinity
316 (active,passive,bag),cache,newmeta
318 let fill_hypothesis context metasenv oldnewmeta term tables (universe:Universe.universe) cache auto fast =
319 let head, metasenv, args, newmeta =
320 TermUtil.saturate_term oldnewmeta metasenv context term 0
322 let propositional_args =
326 let _,_,mt = CicUtil.lookup_meta i metasenv in
328 CicTypeChecker.type_of_aux' metasenv context mt
329 CicUniv.oblivion_ugraph
331 if is_propositional context sort then Some i else None
335 let results,cache,newmeta =
336 if propositional_args = [] then
337 let newmetas = List.filter (fun (i,_,_) -> i >= oldnewmeta) metasenv in
338 [args,metasenv,newmetas,head,newmeta],cache,newmeta
342 None,metasenv,term,term (* term non e' significativo *)
346 {AutoTypes.default_flags() with
347 AutoTypes.timeout = Unix.gettimeofday() +. 1.0;
348 maxwidth = 2;maxdepth = 2;
349 use_paramod=true;use_only_paramod=false}
351 {AutoTypes.default_flags() with
352 AutoTypes.timeout = Unix.gettimeofday() +. 1.0;
353 maxwidth = 2;maxdepth = 4;
354 use_paramod=true;use_only_paramod=false}
356 match auto newmeta tables universe cache context metasenv propositional_args flags with
357 | [],cache,newmeta -> raise (FillingFailure (cache,newmeta))
358 | substs,cache,newmeta ->
362 CicMetaSubst.apply_subst_metasenv subst metasenv
364 let head = CicMetaSubst.apply_subst subst head in
366 List.filter (fun (i,_,_) ->i >= oldnewmeta) metasenv
368 let args = List.map (CicMetaSubst.apply_subst subst) args in
369 let newm = CicMkImplicit.new_meta metasenv subst in
370 args,metasenv,newmetas,head,max newm newmeta)
371 substs, cache, newmeta
373 results,cache,newmeta
375 let build_equalities auto context metasenv tables universe cache newmeta equations =
377 (fun (facts,cache,newmeta) (t,ty) ->
378 (* in any case we add the equation to the cache *)
379 let cache = AutoCache.cache_add_list cache context [(t,ty)] in
381 let saturated,cache,newmeta =
382 fill_hypothesis context metasenv newmeta ty tables universe cache auto true
384 let (active,passive,bag) = tables in
385 let eqs,bag,newmeta =
387 (fun (acc,bag,newmeta) (args,metasenv,newmetas,head,newmeta') ->
388 let maxmeta,equality =
389 build_equality bag head args t newmetas newmeta'
391 equality::acc,bag,maxmeta)
392 ([],bag,newmeta) saturated
394 (eqs@facts, cache, newmeta)
395 with FillingFailure (cache,newmeta) ->
396 (* if filling hypothesis fails we add the equation to
398 (facts,cache,newmeta)
400 ([],cache,newmeta) equations
402 let close_more tables maxmeta context status auto universe cache =
403 let (active,passive,bag) = tables in
404 let proof, goalno = status in
405 let _, metasenv,_subst,_,_, _ = proof in
406 let signature = MetadataQuery.signature_of metasenv goalno in
408 retrieve_equations false signature universe cache context metasenv
414 CicTypeChecker.type_of_aux' metasenv context t
415 CicUniv.oblivion_ugraph in
416 (* retrieve_equations could also return flexible terms *)
417 if is_an_equality ty then Some(t,ty) else None)
419 let units, cache, maxm =
420 build_equalities auto context metasenv tables universe cache maxmeta eqs_and_types in
421 debug_print (lazy (">>>>>>> gained from a new context saturation >>>>>>>>>" ^
422 string_of_int maxm));
424 (fun e -> debug_print (lazy (Equality.string_of_equality e)))
426 debug_print (lazy ">>>>>>>>>>>>>>>>>>>>>>");
427 let passive = Saturation.add_to_passive units passive in
428 let no = List.length units in
429 debug_print (lazy ("No = " ^ (string_of_int no)));
430 let active,passive,newmeta =
431 Saturation.pump_actives context bag maxm active passive (no+1) infinity
433 (active,passive,bag),cache,newmeta
435 let find_context_equalities
436 maxmeta bag context proof (universe:Universe.universe) cache
438 let module C = Cic in
439 let module S = CicSubstitution in
440 let module T = CicTypeChecker in
441 let _,metasenv,_subst,_,_, _ = proof in
442 let newmeta = max (ProofEngineHelpers.new_meta_of_proof ~proof) maxmeta in
443 (* if use_auto is true, we try to close the hypothesis of equational
444 statements using auto; a naif, and probably wrong approach *)
445 let rec aux cache index newmeta = function
446 | [] -> [], newmeta,cache
447 | (Some (_, C.Decl (term)))::tl ->
450 (Printf.sprintf "Examining: %d (%s)" index (CicPp.ppterm term)));
451 let do_find context term =
453 | C.Prod (name, s, t) when is_an_equality t ->
456 let term = S.lift index term in
457 let saturated,cache,newmeta =
458 fill_hypothesis context metasenv newmeta term
459 empty_tables universe cache default_auto false
463 (fun (acc,newmeta) (args,metasenv,newmetas,head,newmeta') ->
464 let newmeta, equality =
466 bag head args (Cic.Rel index) newmetas (max newmeta newmeta')
468 equality::acc, newmeta + 1)
469 ([],newmeta) saturated
472 with FillingFailure (cache,newmeta) ->
474 | C.Appl [C.MutInd (uri, _, _); ty; t1; t2]
475 when LibraryObjects.is_eq_URI uri ->
476 let term = S.lift index term in
478 build_equality bag term [] (Cic.Rel index) [] newmeta
480 [e], (newmeta+1),cache
481 | _ -> [], newmeta, cache
483 let eqs, newmeta, cache = do_find context term in
484 let rest, newmeta,cache = aux cache (index+1) newmeta tl in
485 List.map (fun x -> index,x) eqs @ rest, newmeta, cache
487 aux cache (index+1) newmeta tl
489 let il, maxm, cache =
490 aux cache 1 newmeta context
492 let indexes, equalities = List.split il in
493 indexes, equalities, maxm, cache
496 (********** PARAMETERS PASSING ***************)
498 let bool params name default =
500 let s = List.assoc name params in
501 if s = "" || s = "1" || s = "true" || s = "yes" || s = "on" then true
502 else if s = "0" || s = "false" || s = "no" || s= "off" then false
504 let msg = "Unrecognized value for parameter "^name^"\n" in
505 let msg = msg^"Accepted values are 1,true,yes,on and 0,false,no,off" in
506 raise (ProofEngineTypes.Fail (lazy msg))
507 with Not_found -> default
510 let string params name default =
511 try List.assoc name params with
512 | Not_found -> default
515 let int params name default =
516 try int_of_string (List.assoc name params) with
517 | Not_found -> default
519 raise (ProofEngineTypes.Fail (lazy (name ^ " must be an integer")))
522 let flags_of_params params ?(for_applyS=false) () =
523 let int = int params in
524 let bool = bool params in
525 let close_more = bool "close_more" false in
526 let use_paramod = bool "use_paramod" true in
527 let use_only_paramod =
528 if for_applyS then true else bool "paramodulation" false in
529 let use_library = bool "library"
530 ((AutoTypes.default_flags()).AutoTypes.use_library) in
531 let depth = int "depth" ((AutoTypes.default_flags()).AutoTypes.maxdepth) in
532 let width = int "width" ((AutoTypes.default_flags()).AutoTypes.maxwidth) in
533 let size = int "size" ((AutoTypes.default_flags()).AutoTypes.maxsize) in
534 let gsize = int "gsize" ((AutoTypes.default_flags()).AutoTypes.maxgoalsizefactor) in
535 let do_type = bool "type" false in
536 let timeout = int "timeout" 0 in
537 { AutoTypes.maxdepth =
538 if use_only_paramod then 2 else depth;
539 AutoTypes.maxwidth = width;
540 AutoTypes.maxsize = size;
543 if for_applyS then Unix.gettimeofday () +. 30.0
547 Unix.gettimeofday() +. (float_of_int timeout);
548 AutoTypes.use_library = use_library;
549 AutoTypes.use_paramod = use_paramod;
550 AutoTypes.use_only_paramod = use_only_paramod;
551 AutoTypes.close_more = close_more;
552 AutoTypes.dont_cache_failures = false;
553 AutoTypes.maxgoalsizefactor = gsize;
554 AutoTypes.do_types = do_type;
557 let universe_of_params metasenv context universe tl =
558 if tl = [] then universe else
562 fst (CicTypeChecker.type_of_aux' metasenv context term
563 CicUniv.oblivion_ugraph))
566 Universe.index_list Universe.empty context (List.combine tl tys)
570 (***************** applyS *******************)
572 let new_metasenv_and_unify_and_t
573 dbd flags universe proof goal ?tables newmeta' metasenv'
574 context term' ty termty goal_arity
576 let (consthead,newmetasenv,arguments,_) =
577 TermUtil.saturate_term newmeta' metasenv' context termty goal_arity in
579 match arguments with [] -> term' | _ -> Cic.Appl (term'::arguments)
581 let proof',oldmetasenv =
582 let (puri,metasenv,_subst,pbo,pty, attrs) = proof in
583 (puri,newmetasenv,_subst,pbo,pty, attrs),metasenv
585 let goal_for_paramod =
586 match LibraryObjects.eq_URI () with
588 Cic.Appl [Cic.MutInd (uri,0,[]); Cic.Sort Cic.Prop; consthead; ty]
589 | None -> raise (ProofEngineTypes.Fail (lazy "No equality defined"))
591 let newmeta = CicMkImplicit.new_meta newmetasenv (*subst*) [] in
592 let metasenv_for_paramod = (newmeta,context,goal_for_paramod)::newmetasenv in
594 let uri,_,_subst,p,ty, attrs = proof' in
595 uri,metasenv_for_paramod,_subst,p,ty, attrs
597 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
599 ProofEngineTypes.apply_tactic
600 (EqualityTactics.rewrite_tac ~direction:`RightToLeft
601 ~pattern:(ProofEngineTypes.conclusion_pattern None)
602 (Cic.Meta(newmeta,irl)) [])
605 let goal = match goals with [g] -> g | _ -> assert false in
607 ProofEngineTypes.apply_tactic
608 (PrimitiveTactics.apply_tac term'')
612 let (active, passive,bag), cache, maxmeta =
613 init_cache_and_tables ~dbd flags.use_library true true false universe
616 Saturation.given_clause bag maxmeta (proof'''',newmeta) active passive
617 max_int max_int flags.timeout
620 raise (ProofEngineTypes.Fail (lazy ("FIXME: propaga le tabelle")))
621 | Some (_,proof''''',_), active,passive,_ ->
623 ProofEngineHelpers.compare_metasenvs ~oldmetasenv
624 ~newmetasenv:(let _,m,_subst,_,_, _ = proof''''' in m), active, passive
627 let rec count_prods context ty =
628 match CicReduction.whd context ty with
629 Cic.Prod (n,s,t) -> 1 + count_prods (Some (n,Cic.Decl s)::context) t
633 ~dbd ~term ~subst ~universe ?tables ~params:(univ,params) (proof, goal)
635 let module T = CicTypeChecker in
636 let module R = CicReduction in
637 let module C = Cic in
638 let (_,metasenv,_subst,_,_, _) = proof in
639 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
640 let flags = flags_of_params params ~for_applyS:true () in
641 let universe = universe_of_params metasenv context universe univ in
642 let newmeta = CicMkImplicit.new_meta metasenv subst in
643 let exp_named_subst_diff,newmeta',newmetasenvfragment,term' =
645 C.Var (uri,exp_named_subst) ->
646 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
647 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
650 exp_named_subst_diff,newmeta',newmetasenvfragment,
651 C.Var (uri,exp_named_subst')
652 | C.Const (uri,exp_named_subst) ->
653 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
654 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
657 exp_named_subst_diff,newmeta',newmetasenvfragment,
658 C.Const (uri,exp_named_subst')
659 | C.MutInd (uri,tyno,exp_named_subst) ->
660 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
661 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
664 exp_named_subst_diff,newmeta',newmetasenvfragment,
665 C.MutInd (uri,tyno,exp_named_subst')
666 | C.MutConstruct (uri,tyno,consno,exp_named_subst) ->
667 let newmeta',newmetasenvfragment,exp_named_subst',exp_named_subst_diff =
668 PrimitiveTactics.generalize_exp_named_subst_with_fresh_metas context newmeta uri
671 exp_named_subst_diff,newmeta',newmetasenvfragment,
672 C.MutConstruct (uri,tyno,consno,exp_named_subst')
673 | _ -> [],newmeta,[],term
675 let metasenv' = metasenv@newmetasenvfragment in
677 CicTypeChecker.type_of_aux' metasenv' context term' CicUniv.oblivion_ugraph
679 let termty = CicSubstitution.subst_vars exp_named_subst_diff termty in
680 let goal_arity = count_prods context ty in
681 let proof, gl, active, passive =
682 new_metasenv_and_unify_and_t dbd flags universe proof goal ?tables
683 newmeta' metasenv' context term' ty termty goal_arity
685 proof, gl, active, passive
688 (****************** AUTO ********************)
690 let mk_irl ctx = CicMkImplicit.identity_relocation_list_for_metavariable ctx;;
691 let ugraph = CicUniv.oblivion_ugraph;;
692 let typeof = CicTypeChecker.type_of_aux';;
694 let names = List.map (function None -> None | Some (x,_) -> Some x) ctx in
697 let is_in_prop context subst metasenv ty =
698 let sort,u = typeof ~subst metasenv context ty CicUniv.oblivion_ugraph in
699 is_propositional context sort
702 exception NotConvertible;;
704 let check_proof_is_valid proof metasenv context goalty =
708 let ty,u = typeof metasenv context proof CicUniv.oblivion_ugraph in
709 let b,_ = CicReduction.are_convertible context ty goalty u in
710 if not b then raise NotConvertible else b
713 List.map (function None -> None | Some (x,_) -> Some x) context
715 debug_print (lazy ("PROOF:" ^ CicPp.pp proof names));
716 (* debug_print (lazy ("PROOFTY:" ^ CicPp.pp ty names)); *)
717 debug_print (lazy ("GOAL:" ^ CicPp.pp goalty names));
718 debug_print (lazy ("MENV:" ^ CicMetaSubst.ppmetasenv [] metasenv));
724 let assert_proof_is_valid proof metasenv context goalty =
725 assert (check_proof_is_valid proof metasenv context goalty)
728 let assert_subst_are_disjoint subst subst' =
731 (fun (i,_) -> List.for_all (fun (j,_) -> i<>j) subst')
736 let split_goals_in_prop metasenv subst gl =
739 let _,context,ty = CicUtil.lookup_meta g metasenv in
741 let sort,u = typeof ~subst metasenv context ty ugraph in
742 is_propositional context sort
744 | CicTypeChecker.AssertFailure s
745 | CicTypeChecker.TypeCheckerFailure s ->
747 (lazy ("NON TIPA" ^ ppterm context (CicMetaSubst.apply_subst subst ty)));
750 (* FIXME... they should type! *)
754 let split_goals_with_metas metasenv subst gl =
757 let _,context,ty = CicUtil.lookup_meta g metasenv in
758 let ty = CicMetaSubst.apply_subst subst ty in
759 CicUtil.is_meta_closed ty)
763 let order_new_goals metasenv subst open_goals ppterm =
764 let prop,rest = split_goals_in_prop metasenv subst open_goals in
765 let closed_prop, open_prop = split_goals_with_metas metasenv subst prop in
766 let closed_type, open_type = split_goals_with_metas metasenv subst rest in
768 (List.map (fun x -> x,P) (open_prop @ closed_prop))
770 (List.map (fun x -> x,T) (open_type @ closed_type))
775 let _,_,ty = CicUtil.lookup_meta i metasenv in i,ty,sort) open_goals
777 debug_print (lazy (" OPEN: "^
781 | (i,t,P) -> string_of_int i ^ ":"^ppterm t^ "Prop"
782 | (i,t,T) -> string_of_int i ^ ":"^ppterm t^ "Type")
787 let is_an_equational_goal = function
788 | Cic.Appl [Cic.MutInd(u,_,_);_;_;_] when LibraryObjects.is_eq_URI u -> true
793 let prop = function (_,depth,P) -> depth < 9 | _ -> false;;
796 let calculate_timeout flags =
797 if flags.timeout = 0. then
798 (debug_print (lazy "AUTO WITH NO TIMEOUT");
799 {flags with timeout = infinity})
803 let is_equational_case goalty flags =
804 let ensure_equational t =
805 if is_an_equational_goal t then true
808 let msg="Not an equational goal.\nYou cant use the paramodulation flag"in
809 raise (ProofEngineTypes.Fail (lazy msg))
812 (flags.use_paramod && is_an_equational_goal goalty) ||
813 (flags.use_only_paramod && ensure_equational goalty)
816 let cache_add_success sort cache k v =
817 if sort = P then cache_add_success cache k v else cache_remove_underinspection
822 type menv = Cic.metasenv
823 type subst = Cic.substitution
824 type goal = ProofEngineTypes.goal * int * AutoTypes.sort
825 let candidate_no = ref 0;;
826 type candidate = int * Cic.term Lazy.t
827 type cache = AutoCache.cache
829 Saturation.active_table * Saturation.passive_table * Equality.equality_bag
832 (* the goal (mainly for depth) and key of the goal *)
833 goal * AutoCache.cache_key
835 (* goal has to be proved *)
837 (* goal has to be cached as a success obtained using candidate as the first
839 | S of goal * AutoCache.cache_key * candidate * int
841 (* menv, subst, size, operations done (only S), operations to do, failures to cache if any op fails *)
842 menv * subst * int * op list * op list * fail list
844 (* list of computations that may lead to the solution: all op list will
845 * end with the same (S(g,_)) *)
848 (* menv, subst, alternatives, tables, cache, maxmeta *)
849 | Proved of menv * subst * elem list * tables * cache * int
850 | Gaveup of tables * cache * int
853 (* the status exported to the external observer *)
855 (* context, (goal,candidate) list, and_list, history *)
856 Cic.context * (int * Cic.term * bool * int * (int * Cic.term Lazy.t) list) list *
857 (int * Cic.term * int) list * Cic.term Lazy.t list
860 let rec aux acc = function
861 | (D g)::tl -> aux (acc@[g]) tl
867 List.filter (function (_,_,P) -> true | _ -> false) l
871 let rec aux acc = function
872 | (D g)::tl -> aux (acc@[g]) tl
873 | (S _)::tl -> aux acc tl
879 let calculate_goal_ty (goalno,_,_) s m =
881 let _,cc,goalty = CicUtil.lookup_meta goalno m in
882 (* XXX applicare la subst al contesto? *)
883 Some (cc, CicMetaSubst.apply_subst s goalty)
884 with CicUtil.Meta_not_found i when i = goalno -> None
887 let calculate_closed_goal_ty (goalno,_,_) s =
889 let cc,_,goalty = List.assoc goalno s in
890 (* XXX applicare la subst al contesto? *)
891 Some (cc, CicMetaSubst.apply_subst s goalty)
892 with Not_found -> None
895 let pp_status ctx status =
897 let names = Utils.names_of_context ctx in
900 ProofEngineReduction.replace
901 ~equality:(fun a b -> match b with Cic.Meta _ -> true | _ -> false)
902 ~what:[Cic.Rel 1] ~with_what:[Cic.Implicit None] ~where:x
906 let string_of_do m s (gi,_,_ as g) d =
907 match calculate_goal_ty g s m with
908 | Some (_,gty) -> Printf.sprintf "D(%d, %s, %d)" gi (pp gty) d
909 | None -> Printf.sprintf "D(%d, _, %d)" gi d
911 let string_of_s m su k (ci,ct) gi =
912 Printf.sprintf "S(%d, %s, %s, %d)" gi (pp k) (pp (Lazy.force ct)) ci
914 let string_of_ol m su l =
918 | D (g,d,s) -> string_of_do m su (g,d,s) d
919 | S ((gi,_,_),k,c,_) -> string_of_s m su k c gi)
922 let string_of_fl m s fl =
924 (List.map (fun ((i,_,_),ty) ->
925 Printf.sprintf "(%d, %s)" i (pp ty)) fl)
927 let rec aux = function
929 | (m,s,_,_,ol,fl)::tl ->
930 Printf.eprintf "< [%s] ;;; [%s]>\n"
931 (string_of_ol m s ol) (string_of_fl m s fl);
934 Printf.eprintf "-------------------------- status -------------------\n";
936 Printf.eprintf "-----------------------------------------------------\n";
939 let auto_status = ref [] ;;
940 let auto_context = ref [];;
941 let in_pause = ref false;;
942 let pause b = in_pause := b;;
943 let cond = Condition.create ();;
944 let mutex = Mutex.create ();;
945 let hint = ref None;;
946 let prune_hint = ref [];;
948 let step _ = Condition.signal cond;;
949 let give_hint n = hint := Some n;;
950 let give_prune_hint hint =
951 prune_hint := hint :: !prune_hint
958 Condition.wait cond mutex;
963 let get_auto_status _ =
964 let status = !auto_status in
965 let and_list,elems,last =
968 | (m,s,_,don,gl,fail)::tl ->
971 (fun (id,d,_ as g) ->
972 match calculate_goal_ty g s m with
973 | Some (_,x) -> Some (id,x,d) | None -> None)
977 (* these are the S goalsin the or list *)
980 (fun (m,s,_,don,gl,fail) ->
982 (function S (g,k,c,_) -> Some (g,k,c) | _ -> None)
986 (* this function eats id from a list l::[id,x] returning x, l *)
987 let eat_tail_if_eq id l =
988 let rec aux (s, l) = function
990 | ((id1,_,_),k1,c)::tl when id = id1 ->
992 | None -> aux (Some c,l) tl
993 | Some _ -> assert false)
994 | ((id1,_,_),k1,c as e)::tl -> aux (s, e::l) tl
996 let c, l = aux (None, []) l in
999 let eat_in_parallel id l =
1000 let rec aux (b,eaten, new_l as acc) l =
1004 match eat_tail_if_eq id l with
1005 | None, l -> aux (b@[false], eaten, new_l@[l]) tl
1006 | Some t,l -> aux (b@[true],eaten@[t], new_l@[l]) tl
1010 let rec eat_all rows l =
1014 match List.rev elem with
1015 | ((to_eat,depth,_),k,_)::next_lunch ->
1016 let b, eaten, l = eat_in_parallel to_eat l in
1017 let eaten = HExtlib.list_uniq eaten in
1018 let eaten = List.rev eaten in
1019 let b = true (* List.hd (List.rev b) *) in
1020 let rows = rows @ [to_eat,k,b,depth,eaten] in
1022 | [] -> eat_all rows or_list
1024 eat_all [] (List.rev orlist)
1028 (function (S (_,_,(_,c),_)) -> Some c | _ -> None)
1031 (* let rows = List.filter (fun (_,l) -> l <> []) rows in *)
1032 and_list, rows, history
1034 !auto_context, elems, and_list, last
1037 (* Works if there is no dependency over proofs *)
1038 let is_a_green_cut goalty =
1039 CicUtil.is_meta_closed goalty
1041 let rec first_s = function
1042 | (D _)::tl -> first_s tl
1043 | (S (g,k,c,s))::tl -> Some ((g,k,c,s),tl)
1046 let list_union l1 l2 =
1047 (* TODO ottimizzare compare *)
1048 HExtlib.list_uniq (List.sort compare (l1 @ l1))
1050 let rec eq_todo l1 l2 =
1052 | (D g1) :: tl1,(D g2) :: tl2 when g1=g2 -> eq_todo tl1 tl2
1053 | (S (g1,k1,(c1,lt1),i1)) :: tl1, (S (g2,k2,(c2,lt2),i2)) :: tl2
1054 when i1 = i2 && g1 = g2 && k1 = k2 && c1 = c2 ->
1055 if Lazy.force lt1 = Lazy.force lt2 then eq_todo tl1 tl2 else false
1059 let eat_head todo id fl orlist =
1060 let rec aux acc = function
1062 | (m, s, _, _, todo1, fl1)::tl as orlist ->
1063 let rec aux1 todo1 =
1064 match first_s todo1 with
1065 | None -> orlist, acc
1066 | Some (((gno,_,_),_,_,_), todo11) ->
1067 (* TODO confronto tra todo da ottimizzare *)
1068 if gno = id && eq_todo todo11 todo then
1069 aux (list_union fl1 acc) tl
1077 let close_proof p ty menv context =
1079 List.map fst (CicUtil.metas_of_term p @ CicUtil.metas_of_term ty)
1081 let menv = List.filter (fun (i,_,_) -> List.exists ((=)i) metas) menv in
1082 naif_closure p menv context
1084 (* XXX capire bene quando aggiungere alla cache *)
1085 let add_to_cache_and_del_from_orlist_if_green_cut
1086 g s m cache key todo orlist fl ctx size minsize
1088 let cache = cache_remove_underinspection cache key in
1089 (* prima per fare la irl usavamo il contesto vero e proprio e non quello
1091 match calculate_closed_goal_ty g s with
1092 | None -> assert false
1093 | Some (canonical_ctx , gty) ->
1094 let goalno,depth,sort = g in
1095 let irl = mk_irl canonical_ctx in
1096 let goal = Cic.Meta(goalno, irl) in
1097 let proof = CicMetaSubst.apply_subst s goal in
1098 let green_proof, closed_proof =
1099 let b = is_a_green_cut proof in
1101 b, (* close_proof proof gty m ctx *) proof
1105 debug_print (lazy ("TENTATIVE CACHE: " ^ CicPp.ppterm key));
1106 if is_a_green_cut key then
1107 (* if the initia goal was closed, we cut alternatives *)
1108 let _ = debug_print (lazy ("MANGIO: " ^ string_of_int goalno)) in
1109 let orlist, fl = eat_head todo goalno fl orlist in
1111 if size < minsize then
1112 (debug_print (lazy ("NO CACHE: 2 (size <= minsize)"));cache)
1114 (* if the proof is closed we cache it *)
1115 if green_proof then cache_add_success cache key proof
1116 else (* cache_add_success cache key closed_proof *)
1117 (debug_print (lazy ("NO CACHE: (no gree proof)"));cache)
1119 cache, orlist, fl, true
1122 debug_print (lazy ("TENTATIVE CACHE: " ^ CicPp.ppterm gty));
1123 if size < minsize then
1124 (debug_print (lazy ("NO CACHE: (size <= minsize)")); cache) else
1125 (* if the substituted goal and the proof are closed we cache it *)
1126 if is_a_green_cut gty then
1127 if green_proof then cache_add_success cache gty proof
1128 else (* cache_add_success cache gty closed_proof *)
1129 (debug_print (lazy ("NO CACHE: (no green proof (gty))"));cache)
1133 CicTypeChecker.type_of_aux' ~subst:s
1134 m ctx closed_proof CicUniv.oblivion_ugraph
1136 if is_a_green_cut ty then
1137 cache_add_success cache ty closed_proof
1140 | CicTypeChecker.TypeCheckerFailure _ ->*)
1141 (debug_print (lazy ("NO CACHE: (no green gty )"));cache)
1143 cache, orlist, fl, false
1145 let close_failures (fl : fail list) (cache : cache) =
1147 (fun cache ((gno,depth,_),gty) ->
1148 debug_print (lazy ("FAIL: INDUCED: " ^ string_of_int gno));
1149 cache_add_failure cache gty depth)
1152 let put_in_subst subst metasenv (goalno,_,_) canonical_ctx t ty =
1153 let entry = goalno, (canonical_ctx, t,ty) in
1154 assert_subst_are_disjoint subst [entry];
1155 let subst = entry :: subst in
1156 let metasenv = CicMetaSubst.apply_subst_metasenv subst metasenv in
1160 let mk_fake_proof metasenv subst (goalno,_,_) goalty context =
1161 None,metasenv,subst ,(lazy (Cic.Meta(goalno,mk_irl context))),goalty, []
1164 tables maxm cache depth fake_proof goalno goalty subst context
1167 let active,passive,bag = tables in
1168 let ppterm = ppterm context in
1169 let status = (fake_proof,goalno) in
1170 if flags.use_only_paramod then
1172 debug_print (lazy ("PARAMODULATION SU: " ^
1173 string_of_int goalno ^ " " ^ ppterm goalty ));
1174 let goal_steps, saturation_steps, timeout =
1175 max_int,max_int,flags.timeout
1179 Saturation.given_clause bag maxm status active passive
1180 goal_steps saturation_steps timeout
1182 | None, active, passive, maxmeta ->
1183 [], (active,passive,bag), cache, maxmeta, flags
1184 | Some(subst',(_,metasenv,_subst,proof,_, _),open_goals),active,
1186 assert_subst_are_disjoint subst subst';
1187 let subst = subst@subst' in
1189 order_new_goals metasenv subst open_goals ppterm
1192 List.map (fun (x,sort) -> x,depth-1,sort) open_goals
1195 [(!candidate_no,proof),metasenv,subst,open_goals],
1196 (active,passive,bag),
1197 cache, maxmeta, flags
1203 ("SUBSUMPTION SU: " ^ string_of_int goalno ^ " " ^ ppterm goalty));
1205 Saturation.all_subsumed bag maxm status active passive
1207 assert (maxmeta >= maxm);
1210 (fun (subst',(_,metasenv,_subst,proof,_, _),open_goals) ->
1211 assert_subst_are_disjoint subst subst';
1212 let subst = subst@subst' in
1214 order_new_goals metasenv subst open_goals ppterm
1217 List.map (fun (x,sort) -> x,depth-1,sort) open_goals
1220 (!candidate_no,proof),metasenv,subst,open_goals)
1223 res', (active,passive,bag), cache, maxmeta, flags
1228 goalty tables maxm subst fake_proof goalno depth context cand
1230 let ppterm = ppterm context in
1232 let subst,((_,metasenv,_,_,_,_), open_goals),maxmeta =
1233 (PrimitiveTactics.apply_with_subst ~subst ~maxmeta:maxm ~term:cand)
1236 debug_print (lazy (" OK: " ^ ppterm cand));
1237 let metasenv = CicRefine.pack_coercion_metasenv metasenv in
1238 let open_goals = order_new_goals metasenv subst open_goals ppterm in
1239 let open_goals = List.map (fun (x,sort) -> x,depth-1,sort) open_goals in
1241 Some ((!candidate_no,lazy cand),metasenv,subst,open_goals), tables , maxmeta
1243 | ProofEngineTypes.Fail s -> None,tables, maxm
1244 | CicUnification.Uncertain s -> None,tables, maxm
1247 let sort_new_elems =
1248 List.sort (fun (_,_,_,l1) (_,_,_,l2) ->
1249 List.length (prop_only l1) - List.length (prop_only l2))
1252 let applicative_case
1253 tables maxm depth subst fake_proof goalno goalty metasenv context universe
1256 let candidates = get_candidates universe cache goalty in
1257 let tables, elems, maxm =
1259 (fun (tables,elems,maxm) cand ->
1261 try_candidate goalty
1262 tables maxm subst fake_proof goalno depth context cand
1264 | None, tables,maxm -> tables,elems, maxm
1265 | Some x, tables, maxm -> tables,x::elems, maxm)
1266 (tables,[],maxm) candidates
1268 let elems = sort_new_elems elems in
1269 elems, tables, cache, maxm
1272 let equational_and_applicative_case
1273 universe flags m s g gty tables cache maxm context
1275 let goalno, depth, sort = g in
1276 let fake_proof = mk_fake_proof m s g gty context in
1277 if is_equational_case gty flags then
1278 let elems,tables,cache,maxm1, flags =
1279 equational_case tables maxm cache
1280 depth fake_proof goalno gty s context flags
1283 let more_elems, tables, cache, maxm1 =
1284 if flags.use_only_paramod then
1285 [],tables, cache, maxm
1288 tables maxm depth s fake_proof goalno
1289 gty m context universe cache
1292 elems@more_elems, tables, cache, maxm, flags
1294 let elems, tables, cache, maxm =
1295 applicative_case tables maxm depth s fake_proof goalno
1296 gty m context universe cache
1298 elems, tables, cache, maxm, flags
1300 let rec condition_for_hint i = function
1302 | S (_,_,(j,_),_):: tl -> j <> i (* && condition_for_hint i tl *)
1303 | _::tl -> condition_for_hint i tl
1305 let remove_s_from_fl (id,_,_) (fl : fail list) =
1306 let rec aux = function
1308 | ((id1,_,_),_)::tl when id = id1 -> tl
1309 | hd::tl -> hd :: aux tl
1314 let prunable_for_size flags s m todo =
1315 let rec aux b = function
1316 | (S _)::tl -> aux b tl
1317 | (D (_,_,T))::tl -> aux b tl
1319 (match calculate_goal_ty g s m with
1321 | Some (canonical_ctx, gty) ->
1323 Utils.weight_of_term
1324 ~consider_metas:false ~count_metas_occurrences:true gty in
1325 let newb = b || gsize > flags.maxgoalsizefactor in
1332 let prunable ty todo =
1333 let rec aux b = function
1334 | (S(_,k,_,_))::tl -> aux (b || Equality.meta_convertibility k ty) tl
1335 | (D (_,_,T))::tl -> aux b tl
1343 let prunable menv subst ty todo =
1344 let rec aux = function
1345 | (S(_,k,_,_))::tl ->
1346 (match Equality.meta_convertibility_subst k ty menv with
1349 no_progress variant tl (* || aux tl*))
1350 | (D (_,_,T))::tl -> aux tl
1352 and no_progress variant = function
1353 | [] -> (*prerr_endline "++++++++++++++++++++++++ no_progress";*) true
1354 | D ((n,_,P) as g)::tl ->
1355 (match calculate_goal_ty g subst menv with
1356 | None -> no_progress variant tl
1358 (match calculate_goal_ty g variant menv with
1359 | None -> assert false
1362 no_progress variant tl
1364 | _::tl -> no_progress variant tl
1369 let condition_for_prune_hint prune (m, s, size, don, todo, fl) =
1371 HExtlib.filter_map (function S (_,_,(c,_),_) -> Some c | _ -> None) todo
1373 List.for_all (fun i -> List.for_all (fun j -> i<>j) prune) s
1375 let filter_prune_hint l =
1376 let prune = !prune_hint in
1377 prune_hint := []; (* possible race... *)
1378 if prune = [] then l
1379 else List.filter (condition_for_prune_hint prune) l
1381 let auto_main tables maxm context flags universe cache elems =
1382 auto_context := context;
1383 let rec aux tables maxm flags cache (elems : status) =
1384 (* pp_status context elems; *)
1385 (* DEBUGGING CODE: uncomment these two lines to stop execution at each iteration
1386 auto_status := elems;
1389 let elems = filter_prune_hint elems in
1391 | (m, s, size, don, todo, fl)::orlist when !hint <> None ->
1392 debug_print (lazy "skip");
1394 | Some i when condition_for_hint i todo ->
1395 aux tables maxm flags cache orlist
1398 aux tables maxm flags cache elems)
1400 (* complete failure *)
1401 debug_print (lazy "give up");
1402 Gaveup (tables, cache, maxm)
1403 | (m, s, _, _, [],_)::orlist ->
1404 (* complete success *)
1405 debug_print (lazy "success");
1406 Proved (m, s, orlist, tables, cache, maxm)
1407 | (m, s, size, don, (D (_,_,T))::todo, fl)::orlist
1408 when not flags.AutoTypes.do_types ->
1409 (* skip since not Prop, don't even check if closed by side-effect *)
1410 debug_print (lazy "skip existential goal");
1411 aux tables maxm flags cache ((m, s, size, don, todo, fl)::orlist)
1412 | (m, s, size, don, (S(g, key, c,minsize) as op)::todo, fl)::orlist ->
1413 (* partial success, cache g and go on *)
1414 let cache, orlist, fl, sibling_pruned =
1415 add_to_cache_and_del_from_orlist_if_green_cut
1416 g s m cache key todo orlist fl context size minsize
1418 debug_print (lazy (AutoCache.cache_print context cache));
1419 let fl = remove_s_from_fl g fl in
1420 let don = if sibling_pruned then don else op::don in
1421 aux tables maxm flags cache ((m, s, size, don, todo, fl)::orlist)
1422 | (m, s, size, don, todo, fl)::orlist
1423 when List.length(prop_only (d_goals todo)) > flags.maxwidth ->
1424 debug_print (lazy ("FAIL: WIDTH"));
1425 (* too many goals in and generated by last th *)
1426 let cache = close_failures fl cache in
1427 aux tables maxm flags cache orlist
1428 | (m, s, size, don, todo, fl)::orlist when size > flags.maxsize ->
1430 (lazy ("FAIL: SIZE: "^string_of_int size ^
1431 " > " ^ string_of_int flags.maxsize ));
1432 (* we already have a too large proof term *)
1433 let cache = close_failures fl cache in
1434 aux tables maxm flags cache orlist
1435 | _ when Unix.gettimeofday () > flags.timeout ->
1437 debug_print (lazy ("FAIL: TIMEOUT"));
1438 Gaveup (tables, cache, maxm)
1439 | (m, s, size, don, (D (gno,depth,_ as g))::todo, fl)::orlist as status ->
1441 debug_print (lazy "attack goal");
1442 match calculate_goal_ty g s m with
1444 (* closed by side effect *)
1445 debug_print (lazy ("SUCCESS: SIDE EFFECT: " ^ string_of_int gno));
1446 aux tables maxm flags cache ((m,s,size,don,todo, fl)::orlist)
1447 | Some (canonical_ctx, gty) ->
1449 Utils.weight_of_term ~consider_metas:false ~count_metas_occurrences:true gty
1451 if gsize > flags.maxgoalsizefactor then
1452 (debug_print (lazy ("FAIL: SIZE: goal: "^string_of_int gsize));
1453 aux tables maxm flags cache orlist)
1454 else if prunable_for_size flags s m todo then
1455 (debug_print (lazy ("POTO at depth: "^(string_of_int depth)));
1456 aux tables maxm flags cache orlist)
1458 (* still to be proved *)
1459 (debug_print (lazy ("EXAMINE: "^CicPp.ppterm gty));
1460 match cache_examine cache gty with
1461 | Failed_in d when d >= depth ->
1463 debug_print (lazy ("FAIL: DEPTH (cache): "^string_of_int gno));
1464 let cache = close_failures fl cache in
1465 aux tables maxm flags cache orlist
1466 | UnderInspection ->
1468 debug_print (lazy ("FAIL: LOOP: " ^ string_of_int gno));
1469 let cache = close_failures fl cache in
1470 aux tables maxm flags cache orlist
1472 debug_print (lazy ("SUCCESS: CACHE HIT: " ^ string_of_int gno));
1473 let s, m = put_in_subst s m g canonical_ctx t gty in
1474 aux tables maxm flags cache ((m, s, size, don,todo, fl)::orlist)
1476 | Failed_in _ when depth > 0 ->
1477 ( (* more depth or is the first time we see the goal *)
1478 if prunable m s gty todo then
1480 "FAIL: LOOP: one father is equal"));
1481 aux tables maxm flags cache orlist)
1483 let cache = cache_add_underinspection cache gty depth in
1484 auto_status := status;
1487 (lazy ("INSPECTING: " ^
1488 string_of_int gno ^ "("^ string_of_int size ^ "): "^
1490 (* elems are possible computations for proving gty *)
1491 let elems, tables, cache, maxm, flags =
1492 equational_and_applicative_case
1493 universe flags m s g gty tables cache maxm context
1496 (* this goal has failed *)
1497 let cache = close_failures ((g,gty)::fl) cache in
1498 aux tables maxm flags cache orlist
1500 (* elems = (cand,m,s,gl) *)
1501 let size_gl l = List.length
1502 (List.filter (function (_,_,P) -> true | _ -> false) l)
1505 let inj_gl gl = List.map (fun g -> D g) gl in
1506 let rec map = function
1507 | [] -> assert false
1508 | (cand,m,s,gl)::[] ->
1509 (* in the last one we add the failure *)
1511 inj_gl gl @ (S(g,gty,cand,size+1))::todo
1513 (* we are the last in OR, we fail on g and
1514 * also on all failures implied by g *)
1515 (m,s, size + size_gl gl, don, todo, (g,gty)::fl)
1517 | (cand,m,s,gl)::tl ->
1518 (* we add the S step after gl and before todo *)
1520 inj_gl gl @ (S(g,gty,cand,size+1))::todo
1522 (* since we are not the last in OR, we do not
1524 (m,s, size + size_gl gl, don, todo, []) :: map tl
1528 aux tables maxm flags cache elems)
1531 debug_print (lazy ("FAIL: DEPTH: " ^ string_of_int gno));
1532 let cache = close_failures fl cache in
1533 aux tables maxm flags cache orlist)
1535 (aux tables maxm flags cache elems : auto_result)
1540 auto_all_solutions maxm tables universe cache context metasenv gl flags
1542 let goals = order_new_goals metasenv [] gl CicPp.ppterm in
1545 (fun (x,s) -> D (x,flags.maxdepth,s)) goals
1547 let elems = [metasenv,[],1,[],goals,[]] in
1548 let rec aux tables maxm solutions cache elems flags =
1549 match auto_main tables maxm context flags universe cache elems with
1550 | Gaveup (tables,cache,maxm) ->
1551 solutions,cache,maxm
1552 | Proved (metasenv,subst,others,tables,cache,maxm) ->
1553 if Unix.gettimeofday () > flags.timeout then
1554 ((subst,metasenv)::solutions), cache, maxm
1556 aux tables maxm ((subst,metasenv)::solutions) cache others flags
1558 let rc = aux tables maxm [] cache elems flags in
1560 | [],cache,maxm -> [],cache,maxm
1561 | solutions,cache,maxm ->
1564 (fun (subst,newmetasenv) ->
1566 ProofEngineHelpers.compare_metasenvs ~oldmetasenv:metasenv ~newmetasenv
1568 if opened = [] then Some subst else None)
1571 solutions,cache,maxm
1574 (* }}} ****************** AUTO ***************)
1576 let auto flags metasenv tables universe cache context metasenv gl =
1577 let initial_time = Unix.gettimeofday() in
1578 let goals = order_new_goals metasenv [] gl CicPp.ppterm in
1579 let goals = List.map (fun (x,s) -> D(x,flags.maxdepth,s)) goals in
1580 let elems = [metasenv,[],1,[],goals,[]] in
1581 match auto_main tables 0 context flags universe cache elems with
1582 | Proved (metasenv,subst,_, tables,cache,_) ->
1584 ("TIME:"^string_of_float(Unix.gettimeofday()-.initial_time)));
1585 Some (subst,metasenv), cache
1586 | Gaveup (tables,cache,maxm) ->
1588 ("TIME:"^string_of_float(Unix.gettimeofday()-.initial_time)));
1592 let applyS_tac ~dbd ~term ~params ~universe =
1593 ProofEngineTypes.mk_tactic
1597 apply_smart ~dbd ~term ~subst:[] ~params ~universe status
1601 | CicUnification.UnificationFailure msg
1602 | CicTypeChecker.TypeCheckerFailure msg ->
1603 raise (ProofEngineTypes.Fail msg))
1605 let auto_tac ~(dbd:HSql.dbd) ~params:(univ,params) ~universe (proof, goal) =
1606 let _,metasenv,_subst,_,_, _ = proof in
1607 let _,context,goalty = CicUtil.lookup_meta goal metasenv in
1608 let universe = universe_of_params metasenv context universe univ in
1609 let flags = flags_of_params params () in
1610 let use_library = flags.use_library in
1611 let tables,cache,newmeta =
1612 init_cache_and_tables ~dbd use_library flags.use_only_paramod true
1613 false universe (proof, goal) in
1614 let tables,cache,newmeta =
1615 if flags.close_more then
1617 tables newmeta context (proof, goal)
1618 auto_all_solutions universe cache
1619 else tables,cache,newmeta in
1620 let initial_time = Unix.gettimeofday() in
1621 let (_,oldmetasenv,_subst,_,_, _) = proof in
1624 metasenv,[],1,[],[D (goal,flags.maxdepth,P)],[]
1626 match auto_main tables newmeta context flags universe cache [elem] with
1627 | Proved (metasenv,subst,_, tables,cache,_) ->
1629 ("TIME:"^string_of_float(Unix.gettimeofday()-.initial_time)));
1630 let proof,metasenv =
1631 ProofEngineHelpers.subst_meta_and_metasenv_in_proof
1632 proof goal subst metasenv
1635 ProofEngineHelpers.compare_metasenvs ~oldmetasenv
1636 ~newmetasenv:metasenv
1639 | Gaveup (tables,cache,maxm) ->
1642 string_of_float(Unix.gettimeofday()-.initial_time)));
1643 raise (ProofEngineTypes.Fail (lazy "Auto gave up"))
1646 let auto_tac ~dbd ~params ~universe =
1647 ProofEngineTypes.mk_tactic (auto_tac ~params ~dbd ~universe);;
1649 let eq_of_goal = function
1650 | Cic.Appl [Cic.MutInd(uri,0,_);_;_;_] when LibraryObjects.is_eq_URI uri ->
1652 | _ -> raise (ProofEngineTypes.Fail (lazy ("The goal is not an equality ")))
1655 (* performs steps of rewrite with the universe, obtaining if possible
1657 let solve_rewrite_tac ~universe ~params:(univ,params) (proof,goal as status)=
1658 let _,metasenv,_subst,_,_,_ = proof in
1659 let _,context,ty = CicUtil.lookup_meta goal metasenv in
1660 let steps = int_of_string (string params "steps" "1") in
1661 let universe = universe_of_params metasenv context universe univ in
1662 let eq_uri = eq_of_goal ty in
1663 let (active,passive,bag), cache, maxm =
1664 (* we take the whole universe (no signature filtering) *)
1665 init_cache_and_tables false true false true universe (proof,goal)
1667 let initgoal = [], metasenv, ty in
1669 let equalities = (Saturation.list_of_passive passive) in
1670 (* we demodulate using both actives passives *)
1671 List.fold_left (fun tbl eq -> Indexing.index tbl eq) (snd active) equalities
1673 let env = metasenv,context,CicUniv.oblivion_ugraph in
1674 match Indexing.solve_demodulating bag env table initgoal steps with
1675 | Some (proof, metasenv, newty) ->
1678 | Cic.Appl[Cic.MutInd _;eq_ty;left;_] ->
1679 Equality.Exact (Equality.refl_proof eq_uri eq_ty left)
1683 Equality.build_goal_proof
1684 bag eq_uri proof refl newty [] context metasenv
1686 ProofEngineTypes.apply_tactic
1687 (PrimitiveTactics.apply_tac ~term:proofterm) status
1690 (ProofEngineTypes.Fail (lazy
1691 ("Unable to solve with " ^ string_of_int steps ^ " demodulations")))
1693 let solve_rewrite_tac ~params ~universe () =
1694 ProofEngineTypes.mk_tactic (solve_rewrite_tac ~universe ~params)
1697 (* Demodulate thorem *)
1698 let open_type ty bo =
1699 let rec open_type_aux context ty k args =
1701 | Cic.Prod (n,s,t) ->
1703 FreshNamesGenerator.mk_fresh_name [] context n ~typ:s ~subst:[] in
1704 let entry = match n' with
1705 | Cic.Name _ -> Some (n',(Cic.Decl s))
1706 | Cic.Anonymous -> None
1708 open_type_aux (entry::context) t (k+1) ((Cic.Rel k)::args)
1709 | Cic.LetIn (n,s,sty,t) ->
1710 let entry = Some (n,(Cic.Def (s,sty)))
1712 open_type_aux (entry::context) t (k+1) args
1713 | _ -> context, ty, args
1715 let context, ty, args = open_type_aux [] ty 1 [] in
1717 | [] -> context, ty, bo
1718 | _ -> context, ty, Cic.Appl (bo::args)
1721 let rec close_type bo ty context =
1723 | [] -> assert_proof_is_valid bo [] [] ty; (bo,ty)
1724 | Some (n,(Cic.Decl s))::tl ->
1725 close_type (Cic.Lambda (n,s,bo)) (Cic.Prod (n,s,ty)) tl
1726 | Some (n,(Cic.Def (s,sty)))::tl ->
1727 close_type (Cic.LetIn (n,s,sty,bo)) (Cic.LetIn (n,s,sty,ty)) tl
1731 let is_subsumed univ context ty =
1732 let candidates = Universe.get_candidates univ ty in
1736 | Some found -> Some found
1739 let mk_irl = CicMkImplicit.identity_relocation_list_for_metavariable in
1740 let metasenv = [(0,context,ty)] in
1741 let fake_proof = None,metasenv,[] , (lazy (Cic.Meta(0,mk_irl context))),ty,[] in
1742 let subst,((_,metasenv,_,_,_,_), open_goals),maxmeta =
1743 (PrimitiveTactics.apply_with_subst ~subst:[] ~maxmeta:0 ~term:cand) (fake_proof,0)
1745 let prop_goals, other = split_goals_in_prop metasenv subst open_goals in
1746 if prop_goals = [] then Some cand else None
1748 | ProofEngineTypes.Fail s -> None
1749 | CicUnification.Uncertain s -> None
1753 let demodulate_theorem ~universe uri =
1755 match LibraryObjects.eq_URI () with
1757 | None -> raise (ProofEngineTypes.Fail (lazy "equality not declared")) in
1758 let obj,_ = CicEnvironment.get_cooked_obj CicUniv.empty_ugraph uri
1762 | Cic.Constant(n, _, ty ,_, _) -> open_type ty (Cic.Const(uri,[]))
1763 | _ -> raise (ProofEngineTypes.Fail (lazy "not a theorem"))
1765 if CicUtil.is_closed ty then
1766 raise (ProofEngineTypes.Fail (lazy ("closed term: dangerous reduction")));
1767 let initgoal = [], [], ty in
1768 (* compute the signature *)
1770 let ty_set = MetadataConstraints.constants_of ty in
1771 let hyp_set = MetadataQuery.signature_of_hypothesis context [] in
1772 let set = MetadataConstraints.UriManagerSet.union ty_set hyp_set in
1773 MetadataQuery.close_with_types set [] context
1775 (* retrieve equations from the universe universe *)
1777 retrieve_equations true signature universe AutoCache.cache_empty context []
1780 (lazy ("ho trovato equazioni n. "^(string_of_int (List.length equations))));
1785 CicTypeChecker.type_of_aux' [] context t CicUniv.oblivion_ugraph
1787 (* retrieve_equations could also return flexible terms *)
1788 if is_an_equality ty then Some(t,ty)
1791 let ty' = unfold context ty in
1792 if is_an_equality ty' then Some(t,ty') else None
1793 with ProofEngineTypes.Fail _ -> None)
1796 let bag = Equality.mk_equality_bag () in
1798 let units, _, newmeta =
1799 partition_unit_equalities context [] (CicMkImplicit.new_meta [] []) bag eqs_and_types
1803 (fun tbl eq -> Indexing.index tbl eq)
1804 Indexing.empty units
1806 let changed,(newproof,newmetasenv, newty) =
1808 ([],context,CicUniv.oblivion_ugraph) table initgoal in
1811 let oldproof = Equality.Exact bo in
1813 Equality.build_goal_proof (~contextualize:false) (~forward:true) bag
1814 eq_uri newproof oldproof ty [] context newmetasenv
1816 if newmetasenv <> [] then
1817 raise (ProofEngineTypes.Fail (lazy ("metasenv not empty")))
1820 assert_proof_is_valid proofterm newmetasenv context newty;
1821 match is_subsumed universe context newty with
1823 (ProofEngineTypes.Fail (lazy ("subsumed by " ^ CicPp.ppterm t)))
1824 | None -> close_type proofterm newty context
1827 else (* if newty = ty then *)
1828 raise (ProofEngineTypes.Fail (lazy "no progress"))
1829 (*else ProofEngineTypes.apply_tactic
1830 (ReductionTactics.simpl_tac
1831 ~pattern:(ProofEngineTypes.conclusion_pattern None)) initialstatus*)
1835 (* NEW DEMODULATE *)
1836 let demodulate_tac ~dbd ~universe ~params:(univ, params) (proof,goal)=
1837 let curi,metasenv,_subst,pbo,pty, attrs = proof in
1838 let metano,context,ty = CicUtil.lookup_meta goal metasenv in
1839 let universe = universe_of_params metasenv context universe univ in
1840 let irl = CicMkImplicit.identity_relocation_list_for_metavariable context in
1841 let initgoal = [], metasenv, ty in
1843 match LibraryObjects.eq_URI () with
1845 | None -> raise (ProofEngineTypes.Fail (lazy "equality not declared")) in
1846 (* let eq_uri = eq_of_goal ty in *)
1847 let (active,passive,bag), cache, maxm =
1848 init_cache_and_tables
1849 ~dbd false false true true universe (proof,goal)
1851 let equalities = (Saturation.list_of_passive passive) in
1852 (* we demodulate using both actives passives *)
1855 (fun tbl eq -> Indexing.index tbl eq)
1856 (snd active) equalities
1858 let changed,(newproof,newmetasenv, newty) =
1859 (* Indexing.demodulation_goal bag *)
1861 (metasenv,context,CicUniv.oblivion_ugraph) table initgoal
1865 let opengoal = Equality.Exact (Cic.Meta(maxm,irl)) in
1867 Equality.build_goal_proof (~contextualize:false) bag
1868 eq_uri newproof opengoal ty [] context metasenv
1870 let extended_metasenv = (maxm,context,newty)::metasenv in
1871 let extended_status =
1872 (curi,extended_metasenv,_subst,pbo,pty, attrs),goal in
1873 let (status,newgoals) =
1874 ProofEngineTypes.apply_tactic
1875 (PrimitiveTactics.apply_tac ~term:proofterm)
1877 (status,maxm::newgoals)
1879 else (* if newty = ty then *)
1880 raise (ProofEngineTypes.Fail (lazy "no progress"))
1881 (*else ProofEngineTypes.apply_tactic
1882 (ReductionTactics.simpl_tac
1883 ~pattern:(ProofEngineTypes.conclusion_pattern None)) initialstatus*)
1886 let demodulate_tac ~dbd ~params ~universe =
1887 ProofEngineTypes.mk_tactic (demodulate_tac ~dbd ~params ~universe);;
1889 let pp_proofterm = Equality.pp_proofterm;;
1891 let revision = "$Revision$";;
1892 let size_and_depth context metasenv t = 100, 100