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