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