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