wneuper/isa: src/HOL/Mirabelle/Tools/mirabelle

     1 (*  Title:      HOL/Mirabelle/Tools/mirabelle_sledgehammer.ML

     2     Author:     Jasmin Blanchette and Sascha Boehme and Tobias Nipkow, TU Munich

     3 *)

     5 structure Mirabelle_Sledgehammer : MIRABELLE_ACTION =

     6 struct

     8 val proverK = "prover"

     9 val prover_timeoutK = "prover_timeout"

    10 val keepK = "keep"

    11 val type_encK = "type_enc"

    12 val soundK = "sound"

    13 val slicingK = "slicing"

    14 val lambda_translationK = "lambda_translation"

    15 val e_weight_methodK = "e_weight_method"

    16 val force_sosK = "force_sos"

    17 val max_relevantK = "max_relevant"

    18 val minimizeK = "minimize"

    19 val minimize_timeoutK = "minimize_timeout"

    20 val metis_ftK = "metis_ft"

    21 val reconstructorK = "reconstructor"

    23 fun sh_tag id = "#" ^ string_of_int id ^ " sledgehammer: "

    24 fun minimize_tag id = "#" ^ string_of_int id ^ " minimize (sledgehammer): "

    25 fun reconstructor_tag reconstructor id =

    26   "#" ^ string_of_int id ^ " " ^ (!reconstructor) ^ " (sledgehammer): "

    28 val separator = "-----"

    31 datatype sh_data = ShData of {

    32   calls: int,

    33   success: int,

    34   nontriv_calls: int,

    35   nontriv_success: int,

    36   lemmas: int,

    37   max_lems: int,

    38   time_isa: int,

    39   time_prover: int,

    40   time_prover_fail: int}

    42 datatype re_data = ReData of {

    43   calls: int,

    44   success: int,

    45   nontriv_calls: int,

    46   nontriv_success: int,

    47   proofs: int,

    48   time: int,

    49   timeout: int,

    50   lemmas: int * int * int,

    51   posns: (Position.T * bool) list

    52   }

    54 datatype min_data = MinData of {

    55   succs: int,

    56   ab_ratios: int

    57   }

    59 fun make_sh_data

    60       (calls,success,nontriv_calls,nontriv_success,lemmas,max_lems,time_isa,

    61        time_prover,time_prover_fail) =

    62   ShData{calls=calls, success=success, nontriv_calls=nontriv_calls,

    63          nontriv_success=nontriv_success, lemmas=lemmas, max_lems=max_lems,

    64          time_isa=time_isa, time_prover=time_prover,

    65          time_prover_fail=time_prover_fail}

    67 fun make_min_data (succs, ab_ratios) =

    68   MinData{succs=succs, ab_ratios=ab_ratios}

    70 fun make_re_data (calls,success,nontriv_calls,nontriv_success,proofs,time,

    71                   timeout,lemmas,posns) =

    72   ReData{calls=calls, success=success, nontriv_calls=nontriv_calls,

    73          nontriv_success=nontriv_success, proofs=proofs, time=time,

    74          timeout=timeout, lemmas=lemmas, posns=posns}

    76 val empty_sh_data = make_sh_data (0, 0, 0, 0, 0, 0, 0, 0, 0)

    77 val empty_min_data = make_min_data (0, 0)

    78 val empty_re_data = make_re_data (0, 0, 0, 0, 0, 0, 0, (0,0,0), [])

    80 fun tuple_of_sh_data (ShData {calls, success, nontriv_calls, nontriv_success,

    81                               lemmas, max_lems, time_isa,

    82   time_prover, time_prover_fail}) = (calls, success, nontriv_calls,

    83   nontriv_success, lemmas, max_lems, time_isa, time_prover, time_prover_fail)

    85 fun tuple_of_min_data (MinData {succs, ab_ratios}) = (succs, ab_ratios)

    87 fun tuple_of_re_data (ReData {calls, success, nontriv_calls, nontriv_success,

    88   proofs, time, timeout, lemmas, posns}) = (calls, success, nontriv_calls,

    89   nontriv_success, proofs, time, timeout, lemmas, posns)

    92 datatype reconstructor_mode =

    93   Unminimized | Minimized | UnminimizedFT | MinimizedFT

    95 datatype data = Data of {

    96   sh: sh_data,

    97   min: min_data,

    98   re_u: re_data, (* reconstructor with unminimized set of lemmas *)

    99   re_m: re_data, (* reconstructor with minimized set of lemmas *)

   100   re_uft: re_data, (* reconstructor with unminimized set of lemmas and fully-typed *)

   101   re_mft: re_data, (* reconstructor with minimized set of lemmas and fully-typed *)

   102   mini: bool   (* with minimization *)

   103   }

   105 fun make_data (sh, min, re_u, re_m, re_uft, re_mft, mini) =

   106   Data {sh=sh, min=min, re_u=re_u, re_m=re_m, re_uft=re_uft, re_mft=re_mft,

   107     mini=mini}

   109 val empty_data = make_data (empty_sh_data, empty_min_data,

   110   empty_re_data, empty_re_data, empty_re_data, empty_re_data, false)

   112 fun map_sh_data f (Data {sh, min, re_u, re_m, re_uft, re_mft, mini}) =

   113   let val sh' = make_sh_data (f (tuple_of_sh_data sh))

   114   in make_data (sh', min, re_u, re_m, re_uft, re_mft, mini) end

   116 fun map_min_data f (Data {sh, min, re_u, re_m, re_uft, re_mft, mini}) =

   117   let val min' = make_min_data (f (tuple_of_min_data min))

   118   in make_data (sh, min', re_u, re_m, re_uft, re_mft, mini) end

   120 fun map_re_data f m (Data {sh, min, re_u, re_m, re_uft, re_mft, mini}) =

   121   let

   122     fun map_me g Unminimized   (u, m, uft, mft) = (g u, m, uft, mft)

   123       | map_me g Minimized     (u, m, uft, mft) = (u, g m, uft, mft)

   124       | map_me g UnminimizedFT (u, m, uft, mft) = (u, m, g uft, mft)

   125       | map_me g MinimizedFT   (u, m, uft, mft) = (u, m, uft, g mft)

   127     val f' = make_re_data o f o tuple_of_re_data

   129     val (re_u', re_m', re_uft', re_mft') =

   130       map_me f' m (re_u, re_m, re_uft, re_mft)

   131   in make_data (sh, min, re_u', re_m', re_uft', re_mft', mini) end

   133 fun set_mini mini (Data {sh, min, re_u, re_m, re_uft, re_mft, ...}) =

   134   make_data (sh, min, re_u, re_m, re_uft, re_mft, mini)

   136 fun inc_max (n:int) (s,sos,m) = (s+n, sos + n*n, Int.max(m,n));

   138 val inc_sh_calls =  map_sh_data

   139   (fn (calls, success, nontriv_calls, nontriv_success, lemmas,max_lems, time_isa, time_prover, time_prover_fail)

   140     => (calls + 1, success, nontriv_calls, nontriv_success, lemmas, max_lems, time_isa, time_prover, time_prover_fail))

   142 val inc_sh_success = map_sh_data

   143   (fn (calls, success, nontriv_calls, nontriv_success, lemmas,max_lems, time_isa, time_prover, time_prover_fail)

   144     => (calls, success + 1, nontriv_calls, nontriv_success, lemmas,max_lems, time_isa, time_prover, time_prover_fail))

   146 val inc_sh_nontriv_calls =  map_sh_data

   147   (fn (calls, success, nontriv_calls, nontriv_success, lemmas,max_lems, time_isa, time_prover, time_prover_fail)

   148     => (calls, success, nontriv_calls + 1, nontriv_success, lemmas, max_lems, time_isa, time_prover, time_prover_fail))

   150 val inc_sh_nontriv_success = map_sh_data

   151   (fn (calls, success, nontriv_calls, nontriv_success, lemmas,max_lems, time_isa, time_prover, time_prover_fail)

   152     => (calls, success, nontriv_calls, nontriv_success + 1, lemmas,max_lems, time_isa, time_prover, time_prover_fail))

   154 fun inc_sh_lemmas n = map_sh_data

   155   (fn (calls,success,nontriv_calls, nontriv_success, lemmas,max_lems,time_isa,time_prover,time_prover_fail)

   156     => (calls,success,nontriv_calls, nontriv_success, lemmas+n,max_lems,time_isa,time_prover,time_prover_fail))

   158 fun inc_sh_max_lems n = map_sh_data

   159   (fn (calls,success,nontriv_calls, nontriv_success, lemmas,max_lems,time_isa,time_prover,time_prover_fail)

   160     => (calls,success,nontriv_calls, nontriv_success, lemmas,Int.max(max_lems,n),time_isa,time_prover,time_prover_fail))

   162 fun inc_sh_time_isa t = map_sh_data

   163   (fn (calls,success,nontriv_calls, nontriv_success, lemmas,max_lems,time_isa,time_prover,time_prover_fail)

   164     => (calls,success,nontriv_calls, nontriv_success, lemmas,max_lems,time_isa + t,time_prover,time_prover_fail))

   166 fun inc_sh_time_prover t = map_sh_data

   167   (fn (calls,success,nontriv_calls, nontriv_success, lemmas,max_lems,time_isa,time_prover,time_prover_fail)

   168     => (calls,success,nontriv_calls, nontriv_success, lemmas,max_lems,time_isa,time_prover + t,time_prover_fail))

   170 fun inc_sh_time_prover_fail t = map_sh_data

   171   (fn (calls,success,nontriv_calls, nontriv_success, lemmas,max_lems,time_isa,time_prover,time_prover_fail)

   172     => (calls,success,nontriv_calls, nontriv_success, lemmas,max_lems,time_isa,time_prover,time_prover_fail + t))

   174 val inc_min_succs = map_min_data

   175   (fn (succs,ab_ratios) => (succs+1, ab_ratios))

   177 fun inc_min_ab_ratios r = map_min_data

   178   (fn (succs, ab_ratios) => (succs, ab_ratios+r))

   180 val inc_reconstructor_calls = map_re_data

   181   (fn (calls,success,nontriv_calls, nontriv_success, proofs,time,timeout,lemmas,posns)

   182     => (calls + 1, success, nontriv_calls, nontriv_success, proofs, time, timeout, lemmas,posns))

   184 val inc_reconstructor_success = map_re_data

   185   (fn (calls,success,nontriv_calls, nontriv_success, proofs,time,timeout,lemmas,posns)

   186     => (calls, success + 1, nontriv_calls, nontriv_success, proofs, time, timeout, lemmas,posns))

   188 val inc_reconstructor_nontriv_calls = map_re_data

   189   (fn (calls,success,nontriv_calls, nontriv_success, proofs,time,timeout,lemmas,posns)

   190     => (calls, success, nontriv_calls + 1, nontriv_success, proofs, time, timeout, lemmas,posns))

   192 val inc_reconstructor_nontriv_success = map_re_data

   193   (fn (calls,success,nontriv_calls, nontriv_success, proofs,time,timeout,lemmas,posns)

   194     => (calls, success, nontriv_calls, nontriv_success + 1, proofs, time, timeout, lemmas,posns))

   196 val inc_reconstructor_proofs = map_re_data

   197   (fn (calls,success,nontriv_calls, nontriv_success, proofs,time,timeout,lemmas,posns)

   198     => (calls, success, nontriv_calls, nontriv_success, proofs + 1, time, timeout, lemmas,posns))

   200 fun inc_reconstructor_time m t = map_re_data

   201  (fn (calls,success,nontriv_calls, nontriv_success, proofs,time,timeout,lemmas,posns)

   202   => (calls, success, nontriv_calls, nontriv_success, proofs, time + t, timeout, lemmas,posns)) m

   204 val inc_reconstructor_timeout = map_re_data

   205   (fn (calls,success,nontriv_calls, nontriv_success, proofs,time,timeout,lemmas,posns)

   206     => (calls, success, nontriv_calls, nontriv_success, proofs, time, timeout + 1, lemmas,posns))

   208 fun inc_reconstructor_lemmas m n = map_re_data

   209   (fn (calls,success,nontriv_calls, nontriv_success, proofs,time,timeout,lemmas,posns)

   210     => (calls, success, nontriv_calls, nontriv_success, proofs, time, timeout, inc_max n lemmas, posns)) m

   212 fun inc_reconstructor_posns m pos = map_re_data

   213   (fn (calls,success,nontriv_calls, nontriv_success, proofs,time,timeout,lemmas,posns)

   214     => (calls, success, nontriv_calls, nontriv_success, proofs, time, timeout, lemmas, pos::posns)) m

   216 val str0 = string_of_int o the_default 0

   218 local

   220 val str = string_of_int

   221 val str3 = Real.fmt (StringCvt.FIX (SOME 3))

   222 fun percentage a b = string_of_int (a * 100 div b)

   223 fun time t = Real.fromInt t / 1000.0

   224 fun avg_time t n =

   225   if n > 0 then (Real.fromInt t / 1000.0) / Real.fromInt n else 0.0

   227 fun log_sh_data log

   228     (calls, success, nontriv_calls, nontriv_success, lemmas, max_lems, time_isa, time_prover, time_prover_fail) =

   229  (log ("Total number of sledgehammer calls: " ^ str calls);

   230   log ("Number of successful sledgehammer calls: " ^ str success);

   231   log ("Number of sledgehammer lemmas: " ^ str lemmas);

   232   log ("Max number of sledgehammer lemmas: " ^ str max_lems);

   233   log ("Success rate: " ^ percentage success calls ^ "%");

   234   log ("Total number of nontrivial sledgehammer calls: " ^ str nontriv_calls);

   235   log ("Number of successful nontrivial sledgehammer calls: " ^ str nontriv_success);

   236   log ("Total time for sledgehammer calls (Isabelle): " ^ str3 (time time_isa));

   237   log ("Total time for successful sledgehammer calls (ATP): " ^ str3 (time time_prover));

   238   log ("Total time for failed sledgehammer calls (ATP): " ^ str3 (time time_prover_fail));

   239   log ("Average time for sledgehammer calls (Isabelle): " ^

   240     str3 (avg_time time_isa calls));

   241   log ("Average time for successful sledgehammer calls (ATP): " ^

   242     str3 (avg_time time_prover success));

   243   log ("Average time for failed sledgehammer calls (ATP): " ^

   244     str3 (avg_time time_prover_fail (calls - success)))

   245   )

   247 fun str_of_pos (pos, triv) =

   248   str0 (Position.line_of pos) (* ^ ":" ^ str0 (Position.offset_of pos) *) ^

   249   (if triv then "[T]" else "")

   251 fun log_re_data log tag sh_calls (re_calls, re_success, re_nontriv_calls,

   252      re_nontriv_success, re_proofs, re_time, re_timeout,

   253     (lemmas, lems_sos, lems_max), re_posns) =

   254  (log ("Total number of " ^ tag ^ "reconstructor calls: " ^ str re_calls);

   255   log ("Number of successful " ^ tag ^ "reconstructor calls: " ^ str re_success ^

   256     " (proof: " ^ str re_proofs ^ ")");

   257   log ("Number of " ^ tag ^ "reconstructor timeouts: " ^ str re_timeout);

   258   log ("Success rate: " ^ percentage re_success sh_calls ^ "%");

   259   log ("Total number of nontrivial " ^ tag ^ "reconstructor calls: " ^ str re_nontriv_calls);

   260   log ("Number of successful nontrivial " ^ tag ^ "reconstructor calls: " ^ str re_nontriv_success ^

   261     " (proof: " ^ str re_proofs ^ ")");

   262   log ("Number of successful " ^ tag ^ "reconstructor lemmas: " ^ str lemmas);

   263   log ("SOS of successful " ^ tag ^ "reconstructor lemmas: " ^ str lems_sos);

   264   log ("Max number of successful " ^ tag ^ "reconstructor lemmas: " ^ str lems_max);

   265   log ("Total time for successful " ^ tag ^ "reconstructor calls: " ^ str3 (time re_time));

   266   log ("Average time for successful " ^ tag ^ "reconstructor calls: " ^

   267     str3 (avg_time re_time re_success));

   268   if tag=""

   269   then log ("Proved: " ^ space_implode " " (map str_of_pos re_posns))

   270   else ()

   271  )

   273 fun log_min_data log (succs, ab_ratios) =

   274   (log ("Number of successful minimizations: " ^ string_of_int succs);

   275    log ("After/before ratios: " ^ string_of_int ab_ratios)

   276   )

   278 in

   280 fun log_data id log (Data {sh, min, re_u, re_m, re_uft, re_mft, mini}) =

   281   let

   282     val ShData {calls=sh_calls, ...} = sh

   284     fun app_if (ReData {calls, ...}) f = if calls > 0 then f () else ()

   285     fun log_re tag m =

   286       log_re_data log tag sh_calls (tuple_of_re_data m)

   287     fun log_reconstructor (tag1, m1) (tag2, m2) = app_if m1 (fn () =>

   288       (log_re tag1 m1; log ""; app_if m2 (fn () => log_re tag2 m2)))

   289   in

   290     if sh_calls > 0

   291     then

   292      (log ("\n\n\nReport #" ^ string_of_int id ^ ":\n");

   293       log_sh_data log (tuple_of_sh_data sh);

   294       log "";

   295       if not mini

   296       then log_reconstructor ("", re_u) ("fully-typed ", re_uft)

   297       else

   298         app_if re_u (fn () =>

   299          (log_reconstructor ("unminimized ", re_u) ("unminimized fully-typed ", re_uft);

   300           log "";

   301           app_if re_m (fn () =>

   302             (log_min_data log (tuple_of_min_data min); log "";

   303              log_reconstructor ("", re_m) ("fully-typed ", re_mft))))))

   304     else ()

   305   end

   307 end

   310 (* Warning: we implicitly assume single-threaded execution here! *)

   311 val data = Unsynchronized.ref ([] : (int * data) list)

   313 fun init id thy = (Unsynchronized.change data (cons (id, empty_data)); thy)

   314 fun done id ({log, ...}: Mirabelle.done_args) =

   315   AList.lookup (op =) (!data) id

   316   |> Option.map (log_data id log)

   317   |> K ()

   319 fun change_data id f = (Unsynchronized.change data (AList.map_entry (op =) id f); ())

   322 fun get_prover ctxt args =

   323   let

   324     fun default_prover_name () =

   325       hd (#provers (Sledgehammer_Isar.default_params ctxt []))

   326       handle Empty => error "No ATP available."

   327     fun get_prover name =

   328       (name, Sledgehammer_Run.get_minimizing_prover ctxt

   329                 Sledgehammer_Provers.Normal name)

   330   in

   331     (case AList.lookup (op =) args proverK of

   332       SOME name => get_prover name

   333     | NONE => get_prover (default_prover_name ()))

   334   end

   336 type locality = ATP_Translate.locality

   338 (* hack *)

   339 fun reconstructor_from_msg args msg =

   340   (case AList.lookup (op =) args reconstructorK of

   341     SOME name => name

   342   | NONE =>

   343     if String.isSubstring "metis (full_types)" msg then "metis (full_types)"

   344     else if String.isSubstring "metis (no_types)" msg then "metis (no_types)"

   345     else if String.isSubstring "metis" msg then "metis"

   346     else "smt")

   348 local

   350 datatype sh_result =

   351   SH_OK of int * int * (string * locality) list |

   352   SH_FAIL of int * int |

   353   SH_ERROR

   355 fun run_sh prover_name prover type_enc sound max_relevant slicing

   356         lambda_translation e_weight_method force_sos hard_timeout timeout dir

   357         pos st =

   358   let

   359     val {context = ctxt, facts = chained_ths, goal} = Proof.goal st

   360     val i = 1

   361     fun set_file_name (SOME dir) =

   362         Config.put Sledgehammer_Provers.dest_dir dir

   363         #> Config.put Sledgehammer_Provers.problem_prefix

   364           ("prob_" ^ str0 (Position.line_of pos) ^ "__")

   365         #> Config.put SMT_Config.debug_files

   366           (dir ^ "/" ^ Name.desymbolize false (ATP_Util.timestamp ()) ^ "_"

   367           ^ serial_string ())

   368       | set_file_name NONE = I

   369     val st' =

   370       st |> Proof.map_context

   371                 (set_file_name dir

   372                  #> (Option.map (Config.put

   373                        Sledgehammer_Provers.atp_lambda_translation)

   374                        lambda_translation |> the_default I)

   375                  #> (Option.map (Config.put ATP_Systems.e_weight_method)

   376                        e_weight_method |> the_default I)

   377                  #> (Option.map (Config.put ATP_Systems.force_sos)

   378                        force_sos |> the_default I)

   379                  #> Config.put Sledgehammer_Provers.measure_run_time true)

   380     val params as {relevance_thresholds, max_relevant, slicing, ...} =

   381       Sledgehammer_Isar.default_params ctxt

   382           [("verbose", "true"),

   383            ("type_enc", type_enc),

   384            ("sound", sound),

   385            ("max_relevant", max_relevant),

   386            ("slicing", slicing),

   387            ("timeout", string_of_int timeout)]

   388     val default_max_relevant =

   389       Sledgehammer_Provers.default_max_relevant_for_prover ctxt slicing

   390         prover_name

   391     val is_appropriate_prop =

   392       Sledgehammer_Provers.is_appropriate_prop_for_prover ctxt prover_name

   393     val is_built_in_const =

   394       Sledgehammer_Provers.is_built_in_const_for_prover ctxt prover_name

   395     val relevance_fudge =

   396       Sledgehammer_Provers.relevance_fudge_for_prover ctxt prover_name

   397     val relevance_override = {add = [], del = [], only = false}

   398     val (_, hyp_ts, concl_t) = ATP_Util.strip_subgoal ctxt goal i

   399     val time_limit =

   400       (case hard_timeout of

   401         NONE => I

   402       | SOME secs => TimeLimit.timeLimit (Time.fromSeconds secs))

   403     fun failed failure =

   404       ({outcome = SOME failure, used_facts = [], run_time_in_msecs = NONE,

   405         preplay = K (ATP_Reconstruct.Failed_to_Play ATP_Reconstruct.Metis),

   406         message = K "", message_tail = ""}, ~1)

   407     val ({outcome, used_facts, run_time_in_msecs, preplay, message,

   408           message_tail} : Sledgehammer_Provers.prover_result,

   409         time_isa) = time_limit (Mirabelle.cpu_time (fn () =>

   410       let

   411         val _ = if is_appropriate_prop concl_t then ()

   412                 else raise Fail "inappropriate"

   413         val facts =

   414           Sledgehammer_Filter.nearly_all_facts ctxt relevance_override

   415                                                chained_ths hyp_ts concl_t

   416           |> filter (is_appropriate_prop o prop_of o snd)

   417           |> Sledgehammer_Filter.relevant_facts ctxt relevance_thresholds

   418                  (the_default default_max_relevant max_relevant)

   419                  is_built_in_const relevance_fudge relevance_override

   420                  chained_ths hyp_ts concl_t

   421         val problem =

   422           {state = st', goal = goal, subgoal = i,

   423            subgoal_count = Sledgehammer_Util.subgoal_count st,

   424            facts = facts |> map Sledgehammer_Provers.Untranslated_Fact,

   425            smt_filter = NONE}

   426       in prover params (K (K "")) problem end)) ()

   427       handle TimeLimit.TimeOut => failed ATP_Proof.TimedOut

   428            | Fail "inappropriate" => failed ATP_Proof.Inappropriate

   429     val time_prover = run_time_in_msecs |> the_default ~1

   430     val msg = message (preplay ()) ^ message_tail

   431   in

   432     case outcome of

   433       NONE => (msg, SH_OK (time_isa, time_prover, used_facts))

   434     | SOME _ => (msg, SH_FAIL (time_isa, time_prover))

   435   end

   436   handle ERROR msg => ("error: " ^ msg, SH_ERROR)

   438 fun thms_of_name ctxt name =

   439   let

   440     val lex = Keyword.get_lexicons

   441     val get = maps (Proof_Context.get_fact ctxt o fst)

   442   in

   443     Source.of_string name

   444     |> Symbol.source

   445     |> Token.source {do_recover=SOME false} lex Position.start

   446     |> Token.source_proper

   447     |> Source.source Token.stopper (Parse_Spec.xthms1 >> get) NONE

   448     |> Source.exhaust

   449   end

   451 in

   453 fun run_sledgehammer trivial args reconstructor named_thms id

   454       ({pre=st, log, pos, ...}: Mirabelle.run_args) =

   455   let

   456     val triv_str = if trivial then "[T] " else ""

   457     val _ = change_data id inc_sh_calls

   458     val _ = if trivial then () else change_data id inc_sh_nontriv_calls

   459     val (prover_name, prover) = get_prover (Proof.context_of st) args

   460     val type_enc = AList.lookup (op =) args type_encK |> the_default "smart"

   461     val sound = AList.lookup (op =) args soundK |> the_default "false"

   462     val max_relevant = AList.lookup (op =) args max_relevantK |> the_default "smart"

   463     val slicing = AList.lookup (op =) args slicingK |> the_default "true"

   464     val lambda_translation = AList.lookup (op =) args lambda_translationK

   465     val e_weight_method = AList.lookup (op =) args e_weight_methodK

   466     val force_sos = AList.lookup (op =) args force_sosK

   467       |> Option.map (curry (op <>) "false")

   468     val dir = AList.lookup (op =) args keepK

   469     val timeout = Mirabelle.get_int_setting args (prover_timeoutK, 30)

   470     (* always use a hard timeout, but give some slack so that the automatic

   471        minimizer has a chance to do its magic *)

   472     val hard_timeout = SOME (2 * timeout)

   473     val (msg, result) =

   474       run_sh prover_name prover type_enc sound max_relevant slicing

   475         lambda_translation e_weight_method force_sos hard_timeout timeout dir

   476         pos st

   477   in

   478     case result of

   479       SH_OK (time_isa, time_prover, names) =>

   480         let

   481           fun get_thms (_, ATP_Translate.Chained) = NONE

   482             | get_thms (name, loc) =

   483               SOME ((name, loc), thms_of_name (Proof.context_of st) name)

   484         in

   485           change_data id inc_sh_success;

   486           if trivial then () else change_data id inc_sh_nontriv_success;

   487           change_data id (inc_sh_lemmas (length names));

   488           change_data id (inc_sh_max_lems (length names));

   489           change_data id (inc_sh_time_isa time_isa);

   490           change_data id (inc_sh_time_prover time_prover);

   491           reconstructor := reconstructor_from_msg args msg;

   492           named_thms := SOME (map_filter get_thms names);

   493           log (sh_tag id ^ triv_str ^ "succeeded (" ^ string_of_int time_isa ^ "+" ^

   494             string_of_int time_prover ^ ") [" ^ prover_name ^ "]:\n" ^ msg)

   495         end

   496     | SH_FAIL (time_isa, time_prover) =>

   497         let

   498           val _ = change_data id (inc_sh_time_isa time_isa)

   499           val _ = change_data id (inc_sh_time_prover_fail time_prover)

   500         in log (sh_tag id ^ triv_str ^ "failed: " ^ msg) end

   501     | SH_ERROR => log (sh_tag id ^ "failed: " ^ msg)

   502   end

   504 end

   506 fun run_minimize args reconstructor named_thms id

   507         ({pre=st, log, ...}: Mirabelle.run_args) =

   508   let

   509     val ctxt = Proof.context_of st

   510     val n0 = length (these (!named_thms))

   511     val (prover_name, _) = get_prover ctxt args

   512     val type_enc = AList.lookup (op =) args type_encK |> the_default "smart"

   513     val sound = AList.lookup (op =) args soundK |> the_default "false"

   514     val timeout =

   515       AList.lookup (op =) args minimize_timeoutK

   516       |> Option.map (fst o read_int o raw_explode)  (* FIXME Symbol.explode (?) *)

   517       |> the_default 5

   518     val params = Sledgehammer_Isar.default_params ctxt

   519       [("provers", prover_name),

   520        ("verbose", "true"),

   521        ("type_enc", type_enc),

   522        ("sound", sound),

   523        ("timeout", string_of_int timeout)]

   524     val minimize =

   525       Sledgehammer_Minimize.minimize_facts prover_name params

   526           true 1 (Sledgehammer_Util.subgoal_count st)

   527     val _ = log separator

   528     val (used_facts, (preplay, message, message_tail)) =

   529       minimize st (these (!named_thms))

   530     val msg = message (preplay ()) ^ message_tail

   531   in

   532     case used_facts of

   533       SOME named_thms' =>

   534         (change_data id inc_min_succs;

   535          change_data id (inc_min_ab_ratios ((100 * length named_thms') div n0));

   536          if length named_thms' = n0

   537          then log (minimize_tag id ^ "already minimal")

   538          else (reconstructor := reconstructor_from_msg args msg;

   539                named_thms := SOME named_thms';

   540                log (minimize_tag id ^ "succeeded:\n" ^ msg))

   541         )

   542     | NONE => log (minimize_tag id ^ "failed: " ^ msg)

   543   end

   546 fun run_reconstructor trivial full m name reconstructor named_thms id

   547     ({pre=st, timeout, log, pos, ...}: Mirabelle.run_args) =

   548   let

   549     fun do_reconstructor thms ctxt =

   550       (if !reconstructor = "sledgehammer_tac" then

   551          (fn ctxt => fn thms =>

   552             Method.insert_tac thms THEN'

   553             Sledgehammer_Tactics.sledgehammer_as_unsound_oracle_tac ctxt)

   554        else if !reconstructor = "smt" then

   555          SMT_Solver.smt_tac

   556        else if full orelse !reconstructor = "metis (full_types)" then

   557          Metis_Tactics.metis_tac [Metis_Tactics.full_type_enc]

   558        else if !reconstructor = "metis (no_types)" then

   559          Metis_Tactics.metis_tac [Metis_Tactics.no_type_enc]

   560        else

   561          Metis_Tactics.metis_tac []) ctxt thms

   562     fun apply_reconstructor thms =

   563       Mirabelle.can_apply timeout (do_reconstructor thms) st

   565     fun with_time (false, t) = "failed (" ^ string_of_int t ^ ")"

   566       | with_time (true, t) = (change_data id (inc_reconstructor_success m);

   567           if trivial then ()

   568           else change_data id (inc_reconstructor_nontriv_success m);

   569           change_data id (inc_reconstructor_lemmas m (length named_thms));

   570           change_data id (inc_reconstructor_time m t);

   571           change_data id (inc_reconstructor_posns m (pos, trivial));

   572           if name = "proof" then change_data id (inc_reconstructor_proofs m)

   573           else ();

   574           "succeeded (" ^ string_of_int t ^ ")")

   575     fun timed_reconstructor thms =

   576       (with_time (Mirabelle.cpu_time apply_reconstructor thms), true)

   577       handle TimeLimit.TimeOut => (change_data id (inc_reconstructor_timeout m);

   578                ("timeout", false))

   579            | ERROR msg => ("error: " ^ msg, false)

   581     val _ = log separator

   582     val _ = change_data id (inc_reconstructor_calls m)

   583     val _ = if trivial then ()

   584             else change_data id (inc_reconstructor_nontriv_calls m)

   585   in

   586     maps snd named_thms

   587     |> timed_reconstructor

   588     |>> log o prefix (reconstructor_tag reconstructor id)

   589     |> snd

   590   end

   592 val try_timeout = seconds 5.0

   594 fun sledgehammer_action args id (st as {pre, name, ...}: Mirabelle.run_args) =

   595   let val goal = Thm.major_prem_of (#goal (Proof.goal pre)) in

   596     if can Logic.dest_conjunction goal orelse can Logic.dest_equals goal

   597     then () else

   598     let

   599       val reconstructor = Unsynchronized.ref ""

   600       val named_thms =

   601         Unsynchronized.ref (NONE : ((string * locality) * thm list) list option)

   602       val minimize = AList.defined (op =) args minimizeK

   603       val metis_ft = AList.defined (op =) args metis_ftK

   604       val trivial =

   605         Try_Methods.try_methods (SOME try_timeout) ([], [], [], []) pre

   606         handle TimeLimit.TimeOut => false

   607       fun apply_reconstructor m1 m2 =

   608         if metis_ft

   609         then

   610           if not (Mirabelle.catch_result (reconstructor_tag reconstructor) false

   611               (run_reconstructor trivial false m1 name reconstructor

   612                    (these (!named_thms))) id st)

   613           then

   614             (Mirabelle.catch_result (reconstructor_tag reconstructor) false

   615               (run_reconstructor trivial true m2 name reconstructor

   616                    (these (!named_thms))) id st; ())

   617           else ()

   618         else

   619           (Mirabelle.catch_result (reconstructor_tag reconstructor) false

   620             (run_reconstructor trivial false m1 name reconstructor

   621                  (these (!named_thms))) id st; ())

   622     in

   623       change_data id (set_mini minimize);

   624       Mirabelle.catch sh_tag (run_sledgehammer trivial args reconstructor

   625                                                named_thms) id st;

   626       if is_some (!named_thms)

   627       then

   628        (apply_reconstructor Unminimized UnminimizedFT;

   629         if minimize andalso not (null (these (!named_thms)))

   630         then

   631          (Mirabelle.catch minimize_tag

   632               (run_minimize args reconstructor named_thms) id st;

   633           apply_reconstructor Minimized MinimizedFT)

   634         else ())

   635       else ()

   636     end

   637   end

   639 fun invoke args =

   640   Mirabelle.register (init, sledgehammer_action args, done)

   642 end

author	blanchet
	Tue, 23 Aug 2011 16:14:19 +0200
changeset 45283	2434dd7519e8
parent 44970	5e14f591515e
child 45301	c6f0490d432f
permissions	-rw-r--r--