2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
14 let print ?(depth=0) s =
15 prerr_endline (String.make depth '\t'^Lazy.force s)
16 let noprint ?(depth=0) _ = ()
17 let debug_print = noprint
19 open Continuationals.Stack
21 module Ast = CicNotationPt
23 (* ======================= statistics ========================= *)
25 let app_counter = ref 0
28 type t = NReference.reference
30 let compare = Pervasives.compare
31 let hash = Hashtbl.hash
34 module RefHash = Hashtbl.Make(RHT);;
37 nominations : int ref;
41 let statistics: info RefHash.t = RefHash.create 503
43 let incr_nominations tbl item =
45 let v = RefHash.find tbl item in incr v.nominations
47 RefHash.add tbl item {nominations = ref 1; uses = ref 0}
49 let incr_uses tbl item =
51 let v = RefHash.find tbl item in incr v.uses
52 with Not_found -> assert false
58 | Ast.NCic _ (* local candidate *)
62 let l = RefHash.fold (fun a v l -> (a,v)::l) tbl [] in
63 let relevance v = float !(v.uses) /. float !(v.nominations) in
64 let vcompare (_,v1) (_,v2) =
65 Pervasives.compare (relevance v1) (relevance v2) in
66 let l = List.sort vcompare l in
68 CicNotationPp.pp_term (Ast.NRef a) ^ ": rel = " ^
69 (string_of_float (relevance v)) ^
70 "; uses = " ^ (string_of_int !(v.uses)) in
71 lazy (String.concat "\n" (List.map vstring l))
73 (* ======================= utility functions ========================= *)
74 module IntSet = Set.Make(struct type t = int let compare = compare end)
76 let get_sgoalty status g =
77 let _,_,metasenv,subst,_ = status#obj in
79 let _, ctx, ty = NCicUtils.lookup_meta g metasenv in
80 let ty = NCicUntrusted.apply_subst subst ctx ty in
81 let ctx = NCicUntrusted.apply_subst_context
82 ~fix_projections:true subst ctx
84 NTacStatus.mk_cic_term ctx ty
85 with NCicUtils.Meta_not_found _ as exn -> fail ~exn (lazy "get_sgoalty")
89 let gty = get_sgoalty status g in
90 metas_of_term status gty
93 let menv_closure status gl =
94 let rec closure acc = function
96 | x::l when IntSet.mem x acc -> closure acc l
97 | x::l -> closure (IntSet.add x acc) (deps status x @ l)
98 in closure IntSet.empty gl
101 (* we call a "fact" an object whose hypothesis occur in the goal
102 or in types of goal-variables *)
103 let branch status ty =
104 let status, ty, metas = saturate ~delta:0 status ty in
105 noprint (lazy ("saturated ty :" ^ (ppterm status ty)));
106 let g_metas = metas_of_term status ty in
107 let clos = menv_closure status g_metas in
108 (* let _,_,metasenv,_,_ = status#obj in *)
112 let _, m = term_of_cic_term status m (ctx_of m) in
114 | NCic.Meta(i,_) -> IntSet.add i acc
118 (* IntSet.subset menv clos *)
119 IntSet.cardinal(IntSet.diff menv clos)
121 let is_a_fact status ty = branch status ty = 0
123 let is_a_fact_obj s uri =
124 let obj = NCicEnvironment.get_checked_obj uri in
126 | (_,_,[],[],NCic.Constant(_,_,_,ty,_)) ->
127 is_a_fact s (mk_cic_term [] ty)
128 (* aggiungere i costruttori *)
131 let is_a_fact_ast status subst metasenv ctx cand =
133 (lazy ("------- checking " ^ CicNotationPp.pp_term cand));
134 let status, t = disambiguate status ctx ("",0,cand) None in
135 let status,t = term_of_cic_term status t ctx in
136 let ty = NCicTypeChecker.typeof subst metasenv ctx t in
137 is_a_fact status (mk_cic_term ctx ty)
139 let current_goal status =
140 let open_goals = head_goals status#stack in
141 assert (List.length open_goals = 1);
142 let open_goal = List.hd open_goals in
143 let gty = get_goalty status open_goal in
144 let ctx = ctx_of gty in
147 let height_of_ref (NReference.Ref (uri, x)) =
152 | NReference.CoFix _ ->
153 let _,height,_,_,_ = NCicEnvironment.get_checked_obj uri in
155 | NReference.Def h -> h
156 | NReference.Fix (_,_,h) -> h
159 (*************************** height functions ********************************)
160 let fast_height_of_term t =
164 NCic.Meta (_,(_,NCic.Ctx l)) -> List.iter aux l
168 | NCic.Implicit _ -> assert false
171 prerr_endline (NCicPp.ppterm ~metasenv:[] ~subst:[]
172 ~context:[] t ^ ":" ^ string_of_int (height_of_ref nref));
174 h := max !h (height_of_ref nref)
175 | NCic.Prod (_,t1,t2)
176 | NCic.Lambda (_,t1,t2) -> aux t1; aux t2
177 | NCic.LetIn (_,s,ty,t) -> aux s; aux ty; aux t
178 | NCic.Appl l -> List.iter aux l
179 | NCic.Match (_,outty,t,pl) -> aux outty; aux t; List.iter aux pl
184 let height_of_goal g status =
185 let ty = get_goalty status g in
186 let context = ctx_of ty in
187 let _, ty = term_of_cic_term status ty (ctx_of ty) in
188 let h = ref (fast_height_of_term ty) in
191 | _, NCic.Decl ty -> h := max !h (fast_height_of_term ty)
192 | _, NCic.Def (bo,ty) ->
193 h := max !h (fast_height_of_term ty);
194 h := max !h (fast_height_of_term bo);
200 let height_of_goals status =
201 let open_goals = head_goals status#stack in
202 assert (List.length open_goals > 0);
206 h := max !h (height_of_goal open_goal status))
208 debug_print (lazy ("altezza sequente: " ^ string_of_int !h));
212 (* =============================== paramod =========================== *)
213 let solve f status eq_cache goal =
216 if fast then NCicParamod.fast_eq_check
217 else NCicParamod.paramod in
219 let n,h,metasenv,subst,o = status#obj in
220 let gname, ctx, gty = List.assoc goal metasenv in
221 let gty = NCicUntrusted.apply_subst subst ctx gty in
222 let build_status (pt, _, metasenv, subst) =
224 debug_print (lazy ("refining: "^(NCicPp.ppterm ctx subst metasenv pt)));
225 let stamp = Unix.gettimeofday () in
226 let metasenv, subst, pt, pty =
227 (* NCicRefiner.typeof status
228 (* (status#set_coerc_db NCicCoercion.empty_db) *)
229 metasenv subst ctx pt None in
230 print (lazy ("refined: "^(NCicPp.ppterm ctx subst metasenv pt)));
231 debug_print (lazy ("synt: "^(NCicPp.ppterm ctx subst metasenv pty)));
232 let metasenv, subst =
233 NCicUnification.unify status metasenv subst ctx gty pty *)
235 (status#set_coerc_db NCicCoercion.empty_db)
236 metasenv subst ctx pt (Some gty)
238 debug_print (lazy (Printf.sprintf "Refined in %fs"
239 (Unix.gettimeofday() -. stamp)));
240 let status = status#set_obj (n,h,metasenv,subst,o) in
241 let metasenv = List.filter (fun j,_ -> j <> goal) metasenv in
242 let subst = (goal,(gname,ctx,pt,pty)) :: subst in
243 Some (status#set_obj (n,h,metasenv,subst,o))
245 NCicRefiner.RefineFailure msg
246 | NCicRefiner.Uncertain msg ->
247 debug_print (lazy ("WARNING: refining in fast_eq_check failed\n" ^
248 snd (Lazy.force msg) ^
249 "\n in the environment\n" ^
250 NCicPp.ppmetasenv subst metasenv)); None
251 | NCicRefiner.AssertFailure msg ->
252 debug_print (lazy ("WARNING: refining in fast_eq_check failed" ^
254 "\n in the environment\n" ^
255 NCicPp.ppmetasenv subst metasenv)); None
258 HExtlib.filter_map build_status
259 (f status metasenv subst ctx eq_cache (NCic.Rel ~-1,gty))
262 let fast_eq_check eq_cache status goal =
263 match solve NCicParamod.fast_eq_check status eq_cache goal with
264 | [] -> raise (Error (lazy "no proof found",None))
268 let dist_fast_eq_check eq_cache s =
269 NTactics.distribute_tac (fast_eq_check eq_cache) s
272 let auto_eq_check eq_cache status =
274 let s = dist_fast_eq_check eq_cache status in
280 (* warning: ctx is supposed to be already instantiated w.r.t subst *)
281 let index_local_equations eq_cache status =
282 debug_print (lazy "indexing equations");
283 let open_goals = head_goals status#stack in
284 let open_goal = List.hd open_goals in
285 let ngty = get_goalty status open_goal in
286 let ctx = ctx_of ngty in
287 let ctx = apply_subst_context ~fix_projections:true status ctx in
292 let t = NCic.Rel !c in
294 let ty = NCicTypeChecker.typeof [] [] ctx t in
295 if is_a_fact status (mk_cic_term ctx ty) then
296 (debug_print(lazy("eq indexing " ^ (NCicPp.ppterm ctx [] [] ty)));
297 debug_print(lazy("riprovo " ^ (ppterm status (mk_cic_term ctx ty))));
298 NCicParamod.forward_infer_step eq_cache t ty)
300 (debug_print (lazy ("not a fact: " ^ (NCicPp.ppterm ctx [] [] ty)));
303 | NCicTypeChecker.TypeCheckerFailure _
304 | NCicTypeChecker.AssertFailure _ -> eq_cache)
308 let fast_eq_check_tac ~params s =
309 let unit_eq = index_local_equations s#eq_cache s in
310 dist_fast_eq_check unit_eq s
313 let paramod eq_cache status goal =
314 match solve NCicParamod.paramod status eq_cache goal with
315 | [] -> raise (Error (lazy "no proof found",None))
319 let paramod_tac ~params s =
320 let unit_eq = index_local_equations s#eq_cache s in
321 NTactics.distribute_tac (paramod unit_eq) s
324 let demod eq_cache status goal =
325 match solve NCicParamod.demod status eq_cache goal with
326 | [] -> raise (Error (lazy "no progress",None))
330 let demod_tac ~params s =
331 let unit_eq = index_local_equations s#eq_cache s in
332 NTactics.distribute_tac (demod unit_eq) s
336 let fast_eq_check_tac_all ~params eq_cache status =
337 let g,_,_ = current_goal status in
338 let allstates = fast_eq_check_all status eq_cache g in
339 let pseudo_low_tac s _ _ = s in
340 let pseudo_low_tactics =
341 List.map pseudo_low_tac allstates
343 List.map (fun f -> NTactics.distribute_tac f status) pseudo_low_tactics
348 let demod status eq_cache goal =
349 let n,h,metasenv,subst,o = status#obj in
350 let gname, ctx, gty = List.assoc goal metasenv in
351 let gty = NCicUntrusted.apply_subst subst ctx gty in
353 let demod_tac ~params s =
354 let unit_eq = index_local_equations s#eq_cache s in
355 dist_fast_eq_check unit_eq s
358 (*************** subsumption ****************)
360 let close_wrt_context =
364 | name, NCic.Decl t -> NCic.Prod(name,t,ty)
365 | name, NCic.Def(bo, _) -> NCicSubstitution.subst bo ty)
368 let args_for_context ?(k=1) ctx =
371 (fun (n,l) ctx_entry ->
373 | name, NCic.Decl t -> n+1,NCic.Rel(n)::l
374 | name, NCic.Def(bo, _) -> n+1,l)
378 let constant_for_meta ctx ty i =
379 let name = "cic:/foo"^(string_of_int i)^".con" in
380 let uri = NUri.uri_of_string name in
381 let ty = close_wrt_context ty ctx in
382 (* prerr_endline (NCicPp.ppterm [] [] [] ty); *)
383 let attr = (`Generated,`Definition,`Local) in
384 let obj = NCic.Constant([],name,None,ty,attr) in
385 (* Constant of relevance * string * term option * term * c_attr *)
389 let refresh metasenv =
391 (fun (metasenv,subst) (i,(iattr,ctx,ty)) ->
392 let ikind = NCicUntrusted.kind_of_meta iattr in
393 let metasenv,j,instance,ty =
394 NCicMetaSubst.mk_meta ~attrs:iattr
395 metasenv ctx ~with_type:ty ikind in
396 let s_entry = i,(iattr, ctx, instance, ty) in
397 let metasenv = List.filter (fun x,_ -> i <> x) metasenv in
398 metasenv,s_entry::subst)
399 (metasenv,[]) metasenv
401 (* close metasenv returns a ground instance of all the metas in the
402 metasenv, insantiatied with axioms, and the list of these axioms *)
403 let close_metasenv metasenv subst =
405 let metasenv = NCicUntrusted.apply_subst_metasenv subst metasenv in
407 let metasenv = NCicUntrusted.sort_metasenv subst metasenv in
409 (fun (subst,objs) (i,(iattr,ctx,ty)) ->
410 let ty = NCicUntrusted.apply_subst subst ctx ty in
412 NCicUntrusted.apply_subst_context ~fix_projections:true
414 let (uri,_,_,_,obj) as okind =
415 constant_for_meta ctx ty i in
417 NCicEnvironment.check_and_add_obj okind;
418 let iref = NReference.reference_of_spec uri NReference.Decl in
420 let args = args_for_context ctx in
421 if args = [] then NCic.Const iref
422 else NCic.Appl(NCic.Const iref::args)
424 (* prerr_endline (NCicPp.ppterm ctx [] [] iterm); *)
425 let s_entry = i, ([], ctx, iterm, ty)
426 in s_entry::subst,okind::objs
427 with _ -> assert false)
431 let ground_instances status gl =
432 let _,_,metasenv,subst,_ = status#obj in
433 let subset = menv_closure status gl in
434 let submenv = List.filter (fun (x,_) -> IntSet.mem x subset) metasenv in
436 let submenv = metasenv in
438 let subst, objs = close_metasenv submenv subst in
442 let (_, ctx, t, _) = List.assoc i subst in
443 debug_print (lazy (NCicPp.ppterm ctx [] [] t));
445 (fun (uri,_,_,_,_) as obj ->
446 NCicEnvironment.invalidate_item (`Obj (uri, obj)))
451 Not_found -> assert false
455 let replace_meta i args target =
456 let rec aux k = function
457 (* TODO: local context *)
458 | NCic.Meta (j,lc) when i = j ->
462 List.map (NCicSubstitution.subst_meta lc) args in
463 NCic.Appl(NCic.Rel k::args))
464 | NCic.Meta (j,lc) as m ->
471 aux k (NCicSubstitution.lift n t)) l))))
472 | t -> NCicUtils.map (fun _ k -> k+1) k aux t
477 let close_wrt_metasenv subst =
479 (fun ty (i,(iattr,ctx,mty)) ->
480 let mty = NCicUntrusted.apply_subst subst ctx mty in
482 NCicUntrusted.apply_subst_context ~fix_projections:true
484 let cty = close_wrt_context mty ctx in
485 let name = "foo"^(string_of_int i) in
486 let ty = NCicSubstitution.lift 1 ty in
487 let args = args_for_context ~k:1 ctx in
488 (* prerr_endline (NCicPp.ppterm ctx [] [] iterm); *)
489 let ty = replace_meta i args ty
491 NCic.Prod(name,cty,ty))
495 let _,_,metasenv,subst,_ = status#obj in
496 let subset = menv_closure status [g] in
497 let subset = IntSet.remove g subset in
498 let elems = IntSet.elements subset in
499 let _, ctx, ty = NCicUtils.lookup_meta g metasenv in
500 let ty = NCicUntrusted.apply_subst subst ctx ty in
501 debug_print (lazy ("metas in " ^ (NCicPp.ppterm ctx [] metasenv ty)));
502 debug_print (lazy (String.concat ", " (List.map string_of_int elems)));
503 let submenv = List.filter (fun (x,_) -> IntSet.mem x subset) metasenv in
504 let submenv = List.rev (NCicUntrusted.sort_metasenv subst submenv) in
506 let submenv = metasenv in
508 let ty = close_wrt_metasenv subst ty submenv in
509 debug_print (lazy (NCicPp.ppterm ctx [] [] ty));
513 (****************** smart application ********************)
515 let saturate_to_ref metasenv subst ctx nref ty =
516 let height = height_of_ref nref in
517 let rec aux metasenv ty args =
518 let ty,metasenv,moreargs =
519 NCicMetaSubst.saturate ~delta:height metasenv subst ctx ty 0 in
521 | NCic.Const(NReference.Ref (_,NReference.Def _) as nre)
523 let _, _, bo, _, _, _ = NCicEnvironment.get_checked_def nre in
524 aux metasenv bo (args@moreargs)
525 | NCic.Appl(NCic.Const(NReference.Ref (_,NReference.Def _) as nre)::tl)
527 let _, _, bo, _, _, _ = NCicEnvironment.get_checked_def nre in
528 aux metasenv (NCic.Appl(bo::tl)) (args@moreargs)
529 | _ -> ty,metasenv,(args@moreargs)
533 let smart_apply t unit_eq status g =
534 let n,h,metasenv,subst,o = status#obj in
535 let gname, ctx, gty = List.assoc g metasenv in
536 (* let ggty = mk_cic_term context gty in *)
537 let status, t = disambiguate status ctx t None in
538 let status,t = term_of_cic_term status t ctx in
539 let _,_,metasenv,subst,_ = status#obj in
540 let ty = NCicTypeChecker.typeof subst metasenv ctx t in
541 let ty,metasenv,args =
544 | NCic.Appl(NCic.Const(nref)::_) ->
545 saturate_to_ref metasenv subst ctx nref ty
547 NCicMetaSubst.saturate metasenv subst ctx ty 0 in
548 let metasenv,j,inst,_ = NCicMetaSubst.mk_meta metasenv ctx `IsTerm in
549 let status = status#set_obj (n,h,metasenv,subst,o) in
550 let pterm = if args=[] then t else
552 | NCic.Appl l -> NCic.Appl(l@args)
553 | _ -> NCic.Appl(t::args)
555 noprint(lazy("pterm " ^ (NCicPp.ppterm ctx [] [] pterm)));
556 noprint(lazy("pty " ^ (NCicPp.ppterm ctx [] [] ty)));
559 NUri.uri_of_string "cic:/matita/ng/Plogic/equality/eq_coerc.con" in
560 let ref = NReference.reference_of_spec uri (NReference.Def(2)) in
564 NCic.Appl[eq_coerc;ty;NCic.Implicit `Type;pterm;inst] in
565 let smart = mk_cic_term ctx smart in
567 let status = instantiate status g smart in
568 let _,_,metasenv,subst,_ = status#obj in
569 let _,ctx,jty = List.assoc j metasenv in
570 let jty = NCicUntrusted.apply_subst subst ctx jty in
571 debug_print(lazy("goal " ^ (NCicPp.ppterm ctx [] [] jty)));
572 fast_eq_check unit_eq status j
574 | Error _ as e -> debug_print (lazy "error"); raise e
576 let smart_apply_tac t s =
577 let unit_eq = index_local_equations s#eq_cache s in
578 NTactics.distribute_tac (smart_apply t unit_eq) s
580 let smart_apply_auto t eq_cache =
581 NTactics.distribute_tac (smart_apply t eq_cache)
584 (****************** types **************)
587 type th_cache = (NCic.context * InvRelDiscriminationTree.t) list
589 (* cartesian: term set list -> term list set *)
592 [] -> NDiscriminationTree.TermListSet.empty
594 NDiscriminationTree.TermSet.fold
595 (fun x acc -> NDiscriminationTree.TermListSet.add [x] acc) l NDiscriminationTree.TermListSet.empty
597 let rest = cartesian tl in
598 NDiscriminationTree.TermSet.fold
600 NDiscriminationTree.TermListSet.fold (fun l acc' -> NDiscriminationTree.TermListSet.add (x::l) acc') rest acc
601 ) he NDiscriminationTree.TermListSet.empty
604 (* all_keys_of_cic_type: term -> term set *)
605 let all_keys_of_cic_type metasenv subst context ty =
607 (* Here we are dropping the metasenv, but this should not raise any
608 exception (hopefully...) *)
610 NCicMetaSubst.saturate ~delta:max_int metasenv subst context ty 0
616 NCic.Appl (he::tl) ->
619 let wty = NCicReduction.whd ~delta:0 ~subst context ty in
621 NDiscriminationTree.TermSet.add ty (aux ty)
623 NDiscriminationTree.TermSet.union
624 (NDiscriminationTree.TermSet.add ty (aux ty))
625 (NDiscriminationTree.TermSet.add wty (aux wty))
628 NDiscriminationTree.TermListSet.fold
629 (fun l acc -> NDiscriminationTree.TermSet.add (NCic.Appl l) acc)
630 (cartesian ((NDiscriminationTree.TermSet.singleton he)::tl'))
631 NDiscriminationTree.TermSet.empty
632 | _ -> NDiscriminationTree.TermSet.empty
634 let ty,ity = saturate ty in
635 let wty,iwty = saturate (NCicReduction.whd ~delta:0 ~subst context ty) in
637 [ity, NDiscriminationTree.TermSet.add ty (aux ty)]
639 [ity, NDiscriminationTree.TermSet.add ty (aux ty) ;
640 iwty, NDiscriminationTree.TermSet.add wty (aux wty) ]
643 let all_keys_of_type status t =
644 let _,_,metasenv,subst,_ = status#obj in
645 let context = ctx_of t in
646 let status, t = apply_subst status context t in
648 all_keys_of_cic_type metasenv subst context
649 (snd (term_of_cic_term status t context))
653 (fun (intros,keys) ->
655 NDiscriminationTree.TermSet.fold
656 (fun t acc -> Ncic_termSet.add (mk_cic_term context t) acc)
657 keys Ncic_termSet.empty
662 let keys_of_type status orig_ty =
663 (* Here we are dropping the metasenv (in the status), but this should not
664 raise any exception (hopefully...) *)
665 let _, ty, _ = saturate ~delta:max_int status orig_ty in
666 let _, ty = apply_subst status (ctx_of ty) ty in
669 let orig_ty' = NCicTacReduction.normalize ~subst context orig_ty in
670 if orig_ty' <> orig_ty then
671 let ty',_,_= NCicMetaSubst.saturate ~delta:0 metasenv subst context orig_ty' 0 in
677 (*CSC: strange: we keep ty, ty normalized and ty ~delta:(h-1) *)
679 let _, ty = term_of_cic_term status ty (ctx_of ty) in
681 | NCic.Const (NReference.Ref (_,(NReference.Def h | NReference.Fix (_,_,h))))
682 | NCic.Appl (NCic.Const(NReference.Ref(_,(NReference.Def h | NReference.Fix (_,_,h))))::_)
684 let _,ty,_= saturate status ~delta:(h-1) orig_ty in
691 let all_keys_of_term status t =
692 let status, orig_ty = typeof status (ctx_of t) t in
693 all_keys_of_type status orig_ty
696 let keys_of_term status t =
697 let status, orig_ty = typeof status (ctx_of t) t in
698 keys_of_type status orig_ty
701 let mk_th_cache status gl =
703 (fun (status, acc) g ->
704 let gty = get_goalty status g in
705 let ctx = ctx_of gty in
706 debug_print(lazy("th cache for: "^ppterm status gty));
707 debug_print(lazy("th cache in: "^ppcontext status ctx));
708 if List.mem_assq ctx acc then status, acc else
709 let idx = InvRelDiscriminationTree.empty in
712 (fun (status, i, idx) _ ->
713 let t = mk_cic_term ctx (NCic.Rel i) in
714 let status, keys = keys_of_term status t in
715 debug_print(lazy("indexing: "^ppterm status t ^ ": " ^ string_of_int (List.length keys)));
717 List.fold_left (fun idx k ->
718 InvRelDiscriminationTree.index idx k t) idx keys
723 status, (ctx, idx) :: acc)
727 let add_to_th t c ty =
728 let key_c = ctx_of t in
729 if not (List.mem_assq key_c c) then
730 (key_c ,InvRelDiscriminationTree.index
731 InvRelDiscriminationTree.empty ty t ) :: c
733 let rec replace = function
735 | (x, idx) :: tl when x == key_c ->
736 (x, InvRelDiscriminationTree.index idx ty t) :: tl
737 | x :: tl -> x :: replace tl
742 let rm_from_th t c ty =
743 let key_c = ctx_of t in
744 if not (List.mem_assq key_c c) then assert false
746 let rec replace = function
748 | (x, idx) :: tl when x == key_c ->
749 (x, InvRelDiscriminationTree.remove_index idx ty t) :: tl
750 | x :: tl -> x :: replace tl
755 let pp_idx status idx =
756 InvRelDiscriminationTree.iter idx
758 debug_print(lazy("K: " ^ NCicInverseRelIndexable.string_of_path k));
760 (fun t -> debug_print(lazy("\t"^ppterm status t)))
767 debug_print(lazy( "-----------------------------------------------"));
768 debug_print(lazy( (NCicPp.ppcontext ~metasenv:[] ~subst:[] ctx)));
769 debug_print(lazy( "||====> "));
773 let search_in_th gty th =
774 let c = ctx_of gty in
775 let rec aux acc = function
776 | [] -> (* Ncic_termSet.elements *) acc
779 let idx = List.assoc(*q*) k th in
780 let acc = Ncic_termSet.union acc
781 (InvRelDiscriminationTree.retrieve_unifiables idx gty)
784 with Not_found -> aux acc tl
786 aux Ncic_termSet.empty c
790 do_types : bool; (* solve goals in Type *)
791 last : bool; (* last goal: take first solution only *)
792 candidates: Ast.term list option;
800 {facts : th_cache; (* positive results *)
801 under_inspection : cic_term list * th_cache; (* to prune looping *)
802 unit_eq : NCicParamod.state;
806 let add_to_trace ~depth cache t =
809 debug_print ~depth (lazy ("Adding to trace: " ^ CicNotationPp.pp_term t));
810 {cache with trace = t::cache.trace}
811 | Ast.NCic _ (* local candidate *)
812 | _ -> (*not an application *) cache
815 (lazy ("Proof Trace: " ^ (String.concat ";"
816 (List.map CicNotationPp.pp_term tr))))
818 let remove_from_trace cache t =
821 (match cache.trace with
822 | _::tl -> {cache with trace = tl}
824 | Ast.NCic _ (* local candidate *)
825 | _ -> (*not an application *) cache *)
828 type goal = int * sort (* goal, depth, sort *)
829 type fail = goal * cic_term
830 type candidate = int * Ast.term (* unique candidate number, candidate *)
832 exception Gaveup of IntSet.t (* a sublist of unprovable conjunctive
833 atoms of the input goals *)
834 exception Proved of NTacStatus.tac_status * Ast.term list
836 (* let close_failures _ c = c;; *)
837 (* let prunable _ _ _ = false;; *)
838 (* let cache_examine cache gty = `Notfound;; *)
839 (* let put_in_subst s _ _ _ = s;; *)
840 (* let add_to_cache_and_del_from_orlist_if_green_cut _ _ c _ _ o f _ = c, o, f, false ;; *)
841 (* let cache_add_underinspection c _ _ = c;; *)
843 let init_cache ?(facts=[]) ?(under_inspection=[],[])
844 ?(unit_eq=NCicParamod.empty_state)
848 under_inspection = under_inspection;
852 let only signature _context candidate = true
854 (* TASSI: nel trie ci mettiamo solo il body, non il ty *)
856 NCicTypeChecker.typeof ~subst:[] ~metasenv:[] [] candidate
858 let height = fast_height_of_term candidate_ty in
859 let rc = signature >= height in
861 debug_print (lazy ("Filtro: " ^ NCicPp.ppterm ~context:[] ~subst:[]
862 ~metasenv:[] candidate ^ ": " ^ string_of_int height))
864 debug_print (lazy ("Tengo: " ^ NCicPp.ppterm ~context:[] ~subst:[]
865 ~metasenv:[] candidate ^ ": " ^ string_of_int height));
870 let candidate_no = ref 0;;
872 let openg_no status = List.length (head_goals status#stack)
874 let sort_candidates status ctx candidates =
875 let _,_,metasenv,subst,_ = status#obj in
877 let status,ct = disambiguate status ctx ("",0,cand) None in
878 let status,t = term_of_cic_term status ct ctx in
879 let ty = NCicTypeChecker.typeof subst metasenv ctx t in
880 let res = branch status (mk_cic_term ctx ty) in
881 debug_print (lazy ("branch factor for: " ^ (ppterm status ct) ^ " = "
882 ^ (string_of_int res)));
885 let candidates = List.map (fun t -> branch t,t) candidates in
887 List.sort (fun (a,_) (b,_) -> a - b) candidates in
888 let candidates = List.map snd candidates in
889 debug_print (lazy ("candidates =\n" ^ (String.concat "\n"
890 (List.map CicNotationPp.pp_term candidates))));
893 let sort_new_elems l =
894 List.sort (fun (_,s1) (_,s2) -> openg_no s1 - openg_no s2) l
896 let try_candidate ?(smart=0) flags depth status eq_cache ctx t =
898 debug_print ~depth (lazy ("try " ^ CicNotationPp.pp_term t));
900 if smart= 0 then NTactics.apply_tac ("",0,t) status
901 else if smart = 1 then smart_apply_auto ("",0,t) eq_cache status
902 else (* smart = 2: both *)
903 try NTactics.apply_tac ("",0,t) status
905 smart_apply_auto ("",0,t) eq_cache status
908 let og_no = openg_no status in
909 if (* og_no > flags.maxwidth || *)
910 ((depth + 1) = flags.maxdepth && og_no <> 0) then
911 (debug_print ~depth (lazy "pruned immediately"); None)
914 let status, cict = disambiguate status ctx ("",0,t) None in
915 let status,ct = term_of_cic_term status cict ctx in
916 let _,_,metasenv,subst,_ = status#obj in
917 let ty = NCicTypeChecker.typeof subst metasenv ctx ct in
918 let res = branch status (mk_cic_term ctx ty) in
919 if smart=1 && og_no > res then
920 (print (lazy ("branch factor for: " ^ (ppterm status cict) ^ " = "
921 ^ (string_of_int res) ^ " vs. " ^ (string_of_int og_no)));
922 print ~depth (lazy "strange application"); None)
925 Some ((!candidate_no,t),status))
926 with Error (msg,exn) -> debug_print ~depth (lazy "failed"); None
929 let sort_of subst metasenv ctx t =
930 let ty = NCicTypeChecker.typeof subst metasenv ctx t in
931 let metasenv',ty = NCicUnification.fix_sorts metasenv subst ty in
932 assert (metasenv = metasenv');
933 NCicTypeChecker.typeof subst metasenv ctx ty
936 let type0= NUri.uri_of_string ("cic:/matita/pts/Type0.univ")
939 let perforate_small subst metasenv context t =
940 let rec aux = function
941 | NCic.Appl (hd::tl) ->
943 let s = sort_of subst metasenv context t in
945 | NCic.Sort(NCic.Type [`Type,u])
946 when u=type0 -> NCic.Meta (0,(0,NCic.Irl 0))
949 NCic.Appl (hd::List.map map tl)
955 let get_cands retrieve_for diff empty gty weak_gty =
956 let cands = retrieve_for gty in
958 | None -> cands, empty
960 let more_cands = retrieve_for weak_gty in
961 cands, diff more_cands cands
964 let get_candidates ?(smart=true) depth flags status cache signature gty =
965 let maxd = ((depth + 1) = flags.maxdepth) in
966 let universe = status#auto_cache in
967 let _,_,metasenv,subst,_ = status#obj in
968 let context = ctx_of gty in
969 let _, raw_gty = term_of_cic_term status gty context in
970 let raw_weak_gty, weak_gty =
976 let weak = perforate_small subst metasenv context raw_gty in
977 Some weak, Some (mk_cic_term context weak)
981 let global_cands, smart_global_cands =
982 match flags.candidates with
983 | Some l when (not maxd) -> l,[]
987 let to_ast = function
988 | NCic.Const r -> Ast.NRef r | _ -> assert false in
989 List.map to_ast (NDiscriminationTree.TermSet.elements s) in
992 (NDiscriminationTree.DiscriminationTree.retrieve_unifiables
994 NDiscriminationTree.TermSet.diff
995 NDiscriminationTree.TermSet.empty
996 raw_gty raw_weak_gty in
998 let local_cands,smart_local_cands =
1001 let _status, t = term_of_cic_term status t context
1003 List.map to_ast (Ncic_termSet.elements s) in
1006 (fun ty -> search_in_th ty cache)
1007 Ncic_termSet.diff Ncic_termSet.empty gty weak_gty in
1009 sort_candidates status context (global_cands@local_cands),
1010 sort_candidates status context (smart_global_cands@smart_local_cands)
1014 let get_candidates ?(smart=true) status cache signature gty =
1015 let universe = status#auto_cache in
1016 let _,_,metasenv,subst,_ = status#obj in
1017 let context = ctx_of gty in
1019 let _status, t = term_of_cic_term status t context
1021 let c_ast = function
1022 | NCic.Const r -> Ast.NRef r | _ -> assert false in
1023 let _, raw_gty = term_of_cic_term status gty context in
1024 let keys = all_keys_of_cic_term metasenv subst context raw_gty in
1025 (* we only keep those keys that do not require any intros for now *)
1026 let no_intros_keys = snd (List.hd keys) in
1028 NDiscriminationTree.TermSet.fold
1030 NDiscriminationTree.TermSet.union acc
1031 (NDiscriminationTree.DiscriminationTree.retrieve_unifiables
1033 ) no_intros_keys NDiscriminationTree.TermSet.empty in
1035 let cands = NDiscriminationTree.DiscriminationTree.retrieve_unifiables
1039 NDiscriminationTree.TermSet.fold
1041 Ncic_termSet.union acc (search_in_th (mk_cic_term context ty) cache)
1042 ) no_intros_keys Ncic_termSet.empty in
1044 let local_cands = search_in_th gty cache in
1046 debug_print (lazy ("candidates for" ^ NTacStatus.ppterm status gty));
1047 debug_print (lazy ("local cands = " ^ (string_of_int (List.length (Ncic_termSet.elements local_cands)))));
1048 let together global local =
1050 (List.filter (only signature context)
1051 (NDiscriminationTree.TermSet.elements global)) @
1052 List.map t_ast (Ncic_termSet.elements local) in
1053 let candidates = together cands local_cands in
1054 let candidates = sort_candidates status context candidates in
1055 let smart_candidates =
1061 let weak_gty = perforate_small subst metasenv context raw_gty in
1063 NCic.Appl (hd:: HExtlib.mk_list(NCic.Meta (0,(0,NCic.Irl 0)))
1064 (List.length tl)) in *)
1066 NDiscriminationTree.DiscriminationTree.retrieve_unifiables
1070 NDiscriminationTree.TermSet.diff more_cands cands in
1071 let cic_weak_gty = mk_cic_term context weak_gty in
1072 let more_local_cands = search_in_th cic_weak_gty cache in
1073 let smart_local_cands =
1074 Ncic_termSet.diff more_local_cands local_cands in
1075 together smart_cands smart_local_cands
1076 (* together more_cands more_local_cands *)
1080 let smart_candidates = sort_candidates status context smart_candidates in
1081 (* if smart then smart_candidates, []
1082 else candidates, [] *)
1083 candidates, smart_candidates
1086 let get_candidates ?(smart=true) flags status cache signature gty =
1087 match flags.candidates with
1088 | None -> get_candidates ~smart status cache signature gty
1092 let applicative_case depth signature status flags gty cache =
1093 app_counter:= !app_counter+1;
1094 let _,_,metasenv,subst,_ = status#obj in
1095 let context = ctx_of gty in
1096 let tcache = cache.facts in
1097 let is_prod, is_eq =
1098 let status, t = term_of_cic_term status gty context in
1099 let t = NCicReduction.whd subst context t in
1101 | NCic.Prod _ -> true, false
1102 | _ -> false, NCicParamod.is_equation metasenv subst context t
1104 debug_print(lazy (string_of_bool is_eq));
1105 let candidates, smart_candidates =
1106 get_candidates ~smart:(not is_eq) depth
1107 flags status tcache signature gty in
1109 (lazy ("candidates: " ^ string_of_int (List.length candidates)));
1111 (lazy ("smart candidates: " ^
1112 string_of_int (List.length smart_candidates)));
1115 let smart_candidates = [] in *)
1116 let sm = if is_eq then 0 else 2 in
1117 let maxd = ((depth + 1) = flags.maxdepth) in
1118 let only_one = flags.last && maxd in
1119 debug_print (lazy ("only_one: " ^ (string_of_bool only_one)));
1120 debug_print (lazy ("maxd: " ^ (string_of_bool maxd)));
1124 if (only_one && (elems <> [])) then elems
1126 if (maxd && not(is_prod) &
1127 not(is_a_fact_ast status subst metasenv context cand))
1128 then (debug_print (lazy "pruned: not a fact"); elems)
1130 match try_candidate (~smart:sm)
1131 flags depth status cache.unit_eq context cand with
1133 | Some x -> x::elems)
1137 if only_one && elems <> [] then elems
1141 if (only_one && (elems <> [])) then elems
1143 if (maxd && not(is_prod) &&
1144 not(is_a_fact_ast status subst metasenv context cand))
1145 then (debug_print (lazy "pruned: not a fact"); elems)
1147 match try_candidate (~smart:1)
1148 flags depth status cache.unit_eq context cand with
1150 | Some x -> x::elems)
1159 (* gty is supposed to be meta-closed *)
1160 let is_subsumed depth status gty cache =
1161 if cache=[] then false else (
1162 debug_print ~depth (lazy("Subsuming " ^ (ppterm status gty)));
1163 let n,h,metasenv,subst,obj = status#obj in
1164 let ctx = ctx_of gty in
1165 let _ , target = term_of_cic_term status gty ctx in
1166 let target = NCicSubstitution.lift 1 target in
1167 (* candidates must only be searched w.r.t the given context *)
1170 let idx = List.assq ctx cache in
1171 Ncic_termSet.elements
1172 (InvRelDiscriminationTree.retrieve_generalizations idx gty)
1173 with Not_found -> []
1176 (lazy ("failure candidates: " ^ string_of_int (List.length candidates)));
1180 let _ , source = term_of_cic_term status t ctx in
1182 NCic.Prod("foo",source,target) in
1183 let metasenv,j,_,_ =
1184 NCicMetaSubst.mk_meta
1185 metasenv ctx ~with_type:implication `IsType in
1186 let status = status#set_obj (n,h,metasenv,subst,obj) in
1187 let status = status#set_stack [([1,Open j],[],[],`NoTag)] in
1189 let status = NTactics.intro_tac "foo" status in
1191 NTactics.apply_tac ("",0,Ast.NCic (NCic.Rel 1)) status
1193 if (head_goals status#stack = []) then raise Found
1198 with Found -> debug_print ~depth (lazy "success");true)
1201 let rec guess_name name ctx =
1202 if name = "_" then guess_name "auto" ctx else
1203 if not (List.mem_assoc name ctx) then name else
1204 guess_name (name^"'") ctx
1207 let is_prod status =
1208 let _, ctx, gty = current_goal status in
1209 let status, gty = apply_subst status ctx gty in
1210 let _, raw_gty = term_of_cic_term status gty ctx in
1212 | NCic.Prod (name,src,_) ->
1213 let status, src = whd status ~delta:0 ctx (mk_cic_term ctx src) in
1214 (match snd (term_of_cic_term status src ctx) with
1215 | NCic.Const(NReference.Ref (_,NReference.Ind _) as r)
1216 | NCic.Appl (NCic.Const(NReference.Ref (_,NReference.Ind _) as r)::_) ->
1217 let _,_,itys,_,_ = NCicEnvironment.get_checked_indtys r in
1221 | [_,_,_,[]] -> `Inductive (guess_name name ctx)
1222 | _ -> `Some (guess_name name ctx))
1223 | _ -> `Some (guess_name name ctx))
1226 let intro ~depth status facts name =
1227 let status = NTactics.intro_tac name status in
1228 let _, ctx, ngty = current_goal status in
1229 let t = mk_cic_term ctx (NCic.Rel 1) in
1230 let status, keys = keys_of_term status t in
1231 let facts = List.fold_left (add_to_th t) facts keys in
1232 debug_print ~depth (lazy ("intro: "^ name));
1233 (* unprovability is not stable w.r.t introduction *)
1237 let rec intros_facts ~depth status facts =
1238 if List.length (head_goals status#stack) <> 1 then status, facts else
1239 match is_prod status with
1242 intro ~depth status facts name
1243 in intros_facts ~depth status facts
1244 | `Inductive name ->
1245 let status = NTactics.case1_tac name status in
1246 intros_facts ~depth status facts
1247 | _ -> status, facts
1250 let intros ~depth status cache =
1251 match is_prod status with
1254 let trace = cache.trace in
1256 intros_facts ~depth status cache.facts
1258 if head_goals status#stack = [] then
1259 let status = NTactics.merge_tac status in
1260 [(0,Ast.Ident("__intros",None)),status], cache
1262 (* we reindex the equation from scratch *)
1263 let unit_eq = index_local_equations status#eq_cache status in
1264 let status = NTactics.merge_tac status in
1265 [(0,Ast.Ident("__intros",None)),status],
1266 init_cache ~facts ~unit_eq () ~trace
1270 let reduce ~whd ~depth status g =
1271 let n,h,metasenv,subst,o = status#obj in
1272 let attr, ctx, ty = NCicUtils.lookup_meta g metasenv in
1273 let ty = NCicUntrusted.apply_subst subst ctx ty in
1275 (if whd then NCicReduction.whd else NCicTacReduction.normalize) ~subst ctx ty
1280 (lazy ("reduced to: "^ NCicPp.ppterm ctx subst metasenv ty'));
1282 (g,(attr,ctx,ty'))::(List.filter (fun (i,_) -> i<>g) metasenv)
1284 let status = status#set_obj (n,h,metasenv,subst,o) in
1285 (* we merge to gain a depth level; the previous goal level should
1287 let status = NTactics.merge_tac status in
1289 [(!candidate_no,Ast.Ident("__whd",None)),status])
1292 let do_something signature flags status g depth gty cache =
1293 let l0, cache = intros ~depth status cache in
1294 if l0 <> [] then l0, cache
1297 let l = (*reduce ~whd:true ~depth status g @*) reduce ~whd:true ~depth status g in
1298 (* if l <> [] then l,cache else *)
1299 (* backward aplications *)
1304 ((!candidate_no,Ast.Ident("__paramod",None)),s))
1305 (auto_eq_check cache.unit_eq status)
1308 if ((l1 <> []) && flags.last) then [] else
1309 applicative_case depth signature status flags gty cache
1313 (fun ((_,t),_) -> toref incr_nominations statistics t) l2;
1314 (* states in l1 have have an empty set of subgoals: no point to sort them *)
1316 (lazy ("alternatives = " ^ (string_of_int (List.length (l1@l@l2)))));
1317 (* l1 @ (sort_new_elems (l @ l2)), cache *)
1318 l1 @ (List.rev l2) @ l, cache
1321 let pp_goal = function
1322 | (_,Continuationals.Stack.Open i)
1323 | (_,Continuationals.Stack.Closed i) -> string_of_int i
1326 let pp_goals status l =
1330 let gty = get_goalty status i in
1331 NTacStatus.ppterm status gty)
1338 let compare = Pervasives.compare
1342 module MS = HTopoSort.Make(M)
1345 let sort_tac status =
1347 match status#stack with
1348 | [] -> assert false
1349 | (goals, t, k, tag) :: s ->
1350 let g = head_goals status#stack in
1352 (List.rev (MS.topological_sort g (deps status))) in
1353 debug_print (lazy ("old g = " ^
1354 String.concat "," (List.map string_of_int g)));
1355 debug_print (lazy ("sorted goals = " ^
1356 String.concat "," (List.map string_of_int sortedg)));
1357 let is_it i = function
1358 | (_,Continuationals.Stack.Open j )
1359 | (_,Continuationals.Stack.Closed j ) -> i = j
1362 List.map (fun i -> List.find (is_it i) goals) sortedg
1364 (sorted_goals, t, k, tag) :: s
1366 status#set_stack gstatus
1369 let clean_up_tac status =
1371 match status#stack with
1372 | [] -> assert false
1373 | (g, t, k, tag) :: s ->
1374 let is_open = function
1375 | (_,Continuationals.Stack.Open _) -> true
1376 | (_,Continuationals.Stack.Closed _) -> false
1378 let g' = List.filter is_open g in
1379 (g', t, k, tag) :: s
1381 status#set_stack gstatus
1384 let focus_tac focus status =
1386 match status#stack with
1387 | [] -> assert false
1388 | (g, t, k, tag) :: s ->
1389 let in_focus = function
1390 | (_,Continuationals.Stack.Open i)
1391 | (_,Continuationals.Stack.Closed i) -> List.mem i focus
1393 let focus,others = List.partition in_focus g
1395 (* we need to mark it as a BranchTag, otherwise cannot merge later *)
1396 (focus,[],[],`BranchTag) :: (others, t, k, tag) :: s
1398 status#set_stack gstatus
1401 let deep_focus_tac level focus status =
1402 let in_focus = function
1403 | (_,Continuationals.Stack.Open i)
1404 | (_,Continuationals.Stack.Closed i) -> List.mem i focus
1406 let rec slice level gs =
1407 if level = 0 then [],[],gs else
1409 | [] -> assert false
1410 | (g, t, k, tag) :: s ->
1411 let f,o,gs = slice (level-1) s in
1412 let f1,o1 = List.partition in_focus g
1414 (f1,[],[],`BranchTag)::f, (o1, t, k, tag)::o, gs
1417 let f,o,s = slice level status#stack in f@o@s
1419 status#set_stack gstatus
1422 let rec stack_goals level gs =
1423 if level = 0 then []
1425 | [] -> assert false
1427 let is_open = function
1428 | (_,Continuationals.Stack.Open i) -> Some i
1429 | (_,Continuationals.Stack.Closed _) -> None
1431 HExtlib.filter_map is_open g @ stack_goals (level-1) s
1434 let open_goals level status = stack_goals level status#stack
1437 let move_to_side level status =
1438 match status#stack with
1439 | [] -> assert false
1441 let is_open = function
1442 | (_,Continuationals.Stack.Open i) -> Some i
1443 | (_,Continuationals.Stack.Closed _) -> None
1445 let others = menv_closure status (stack_goals (level-1) tl) in
1446 List.for_all (fun i -> IntSet.mem i others)
1447 (HExtlib.filter_map is_open g)
1449 let rec auto_clusters ?(top=false)
1450 flags signature cache depth status : unit =
1451 debug_print ~depth (lazy ("entering auto clusters at depth " ^
1452 (string_of_int depth)));
1453 debug_print ~depth (pptrace cache.trace);
1454 (* ignore(Unix.select [] [] [] 0.01); *)
1455 let status = clean_up_tac status in
1456 let goals = head_goals status#stack in
1458 if depth = 0 then raise (Proved (status, cache.trace))
1460 let status = NTactics.merge_tac status in
1462 let l,tree = cache.under_inspection in
1464 | [] -> cache (* possible because of intros that cleans the cache *)
1465 | a::tl -> let tree = rm_from_th a tree a in
1466 {cache with under_inspection = tl,tree}
1468 auto_clusters flags signature cache (depth-1) status
1469 else if List.length goals < 2 then
1470 auto_main flags signature cache depth status
1472 let all_goals = open_goals (depth+1) status in
1473 debug_print ~depth (lazy ("goals = " ^
1474 String.concat "," (List.map string_of_int all_goals)));
1475 let classes = HExtlib.clusters (deps status) all_goals in
1478 if List.length gl > flags.maxwidth then
1479 (debug_print ~depth (lazy "FAIL GLOBAL WIDTH");
1480 raise (Gaveup IntSet.empty))
1482 if List.length classes = 1 then
1484 {flags with last = (List.length all_goals = 1)} in
1485 (* no need to cluster *)
1486 auto_main flags signature cache depth status
1488 let classes = if top then List.rev classes else classes in
1494 ("cluster:" ^ String.concat "," (List.map string_of_int l)))
1496 let status,trace,b =
1498 (fun (status,trace,b) gl ->
1499 let cache = {cache with trace = trace} in
1501 {flags with last = (List.length gl = 1)} in
1502 let lold = List.length status#stack in
1503 debug_print ~depth (lazy ("stack length = " ^
1504 (string_of_int lold)));
1505 let fstatus = deep_focus_tac (depth+1) gl status in
1507 debug_print ~depth (lazy ("focusing on" ^
1508 String.concat "," (List.map string_of_int gl)));
1509 auto_main flags signature cache depth fstatus; assert false
1511 | Proved(status,trace) ->
1512 let status = NTactics.merge_tac status in
1513 let lnew = List.length status#stack in
1514 assert (lold = lnew);
1516 | Gaveup _ when top -> (status,trace,b)
1518 (status,cache.trace,false) classes
1520 let rec final_merge n s =
1521 if n = 0 then s else final_merge (n-1) (NTactics.merge_tac s)
1522 in let status = final_merge depth status
1523 in if b then raise (Proved(status,trace)) else raise (Gaveup IntSet.empty)
1527 (* BRAND NEW VERSION *)
1528 auto_main flags signature cache depth status: unit =
1529 debug_print ~depth (lazy "entering auto main");
1530 debug_print ~depth (pptrace cache.trace);
1531 debug_print ~depth (lazy ("stack length = " ^
1532 (string_of_int (List.length status#stack))));
1533 (* ignore(Unix.select [] [] [] 0.01); *)
1534 let status = sort_tac (clean_up_tac status) in
1535 let goals = head_goals status#stack in
1537 | [] when depth = 0 -> raise (Proved (status,cache.trace))
1539 let status = NTactics.merge_tac status in
1541 let l,tree = cache.under_inspection in
1543 | [] -> cache (* possible because of intros that cleans the cache *)
1544 | a::tl -> let tree = rm_from_th a tree a in
1545 {cache with under_inspection = tl,tree}
1547 auto_clusters flags signature cache (depth-1) status
1549 if depth > 0 && move_to_side depth status
1551 let status = NTactics.merge_tac status in
1553 let l,tree = cache.under_inspection in
1555 | [] -> cache (* possible because of intros that cleans the cache*)
1556 | a::tl -> let tree = rm_from_th a tree a in
1557 {cache with under_inspection = tl,tree}
1559 auto_clusters flags signature cache (depth-1) status
1561 let ng = List.length goals in
1562 (* moved inside auto_clusters *)
1563 if ng > flags.maxwidth then
1564 (print ~depth (lazy "FAIL LOCAL WIDTH"); raise (Gaveup IntSet.empty))
1565 else if depth = flags.maxdepth then
1566 raise (Gaveup IntSet.empty)
1568 let status = NTactics.branch_tac ~force:true status in
1569 let g,gctx, gty = current_goal status in
1570 let ctx,ty = close status g in
1571 let closegty = mk_cic_term ctx ty in
1572 let status, gty = apply_subst status gctx gty in
1573 debug_print ~depth (lazy("Attacking goal " ^ (string_of_int g) ^" : "^ppterm status gty));
1574 if is_subsumed depth status closegty (snd cache.under_inspection) then
1575 (debug_print ~depth (lazy "SUBSUMED");
1576 raise (Gaveup IntSet.add g IntSet.empty))
1578 let new_sig = height_of_goal g status in
1579 if new_sig < signature then
1580 (debug_print (lazy ("news = " ^ (string_of_int new_sig)));
1581 debug_print (lazy ("olds = " ^ (string_of_int signature))));
1582 let alternatives, cache =
1583 do_something signature flags status g depth gty cache in
1585 let l,tree = cache.under_inspection in
1586 let l,tree = closegty::l, add_to_th closegty tree closegty in
1587 {cache with under_inspection = l,tree} in
1589 (fun ((_,t),status) ->
1591 (lazy ("(re)considering goal " ^
1592 (string_of_int g) ^" : "^ppterm status gty));
1593 debug_print (~depth:depth)
1594 (lazy ("Case: " ^ CicNotationPp.pp_term t));
1596 if t=Ast.Ident("__whd",None) ||
1597 t=Ast.Ident("__intros",None)
1599 else depth+1,loop_cache in
1600 let cache = add_to_trace ~depth cache t in
1602 auto_clusters flags signature cache depth status
1604 debug_print ~depth (lazy "Failed");
1607 raise (debug_print(lazy "no more candidates"); Gaveup IntSet.empty)
1610 let int name l def =
1611 try int_of_string (List.assoc name l)
1612 with Failure _ | Not_found -> def
1615 module AstSet = Set.Make(struct type t = Ast.term let compare = compare end)
1617 let cleanup_trace s trace =
1618 (* removing duplicates *)
1621 (fun acc t -> AstSet.add t acc)
1622 AstSet.empty trace in
1623 let trace = AstSet.elements trace_set
1624 (* filtering facts *)
1628 | Ast.NRef (NReference.Ref (u,_)) -> not (is_a_fact_obj s u)
1632 let auto_tac ~params:(univ,flags) status =
1633 let oldstatus = status in
1634 let status = (status:> NTacStatus.tac_status) in
1635 let goals = head_goals status#stack in
1636 let status, facts = mk_th_cache status goals in
1637 let unit_eq = index_local_equations status#eq_cache status in
1638 let cache = init_cache ~facts ~unit_eq () in
1639 (* pp_th status facts; *)
1641 NDiscriminationTree.DiscriminationTree.iter status#auto_cache (fun p t ->
1643 NDiscriminationTree.NCicIndexable.string_of_path p ^ " |--> " ^
1644 String.concat "\n " (List.map (
1645 NCicPp.ppterm ~metasenv:[] ~context:[] ~subst:[])
1646 (NDiscriminationTree.TermSet.elements t))
1654 let status, res = disambiguate status [] t None in
1655 let _,res = term_of_cic_term status res (ctx_of res)
1657 in Some (List.map to_Ast l)
1659 let depth = int "depth" flags 3 in
1660 let size = int "size" flags 10 in
1661 let width = int "width" flags 4 (* (3+List.length goals)*) in
1663 (* let goals = List.map (fun i -> (i,P)) goals in *)
1664 let signature = height_of_goals status in
1667 candidates = candidates;
1671 timeout = Unix.gettimeofday() +. 3000.;
1674 let initial_time = Unix.gettimeofday() in
1679 ("TIME ELAPSED:"^string_of_float(Unix.gettimeofday()-.initial_time)));
1681 ("Applicative nodes:"^string_of_int !app_counter));
1682 raise (Error (lazy "auto gave up", None)))
1684 let _ = debug_print (lazy("\n\nRound "^string_of_int x^"\n")) in
1685 let flags = { flags with maxdepth = x }
1687 try auto_clusters (~top:true) flags signature cache 0 status;assert false
1689 try auto_main flags signature cache 0 status;assert false
1692 | Gaveup _ -> up_to (x+1) y
1693 | Proved (s,trace) ->
1694 debug_print (lazy ("proved at depth " ^ string_of_int x));
1695 List.iter (toref incr_uses statistics) trace;
1696 let trace = cleanup_trace s trace in
1697 let _ = debug_print (pptrace trace) in
1700 | (g,t,k,f) :: rest -> (filter_open g,t,k,f):: rest
1703 let s = s#set_stack stack in
1704 oldstatus#set_status s
1706 let s = up_to depth depth in
1707 debug_print (print_stat statistics);
1709 ("TIME ELAPSED:"^string_of_float(Unix.gettimeofday()-.initial_time)));
1711 ("Applicative nodes:"^string_of_int !app_counter));