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