+ raise (ProofEngineTypes.Fail "No Applicable theorem")
+ in
+ PET.mk_tactic (auto_tac mqi_handle)
+;;
+
+*)
+
+(**** ESPERIMENTO ************************)
+
+let new_search_theorems f proof goal depth gtl =
+ let local_choices = f (proof,goal)
+ in
+ List.map
+ (function (proof, goallist) ->
+ (proof, (List.map (function g -> (g,depth)) goallist)@gtl))
+ local_choices
+;;
+
+exception NoOtherChoices;;
+
+let rec auto_new mqi_handle = function
+ [] -> raise NoOtherChoices
+ | (proof, [])::tl -> (proof, [])::tl
+ | (proof, (goal,0)::gtl)::tl -> auto_new mqi_handle tl
+ | (proof, (goal,depth)::gtl)::tl ->
+ let _,metasenv,_,_ = proof in
+ let meta_inf =
+ (try
+ let (_, ey ,ty) = CicUtil.lookup_meta goal metasenv in
+ Some (ey, ty)
+ with _ -> None) in
+ match meta_inf with
+ Some (ey, ty) ->
+ prerr_endline ("CURRENT GOAL = " ^ (CicPp.ppterm ty));
+ prerr_endline ("CURRENT HYP = " ^ (fst (print_context ey)));
+ let local_choices =
+ new_search_theorems
+ search_theorems_in_context proof goal (depth-1) gtl in
+ let global_choices =
+ new_search_theorems
+ (TacticChaser.searchTheorems mqi_handle)
+ proof goal (depth-1) gtl in
+ let all_choices =
+ local_choices@global_choices@tl in
+ let sorting_list (_,g1) (_,g2) =
+ let l1 = List.length g1 in
+ let l2 = List.length g2 in
+ if (l1 = l2 && not(l1 = 0)) then
+ (snd(List.nth g2 0)) - (snd(List.nth g1 0))
+ else l1 - l2 in
+ let reorder =
+ List.stable_sort sorting_list all_choices
+ in
+ auto_new mqi_handle reorder
+ | None -> auto_new mqi_handle ((proof,gtl)::tl)
+;;
+
+
+let auto_tac mqi_handle =
+(* CicMetaSubst.reset_counters (); *)
+ let auto_tac mqi_handle (proof,goal) =
+ prerr_endline "Entro in Auto";
+ try
+ let (proof,_)::_ = auto_new mqi_handle [(proof, [(goal,depth)])] in
+ prerr_endline "AUTO_TAC HA FINITO";
+(* CicMetaSubst.print_counters (); *)
+ (proof,[])
+ with
+ | NoOtherChoices ->
+ prerr_endline("Auto failed");
+ raise (ProofEngineTypes.Fail "No Applicable theorem")
+ in
+ ProofEngineTypes.mk_tactic (auto_tac mqi_handle)
+;;