src/HOL/Tools/ATP_Manager/atp_systems.ML
author blanchet
Tue Jul 27 13:16:37 2010 +0200 (2010-07-27)
changeset 38009 34e1ac9cb71d
parent 38005 b6555e9c5de4
child 38015 b30c3c2e1030
permissions -rw-r--r--
shrink the "max_new_relevant_facts_per_iter" fudge factors, now that we count formulas and not clauses
blanchet@36376
     1
(*  Title:      HOL/Tools/ATP_Manager/atp_systems.ML
wenzelm@28592
     2
    Author:     Fabian Immler, TU Muenchen
blanchet@36371
     3
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@28592
     4
blanchet@36376
     5
Setup for supported ATPs.
wenzelm@28592
     6
*)
wenzelm@28592
     7
blanchet@36376
     8
signature ATP_SYSTEMS =
wenzelm@28592
     9
sig
blanchet@37623
    10
  val trace : bool Unsynchronized.ref
blanchet@36376
    11
  val dest_dir : string Config.T
blanchet@35867
    12
  val problem_prefix : string Config.T
blanchet@35867
    13
  val measure_runtime : bool Config.T
blanchet@35867
    14
  val refresh_systems_on_tptp : unit -> unit
blanchet@36371
    15
  val default_atps_param_value : unit -> string
blanchet@35867
    16
  val setup : theory -> theory
wenzelm@28592
    17
end;
wenzelm@28592
    18
blanchet@36376
    19
structure ATP_Systems : ATP_SYSTEMS =
wenzelm@28592
    20
struct
wenzelm@28596
    21
blanchet@37578
    22
open Metis_Clauses
blanchet@36187
    23
open Sledgehammer_Util
blanchet@35865
    24
open Sledgehammer_Fact_Filter
blanchet@37578
    25
open Sledgehammer_TPTP_Format
blanchet@35865
    26
open Sledgehammer_Proof_Reconstruct
blanchet@35867
    27
open ATP_Manager
blanchet@35826
    28
blanchet@37623
    29
val trace = Unsynchronized.ref false
blanchet@37623
    30
fun trace_msg msg = if !trace then tracing (msg ()) else ()
blanchet@37623
    31
blanchet@36376
    32
(** generic ATP **)
wenzelm@28596
    33
wenzelm@32944
    34
(* external problem files *)
boehmes@32864
    35
blanchet@36376
    36
val (dest_dir, dest_dir_setup) = Attrib.config_string "atp_dest_dir" (K "");
boehmes@32864
    37
  (*Empty string means create files in Isabelle's temporary files directory.*)
boehmes@32864
    38
boehmes@32864
    39
val (problem_prefix, problem_prefix_setup) =
wenzelm@36001
    40
  Attrib.config_string "atp_problem_prefix" (K "prob");
boehmes@32864
    41
boehmes@33247
    42
val (measure_runtime, measure_runtime_setup) =
wenzelm@36001
    43
  Attrib.config_bool "atp_measure_runtime" (K false);
boehmes@33247
    44
boehmes@32864
    45
blanchet@35867
    46
(* prover configuration *)
boehmes@32864
    47
wenzelm@32941
    48
type prover_config =
blanchet@36917
    49
  {home_var: string,
blanchet@36370
    50
   executable: string,
blanchet@37514
    51
   arguments: bool -> Time.time -> string,
blanchet@36370
    52
   proof_delims: (string * string) list,
blanchet@36370
    53
   known_failures: (failure * string) list,
blanchet@38009
    54
   max_new_relevant_facts_per_iter: int,
blanchet@37994
    55
   prefers_theory_relevant: bool,
blanchet@37994
    56
   explicit_forall: bool}
wenzelm@28596
    57
wenzelm@28596
    58
wenzelm@28596
    59
(* basic template *)
wenzelm@28596
    60
blanchet@36370
    61
val remotify = prefix "remote_"
blanchet@36370
    62
boehmes@32458
    63
fun with_path cleanup after f path =
boehmes@32458
    64
  Exn.capture f path
boehmes@32458
    65
  |> tap (fn _ => cleanup path)
boehmes@32458
    66
  |> Exn.release
blanchet@36369
    67
  |> tap (after path)
blanchet@36369
    68
blanchet@36369
    69
(* Splits by the first possible of a list of delimiters. *)
blanchet@36369
    70
fun extract_proof delims output =
blanchet@36369
    71
  case pairself (find_first (fn s => String.isSubstring s output))
blanchet@36369
    72
                (ListPair.unzip delims) of
blanchet@36369
    73
    (SOME begin_delim, SOME end_delim) =>
blanchet@36549
    74
    (output |> first_field begin_delim |> the |> snd
blanchet@36549
    75
            |> first_field end_delim |> the |> fst
blanchet@36549
    76
            |> first_field "\n" |> the |> snd
blanchet@36549
    77
     handle Option.Option => "")
blanchet@36369
    78
  | _ => ""
boehmes@32458
    79
blanchet@37514
    80
fun extract_proof_and_outcome complete res_code proof_delims known_failures
blanchet@37514
    81
                              output =
blanchet@36370
    82
  case map_filter (fn (failure, pattern) =>
blanchet@36370
    83
                      if String.isSubstring pattern output then SOME failure
blanchet@36370
    84
                      else NONE) known_failures of
blanchet@36369
    85
    [] => (case extract_proof proof_delims output of
blanchet@36370
    86
             "" => ("", SOME UnknownError)
blanchet@36370
    87
           | proof => if res_code = 0 then (proof, NONE)
blanchet@36370
    88
                      else ("", SOME UnknownError))
blanchet@37514
    89
  | (failure :: _) =>
blanchet@37514
    90
    ("", SOME (if failure = IncompleteUnprovable andalso complete then
blanchet@37514
    91
                 Unprovable
blanchet@37514
    92
               else
blanchet@37514
    93
                 failure))
blanchet@36370
    94
blanchet@36370
    95
fun string_for_failure Unprovable = "The ATP problem is unprovable."
blanchet@37413
    96
  | string_for_failure IncompleteUnprovable =
blanchet@37413
    97
    "The ATP cannot prove the problem."
blanchet@37627
    98
  | string_for_failure CantConnect = "Can't connect to remote ATP."
blanchet@36370
    99
  | string_for_failure TimedOut = "Timed out."
blanchet@36370
   100
  | string_for_failure OutOfResources = "The ATP ran out of resources."
blanchet@36370
   101
  | string_for_failure OldSpass =
blanchet@36393
   102
    (* FIXME: Change the error message below to point to the Isabelle download
blanchet@37997
   103
       page once the package is there. *)
blanchet@36370
   104
    "Warning: Sledgehammer requires a more recent version of SPASS with \
blanchet@36370
   105
    \support for the TPTP syntax. To install it, download and untar the \
blanchet@36370
   106
    \package \"http://isabelle.in.tum.de/~blanchet/spass-3.7.tgz\" and add the \
blanchet@36370
   107
    \\"spass-3.7\" directory's full path to \"" ^
blanchet@36370
   108
    Path.implode (Path.expand (Path.appends
blanchet@36370
   109
        (Path.variable "ISABELLE_HOME_USER" ::
blanchet@36370
   110
         map Path.basic ["etc", "components"]))) ^
blanchet@36370
   111
    "\" on a line of its own."
blanchet@36965
   112
  | string_for_failure MalformedInput =
blanchet@36965
   113
    "Internal Sledgehammer error: The ATP problem is malformed. Please report \
blanchet@36965
   114
    \this to the Isabelle developers."
blanchet@36370
   115
  | string_for_failure MalformedOutput = "Error: The ATP output is malformed."
blanchet@36370
   116
  | string_for_failure UnknownError = "Error: An unknown ATP error occurred."
blanchet@35865
   117
blanchet@37623
   118
blanchet@37623
   119
(* Clause preparation *)
blanchet@37623
   120
blanchet@37623
   121
fun make_clause_table xs =
blanchet@37623
   122
  fold (Termtab.update o `(prop_of o snd)) xs Termtab.empty
blanchet@37623
   123
blanchet@37623
   124
(* Remove existing axiom clauses from the conjecture clauses, as this can
blanchet@37623
   125
   dramatically boost an ATP's performance (for some reason). *)
blanchet@37623
   126
fun subtract_cls ax_clauses =
blanchet@37623
   127
  filter_out (Termtab.defined (make_clause_table ax_clauses) o prop_of)
blanchet@37623
   128
blanchet@37995
   129
fun combformula_for_prop thy =
blanchet@37995
   130
  let
blanchet@37995
   131
    val do_term = combterm_from_term thy
blanchet@37995
   132
    fun do_quant bs q s T t' =
blanchet@37995
   133
      do_formula ((s, T) :: bs) t'
blanchet@37995
   134
      #>> (fn phi => AQuant (q, [`make_bound_var s], phi))
blanchet@37995
   135
    and do_conn bs c t1 t2 =
blanchet@37995
   136
      do_formula bs t1 ##>> do_formula bs t2
blanchet@37995
   137
      #>> (fn (phi1, phi2) => AConn (c, [phi1, phi2]))
blanchet@37995
   138
    and do_formula bs t =
blanchet@37995
   139
      case t of
blanchet@38001
   140
        @{const Not} $ t1 =>
blanchet@37995
   141
        do_formula bs t1 #>> (fn phi => AConn (ANot, [phi]))
blanchet@37995
   142
      | Const (@{const_name All}, _) $ Abs (s, T, t') =>
blanchet@37995
   143
        do_quant bs AForall s T t'
blanchet@37995
   144
      | Const (@{const_name Ex}, _) $ Abs (s, T, t') =>
blanchet@37995
   145
        do_quant bs AExists s T t'
blanchet@37995
   146
      | @{const "op &"} $ t1 $ t2 => do_conn bs AAnd t1 t2
blanchet@37995
   147
      | @{const "op |"} $ t1 $ t2 => do_conn bs AOr t1 t2
blanchet@37995
   148
      | @{const "op -->"} $ t1 $ t2 => do_conn bs AImplies t1 t2
blanchet@37995
   149
      | Const (@{const_name "op ="}, Type (_, [@{typ bool}, _])) $ t1 $ t2 =>
blanchet@37995
   150
        do_conn bs AIff t1 t2
blanchet@37995
   151
      | _ => (fn ts => do_term bs (Envir.eta_contract t)
blanchet@37995
   152
                       |>> APred ||> union (op =) ts)
blanchet@37995
   153
  in do_formula [] end
blanchet@37623
   154
blanchet@38001
   155
(* Converts an elim-rule into an equivalent theorem that does not have the
blanchet@38001
   156
   predicate variable. Leaves other theorems unchanged. We simply instantiate
blanchet@38001
   157
   the conclusion variable to False. (Cf. "transform_elim_term" in
blanchet@38001
   158
   "ATP_Systems".) *)
blanchet@38001
   159
(* FIXME: test! *)
blanchet@38001
   160
fun transform_elim_term t =
blanchet@38001
   161
  case Logic.strip_imp_concl t of
blanchet@38001
   162
    @{const Trueprop} $ Var (z, @{typ bool}) =>
blanchet@38001
   163
    subst_Vars [(z, @{const True})] t
blanchet@38001
   164
  | Var (z, @{typ prop}) => subst_Vars [(z, @{prop True})] t
blanchet@38001
   165
  | _ => t
blanchet@38001
   166
blanchet@38001
   167
(* Removes the lambdas from an equation of the form "t = (%x. u)".
blanchet@38001
   168
   (Cf. "extensionalize_theorem" in "Clausifier".) *)
blanchet@38000
   169
fun extensionalize_term t =
blanchet@38000
   170
  let
blanchet@38001
   171
    fun aux j (Const (@{const_name "op ="}, Type (_, [Type (_, [_, T']), _]))
blanchet@38001
   172
               $ t2 $ Abs (s, var_T, t')) =
blanchet@38001
   173
        let val var_t = Var (("x", j), var_T) in
blanchet@38000
   174
          Const (@{const_name "op ="}, T' --> T' --> HOLogic.boolT)
blanchet@38000
   175
            $ betapply (t2, var_t) $ subst_bound (var_t, t')
blanchet@38000
   176
          |> aux (j + 1)
blanchet@38000
   177
        end
blanchet@38000
   178
      | aux _ t = t
blanchet@38000
   179
  in aux (maxidx_of_term t + 1) t end
blanchet@38000
   180
blanchet@38001
   181
(* FIXME: Guarantee freshness *)
blanchet@38001
   182
fun concealed_bound_name j = "Sledgehammer" ^ Int.toString j
blanchet@38001
   183
fun conceal_bounds Ts t =
blanchet@38001
   184
  subst_bounds (map (Free o apfst concealed_bound_name)
blanchet@38001
   185
                    (length Ts - 1 downto 0 ~~ rev Ts), t)
blanchet@38001
   186
fun reveal_bounds Ts =
blanchet@38001
   187
  subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j))
blanchet@38001
   188
                    (0 upto length Ts - 1 ~~ Ts))
blanchet@38001
   189
blanchet@38005
   190
fun introduce_combinators_in_term ctxt kind t =
blanchet@38001
   191
  let
blanchet@38005
   192
    val thy = ProofContext.theory_of ctxt
blanchet@38001
   193
    fun aux Ts t =
blanchet@38001
   194
      case t of
blanchet@38001
   195
        @{const Not} $ t1 => @{const Not} $ aux Ts t1
blanchet@38001
   196
      | (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') =>
blanchet@38001
   197
        t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38001
   198
      | (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') =>
blanchet@38001
   199
        t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38001
   200
      | (t0 as @{const "op &"}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
blanchet@38001
   201
      | (t0 as @{const "op |"}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
blanchet@38001
   202
      | (t0 as @{const "op -->"}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
blanchet@38001
   203
      | (t0 as Const (@{const_name "op ="}, Type (_, [@{typ bool}, _])))
blanchet@38001
   204
          $ t1 $ t2 =>
blanchet@38001
   205
        t0 $ aux Ts t1 $ aux Ts t2
blanchet@38001
   206
      | _ => if not (exists_subterm (fn Abs _ => true | _ => false) t) then
blanchet@38001
   207
               t
blanchet@38001
   208
             else
blanchet@38005
   209
               let
blanchet@38005
   210
                 val t = t |> conceal_bounds Ts
blanchet@38005
   211
                           |> Envir.eta_contract
blanchet@38005
   212
                 val ([t], ctxt') = Variable.import_terms true [t] ctxt
blanchet@38005
   213
               in
blanchet@38005
   214
                 t |> cterm_of thy
blanchet@38005
   215
                   |> Clausifier.introduce_combinators_in_cterm
blanchet@38005
   216
                   |> singleton (Variable.export ctxt' ctxt)
blanchet@38005
   217
                   |> prop_of |> Logic.dest_equals |> snd
blanchet@38005
   218
                   |> reveal_bounds Ts
blanchet@38005
   219
               end
blanchet@38001
   220
  in t |> not (Meson.is_fol_term thy t) ? aux [] end
blanchet@38005
   221
  handle THM _ =>
blanchet@38005
   222
         (* A type variable of sort "{}" will make abstraction fail. *)
blanchet@38005
   223
         case kind of
blanchet@38005
   224
           Axiom => HOLogic.true_const
blanchet@38005
   225
         | Conjecture => HOLogic.false_const
blanchet@38001
   226
blanchet@37623
   227
(* making axiom and conjecture clauses *)
blanchet@38005
   228
fun make_clause ctxt (formula_name, kind, t) =
blanchet@37623
   229
  let
blanchet@38005
   230
    val thy = ProofContext.theory_of ctxt
blanchet@38002
   231
    (* ### FIXME: perform other transformations previously done by
blanchet@38002
   232
       "Clausifier.to_nnf", e.g. "HOL.If" *)
blanchet@38001
   233
    val t = t |> transform_elim_term
blanchet@38001
   234
              |> Object_Logic.atomize_term thy
blanchet@38000
   235
              |> extensionalize_term
blanchet@38005
   236
              |> introduce_combinators_in_term ctxt kind
blanchet@37995
   237
    val (combformula, ctypes_sorts) = combformula_for_prop thy t []
blanchet@37623
   238
  in
blanchet@38004
   239
    FOLFormula {formula_name = formula_name, combformula = combformula,
blanchet@38004
   240
                kind = kind, ctypes_sorts = ctypes_sorts}
blanchet@37623
   241
  end
blanchet@37623
   242
blanchet@38005
   243
fun make_axiom_clause ctxt (name, th) =
blanchet@38005
   244
  (name, make_clause ctxt (name, Axiom, prop_of th))
blanchet@38005
   245
fun make_conjecture_clauses ctxt ts =
blanchet@38005
   246
  map2 (fn j => fn t => make_clause ctxt (Int.toString j, Conjecture, t))
blanchet@37999
   247
       (0 upto length ts - 1) ts
blanchet@37623
   248
blanchet@37623
   249
(** Helper clauses **)
blanchet@37623
   250
blanchet@37994
   251
fun count_combterm (CombConst ((s, _), _, _)) =
blanchet@37994
   252
    Symtab.map_entry s (Integer.add 1)
blanchet@37623
   253
  | count_combterm (CombVar _) = I
blanchet@37994
   254
  | count_combterm (CombApp (t1, t2)) = fold count_combterm [t1, t2]
blanchet@37994
   255
fun count_combformula (AQuant (_, _, phi)) = count_combformula phi
blanchet@37994
   256
  | count_combformula (AConn (_, phis)) = fold count_combformula phis
blanchet@37994
   257
  | count_combformula (APred tm) = count_combterm tm
blanchet@37994
   258
fun count_fol_formula (FOLFormula {combformula, ...}) =
blanchet@37994
   259
  count_combformula combformula
blanchet@37623
   260
blanchet@37623
   261
val optional_helpers =
blanchet@38002
   262
  [(["c_COMBI", "c_COMBK"], @{thms COMBI_def COMBK_def}),
blanchet@38002
   263
   (["c_COMBB", "c_COMBC"], @{thms COMBB_def COMBC_def}),
blanchet@38002
   264
   (["c_COMBS"], @{thms COMBS_def})]
blanchet@37623
   265
val optional_typed_helpers =
blanchet@38002
   266
  [(["c_True", "c_False"], @{thms True_or_False}),
blanchet@38002
   267
   (["c_If"], @{thms if_True if_False True_or_False})]
blanchet@37623
   268
val mandatory_helpers = @{thms fequal_imp_equal equal_imp_fequal}
blanchet@37623
   269
blanchet@37623
   270
val init_counters =
blanchet@37623
   271
  Symtab.make (maps (maps (map (rpair 0) o fst))
blanchet@37623
   272
                    [optional_helpers, optional_typed_helpers])
blanchet@37623
   273
blanchet@38005
   274
fun get_helper_clauses ctxt is_FO full_types conjectures axclauses =
blanchet@37623
   275
  let
blanchet@37994
   276
    val ct = fold (fold count_fol_formula) [conjectures, axclauses]
blanchet@37994
   277
                  init_counters
blanchet@37623
   278
    fun is_needed c = the (Symtab.lookup ct c) > 0
blanchet@37623
   279
    val cnfs =
blanchet@37623
   280
      (optional_helpers
blanchet@37623
   281
       |> full_types ? append optional_typed_helpers
blanchet@38002
   282
       |> maps (fn (ss, ths) =>
blanchet@38002
   283
                   if exists is_needed ss then map (`Thm.get_name_hint) ths
blanchet@38002
   284
                   else [])) @
blanchet@38002
   285
      (if is_FO then [] else map (`Thm.get_name_hint) mandatory_helpers)
blanchet@38005
   286
  in map (snd o make_axiom_clause ctxt) cnfs end
blanchet@37623
   287
blanchet@38002
   288
fun s_not (@{const Not} $ t) = t
blanchet@38002
   289
  | s_not t = @{const Not} $ t
blanchet@37995
   290
blanchet@37623
   291
(* prepare for passing to writer,
blanchet@37623
   292
   create additional clauses based on the information from extra_cls *)
blanchet@38005
   293
fun prepare_clauses ctxt full_types hyp_ts concl_t axcls extra_cls =
blanchet@37623
   294
  let
blanchet@38005
   295
    val thy = ProofContext.theory_of ctxt
blanchet@37995
   296
    val goal_t = Logic.list_implies (hyp_ts, concl_t)
blanchet@37995
   297
    val is_FO = Meson.is_fol_term thy goal_t
blanchet@38005
   298
    val _ = trace_msg (fn _ => Syntax.string_of_term ctxt goal_t)
blanchet@37995
   299
    val axtms = map (prop_of o snd) extra_cls
blanchet@37995
   300
    val subs = tfree_classes_of_terms [goal_t]
blanchet@37995
   301
    val supers = tvar_classes_of_terms axtms
blanchet@37995
   302
    val tycons = type_consts_of_terms thy (goal_t :: axtms)
blanchet@38002
   303
    (* TFrees in conjecture clauses; TVars in axiom clauses *)
blanchet@38005
   304
    val conjectures =
blanchet@38005
   305
      map (s_not o HOLogic.dest_Trueprop) hyp_ts @
blanchet@38005
   306
        [HOLogic.dest_Trueprop concl_t]
blanchet@38005
   307
      |> make_conjecture_clauses ctxt
blanchet@38005
   308
    val extra_clauses = map (snd o make_axiom_clause ctxt) extra_cls
blanchet@38003
   309
    val (clnames, axiom_clauses) =
blanchet@38005
   310
      ListPair.unzip (map (make_axiom_clause ctxt) axcls)
blanchet@38003
   311
    (* FIXME: Should it read "extra_clauses" or "axiom_clauses" in the
blanchet@38003
   312
       "get_helper_clauses" call? *)
blanchet@37623
   313
    val helper_clauses =
blanchet@38005
   314
      get_helper_clauses ctxt is_FO full_types conjectures extra_clauses
blanchet@37623
   315
    val (supers', arity_clauses) = make_arity_clauses thy tycons supers
blanchet@37925
   316
    val class_rel_clauses = make_class_rel_clauses thy subs supers'
blanchet@37623
   317
  in
blanchet@37623
   318
    (Vector.fromList clnames,
blanchet@37925
   319
      (conjectures, axiom_clauses, extra_clauses, helper_clauses,
blanchet@37925
   320
       class_rel_clauses, arity_clauses))
blanchet@37623
   321
  end
blanchet@37623
   322
blanchet@37962
   323
fun extract_clause_sequence output =
blanchet@37962
   324
  let
blanchet@37962
   325
    val tokens_of = String.tokens (not o Char.isAlphaNum)
blanchet@37962
   326
    fun extract_num ("clause" :: (ss as _ :: _)) =
blanchet@37962
   327
    Int.fromString (List.last ss)
blanchet@37962
   328
      | extract_num _ = NONE
blanchet@37962
   329
  in output |> split_lines |> map_filter (extract_num o tokens_of) end
blanchet@37962
   330
blanchet@37962
   331
val set_ClauseFormulaRelationN = "set_ClauseFormulaRelation"
blanchet@37962
   332
blanchet@37962
   333
val parse_clause_formula_pair =
blanchet@37962
   334
  $$ "(" |-- scan_integer --| $$ "," -- Symbol.scan_id --| $$ ")"
blanchet@37962
   335
  --| Scan.option ($$ ",")
blanchet@37962
   336
val parse_clause_formula_relation =
blanchet@37962
   337
  Scan.this_string set_ClauseFormulaRelationN |-- $$ "("
blanchet@37962
   338
  |-- Scan.repeat parse_clause_formula_pair
blanchet@37962
   339
val extract_clause_formula_relation =
blanchet@37962
   340
  Substring.full
blanchet@37962
   341
  #> Substring.position set_ClauseFormulaRelationN
blanchet@37962
   342
  #> snd #> Substring.string #> strip_spaces #> explode
blanchet@37962
   343
  #> parse_clause_formula_relation #> fst
blanchet@37962
   344
blanchet@37989
   345
fun repair_conjecture_shape_and_theorem_names output conjecture_shape
blanchet@37989
   346
                                              thm_names =
blanchet@37962
   347
  if String.isSubstring set_ClauseFormulaRelationN output then
blanchet@38009
   348
    (* This is a hack required for keeping track of axioms after they have been
blanchet@38009
   349
       clausified by SPASS's Flotter tool. The "SPASS_TPTP" script is also part
blanchet@38009
   350
       of this hack. *)
blanchet@37962
   351
    let
blanchet@37996
   352
      val j0 = hd conjecture_shape
blanchet@37962
   353
      val seq = extract_clause_sequence output
blanchet@37962
   354
      val name_map = extract_clause_formula_relation output
blanchet@37989
   355
      fun renumber_conjecture j =
blanchet@37989
   356
        AList.find (op =) name_map (conjecture_prefix ^ Int.toString (j - j0))
blanchet@37989
   357
        |> the_single
blanchet@37989
   358
        |> (fn s => find_index (curry (op =) s) seq + 1)
blanchet@37962
   359
    in
blanchet@37996
   360
      (conjecture_shape |> map renumber_conjecture,
blanchet@37989
   361
       seq |> map (the o AList.lookup (op =) name_map)
blanchet@37989
   362
           |> map (fn s => case try (unprefix axiom_prefix) s of
blanchet@37989
   363
                             SOME s' => undo_ascii_of s'
blanchet@37989
   364
                           | NONE => "")
blanchet@37989
   365
           |> Vector.fromList)
blanchet@37962
   366
    end
blanchet@37962
   367
  else
blanchet@37989
   368
    (conjecture_shape, thm_names)
blanchet@37962
   369
blanchet@37623
   370
blanchet@37499
   371
(* generic TPTP-based provers *)
blanchet@37499
   372
blanchet@37499
   373
fun generic_tptp_prover
blanchet@37499
   374
        (name, {home_var, executable, arguments, proof_delims, known_failures,
blanchet@38009
   375
                max_new_relevant_facts_per_iter, prefers_theory_relevant,
blanchet@38009
   376
                explicit_forall})
blanchet@37580
   377
        ({debug, overlord, full_types, explicit_apply, relevance_threshold,
blanchet@37580
   378
          relevance_convergence, theory_relevant, defs_relevant, isar_proof,
blanchet@37580
   379
          isar_shrink_factor, ...} : params)
blanchet@37499
   380
        minimize_command timeout
blanchet@35969
   381
        ({subgoal, goal, relevance_override, axiom_clauses, filtered_clauses}
blanchet@35969
   382
         : problem) =
wenzelm@28596
   383
  let
immler@31750
   384
    (* get clauses and prepare them for writing *)
blanchet@37498
   385
    val (ctxt, (_, th)) = goal;
blanchet@38005
   386
    val thy = ProofContext.theory_of ctxt
blanchet@37995
   387
    (* ### FIXME: (1) preprocessing for "if" etc. *)
blanchet@37995
   388
    val (params, hyp_ts, concl_t) = strip_subgoal th subgoal
immler@31752
   389
    val the_filtered_clauses =
blanchet@37621
   390
      case filtered_clauses of
blanchet@37621
   391
        SOME fcls => fcls
blanchet@37621
   392
      | NONE => relevant_facts full_types relevance_threshold
blanchet@38009
   393
                    relevance_convergence defs_relevant
blanchet@38009
   394
                    max_new_relevant_facts_per_iter
blanchet@37499
   395
                    (the_default prefers_theory_relevant theory_relevant)
blanchet@37995
   396
                    relevance_override goal hyp_ts concl_t
blanchet@37506
   397
    val the_axiom_clauses = axiom_clauses |> the_default the_filtered_clauses
blanchet@35969
   398
    val (internal_thm_names, clauses) =
blanchet@38005
   399
      prepare_clauses ctxt full_types hyp_ts concl_t the_axiom_clauses
blanchet@38005
   400
                      the_filtered_clauses
immler@31750
   401
boehmes@32864
   402
    (* path to unique problem file *)
blanchet@36376
   403
    val the_dest_dir = if overlord then getenv "ISABELLE_HOME_USER"
blanchet@36376
   404
                       else Config.get ctxt dest_dir;
blanchet@36376
   405
    val the_problem_prefix = Config.get ctxt problem_prefix;
boehmes@32864
   406
    fun prob_pathname nr =
blanchet@36143
   407
      let
blanchet@36143
   408
        val probfile =
blanchet@36568
   409
          Path.basic ((if overlord then "prob_" ^ name
blanchet@36568
   410
                       else the_problem_prefix ^ serial_string ())
blanchet@36143
   411
                      ^ "_" ^ string_of_int nr)
wenzelm@32942
   412
      in
blanchet@36376
   413
        if the_dest_dir = "" then File.tmp_path probfile
blanchet@36376
   414
        else if File.exists (Path.explode the_dest_dir)
blanchet@36376
   415
        then Path.append (Path.explode the_dest_dir) probfile
blanchet@36376
   416
        else error ("No such directory: " ^ the_dest_dir ^ ".")
wenzelm@32942
   417
      end;
boehmes@32864
   418
blanchet@36917
   419
    val home = getenv home_var
blanchet@36289
   420
    val command = Path.explode (home ^ "/" ^ executable)
immler@31750
   421
    (* write out problem file and call prover *)
blanchet@37514
   422
    fun command_line complete probfile =
blanchet@37514
   423
      let
blanchet@37514
   424
        val core = File.shell_path command ^ " " ^ arguments complete timeout ^
blanchet@37514
   425
                   " " ^ File.shell_path probfile
blanchet@37514
   426
      in
blanchet@37514
   427
        (if Config.get ctxt measure_runtime then
blanchet@37514
   428
           "TIMEFORMAT='%3U'; { time " ^ core ^ " ; }"
blanchet@37514
   429
         else
blanchet@37962
   430
           "exec " ^ core) ^ " 2>&1"
blanchet@37514
   431
      end
boehmes@32510
   432
    fun split_time s =
boehmes@32510
   433
      let
wenzelm@32942
   434
        val split = String.tokens (fn c => str c = "\n");
blanchet@36369
   435
        val (output, t) = s |> split |> split_last |> apfst cat_lines;
wenzelm@32942
   436
        fun as_num f = f >> (fst o read_int);
wenzelm@32942
   437
        val num = as_num (Scan.many1 Symbol.is_ascii_digit);
wenzelm@32942
   438
        val digit = Scan.one Symbol.is_ascii_digit;
wenzelm@32942
   439
        val num3 = as_num (digit ::: digit ::: (digit >> single));
wenzelm@32942
   440
        val time = num --| Scan.$$ "." -- num3 >> (fn (a, b) => a * 1000 + b);
wenzelm@32942
   441
        val as_time = the_default 0 o Scan.read Symbol.stopper time o explode;
blanchet@36369
   442
      in (output, as_time t) end;
boehmes@32458
   443
    fun run_on probfile =
blanchet@37962
   444
      if home = "" then
blanchet@37962
   445
        error ("The environment variable " ^ quote home_var ^ " is not set.")
blanchet@37962
   446
      else if File.exists command then
blanchet@37514
   447
        let
blanchet@37514
   448
          fun do_run complete =
blanchet@37514
   449
            let
blanchet@37514
   450
              val command = command_line complete probfile
blanchet@37514
   451
              val ((output, msecs), res_code) =
blanchet@37514
   452
                bash_output command
blanchet@37514
   453
                |>> (if overlord then
blanchet@37514
   454
                       prefix ("% " ^ command ^ "\n% " ^ timestamp () ^ "\n")
blanchet@37514
   455
                     else
blanchet@37514
   456
                       I)
blanchet@37514
   457
                |>> (if Config.get ctxt measure_runtime then split_time
blanchet@37514
   458
                     else rpair 0)
blanchet@37514
   459
              val (proof, outcome) =
blanchet@37514
   460
                extract_proof_and_outcome complete res_code proof_delims
blanchet@37514
   461
                                          known_failures output
blanchet@37514
   462
            in (output, msecs, proof, outcome) end
blanchet@37643
   463
          val readable_names = debug andalso overlord
blanchet@37514
   464
          val (pool, conjecture_offset) =
blanchet@37994
   465
            write_tptp_file thy readable_names explicit_forall full_types
blanchet@37994
   466
                            explicit_apply probfile clauses
blanchet@37995
   467
          val conjecture_shape =
blanchet@37995
   468
            conjecture_offset + 1 upto conjecture_offset + length hyp_ts + 1
blanchet@37514
   469
          val result =
blanchet@37514
   470
            do_run false
blanchet@37550
   471
            |> (fn (_, msecs0, _, SOME _) =>
blanchet@37514
   472
                   do_run true
blanchet@37514
   473
                   |> (fn (output, msecs, proof, outcome) =>
blanchet@37514
   474
                          (output, msecs0 + msecs, proof, outcome))
blanchet@37514
   475
                 | result => result)
blanchet@37514
   476
        in ((pool, conjecture_shape), result) end
blanchet@36382
   477
      else
blanchet@36382
   478
        error ("Bad executable: " ^ Path.implode command ^ ".");
wenzelm@28592
   479
blanchet@36167
   480
    (* If the problem file has not been exported, remove it; otherwise, export
blanchet@36167
   481
       the proof file too. *)
blanchet@36376
   482
    fun cleanup probfile =
blanchet@36376
   483
      if the_dest_dir = "" then try File.rm probfile else NONE
blanchet@37514
   484
    fun export probfile (_, (output, _, _, _)) =
blanchet@36376
   485
      if the_dest_dir = "" then
blanchet@36187
   486
        ()
blanchet@36187
   487
      else
blanchet@37514
   488
        File.write (Path.explode (Path.implode probfile ^ "_proof")) output
wenzelm@32257
   489
blanchet@37514
   490
    val ((pool, conjecture_shape), (output, msecs, proof, outcome)) =
blanchet@37514
   491
      with_path cleanup export run_on (prob_pathname subgoal)
blanchet@37989
   492
    val (conjecture_shape, internal_thm_names) =
blanchet@37989
   493
      repair_conjecture_shape_and_theorem_names output conjecture_shape
blanchet@37989
   494
                                                internal_thm_names
blanchet@37514
   495
blanchet@35969
   496
    val (message, relevant_thm_names) =
blanchet@36370
   497
      case outcome of
blanchet@36400
   498
        NONE =>
blanchet@36400
   499
        proof_text isar_proof
blanchet@37480
   500
            (pool, debug, isar_shrink_factor, ctxt, conjecture_shape)
blanchet@37480
   501
            (full_types, minimize_command, proof, internal_thm_names, th,
blanchet@37480
   502
             subgoal)
blanchet@36370
   503
      | SOME failure => (string_for_failure failure ^ "\n", [])
boehmes@32864
   504
  in
blanchet@36393
   505
    {outcome = outcome, message = message, pool = pool,
blanchet@37514
   506
     relevant_thm_names = relevant_thm_names, atp_run_time_in_msecs = msecs,
blanchet@37514
   507
     output = output, proof = proof, internal_thm_names = internal_thm_names,
blanchet@36400
   508
     conjecture_shape = conjecture_shape,
blanchet@35969
   509
     filtered_clauses = the_filtered_clauses}
blanchet@37499
   510
  end
wenzelm@28596
   511
blanchet@35969
   512
fun tptp_prover name p = (name, generic_tptp_prover (name, p));
wenzelm@28596
   513
blanchet@36382
   514
fun to_generous_secs time = (Time.toMilliseconds time + 999) div 1000
blanchet@36142
   515
wenzelm@28596
   516
(* E prover *)
wenzelm@28596
   517
blanchet@36369
   518
val tstp_proof_delims =
blanchet@36369
   519
  ("# SZS output start CNFRefutation.", "# SZS output end CNFRefutation")
blanchet@36369
   520
blanchet@35969
   521
val e_config : prover_config =
blanchet@36917
   522
  {home_var = "E_HOME",
blanchet@36289
   523
   executable = "eproof",
blanchet@37514
   524
   arguments = fn _ => fn timeout =>
blanchet@36382
   525
     "--tstp-in --tstp-out -l5 -xAutoDev -tAutoDev --silent --cpu-limit=" ^
blanchet@36382
   526
     string_of_int (to_generous_secs timeout),
blanchet@36369
   527
   proof_delims = [tstp_proof_delims],
blanchet@36265
   528
   known_failures =
blanchet@37995
   529
     [(Unprovable, "SZS status: CounterSatisfiable"),
blanchet@37995
   530
      (Unprovable, "SZS status CounterSatisfiable"),
blanchet@36370
   531
      (TimedOut, "Failure: Resource limit exceeded (time)"),
blanchet@36370
   532
      (TimedOut, "time limit exceeded"),
blanchet@36370
   533
      (OutOfResources,
blanchet@36370
   534
       "# Cannot determine problem status within resource limit"),
blanchet@36370
   535
      (OutOfResources, "SZS status: ResourceOut"),
blanchet@36370
   536
      (OutOfResources, "SZS status ResourceOut")],
blanchet@38009
   537
   max_new_relevant_facts_per_iter = 80 (* FIXME *),
blanchet@37994
   538
   prefers_theory_relevant = false,
blanchet@37994
   539
   explicit_forall = false}
blanchet@35969
   540
val e = tptp_prover "e" e_config
wenzelm@28596
   541
wenzelm@28596
   542
blanchet@36219
   543
(* The "-VarWeight=3" option helps the higher-order problems, probably by
blanchet@36219
   544
   counteracting the presence of "hAPP". *)
blanchet@37498
   545
val spass_config : prover_config =
blanchet@37962
   546
  {home_var = "ISABELLE_ATP_MANAGER",
blanchet@37962
   547
   executable = "SPASS_TPTP",
blanchet@37550
   548
   (* "div 2" accounts for the fact that SPASS is often run twice. *)
blanchet@37514
   549
   arguments = fn complete => fn timeout =>
blanchet@37962
   550
     ("-Auto -PGiven=0 -PProblem=0 -Splits=0 -FullRed=0 -DocProof \
blanchet@37550
   551
      \-VarWeight=3 -TimeLimit=" ^
blanchet@37550
   552
      string_of_int (to_generous_secs timeout div 2))
blanchet@37514
   553
     |> not complete ? prefix "-SOS=1 ",
blanchet@36369
   554
   proof_delims = [("Here is a proof", "Formulae used in the proof")],
blanchet@36289
   555
   known_failures =
blanchet@37413
   556
     [(IncompleteUnprovable, "SPASS beiseite: Completion found"),
blanchet@36370
   557
      (TimedOut, "SPASS beiseite: Ran out of time"),
blanchet@36965
   558
      (OutOfResources, "SPASS beiseite: Maximal number of loops exceeded"),
blanchet@37413
   559
      (MalformedInput, "Undefined symbol"),
blanchet@37414
   560
      (MalformedInput, "Free Variable"),
blanchet@37962
   561
      (OldSpass, "tptp2dfg")],
blanchet@38009
   562
   max_new_relevant_facts_per_iter = 26 (* FIXME *),
blanchet@37994
   563
   prefers_theory_relevant = true,
blanchet@37994
   564
   explicit_forall = true}
blanchet@37414
   565
val spass = tptp_prover "spass" spass_config
wenzelm@28596
   566
blanchet@37509
   567
(* Vampire *)
blanchet@37509
   568
blanchet@37509
   569
val vampire_config : prover_config =
blanchet@37509
   570
  {home_var = "VAMPIRE_HOME",
blanchet@37509
   571
   executable = "vampire",
blanchet@37514
   572
   arguments = fn _ => fn timeout =>
blanchet@37509
   573
     "--output_syntax tptp --mode casc -t " ^
blanchet@37509
   574
     string_of_int (to_generous_secs timeout),
blanchet@37509
   575
   proof_delims =
blanchet@37509
   576
     [("=========== Refutation ==========",
blanchet@37509
   577
       "======= End of refutation ======="),
blanchet@37509
   578
      ("% SZS output start Refutation", "% SZS output end Refutation")],
blanchet@37509
   579
   known_failures =
blanchet@37509
   580
     [(Unprovable, "UNPROVABLE"),
blanchet@37509
   581
      (IncompleteUnprovable, "CANNOT PROVE"),
blanchet@37509
   582
      (Unprovable, "Satisfiability detected"),
blanchet@37509
   583
      (OutOfResources, "Refutation not found")],
blanchet@38009
   584
   max_new_relevant_facts_per_iter = 40 (* FIXME *),
blanchet@37994
   585
   prefers_theory_relevant = false,
blanchet@37994
   586
   explicit_forall = false}
blanchet@37509
   587
val vampire = tptp_prover "vampire" vampire_config
blanchet@37509
   588
blanchet@37509
   589
(* Remote prover invocation via SystemOnTPTP *)
wenzelm@28596
   590
blanchet@36376
   591
val systems = Synchronized.var "atp_systems" ([]: string list);
immler@31835
   592
immler@31835
   593
fun get_systems () =
blanchet@36370
   594
  case bash_output "\"$ISABELLE_ATP_MANAGER/SystemOnTPTP\" -w" of
blanchet@36370
   595
    (answer, 0) => split_lines answer
blanchet@36370
   596
  | (answer, _) =>
blanchet@37627
   597
    error ("Failed to get available systems at SystemOnTPTP:\n" ^
blanchet@37627
   598
           perhaps (try (unsuffix "\n")) answer)
immler@31835
   599
blanchet@35867
   600
fun refresh_systems_on_tptp () =
blanchet@37509
   601
  Synchronized.change systems (fn _ => get_systems ())
immler@31835
   602
immler@31835
   603
fun get_system prefix = Synchronized.change_result systems (fn systems =>
boehmes@32864
   604
  (if null systems then get_systems () else systems)
wenzelm@32942
   605
  |> `(find_first (String.isPrefix prefix)));
boehmes@32864
   606
wenzelm@32948
   607
fun the_system prefix =
boehmes@32864
   608
  (case get_system prefix of
blanchet@37509
   609
    NONE => error ("System " ^ quote prefix ^ " not available at SystemOnTPTP.")
wenzelm@32942
   610
  | SOME sys => sys);
immler@31835
   611
blanchet@36265
   612
val remote_known_failures =
blanchet@37627
   613
  [(CantConnect, "HTTP-Error"),
blanchet@37627
   614
   (TimedOut, "says Timeout"),
blanchet@36377
   615
   (MalformedOutput, "Remote script could not extract proof")]
blanchet@35865
   616
blanchet@37509
   617
fun remote_config atp_prefix args
blanchet@38009
   618
        ({proof_delims, known_failures, max_new_relevant_facts_per_iter,
blanchet@37994
   619
          prefers_theory_relevant, explicit_forall, ...} : prover_config)
blanchet@37994
   620
        : prover_config =
blanchet@36917
   621
  {home_var = "ISABELLE_ATP_MANAGER",
blanchet@36289
   622
   executable = "SystemOnTPTP",
blanchet@37514
   623
   arguments = fn _ => fn timeout =>
blanchet@36382
   624
     args ^ " -t " ^ string_of_int (to_generous_secs timeout) ^ " -s " ^
blanchet@36382
   625
     the_system atp_prefix,
blanchet@36369
   626
   proof_delims = insert (op =) tstp_proof_delims proof_delims,
blanchet@36265
   627
   known_failures = remote_known_failures @ known_failures,
blanchet@38009
   628
   max_new_relevant_facts_per_iter = max_new_relevant_facts_per_iter,
blanchet@37994
   629
   prefers_theory_relevant = prefers_theory_relevant,
blanchet@37994
   630
   explicit_forall = explicit_forall}
wenzelm@28596
   631
blanchet@37509
   632
fun remote_tptp_prover prover atp_prefix args config =
blanchet@37509
   633
  tptp_prover (remotify (fst prover)) (remote_config atp_prefix args config)
boehmes@32864
   634
blanchet@37509
   635
val remote_e = remote_tptp_prover e "EP---" "" e_config
blanchet@37509
   636
val remote_spass = remote_tptp_prover spass "SPASS---" "-x" spass_config
blanchet@37509
   637
val remote_vampire = remote_tptp_prover vampire "Vampire---9" "" vampire_config
wenzelm@28592
   638
blanchet@36917
   639
fun maybe_remote (name, _) ({home_var, ...} : prover_config) =
blanchet@36917
   640
  name |> getenv home_var = "" ? remotify
blanchet@36371
   641
blanchet@36371
   642
fun default_atps_param_value () =
blanchet@36371
   643
  space_implode " " [maybe_remote e e_config, maybe_remote spass spass_config,
blanchet@36371
   644
                     remotify (fst vampire)]
blanchet@36371
   645
blanchet@37509
   646
val provers = [e, spass, vampire, remote_e, remote_spass, remote_vampire]
blanchet@35867
   647
val prover_setup = fold add_prover provers
blanchet@35867
   648
blanchet@35867
   649
val setup =
blanchet@36376
   650
  dest_dir_setup
blanchet@35867
   651
  #> problem_prefix_setup
blanchet@35867
   652
  #> measure_runtime_setup
blanchet@36371
   653
  #> prover_setup
blanchet@35867
   654
wenzelm@28592
   655
end;