src/HOL/Tools/Sledgehammer/sledgehammer_run.ML
author blanchet
Fri Dec 17 15:30:43 2010 +0100 (2010-12-17 ago)
changeset 41242 8edeb1dbbc76
parent 41208 1b28c43a7074
child 41245 cddc7db22bc9
permissions -rw-r--r--
run the SMT relevance filter only once, then run the normalization/monomorphization code once _per class_ of SMT solvers
blanchet@41087
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_run.ML
wenzelm@28477
     2
    Author:     Fabian Immler, TU Muenchen
wenzelm@32996
     3
    Author:     Makarius
blanchet@35969
     4
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@28477
     5
blanchet@38021
     6
Sledgehammer's heart.
wenzelm@28477
     7
*)
wenzelm@28477
     8
blanchet@41087
     9
signature SLEDGEHAMMER_RUN =
wenzelm@28477
    10
sig
blanchet@38988
    11
  type relevance_override = Sledgehammer_Filter.relevance_override
blanchet@40068
    12
  type minimize_command = Sledgehammer_ATP_Reconstruct.minimize_command
blanchet@41087
    13
  type params = Sledgehammer_Provers.params
blanchet@40061
    14
blanchet@38044
    15
  val run_sledgehammer :
blanchet@39318
    16
    params -> bool -> int -> relevance_override -> (string -> minimize_command)
blanchet@39318
    17
    -> Proof.state -> bool * Proof.state
wenzelm@28477
    18
end;
wenzelm@28477
    19
blanchet@41087
    20
structure Sledgehammer_Run : SLEDGEHAMMER_RUN =
wenzelm@28477
    21
struct
wenzelm@28477
    22
blanchet@38023
    23
open Sledgehammer_Util
blanchet@38988
    24
open Sledgehammer_Filter
blanchet@40068
    25
open Sledgehammer_ATP_Translate
blanchet@41087
    26
open Sledgehammer_Provers
blanchet@41091
    27
open Sledgehammer_Minimize
blanchet@40072
    28
blanchet@41208
    29
fun prover_description ctxt ({verbose, blocking, ...} : params) name num_facts i
blanchet@41089
    30
                       n goal =
blanchet@41089
    31
  quote name ^
blanchet@41089
    32
  (if verbose then
blanchet@41089
    33
     " with " ^ string_of_int num_facts ^ " fact" ^ plural_s num_facts
blanchet@41089
    34
   else
blanchet@41089
    35
     "") ^
blanchet@41089
    36
  " on " ^ (if n = 1 then "goal" else "subgoal " ^ string_of_int i) ^ ":" ^
blanchet@41089
    37
  (if blocking then
blanchet@41089
    38
     ""
blanchet@41089
    39
   else
blanchet@41089
    40
     "\n" ^ Syntax.string_of_term ctxt (Thm.term_of (Thm.cprem_of goal i)))
blanchet@41089
    41
blanchet@41091
    42
val implicit_minimization_threshold = 50
blanchet@41091
    43
blanchet@41208
    44
fun run_prover (params as {debug, blocking, max_relevant, timeout, expect, ...})
blanchet@41089
    45
               auto minimize_command only
blanchet@41242
    46
               {state, goal, subgoal, subgoal_count, facts, smt_head} name =
blanchet@41089
    47
  let
blanchet@41089
    48
    val ctxt = Proof.context_of state
blanchet@41089
    49
    val birth_time = Time.now ()
blanchet@41089
    50
    val death_time = Time.+ (birth_time, timeout)
blanchet@41089
    51
    val max_relevant =
blanchet@41089
    52
      the_default (default_max_relevant_for_prover ctxt name) max_relevant
blanchet@41089
    53
    val num_facts = length facts |> not only ? Integer.min max_relevant
blanchet@41089
    54
    val desc =
blanchet@41089
    55
      prover_description ctxt params name num_facts subgoal subgoal_count goal
blanchet@41089
    56
    val prover = get_prover ctxt auto name
blanchet@41089
    57
    val problem =
blanchet@41089
    58
      {state = state, goal = goal, subgoal = subgoal,
blanchet@41242
    59
       subgoal_count = subgoal_count, facts = take num_facts facts,
blanchet@41242
    60
       smt_head = smt_head}
blanchet@41089
    61
    fun go () =
blanchet@41089
    62
      let
blanchet@41089
    63
        fun really_go () =
blanchet@41089
    64
          prover params (minimize_command name) problem
blanchet@41091
    65
          |> (fn {outcome, used_facts, message, ...} =>
blanchet@41091
    66
                 if is_some outcome then
blanchet@41091
    67
                   ("none", message)
blanchet@41091
    68
                 else
blanchet@41091
    69
                   ("some",
blanchet@41091
    70
                    if length used_facts >= implicit_minimization_threshold then
blanchet@41091
    71
                      minimize_facts params true subgoal subgoal_count state
blanchet@41091
    72
                          (filter_used_facts used_facts
blanchet@41091
    73
                               (map (apsnd single o untranslated_fact) facts))
blanchet@41091
    74
                      |> snd
blanchet@41091
    75
                    else
blanchet@41091
    76
                      message))
blanchet@41089
    77
        val (outcome_code, message) =
blanchet@41089
    78
          if debug then
blanchet@41089
    79
            really_go ()
blanchet@41089
    80
          else
blanchet@41089
    81
            (really_go ()
blanchet@41089
    82
             handle ERROR message => ("unknown", "Error: " ^ message ^ "\n")
blanchet@41089
    83
                  | exn =>
blanchet@41089
    84
                    if Exn.is_interrupt exn then
blanchet@41089
    85
                      reraise exn
blanchet@41089
    86
                    else
blanchet@41089
    87
                      ("unknown", "Internal error:\n" ^
blanchet@41089
    88
                                  ML_Compiler.exn_message exn ^ "\n"))
blanchet@41089
    89
        val _ =
blanchet@41142
    90
          (* The "expect" argument is deliberately ignored if the prover is
blanchet@41142
    91
             missing so that the "Metis_Examples" can be processed on any
blanchet@41142
    92
             machine. *)
blanchet@41142
    93
          if expect = "" orelse outcome_code = expect orelse
blanchet@41142
    94
             not (is_prover_installed ctxt name) then
blanchet@41089
    95
            ()
blanchet@41089
    96
          else if blocking then
blanchet@41089
    97
            error ("Unexpected outcome: " ^ quote outcome_code ^ ".")
blanchet@41089
    98
          else
blanchet@41089
    99
            warning ("Unexpected outcome: " ^ quote outcome_code ^ ".");
blanchet@41089
   100
      in (outcome_code = "some", message) end
blanchet@41089
   101
  in
blanchet@41089
   102
    if auto then
blanchet@41089
   103
      let val (success, message) = TimeLimit.timeLimit timeout go () in
blanchet@41089
   104
        (success, state |> success ? Proof.goal_message (fn () =>
blanchet@41091
   105
             Pretty.chunks [Pretty.str "",
blanchet@41091
   106
                            Pretty.mark Markup.hilite (Pretty.str message)]))
blanchet@41089
   107
      end
blanchet@41089
   108
    else if blocking then
blanchet@41089
   109
      let val (success, message) = TimeLimit.timeLimit timeout go () in
blanchet@41089
   110
        List.app Output.urgent_message
blanchet@41089
   111
                 (Async_Manager.break_into_chunks [desc ^ "\n" ^ message]);
blanchet@41089
   112
        (success, state)
blanchet@41089
   113
      end
blanchet@41089
   114
    else
blanchet@41089
   115
      (Async_Manager.launch das_Tool birth_time death_time desc (snd o go);
blanchet@41089
   116
       (false, state))
blanchet@41089
   117
  end
blanchet@41089
   118
blanchet@41242
   119
val smt_weights = Unsynchronized.ref true
blanchet@41242
   120
val smt_weight_min_facts = 20
blanchet@41242
   121
blanchet@41242
   122
(* FUDGE *)
blanchet@41242
   123
val smt_min_weight = Unsynchronized.ref 0
blanchet@41242
   124
val smt_max_weight = Unsynchronized.ref 10
blanchet@41242
   125
val smt_max_index = Unsynchronized.ref 200
blanchet@41242
   126
val smt_weight_curve = Unsynchronized.ref (fn x : int => x * x)
blanchet@41242
   127
blanchet@41242
   128
fun smt_fact_weight j num_facts =
blanchet@41242
   129
  if !smt_weights andalso num_facts >= smt_weight_min_facts then
blanchet@41242
   130
    SOME (!smt_max_weight
blanchet@41242
   131
          - (!smt_max_weight - !smt_min_weight + 1)
blanchet@41242
   132
            * !smt_weight_curve (Int.max (0, !smt_max_index - j - 1))
blanchet@41242
   133
            div !smt_weight_curve (!smt_max_index))
blanchet@41242
   134
  else
blanchet@41242
   135
    NONE
blanchet@41242
   136
blanchet@41242
   137
fun weight_smt_fact thy num_facts (fact, j) =
blanchet@41242
   138
  fact |> apsnd (pair (smt_fact_weight j num_facts) o Thm.transfer thy)
blanchet@41242
   139
blanchet@41242
   140
fun class_of_smt_solver ctxt name =
blanchet@41242
   141
  ctxt |> select_smt_solver name
blanchet@41242
   142
       |> SMT_Config.solver_class_of |> SMT_Utils.string_of_class
blanchet@41242
   143
blanchet@41242
   144
(* Makes backtraces more transparent and might be more efficient as well. *)
blanchet@41242
   145
fun smart_par_list_map _ [] = []
blanchet@41242
   146
  | smart_par_list_map f [x] = [f x]
blanchet@41242
   147
  | smart_par_list_map f xs = Par_List.map f xs
blanchet@41242
   148
blanchet@40698
   149
(* FUDGE *)
blanchet@40698
   150
val auto_max_relevant_divisor = 2
blanchet@40060
   151
blanchet@41208
   152
fun run_sledgehammer (params as {debug, blocking, provers, type_sys,
blanchet@40069
   153
                                 relevance_thresholds, max_relevant, ...})
blanchet@39366
   154
                     auto i (relevance_override as {only, ...}) minimize_command
blanchet@39366
   155
                     state =
blanchet@40059
   156
  if null provers then
blanchet@40059
   157
    error "No prover is set."
blanchet@39318
   158
  else case subgoal_count state of
wenzelm@40132
   159
    0 => (Output.urgent_message "No subgoal!"; (false, state))
blanchet@39318
   160
  | n =>
blanchet@39318
   161
    let
blanchet@39364
   162
      val _ = Proof.assert_backward state
blanchet@41242
   163
      val state =
blanchet@41242
   164
        state |> Proof.map_context (Config.put SMT_Config.verbose debug)
blanchet@40200
   165
      val ctxt = Proof.context_of state
blanchet@41242
   166
      val thy = ProofContext.theory_of ctxt
blanchet@40200
   167
      val {facts = chained_ths, goal, ...} = Proof.goal state
blanchet@40060
   168
      val (_, hyp_ts, concl_t) = strip_subgoal goal i
blanchet@41138
   169
      val no_dangerous_types = types_dangerous_types type_sys
blanchet@40059
   170
      val _ = () |> not blocking ? kill_provers
blanchet@40941
   171
      val _ = case find_first (not o is_prover_available ctxt) provers of
blanchet@40941
   172
                SOME name => error ("No such prover: " ^ name ^ ".")
blanchet@40941
   173
              | NONE => ()
wenzelm@40132
   174
      val _ = if auto then () else Output.urgent_message "Sledgehammering..."
blanchet@40941
   175
      val (smts, atps) = provers |> List.partition (is_smt_prover ctxt)
blanchet@41242
   176
      fun run_provers get_facts translate maybe_smt_head provers
blanchet@41242
   177
                      (res as (success, state)) =
blanchet@40065
   178
        if success orelse null provers then
blanchet@40060
   179
          res
blanchet@40060
   180
        else
blanchet@40060
   181
          let
blanchet@41242
   182
            val facts = get_facts ()
blanchet@41242
   183
            val num_facts = length facts
blanchet@41242
   184
            val facts = facts ~~ (0 upto num_facts - 1)
blanchet@41242
   185
                        |> map (translate num_facts)
blanchet@40062
   186
            val problem =
blanchet@40065
   187
              {state = state, goal = goal, subgoal = i, subgoal_count = n,
blanchet@41242
   188
               facts = facts,
blanchet@41242
   189
               smt_head = maybe_smt_head (map smt_weighted_fact facts) i}
blanchet@40983
   190
            val run_prover = run_prover params auto minimize_command only
blanchet@40060
   191
          in
blanchet@40060
   192
            if auto then
blanchet@40061
   193
              fold (fn prover => fn (true, state) => (true, state)
blanchet@40064
   194
                                  | (false, _) => run_prover problem prover)
blanchet@40065
   195
                   provers (false, state)
blanchet@40060
   196
            else
blanchet@41171
   197
              provers
blanchet@41242
   198
              |> (if blocking then smart_par_list_map else map)
blanchet@41171
   199
                     (run_prover problem)
blanchet@41171
   200
              |> exists fst |> rpair state
blanchet@40060
   201
          end
blanchet@41242
   202
      fun get_facts label no_dangerous_types relevance_fudge provers =
blanchet@41242
   203
        let
blanchet@41242
   204
          val max_max_relevant =
blanchet@41242
   205
            case max_relevant of
blanchet@41242
   206
              SOME n => n
blanchet@41242
   207
            | NONE =>
blanchet@41242
   208
              0 |> fold (Integer.max o default_max_relevant_for_prover ctxt)
blanchet@41242
   209
                        provers
blanchet@41242
   210
                |> auto ? (fn n => n div auto_max_relevant_divisor)
blanchet@41242
   211
          val is_built_in_const =
blanchet@41242
   212
            is_built_in_const_for_prover ctxt (hd provers)
blanchet@41242
   213
        in
blanchet@41242
   214
          relevant_facts ctxt no_dangerous_types relevance_thresholds
blanchet@41242
   215
                         max_max_relevant is_built_in_const relevance_fudge
blanchet@41242
   216
                         relevance_override chained_ths hyp_ts concl_t
blanchet@41242
   217
          |> tap (fn facts =>
blanchet@41242
   218
                     if debug then
blanchet@41242
   219
                       label ^ plural_s (length provers) ^ ": " ^
blanchet@41242
   220
                       (if null facts then
blanchet@41242
   221
                          "Found no relevant facts."
blanchet@41242
   222
                        else
blanchet@41242
   223
                          "Including (up to) " ^ string_of_int (length facts) ^
blanchet@41242
   224
                          " relevant fact" ^ plural_s (length facts) ^ ":\n" ^
blanchet@41242
   225
                          (facts |> map (fst o fst) |> space_implode " ") ^ ".")
blanchet@41242
   226
                       |> Output.urgent_message
blanchet@41242
   227
                     else
blanchet@41242
   228
                       ())
blanchet@41242
   229
        end
blanchet@40071
   230
      val run_atps =
blanchet@41242
   231
        run_provers
blanchet@41242
   232
            (get_facts "ATP" no_dangerous_types atp_relevance_fudge o K atps)
blanchet@41242
   233
            (ATP_Translated_Fact oo K (translate_atp_fact ctxt o fst))
blanchet@41242
   234
            (K (K NONE)) atps
blanchet@41242
   235
      fun run_smts (accum as (success, _)) =
blanchet@41242
   236
        if success orelse null smts then
blanchet@41242
   237
          accum
blanchet@41242
   238
        else
blanchet@41242
   239
          let
blanchet@41242
   240
            val facts = get_facts "SMT solver" true smt_relevance_fudge smts
blanchet@41242
   241
            val translate = SMT_Weighted_Fact oo weight_smt_fact thy
blanchet@41242
   242
            val maybe_smt_head = try o SMT_Solver.smt_filter_head state
blanchet@41242
   243
          in
blanchet@41242
   244
            smts |> map (`(class_of_smt_solver ctxt))
blanchet@41242
   245
                 |> AList.group (op =)
blanchet@41242
   246
                 |> map (fn (_, smts) => run_provers (K facts) translate
blanchet@41242
   247
                                                     maybe_smt_head smts accum)
blanchet@41242
   248
                 |> exists fst |> rpair state
blanchet@41242
   249
          end
blanchet@40060
   250
      fun run_atps_and_smt_solvers () =
blanchet@41242
   251
        [run_atps, run_smts]
blanchet@41242
   252
        |> smart_par_list_map (fn f => f (false, state) |> K ())
blanchet@41180
   253
        handle ERROR msg => (Output.urgent_message ("Error: " ^ msg); error msg)
blanchet@40060
   254
    in
blanchet@40065
   255
      (false, state)
blanchet@40065
   256
      |> (if blocking then run_atps #> not auto ? run_smts
blanchet@40065
   257
          else (fn p => Future.fork (tap run_atps_and_smt_solvers) |> K p))
blanchet@40060
   258
    end
blanchet@38044
   259
wenzelm@28582
   260
end;