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