src/HOL/Tools/Sledgehammer/sledgehammer_atp_translate.ML
author blanchet
Tue May 17 15:11:36 2011 +0200 (2011-05-17)
changeset 42828 8794ec73ec13
parent 42781 4b7a988a0213
child 42829 1558741f8a72
permissions -rw-r--r--
added syntax for "shallow" encodings
blanchet@40114
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_atp_translate.ML
blanchet@38282
     2
    Author:     Fabian Immler, TU Muenchen
blanchet@38282
     3
    Author:     Makarius
blanchet@38282
     4
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@38282
     5
blanchet@39494
     6
Translation of HOL to FOL for Sledgehammer.
blanchet@38282
     7
*)
blanchet@38282
     8
blanchet@40068
     9
signature SLEDGEHAMMER_ATP_TRANSLATE =
blanchet@38282
    10
sig
blanchet@42227
    11
  type 'a fo_term = 'a ATP_Problem.fo_term
blanchet@42709
    12
  type formula_kind = ATP_Problem.formula_kind
blanchet@38282
    13
  type 'a problem = 'a ATP_Problem.problem
blanchet@42640
    14
  type locality = Sledgehammer_Filter.locality
blanchet@42613
    15
blanchet@42613
    16
  datatype polymorphism = Polymorphic | Monomorphic | Mangled_Monomorphic
blanchet@42613
    17
  datatype type_level =
blanchet@42613
    18
    All_Types | Nonmonotonic_Types | Finite_Types | Const_Arg_Types | No_Types
blanchet@42828
    19
  datatype type_depth = Deep | Shallow
blanchet@42613
    20
blanchet@42613
    21
  datatype type_system =
blanchet@42722
    22
    Simple_Types of type_level |
blanchet@42828
    23
    Preds of polymorphism * type_level * type_depth |
blanchet@42828
    24
    Tags of polymorphism * type_level * type_depth
blanchet@42613
    25
blanchet@40114
    26
  type translated_formula
blanchet@38282
    27
blanchet@42646
    28
  val readable_names : bool Config.T
blanchet@40204
    29
  val fact_prefix : string
blanchet@38282
    30
  val conjecture_prefix : string
blanchet@42568
    31
  val predicator_base : string
blanchet@42544
    32
  val explicit_app_base : string
blanchet@42549
    33
  val type_pred_base : string
blanchet@42562
    34
  val tff_type_prefix : string
blanchet@42613
    35
  val type_sys_from_string : string -> type_system
blanchet@42613
    36
  val polymorphism_of_type_sys : type_system -> polymorphism
blanchet@42613
    37
  val level_of_type_sys : type_system -> type_level
blanchet@42613
    38
  val is_type_sys_virtually_sound : type_system -> bool
blanchet@42613
    39
  val is_type_sys_fairly_sound : type_system -> bool
blanchet@42542
    40
  val unmangled_const : string -> string * string fo_term list
blanchet@41088
    41
  val translate_atp_fact :
blanchet@42640
    42
    Proof.context -> bool -> (string * locality) * thm
blanchet@42640
    43
    -> translated_formula option * ((string * locality) * thm)
blanchet@40059
    44
  val prepare_atp_problem :
blanchet@42709
    45
    Proof.context -> formula_kind -> formula_kind -> type_system -> bool
blanchet@42709
    46
    -> term list -> term
blanchet@41091
    47
    -> (translated_formula option * ((string * 'a) * thm)) list
blanchet@42541
    48
    -> string problem * string Symtab.table * int * int
blanchet@42755
    49
       * (string * 'a) list vector * int Symtab.table
blanchet@41313
    50
  val atp_problem_weights : string problem -> (string * real) list
blanchet@38282
    51
end;
blanchet@38282
    52
blanchet@41140
    53
structure Sledgehammer_ATP_Translate : SLEDGEHAMMER_ATP_TRANSLATE =
blanchet@38282
    54
struct
blanchet@38282
    55
blanchet@38282
    56
open ATP_Problem
blanchet@39494
    57
open Metis_Translate
blanchet@38282
    58
open Sledgehammer_Util
blanchet@42640
    59
open Sledgehammer_Filter
blanchet@42640
    60
blanchet@42640
    61
(* experimental *)
blanchet@42640
    62
val generate_useful_info = false
blanchet@38282
    63
blanchet@42568
    64
(* Readable names are often much shorter, especially if types are mangled in
blanchet@42589
    65
   names. Also, the logic for generating legal SNARK sort names is only
blanchet@42589
    66
   implemented for readable names. Finally, readable names are, well, more
blanchet@42589
    67
   readable. For these reason, they are enabled by default. *)
blanchet@42646
    68
val readable_names =
blanchet@42646
    69
  Attrib.setup_config_bool @{binding sledgehammer_atp_readable_names} (K true)
blanchet@42568
    70
blanchet@42543
    71
val type_decl_prefix = "type_"
blanchet@42543
    72
val sym_decl_prefix = "sym_"
blanchet@40204
    73
val fact_prefix = "fact_"
blanchet@38282
    74
val conjecture_prefix = "conj_"
blanchet@38282
    75
val helper_prefix = "help_"
blanchet@42543
    76
val class_rel_clause_prefix = "crel_";
blanchet@38282
    77
val arity_clause_prefix = "arity_"
blanchet@39975
    78
val tfree_prefix = "tfree_"
blanchet@38282
    79
blanchet@42568
    80
val predicator_base = "hBOOL"
blanchet@42544
    81
val explicit_app_base = "hAPP"
blanchet@42542
    82
val type_pred_base = "is"
blanchet@42562
    83
val tff_type_prefix = "ty_"
blanchet@42531
    84
blanchet@42562
    85
fun make_tff_type s = tff_type_prefix ^ ascii_of s
blanchet@42531
    86
blanchet@38282
    87
(* Freshness almost guaranteed! *)
blanchet@38282
    88
val sledgehammer_weak_prefix = "Sledgehammer:"
blanchet@38282
    89
blanchet@42613
    90
datatype polymorphism = Polymorphic | Monomorphic | Mangled_Monomorphic
blanchet@42613
    91
datatype type_level =
blanchet@42613
    92
  All_Types | Nonmonotonic_Types | Finite_Types | Const_Arg_Types | No_Types
blanchet@42828
    93
datatype type_depth = Deep | Shallow
blanchet@42613
    94
blanchet@42613
    95
datatype type_system =
blanchet@42722
    96
  Simple_Types of type_level |
blanchet@42828
    97
  Preds of polymorphism * type_level * type_depth |
blanchet@42828
    98
  Tags of polymorphism * type_level * type_depth
blanchet@42613
    99
blanchet@42689
   100
fun try_unsuffixes ss s =
blanchet@42689
   101
  fold (fn s' => fn NONE => try (unsuffix s') s | some => some) ss NONE
blanchet@42689
   102
blanchet@42613
   103
fun type_sys_from_string s =
blanchet@42722
   104
  (case try (unprefix "poly_") s of
blanchet@42722
   105
     SOME s => (SOME Polymorphic, s)
blanchet@42613
   106
   | NONE =>
blanchet@42613
   107
     case try (unprefix "mono_") s of
blanchet@42722
   108
       SOME s => (SOME Monomorphic, s)
blanchet@42722
   109
     | NONE =>
blanchet@42722
   110
       case try (unprefix "mangled_") s of
blanchet@42722
   111
         SOME s => (SOME Mangled_Monomorphic, s)
blanchet@42722
   112
       | NONE => (NONE, s))
blanchet@42613
   113
  ||> (fn s =>
blanchet@42689
   114
          (* "_query" and "_bang" are for the ASCII-challenged Mirabelle. *)
blanchet@42689
   115
          case try_unsuffixes ["?", "_query"] s of
blanchet@42613
   116
            SOME s => (Nonmonotonic_Types, s)
blanchet@42613
   117
          | NONE =>
blanchet@42689
   118
            case try_unsuffixes ["!", "_bang"] s of
blanchet@42613
   119
              SOME s => (Finite_Types, s)
blanchet@42613
   120
            | NONE => (All_Types, s))
blanchet@42828
   121
  ||> apsnd (fn s =>
blanchet@42828
   122
                case try (unsuffix "_shallow") s of
blanchet@42828
   123
                  SOME s => (Shallow, s)
blanchet@42828
   124
                | NONE => (Deep, s))
blanchet@42828
   125
  |> (fn (poly, (level, (depth, core))) =>
blanchet@42828
   126
         case (core, (poly, level, depth)) of
blanchet@42828
   127
           ("simple_types", (NONE, level, Deep (* naja *))) =>
blanchet@42828
   128
           Simple_Types level
blanchet@42828
   129
         | ("preds", (SOME Polymorphic, level, depth)) =>
blanchet@42828
   130
           if level = All_Types then Preds (Polymorphic, level, depth)
blanchet@42753
   131
           else raise Same.SAME
blanchet@42828
   132
         | ("preds", (SOME poly, level, depth)) => Preds (poly, level, depth)
blanchet@42828
   133
         | ("tags", (SOME Polymorphic, level, depth)) =>
blanchet@42753
   134
           if level = All_Types orelse level = Finite_Types then
blanchet@42828
   135
             Tags (Polymorphic, level, depth)
blanchet@42753
   136
           else
blanchet@42753
   137
             raise Same.SAME
blanchet@42828
   138
         | ("tags", (SOME poly, level, depth)) => Tags (poly, level, depth)
blanchet@42828
   139
         | ("args", (SOME poly, All_Types (* naja *), Deep (* naja *))) =>
blanchet@42828
   140
           Preds (poly, Const_Arg_Types, Shallow)
blanchet@42828
   141
         | ("erased", (NONE, All_Types (* naja *), Deep (* naja *))) =>
blanchet@42828
   142
           Preds (Polymorphic, No_Types, Shallow)
blanchet@42753
   143
         | _ => raise Same.SAME)
blanchet@42753
   144
  handle Same.SAME => error ("Unknown type system: " ^ quote s ^ ".")
blanchet@42613
   145
blanchet@42722
   146
fun polymorphism_of_type_sys (Simple_Types _) = Mangled_Monomorphic
blanchet@42828
   147
  | polymorphism_of_type_sys (Preds (poly, _, _)) = poly
blanchet@42828
   148
  | polymorphism_of_type_sys (Tags (poly, _, _)) = poly
blanchet@42613
   149
blanchet@42722
   150
fun level_of_type_sys (Simple_Types level) = level
blanchet@42828
   151
  | level_of_type_sys (Preds (_, level, _)) = level
blanchet@42828
   152
  | level_of_type_sys (Tags (_, level, _)) = level
blanchet@42828
   153
blanchet@42828
   154
fun depth_of_type_sys (Simple_Types _) = Shallow
blanchet@42828
   155
  | depth_of_type_sys (Preds (_, _, depth)) = depth
blanchet@42828
   156
  | depth_of_type_sys (Tags (_, _, depth)) = depth
blanchet@42613
   157
blanchet@42687
   158
fun is_type_level_virtually_sound level =
blanchet@42687
   159
  level = All_Types orelse level = Nonmonotonic_Types
blanchet@42613
   160
val is_type_sys_virtually_sound =
blanchet@42613
   161
  is_type_level_virtually_sound o level_of_type_sys
blanchet@42613
   162
blanchet@42613
   163
fun is_type_level_fairly_sound level =
blanchet@42613
   164
  is_type_level_virtually_sound level orelse level = Finite_Types
blanchet@42613
   165
val is_type_sys_fairly_sound = is_type_level_fairly_sound o level_of_type_sys
blanchet@42613
   166
blanchet@42687
   167
fun is_type_level_partial level =
blanchet@42687
   168
  level = Nonmonotonic_Types orelse level = Finite_Types
blanchet@42687
   169
blanchet@42573
   170
fun formula_map f (AQuant (q, xs, phi)) = AQuant (q, xs, formula_map f phi)
blanchet@42573
   171
  | formula_map f (AConn (c, phis)) = AConn (c, map (formula_map f) phis)
blanchet@42573
   172
  | formula_map f (AAtom tm) = AAtom (f tm)
blanchet@42573
   173
blanchet@42680
   174
fun formula_fold pos f =
blanchet@42677
   175
  let
blanchet@42677
   176
    fun aux pos (AQuant (_, _, phi)) = aux pos phi
blanchet@42680
   177
      | aux pos (AConn (ANot, [phi])) = aux (Option.map not pos) phi
blanchet@42677
   178
      | aux pos (AConn (AImplies, [phi1, phi2])) =
blanchet@42680
   179
        aux (Option.map not pos) phi1 #> aux pos phi2
blanchet@42680
   180
      | aux pos (AConn (AAnd, phis)) = fold (aux pos) phis
blanchet@42680
   181
      | aux pos (AConn (AOr, phis)) = fold (aux pos) phis
blanchet@42680
   182
      | aux _ (AConn (_, phis)) = fold (aux NONE) phis
blanchet@42677
   183
      | aux pos (AAtom tm) = f pos tm
blanchet@42680
   184
  in aux (SOME pos) end
blanchet@42573
   185
blanchet@40114
   186
type translated_formula =
blanchet@38752
   187
  {name: string,
blanchet@42640
   188
   locality: locality,
blanchet@42525
   189
   kind: formula_kind,
blanchet@42562
   190
   combformula: (name, typ, combterm) formula,
blanchet@42562
   191
   atomic_types: typ list}
blanchet@38282
   192
blanchet@42640
   193
fun update_combformula f ({name, locality, kind, combformula, atomic_types}
blanchet@42640
   194
                          : translated_formula) =
blanchet@42640
   195
  {name = name, locality = locality, kind = kind, combformula = f combformula,
blanchet@42562
   196
   atomic_types = atomic_types} : translated_formula
blanchet@42542
   197
blanchet@42558
   198
fun fact_lift f ({combformula, ...} : translated_formula) = f combformula
blanchet@42558
   199
blanchet@42572
   200
val boring_consts = [explicit_app_base, @{const_name Metis.fequal}]
blanchet@42572
   201
blanchet@42572
   202
fun should_omit_type_args type_sys s =
blanchet@42589
   203
  s <> type_pred_base andalso s <> type_tag_name andalso
blanchet@42589
   204
  (s = @{const_name HOL.eq} orelse level_of_type_sys type_sys = No_Types orelse
blanchet@42589
   205
   (case type_sys of
blanchet@42828
   206
      Tags (_, All_Types, _) => true
blanchet@42589
   207
    | _ => polymorphism_of_type_sys type_sys <> Mangled_Monomorphic andalso
blanchet@42589
   208
           member (op =) boring_consts s))
blanchet@42677
   209
blanchet@42753
   210
(* The Booleans indicate whether all type arguments should be kept. *)
blanchet@42753
   211
datatype type_arg_policy =
blanchet@42753
   212
  Explicit_Type_Args of bool |
blanchet@42753
   213
  Mangled_Type_Args of bool |
blanchet@42753
   214
  No_Type_Args
blanchet@41136
   215
blanchet@42753
   216
(* FIXME: Find out whether and when erasing the non-result type arguments is
blanchet@42753
   217
   sound. *)
blanchet@42589
   218
fun general_type_arg_policy type_sys =
blanchet@42589
   219
  if level_of_type_sys type_sys = No_Types then
blanchet@42589
   220
    No_Type_Args
blanchet@42589
   221
  else if polymorphism_of_type_sys type_sys = Mangled_Monomorphic then
blanchet@42753
   222
    Mangled_Type_Args (is_type_sys_virtually_sound type_sys)
blanchet@42589
   223
  else
blanchet@42753
   224
    Explicit_Type_Args (is_type_sys_virtually_sound type_sys)
blanchet@42563
   225
blanchet@42524
   226
fun type_arg_policy type_sys s =
blanchet@42572
   227
  if should_omit_type_args type_sys s then No_Type_Args
blanchet@42563
   228
  else general_type_arg_policy type_sys
blanchet@42227
   229
blanchet@42353
   230
fun atp_type_literals_for_types type_sys kind Ts =
blanchet@42589
   231
  if level_of_type_sys type_sys = No_Types then
blanchet@42353
   232
    []
blanchet@42353
   233
  else
blanchet@42353
   234
    Ts |> type_literals_for_types
blanchet@42353
   235
       |> filter (fn TyLitVar _ => kind <> Conjecture
blanchet@42353
   236
                   | TyLitFree _ => kind = Conjecture)
blanchet@41137
   237
blanchet@42709
   238
fun mk_anot phi = AConn (ANot, [phi])
blanchet@38282
   239
fun mk_aconn c phi1 phi2 = AConn (c, [phi1, phi2])
blanchet@42534
   240
fun mk_aconns c phis =
blanchet@42534
   241
  let val (phis', phi') = split_last phis in
blanchet@42534
   242
    fold_rev (mk_aconn c) phis' phi'
blanchet@42534
   243
  end
blanchet@38282
   244
fun mk_ahorn [] phi = phi
blanchet@42534
   245
  | mk_ahorn phis psi = AConn (AImplies, [mk_aconns AAnd phis, psi])
blanchet@42522
   246
fun mk_aquant _ [] phi = phi
blanchet@42522
   247
  | mk_aquant q xs (phi as AQuant (q', xs', phi')) =
blanchet@42522
   248
    if q = q' then AQuant (q, xs @ xs', phi') else AQuant (q, xs, phi)
blanchet@42522
   249
  | mk_aquant q xs phi = AQuant (q, xs, phi)
blanchet@38282
   250
blanchet@42522
   251
fun close_universally atom_vars phi =
blanchet@41145
   252
  let
blanchet@41145
   253
    fun formula_vars bounds (AQuant (_, xs, phi)) =
blanchet@42526
   254
        formula_vars (map fst xs @ bounds) phi
blanchet@41145
   255
      | formula_vars bounds (AConn (_, phis)) = fold (formula_vars bounds) phis
blanchet@42522
   256
      | formula_vars bounds (AAtom tm) =
blanchet@42526
   257
        union (op =) (atom_vars tm []
blanchet@42526
   258
                      |> filter_out (member (op =) bounds o fst))
blanchet@42522
   259
  in mk_aquant AForall (formula_vars [] phi []) phi end
blanchet@42522
   260
blanchet@42531
   261
fun combterm_vars (CombApp (tm1, tm2)) = fold combterm_vars [tm1, tm2]
blanchet@42522
   262
  | combterm_vars (CombConst _) = I
blanchet@42574
   263
  | combterm_vars (CombVar (name, T)) = insert (op =) (name, SOME T)
blanchet@42674
   264
fun close_combformula_universally phi = close_universally combterm_vars phi
blanchet@42522
   265
blanchet@42522
   266
fun term_vars (ATerm (name as (s, _), tms)) =
blanchet@42531
   267
  is_atp_variable s ? insert (op =) (name, NONE)
blanchet@42526
   268
  #> fold term_vars tms
blanchet@42674
   269
fun close_formula_universally phi = close_universally term_vars phi
blanchet@41145
   270
blanchet@42562
   271
fun fo_term_from_typ (Type (s, Ts)) =
blanchet@42562
   272
    ATerm (`make_fixed_type_const s, map fo_term_from_typ Ts)
blanchet@42562
   273
  | fo_term_from_typ (TFree (s, _)) =
blanchet@42562
   274
    ATerm (`make_fixed_type_var s, [])
blanchet@42562
   275
  | fo_term_from_typ (TVar ((x as (s, _)), _)) =
blanchet@42562
   276
    ATerm ((make_schematic_type_var x, s), [])
blanchet@42562
   277
blanchet@42562
   278
(* This shouldn't clash with anything else. *)
blanchet@42542
   279
val mangled_type_sep = "\000"
blanchet@42542
   280
blanchet@42562
   281
fun generic_mangled_type_name f (ATerm (name, [])) = f name
blanchet@42562
   282
  | generic_mangled_type_name f (ATerm (name, tys)) =
blanchet@42761
   283
    f name ^ "(" ^ space_implode "," (map (generic_mangled_type_name f) tys)
blanchet@42761
   284
    ^ ")"
blanchet@42562
   285
val mangled_type_name =
blanchet@42562
   286
  fo_term_from_typ
blanchet@42562
   287
  #> (fn ty => (make_tff_type (generic_mangled_type_name fst ty),
blanchet@42562
   288
                generic_mangled_type_name snd ty))
blanchet@42542
   289
blanchet@42574
   290
fun generic_mangled_type_suffix f g Ts =
blanchet@42542
   291
  fold_rev (curry (op ^) o g o prefix mangled_type_sep
blanchet@42574
   292
            o generic_mangled_type_name f) Ts ""
blanchet@42562
   293
fun mangled_const_name T_args (s, s') =
blanchet@42562
   294
  let val ty_args = map fo_term_from_typ T_args in
blanchet@42562
   295
    (s ^ generic_mangled_type_suffix fst ascii_of ty_args,
blanchet@42562
   296
     s' ^ generic_mangled_type_suffix snd I ty_args)
blanchet@42562
   297
  end
blanchet@42542
   298
blanchet@42542
   299
val parse_mangled_ident =
blanchet@42542
   300
  Scan.many1 (not o member (op =) ["(", ")", ","]) >> implode
blanchet@42542
   301
blanchet@42542
   302
fun parse_mangled_type x =
blanchet@42542
   303
  (parse_mangled_ident
blanchet@42542
   304
   -- Scan.optional ($$ "(" |-- Scan.optional parse_mangled_types [] --| $$ ")")
blanchet@42542
   305
                    [] >> ATerm) x
blanchet@42542
   306
and parse_mangled_types x =
blanchet@42542
   307
  (parse_mangled_type ::: Scan.repeat ($$ "," |-- parse_mangled_type)) x
blanchet@42542
   308
blanchet@42542
   309
fun unmangled_type s =
blanchet@42542
   310
  s |> suffix ")" |> raw_explode
blanchet@42542
   311
    |> Scan.finite Symbol.stopper
blanchet@42542
   312
           (Scan.error (!! (fn _ => raise Fail ("unrecognized mangled type " ^
blanchet@42542
   313
                                                quote s)) parse_mangled_type))
blanchet@42542
   314
    |> fst
blanchet@42542
   315
blanchet@42561
   316
val unmangled_const_name = space_explode mangled_type_sep #> hd
blanchet@42542
   317
fun unmangled_const s =
blanchet@42542
   318
  let val ss = space_explode mangled_type_sep s in
blanchet@42542
   319
    (hd ss, map unmangled_type (tl ss))
blanchet@42542
   320
  end
blanchet@42542
   321
blanchet@42674
   322
fun introduce_proxies tm =
blanchet@42568
   323
  let
blanchet@42568
   324
    fun aux top_level (CombApp (tm1, tm2)) =
blanchet@42568
   325
        CombApp (aux top_level tm1, aux false tm2)
blanchet@42574
   326
      | aux top_level (CombConst (name as (s, s'), T, T_args)) =
blanchet@42570
   327
        (case proxify_const s of
blanchet@42568
   328
           SOME proxy_base =>
blanchet@42568
   329
           if top_level then
blanchet@42568
   330
             (case s of
blanchet@42568
   331
                "c_False" => (tptp_false, s')
blanchet@42568
   332
              | "c_True" => (tptp_true, s')
blanchet@42568
   333
              | _ => name, [])
blanchet@42569
   334
           else
blanchet@42574
   335
             (proxy_base |>> prefix const_prefix, T_args)
blanchet@42574
   336
          | NONE => (name, T_args))
blanchet@42574
   337
        |> (fn (name, T_args) => CombConst (name, T, T_args))
blanchet@42568
   338
      | aux _ tm = tm
blanchet@42674
   339
  in aux true tm end
blanchet@42568
   340
blanchet@42562
   341
fun combformula_from_prop thy eq_as_iff =
blanchet@38282
   342
  let
blanchet@42568
   343
    fun do_term bs t atomic_types =
blanchet@41140
   344
      combterm_from_term thy bs (Envir.eta_contract t)
blanchet@42568
   345
      |>> (introduce_proxies #> AAtom)
blanchet@42568
   346
      ||> union (op =) atomic_types
blanchet@38282
   347
    fun do_quant bs q s T t' =
blanchet@38518
   348
      let val s = Name.variant (map fst bs) s in
blanchet@38518
   349
        do_formula ((s, T) :: bs) t'
blanchet@42562
   350
        #>> mk_aquant q [(`make_bound_var s, SOME T)]
blanchet@38518
   351
      end
blanchet@38282
   352
    and do_conn bs c t1 t2 =
blanchet@38282
   353
      do_formula bs t1 ##>> do_formula bs t2
blanchet@42531
   354
      #>> uncurry (mk_aconn c)
blanchet@38282
   355
    and do_formula bs t =
blanchet@38282
   356
      case t of
blanchet@42531
   357
        @{const Not} $ t1 => do_formula bs t1 #>> mk_anot
blanchet@38282
   358
      | Const (@{const_name All}, _) $ Abs (s, T, t') =>
blanchet@38282
   359
        do_quant bs AForall s T t'
blanchet@38282
   360
      | Const (@{const_name Ex}, _) $ Abs (s, T, t') =>
blanchet@38282
   361
        do_quant bs AExists s T t'
haftmann@38795
   362
      | @{const HOL.conj} $ t1 $ t2 => do_conn bs AAnd t1 t2
haftmann@38795
   363
      | @{const HOL.disj} $ t1 $ t2 => do_conn bs AOr t1 t2
haftmann@38786
   364
      | @{const HOL.implies} $ t1 $ t2 => do_conn bs AImplies t1 t2
haftmann@38864
   365
      | Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 =>
blanchet@41140
   366
        if eq_as_iff then do_conn bs AIff t1 t2 else do_term bs t
blanchet@41140
   367
      | _ => do_term bs t
blanchet@38282
   368
  in do_formula [] end
blanchet@38282
   369
blanchet@42750
   370
fun presimplify_term ctxt =
blanchet@42750
   371
  Skip_Proof.make_thm (Proof_Context.theory_of ctxt)
blanchet@42750
   372
  #> Meson.presimplify ctxt
blanchet@42750
   373
  #> prop_of
blanchet@38282
   374
wenzelm@41491
   375
fun concealed_bound_name j = sledgehammer_weak_prefix ^ string_of_int j
blanchet@38282
   376
fun conceal_bounds Ts t =
blanchet@38282
   377
  subst_bounds (map (Free o apfst concealed_bound_name)
blanchet@38282
   378
                    (0 upto length Ts - 1 ~~ Ts), t)
blanchet@38282
   379
fun reveal_bounds Ts =
blanchet@38282
   380
  subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j))
blanchet@38282
   381
                    (0 upto length Ts - 1 ~~ Ts))
blanchet@38282
   382
blanchet@42747
   383
fun extensionalize_term ctxt t =
blanchet@42747
   384
  let val thy = Proof_Context.theory_of ctxt in
blanchet@42747
   385
    t |> cterm_of thy |> Meson.extensionalize_conv ctxt
blanchet@42747
   386
      |> prop_of |> Logic.dest_equals |> snd
blanchet@42747
   387
  end
blanchet@38608
   388
blanchet@38282
   389
fun introduce_combinators_in_term ctxt kind t =
wenzelm@42361
   390
  let val thy = Proof_Context.theory_of ctxt in
blanchet@38491
   391
    if Meson.is_fol_term thy t then
blanchet@38491
   392
      t
blanchet@38491
   393
    else
blanchet@38491
   394
      let
blanchet@38491
   395
        fun aux Ts t =
blanchet@38491
   396
          case t of
blanchet@38491
   397
            @{const Not} $ t1 => @{const Not} $ aux Ts t1
blanchet@38491
   398
          | (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') =>
blanchet@38491
   399
            t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38652
   400
          | (t0 as Const (@{const_name All}, _)) $ t1 =>
blanchet@38652
   401
            aux Ts (t0 $ eta_expand Ts t1 1)
blanchet@38491
   402
          | (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') =>
blanchet@38491
   403
            t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38652
   404
          | (t0 as Const (@{const_name Ex}, _)) $ t1 =>
blanchet@38652
   405
            aux Ts (t0 $ eta_expand Ts t1 1)
haftmann@38795
   406
          | (t0 as @{const HOL.conj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38795
   407
          | (t0 as @{const HOL.disj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38786
   408
          | (t0 as @{const HOL.implies}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38864
   409
          | (t0 as Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])))
blanchet@38491
   410
              $ t1 $ t2 =>
blanchet@38491
   411
            t0 $ aux Ts t1 $ aux Ts t2
blanchet@38491
   412
          | _ => if not (exists_subterm (fn Abs _ => true | _ => false) t) then
blanchet@38491
   413
                   t
blanchet@38491
   414
                 else
blanchet@38491
   415
                   t |> conceal_bounds Ts
blanchet@38491
   416
                     |> Envir.eta_contract
blanchet@38491
   417
                     |> cterm_of thy
blanchet@39890
   418
                     |> Meson_Clausify.introduce_combinators_in_cterm
blanchet@38491
   419
                     |> prop_of |> Logic.dest_equals |> snd
blanchet@38491
   420
                     |> reveal_bounds Ts
blanchet@39370
   421
        val (t, ctxt') = Variable.import_terms true [t] ctxt |>> the_single
blanchet@38491
   422
      in t |> aux [] |> singleton (Variable.export_terms ctxt' ctxt) end
blanchet@38491
   423
      handle THM _ =>
blanchet@38491
   424
             (* A type variable of sort "{}" will make abstraction fail. *)
blanchet@38613
   425
             if kind = Conjecture then HOLogic.false_const
blanchet@38613
   426
             else HOLogic.true_const
blanchet@38491
   427
  end
blanchet@38282
   428
blanchet@38282
   429
(* Metis's use of "resolve_tac" freezes the schematic variables. We simulate the
blanchet@42353
   430
   same in Sledgehammer to prevent the discovery of unreplayable proofs. *)
blanchet@38282
   431
fun freeze_term t =
blanchet@38282
   432
  let
blanchet@38282
   433
    fun aux (t $ u) = aux t $ aux u
blanchet@38282
   434
      | aux (Abs (s, T, t)) = Abs (s, T, aux t)
blanchet@38282
   435
      | aux (Var ((s, i), T)) =
blanchet@38282
   436
        Free (sledgehammer_weak_prefix ^ s ^ "_" ^ string_of_int i, T)
blanchet@38282
   437
      | aux t = t
blanchet@38282
   438
  in t |> exists_subterm is_Var t ? aux end
blanchet@38282
   439
blanchet@40204
   440
(* making fact and conjecture formulas *)
blanchet@42640
   441
fun make_formula ctxt eq_as_iff presimp name loc kind t =
blanchet@38282
   442
  let
wenzelm@42361
   443
    val thy = Proof_Context.theory_of ctxt
blanchet@38608
   444
    val t = t |> Envir.beta_eta_contract
blanchet@38652
   445
              |> transform_elim_term
blanchet@41211
   446
              |> Object_Logic.atomize_term thy
blanchet@42563
   447
    val need_trueprop = (fastype_of t = @{typ bool})
blanchet@38652
   448
    val t = t |> need_trueprop ? HOLogic.mk_Trueprop
blanchet@42742
   449
              |> Raw_Simplifier.rewrite_term thy
blanchet@42742
   450
                     (Meson.unfold_set_const_simps ctxt) []
blanchet@42747
   451
              |> extensionalize_term ctxt
blanchet@42750
   452
              |> presimp ? presimplify_term ctxt
blanchet@38282
   453
              |> perhaps (try (HOLogic.dest_Trueprop))
blanchet@38282
   454
              |> introduce_combinators_in_term ctxt kind
blanchet@38613
   455
              |> kind <> Axiom ? freeze_term
blanchet@42562
   456
    val (combformula, atomic_types) =
blanchet@42562
   457
      combformula_from_prop thy eq_as_iff t []
blanchet@38282
   458
  in
blanchet@42640
   459
    {name = name, locality = loc, kind = kind, combformula = combformula,
blanchet@42562
   460
     atomic_types = atomic_types}
blanchet@38282
   461
  end
blanchet@38282
   462
blanchet@42640
   463
fun make_fact ctxt keep_trivial eq_as_iff presimp ((name, loc), t) =
blanchet@42640
   464
  case (keep_trivial, make_formula ctxt eq_as_iff presimp name loc Axiom t) of
blanchet@41990
   465
    (false, {combformula = AAtom (CombConst (("c_True", _), _, _)), ...}) =>
blanchet@41990
   466
    NONE
blanchet@41990
   467
  | (_, formula) => SOME formula
blanchet@42561
   468
blanchet@42709
   469
fun make_conjecture ctxt prem_kind ts =
blanchet@38613
   470
  let val last = length ts - 1 in
blanchet@42709
   471
    map2 (fn j => fn t =>
blanchet@42709
   472
             let
blanchet@42709
   473
               val (kind, maybe_negate) =
blanchet@42709
   474
                 if j = last then
blanchet@42709
   475
                   (Conjecture, I)
blanchet@42709
   476
                 else
blanchet@42709
   477
                   (prem_kind,
blanchet@42709
   478
                    if prem_kind = Conjecture then update_combformula mk_anot
blanchet@42709
   479
                    else I)
blanchet@42709
   480
              in
blanchet@42709
   481
                make_formula ctxt true true (string_of_int j) Chained kind t
blanchet@42709
   482
                |> maybe_negate
blanchet@42709
   483
              end)
blanchet@38613
   484
         (0 upto last) ts
blanchet@38613
   485
  end
blanchet@38282
   486
blanchet@42682
   487
(** Finite and infinite type inference **)
blanchet@42682
   488
blanchet@42682
   489
(* Finite types such as "unit", "bool", "bool * bool", and "bool => bool" are
blanchet@42682
   490
   dangerous because their "exhaust" properties can easily lead to unsound ATP
blanchet@42682
   491
   proofs. On the other hand, all HOL infinite types can be given the same
blanchet@42682
   492
   models in first-order logic (via Löwenheim-Skolem). *)
blanchet@42682
   493
blanchet@42682
   494
fun should_encode_type _ _ All_Types _ = true
blanchet@42682
   495
  | should_encode_type ctxt _ Finite_Types T = is_type_surely_finite ctxt T
blanchet@42682
   496
  | should_encode_type _ nonmono_Ts Nonmonotonic_Types T =
blanchet@42682
   497
    exists (curry Type.raw_instance T) nonmono_Ts
blanchet@42682
   498
  | should_encode_type _ _ _ _ = false
blanchet@42682
   499
blanchet@42828
   500
fun should_predicate_on_type ctxt nonmono_Ts (Preds (_, level, _)) T =
blanchet@42682
   501
    should_encode_type ctxt nonmono_Ts level T
blanchet@42682
   502
  | should_predicate_on_type _ _ _ _ = false
blanchet@42682
   503
blanchet@42828
   504
fun should_tag_with_type ctxt nonmono_Ts (Tags (_, level, _)) T =
blanchet@42682
   505
    should_encode_type ctxt nonmono_Ts level T
blanchet@42682
   506
  | should_tag_with_type _ _ _ _ = false
blanchet@42682
   507
blanchet@42682
   508
val homo_infinite_T = @{typ ind} (* any infinite type *)
blanchet@42682
   509
blanchet@42682
   510
fun homogenized_type ctxt nonmono_Ts level T =
blanchet@42682
   511
  if should_encode_type ctxt nonmono_Ts level T then T else homo_infinite_T
blanchet@42682
   512
blanchet@42573
   513
(** "hBOOL" and "hAPP" **)
blanchet@41313
   514
blanchet@42574
   515
type sym_info =
blanchet@42563
   516
  {pred_sym : bool, min_ary : int, max_ary : int, typ : typ option}
blanchet@42563
   517
blanchet@42574
   518
fun add_combterm_syms_to_table explicit_apply =
blanchet@42558
   519
  let
blanchet@42558
   520
    fun aux top_level tm =
blanchet@42558
   521
      let val (head, args) = strip_combterm_comb tm in
blanchet@42558
   522
        (case head of
blanchet@42563
   523
           CombConst ((s, _), T, _) =>
blanchet@42558
   524
           if String.isPrefix bound_var_prefix s then
blanchet@42558
   525
             I
blanchet@42558
   526
           else
blanchet@42563
   527
             let val ary = length args in
blanchet@42558
   528
               Symtab.map_default
blanchet@42558
   529
                   (s, {pred_sym = true,
blanchet@42563
   530
                        min_ary = if explicit_apply then 0 else ary,
blanchet@42563
   531
                        max_ary = 0, typ = SOME T})
blanchet@42563
   532
                   (fn {pred_sym, min_ary, max_ary, typ} =>
blanchet@42558
   533
                       {pred_sym = pred_sym andalso top_level,
blanchet@42563
   534
                        min_ary = Int.min (ary, min_ary),
blanchet@42563
   535
                        max_ary = Int.max (ary, max_ary),
blanchet@42563
   536
                        typ = if typ = SOME T then typ else NONE})
blanchet@42558
   537
            end
blanchet@42558
   538
         | _ => I)
blanchet@42558
   539
        #> fold (aux false) args
blanchet@42558
   540
      end
blanchet@42558
   541
  in aux true end
blanchet@42674
   542
fun add_fact_syms_to_table explicit_apply =
blanchet@42680
   543
  fact_lift (formula_fold true (K (add_combterm_syms_to_table explicit_apply)))
blanchet@38282
   544
blanchet@42675
   545
val default_sym_table_entries : (string * sym_info) list =
blanchet@42563
   546
  [("equal", {pred_sym = true, min_ary = 2, max_ary = 2, typ = NONE}),
blanchet@42568
   547
   (make_fixed_const predicator_base,
blanchet@42563
   548
    {pred_sym = true, min_ary = 1, max_ary = 1, typ = NONE})] @
blanchet@42568
   549
  ([tptp_false, tptp_true]
blanchet@42563
   550
   |> map (rpair {pred_sym = true, min_ary = 0, max_ary = 0, typ = NONE}))
blanchet@41140
   551
blanchet@42544
   552
fun sym_table_for_facts explicit_apply facts =
blanchet@42568
   553
  Symtab.empty |> fold Symtab.default default_sym_table_entries
blanchet@42574
   554
               |> fold (add_fact_syms_to_table explicit_apply) facts
blanchet@38282
   555
blanchet@42558
   556
fun min_arity_of sym_tab s =
blanchet@42558
   557
  case Symtab.lookup sym_tab s of
blanchet@42574
   558
    SOME ({min_ary, ...} : sym_info) => min_ary
blanchet@42558
   559
  | NONE =>
blanchet@42558
   560
    case strip_prefix_and_unascii const_prefix s of
blanchet@42547
   561
      SOME s =>
blanchet@42570
   562
      let val s = s |> unmangled_const_name |> invert_const in
blanchet@42568
   563
        if s = predicator_base then 1
blanchet@42547
   564
        else if s = explicit_app_base then 2
blanchet@42547
   565
        else if s = type_pred_base then 1
blanchet@42557
   566
        else 0
blanchet@42547
   567
      end
blanchet@42544
   568
    | NONE => 0
blanchet@38282
   569
blanchet@38282
   570
(* True if the constant ever appears outside of the top-level position in
blanchet@38282
   571
   literals, or if it appears with different arities (e.g., because of different
blanchet@38282
   572
   type instantiations). If false, the constant always receives all of its
blanchet@38282
   573
   arguments and is used as a predicate. *)
blanchet@42558
   574
fun is_pred_sym sym_tab s =
blanchet@42558
   575
  case Symtab.lookup sym_tab s of
blanchet@42574
   576
    SOME ({pred_sym, min_ary, max_ary, ...} : sym_info) =>
blanchet@42574
   577
    pred_sym andalso min_ary = max_ary
blanchet@42558
   578
  | NONE => false
blanchet@38282
   579
blanchet@42568
   580
val predicator_combconst =
blanchet@42568
   581
  CombConst (`make_fixed_const predicator_base, @{typ "bool => bool"}, [])
blanchet@42568
   582
fun predicator tm = CombApp (predicator_combconst, tm)
blanchet@42542
   583
blanchet@42568
   584
fun introduce_predicators_in_combterm sym_tab tm =
blanchet@42542
   585
  case strip_combterm_comb tm of
blanchet@42542
   586
    (CombConst ((s, _), _, _), _) =>
blanchet@42568
   587
    if is_pred_sym sym_tab s then tm else predicator tm
blanchet@42568
   588
  | _ => predicator tm
blanchet@42542
   589
blanchet@42544
   590
fun list_app head args = fold (curry (CombApp o swap)) args head
blanchet@42544
   591
blanchet@42544
   592
fun explicit_app arg head =
blanchet@42544
   593
  let
blanchet@42562
   594
    val head_T = combtyp_of head
blanchet@42693
   595
    val (arg_T, res_T) = dest_funT head_T
blanchet@42544
   596
    val explicit_app =
blanchet@42562
   597
      CombConst (`make_fixed_const explicit_app_base, head_T --> head_T,
blanchet@42693
   598
                 [arg_T, res_T])
blanchet@42544
   599
  in list_app explicit_app [head, arg] end
blanchet@42544
   600
fun list_explicit_app head args = fold explicit_app args head
blanchet@38282
   601
blanchet@42565
   602
fun introduce_explicit_apps_in_combterm sym_tab =
blanchet@42544
   603
  let
blanchet@42544
   604
    fun aux tm =
blanchet@42544
   605
      case strip_combterm_comb tm of
blanchet@42544
   606
        (head as CombConst ((s, _), _, _), args) =>
blanchet@42544
   607
        args |> map aux
blanchet@42557
   608
             |> chop (min_arity_of sym_tab s)
blanchet@42544
   609
             |>> list_app head
blanchet@42544
   610
             |-> list_explicit_app
blanchet@42544
   611
      | (head, args) => list_explicit_app head (map aux args)
blanchet@42544
   612
  in aux end
blanchet@38282
   613
blanchet@42753
   614
fun chop_fun 0 T = ([], T)
blanchet@42753
   615
  | chop_fun n (Type (@{type_name fun}, [dom_T, ran_T])) =
blanchet@42753
   616
    chop_fun (n - 1) ran_T |>> cons dom_T
blanchet@42753
   617
  | chop_fun _ _ = raise Fail "unexpected non-function"
blanchet@42753
   618
blanchet@42780
   619
fun filter_type_args _ _ _ [] = []
blanchet@42780
   620
  | filter_type_args thy s arity T_args =
blanchet@42781
   621
    let val U = s |> Sign.the_const_type thy (* may throw "TYPE" *) in
blanchet@42781
   622
      case Term.add_tvarsT (U |> chop_fun arity |> snd) [] of
blanchet@42781
   623
        [] => []
blanchet@42781
   624
      | res_U_vars =>
blanchet@42781
   625
        let val U_args = (s, U) |> Sign.const_typargs thy in
blanchet@42781
   626
          U_args ~~ T_args
blanchet@42781
   627
          |> map_filter (fn (U, T) =>
blanchet@42781
   628
                            if member (op =) res_U_vars (dest_TVar U) then
blanchet@42781
   629
                              SOME T
blanchet@42781
   630
                            else
blanchet@42781
   631
                              NONE)
blanchet@42781
   632
        end
blanchet@42780
   633
    end
blanchet@42780
   634
    handle TYPE _ => T_args
blanchet@42753
   635
blanchet@42753
   636
fun enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys =
blanchet@42753
   637
  let
blanchet@42753
   638
    val thy = Proof_Context.theory_of ctxt
blanchet@42753
   639
    fun aux arity (CombApp (tm1, tm2)) =
blanchet@42753
   640
        CombApp (aux (arity + 1) tm1, aux 0 tm2)
blanchet@42753
   641
      | aux arity (CombConst (name as (s, _), T, T_args)) =
blanchet@42701
   642
        let
blanchet@42701
   643
          val level = level_of_type_sys type_sys
blanchet@42701
   644
          val (T, T_args) =
blanchet@42701
   645
            (* Aggressively merge most "hAPPs" if the type system is unsound
blanchet@42701
   646
               anyway, by distinguishing overloads only on the homogenized
blanchet@42701
   647
               result type. *)
blanchet@42701
   648
            if s = const_prefix ^ explicit_app_base andalso
blanchet@42726
   649
               length T_args = 2 andalso
blanchet@42701
   650
               not (is_type_sys_virtually_sound type_sys) then
blanchet@42701
   651
              T_args |> map (homogenized_type ctxt nonmono_Ts level)
blanchet@42701
   652
                     |> (fn Ts => let val T = hd Ts --> nth Ts 1 in
blanchet@42753
   653
                                    (T --> T, tl Ts) (* ### FIXME: need tl? *)
blanchet@42701
   654
                                  end)
blanchet@42701
   655
            else
blanchet@42701
   656
              (T, T_args)
blanchet@42701
   657
        in
blanchet@42701
   658
          (case strip_prefix_and_unascii const_prefix s of
blanchet@42701
   659
             NONE => (name, T_args)
blanchet@42701
   660
           | SOME s'' =>
blanchet@42753
   661
             let
blanchet@42753
   662
               val s'' = invert_const s''
blanchet@42753
   663
               fun filtered_T_args true = T_args
blanchet@42753
   664
                 | filtered_T_args false = filter_type_args thy s'' arity T_args
blanchet@42753
   665
             in
blanchet@42701
   666
               case type_arg_policy type_sys s'' of
blanchet@42753
   667
                 Explicit_Type_Args keep_all => (name, filtered_T_args keep_all)
blanchet@42753
   668
               | Mangled_Type_Args keep_all =>
blanchet@42753
   669
                 (mangled_const_name (filtered_T_args keep_all) name, [])
blanchet@42753
   670
               | No_Type_Args => (name, [])
blanchet@42701
   671
             end)
blanchet@42701
   672
          |> (fn (name, T_args) => CombConst (name, T, T_args))
blanchet@42701
   673
        end
blanchet@42753
   674
      | aux _ tm = tm
blanchet@42753
   675
  in aux 0 end
blanchet@42573
   676
blanchet@42701
   677
fun repair_combterm ctxt nonmono_Ts type_sys sym_tab =
blanchet@42565
   678
  introduce_explicit_apps_in_combterm sym_tab
blanchet@42568
   679
  #> introduce_predicators_in_combterm sym_tab
blanchet@42753
   680
  #> enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys
blanchet@42701
   681
fun repair_fact ctxt nonmono_Ts type_sys sym_tab =
blanchet@42701
   682
  update_combformula (formula_map
blanchet@42701
   683
      (repair_combterm ctxt nonmono_Ts type_sys sym_tab))
blanchet@42573
   684
blanchet@42573
   685
(** Helper facts **)
blanchet@42573
   686
blanchet@42573
   687
fun ti_ti_helper_fact () =
blanchet@42573
   688
  let
blanchet@42573
   689
    fun var s = ATerm (`I s, [])
blanchet@42589
   690
    fun tag tm = ATerm (`make_fixed_const type_tag_name, [var "X", tm])
blanchet@42573
   691
  in
blanchet@42612
   692
    Formula (helper_prefix ^ "ti_ti", Axiom,
blanchet@42573
   693
             AAtom (ATerm (`I "equal", [tag (tag (var "Y")), tag (var "Y")]))
blanchet@42573
   694
             |> close_formula_universally, NONE, NONE)
blanchet@42573
   695
  end
blanchet@42573
   696
blanchet@42574
   697
fun helper_facts_for_sym ctxt type_sys (s, {typ, ...} : sym_info) =
blanchet@42573
   698
  case strip_prefix_and_unascii const_prefix s of
blanchet@42573
   699
    SOME mangled_s =>
blanchet@42573
   700
    let
blanchet@42573
   701
      val thy = Proof_Context.theory_of ctxt
blanchet@42573
   702
      val unmangled_s = mangled_s |> unmangled_const_name
blanchet@42579
   703
      fun dub_and_inst c needs_some_types (th, j) =
blanchet@42579
   704
        ((c ^ "_" ^ string_of_int j ^ (if needs_some_types then "T" else ""),
blanchet@42640
   705
          Chained),
blanchet@42573
   706
         let val t = th |> prop_of in
blanchet@42753
   707
           t |> ((case general_type_arg_policy type_sys of
blanchet@42753
   708
                    Mangled_Type_Args _ => true
blanchet@42753
   709
                  | _ => false) andalso
blanchet@42573
   710
                 not (null (Term.hidden_polymorphism t)))
blanchet@42573
   711
                ? (case typ of
blanchet@42573
   712
                     SOME T => specialize_type thy (invert_const unmangled_s, T)
blanchet@42573
   713
                   | NONE => I)
blanchet@42573
   714
         end)
blanchet@42573
   715
      fun make_facts eq_as_iff =
blanchet@42573
   716
        map_filter (make_fact ctxt false eq_as_iff false)
blanchet@42589
   717
      val has_some_types = is_type_sys_fairly_sound type_sys
blanchet@42573
   718
    in
blanchet@42573
   719
      metis_helpers
blanchet@42579
   720
      |> maps (fn (metis_s, (needs_some_types, ths)) =>
blanchet@42573
   721
                  if metis_s <> unmangled_s orelse
blanchet@42589
   722
                     (needs_some_types andalso not has_some_types) then
blanchet@42573
   723
                    []
blanchet@42573
   724
                  else
blanchet@42573
   725
                    ths ~~ (1 upto length ths)
blanchet@42579
   726
                    |> map (dub_and_inst mangled_s needs_some_types)
blanchet@42579
   727
                    |> make_facts (not needs_some_types))
blanchet@42573
   728
    end
blanchet@42573
   729
  | NONE => []
blanchet@42573
   730
fun helper_facts_for_sym_table ctxt type_sys sym_tab =
blanchet@42573
   731
  Symtab.fold_rev (append o helper_facts_for_sym ctxt type_sys) sym_tab []
blanchet@42573
   732
blanchet@42573
   733
fun translate_atp_fact ctxt keep_trivial =
blanchet@42573
   734
  `(make_fact ctxt keep_trivial true true o apsnd prop_of)
blanchet@42573
   735
blanchet@42709
   736
fun translate_formulas ctxt prem_kind type_sys hyp_ts concl_t rich_facts =
blanchet@42573
   737
  let
blanchet@42573
   738
    val thy = Proof_Context.theory_of ctxt
blanchet@42573
   739
    val fact_ts = map (prop_of o snd o snd) rich_facts
blanchet@42573
   740
    val (facts, fact_names) =
blanchet@42573
   741
      rich_facts
blanchet@42573
   742
      |> map_filter (fn (NONE, _) => NONE
blanchet@42573
   743
                      | (SOME fact, (name, _)) => SOME (fact, name))
blanchet@42573
   744
      |> ListPair.unzip
blanchet@42573
   745
    (* Remove existing facts from the conjecture, as this can dramatically
blanchet@42573
   746
       boost an ATP's performance (for some reason). *)
blanchet@42573
   747
    val hyp_ts = hyp_ts |> filter_out (member (op aconv) fact_ts)
blanchet@42573
   748
    val goal_t = Logic.list_implies (hyp_ts, concl_t)
blanchet@42573
   749
    val all_ts = goal_t :: fact_ts
blanchet@42573
   750
    val subs = tfree_classes_of_terms all_ts
blanchet@42573
   751
    val supers = tvar_classes_of_terms all_ts
blanchet@42573
   752
    val tycons = type_consts_of_terms thy all_ts
blanchet@42709
   753
    val conjs = make_conjecture ctxt prem_kind (hyp_ts @ [concl_t])
blanchet@42573
   754
    val (supers', arity_clauses) =
blanchet@42589
   755
      if level_of_type_sys type_sys = No_Types then ([], [])
blanchet@42573
   756
      else make_arity_clauses thy tycons supers
blanchet@42573
   757
    val class_rel_clauses = make_class_rel_clauses thy subs supers'
blanchet@42573
   758
  in
blanchet@42573
   759
    (fact_names |> map single, (conjs, facts, class_rel_clauses, arity_clauses))
blanchet@42573
   760
  end
blanchet@42573
   761
blanchet@42573
   762
fun fo_literal_from_type_literal (TyLitVar (class, name)) =
blanchet@42573
   763
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
   764
  | fo_literal_from_type_literal (TyLitFree (class, name)) =
blanchet@42573
   765
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
   766
blanchet@42573
   767
fun formula_from_fo_literal (pos, t) = AAtom t |> not pos ? mk_anot
blanchet@42573
   768
blanchet@42701
   769
fun type_pred_combatom ctxt nonmono_Ts type_sys T tm =
blanchet@42573
   770
  CombApp (CombConst (`make_fixed_const type_pred_base, T --> @{typ bool}, [T]),
blanchet@42573
   771
           tm)
blanchet@42753
   772
  |> enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys
blanchet@42573
   773
  |> AAtom
blanchet@42573
   774
blanchet@42680
   775
fun formula_from_combformula ctxt nonmono_Ts type_sys =
blanchet@42573
   776
  let
blanchet@42589
   777
    fun tag_with_type type_sys T tm =
blanchet@42589
   778
      CombConst (`make_fixed_const type_tag_name, T --> T, [T])
blanchet@42753
   779
      |> enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys
blanchet@42589
   780
      |> do_term true
blanchet@42589
   781
      |> (fn ATerm (s, tms) => ATerm (s, tms @ [tm]))
blanchet@42589
   782
    and do_term top_level u =
blanchet@42573
   783
      let
blanchet@42573
   784
        val (head, args) = strip_combterm_comb u
blanchet@42574
   785
        val (x, T_args) =
blanchet@42573
   786
          case head of
blanchet@42574
   787
            CombConst (name, _, T_args) => (name, T_args)
blanchet@42573
   788
          | CombVar (name, _) => (name, [])
blanchet@42573
   789
          | CombApp _ => raise Fail "impossible \"CombApp\""
blanchet@42574
   790
        val t = ATerm (x, map fo_term_from_typ T_args @
blanchet@42573
   791
                          map (do_term false) args)
blanchet@42574
   792
        val T = combtyp_of u
blanchet@42573
   793
      in
blanchet@42680
   794
        t |> (if not top_level andalso
blanchet@42680
   795
                should_tag_with_type ctxt nonmono_Ts type_sys T then
blanchet@42589
   796
                tag_with_type type_sys T
blanchet@42573
   797
              else
blanchet@42573
   798
                I)
blanchet@42573
   799
      end
blanchet@42573
   800
    val do_bound_type =
blanchet@42682
   801
      case type_sys of
blanchet@42722
   802
        Simple_Types level =>
blanchet@42682
   803
        SOME o mangled_type_name o homogenized_type ctxt nonmono_Ts level
blanchet@42682
   804
      | _ => K NONE
blanchet@42573
   805
    fun do_out_of_bound_type (s, T) =
blanchet@42680
   806
      if should_predicate_on_type ctxt nonmono_Ts type_sys T then
blanchet@42701
   807
        type_pred_combatom ctxt nonmono_Ts type_sys T (CombVar (s, T))
blanchet@42573
   808
        |> do_formula |> SOME
blanchet@42573
   809
      else
blanchet@42573
   810
        NONE
blanchet@42573
   811
    and do_formula (AQuant (q, xs, phi)) =
blanchet@42573
   812
        AQuant (q, xs |> map (apsnd (fn NONE => NONE
blanchet@42574
   813
                                      | SOME T => do_bound_type T)),
blanchet@42573
   814
                (if q = AForall then mk_ahorn else fold_rev (mk_aconn AAnd))
blanchet@42573
   815
                    (map_filter
blanchet@42573
   816
                         (fn (_, NONE) => NONE
blanchet@42574
   817
                           | (s, SOME T) => do_out_of_bound_type (s, T)) xs)
blanchet@42573
   818
                    (do_formula phi))
blanchet@42573
   819
      | do_formula (AConn (c, phis)) = AConn (c, map do_formula phis)
blanchet@42573
   820
      | do_formula (AAtom tm) = AAtom (do_term true tm)
blanchet@42573
   821
  in do_formula end
blanchet@42573
   822
blanchet@42727
   823
fun bound_atomic_types type_sys Ts =
blanchet@42727
   824
  mk_ahorn (map (formula_from_fo_literal o fo_literal_from_type_literal)
blanchet@42727
   825
                (atp_type_literals_for_types type_sys Axiom Ts))
blanchet@42727
   826
blanchet@42680
   827
fun formula_for_fact ctxt nonmono_Ts type_sys
blanchet@42573
   828
                     ({combformula, atomic_types, ...} : translated_formula) =
blanchet@42727
   829
  combformula
blanchet@42727
   830
  |> close_combformula_universally
blanchet@42727
   831
  |> formula_from_combformula ctxt nonmono_Ts type_sys
blanchet@42727
   832
  |> bound_atomic_types type_sys atomic_types
blanchet@42573
   833
  |> close_formula_universally
blanchet@42573
   834
blanchet@42640
   835
fun useful_isabelle_info s = SOME (ATerm ("[]", [ATerm ("isabelle_" ^ s, [])]))
blanchet@42640
   836
blanchet@42573
   837
(* Each fact is given a unique fact number to avoid name clashes (e.g., because
blanchet@42573
   838
   of monomorphization). The TPTP explicitly forbids name clashes, and some of
blanchet@42573
   839
   the remote provers might care. *)
blanchet@42680
   840
fun formula_line_for_fact ctxt prefix nonmono_Ts type_sys
blanchet@42640
   841
                          (j, formula as {name, locality, kind, ...}) =
blanchet@42680
   842
  Formula (prefix ^ (if polymorphism_of_type_sys type_sys = Polymorphic then ""
blanchet@42680
   843
                     else string_of_int j ^ "_") ^
blanchet@42647
   844
           ascii_of name,
blanchet@42680
   845
           kind, formula_for_fact ctxt nonmono_Ts type_sys formula, NONE,
blanchet@42640
   846
           if generate_useful_info then
blanchet@42640
   847
             case locality of
blanchet@42640
   848
               Intro => useful_isabelle_info "intro"
blanchet@42640
   849
             | Elim => useful_isabelle_info "elim"
blanchet@42640
   850
             | Simp => useful_isabelle_info "simp"
blanchet@42640
   851
             | _ => NONE
blanchet@42640
   852
           else
blanchet@42640
   853
             NONE)
blanchet@42573
   854
blanchet@42573
   855
fun formula_line_for_class_rel_clause (ClassRelClause {name, subclass,
blanchet@42573
   856
                                                       superclass, ...}) =
blanchet@42573
   857
  let val ty_arg = ATerm (`I "T", []) in
blanchet@42577
   858
    Formula (class_rel_clause_prefix ^ ascii_of name, Axiom,
blanchet@42573
   859
             AConn (AImplies, [AAtom (ATerm (subclass, [ty_arg])),
blanchet@42573
   860
                               AAtom (ATerm (superclass, [ty_arg]))])
blanchet@42573
   861
             |> close_formula_universally, NONE, NONE)
blanchet@42573
   862
  end
blanchet@42573
   863
blanchet@42573
   864
fun fo_literal_from_arity_literal (TConsLit (c, t, args)) =
blanchet@42573
   865
    (true, ATerm (c, [ATerm (t, map (fn arg => ATerm (arg, [])) args)]))
blanchet@42573
   866
  | fo_literal_from_arity_literal (TVarLit (c, sort)) =
blanchet@42573
   867
    (false, ATerm (c, [ATerm (sort, [])]))
blanchet@42573
   868
blanchet@42573
   869
fun formula_line_for_arity_clause (ArityClause {name, conclLit, premLits,
blanchet@42573
   870
                                                ...}) =
blanchet@42577
   871
  Formula (arity_clause_prefix ^ ascii_of name, Axiom,
blanchet@42573
   872
           mk_ahorn (map (formula_from_fo_literal o apfst not
blanchet@42573
   873
                          o fo_literal_from_arity_literal) premLits)
blanchet@42573
   874
                    (formula_from_fo_literal
blanchet@42573
   875
                         (fo_literal_from_arity_literal conclLit))
blanchet@42573
   876
           |> close_formula_universally, NONE, NONE)
blanchet@42573
   877
blanchet@42680
   878
fun formula_line_for_conjecture ctxt nonmono_Ts type_sys
blanchet@42573
   879
        ({name, kind, combformula, ...} : translated_formula) =
blanchet@42577
   880
  Formula (conjecture_prefix ^ name, kind,
blanchet@42680
   881
           formula_from_combformula ctxt nonmono_Ts type_sys
blanchet@42573
   882
                                    (close_combformula_universally combformula)
blanchet@42573
   883
           |> close_formula_universally, NONE, NONE)
blanchet@42573
   884
blanchet@42573
   885
fun free_type_literals type_sys ({atomic_types, ...} : translated_formula) =
blanchet@42573
   886
  atomic_types |> atp_type_literals_for_types type_sys Conjecture
blanchet@42573
   887
               |> map fo_literal_from_type_literal
blanchet@42573
   888
blanchet@42573
   889
fun formula_line_for_free_type j lit =
blanchet@42577
   890
  Formula (tfree_prefix ^ string_of_int j, Hypothesis,
blanchet@42573
   891
           formula_from_fo_literal lit, NONE, NONE)
blanchet@42573
   892
fun formula_lines_for_free_types type_sys facts =
blanchet@42573
   893
  let
blanchet@42573
   894
    val litss = map (free_type_literals type_sys) facts
blanchet@42573
   895
    val lits = fold (union (op =)) litss []
blanchet@42573
   896
  in map2 formula_line_for_free_type (0 upto length lits - 1) lits end
blanchet@42573
   897
blanchet@42573
   898
(** Symbol declarations **)
blanchet@42544
   899
blanchet@42677
   900
fun insert_type get_T x xs =
blanchet@42677
   901
  let val T = get_T x in
blanchet@42677
   902
    if exists (curry Type.raw_instance T o get_T) xs then xs
blanchet@42677
   903
    else x :: filter_out ((fn T' => Type.raw_instance (T', T)) o get_T) xs
blanchet@42677
   904
  end
blanchet@42677
   905
blanchet@42574
   906
fun should_declare_sym type_sys pred_sym s =
blanchet@42542
   907
  not (String.isPrefix bound_var_prefix s) andalso s <> "equal" andalso
blanchet@42753
   908
  not (String.isPrefix tptp_special_prefix s) andalso
blanchet@42722
   909
  ((case type_sys of Simple_Types _ => true | _ => false) orelse not pred_sym)
blanchet@38282
   910
blanchet@42698
   911
fun sym_decl_table_for_facts type_sys repaired_sym_tab (conjs, facts) =
blanchet@42574
   912
  let
blanchet@42698
   913
    fun add_combterm in_conj tm =
blanchet@42574
   914
      let val (head, args) = strip_combterm_comb tm in
blanchet@42574
   915
        (case head of
blanchet@42574
   916
           CombConst ((s, s'), T, T_args) =>
blanchet@42574
   917
           let val pred_sym = is_pred_sym repaired_sym_tab s in
blanchet@42574
   918
             if should_declare_sym type_sys pred_sym s then
blanchet@42576
   919
               Symtab.map_default (s, [])
blanchet@42698
   920
                   (insert_type #3 (s', T_args, T, pred_sym, length args,
blanchet@42698
   921
                                    in_conj))
blanchet@42574
   922
             else
blanchet@42574
   923
               I
blanchet@42574
   924
           end
blanchet@42574
   925
         | _ => I)
blanchet@42698
   926
        #> fold (add_combterm in_conj) args
blanchet@42574
   927
      end
blanchet@42698
   928
    fun add_fact in_conj =
blanchet@42698
   929
      fact_lift (formula_fold true (K (add_combterm in_conj)))
blanchet@42698
   930
  in
blanchet@42698
   931
    Symtab.empty
blanchet@42698
   932
    |> is_type_sys_fairly_sound type_sys
blanchet@42698
   933
       ? (fold (add_fact true) conjs #> fold (add_fact false) facts)
blanchet@42698
   934
  end
blanchet@42533
   935
blanchet@42677
   936
fun is_var_or_bound_var (CombConst ((s, _), _, _)) =
blanchet@42677
   937
    String.isPrefix bound_var_prefix s
blanchet@42677
   938
  | is_var_or_bound_var (CombVar _) = true
blanchet@42677
   939
  | is_var_or_bound_var _ = false
blanchet@42677
   940
blanchet@42685
   941
(* This inference is described in section 2.3 of Claessen et al.'s "Sorting it
blanchet@42685
   942
   out with monotonicity" paper presented at CADE 2011. *)
blanchet@42680
   943
fun add_combterm_nonmonotonic_types _ (SOME false) _ = I
blanchet@42680
   944
  | add_combterm_nonmonotonic_types ctxt _
blanchet@42680
   945
        (CombApp (CombApp (CombConst (("equal", _), Type (_, [T, _]), _), tm1),
blanchet@42680
   946
                  tm2)) =
blanchet@42680
   947
    (exists is_var_or_bound_var [tm1, tm2] andalso
blanchet@42680
   948
     not (is_type_surely_infinite ctxt T)) ? insert_type I T
blanchet@42680
   949
  | add_combterm_nonmonotonic_types _ _ _ = I
blanchet@42680
   950
fun add_fact_nonmonotonic_types ctxt ({kind, combformula, ...}
blanchet@42680
   951
                                      : translated_formula) =
blanchet@42680
   952
  formula_fold (kind <> Conjecture) (add_combterm_nonmonotonic_types ctxt)
blanchet@42680
   953
               combformula
blanchet@42680
   954
fun add_nonmonotonic_types_for_facts ctxt type_sys facts =
blanchet@42680
   955
  level_of_type_sys type_sys = Nonmonotonic_Types
blanchet@42731
   956
  ? (fold (add_fact_nonmonotonic_types ctxt) facts
blanchet@42731
   957
     (* in case helper "True_or_False" is included *)
blanchet@42731
   958
     #> insert_type I @{typ bool})
blanchet@42677
   959
blanchet@42753
   960
fun result_type_of_decl (_, _, T, _, ary, _) = chop_fun ary T |> snd
blanchet@42579
   961
blanchet@42754
   962
fun decl_line_for_sym ctxt nonmono_Ts level s (s', _, T, pred_sym, ary, _) =
blanchet@42754
   963
  let
blanchet@42754
   964
    val translate_type =
blanchet@42754
   965
      mangled_type_name o homogenized_type ctxt nonmono_Ts level
blanchet@42754
   966
    val (arg_tys, res_ty) =
blanchet@42754
   967
      T |> chop_fun ary |>> map translate_type ||> translate_type
blanchet@42754
   968
  in
blanchet@42754
   969
    Decl (sym_decl_prefix ^ s, (s, s'), arg_tys,
blanchet@42754
   970
          if pred_sym then `I tptp_tff_bool_type else res_ty)
blanchet@42579
   971
  end
blanchet@42579
   972
blanchet@42592
   973
fun is_polymorphic_type T = fold_atyps (fn TVar _ => K true | _ => I) T false
blanchet@42592
   974
blanchet@42709
   975
fun formula_line_for_sym_decl ctxt conj_sym_kind nonmono_Ts type_sys n s j
blanchet@42698
   976
                              (s', T_args, T, _, ary, in_conj) =
blanchet@42579
   977
  let
blanchet@42709
   978
    val (kind, maybe_negate) =
blanchet@42709
   979
      if in_conj then (conj_sym_kind, conj_sym_kind = Conjecture ? mk_anot)
blanchet@42709
   980
      else (Axiom, I)
blanchet@42753
   981
    val (arg_Ts, res_T) = chop_fun ary T
blanchet@42579
   982
    val bound_names =
blanchet@42579
   983
      1 upto length arg_Ts |> map (`I o make_bound_var o string_of_int)
blanchet@42579
   984
    val bound_tms =
blanchet@42579
   985
      bound_names ~~ arg_Ts |> map (fn (name, T) => CombConst (name, T, []))
blanchet@42579
   986
    val bound_Ts =
blanchet@42592
   987
      arg_Ts |> map (fn T => if n > 1 orelse is_polymorphic_type T then SOME T
blanchet@42592
   988
                             else NONE)
blanchet@42579
   989
  in
blanchet@42612
   990
    Formula (sym_decl_prefix ^ s ^
blanchet@42709
   991
             (if n > 1 then "_" ^ string_of_int j else ""), kind,
blanchet@42579
   992
             CombConst ((s, s'), T, T_args)
blanchet@42579
   993
             |> fold (curry (CombApp o swap)) bound_tms
blanchet@42701
   994
             |> type_pred_combatom ctxt nonmono_Ts type_sys res_T
blanchet@42579
   995
             |> mk_aquant AForall (bound_names ~~ bound_Ts)
blanchet@42680
   996
             |> formula_from_combformula ctxt nonmono_Ts type_sys
blanchet@42727
   997
             |> n > 1 ? bound_atomic_types type_sys (atyps_of T)
blanchet@42709
   998
             |> close_formula_universally
blanchet@42709
   999
             |> maybe_negate,
blanchet@42579
  1000
             NONE, NONE)
blanchet@42579
  1001
  end
blanchet@42579
  1002
blanchet@42709
  1003
fun problem_lines_for_sym_decls ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42709
  1004
                                (s, decls) =
blanchet@42682
  1005
  case type_sys of
blanchet@42754
  1006
    Simple_Types level => map (decl_line_for_sym ctxt nonmono_Ts level s) decls
blanchet@42682
  1007
  | _ =>
blanchet@42574
  1008
    let
blanchet@42579
  1009
      val decls =
blanchet@42579
  1010
        case decls of
blanchet@42579
  1011
          decl :: (decls' as _ :: _) =>
blanchet@42592
  1012
          let val T = result_type_of_decl decl in
blanchet@42592
  1013
            if forall ((fn T' => Type.raw_instance (T', T))
blanchet@42592
  1014
                       o result_type_of_decl) decls' then
blanchet@42592
  1015
              [decl]
blanchet@42592
  1016
            else
blanchet@42592
  1017
              decls
blanchet@42592
  1018
          end
blanchet@42579
  1019
        | _ => decls
blanchet@42579
  1020
      val n = length decls
blanchet@42579
  1021
      val decls =
blanchet@42680
  1022
        decls |> filter (should_predicate_on_type ctxt nonmono_Ts type_sys
blanchet@42579
  1023
                         o result_type_of_decl)
blanchet@42574
  1024
    in
blanchet@42709
  1025
      (0 upto length decls - 1, decls)
blanchet@42709
  1026
      |-> map2 (formula_line_for_sym_decl ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42709
  1027
                                          n s)
blanchet@42574
  1028
    end
blanchet@42579
  1029
blanchet@42709
  1030
fun problem_lines_for_sym_decl_table ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42709
  1031
                                     sym_decl_tab =
blanchet@42709
  1032
  Symtab.fold_rev (append o problem_lines_for_sym_decls ctxt conj_sym_kind
blanchet@42709
  1033
                                                        nonmono_Ts type_sys)
blanchet@42574
  1034
                  sym_decl_tab []
blanchet@42543
  1035
blanchet@42543
  1036
fun add_tff_types_in_formula (AQuant (_, xs, phi)) =
blanchet@42543
  1037
    union (op =) (map_filter snd xs) #> add_tff_types_in_formula phi
blanchet@42543
  1038
  | add_tff_types_in_formula (AConn (_, phis)) =
blanchet@42543
  1039
    fold add_tff_types_in_formula phis
blanchet@42543
  1040
  | add_tff_types_in_formula (AAtom _) = I
blanchet@42539
  1041
blanchet@42562
  1042
fun add_tff_types_in_problem_line (Decl (_, _, arg_Ts, res_T)) =
blanchet@42562
  1043
    union (op =) (res_T :: arg_Ts)
blanchet@42577
  1044
  | add_tff_types_in_problem_line (Formula (_, _, phi, _, _)) =
blanchet@42543
  1045
    add_tff_types_in_formula phi
blanchet@42543
  1046
blanchet@42543
  1047
fun tff_types_in_problem problem =
blanchet@42543
  1048
  fold (fold add_tff_types_in_problem_line o snd) problem []
blanchet@42543
  1049
blanchet@42545
  1050
fun decl_line_for_tff_type (s, s') =
blanchet@42568
  1051
  Decl (type_decl_prefix ^ ascii_of s, (s, s'), [], `I tptp_tff_type_of_types)
blanchet@42543
  1052
blanchet@42543
  1053
val type_declsN = "Types"
blanchet@42544
  1054
val sym_declsN = "Symbol types"
blanchet@41157
  1055
val factsN = "Relevant facts"
blanchet@41157
  1056
val class_relsN = "Class relationships"
blanchet@42543
  1057
val aritiesN = "Arities"
blanchet@41157
  1058
val helpersN = "Helper facts"
blanchet@41157
  1059
val conjsN = "Conjectures"
blanchet@41313
  1060
val free_typesN = "Type variables"
blanchet@41157
  1061
blanchet@41157
  1062
fun offset_of_heading_in_problem _ [] j = j
blanchet@41157
  1063
  | offset_of_heading_in_problem needle ((heading, lines) :: problem) j =
blanchet@41157
  1064
    if heading = needle then j
blanchet@41157
  1065
    else offset_of_heading_in_problem needle problem (j + length lines)
blanchet@41157
  1066
blanchet@42709
  1067
fun prepare_atp_problem ctxt conj_sym_kind prem_kind type_sys explicit_apply
blanchet@42709
  1068
                        hyp_ts concl_t facts =
blanchet@38282
  1069
  let
blanchet@41313
  1070
    val (fact_names, (conjs, facts, class_rel_clauses, arity_clauses)) =
blanchet@42709
  1071
      translate_formulas ctxt prem_kind type_sys hyp_ts concl_t facts
blanchet@42563
  1072
    val sym_tab = conjs @ facts |> sym_table_for_facts explicit_apply
blanchet@42682
  1073
    val nonmono_Ts =
blanchet@42682
  1074
      [] |> fold (add_nonmonotonic_types_for_facts ctxt type_sys) [facts, conjs]
blanchet@42701
  1075
    val repair = repair_fact ctxt nonmono_Ts type_sys sym_tab
blanchet@42682
  1076
    val (conjs, facts) = (conjs, facts) |> pairself (map repair)
blanchet@42680
  1077
    val repaired_sym_tab = conjs @ facts |> sym_table_for_facts false
blanchet@42573
  1078
    val helpers =
blanchet@42682
  1079
      repaired_sym_tab |> helper_facts_for_sym_table ctxt type_sys |> map repair
blanchet@42680
  1080
    val sym_decl_lines =
blanchet@42731
  1081
      (conjs, helpers @ facts)
blanchet@42680
  1082
      |> sym_decl_table_for_facts type_sys repaired_sym_tab
blanchet@42709
  1083
      |> problem_lines_for_sym_decl_table ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42522
  1084
    (* Reordering these might confuse the proof reconstruction code or the SPASS
blanchet@42522
  1085
       Flotter hack. *)
blanchet@38282
  1086
    val problem =
blanchet@42561
  1087
      [(sym_declsN, sym_decl_lines),
blanchet@42680
  1088
       (factsN, map (formula_line_for_fact ctxt fact_prefix nonmono_Ts type_sys)
blanchet@42180
  1089
                    (0 upto length facts - 1 ~~ facts)),
blanchet@42545
  1090
       (class_relsN, map formula_line_for_class_rel_clause class_rel_clauses),
blanchet@42545
  1091
       (aritiesN, map formula_line_for_arity_clause arity_clauses),
blanchet@42680
  1092
       (helpersN, map (formula_line_for_fact ctxt helper_prefix nonmono_Ts
blanchet@42680
  1093
                                             type_sys)
blanchet@42563
  1094
                      (0 upto length helpers - 1 ~~ helpers)
blanchet@42579
  1095
                  |> (case type_sys of
blanchet@42828
  1096
                        Tags (Polymorphic, level, _) =>
blanchet@42687
  1097
                        is_type_level_partial level
blanchet@42589
  1098
                        ? cons (ti_ti_helper_fact ())
blanchet@42579
  1099
                      | _ => I)),
blanchet@42680
  1100
       (conjsN, map (formula_line_for_conjecture ctxt nonmono_Ts type_sys)
blanchet@42680
  1101
                    conjs),
blanchet@42545
  1102
       (free_typesN, formula_lines_for_free_types type_sys (facts @ conjs))]
blanchet@42543
  1103
    val problem =
blanchet@42561
  1104
      problem
blanchet@42682
  1105
      |> (case type_sys of
blanchet@42722
  1106
            Simple_Types _ =>
blanchet@42561
  1107
            cons (type_declsN,
blanchet@42561
  1108
                  map decl_line_for_tff_type (tff_types_in_problem problem))
blanchet@42682
  1109
          | _ => I)
blanchet@42646
  1110
    val (problem, pool) =
blanchet@42646
  1111
      problem |> nice_atp_problem (Config.get ctxt readable_names)
blanchet@42778
  1112
    fun add_sym_arity (s, {min_ary, ...} : sym_info) =
blanchet@42755
  1113
      if min_ary > 0 then
blanchet@42755
  1114
        case strip_prefix_and_unascii const_prefix s of
blanchet@42755
  1115
          SOME s => Symtab.insert (op =) (s, min_ary)
blanchet@42755
  1116
        | NONE => I
blanchet@42755
  1117
      else
blanchet@42755
  1118
        I
blanchet@38282
  1119
  in
blanchet@38282
  1120
    (problem,
blanchet@38282
  1121
     case pool of SOME the_pool => snd the_pool | NONE => Symtab.empty,
blanchet@42585
  1122
     offset_of_heading_in_problem conjsN problem 0,
blanchet@42541
  1123
     offset_of_heading_in_problem factsN problem 0,
blanchet@42755
  1124
     fact_names |> Vector.fromList,
blanchet@42755
  1125
     Symtab.empty |> Symtab.fold add_sym_arity sym_tab)
blanchet@38282
  1126
  end
blanchet@38282
  1127
blanchet@41313
  1128
(* FUDGE *)
blanchet@41313
  1129
val conj_weight = 0.0
blanchet@41770
  1130
val hyp_weight = 0.1
blanchet@41770
  1131
val fact_min_weight = 0.2
blanchet@41313
  1132
val fact_max_weight = 1.0
blanchet@42608
  1133
val type_info_default_weight = 0.8
blanchet@41313
  1134
blanchet@41313
  1135
fun add_term_weights weight (ATerm (s, tms)) =
blanchet@42734
  1136
  (not (is_atp_variable s) andalso s <> "equal" andalso
blanchet@42753
  1137
   not (String.isPrefix tptp_special_prefix s)) ? Symtab.default (s, weight)
blanchet@41313
  1138
  #> fold (add_term_weights weight) tms
blanchet@42577
  1139
fun add_problem_line_weights weight (Formula (_, _, phi, _, _)) =
blanchet@42680
  1140
    formula_fold true (K (add_term_weights weight)) phi
blanchet@42528
  1141
  | add_problem_line_weights _ _ = I
blanchet@41313
  1142
blanchet@41313
  1143
fun add_conjectures_weights [] = I
blanchet@41313
  1144
  | add_conjectures_weights conjs =
blanchet@41313
  1145
    let val (hyps, conj) = split_last conjs in
blanchet@41313
  1146
      add_problem_line_weights conj_weight conj
blanchet@41313
  1147
      #> fold (add_problem_line_weights hyp_weight) hyps
blanchet@41313
  1148
    end
blanchet@41313
  1149
blanchet@41313
  1150
fun add_facts_weights facts =
blanchet@41313
  1151
  let
blanchet@41313
  1152
    val num_facts = length facts
blanchet@41313
  1153
    fun weight_of j =
blanchet@41313
  1154
      fact_min_weight + (fact_max_weight - fact_min_weight) * Real.fromInt j
blanchet@41313
  1155
                        / Real.fromInt num_facts
blanchet@41313
  1156
  in
blanchet@41313
  1157
    map weight_of (0 upto num_facts - 1) ~~ facts
blanchet@41313
  1158
    |> fold (uncurry add_problem_line_weights)
blanchet@41313
  1159
  end
blanchet@41313
  1160
blanchet@41313
  1161
(* Weights are from 0.0 (most important) to 1.0 (least important). *)
blanchet@41313
  1162
fun atp_problem_weights problem =
blanchet@42608
  1163
  let val get = these o AList.lookup (op =) problem in
blanchet@42608
  1164
    Symtab.empty
blanchet@42608
  1165
    |> add_conjectures_weights (get free_typesN @ get conjsN)
blanchet@42608
  1166
    |> add_facts_weights (get factsN)
blanchet@42608
  1167
    |> fold (fold (add_problem_line_weights type_info_default_weight) o get)
blanchet@42608
  1168
            [sym_declsN, class_relsN, aritiesN]
blanchet@42608
  1169
    |> Symtab.dest
blanchet@42608
  1170
    |> sort (prod_ord Real.compare string_ord o pairself swap)
blanchet@42608
  1171
  end
blanchet@41313
  1172
blanchet@38282
  1173
end;