src/HOL/Tools/Sledgehammer/sledgehammer_atp_translate.ML
author blanchet
Fri May 20 12:47:58 2011 +0200 (2011-05-20)
changeset 42879 3b9669b11d33
parent 42878 85ac4c12a4b7
child 42881 dbdfe2d5b6ab
permissions -rw-r--r--
generate useful information for type axioms
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@42837
    19
  datatype type_heaviness = Heavy | Light
blanchet@42613
    20
blanchet@42613
    21
  datatype type_system =
blanchet@42722
    22
    Simple_Types of type_level |
blanchet@42837
    23
    Preds of polymorphism * type_level * type_heaviness |
blanchet@42837
    24
    Tags of polymorphism * type_level * type_heaviness
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@42879
    64
fun useful_isabelle_info s =
blanchet@42879
    65
  if generate_useful_info then
blanchet@42879
    66
    SOME (ATerm ("[]", [ATerm ("isabelle_" ^ s, [])]))
blanchet@42879
    67
  else
blanchet@42879
    68
    NONE
blanchet@42879
    69
blanchet@42879
    70
val intro_info = useful_isabelle_info "intro"
blanchet@42879
    71
val elim_info = useful_isabelle_info "elim"
blanchet@42879
    72
val simp_info = useful_isabelle_info "simp"
blanchet@42879
    73
blanchet@42568
    74
(* Readable names are often much shorter, especially if types are mangled in
blanchet@42589
    75
   names. Also, the logic for generating legal SNARK sort names is only
blanchet@42589
    76
   implemented for readable names. Finally, readable names are, well, more
blanchet@42589
    77
   readable. For these reason, they are enabled by default. *)
blanchet@42646
    78
val readable_names =
blanchet@42646
    79
  Attrib.setup_config_bool @{binding sledgehammer_atp_readable_names} (K true)
blanchet@42568
    80
blanchet@42543
    81
val type_decl_prefix = "type_"
blanchet@42543
    82
val sym_decl_prefix = "sym_"
blanchet@40204
    83
val fact_prefix = "fact_"
blanchet@38282
    84
val conjecture_prefix = "conj_"
blanchet@38282
    85
val helper_prefix = "help_"
blanchet@42543
    86
val class_rel_clause_prefix = "crel_";
blanchet@38282
    87
val arity_clause_prefix = "arity_"
blanchet@39975
    88
val tfree_prefix = "tfree_"
blanchet@38282
    89
blanchet@42568
    90
val predicator_base = "hBOOL"
blanchet@42544
    91
val explicit_app_base = "hAPP"
blanchet@42542
    92
val type_pred_base = "is"
blanchet@42562
    93
val tff_type_prefix = "ty_"
blanchet@42531
    94
blanchet@42562
    95
fun make_tff_type s = tff_type_prefix ^ ascii_of s
blanchet@42531
    96
blanchet@38282
    97
(* Freshness almost guaranteed! *)
blanchet@38282
    98
val sledgehammer_weak_prefix = "Sledgehammer:"
blanchet@38282
    99
blanchet@42613
   100
datatype polymorphism = Polymorphic | Monomorphic | Mangled_Monomorphic
blanchet@42613
   101
datatype type_level =
blanchet@42613
   102
  All_Types | Nonmonotonic_Types | Finite_Types | Const_Arg_Types | No_Types
blanchet@42837
   103
datatype type_heaviness = Heavy | Light
blanchet@42613
   104
blanchet@42613
   105
datatype type_system =
blanchet@42722
   106
  Simple_Types of type_level |
blanchet@42837
   107
  Preds of polymorphism * type_level * type_heaviness |
blanchet@42837
   108
  Tags of polymorphism * type_level * type_heaviness
blanchet@42613
   109
blanchet@42689
   110
fun try_unsuffixes ss s =
blanchet@42689
   111
  fold (fn s' => fn NONE => try (unsuffix s') s | some => some) ss NONE
blanchet@42689
   112
blanchet@42613
   113
fun type_sys_from_string s =
blanchet@42722
   114
  (case try (unprefix "poly_") s of
blanchet@42722
   115
     SOME s => (SOME Polymorphic, s)
blanchet@42613
   116
   | NONE =>
blanchet@42613
   117
     case try (unprefix "mono_") s of
blanchet@42722
   118
       SOME s => (SOME Monomorphic, s)
blanchet@42722
   119
     | NONE =>
blanchet@42722
   120
       case try (unprefix "mangled_") s of
blanchet@42722
   121
         SOME s => (SOME Mangled_Monomorphic, s)
blanchet@42722
   122
       | NONE => (NONE, s))
blanchet@42613
   123
  ||> (fn s =>
blanchet@42689
   124
          (* "_query" and "_bang" are for the ASCII-challenged Mirabelle. *)
blanchet@42689
   125
          case try_unsuffixes ["?", "_query"] s of
blanchet@42613
   126
            SOME s => (Nonmonotonic_Types, s)
blanchet@42613
   127
          | NONE =>
blanchet@42689
   128
            case try_unsuffixes ["!", "_bang"] s of
blanchet@42613
   129
              SOME s => (Finite_Types, s)
blanchet@42613
   130
            | NONE => (All_Types, s))
blanchet@42828
   131
  ||> apsnd (fn s =>
blanchet@42837
   132
                case try (unsuffix "_heavy") s of
blanchet@42854
   133
                  SOME s => (Heavy, s)
blanchet@42854
   134
                | NONE => (Light, s))
blanchet@42837
   135
  |> (fn (poly, (level, (heaviness, core))) =>
blanchet@42837
   136
         case (core, (poly, level, heaviness)) of
blanchet@42855
   137
           ("simple", (NONE, _, Light)) => Simple_Types level
blanchet@42851
   138
         | ("preds", (SOME Polymorphic, _, _)) =>
blanchet@42854
   139
           if level = All_Types then Preds (Polymorphic, level, heaviness)
blanchet@42854
   140
           else raise Same.SAME
blanchet@42854
   141
         | ("preds", (SOME poly, _, _)) => Preds (poly, level, heaviness)
blanchet@42851
   142
         | ("tags", (SOME Polymorphic, All_Types, _)) =>
blanchet@42854
   143
           Tags (Polymorphic, All_Types, heaviness)
blanchet@42851
   144
         | ("tags", (SOME Polymorphic, Finite_Types, _)) =>
blanchet@42854
   145
           (* The light encoding yields too many unsound proofs. *)
blanchet@42854
   146
           Tags (Polymorphic, Finite_Types, Heavy)
blanchet@42851
   147
         | ("tags", (SOME Polymorphic, _, _)) => raise Same.SAME
blanchet@42854
   148
         | ("tags", (SOME poly, _, _)) => Tags (poly, level, heaviness)
blanchet@42854
   149
         | ("args", (SOME poly, All_Types (* naja *), Light)) =>
blanchet@42837
   150
           Preds (poly, Const_Arg_Types, Light)
blanchet@42854
   151
         | ("erased", (NONE, All_Types (* naja *), Light)) =>
blanchet@42837
   152
           Preds (Polymorphic, No_Types, Light)
blanchet@42753
   153
         | _ => raise Same.SAME)
blanchet@42753
   154
  handle Same.SAME => error ("Unknown type system: " ^ quote s ^ ".")
blanchet@42613
   155
blanchet@42722
   156
fun polymorphism_of_type_sys (Simple_Types _) = Mangled_Monomorphic
blanchet@42828
   157
  | polymorphism_of_type_sys (Preds (poly, _, _)) = poly
blanchet@42828
   158
  | polymorphism_of_type_sys (Tags (poly, _, _)) = poly
blanchet@42613
   159
blanchet@42722
   160
fun level_of_type_sys (Simple_Types level) = level
blanchet@42828
   161
  | level_of_type_sys (Preds (_, level, _)) = level
blanchet@42828
   162
  | level_of_type_sys (Tags (_, level, _)) = level
blanchet@42828
   163
blanchet@42837
   164
fun heaviness_of_type_sys (Simple_Types _) = Heavy
blanchet@42837
   165
  | heaviness_of_type_sys (Preds (_, _, heaviness)) = heaviness
blanchet@42837
   166
  | heaviness_of_type_sys (Tags (_, _, heaviness)) = heaviness
blanchet@42831
   167
blanchet@42687
   168
fun is_type_level_virtually_sound level =
blanchet@42687
   169
  level = All_Types orelse level = Nonmonotonic_Types
blanchet@42613
   170
val is_type_sys_virtually_sound =
blanchet@42613
   171
  is_type_level_virtually_sound o level_of_type_sys
blanchet@42613
   172
blanchet@42613
   173
fun is_type_level_fairly_sound level =
blanchet@42613
   174
  is_type_level_virtually_sound level orelse level = Finite_Types
blanchet@42613
   175
val is_type_sys_fairly_sound = is_type_level_fairly_sound o level_of_type_sys
blanchet@42613
   176
blanchet@42573
   177
fun formula_map f (AQuant (q, xs, phi)) = AQuant (q, xs, formula_map f phi)
blanchet@42573
   178
  | formula_map f (AConn (c, phis)) = AConn (c, map (formula_map f) phis)
blanchet@42573
   179
  | formula_map f (AAtom tm) = AAtom (f tm)
blanchet@42573
   180
blanchet@42878
   181
fun aconn_fold pos f (ANot, [phi]) = f (Option.map not pos) phi
blanchet@42878
   182
  | aconn_fold pos f (AImplies, [phi1, phi2]) =
blanchet@42878
   183
    f (Option.map not pos) phi1 #> f pos phi2
blanchet@42878
   184
  | aconn_fold pos f (AAnd, phis) = fold (f pos) phis
blanchet@42878
   185
  | aconn_fold pos f (AOr, phis) = fold (f pos) phis
blanchet@42878
   186
  | aconn_fold _ f (_, phis) = fold (f NONE) phis
blanchet@42878
   187
blanchet@42878
   188
fun aconn_map pos f (ANot, [phi]) = AConn (ANot, [f (Option.map not pos) phi])
blanchet@42878
   189
  | aconn_map pos f (AImplies, [phi1, phi2]) =
blanchet@42878
   190
    AConn (AImplies, [f (Option.map not pos) phi1, f pos phi2])
blanchet@42878
   191
  | aconn_map pos f (AAnd, phis) = AConn (AAnd, map (f pos) phis)
blanchet@42878
   192
  | aconn_map pos f (AOr, phis) = AConn (AOr, map (f pos) phis)
blanchet@42878
   193
  | aconn_map _ f (c, phis) = AConn (c, map (f NONE) phis)
blanchet@42878
   194
blanchet@42680
   195
fun formula_fold pos f =
blanchet@42677
   196
  let
blanchet@42677
   197
    fun aux pos (AQuant (_, _, phi)) = aux pos phi
blanchet@42878
   198
      | aux pos (AConn conn) = aconn_fold pos aux conn
blanchet@42677
   199
      | aux pos (AAtom tm) = f pos tm
blanchet@42834
   200
  in aux pos end
blanchet@42573
   201
blanchet@40114
   202
type translated_formula =
blanchet@38752
   203
  {name: string,
blanchet@42640
   204
   locality: locality,
blanchet@42525
   205
   kind: formula_kind,
blanchet@42562
   206
   combformula: (name, typ, combterm) formula,
blanchet@42562
   207
   atomic_types: typ list}
blanchet@38282
   208
blanchet@42640
   209
fun update_combformula f ({name, locality, kind, combformula, atomic_types}
blanchet@42640
   210
                          : translated_formula) =
blanchet@42640
   211
  {name = name, locality = locality, kind = kind, combformula = f combformula,
blanchet@42562
   212
   atomic_types = atomic_types} : translated_formula
blanchet@42542
   213
blanchet@42558
   214
fun fact_lift f ({combformula, ...} : translated_formula) = f combformula
blanchet@42558
   215
blanchet@42677
   216
blanchet@42753
   217
(* The Booleans indicate whether all type arguments should be kept. *)
blanchet@42753
   218
datatype type_arg_policy =
blanchet@42753
   219
  Explicit_Type_Args of bool |
blanchet@42753
   220
  Mangled_Type_Args of bool |
blanchet@42753
   221
  No_Type_Args
blanchet@41136
   222
blanchet@42836
   223
fun should_drop_arg_type_args (Simple_Types _) =
blanchet@42836
   224
    false (* since TFF doesn't support overloading *)
blanchet@42836
   225
  | should_drop_arg_type_args type_sys =
blanchet@42836
   226
    level_of_type_sys type_sys = All_Types andalso
blanchet@42837
   227
    heaviness_of_type_sys type_sys = Heavy
blanchet@42831
   228
blanchet@42589
   229
fun general_type_arg_policy type_sys =
blanchet@42589
   230
  if level_of_type_sys type_sys = No_Types then
blanchet@42589
   231
    No_Type_Args
blanchet@42589
   232
  else if polymorphism_of_type_sys type_sys = Mangled_Monomorphic then
blanchet@42831
   233
    Mangled_Type_Args (should_drop_arg_type_args type_sys)
blanchet@42589
   234
  else
blanchet@42831
   235
    Explicit_Type_Args (should_drop_arg_type_args type_sys)
blanchet@42563
   236
blanchet@42834
   237
fun type_arg_policy _ @{const_name HOL.eq} = No_Type_Args
blanchet@42834
   238
  | type_arg_policy type_sys _ = general_type_arg_policy type_sys
blanchet@42227
   239
blanchet@42353
   240
fun atp_type_literals_for_types type_sys kind Ts =
blanchet@42589
   241
  if level_of_type_sys type_sys = No_Types then
blanchet@42353
   242
    []
blanchet@42353
   243
  else
blanchet@42353
   244
    Ts |> type_literals_for_types
blanchet@42353
   245
       |> filter (fn TyLitVar _ => kind <> Conjecture
blanchet@42353
   246
                   | TyLitFree _ => kind = Conjecture)
blanchet@41137
   247
blanchet@42709
   248
fun mk_anot phi = AConn (ANot, [phi])
blanchet@38282
   249
fun mk_aconn c phi1 phi2 = AConn (c, [phi1, phi2])
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@42709
   490
                make_formula ctxt true true (string_of_int j) Chained 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@42682
   498
(* Finite types such as "unit", "bool", "bool * bool", and "bool => bool" are
blanchet@42682
   499
   dangerous because their "exhaust" properties can easily lead to unsound ATP
blanchet@42682
   500
   proofs. On the other hand, all HOL infinite types can be given the same
blanchet@42682
   501
   models in first-order logic (via Löwenheim-Skolem). *)
blanchet@42682
   502
blanchet@42836
   503
fun should_encode_type _ (nonmono_Ts as _ :: _) _ T =
blanchet@42836
   504
    exists (curry Type.raw_instance T) nonmono_Ts
blanchet@42836
   505
  | should_encode_type _ _ All_Types _ = true
blanchet@42682
   506
  | should_encode_type ctxt _ Finite_Types T = is_type_surely_finite ctxt T
blanchet@42682
   507
  | should_encode_type _ _ _ _ = false
blanchet@42682
   508
blanchet@42837
   509
fun should_predicate_on_type ctxt nonmono_Ts (Preds (_, level, heaviness))
blanchet@42834
   510
                             should_predicate_on_var T =
blanchet@42878
   511
    (heaviness = Heavy orelse should_predicate_on_var ()) andalso
blanchet@42878
   512
    should_encode_type ctxt nonmono_Ts level T
blanchet@42834
   513
  | should_predicate_on_type _ _ _ _ _ = false
blanchet@42682
   514
blanchet@42836
   515
fun is_var_or_bound_var (CombConst ((s, _), _, _)) =
blanchet@42836
   516
    String.isPrefix bound_var_prefix s
blanchet@42836
   517
  | is_var_or_bound_var (CombVar _) = true
blanchet@42836
   518
  | is_var_or_bound_var _ = false
blanchet@42836
   519
blanchet@42829
   520
datatype tag_site = Top_Level | Eq_Arg | Elsewhere
blanchet@42829
   521
blanchet@42829
   522
fun should_tag_with_type _ _ _ Top_Level _ _ = false
blanchet@42837
   523
  | should_tag_with_type ctxt nonmono_Ts (Tags (_, level, heaviness)) site u T =
blanchet@42837
   524
    (case heaviness of
blanchet@42837
   525
       Heavy => should_encode_type ctxt nonmono_Ts level T
blanchet@42837
   526
     | Light =>
blanchet@42836
   527
       case (site, is_var_or_bound_var u) of
blanchet@42836
   528
         (Eq_Arg, true) => should_encode_type ctxt nonmono_Ts level T
blanchet@42829
   529
       | _ => false)
blanchet@42829
   530
  | should_tag_with_type _ _ _ _ _ _ = false
blanchet@42682
   531
blanchet@42682
   532
val homo_infinite_T = @{typ ind} (* any infinite type *)
blanchet@42682
   533
blanchet@42682
   534
fun homogenized_type ctxt nonmono_Ts level T =
blanchet@42682
   535
  if should_encode_type ctxt nonmono_Ts level T then T else homo_infinite_T
blanchet@42682
   536
blanchet@42573
   537
(** "hBOOL" and "hAPP" **)
blanchet@41313
   538
blanchet@42574
   539
type sym_info =
blanchet@42563
   540
  {pred_sym : bool, min_ary : int, max_ary : int, typ : typ option}
blanchet@42563
   541
blanchet@42574
   542
fun add_combterm_syms_to_table explicit_apply =
blanchet@42558
   543
  let
blanchet@42558
   544
    fun aux top_level tm =
blanchet@42558
   545
      let val (head, args) = strip_combterm_comb tm in
blanchet@42558
   546
        (case head of
blanchet@42563
   547
           CombConst ((s, _), T, _) =>
blanchet@42558
   548
           if String.isPrefix bound_var_prefix s then
blanchet@42558
   549
             I
blanchet@42558
   550
           else
blanchet@42563
   551
             let val ary = length args in
blanchet@42558
   552
               Symtab.map_default
blanchet@42558
   553
                   (s, {pred_sym = true,
blanchet@42563
   554
                        min_ary = if explicit_apply then 0 else ary,
blanchet@42563
   555
                        max_ary = 0, typ = SOME T})
blanchet@42563
   556
                   (fn {pred_sym, min_ary, max_ary, typ} =>
blanchet@42558
   557
                       {pred_sym = pred_sym andalso top_level,
blanchet@42563
   558
                        min_ary = Int.min (ary, min_ary),
blanchet@42563
   559
                        max_ary = Int.max (ary, max_ary),
blanchet@42563
   560
                        typ = if typ = SOME T then typ else NONE})
blanchet@42558
   561
            end
blanchet@42558
   562
         | _ => I)
blanchet@42558
   563
        #> fold (aux false) args
blanchet@42558
   564
      end
blanchet@42558
   565
  in aux true end
blanchet@42674
   566
fun add_fact_syms_to_table explicit_apply =
blanchet@42834
   567
  fact_lift (formula_fold NONE (K (add_combterm_syms_to_table explicit_apply)))
blanchet@38282
   568
blanchet@42675
   569
val default_sym_table_entries : (string * sym_info) list =
blanchet@42563
   570
  [("equal", {pred_sym = true, min_ary = 2, max_ary = 2, typ = NONE}),
blanchet@42568
   571
   (make_fixed_const predicator_base,
blanchet@42563
   572
    {pred_sym = true, min_ary = 1, max_ary = 1, typ = NONE})] @
blanchet@42568
   573
  ([tptp_false, tptp_true]
blanchet@42563
   574
   |> map (rpair {pred_sym = true, min_ary = 0, max_ary = 0, typ = NONE}))
blanchet@41140
   575
blanchet@42544
   576
fun sym_table_for_facts explicit_apply facts =
blanchet@42568
   577
  Symtab.empty |> fold Symtab.default default_sym_table_entries
blanchet@42574
   578
               |> fold (add_fact_syms_to_table explicit_apply) facts
blanchet@38282
   579
blanchet@42558
   580
fun min_arity_of sym_tab s =
blanchet@42558
   581
  case Symtab.lookup sym_tab s of
blanchet@42574
   582
    SOME ({min_ary, ...} : sym_info) => min_ary
blanchet@42558
   583
  | NONE =>
blanchet@42558
   584
    case strip_prefix_and_unascii const_prefix s of
blanchet@42547
   585
      SOME s =>
blanchet@42570
   586
      let val s = s |> unmangled_const_name |> invert_const in
blanchet@42568
   587
        if s = predicator_base then 1
blanchet@42547
   588
        else if s = explicit_app_base then 2
blanchet@42547
   589
        else if s = type_pred_base then 1
blanchet@42557
   590
        else 0
blanchet@42547
   591
      end
blanchet@42544
   592
    | NONE => 0
blanchet@38282
   593
blanchet@38282
   594
(* True if the constant ever appears outside of the top-level position in
blanchet@38282
   595
   literals, or if it appears with different arities (e.g., because of different
blanchet@38282
   596
   type instantiations). If false, the constant always receives all of its
blanchet@38282
   597
   arguments and is used as a predicate. *)
blanchet@42558
   598
fun is_pred_sym sym_tab s =
blanchet@42558
   599
  case Symtab.lookup sym_tab s of
blanchet@42574
   600
    SOME ({pred_sym, min_ary, max_ary, ...} : sym_info) =>
blanchet@42574
   601
    pred_sym andalso min_ary = max_ary
blanchet@42558
   602
  | NONE => false
blanchet@38282
   603
blanchet@42568
   604
val predicator_combconst =
blanchet@42568
   605
  CombConst (`make_fixed_const predicator_base, @{typ "bool => bool"}, [])
blanchet@42568
   606
fun predicator tm = CombApp (predicator_combconst, tm)
blanchet@42542
   607
blanchet@42568
   608
fun introduce_predicators_in_combterm sym_tab tm =
blanchet@42542
   609
  case strip_combterm_comb tm of
blanchet@42542
   610
    (CombConst ((s, _), _, _), _) =>
blanchet@42568
   611
    if is_pred_sym sym_tab s then tm else predicator tm
blanchet@42568
   612
  | _ => predicator tm
blanchet@42542
   613
blanchet@42544
   614
fun list_app head args = fold (curry (CombApp o swap)) args head
blanchet@42544
   615
blanchet@42544
   616
fun explicit_app arg head =
blanchet@42544
   617
  let
blanchet@42562
   618
    val head_T = combtyp_of head
blanchet@42693
   619
    val (arg_T, res_T) = dest_funT head_T
blanchet@42544
   620
    val explicit_app =
blanchet@42562
   621
      CombConst (`make_fixed_const explicit_app_base, head_T --> head_T,
blanchet@42693
   622
                 [arg_T, res_T])
blanchet@42544
   623
  in list_app explicit_app [head, arg] end
blanchet@42544
   624
fun list_explicit_app head args = fold explicit_app args head
blanchet@38282
   625
blanchet@42565
   626
fun introduce_explicit_apps_in_combterm sym_tab =
blanchet@42544
   627
  let
blanchet@42544
   628
    fun aux tm =
blanchet@42544
   629
      case strip_combterm_comb tm of
blanchet@42544
   630
        (head as CombConst ((s, _), _, _), args) =>
blanchet@42544
   631
        args |> map aux
blanchet@42557
   632
             |> chop (min_arity_of sym_tab s)
blanchet@42544
   633
             |>> list_app head
blanchet@42544
   634
             |-> list_explicit_app
blanchet@42544
   635
      | (head, args) => list_explicit_app head (map aux args)
blanchet@42544
   636
  in aux end
blanchet@38282
   637
blanchet@42753
   638
fun chop_fun 0 T = ([], T)
blanchet@42753
   639
  | chop_fun n (Type (@{type_name fun}, [dom_T, ran_T])) =
blanchet@42753
   640
    chop_fun (n - 1) ran_T |>> cons dom_T
blanchet@42753
   641
  | chop_fun _ _ = raise Fail "unexpected non-function"
blanchet@42753
   642
blanchet@42780
   643
fun filter_type_args _ _ _ [] = []
blanchet@42780
   644
  | filter_type_args thy s arity T_args =
blanchet@42834
   645
    let
blanchet@42834
   646
      (* will throw "TYPE" for pseudo-constants *)
blanchet@42834
   647
      val U = if s = explicit_app_base then
blanchet@42834
   648
                @{typ "('a => 'b) => 'a => 'b"} |> Logic.varifyT_global
blanchet@42834
   649
              else
blanchet@42834
   650
                s |> Sign.the_const_type thy
blanchet@42834
   651
    in
blanchet@42781
   652
      case Term.add_tvarsT (U |> chop_fun arity |> snd) [] of
blanchet@42781
   653
        [] => []
blanchet@42781
   654
      | res_U_vars =>
blanchet@42781
   655
        let val U_args = (s, U) |> Sign.const_typargs thy in
blanchet@42781
   656
          U_args ~~ T_args
blanchet@42781
   657
          |> map_filter (fn (U, T) =>
blanchet@42781
   658
                            if member (op =) res_U_vars (dest_TVar U) then
blanchet@42781
   659
                              SOME T
blanchet@42781
   660
                            else
blanchet@42781
   661
                              NONE)
blanchet@42781
   662
        end
blanchet@42780
   663
    end
blanchet@42780
   664
    handle TYPE _ => T_args
blanchet@42753
   665
blanchet@42753
   666
fun enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys =
blanchet@42753
   667
  let
blanchet@42753
   668
    val thy = Proof_Context.theory_of ctxt
blanchet@42753
   669
    fun aux arity (CombApp (tm1, tm2)) =
blanchet@42753
   670
        CombApp (aux (arity + 1) tm1, aux 0 tm2)
blanchet@42753
   671
      | aux arity (CombConst (name as (s, _), T, T_args)) =
blanchet@42701
   672
        let
blanchet@42701
   673
          val level = level_of_type_sys type_sys
blanchet@42701
   674
          val (T, T_args) =
blanchet@42701
   675
            (* Aggressively merge most "hAPPs" if the type system is unsound
blanchet@42701
   676
               anyway, by distinguishing overloads only on the homogenized
blanchet@42837
   677
               result type. Don't do it for lightweight type systems, though,
blanchet@42837
   678
               since it leads to too many unsound proofs. *)
blanchet@42701
   679
            if s = const_prefix ^ explicit_app_base andalso
blanchet@42726
   680
               length T_args = 2 andalso
blanchet@42836
   681
               not (is_type_sys_virtually_sound type_sys) andalso
blanchet@42837
   682
               heaviness_of_type_sys type_sys = Heavy then
blanchet@42701
   683
              T_args |> map (homogenized_type ctxt nonmono_Ts level)
blanchet@42701
   684
                     |> (fn Ts => let val T = hd Ts --> nth Ts 1 in
blanchet@42831
   685
                                    (T --> T, tl Ts)
blanchet@42701
   686
                                  end)
blanchet@42701
   687
            else
blanchet@42701
   688
              (T, T_args)
blanchet@42701
   689
        in
blanchet@42701
   690
          (case strip_prefix_and_unascii const_prefix s of
blanchet@42701
   691
             NONE => (name, T_args)
blanchet@42701
   692
           | SOME s'' =>
blanchet@42753
   693
             let
blanchet@42753
   694
               val s'' = invert_const s''
blanchet@42831
   695
               fun filtered_T_args false = T_args
blanchet@42831
   696
                 | filtered_T_args true = filter_type_args thy s'' arity T_args
blanchet@42753
   697
             in
blanchet@42701
   698
               case type_arg_policy type_sys s'' of
blanchet@42831
   699
                 Explicit_Type_Args drop_args =>
blanchet@42831
   700
                 (name, filtered_T_args drop_args)
blanchet@42831
   701
               | Mangled_Type_Args drop_args =>
blanchet@42831
   702
                 (mangled_const_name (filtered_T_args drop_args) name, [])
blanchet@42753
   703
               | No_Type_Args => (name, [])
blanchet@42701
   704
             end)
blanchet@42701
   705
          |> (fn (name, T_args) => CombConst (name, T, T_args))
blanchet@42701
   706
        end
blanchet@42753
   707
      | aux _ tm = tm
blanchet@42753
   708
  in aux 0 end
blanchet@42573
   709
blanchet@42701
   710
fun repair_combterm ctxt nonmono_Ts type_sys sym_tab =
blanchet@42565
   711
  introduce_explicit_apps_in_combterm sym_tab
blanchet@42568
   712
  #> introduce_predicators_in_combterm sym_tab
blanchet@42753
   713
  #> enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys
blanchet@42701
   714
fun repair_fact ctxt nonmono_Ts type_sys sym_tab =
blanchet@42701
   715
  update_combformula (formula_map
blanchet@42701
   716
      (repair_combterm ctxt nonmono_Ts type_sys sym_tab))
blanchet@42573
   717
blanchet@42573
   718
(** Helper facts **)
blanchet@42573
   719
blanchet@42573
   720
fun ti_ti_helper_fact () =
blanchet@42573
   721
  let
blanchet@42573
   722
    fun var s = ATerm (`I s, [])
blanchet@42589
   723
    fun tag tm = ATerm (`make_fixed_const type_tag_name, [var "X", tm])
blanchet@42573
   724
  in
blanchet@42612
   725
    Formula (helper_prefix ^ "ti_ti", Axiom,
blanchet@42573
   726
             AAtom (ATerm (`I "equal", [tag (tag (var "Y")), tag (var "Y")]))
blanchet@42879
   727
             |> close_formula_universally, simp_info, NONE)
blanchet@42573
   728
  end
blanchet@42573
   729
blanchet@42574
   730
fun helper_facts_for_sym ctxt type_sys (s, {typ, ...} : sym_info) =
blanchet@42573
   731
  case strip_prefix_and_unascii const_prefix s of
blanchet@42573
   732
    SOME mangled_s =>
blanchet@42573
   733
    let
blanchet@42573
   734
      val thy = Proof_Context.theory_of ctxt
blanchet@42573
   735
      val unmangled_s = mangled_s |> unmangled_const_name
blanchet@42579
   736
      fun dub_and_inst c needs_some_types (th, j) =
blanchet@42579
   737
        ((c ^ "_" ^ string_of_int j ^ (if needs_some_types then "T" else ""),
blanchet@42640
   738
          Chained),
blanchet@42573
   739
         let val t = th |> prop_of in
blanchet@42753
   740
           t |> ((case general_type_arg_policy type_sys of
blanchet@42753
   741
                    Mangled_Type_Args _ => true
blanchet@42753
   742
                  | _ => false) andalso
blanchet@42573
   743
                 not (null (Term.hidden_polymorphism t)))
blanchet@42573
   744
                ? (case typ of
blanchet@42573
   745
                     SOME T => specialize_type thy (invert_const unmangled_s, T)
blanchet@42573
   746
                   | NONE => I)
blanchet@42573
   747
         end)
blanchet@42573
   748
      fun make_facts eq_as_iff =
blanchet@42573
   749
        map_filter (make_fact ctxt false eq_as_iff false)
blanchet@42589
   750
      val has_some_types = is_type_sys_fairly_sound type_sys
blanchet@42573
   751
    in
blanchet@42573
   752
      metis_helpers
blanchet@42579
   753
      |> maps (fn (metis_s, (needs_some_types, ths)) =>
blanchet@42573
   754
                  if metis_s <> unmangled_s orelse
blanchet@42589
   755
                     (needs_some_types andalso not has_some_types) then
blanchet@42573
   756
                    []
blanchet@42573
   757
                  else
blanchet@42573
   758
                    ths ~~ (1 upto length ths)
blanchet@42579
   759
                    |> map (dub_and_inst mangled_s needs_some_types)
blanchet@42579
   760
                    |> make_facts (not needs_some_types))
blanchet@42573
   761
    end
blanchet@42573
   762
  | NONE => []
blanchet@42573
   763
fun helper_facts_for_sym_table ctxt type_sys sym_tab =
blanchet@42573
   764
  Symtab.fold_rev (append o helper_facts_for_sym ctxt type_sys) sym_tab []
blanchet@42573
   765
blanchet@42573
   766
fun translate_atp_fact ctxt keep_trivial =
blanchet@42573
   767
  `(make_fact ctxt keep_trivial true true o apsnd prop_of)
blanchet@42573
   768
blanchet@42709
   769
fun translate_formulas ctxt prem_kind type_sys hyp_ts concl_t rich_facts =
blanchet@42573
   770
  let
blanchet@42573
   771
    val thy = Proof_Context.theory_of ctxt
blanchet@42573
   772
    val fact_ts = map (prop_of o snd o snd) rich_facts
blanchet@42573
   773
    val (facts, fact_names) =
blanchet@42573
   774
      rich_facts
blanchet@42573
   775
      |> map_filter (fn (NONE, _) => NONE
blanchet@42573
   776
                      | (SOME fact, (name, _)) => SOME (fact, name))
blanchet@42573
   777
      |> ListPair.unzip
blanchet@42573
   778
    (* Remove existing facts from the conjecture, as this can dramatically
blanchet@42573
   779
       boost an ATP's performance (for some reason). *)
blanchet@42573
   780
    val hyp_ts = hyp_ts |> filter_out (member (op aconv) fact_ts)
blanchet@42573
   781
    val goal_t = Logic.list_implies (hyp_ts, concl_t)
blanchet@42573
   782
    val all_ts = goal_t :: fact_ts
blanchet@42573
   783
    val subs = tfree_classes_of_terms all_ts
blanchet@42573
   784
    val supers = tvar_classes_of_terms all_ts
blanchet@42573
   785
    val tycons = type_consts_of_terms thy all_ts
blanchet@42709
   786
    val conjs = make_conjecture ctxt prem_kind (hyp_ts @ [concl_t])
blanchet@42573
   787
    val (supers', arity_clauses) =
blanchet@42589
   788
      if level_of_type_sys type_sys = No_Types then ([], [])
blanchet@42573
   789
      else make_arity_clauses thy tycons supers
blanchet@42573
   790
    val class_rel_clauses = make_class_rel_clauses thy subs supers'
blanchet@42573
   791
  in
blanchet@42573
   792
    (fact_names |> map single, (conjs, facts, class_rel_clauses, arity_clauses))
blanchet@42573
   793
  end
blanchet@42573
   794
blanchet@42573
   795
fun fo_literal_from_type_literal (TyLitVar (class, name)) =
blanchet@42573
   796
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
   797
  | fo_literal_from_type_literal (TyLitFree (class, name)) =
blanchet@42573
   798
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
   799
blanchet@42573
   800
fun formula_from_fo_literal (pos, t) = AAtom t |> not pos ? mk_anot
blanchet@42573
   801
blanchet@42878
   802
fun type_pred_combterm ctxt nonmono_Ts type_sys T tm =
blanchet@42834
   803
  CombApp (CombConst (`make_fixed_const type_pred_base, T --> @{typ bool}, [T])
blanchet@42834
   804
           |> enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys,
blanchet@42573
   805
           tm)
blanchet@42573
   806
blanchet@42878
   807
fun var_occurs_positively_naked_in_term _ (SOME false) _ accum = accum
blanchet@42878
   808
  | var_occurs_positively_naked_in_term name _ (ATerm ((s, _), tms)) accum =
blanchet@42878
   809
    accum orelse (s = "equal" andalso member (op =) tms (ATerm (name, [])))
blanchet@42878
   810
fun is_var_nonmonotonic_in_formula _ _ (SOME false) _ = false
blanchet@42878
   811
  | is_var_nonmonotonic_in_formula pos phi _ name =
blanchet@42878
   812
    formula_fold pos (var_occurs_positively_naked_in_term name) phi false
blanchet@42834
   813
blanchet@42829
   814
fun tag_with_type ctxt nonmono_Ts type_sys T tm =
blanchet@42829
   815
  CombConst (`make_fixed_const type_tag_name, T --> T, [T])
blanchet@42829
   816
  |> enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys
blanchet@42829
   817
  |> term_from_combterm ctxt nonmono_Ts type_sys Top_Level
blanchet@42829
   818
  |> (fn ATerm (s, tms) => ATerm (s, tms @ [tm]))
blanchet@42829
   819
and term_from_combterm ctxt nonmono_Ts type_sys site u =
blanchet@42573
   820
  let
blanchet@42829
   821
    val (head, args) = strip_combterm_comb u
blanchet@42829
   822
    val (x as (s, _), T_args) =
blanchet@42829
   823
      case head of
blanchet@42829
   824
        CombConst (name, _, T_args) => (name, T_args)
blanchet@42829
   825
      | CombVar (name, _) => (name, [])
blanchet@42829
   826
      | CombApp _ => raise Fail "impossible \"CombApp\""
blanchet@42829
   827
    val arg_site = if site = Top_Level andalso s = "equal" then Eq_Arg
blanchet@42829
   828
                   else Elsewhere
blanchet@42829
   829
    val t = ATerm (x, map fo_term_from_typ T_args @
blanchet@42829
   830
                      map (term_from_combterm ctxt nonmono_Ts type_sys arg_site)
blanchet@42829
   831
                          args)
blanchet@42829
   832
    val T = combtyp_of u
blanchet@42829
   833
  in
blanchet@42829
   834
    t |> (if should_tag_with_type ctxt nonmono_Ts type_sys site u T then
blanchet@42829
   835
            tag_with_type ctxt nonmono_Ts type_sys T
blanchet@42829
   836
          else
blanchet@42829
   837
            I)
blanchet@42829
   838
  end
blanchet@42834
   839
and formula_from_combformula ctxt nonmono_Ts type_sys should_predicate_on_var =
blanchet@42829
   840
  let
blanchet@42878
   841
    val do_term = term_from_combterm ctxt nonmono_Ts type_sys Top_Level
blanchet@42573
   842
    val do_bound_type =
blanchet@42682
   843
      case type_sys of
blanchet@42722
   844
        Simple_Types level =>
blanchet@42682
   845
        SOME o mangled_type_name o homogenized_type ctxt nonmono_Ts level
blanchet@42682
   846
      | _ => K NONE
blanchet@42878
   847
    fun do_out_of_bound_type pos phi universal (name, T) =
blanchet@42834
   848
      if should_predicate_on_type ctxt nonmono_Ts type_sys
blanchet@42878
   849
             (fn () => should_predicate_on_var pos phi universal name) T then
blanchet@42834
   850
        CombVar (name, T)
blanchet@42878
   851
        |> type_pred_combterm ctxt nonmono_Ts type_sys T
blanchet@42878
   852
        |> do_term |> AAtom |> SOME
blanchet@42573
   853
      else
blanchet@42573
   854
        NONE
blanchet@42878
   855
    fun do_formula pos (AQuant (q, xs, phi)) =
blanchet@42878
   856
        let
blanchet@42878
   857
          val phi = phi |> do_formula pos
blanchet@42878
   858
          val universal = Option.map (q = AExists ? not) pos
blanchet@42878
   859
        in
blanchet@42834
   860
          AQuant (q, xs |> map (apsnd (fn NONE => NONE
blanchet@42834
   861
                                        | SOME T => do_bound_type T)),
blanchet@42834
   862
                  (if q = AForall then mk_ahorn else fold_rev (mk_aconn AAnd))
blanchet@42834
   863
                      (map_filter
blanchet@42834
   864
                           (fn (_, NONE) => NONE
blanchet@42834
   865
                             | (s, SOME T) =>
blanchet@42878
   866
                               do_out_of_bound_type pos phi universal (s, T))
blanchet@42878
   867
                           xs)
blanchet@42834
   868
                      phi)
blanchet@42834
   869
        end
blanchet@42878
   870
      | do_formula pos (AConn conn) = aconn_map pos do_formula conn
blanchet@42878
   871
      | do_formula _ (AAtom tm) = AAtom (do_term tm)
blanchet@42878
   872
  in do_formula o SOME end
blanchet@42573
   873
blanchet@42727
   874
fun bound_atomic_types type_sys Ts =
blanchet@42727
   875
  mk_ahorn (map (formula_from_fo_literal o fo_literal_from_type_literal)
blanchet@42727
   876
                (atp_type_literals_for_types type_sys Axiom Ts))
blanchet@42727
   877
blanchet@42680
   878
fun formula_for_fact ctxt nonmono_Ts type_sys
blanchet@42573
   879
                     ({combformula, atomic_types, ...} : translated_formula) =
blanchet@42727
   880
  combformula
blanchet@42727
   881
  |> close_combformula_universally
blanchet@42727
   882
  |> formula_from_combformula ctxt nonmono_Ts type_sys
blanchet@42878
   883
                              is_var_nonmonotonic_in_formula true
blanchet@42727
   884
  |> bound_atomic_types type_sys atomic_types
blanchet@42573
   885
  |> close_formula_universally
blanchet@42573
   886
blanchet@42573
   887
(* Each fact is given a unique fact number to avoid name clashes (e.g., because
blanchet@42573
   888
   of monomorphization). The TPTP explicitly forbids name clashes, and some of
blanchet@42573
   889
   the remote provers might care. *)
blanchet@42680
   890
fun formula_line_for_fact ctxt prefix nonmono_Ts type_sys
blanchet@42640
   891
                          (j, formula as {name, locality, kind, ...}) =
blanchet@42680
   892
  Formula (prefix ^ (if polymorphism_of_type_sys type_sys = Polymorphic then ""
blanchet@42680
   893
                     else string_of_int j ^ "_") ^
blanchet@42647
   894
           ascii_of name,
blanchet@42680
   895
           kind, formula_for_fact ctxt nonmono_Ts type_sys formula, NONE,
blanchet@42879
   896
           case locality of
blanchet@42879
   897
             Intro => intro_info
blanchet@42879
   898
           | Elim => elim_info
blanchet@42879
   899
           | Simp => simp_info
blanchet@42879
   900
           | _ => NONE)
blanchet@42573
   901
blanchet@42573
   902
fun formula_line_for_class_rel_clause (ClassRelClause {name, subclass,
blanchet@42573
   903
                                                       superclass, ...}) =
blanchet@42573
   904
  let val ty_arg = ATerm (`I "T", []) in
blanchet@42577
   905
    Formula (class_rel_clause_prefix ^ ascii_of name, Axiom,
blanchet@42573
   906
             AConn (AImplies, [AAtom (ATerm (subclass, [ty_arg])),
blanchet@42573
   907
                               AAtom (ATerm (superclass, [ty_arg]))])
blanchet@42879
   908
             |> close_formula_universally, intro_info, NONE)
blanchet@42573
   909
  end
blanchet@42573
   910
blanchet@42573
   911
fun fo_literal_from_arity_literal (TConsLit (c, t, args)) =
blanchet@42573
   912
    (true, ATerm (c, [ATerm (t, map (fn arg => ATerm (arg, [])) args)]))
blanchet@42573
   913
  | fo_literal_from_arity_literal (TVarLit (c, sort)) =
blanchet@42573
   914
    (false, ATerm (c, [ATerm (sort, [])]))
blanchet@42573
   915
blanchet@42573
   916
fun formula_line_for_arity_clause (ArityClause {name, conclLit, premLits,
blanchet@42573
   917
                                                ...}) =
blanchet@42577
   918
  Formula (arity_clause_prefix ^ ascii_of name, Axiom,
blanchet@42573
   919
           mk_ahorn (map (formula_from_fo_literal o apfst not
blanchet@42573
   920
                          o fo_literal_from_arity_literal) premLits)
blanchet@42573
   921
                    (formula_from_fo_literal
blanchet@42573
   922
                         (fo_literal_from_arity_literal conclLit))
blanchet@42879
   923
           |> close_formula_universally, intro_info, NONE)
blanchet@42573
   924
blanchet@42680
   925
fun formula_line_for_conjecture ctxt nonmono_Ts type_sys
blanchet@42573
   926
        ({name, kind, combformula, ...} : translated_formula) =
blanchet@42577
   927
  Formula (conjecture_prefix ^ name, kind,
blanchet@42680
   928
           formula_from_combformula ctxt nonmono_Ts type_sys
blanchet@42878
   929
                                    is_var_nonmonotonic_in_formula false
blanchet@42573
   930
                                    (close_combformula_universally combformula)
blanchet@42573
   931
           |> close_formula_universally, NONE, NONE)
blanchet@42573
   932
blanchet@42573
   933
fun free_type_literals type_sys ({atomic_types, ...} : translated_formula) =
blanchet@42573
   934
  atomic_types |> atp_type_literals_for_types type_sys Conjecture
blanchet@42573
   935
               |> map fo_literal_from_type_literal
blanchet@42573
   936
blanchet@42573
   937
fun formula_line_for_free_type j lit =
blanchet@42577
   938
  Formula (tfree_prefix ^ string_of_int j, Hypothesis,
blanchet@42573
   939
           formula_from_fo_literal lit, NONE, NONE)
blanchet@42573
   940
fun formula_lines_for_free_types type_sys facts =
blanchet@42573
   941
  let
blanchet@42573
   942
    val litss = map (free_type_literals type_sys) facts
blanchet@42573
   943
    val lits = fold (union (op =)) litss []
blanchet@42573
   944
  in map2 formula_line_for_free_type (0 upto length lits - 1) lits end
blanchet@42573
   945
blanchet@42573
   946
(** Symbol declarations **)
blanchet@42544
   947
blanchet@42677
   948
fun insert_type get_T x xs =
blanchet@42677
   949
  let val T = get_T x in
blanchet@42677
   950
    if exists (curry Type.raw_instance T o get_T) xs then xs
blanchet@42677
   951
    else x :: filter_out ((fn T' => Type.raw_instance (T', T)) o get_T) xs
blanchet@42677
   952
  end
blanchet@42677
   953
blanchet@42574
   954
fun should_declare_sym type_sys pred_sym s =
blanchet@42542
   955
  not (String.isPrefix bound_var_prefix s) andalso s <> "equal" andalso
blanchet@42753
   956
  not (String.isPrefix tptp_special_prefix s) andalso
blanchet@42834
   957
  ((case type_sys of
blanchet@42834
   958
      Simple_Types _ => true
blanchet@42837
   959
    | Tags (_, _, Light) => true
blanchet@42834
   960
    | _ => false) orelse not pred_sym)
blanchet@38282
   961
blanchet@42698
   962
fun sym_decl_table_for_facts type_sys repaired_sym_tab (conjs, facts) =
blanchet@42574
   963
  let
blanchet@42698
   964
    fun add_combterm in_conj tm =
blanchet@42574
   965
      let val (head, args) = strip_combterm_comb tm in
blanchet@42574
   966
        (case head of
blanchet@42574
   967
           CombConst ((s, s'), T, T_args) =>
blanchet@42574
   968
           let val pred_sym = is_pred_sym repaired_sym_tab s in
blanchet@42574
   969
             if should_declare_sym type_sys pred_sym s then
blanchet@42576
   970
               Symtab.map_default (s, [])
blanchet@42698
   971
                   (insert_type #3 (s', T_args, T, pred_sym, length args,
blanchet@42698
   972
                                    in_conj))
blanchet@42574
   973
             else
blanchet@42574
   974
               I
blanchet@42574
   975
           end
blanchet@42574
   976
         | _ => I)
blanchet@42698
   977
        #> fold (add_combterm in_conj) args
blanchet@42574
   978
      end
blanchet@42698
   979
    fun add_fact in_conj =
blanchet@42834
   980
      fact_lift (formula_fold NONE (K (add_combterm in_conj)))
blanchet@42698
   981
  in
blanchet@42698
   982
    Symtab.empty
blanchet@42698
   983
    |> is_type_sys_fairly_sound type_sys
blanchet@42698
   984
       ? (fold (add_fact true) conjs #> fold (add_fact false) facts)
blanchet@42698
   985
  end
blanchet@42533
   986
blanchet@42685
   987
(* This inference is described in section 2.3 of Claessen et al.'s "Sorting it
blanchet@42685
   988
   out with monotonicity" paper presented at CADE 2011. *)
blanchet@42829
   989
fun add_combterm_nonmonotonic_types _ _  (SOME false) _ = I
blanchet@42829
   990
  | add_combterm_nonmonotonic_types ctxt level _
blanchet@42680
   991
        (CombApp (CombApp (CombConst (("equal", _), Type (_, [T, _]), _), tm1),
blanchet@42680
   992
                  tm2)) =
blanchet@42680
   993
    (exists is_var_or_bound_var [tm1, tm2] andalso
blanchet@42829
   994
     (case level of
blanchet@42829
   995
        Nonmonotonic_Types => not (is_type_surely_infinite ctxt T)
blanchet@42829
   996
      | Finite_Types => is_type_surely_finite ctxt T
blanchet@42829
   997
      | _ => true)) ? insert_type I T
blanchet@42829
   998
  | add_combterm_nonmonotonic_types _ _ _ _ = I
blanchet@42829
   999
fun add_fact_nonmonotonic_types ctxt level ({kind, combformula, ...}
blanchet@42829
  1000
                                            : translated_formula) =
blanchet@42834
  1001
  formula_fold (SOME (kind <> Conjecture))
blanchet@42829
  1002
               (add_combterm_nonmonotonic_types ctxt level) combformula
blanchet@42680
  1003
fun add_nonmonotonic_types_for_facts ctxt type_sys facts =
blanchet@42829
  1004
  let val level = level_of_type_sys type_sys in
blanchet@42836
  1005
    (case level of
blanchet@42836
  1006
       Nonmonotonic_Types => true
blanchet@42836
  1007
     | Finite_Types =>
blanchet@42837
  1008
       heaviness_of_type_sys type_sys = Light andalso
blanchet@42836
  1009
       polymorphism_of_type_sys type_sys <> Polymorphic
blanchet@42836
  1010
     | _ => false)
blanchet@42829
  1011
    ? (fold (add_fact_nonmonotonic_types ctxt level) facts
blanchet@42836
  1012
       (* We must add bool in case the helper "True_or_False" is added later.
blanchet@42836
  1013
          In addition, several places in the code rely on the list of
blanchet@42836
  1014
          nonmonotonic types not being empty. *)
blanchet@42829
  1015
       #> insert_type I @{typ bool})
blanchet@42829
  1016
  end
blanchet@42677
  1017
blanchet@42754
  1018
fun decl_line_for_sym ctxt nonmono_Ts level s (s', _, T, pred_sym, ary, _) =
blanchet@42754
  1019
  let
blanchet@42754
  1020
    val translate_type =
blanchet@42754
  1021
      mangled_type_name o homogenized_type ctxt nonmono_Ts level
blanchet@42754
  1022
    val (arg_tys, res_ty) =
blanchet@42754
  1023
      T |> chop_fun ary |>> map translate_type ||> translate_type
blanchet@42754
  1024
  in
blanchet@42754
  1025
    Decl (sym_decl_prefix ^ s, (s, s'), arg_tys,
blanchet@42754
  1026
          if pred_sym then `I tptp_tff_bool_type else res_ty)
blanchet@42579
  1027
  end
blanchet@42579
  1028
blanchet@42592
  1029
fun is_polymorphic_type T = fold_atyps (fn TVar _ => K true | _ => I) T false
blanchet@42592
  1030
blanchet@42829
  1031
fun formula_line_for_pred_sym_decl ctxt conj_sym_kind nonmono_Ts type_sys n s j
blanchet@42829
  1032
                                   (s', T_args, T, _, ary, in_conj) =
blanchet@42579
  1033
  let
blanchet@42709
  1034
    val (kind, maybe_negate) =
blanchet@42709
  1035
      if in_conj then (conj_sym_kind, conj_sym_kind = Conjecture ? mk_anot)
blanchet@42709
  1036
      else (Axiom, I)
blanchet@42753
  1037
    val (arg_Ts, res_T) = chop_fun ary T
blanchet@42579
  1038
    val bound_names =
blanchet@42579
  1039
      1 upto length arg_Ts |> map (`I o make_bound_var o string_of_int)
blanchet@42829
  1040
    val bounds =
blanchet@42579
  1041
      bound_names ~~ arg_Ts |> map (fn (name, T) => CombConst (name, T, []))
blanchet@42579
  1042
    val bound_Ts =
blanchet@42592
  1043
      arg_Ts |> map (fn T => if n > 1 orelse is_polymorphic_type T then SOME T
blanchet@42592
  1044
                             else NONE)
blanchet@42579
  1045
  in
blanchet@42612
  1046
    Formula (sym_decl_prefix ^ s ^
blanchet@42709
  1047
             (if n > 1 then "_" ^ string_of_int j else ""), kind,
blanchet@42579
  1048
             CombConst ((s, s'), T, T_args)
blanchet@42829
  1049
             |> fold (curry (CombApp o swap)) bounds
blanchet@42878
  1050
             |> type_pred_combterm ctxt nonmono_Ts type_sys res_T
blanchet@42878
  1051
             |> AAtom
blanchet@42579
  1052
             |> mk_aquant AForall (bound_names ~~ bound_Ts)
blanchet@42878
  1053
             |> formula_from_combformula ctxt nonmono_Ts type_sys
blanchet@42878
  1054
                                         (K (K (K (K true)))) true
blanchet@42727
  1055
             |> n > 1 ? bound_atomic_types type_sys (atyps_of T)
blanchet@42709
  1056
             |> close_formula_universally
blanchet@42709
  1057
             |> maybe_negate,
blanchet@42879
  1058
             intro_info, NONE)
blanchet@42579
  1059
  end
blanchet@42579
  1060
blanchet@42852
  1061
fun formula_lines_for_tag_sym_decl ctxt conj_sym_kind nonmono_Ts type_sys n s
blanchet@42852
  1062
                                  (j, (s', T_args, T, pred_sym, ary, in_conj)) =
blanchet@42829
  1063
  let
blanchet@42829
  1064
    val ident_base =
blanchet@42829
  1065
      sym_decl_prefix ^ s ^ (if n > 1 then "_" ^ string_of_int j else "")
blanchet@42852
  1066
    val (kind, maybe_negate) =
blanchet@42852
  1067
      if in_conj then (conj_sym_kind, conj_sym_kind = Conjecture ? mk_anot)
blanchet@42852
  1068
      else (Axiom, I)
blanchet@42829
  1069
    val (arg_Ts, res_T) = chop_fun ary T
blanchet@42829
  1070
    val bound_names =
blanchet@42829
  1071
      1 upto length arg_Ts |> map (`I o make_bound_var o string_of_int)
blanchet@42829
  1072
    val bounds = bound_names |> map (fn name => ATerm (name, []))
blanchet@42829
  1073
    fun const args = ATerm ((s, s'), map fo_term_from_typ T_args @ args)
blanchet@42830
  1074
    val atomic_Ts = atyps_of T
blanchet@42834
  1075
    fun eq tms =
blanchet@42834
  1076
      (if pred_sym then AConn (AIff, map AAtom tms)
blanchet@42834
  1077
       else AAtom (ATerm (`I "equal", tms)))
blanchet@42830
  1078
      |> bound_atomic_types type_sys atomic_Ts
blanchet@42830
  1079
      |> close_formula_universally
blanchet@42852
  1080
      |> maybe_negate
blanchet@42836
  1081
    val should_encode = should_encode_type ctxt nonmono_Ts All_Types
blanchet@42829
  1082
    val tag_with = tag_with_type ctxt nonmono_Ts type_sys
blanchet@42829
  1083
    val add_formula_for_res =
blanchet@42829
  1084
      if should_encode res_T then
blanchet@42852
  1085
        cons (Formula (ident_base ^ "_res", kind,
blanchet@42834
  1086
                       eq [tag_with res_T (const bounds), const bounds],
blanchet@42879
  1087
                       simp_info, NONE))
blanchet@42829
  1088
      else
blanchet@42829
  1089
        I
blanchet@42829
  1090
    fun add_formula_for_arg k =
blanchet@42829
  1091
      let val arg_T = nth arg_Ts k in
blanchet@42829
  1092
        if should_encode arg_T then
blanchet@42829
  1093
          case chop k bounds of
blanchet@42829
  1094
            (bounds1, bound :: bounds2) =>
blanchet@42852
  1095
            cons (Formula (ident_base ^ "_arg" ^ string_of_int (k + 1), kind,
blanchet@42834
  1096
                           eq [const (bounds1 @ tag_with arg_T bound ::
blanchet@42834
  1097
                                      bounds2),
blanchet@42834
  1098
                               const bounds],
blanchet@42879
  1099
                           simp_info, NONE))
blanchet@42829
  1100
          | _ => raise Fail "expected nonempty tail"
blanchet@42829
  1101
        else
blanchet@42829
  1102
          I
blanchet@42829
  1103
      end
blanchet@42829
  1104
  in
blanchet@42834
  1105
    [] |> not pred_sym ? add_formula_for_res
blanchet@42829
  1106
       |> fold add_formula_for_arg (ary - 1 downto 0)
blanchet@42829
  1107
  end
blanchet@42829
  1108
blanchet@42836
  1109
fun result_type_of_decl (_, _, T, _, ary, _) = chop_fun ary T |> snd
blanchet@42836
  1110
blanchet@42709
  1111
fun problem_lines_for_sym_decls ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42709
  1112
                                (s, decls) =
blanchet@42682
  1113
  case type_sys of
blanchet@42754
  1114
    Simple_Types level => map (decl_line_for_sym ctxt nonmono_Ts level s) decls
blanchet@42829
  1115
  | Preds _ =>
blanchet@42574
  1116
    let
blanchet@42579
  1117
      val decls =
blanchet@42579
  1118
        case decls of
blanchet@42579
  1119
          decl :: (decls' as _ :: _) =>
blanchet@42592
  1120
          let val T = result_type_of_decl decl in
blanchet@42592
  1121
            if forall ((fn T' => Type.raw_instance (T', T))
blanchet@42592
  1122
                       o result_type_of_decl) decls' then
blanchet@42592
  1123
              [decl]
blanchet@42592
  1124
            else
blanchet@42592
  1125
              decls
blanchet@42592
  1126
          end
blanchet@42579
  1127
        | _ => decls
blanchet@42579
  1128
      val n = length decls
blanchet@42579
  1129
      val decls =
blanchet@42834
  1130
        decls
blanchet@42834
  1131
        |> filter (should_predicate_on_type ctxt nonmono_Ts type_sys (K true)
blanchet@42834
  1132
                   o result_type_of_decl)
blanchet@42574
  1133
    in
blanchet@42709
  1134
      (0 upto length decls - 1, decls)
blanchet@42829
  1135
      |-> map2 (formula_line_for_pred_sym_decl ctxt conj_sym_kind nonmono_Ts
blanchet@42829
  1136
                                               type_sys n s)
blanchet@42574
  1137
    end
blanchet@42837
  1138
  | Tags (_, _, heaviness) =>
blanchet@42837
  1139
    (case heaviness of
blanchet@42837
  1140
       Heavy => []
blanchet@42837
  1141
     | Light =>
blanchet@42829
  1142
       let val n = length decls in
blanchet@42829
  1143
         (0 upto n - 1 ~~ decls)
blanchet@42852
  1144
         |> maps (formula_lines_for_tag_sym_decl ctxt conj_sym_kind nonmono_Ts
blanchet@42852
  1145
                                                 type_sys n s)
blanchet@42829
  1146
       end)
blanchet@42579
  1147
blanchet@42709
  1148
fun problem_lines_for_sym_decl_table ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42709
  1149
                                     sym_decl_tab =
blanchet@42709
  1150
  Symtab.fold_rev (append o problem_lines_for_sym_decls ctxt conj_sym_kind
blanchet@42709
  1151
                                                        nonmono_Ts type_sys)
blanchet@42574
  1152
                  sym_decl_tab []
blanchet@42543
  1153
blanchet@42543
  1154
fun add_tff_types_in_formula (AQuant (_, xs, phi)) =
blanchet@42543
  1155
    union (op =) (map_filter snd xs) #> add_tff_types_in_formula phi
blanchet@42543
  1156
  | add_tff_types_in_formula (AConn (_, phis)) =
blanchet@42543
  1157
    fold add_tff_types_in_formula phis
blanchet@42543
  1158
  | add_tff_types_in_formula (AAtom _) = I
blanchet@42539
  1159
blanchet@42562
  1160
fun add_tff_types_in_problem_line (Decl (_, _, arg_Ts, res_T)) =
blanchet@42562
  1161
    union (op =) (res_T :: arg_Ts)
blanchet@42577
  1162
  | add_tff_types_in_problem_line (Formula (_, _, phi, _, _)) =
blanchet@42543
  1163
    add_tff_types_in_formula phi
blanchet@42543
  1164
blanchet@42543
  1165
fun tff_types_in_problem problem =
blanchet@42543
  1166
  fold (fold add_tff_types_in_problem_line o snd) problem []
blanchet@42543
  1167
blanchet@42545
  1168
fun decl_line_for_tff_type (s, s') =
blanchet@42568
  1169
  Decl (type_decl_prefix ^ ascii_of s, (s, s'), [], `I tptp_tff_type_of_types)
blanchet@42543
  1170
blanchet@42837
  1171
fun should_add_ti_ti_helper (Tags (Polymorphic, level, Heavy)) =
blanchet@42831
  1172
    level = Nonmonotonic_Types orelse level = Finite_Types
blanchet@42831
  1173
  | should_add_ti_ti_helper _ = false
blanchet@42831
  1174
blanchet@42543
  1175
val type_declsN = "Types"
blanchet@42544
  1176
val sym_declsN = "Symbol types"
blanchet@41157
  1177
val factsN = "Relevant facts"
blanchet@41157
  1178
val class_relsN = "Class relationships"
blanchet@42543
  1179
val aritiesN = "Arities"
blanchet@41157
  1180
val helpersN = "Helper facts"
blanchet@41157
  1181
val conjsN = "Conjectures"
blanchet@41313
  1182
val free_typesN = "Type variables"
blanchet@41157
  1183
blanchet@41157
  1184
fun offset_of_heading_in_problem _ [] j = j
blanchet@41157
  1185
  | offset_of_heading_in_problem needle ((heading, lines) :: problem) j =
blanchet@41157
  1186
    if heading = needle then j
blanchet@41157
  1187
    else offset_of_heading_in_problem needle problem (j + length lines)
blanchet@41157
  1188
blanchet@42709
  1189
fun prepare_atp_problem ctxt conj_sym_kind prem_kind type_sys explicit_apply
blanchet@42709
  1190
                        hyp_ts concl_t facts =
blanchet@38282
  1191
  let
blanchet@41313
  1192
    val (fact_names, (conjs, facts, class_rel_clauses, arity_clauses)) =
blanchet@42709
  1193
      translate_formulas ctxt prem_kind type_sys hyp_ts concl_t facts
blanchet@42563
  1194
    val sym_tab = conjs @ facts |> sym_table_for_facts explicit_apply
blanchet@42682
  1195
    val nonmono_Ts =
blanchet@42682
  1196
      [] |> fold (add_nonmonotonic_types_for_facts ctxt type_sys) [facts, conjs]
blanchet@42701
  1197
    val repair = repair_fact ctxt nonmono_Ts type_sys sym_tab
blanchet@42682
  1198
    val (conjs, facts) = (conjs, facts) |> pairself (map repair)
blanchet@42680
  1199
    val repaired_sym_tab = conjs @ facts |> sym_table_for_facts false
blanchet@42573
  1200
    val helpers =
blanchet@42682
  1201
      repaired_sym_tab |> helper_facts_for_sym_table ctxt type_sys |> map repair
blanchet@42680
  1202
    val sym_decl_lines =
blanchet@42731
  1203
      (conjs, helpers @ facts)
blanchet@42680
  1204
      |> sym_decl_table_for_facts type_sys repaired_sym_tab
blanchet@42709
  1205
      |> problem_lines_for_sym_decl_table ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42522
  1206
    (* Reordering these might confuse the proof reconstruction code or the SPASS
blanchet@42522
  1207
       Flotter hack. *)
blanchet@38282
  1208
    val problem =
blanchet@42561
  1209
      [(sym_declsN, sym_decl_lines),
blanchet@42680
  1210
       (factsN, map (formula_line_for_fact ctxt fact_prefix nonmono_Ts type_sys)
blanchet@42180
  1211
                    (0 upto length facts - 1 ~~ facts)),
blanchet@42545
  1212
       (class_relsN, map formula_line_for_class_rel_clause class_rel_clauses),
blanchet@42545
  1213
       (aritiesN, map formula_line_for_arity_clause arity_clauses),
blanchet@42680
  1214
       (helpersN, map (formula_line_for_fact ctxt helper_prefix nonmono_Ts
blanchet@42680
  1215
                                             type_sys)
blanchet@42563
  1216
                      (0 upto length helpers - 1 ~~ helpers)
blanchet@42831
  1217
                  |> should_add_ti_ti_helper type_sys
blanchet@42831
  1218
                     ? cons (ti_ti_helper_fact ())),
blanchet@42680
  1219
       (conjsN, map (formula_line_for_conjecture ctxt nonmono_Ts type_sys)
blanchet@42680
  1220
                    conjs),
blanchet@42545
  1221
       (free_typesN, formula_lines_for_free_types type_sys (facts @ conjs))]
blanchet@42543
  1222
    val problem =
blanchet@42561
  1223
      problem
blanchet@42682
  1224
      |> (case type_sys of
blanchet@42722
  1225
            Simple_Types _ =>
blanchet@42561
  1226
            cons (type_declsN,
blanchet@42561
  1227
                  map decl_line_for_tff_type (tff_types_in_problem problem))
blanchet@42682
  1228
          | _ => I)
blanchet@42646
  1229
    val (problem, pool) =
blanchet@42646
  1230
      problem |> nice_atp_problem (Config.get ctxt readable_names)
blanchet@42778
  1231
    fun add_sym_arity (s, {min_ary, ...} : sym_info) =
blanchet@42755
  1232
      if min_ary > 0 then
blanchet@42755
  1233
        case strip_prefix_and_unascii const_prefix s of
blanchet@42755
  1234
          SOME s => Symtab.insert (op =) (s, min_ary)
blanchet@42755
  1235
        | NONE => I
blanchet@42755
  1236
      else
blanchet@42755
  1237
        I
blanchet@38282
  1238
  in
blanchet@38282
  1239
    (problem,
blanchet@38282
  1240
     case pool of SOME the_pool => snd the_pool | NONE => Symtab.empty,
blanchet@42585
  1241
     offset_of_heading_in_problem conjsN problem 0,
blanchet@42541
  1242
     offset_of_heading_in_problem factsN problem 0,
blanchet@42755
  1243
     fact_names |> Vector.fromList,
blanchet@42755
  1244
     Symtab.empty |> Symtab.fold add_sym_arity sym_tab)
blanchet@38282
  1245
  end
blanchet@38282
  1246
blanchet@41313
  1247
(* FUDGE *)
blanchet@41313
  1248
val conj_weight = 0.0
blanchet@41770
  1249
val hyp_weight = 0.1
blanchet@41770
  1250
val fact_min_weight = 0.2
blanchet@41313
  1251
val fact_max_weight = 1.0
blanchet@42608
  1252
val type_info_default_weight = 0.8
blanchet@41313
  1253
blanchet@41313
  1254
fun add_term_weights weight (ATerm (s, tms)) =
blanchet@42734
  1255
  (not (is_atp_variable s) andalso s <> "equal" andalso
blanchet@42753
  1256
   not (String.isPrefix tptp_special_prefix s)) ? Symtab.default (s, weight)
blanchet@41313
  1257
  #> fold (add_term_weights weight) tms
blanchet@42577
  1258
fun add_problem_line_weights weight (Formula (_, _, phi, _, _)) =
blanchet@42834
  1259
    formula_fold NONE (K (add_term_weights weight)) phi
blanchet@42528
  1260
  | add_problem_line_weights _ _ = I
blanchet@41313
  1261
blanchet@41313
  1262
fun add_conjectures_weights [] = I
blanchet@41313
  1263
  | add_conjectures_weights conjs =
blanchet@41313
  1264
    let val (hyps, conj) = split_last conjs in
blanchet@41313
  1265
      add_problem_line_weights conj_weight conj
blanchet@41313
  1266
      #> fold (add_problem_line_weights hyp_weight) hyps
blanchet@41313
  1267
    end
blanchet@41313
  1268
blanchet@41313
  1269
fun add_facts_weights facts =
blanchet@41313
  1270
  let
blanchet@41313
  1271
    val num_facts = length facts
blanchet@41313
  1272
    fun weight_of j =
blanchet@41313
  1273
      fact_min_weight + (fact_max_weight - fact_min_weight) * Real.fromInt j
blanchet@41313
  1274
                        / Real.fromInt num_facts
blanchet@41313
  1275
  in
blanchet@41313
  1276
    map weight_of (0 upto num_facts - 1) ~~ facts
blanchet@41313
  1277
    |> fold (uncurry add_problem_line_weights)
blanchet@41313
  1278
  end
blanchet@41313
  1279
blanchet@41313
  1280
(* Weights are from 0.0 (most important) to 1.0 (least important). *)
blanchet@41313
  1281
fun atp_problem_weights problem =
blanchet@42608
  1282
  let val get = these o AList.lookup (op =) problem in
blanchet@42608
  1283
    Symtab.empty
blanchet@42608
  1284
    |> add_conjectures_weights (get free_typesN @ get conjsN)
blanchet@42608
  1285
    |> add_facts_weights (get factsN)
blanchet@42608
  1286
    |> fold (fold (add_problem_line_weights type_info_default_weight) o get)
blanchet@42608
  1287
            [sym_declsN, class_relsN, aritiesN]
blanchet@42608
  1288
    |> Symtab.dest
blanchet@42608
  1289
    |> sort (prod_ord Real.compare string_ord o pairself swap)
blanchet@42608
  1290
  end
blanchet@41313
  1291
blanchet@38282
  1292
end;