src/HOL/Tools/Sledgehammer/sledgehammer_atp_translate.ML
author blanchet
Mon May 02 14:40:57 2011 +0200 (2011-05-02)
changeset 42613 23b13b1bd565
parent 42612 bb9143d7e217
child 42640 879d2d6b05ce
permissions -rw-r--r--
use strings to encode type systems in ATP module, to reduce the amount of out-of-place information and also to make it easier to print the type system used
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@38282
    12
  type 'a problem = 'a ATP_Problem.problem
blanchet@42613
    13
blanchet@42613
    14
  datatype polymorphism = Polymorphic | Monomorphic | Mangled_Monomorphic
blanchet@42613
    15
  datatype type_level =
blanchet@42613
    16
    All_Types | Nonmonotonic_Types | Finite_Types | Const_Arg_Types | No_Types
blanchet@42613
    17
blanchet@42613
    18
  datatype type_system =
blanchet@42613
    19
    Many_Typed |
blanchet@42613
    20
    Preds of polymorphism * type_level |
blanchet@42613
    21
    Tags of polymorphism * type_level
blanchet@42613
    22
blanchet@40114
    23
  type translated_formula
blanchet@38282
    24
blanchet@42568
    25
  val readable_names : bool Unsynchronized.ref
blanchet@40204
    26
  val fact_prefix : string
blanchet@38282
    27
  val conjecture_prefix : string
blanchet@42568
    28
  val predicator_base : string
blanchet@42544
    29
  val explicit_app_base : string
blanchet@42549
    30
  val type_pred_base : string
blanchet@42562
    31
  val tff_type_prefix : string
blanchet@42613
    32
  val type_sys_from_string : string -> type_system
blanchet@42613
    33
  val polymorphism_of_type_sys : type_system -> polymorphism
blanchet@42613
    34
  val level_of_type_sys : type_system -> type_level
blanchet@42613
    35
  val is_type_sys_virtually_sound : type_system -> bool
blanchet@42613
    36
  val is_type_sys_fairly_sound : type_system -> bool
blanchet@41136
    37
  val num_atp_type_args : theory -> type_system -> string -> int
blanchet@42542
    38
  val unmangled_const : string -> string * string fo_term list
blanchet@41088
    39
  val translate_atp_fact :
blanchet@42544
    40
    Proof.context -> bool -> (string * 'a) * thm
blanchet@41091
    41
    -> translated_formula option * ((string * 'a) * thm)
blanchet@40059
    42
  val prepare_atp_problem :
blanchet@42568
    43
    Proof.context -> type_system -> bool -> term list -> term
blanchet@41091
    44
    -> (translated_formula option * ((string * 'a) * thm)) list
blanchet@42541
    45
    -> string problem * string Symtab.table * int * int
blanchet@42541
    46
       * (string * 'a) list vector
blanchet@41313
    47
  val atp_problem_weights : string problem -> (string * real) list
blanchet@38282
    48
end;
blanchet@38282
    49
blanchet@41140
    50
structure Sledgehammer_ATP_Translate : SLEDGEHAMMER_ATP_TRANSLATE =
blanchet@38282
    51
struct
blanchet@38282
    52
blanchet@38282
    53
open ATP_Problem
blanchet@39494
    54
open Metis_Translate
blanchet@38282
    55
open Sledgehammer_Util
blanchet@38282
    56
blanchet@42568
    57
(* Readable names are often much shorter, especially if types are mangled in
blanchet@42589
    58
   names. Also, the logic for generating legal SNARK sort names is only
blanchet@42589
    59
   implemented for readable names. Finally, readable names are, well, more
blanchet@42589
    60
   readable. For these reason, they are enabled by default. *)
blanchet@42568
    61
val readable_names = Unsynchronized.ref true
blanchet@42568
    62
blanchet@42543
    63
val type_decl_prefix = "type_"
blanchet@42543
    64
val sym_decl_prefix = "sym_"
blanchet@40204
    65
val fact_prefix = "fact_"
blanchet@38282
    66
val conjecture_prefix = "conj_"
blanchet@38282
    67
val helper_prefix = "help_"
blanchet@42543
    68
val class_rel_clause_prefix = "crel_";
blanchet@38282
    69
val arity_clause_prefix = "arity_"
blanchet@39975
    70
val tfree_prefix = "tfree_"
blanchet@38282
    71
blanchet@42568
    72
val predicator_base = "hBOOL"
blanchet@42544
    73
val explicit_app_base = "hAPP"
blanchet@42542
    74
val type_pred_base = "is"
blanchet@42562
    75
val tff_type_prefix = "ty_"
blanchet@42531
    76
blanchet@42562
    77
fun make_tff_type s = tff_type_prefix ^ ascii_of s
blanchet@42531
    78
blanchet@42568
    79
(* official TPTP syntax *)
blanchet@42568
    80
val tptp_tff_type_of_types = "$tType"
blanchet@42568
    81
val tptp_tff_bool_type = "$o"
blanchet@42568
    82
val tptp_false = "$false"
blanchet@42568
    83
val tptp_true = "$true"
blanchet@42534
    84
blanchet@38282
    85
(* Freshness almost guaranteed! *)
blanchet@38282
    86
val sledgehammer_weak_prefix = "Sledgehammer:"
blanchet@38282
    87
blanchet@42613
    88
datatype polymorphism = Polymorphic | Monomorphic | Mangled_Monomorphic
blanchet@42613
    89
datatype type_level =
blanchet@42613
    90
  All_Types | Nonmonotonic_Types | Finite_Types | Const_Arg_Types | No_Types
blanchet@42613
    91
blanchet@42613
    92
datatype type_system =
blanchet@42613
    93
  Many_Typed |
blanchet@42613
    94
  Preds of polymorphism * type_level |
blanchet@42613
    95
  Tags of polymorphism * type_level
blanchet@42613
    96
blanchet@42613
    97
fun type_sys_from_string s =
blanchet@42613
    98
  (case try (unprefix "mangled_") s of
blanchet@42613
    99
     SOME s => (Mangled_Monomorphic, s)
blanchet@42613
   100
   | NONE =>
blanchet@42613
   101
     case try (unprefix "mono_") s of
blanchet@42613
   102
       SOME s => (Monomorphic, s)
blanchet@42613
   103
     | NONE => (Polymorphic, s))
blanchet@42613
   104
  ||> (fn s =>
blanchet@42613
   105
          case try (unsuffix " ?") s of
blanchet@42613
   106
            SOME s => (Nonmonotonic_Types, s)
blanchet@42613
   107
          | NONE =>
blanchet@42613
   108
            case try (unsuffix " !") s of
blanchet@42613
   109
              SOME s => (Finite_Types, s)
blanchet@42613
   110
            | NONE => (All_Types, s))
blanchet@42613
   111
  |> (fn (polymorphism, (level, core)) =>
blanchet@42613
   112
         case (core, (polymorphism, level)) of
blanchet@42613
   113
           ("many_typed", (Polymorphic (* naja *), All_Types)) =>
blanchet@42613
   114
           Many_Typed
blanchet@42613
   115
         | ("preds", extra) => Preds extra
blanchet@42613
   116
         | ("tags", extra) => Tags extra
blanchet@42613
   117
         | ("const_args", (_, All_Types (* naja *))) =>
blanchet@42613
   118
           Preds (polymorphism, Const_Arg_Types)
blanchet@42613
   119
         | ("erased", (Polymorphic, All_Types (* naja *))) =>
blanchet@42613
   120
           Preds (polymorphism, No_Types)
blanchet@42613
   121
         | _ => error ("Unknown type system: " ^ quote s ^ "."))
blanchet@42613
   122
blanchet@42613
   123
fun polymorphism_of_type_sys Many_Typed = Mangled_Monomorphic
blanchet@42613
   124
  | polymorphism_of_type_sys (Preds (poly, _)) = poly
blanchet@42613
   125
  | polymorphism_of_type_sys (Tags (poly, _)) = poly
blanchet@42613
   126
blanchet@42613
   127
fun level_of_type_sys Many_Typed = All_Types
blanchet@42613
   128
  | level_of_type_sys (Preds (_, level)) = level
blanchet@42613
   129
  | level_of_type_sys (Tags (_, level)) = level
blanchet@42613
   130
blanchet@42613
   131
val is_type_level_virtually_sound =
blanchet@42613
   132
  member (op =) [All_Types, Nonmonotonic_Types]
blanchet@42613
   133
val is_type_sys_virtually_sound =
blanchet@42613
   134
  is_type_level_virtually_sound o level_of_type_sys
blanchet@42613
   135
blanchet@42613
   136
fun is_type_level_fairly_sound level =
blanchet@42613
   137
  is_type_level_virtually_sound level orelse level = Finite_Types
blanchet@42613
   138
val is_type_sys_fairly_sound = is_type_level_fairly_sound o level_of_type_sys
blanchet@42613
   139
blanchet@42573
   140
fun formula_map f (AQuant (q, xs, phi)) = AQuant (q, xs, formula_map f phi)
blanchet@42573
   141
  | formula_map f (AConn (c, phis)) = AConn (c, map (formula_map f) phis)
blanchet@42573
   142
  | formula_map f (AAtom tm) = AAtom (f tm)
blanchet@42573
   143
blanchet@42573
   144
fun formula_fold f (AQuant (_, _, phi)) = formula_fold f phi
blanchet@42573
   145
  | formula_fold f (AConn (_, phis)) = fold (formula_fold f) phis
blanchet@42573
   146
  | formula_fold f (AAtom tm) = f tm
blanchet@42573
   147
blanchet@40114
   148
type translated_formula =
blanchet@38752
   149
  {name: string,
blanchet@42525
   150
   kind: formula_kind,
blanchet@42562
   151
   combformula: (name, typ, combterm) formula,
blanchet@42562
   152
   atomic_types: typ list}
blanchet@38282
   153
blanchet@42558
   154
fun update_combformula f
blanchet@42562
   155
        ({name, kind, combformula, atomic_types} : translated_formula) =
blanchet@42542
   156
  {name = name, kind = kind, combformula = f combformula,
blanchet@42562
   157
   atomic_types = atomic_types} : translated_formula
blanchet@42542
   158
blanchet@42558
   159
fun fact_lift f ({combformula, ...} : translated_formula) = f combformula
blanchet@42558
   160
blanchet@42572
   161
val boring_consts = [explicit_app_base, @{const_name Metis.fequal}]
blanchet@42572
   162
blanchet@42572
   163
fun should_omit_type_args type_sys s =
blanchet@42589
   164
  s <> type_pred_base andalso s <> type_tag_name andalso
blanchet@42589
   165
  (s = @{const_name HOL.eq} orelse level_of_type_sys type_sys = No_Types orelse
blanchet@42589
   166
   (case type_sys of
blanchet@42589
   167
      Tags (_, All_Types) => true
blanchet@42589
   168
    | _ => polymorphism_of_type_sys type_sys <> Mangled_Monomorphic andalso
blanchet@42589
   169
           member (op =) boring_consts s))
blanchet@42589
   170
  
blanchet@42589
   171
datatype type_arg_policy = No_Type_Args | Explicit_Type_Args | Mangled_Type_Args
blanchet@41136
   172
blanchet@42589
   173
fun general_type_arg_policy type_sys =
blanchet@42589
   174
  if level_of_type_sys type_sys = No_Types then
blanchet@42589
   175
    No_Type_Args
blanchet@42589
   176
  else if polymorphism_of_type_sys type_sys = Mangled_Monomorphic then
blanchet@42589
   177
    Mangled_Type_Args
blanchet@42589
   178
  else
blanchet@42589
   179
    Explicit_Type_Args
blanchet@42563
   180
blanchet@42524
   181
fun type_arg_policy type_sys s =
blanchet@42572
   182
  if should_omit_type_args type_sys s then No_Type_Args
blanchet@42563
   183
  else general_type_arg_policy type_sys
blanchet@42227
   184
blanchet@41136
   185
fun num_atp_type_args thy type_sys s =
blanchet@42557
   186
  if type_arg_policy type_sys s = Explicit_Type_Args then num_type_args thy s
blanchet@42557
   187
  else 0
blanchet@41136
   188
blanchet@42353
   189
fun atp_type_literals_for_types type_sys kind Ts =
blanchet@42589
   190
  if level_of_type_sys type_sys = No_Types then
blanchet@42353
   191
    []
blanchet@42353
   192
  else
blanchet@42353
   193
    Ts |> type_literals_for_types
blanchet@42353
   194
       |> filter (fn TyLitVar _ => kind <> Conjecture
blanchet@42353
   195
                   | TyLitFree _ => kind = Conjecture)
blanchet@41137
   196
blanchet@38282
   197
fun mk_aconn c phi1 phi2 = AConn (c, [phi1, phi2])
blanchet@42534
   198
fun mk_aconns c phis =
blanchet@42534
   199
  let val (phis', phi') = split_last phis in
blanchet@42534
   200
    fold_rev (mk_aconn c) phis' phi'
blanchet@42534
   201
  end
blanchet@38282
   202
fun mk_ahorn [] phi = phi
blanchet@42534
   203
  | mk_ahorn phis psi = AConn (AImplies, [mk_aconns AAnd phis, psi])
blanchet@42522
   204
fun mk_aquant _ [] phi = phi
blanchet@42522
   205
  | mk_aquant q xs (phi as AQuant (q', xs', phi')) =
blanchet@42522
   206
    if q = q' then AQuant (q, xs @ xs', phi') else AQuant (q, xs, phi)
blanchet@42522
   207
  | mk_aquant q xs phi = AQuant (q, xs, phi)
blanchet@38282
   208
blanchet@42522
   209
fun close_universally atom_vars phi =
blanchet@41145
   210
  let
blanchet@41145
   211
    fun formula_vars bounds (AQuant (_, xs, phi)) =
blanchet@42526
   212
        formula_vars (map fst xs @ bounds) phi
blanchet@41145
   213
      | formula_vars bounds (AConn (_, phis)) = fold (formula_vars bounds) phis
blanchet@42522
   214
      | formula_vars bounds (AAtom tm) =
blanchet@42526
   215
        union (op =) (atom_vars tm []
blanchet@42526
   216
                      |> filter_out (member (op =) bounds o fst))
blanchet@42522
   217
  in mk_aquant AForall (formula_vars [] phi []) phi end
blanchet@42522
   218
blanchet@42531
   219
fun combterm_vars (CombApp (tm1, tm2)) = fold combterm_vars [tm1, tm2]
blanchet@42522
   220
  | combterm_vars (CombConst _) = I
blanchet@42574
   221
  | combterm_vars (CombVar (name, T)) = insert (op =) (name, SOME T)
blanchet@42522
   222
val close_combformula_universally = close_universally combterm_vars
blanchet@42522
   223
blanchet@42522
   224
fun term_vars (ATerm (name as (s, _), tms)) =
blanchet@42531
   225
  is_atp_variable s ? insert (op =) (name, NONE)
blanchet@42526
   226
  #> fold term_vars tms
blanchet@42522
   227
val close_formula_universally = close_universally term_vars
blanchet@41145
   228
blanchet@42562
   229
fun fo_term_from_typ (Type (s, Ts)) =
blanchet@42562
   230
    ATerm (`make_fixed_type_const s, map fo_term_from_typ Ts)
blanchet@42562
   231
  | fo_term_from_typ (TFree (s, _)) =
blanchet@42562
   232
    ATerm (`make_fixed_type_var s, [])
blanchet@42562
   233
  | fo_term_from_typ (TVar ((x as (s, _)), _)) =
blanchet@42562
   234
    ATerm ((make_schematic_type_var x, s), [])
blanchet@42562
   235
blanchet@42562
   236
(* This shouldn't clash with anything else. *)
blanchet@42542
   237
val mangled_type_sep = "\000"
blanchet@42542
   238
blanchet@42562
   239
fun generic_mangled_type_name f (ATerm (name, [])) = f name
blanchet@42562
   240
  | generic_mangled_type_name f (ATerm (name, tys)) =
blanchet@42562
   241
    f name ^ "(" ^ commas (map (generic_mangled_type_name f) tys) ^ ")"
blanchet@42562
   242
val mangled_type_name =
blanchet@42562
   243
  fo_term_from_typ
blanchet@42562
   244
  #> (fn ty => (make_tff_type (generic_mangled_type_name fst ty),
blanchet@42562
   245
                generic_mangled_type_name snd ty))
blanchet@42542
   246
blanchet@42574
   247
fun generic_mangled_type_suffix f g Ts =
blanchet@42542
   248
  fold_rev (curry (op ^) o g o prefix mangled_type_sep
blanchet@42574
   249
            o generic_mangled_type_name f) Ts ""
blanchet@42562
   250
fun mangled_const_name T_args (s, s') =
blanchet@42562
   251
  let val ty_args = map fo_term_from_typ T_args in
blanchet@42562
   252
    (s ^ generic_mangled_type_suffix fst ascii_of ty_args,
blanchet@42562
   253
     s' ^ generic_mangled_type_suffix snd I ty_args)
blanchet@42562
   254
  end
blanchet@42542
   255
blanchet@42542
   256
val parse_mangled_ident =
blanchet@42542
   257
  Scan.many1 (not o member (op =) ["(", ")", ","]) >> implode
blanchet@42542
   258
blanchet@42542
   259
fun parse_mangled_type x =
blanchet@42542
   260
  (parse_mangled_ident
blanchet@42542
   261
   -- Scan.optional ($$ "(" |-- Scan.optional parse_mangled_types [] --| $$ ")")
blanchet@42542
   262
                    [] >> ATerm) x
blanchet@42542
   263
and parse_mangled_types x =
blanchet@42542
   264
  (parse_mangled_type ::: Scan.repeat ($$ "," |-- parse_mangled_type)) x
blanchet@42542
   265
blanchet@42542
   266
fun unmangled_type s =
blanchet@42542
   267
  s |> suffix ")" |> raw_explode
blanchet@42542
   268
    |> Scan.finite Symbol.stopper
blanchet@42542
   269
           (Scan.error (!! (fn _ => raise Fail ("unrecognized mangled type " ^
blanchet@42542
   270
                                                quote s)) parse_mangled_type))
blanchet@42542
   271
    |> fst
blanchet@42542
   272
blanchet@42561
   273
val unmangled_const_name = space_explode mangled_type_sep #> hd
blanchet@42542
   274
fun unmangled_const s =
blanchet@42542
   275
  let val ss = space_explode mangled_type_sep s in
blanchet@42542
   276
    (hd ss, map unmangled_type (tl ss))
blanchet@42542
   277
  end
blanchet@42542
   278
blanchet@42568
   279
val introduce_proxies =
blanchet@42568
   280
  let
blanchet@42568
   281
    fun aux top_level (CombApp (tm1, tm2)) =
blanchet@42568
   282
        CombApp (aux top_level tm1, aux false tm2)
blanchet@42574
   283
      | aux top_level (CombConst (name as (s, s'), T, T_args)) =
blanchet@42570
   284
        (case proxify_const s of
blanchet@42568
   285
           SOME proxy_base =>
blanchet@42568
   286
           if top_level then
blanchet@42568
   287
             (case s of
blanchet@42568
   288
                "c_False" => (tptp_false, s')
blanchet@42568
   289
              | "c_True" => (tptp_true, s')
blanchet@42568
   290
              | _ => name, [])
blanchet@42569
   291
           else
blanchet@42574
   292
             (proxy_base |>> prefix const_prefix, T_args)
blanchet@42574
   293
          | NONE => (name, T_args))
blanchet@42574
   294
        |> (fn (name, T_args) => CombConst (name, T, T_args))
blanchet@42568
   295
      | aux _ tm = tm
blanchet@42568
   296
  in aux true end
blanchet@42568
   297
blanchet@42562
   298
fun combformula_from_prop thy eq_as_iff =
blanchet@38282
   299
  let
blanchet@42568
   300
    fun do_term bs t atomic_types =
blanchet@41140
   301
      combterm_from_term thy bs (Envir.eta_contract t)
blanchet@42568
   302
      |>> (introduce_proxies #> AAtom)
blanchet@42568
   303
      ||> union (op =) atomic_types
blanchet@38282
   304
    fun do_quant bs q s T t' =
blanchet@38518
   305
      let val s = Name.variant (map fst bs) s in
blanchet@38518
   306
        do_formula ((s, T) :: bs) t'
blanchet@42562
   307
        #>> mk_aquant q [(`make_bound_var s, SOME T)]
blanchet@38518
   308
      end
blanchet@38282
   309
    and do_conn bs c t1 t2 =
blanchet@38282
   310
      do_formula bs t1 ##>> do_formula bs t2
blanchet@42531
   311
      #>> uncurry (mk_aconn c)
blanchet@38282
   312
    and do_formula bs t =
blanchet@38282
   313
      case t of
blanchet@42531
   314
        @{const Not} $ t1 => do_formula bs t1 #>> mk_anot
blanchet@38282
   315
      | Const (@{const_name All}, _) $ Abs (s, T, t') =>
blanchet@38282
   316
        do_quant bs AForall s T t'
blanchet@38282
   317
      | Const (@{const_name Ex}, _) $ Abs (s, T, t') =>
blanchet@38282
   318
        do_quant bs AExists s T t'
haftmann@38795
   319
      | @{const HOL.conj} $ t1 $ t2 => do_conn bs AAnd t1 t2
haftmann@38795
   320
      | @{const HOL.disj} $ t1 $ t2 => do_conn bs AOr t1 t2
haftmann@38786
   321
      | @{const HOL.implies} $ t1 $ t2 => do_conn bs AImplies t1 t2
haftmann@38864
   322
      | Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 =>
blanchet@41140
   323
        if eq_as_iff then do_conn bs AIff t1 t2 else do_term bs t
blanchet@41140
   324
      | _ => do_term bs t
blanchet@38282
   325
  in do_formula [] end
blanchet@38282
   326
blanchet@38618
   327
val presimplify_term = prop_of o Meson.presimplify oo Skip_Proof.make_thm
blanchet@38282
   328
wenzelm@41491
   329
fun concealed_bound_name j = sledgehammer_weak_prefix ^ string_of_int j
blanchet@38282
   330
fun conceal_bounds Ts t =
blanchet@38282
   331
  subst_bounds (map (Free o apfst concealed_bound_name)
blanchet@38282
   332
                    (0 upto length Ts - 1 ~~ Ts), t)
blanchet@38282
   333
fun reveal_bounds Ts =
blanchet@38282
   334
  subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j))
blanchet@38282
   335
                    (0 upto length Ts - 1 ~~ Ts))
blanchet@38282
   336
blanchet@38608
   337
(* Removes the lambdas from an equation of the form "t = (%x. u)".
blanchet@39890
   338
   (Cf. "extensionalize_theorem" in "Meson_Clausify".) *)
blanchet@38608
   339
fun extensionalize_term t =
blanchet@38608
   340
  let
blanchet@38608
   341
    fun aux j (@{const Trueprop} $ t') = @{const Trueprop} $ aux j t'
blanchet@38608
   342
      | aux j (t as Const (s, Type (_, [Type (_, [_, T']),
blanchet@38608
   343
                                        Type (_, [_, res_T])]))
blanchet@38608
   344
                    $ t2 $ Abs (var_s, var_T, t')) =
haftmann@38864
   345
        if s = @{const_name HOL.eq} orelse s = @{const_name "=="} then
blanchet@38608
   346
          let val var_t = Var ((var_s, j), var_T) in
blanchet@38608
   347
            Const (s, T' --> T' --> res_T)
blanchet@38608
   348
              $ betapply (t2, var_t) $ subst_bound (var_t, t')
blanchet@38608
   349
            |> aux (j + 1)
blanchet@38608
   350
          end
blanchet@38608
   351
        else
blanchet@38608
   352
          t
blanchet@38608
   353
      | aux _ t = t
blanchet@38608
   354
  in aux (maxidx_of_term t + 1) t end
blanchet@38608
   355
blanchet@38282
   356
fun introduce_combinators_in_term ctxt kind t =
wenzelm@42361
   357
  let val thy = Proof_Context.theory_of ctxt in
blanchet@38491
   358
    if Meson.is_fol_term thy t then
blanchet@38491
   359
      t
blanchet@38491
   360
    else
blanchet@38491
   361
      let
blanchet@38491
   362
        fun aux Ts t =
blanchet@38491
   363
          case t of
blanchet@38491
   364
            @{const Not} $ t1 => @{const Not} $ aux Ts t1
blanchet@38491
   365
          | (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') =>
blanchet@38491
   366
            t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38652
   367
          | (t0 as Const (@{const_name All}, _)) $ t1 =>
blanchet@38652
   368
            aux Ts (t0 $ eta_expand Ts t1 1)
blanchet@38491
   369
          | (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') =>
blanchet@38491
   370
            t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38652
   371
          | (t0 as Const (@{const_name Ex}, _)) $ t1 =>
blanchet@38652
   372
            aux Ts (t0 $ eta_expand Ts t1 1)
haftmann@38795
   373
          | (t0 as @{const HOL.conj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38795
   374
          | (t0 as @{const HOL.disj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38786
   375
          | (t0 as @{const HOL.implies}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38864
   376
          | (t0 as Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])))
blanchet@38491
   377
              $ t1 $ t2 =>
blanchet@38491
   378
            t0 $ aux Ts t1 $ aux Ts t2
blanchet@38491
   379
          | _ => if not (exists_subterm (fn Abs _ => true | _ => false) t) then
blanchet@38491
   380
                   t
blanchet@38491
   381
                 else
blanchet@38491
   382
                   t |> conceal_bounds Ts
blanchet@38491
   383
                     |> Envir.eta_contract
blanchet@38491
   384
                     |> cterm_of thy
blanchet@39890
   385
                     |> Meson_Clausify.introduce_combinators_in_cterm
blanchet@38491
   386
                     |> prop_of |> Logic.dest_equals |> snd
blanchet@38491
   387
                     |> reveal_bounds Ts
blanchet@39370
   388
        val (t, ctxt') = Variable.import_terms true [t] ctxt |>> the_single
blanchet@38491
   389
      in t |> aux [] |> singleton (Variable.export_terms ctxt' ctxt) end
blanchet@38491
   390
      handle THM _ =>
blanchet@38491
   391
             (* A type variable of sort "{}" will make abstraction fail. *)
blanchet@38613
   392
             if kind = Conjecture then HOLogic.false_const
blanchet@38613
   393
             else HOLogic.true_const
blanchet@38491
   394
  end
blanchet@38282
   395
blanchet@38282
   396
(* Metis's use of "resolve_tac" freezes the schematic variables. We simulate the
blanchet@42353
   397
   same in Sledgehammer to prevent the discovery of unreplayable proofs. *)
blanchet@38282
   398
fun freeze_term t =
blanchet@38282
   399
  let
blanchet@38282
   400
    fun aux (t $ u) = aux t $ aux u
blanchet@38282
   401
      | aux (Abs (s, T, t)) = Abs (s, T, aux t)
blanchet@38282
   402
      | aux (Var ((s, i), T)) =
blanchet@38282
   403
        Free (sledgehammer_weak_prefix ^ s ^ "_" ^ string_of_int i, T)
blanchet@38282
   404
      | aux t = t
blanchet@38282
   405
  in t |> exists_subterm is_Var t ? aux end
blanchet@38282
   406
blanchet@40204
   407
(* making fact and conjecture formulas *)
blanchet@42544
   408
fun make_formula ctxt eq_as_iff presimp name kind t =
blanchet@38282
   409
  let
wenzelm@42361
   410
    val thy = Proof_Context.theory_of ctxt
blanchet@38608
   411
    val t = t |> Envir.beta_eta_contract
blanchet@38652
   412
              |> transform_elim_term
blanchet@41211
   413
              |> Object_Logic.atomize_term thy
blanchet@42563
   414
    val need_trueprop = (fastype_of t = @{typ bool})
blanchet@38652
   415
    val t = t |> need_trueprop ? HOLogic.mk_Trueprop
blanchet@38282
   416
              |> extensionalize_term
blanchet@38282
   417
              |> presimp ? presimplify_term thy
blanchet@38282
   418
              |> perhaps (try (HOLogic.dest_Trueprop))
blanchet@38282
   419
              |> introduce_combinators_in_term ctxt kind
blanchet@38613
   420
              |> kind <> Axiom ? freeze_term
blanchet@42562
   421
    val (combformula, atomic_types) =
blanchet@42562
   422
      combformula_from_prop thy eq_as_iff t []
blanchet@38282
   423
  in
blanchet@38752
   424
    {name = name, combformula = combformula, kind = kind,
blanchet@42562
   425
     atomic_types = atomic_types}
blanchet@38282
   426
  end
blanchet@38282
   427
blanchet@42561
   428
fun make_fact ctxt keep_trivial eq_as_iff presimp ((name, _), t) =
blanchet@42561
   429
  case (keep_trivial, make_formula ctxt eq_as_iff presimp name Axiom t) of
blanchet@41990
   430
    (false, {combformula = AAtom (CombConst (("c_True", _), _, _)), ...}) =>
blanchet@41990
   431
    NONE
blanchet@41990
   432
  | (_, formula) => SOME formula
blanchet@42561
   433
blanchet@42544
   434
fun make_conjecture ctxt ts =
blanchet@38613
   435
  let val last = length ts - 1 in
blanchet@42544
   436
    map2 (fn j => make_formula ctxt true true (string_of_int j)
blanchet@38613
   437
                               (if j = last then Conjecture else Hypothesis))
blanchet@38613
   438
         (0 upto last) ts
blanchet@38613
   439
  end
blanchet@38282
   440
blanchet@42573
   441
(** "hBOOL" and "hAPP" **)
blanchet@41313
   442
blanchet@42574
   443
type sym_info =
blanchet@42563
   444
  {pred_sym : bool, min_ary : int, max_ary : int, typ : typ option}
blanchet@42563
   445
blanchet@42574
   446
fun add_combterm_syms_to_table explicit_apply =
blanchet@42558
   447
  let
blanchet@42558
   448
    fun aux top_level tm =
blanchet@42558
   449
      let val (head, args) = strip_combterm_comb tm in
blanchet@42558
   450
        (case head of
blanchet@42563
   451
           CombConst ((s, _), T, _) =>
blanchet@42558
   452
           if String.isPrefix bound_var_prefix s then
blanchet@42558
   453
             I
blanchet@42558
   454
           else
blanchet@42563
   455
             let val ary = length args in
blanchet@42558
   456
               Symtab.map_default
blanchet@42558
   457
                   (s, {pred_sym = true,
blanchet@42563
   458
                        min_ary = if explicit_apply then 0 else ary,
blanchet@42563
   459
                        max_ary = 0, typ = SOME T})
blanchet@42563
   460
                   (fn {pred_sym, min_ary, max_ary, typ} =>
blanchet@42558
   461
                       {pred_sym = pred_sym andalso top_level,
blanchet@42563
   462
                        min_ary = Int.min (ary, min_ary),
blanchet@42563
   463
                        max_ary = Int.max (ary, max_ary),
blanchet@42563
   464
                        typ = if typ = SOME T then typ else NONE})
blanchet@42558
   465
            end
blanchet@42558
   466
         | _ => I)
blanchet@42558
   467
        #> fold (aux false) args
blanchet@42558
   468
      end
blanchet@42558
   469
  in aux true end
blanchet@42574
   470
val add_fact_syms_to_table =
blanchet@42574
   471
  fact_lift o formula_fold o add_combterm_syms_to_table
blanchet@38282
   472
blanchet@42557
   473
val default_sym_table_entries =
blanchet@42563
   474
  [("equal", {pred_sym = true, min_ary = 2, max_ary = 2, typ = NONE}),
blanchet@42568
   475
   (make_fixed_const predicator_base,
blanchet@42563
   476
    {pred_sym = true, min_ary = 1, max_ary = 1, typ = NONE})] @
blanchet@42568
   477
  ([tptp_false, tptp_true]
blanchet@42563
   478
   |> map (rpair {pred_sym = true, min_ary = 0, max_ary = 0, typ = NONE}))
blanchet@41140
   479
blanchet@42544
   480
fun sym_table_for_facts explicit_apply facts =
blanchet@42568
   481
  Symtab.empty |> fold Symtab.default default_sym_table_entries
blanchet@42574
   482
               |> fold (add_fact_syms_to_table explicit_apply) facts
blanchet@38282
   483
blanchet@42558
   484
fun min_arity_of sym_tab s =
blanchet@42558
   485
  case Symtab.lookup sym_tab s of
blanchet@42574
   486
    SOME ({min_ary, ...} : sym_info) => min_ary
blanchet@42558
   487
  | NONE =>
blanchet@42558
   488
    case strip_prefix_and_unascii const_prefix s of
blanchet@42547
   489
      SOME s =>
blanchet@42570
   490
      let val s = s |> unmangled_const_name |> invert_const in
blanchet@42568
   491
        if s = predicator_base then 1
blanchet@42547
   492
        else if s = explicit_app_base then 2
blanchet@42547
   493
        else if s = type_pred_base then 1
blanchet@42557
   494
        else 0
blanchet@42547
   495
      end
blanchet@42544
   496
    | NONE => 0
blanchet@38282
   497
blanchet@38282
   498
(* True if the constant ever appears outside of the top-level position in
blanchet@38282
   499
   literals, or if it appears with different arities (e.g., because of different
blanchet@38282
   500
   type instantiations). If false, the constant always receives all of its
blanchet@38282
   501
   arguments and is used as a predicate. *)
blanchet@42558
   502
fun is_pred_sym sym_tab s =
blanchet@42558
   503
  case Symtab.lookup sym_tab s of
blanchet@42574
   504
    SOME ({pred_sym, min_ary, max_ary, ...} : sym_info) =>
blanchet@42574
   505
    pred_sym andalso min_ary = max_ary
blanchet@42558
   506
  | NONE => false
blanchet@38282
   507
blanchet@42568
   508
val predicator_combconst =
blanchet@42568
   509
  CombConst (`make_fixed_const predicator_base, @{typ "bool => bool"}, [])
blanchet@42568
   510
fun predicator tm = CombApp (predicator_combconst, tm)
blanchet@42542
   511
blanchet@42568
   512
fun introduce_predicators_in_combterm sym_tab tm =
blanchet@42542
   513
  case strip_combterm_comb tm of
blanchet@42542
   514
    (CombConst ((s, _), _, _), _) =>
blanchet@42568
   515
    if is_pred_sym sym_tab s then tm else predicator tm
blanchet@42568
   516
  | _ => predicator tm
blanchet@42542
   517
blanchet@42544
   518
fun list_app head args = fold (curry (CombApp o swap)) args head
blanchet@42544
   519
blanchet@42544
   520
fun explicit_app arg head =
blanchet@42544
   521
  let
blanchet@42562
   522
    val head_T = combtyp_of head
blanchet@42562
   523
    val (arg_T, res_T) = dest_funT head_T
blanchet@42544
   524
    val explicit_app =
blanchet@42562
   525
      CombConst (`make_fixed_const explicit_app_base, head_T --> head_T,
blanchet@42562
   526
                 [arg_T, res_T])
blanchet@42544
   527
  in list_app explicit_app [head, arg] end
blanchet@42544
   528
fun list_explicit_app head args = fold explicit_app args head
blanchet@38282
   529
blanchet@42565
   530
fun introduce_explicit_apps_in_combterm sym_tab =
blanchet@42544
   531
  let
blanchet@42544
   532
    fun aux tm =
blanchet@42544
   533
      case strip_combterm_comb tm of
blanchet@42544
   534
        (head as CombConst ((s, _), _, _), args) =>
blanchet@42544
   535
        args |> map aux
blanchet@42557
   536
             |> chop (min_arity_of sym_tab s)
blanchet@42544
   537
             |>> list_app head
blanchet@42544
   538
             |-> list_explicit_app
blanchet@42544
   539
      | (head, args) => list_explicit_app head (map aux args)
blanchet@42544
   540
  in aux end
blanchet@38282
   541
blanchet@42573
   542
fun impose_type_arg_policy_in_combterm type_sys =
blanchet@42573
   543
  let
blanchet@42573
   544
    fun aux (CombApp tmp) = CombApp (pairself aux tmp)
blanchet@42574
   545
      | aux (CombConst (name as (s, _), T, T_args)) =
blanchet@42573
   546
        (case strip_prefix_and_unascii const_prefix s of
blanchet@42574
   547
           NONE => (name, T_args)
blanchet@42573
   548
         | SOME s'' =>
blanchet@42573
   549
           let val s'' = invert_const s'' in
blanchet@42573
   550
             case type_arg_policy type_sys s'' of
blanchet@42573
   551
               No_Type_Args => (name, [])
blanchet@42574
   552
             | Explicit_Type_Args => (name, T_args)
blanchet@42589
   553
             | Mangled_Type_Args => (mangled_const_name T_args name, [])
blanchet@42573
   554
           end)
blanchet@42574
   555
        |> (fn (name, T_args) => CombConst (name, T, T_args))
blanchet@42573
   556
      | aux tm = tm
blanchet@42573
   557
  in aux end
blanchet@42573
   558
blanchet@42573
   559
fun repair_combterm type_sys sym_tab =
blanchet@42565
   560
  introduce_explicit_apps_in_combterm sym_tab
blanchet@42568
   561
  #> introduce_predicators_in_combterm sym_tab
blanchet@42573
   562
  #> impose_type_arg_policy_in_combterm type_sys
blanchet@42573
   563
val repair_fact = update_combformula o formula_map oo repair_combterm
blanchet@42573
   564
blanchet@42573
   565
(** Helper facts **)
blanchet@42573
   566
blanchet@42573
   567
fun ti_ti_helper_fact () =
blanchet@42573
   568
  let
blanchet@42573
   569
    fun var s = ATerm (`I s, [])
blanchet@42589
   570
    fun tag tm = ATerm (`make_fixed_const type_tag_name, [var "X", tm])
blanchet@42573
   571
  in
blanchet@42612
   572
    Formula (helper_prefix ^ "ti_ti", Axiom,
blanchet@42573
   573
             AAtom (ATerm (`I "equal", [tag (tag (var "Y")), tag (var "Y")]))
blanchet@42573
   574
             |> close_formula_universally, NONE, NONE)
blanchet@42573
   575
  end
blanchet@42573
   576
blanchet@42574
   577
fun helper_facts_for_sym ctxt type_sys (s, {typ, ...} : sym_info) =
blanchet@42573
   578
  case strip_prefix_and_unascii const_prefix s of
blanchet@42573
   579
    SOME mangled_s =>
blanchet@42573
   580
    let
blanchet@42573
   581
      val thy = Proof_Context.theory_of ctxt
blanchet@42573
   582
      val unmangled_s = mangled_s |> unmangled_const_name
blanchet@42579
   583
      fun dub_and_inst c needs_some_types (th, j) =
blanchet@42579
   584
        ((c ^ "_" ^ string_of_int j ^ (if needs_some_types then "T" else ""),
blanchet@42573
   585
          false),
blanchet@42573
   586
         let val t = th |> prop_of in
blanchet@42589
   587
           t |> (general_type_arg_policy type_sys = Mangled_Type_Args andalso
blanchet@42573
   588
                 not (null (Term.hidden_polymorphism t)))
blanchet@42573
   589
                ? (case typ of
blanchet@42573
   590
                     SOME T => specialize_type thy (invert_const unmangled_s, T)
blanchet@42573
   591
                   | NONE => I)
blanchet@42573
   592
         end)
blanchet@42573
   593
      fun make_facts eq_as_iff =
blanchet@42573
   594
        map_filter (make_fact ctxt false eq_as_iff false)
blanchet@42589
   595
      val has_some_types = is_type_sys_fairly_sound type_sys
blanchet@42573
   596
    in
blanchet@42573
   597
      metis_helpers
blanchet@42579
   598
      |> maps (fn (metis_s, (needs_some_types, ths)) =>
blanchet@42573
   599
                  if metis_s <> unmangled_s orelse
blanchet@42589
   600
                     (needs_some_types andalso not has_some_types) then
blanchet@42573
   601
                    []
blanchet@42573
   602
                  else
blanchet@42573
   603
                    ths ~~ (1 upto length ths)
blanchet@42579
   604
                    |> map (dub_and_inst mangled_s needs_some_types)
blanchet@42579
   605
                    |> make_facts (not needs_some_types))
blanchet@42573
   606
    end
blanchet@42573
   607
  | NONE => []
blanchet@42573
   608
fun helper_facts_for_sym_table ctxt type_sys sym_tab =
blanchet@42573
   609
  Symtab.fold_rev (append o helper_facts_for_sym ctxt type_sys) sym_tab []
blanchet@42573
   610
blanchet@42573
   611
fun translate_atp_fact ctxt keep_trivial =
blanchet@42573
   612
  `(make_fact ctxt keep_trivial true true o apsnd prop_of)
blanchet@42573
   613
blanchet@42573
   614
fun translate_formulas ctxt type_sys hyp_ts concl_t rich_facts =
blanchet@42573
   615
  let
blanchet@42573
   616
    val thy = Proof_Context.theory_of ctxt
blanchet@42573
   617
    val fact_ts = map (prop_of o snd o snd) rich_facts
blanchet@42573
   618
    val (facts, fact_names) =
blanchet@42573
   619
      rich_facts
blanchet@42573
   620
      |> map_filter (fn (NONE, _) => NONE
blanchet@42573
   621
                      | (SOME fact, (name, _)) => SOME (fact, name))
blanchet@42573
   622
      |> ListPair.unzip
blanchet@42573
   623
    (* Remove existing facts from the conjecture, as this can dramatically
blanchet@42573
   624
       boost an ATP's performance (for some reason). *)
blanchet@42573
   625
    val hyp_ts = hyp_ts |> filter_out (member (op aconv) fact_ts)
blanchet@42573
   626
    val goal_t = Logic.list_implies (hyp_ts, concl_t)
blanchet@42573
   627
    val all_ts = goal_t :: fact_ts
blanchet@42573
   628
    val subs = tfree_classes_of_terms all_ts
blanchet@42573
   629
    val supers = tvar_classes_of_terms all_ts
blanchet@42573
   630
    val tycons = type_consts_of_terms thy all_ts
blanchet@42573
   631
    val conjs = make_conjecture ctxt (hyp_ts @ [concl_t])
blanchet@42573
   632
    val (supers', arity_clauses) =
blanchet@42589
   633
      if level_of_type_sys type_sys = No_Types then ([], [])
blanchet@42573
   634
      else make_arity_clauses thy tycons supers
blanchet@42573
   635
    val class_rel_clauses = make_class_rel_clauses thy subs supers'
blanchet@42573
   636
  in
blanchet@42573
   637
    (fact_names |> map single, (conjs, facts, class_rel_clauses, arity_clauses))
blanchet@42573
   638
  end
blanchet@42573
   639
blanchet@42573
   640
fun fo_literal_from_type_literal (TyLitVar (class, name)) =
blanchet@42573
   641
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
   642
  | fo_literal_from_type_literal (TyLitFree (class, name)) =
blanchet@42573
   643
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
   644
blanchet@42573
   645
fun formula_from_fo_literal (pos, t) = AAtom t |> not pos ? mk_anot
blanchet@42573
   646
blanchet@42573
   647
(* Finite types such as "unit", "bool", "bool * bool", and "bool => bool" are
blanchet@42573
   648
   considered dangerous because their "exhaust" properties can easily lead to
blanchet@42573
   649
   unsound ATP proofs. The checks below are an (unsound) approximation of
blanchet@42573
   650
   finiteness. *)
blanchet@42573
   651
blanchet@42589
   652
fun is_dtyp_finite _ (Datatype_Aux.DtTFree _) = true
blanchet@42589
   653
  | is_dtyp_finite ctxt (Datatype_Aux.DtType (s, Us)) =
blanchet@42589
   654
    is_type_constr_finite ctxt s andalso forall (is_dtyp_finite ctxt) Us
blanchet@42589
   655
  | is_dtyp_finite _ (Datatype_Aux.DtRec _) = false
blanchet@42589
   656
and is_type_finite ctxt (Type (s, Ts)) =
blanchet@42589
   657
    is_type_constr_finite ctxt s andalso forall (is_type_finite ctxt) Ts
blanchet@42589
   658
  | is_type_finite _ _ = false
blanchet@42589
   659
and is_type_constr_finite ctxt s =
blanchet@42573
   660
  let val thy = Proof_Context.theory_of ctxt in
blanchet@42573
   661
    case Datatype_Data.get_info thy s of
blanchet@42573
   662
      SOME {descr, ...} =>
blanchet@42573
   663
      forall (fn (_, (_, _, constrs)) =>
blanchet@42589
   664
                 forall (forall (is_dtyp_finite ctxt) o snd) constrs) descr
blanchet@42573
   665
    | NONE =>
blanchet@42573
   666
      case Typedef.get_info ctxt s of
blanchet@42589
   667
        ({rep_type, ...}, _) :: _ => is_type_finite ctxt rep_type
blanchet@42573
   668
      | [] => true
blanchet@42573
   669
  end
blanchet@42573
   670
blanchet@42589
   671
fun should_encode_type _ All_Types _ = true
blanchet@42589
   672
  | should_encode_type ctxt Finite_Types T = is_type_finite ctxt T
blanchet@42589
   673
  | should_encode_type _ Nonmonotonic_Types _ =
blanchet@42589
   674
    error "Monotonicity inference not implemented yet."
blanchet@42589
   675
  | should_encode_type _ _ _ = false
blanchet@42589
   676
blanchet@42589
   677
fun should_predicate_on_type ctxt (Preds (_, level)) T =
blanchet@42589
   678
    should_encode_type ctxt level T
blanchet@42589
   679
  | should_predicate_on_type _ _ _ = false
blanchet@42579
   680
blanchet@42579
   681
fun should_tag_with_type ctxt (Tags (_, level)) T =
blanchet@42579
   682
    should_encode_type ctxt level T
blanchet@42573
   683
  | should_tag_with_type _ _ _ = false
blanchet@42573
   684
blanchet@42573
   685
fun type_pred_combatom type_sys T tm =
blanchet@42573
   686
  CombApp (CombConst (`make_fixed_const type_pred_base, T --> @{typ bool}, [T]),
blanchet@42573
   687
           tm)
blanchet@42573
   688
  |> impose_type_arg_policy_in_combterm type_sys
blanchet@42573
   689
  |> AAtom
blanchet@42573
   690
blanchet@42573
   691
fun formula_from_combformula ctxt type_sys =
blanchet@42573
   692
  let
blanchet@42589
   693
    fun tag_with_type type_sys T tm =
blanchet@42589
   694
      CombConst (`make_fixed_const type_tag_name, T --> T, [T])
blanchet@42589
   695
      |> impose_type_arg_policy_in_combterm type_sys
blanchet@42589
   696
      |> do_term true
blanchet@42589
   697
      |> (fn ATerm (s, tms) => ATerm (s, tms @ [tm]))
blanchet@42589
   698
    and do_term top_level u =
blanchet@42573
   699
      let
blanchet@42573
   700
        val (head, args) = strip_combterm_comb u
blanchet@42574
   701
        val (x, T_args) =
blanchet@42573
   702
          case head of
blanchet@42574
   703
            CombConst (name, _, T_args) => (name, T_args)
blanchet@42573
   704
          | CombVar (name, _) => (name, [])
blanchet@42573
   705
          | CombApp _ => raise Fail "impossible \"CombApp\""
blanchet@42574
   706
        val t = ATerm (x, map fo_term_from_typ T_args @
blanchet@42573
   707
                          map (do_term false) args)
blanchet@42574
   708
        val T = combtyp_of u
blanchet@42573
   709
      in
blanchet@42574
   710
        t |> (if not top_level andalso should_tag_with_type ctxt type_sys T then
blanchet@42589
   711
                tag_with_type type_sys T
blanchet@42573
   712
              else
blanchet@42573
   713
                I)
blanchet@42573
   714
      end
blanchet@42573
   715
    val do_bound_type =
blanchet@42573
   716
      if type_sys = Many_Typed then SOME o mangled_type_name else K NONE
blanchet@42573
   717
    fun do_out_of_bound_type (s, T) =
blanchet@42579
   718
      if should_predicate_on_type ctxt type_sys T then
blanchet@42573
   719
        type_pred_combatom type_sys T (CombVar (s, T))
blanchet@42573
   720
        |> do_formula |> SOME
blanchet@42573
   721
      else
blanchet@42573
   722
        NONE
blanchet@42573
   723
    and do_formula (AQuant (q, xs, phi)) =
blanchet@42573
   724
        AQuant (q, xs |> map (apsnd (fn NONE => NONE
blanchet@42574
   725
                                      | SOME T => do_bound_type T)),
blanchet@42573
   726
                (if q = AForall then mk_ahorn else fold_rev (mk_aconn AAnd))
blanchet@42573
   727
                    (map_filter
blanchet@42573
   728
                         (fn (_, NONE) => NONE
blanchet@42574
   729
                           | (s, SOME T) => do_out_of_bound_type (s, T)) xs)
blanchet@42573
   730
                    (do_formula phi))
blanchet@42573
   731
      | do_formula (AConn (c, phis)) = AConn (c, map do_formula phis)
blanchet@42573
   732
      | do_formula (AAtom tm) = AAtom (do_term true tm)
blanchet@42573
   733
  in do_formula end
blanchet@42573
   734
blanchet@42573
   735
fun formula_for_fact ctxt type_sys
blanchet@42573
   736
                     ({combformula, atomic_types, ...} : translated_formula) =
blanchet@42573
   737
  mk_ahorn (map (formula_from_fo_literal o fo_literal_from_type_literal)
blanchet@42573
   738
                (atp_type_literals_for_types type_sys Axiom atomic_types))
blanchet@42573
   739
           (formula_from_combformula ctxt type_sys
blanchet@42573
   740
                (close_combformula_universally combformula))
blanchet@42573
   741
  |> close_formula_universally
blanchet@42573
   742
blanchet@42573
   743
(* Each fact is given a unique fact number to avoid name clashes (e.g., because
blanchet@42573
   744
   of monomorphization). The TPTP explicitly forbids name clashes, and some of
blanchet@42573
   745
   the remote provers might care. *)
blanchet@42573
   746
fun formula_line_for_fact ctxt prefix type_sys
blanchet@42573
   747
                          (j, formula as {name, kind, ...}) =
blanchet@42577
   748
  Formula (prefix ^ string_of_int j ^ "_" ^ ascii_of name, kind,
blanchet@42573
   749
           formula_for_fact ctxt type_sys formula, NONE, NONE)
blanchet@42573
   750
blanchet@42573
   751
fun formula_line_for_class_rel_clause (ClassRelClause {name, subclass,
blanchet@42573
   752
                                                       superclass, ...}) =
blanchet@42573
   753
  let val ty_arg = ATerm (`I "T", []) in
blanchet@42577
   754
    Formula (class_rel_clause_prefix ^ ascii_of name, Axiom,
blanchet@42573
   755
             AConn (AImplies, [AAtom (ATerm (subclass, [ty_arg])),
blanchet@42573
   756
                               AAtom (ATerm (superclass, [ty_arg]))])
blanchet@42573
   757
             |> close_formula_universally, NONE, NONE)
blanchet@42573
   758
  end
blanchet@42573
   759
blanchet@42573
   760
fun fo_literal_from_arity_literal (TConsLit (c, t, args)) =
blanchet@42573
   761
    (true, ATerm (c, [ATerm (t, map (fn arg => ATerm (arg, [])) args)]))
blanchet@42573
   762
  | fo_literal_from_arity_literal (TVarLit (c, sort)) =
blanchet@42573
   763
    (false, ATerm (c, [ATerm (sort, [])]))
blanchet@42573
   764
blanchet@42573
   765
fun formula_line_for_arity_clause (ArityClause {name, conclLit, premLits,
blanchet@42573
   766
                                                ...}) =
blanchet@42577
   767
  Formula (arity_clause_prefix ^ ascii_of name, Axiom,
blanchet@42573
   768
           mk_ahorn (map (formula_from_fo_literal o apfst not
blanchet@42573
   769
                          o fo_literal_from_arity_literal) premLits)
blanchet@42573
   770
                    (formula_from_fo_literal
blanchet@42573
   771
                         (fo_literal_from_arity_literal conclLit))
blanchet@42573
   772
           |> close_formula_universally, NONE, NONE)
blanchet@42573
   773
blanchet@42573
   774
fun formula_line_for_conjecture ctxt type_sys
blanchet@42573
   775
        ({name, kind, combformula, ...} : translated_formula) =
blanchet@42577
   776
  Formula (conjecture_prefix ^ name, kind,
blanchet@42573
   777
           formula_from_combformula ctxt type_sys
blanchet@42573
   778
                                    (close_combformula_universally combformula)
blanchet@42573
   779
           |> close_formula_universally, NONE, NONE)
blanchet@42573
   780
blanchet@42573
   781
fun free_type_literals type_sys ({atomic_types, ...} : translated_formula) =
blanchet@42573
   782
  atomic_types |> atp_type_literals_for_types type_sys Conjecture
blanchet@42573
   783
               |> map fo_literal_from_type_literal
blanchet@42573
   784
blanchet@42573
   785
fun formula_line_for_free_type j lit =
blanchet@42577
   786
  Formula (tfree_prefix ^ string_of_int j, Hypothesis,
blanchet@42573
   787
           formula_from_fo_literal lit, NONE, NONE)
blanchet@42573
   788
fun formula_lines_for_free_types type_sys facts =
blanchet@42573
   789
  let
blanchet@42573
   790
    val litss = map (free_type_literals type_sys) facts
blanchet@42573
   791
    val lits = fold (union (op =)) litss []
blanchet@42573
   792
  in map2 formula_line_for_free_type (0 upto length lits - 1) lits end
blanchet@42573
   793
blanchet@42573
   794
(** Symbol declarations **)
blanchet@42544
   795
blanchet@42574
   796
fun should_declare_sym type_sys pred_sym s =
blanchet@42542
   797
  not (String.isPrefix bound_var_prefix s) andalso s <> "equal" andalso
blanchet@42574
   798
  (type_sys = Many_Typed orelse not pred_sym)
blanchet@38282
   799
blanchet@42574
   800
fun add_combterm_syms_to_decl_table type_sys repaired_sym_tab =
blanchet@42574
   801
  let
blanchet@42576
   802
    fun declare_sym (decl as (_, _, T, _, _)) decls =
blanchet@42579
   803
      case type_sys of
blanchet@42589
   804
        Preds (Polymorphic, All_Types) =>
blanchet@42579
   805
        if exists (curry Type.raw_instance T o #3) decls then
blanchet@42579
   806
          decls
blanchet@42579
   807
        else
blanchet@42579
   808
          decl :: filter_out ((fn T' => Type.raw_instance (T', T)) o #3) decls
blanchet@42579
   809
      | _ => insert (op =) decl decls
blanchet@42576
   810
    fun do_term tm =
blanchet@42574
   811
      let val (head, args) = strip_combterm_comb tm in
blanchet@42574
   812
        (case head of
blanchet@42574
   813
           CombConst ((s, s'), T, T_args) =>
blanchet@42574
   814
           let val pred_sym = is_pred_sym repaired_sym_tab s in
blanchet@42574
   815
             if should_declare_sym type_sys pred_sym s then
blanchet@42576
   816
               Symtab.map_default (s, [])
blanchet@42576
   817
                   (declare_sym (s', T_args, T, pred_sym, length args))
blanchet@42574
   818
             else
blanchet@42574
   819
               I
blanchet@42574
   820
           end
blanchet@42574
   821
         | _ => I)
blanchet@42576
   822
        #> fold do_term args
blanchet@42574
   823
      end
blanchet@42576
   824
  in do_term end
blanchet@42574
   825
fun add_fact_syms_to_decl_table type_sys repaired_sym_tab =
blanchet@42574
   826
  fact_lift (formula_fold
blanchet@42574
   827
      (add_combterm_syms_to_decl_table type_sys repaired_sym_tab))
blanchet@42574
   828
fun sym_decl_table_for_facts type_sys repaired_sym_tab facts =
blanchet@42589
   829
  Symtab.empty |> is_type_sys_fairly_sound type_sys
blanchet@42574
   830
                  ? fold (add_fact_syms_to_decl_table type_sys repaired_sym_tab)
blanchet@42574
   831
                         facts
blanchet@42533
   832
blanchet@42574
   833
fun n_ary_strip_type 0 T = ([], T)
blanchet@42574
   834
  | n_ary_strip_type n (Type (@{type_name fun}, [dom_T, ran_T])) =
blanchet@42574
   835
    n_ary_strip_type (n - 1) ran_T |>> cons dom_T
blanchet@42574
   836
  | n_ary_strip_type _ _ = raise Fail "unexpected non-function"
blanchet@42533
   837
blanchet@42579
   838
fun result_type_of_decl (_, _, T, _, ary) = n_ary_strip_type ary T |> snd
blanchet@42579
   839
blanchet@42579
   840
fun decl_line_for_sym_decl s (s', _, T, pred_sym, ary) =
blanchet@42579
   841
  let val (arg_Ts, res_T) = n_ary_strip_type ary T in
blanchet@42612
   842
    Decl (sym_decl_prefix ^ s, (s, s'), map mangled_type_name arg_Ts,
blanchet@42579
   843
          if pred_sym then `I tptp_tff_bool_type else mangled_type_name res_T)
blanchet@42579
   844
  end
blanchet@42579
   845
blanchet@42592
   846
fun is_polymorphic_type T = fold_atyps (fn TVar _ => K true | _ => I) T false
blanchet@42592
   847
blanchet@42579
   848
fun formula_line_for_sym_decl ctxt type_sys n s j (s', T_args, T, _, ary) =
blanchet@42579
   849
  let
blanchet@42579
   850
    val (arg_Ts, res_T) = n_ary_strip_type ary T
blanchet@42579
   851
    val bound_names =
blanchet@42579
   852
      1 upto length arg_Ts |> map (`I o make_bound_var o string_of_int)
blanchet@42579
   853
    val bound_tms =
blanchet@42579
   854
      bound_names ~~ arg_Ts |> map (fn (name, T) => CombConst (name, T, []))
blanchet@42579
   855
    val bound_Ts =
blanchet@42592
   856
      arg_Ts |> map (fn T => if n > 1 orelse is_polymorphic_type T then SOME T
blanchet@42592
   857
                             else NONE)
blanchet@42579
   858
  in
blanchet@42612
   859
    Formula (sym_decl_prefix ^ s ^
blanchet@42612
   860
             (if n > 1 then "_" ^ string_of_int j else ""), Axiom,
blanchet@42579
   861
             CombConst ((s, s'), T, T_args)
blanchet@42579
   862
             |> fold (curry (CombApp o swap)) bound_tms
blanchet@42579
   863
             |> type_pred_combatom type_sys res_T
blanchet@42579
   864
             |> mk_aquant AForall (bound_names ~~ bound_Ts)
blanchet@42586
   865
             |> formula_from_combformula ctxt type_sys
blanchet@42586
   866
             |> close_formula_universally,
blanchet@42579
   867
             NONE, NONE)
blanchet@42579
   868
  end
blanchet@42579
   869
blanchet@42579
   870
fun problem_lines_for_sym_decls ctxt type_sys (s, decls) =
blanchet@42574
   871
  if type_sys = Many_Typed then
blanchet@42579
   872
    map (decl_line_for_sym_decl s) decls
blanchet@42574
   873
  else
blanchet@42574
   874
    let
blanchet@42579
   875
      val decls =
blanchet@42579
   876
        case decls of
blanchet@42579
   877
          decl :: (decls' as _ :: _) =>
blanchet@42592
   878
          let val T = result_type_of_decl decl in
blanchet@42592
   879
            if forall ((fn T' => Type.raw_instance (T', T))
blanchet@42592
   880
                       o result_type_of_decl) decls' then
blanchet@42592
   881
              [decl]
blanchet@42592
   882
            else
blanchet@42592
   883
              decls
blanchet@42592
   884
          end
blanchet@42579
   885
        | _ => decls
blanchet@42579
   886
      val n = length decls
blanchet@42579
   887
      val decls =
blanchet@42579
   888
        decls |> filter (should_predicate_on_type ctxt type_sys
blanchet@42579
   889
                         o result_type_of_decl)
blanchet@42574
   890
    in
blanchet@42579
   891
      map2 (formula_line_for_sym_decl ctxt type_sys n s)
blanchet@42579
   892
           (0 upto length decls - 1) decls
blanchet@42574
   893
    end
blanchet@42579
   894
blanchet@42574
   895
fun problem_lines_for_sym_decl_table ctxt type_sys sym_decl_tab =
blanchet@42574
   896
  Symtab.fold_rev (append o problem_lines_for_sym_decls ctxt type_sys)
blanchet@42574
   897
                  sym_decl_tab []
blanchet@42543
   898
blanchet@42543
   899
fun add_tff_types_in_formula (AQuant (_, xs, phi)) =
blanchet@42543
   900
    union (op =) (map_filter snd xs) #> add_tff_types_in_formula phi
blanchet@42543
   901
  | add_tff_types_in_formula (AConn (_, phis)) =
blanchet@42543
   902
    fold add_tff_types_in_formula phis
blanchet@42543
   903
  | add_tff_types_in_formula (AAtom _) = I
blanchet@42539
   904
blanchet@42562
   905
fun add_tff_types_in_problem_line (Decl (_, _, arg_Ts, res_T)) =
blanchet@42562
   906
    union (op =) (res_T :: arg_Ts)
blanchet@42577
   907
  | add_tff_types_in_problem_line (Formula (_, _, phi, _, _)) =
blanchet@42543
   908
    add_tff_types_in_formula phi
blanchet@42543
   909
blanchet@42543
   910
fun tff_types_in_problem problem =
blanchet@42543
   911
  fold (fold add_tff_types_in_problem_line o snd) problem []
blanchet@42543
   912
blanchet@42545
   913
fun decl_line_for_tff_type (s, s') =
blanchet@42568
   914
  Decl (type_decl_prefix ^ ascii_of s, (s, s'), [], `I tptp_tff_type_of_types)
blanchet@42543
   915
blanchet@42543
   916
val type_declsN = "Types"
blanchet@42544
   917
val sym_declsN = "Symbol types"
blanchet@41157
   918
val factsN = "Relevant facts"
blanchet@41157
   919
val class_relsN = "Class relationships"
blanchet@42543
   920
val aritiesN = "Arities"
blanchet@41157
   921
val helpersN = "Helper facts"
blanchet@41157
   922
val conjsN = "Conjectures"
blanchet@41313
   923
val free_typesN = "Type variables"
blanchet@41157
   924
blanchet@41157
   925
fun offset_of_heading_in_problem _ [] j = j
blanchet@41157
   926
  | offset_of_heading_in_problem needle ((heading, lines) :: problem) j =
blanchet@41157
   927
    if heading = needle then j
blanchet@41157
   928
    else offset_of_heading_in_problem needle problem (j + length lines)
blanchet@41157
   929
blanchet@42568
   930
fun prepare_atp_problem ctxt type_sys explicit_apply hyp_ts concl_t facts =
blanchet@38282
   931
  let
blanchet@41313
   932
    val (fact_names, (conjs, facts, class_rel_clauses, arity_clauses)) =
blanchet@41134
   933
      translate_formulas ctxt type_sys hyp_ts concl_t facts
blanchet@42563
   934
    val sym_tab = conjs @ facts |> sym_table_for_facts explicit_apply
blanchet@42565
   935
    val (conjs, facts) =
blanchet@42573
   936
      (conjs, facts) |> pairself (map (repair_fact type_sys sym_tab))
blanchet@42573
   937
    val repaired_sym_tab = conjs @ facts |> sym_table_for_facts false
blanchet@42561
   938
    val sym_decl_lines =
blanchet@42574
   939
      conjs @ facts
blanchet@42574
   940
      |> sym_decl_table_for_facts type_sys repaired_sym_tab
blanchet@42574
   941
      |> problem_lines_for_sym_decl_table ctxt type_sys
blanchet@42573
   942
    val helpers =
blanchet@42573
   943
      helper_facts_for_sym_table ctxt type_sys repaired_sym_tab
blanchet@42573
   944
      |> map (repair_fact type_sys sym_tab)
blanchet@42522
   945
    (* Reordering these might confuse the proof reconstruction code or the SPASS
blanchet@42522
   946
       Flotter hack. *)
blanchet@38282
   947
    val problem =
blanchet@42561
   948
      [(sym_declsN, sym_decl_lines),
blanchet@42545
   949
       (factsN, map (formula_line_for_fact ctxt fact_prefix type_sys)
blanchet@42180
   950
                    (0 upto length facts - 1 ~~ facts)),
blanchet@42545
   951
       (class_relsN, map formula_line_for_class_rel_clause class_rel_clauses),
blanchet@42545
   952
       (aritiesN, map formula_line_for_arity_clause arity_clauses),
blanchet@42561
   953
       (helpersN, map (formula_line_for_fact ctxt helper_prefix type_sys)
blanchet@42563
   954
                      (0 upto length helpers - 1 ~~ helpers)
blanchet@42579
   955
                  |> (case type_sys of
blanchet@42589
   956
                        Tags (Polymorphic, level) =>
blanchet@42589
   957
                        member (op =) [Finite_Types, Nonmonotonic_Types] level
blanchet@42589
   958
                        ? cons (ti_ti_helper_fact ())
blanchet@42579
   959
                      | _ => I)),
blanchet@42545
   960
       (conjsN, map (formula_line_for_conjecture ctxt type_sys) conjs),
blanchet@42545
   961
       (free_typesN, formula_lines_for_free_types type_sys (facts @ conjs))]
blanchet@42543
   962
    val problem =
blanchet@42561
   963
      problem
blanchet@42561
   964
      |> (if type_sys = Many_Typed then
blanchet@42561
   965
            cons (type_declsN,
blanchet@42561
   966
                  map decl_line_for_tff_type (tff_types_in_problem problem))
blanchet@42561
   967
          else
blanchet@42561
   968
            I)
blanchet@42568
   969
    val (problem, pool) = problem |> nice_atp_problem (!readable_names)
blanchet@38282
   970
  in
blanchet@38282
   971
    (problem,
blanchet@38282
   972
     case pool of SOME the_pool => snd the_pool | NONE => Symtab.empty,
blanchet@42585
   973
     offset_of_heading_in_problem conjsN problem 0,
blanchet@42541
   974
     offset_of_heading_in_problem factsN problem 0,
blanchet@41157
   975
     fact_names |> Vector.fromList)
blanchet@38282
   976
  end
blanchet@38282
   977
blanchet@41313
   978
(* FUDGE *)
blanchet@41313
   979
val conj_weight = 0.0
blanchet@41770
   980
val hyp_weight = 0.1
blanchet@41770
   981
val fact_min_weight = 0.2
blanchet@41313
   982
val fact_max_weight = 1.0
blanchet@42608
   983
val type_info_default_weight = 0.8
blanchet@41313
   984
blanchet@41313
   985
fun add_term_weights weight (ATerm (s, tms)) =
blanchet@41313
   986
  (not (is_atp_variable s) andalso s <> "equal") ? Symtab.default (s, weight)
blanchet@41313
   987
  #> fold (add_term_weights weight) tms
blanchet@42577
   988
fun add_problem_line_weights weight (Formula (_, _, phi, _, _)) =
blanchet@42542
   989
    formula_fold (add_term_weights weight) phi
blanchet@42528
   990
  | add_problem_line_weights _ _ = I
blanchet@41313
   991
blanchet@41313
   992
fun add_conjectures_weights [] = I
blanchet@41313
   993
  | add_conjectures_weights conjs =
blanchet@41313
   994
    let val (hyps, conj) = split_last conjs in
blanchet@41313
   995
      add_problem_line_weights conj_weight conj
blanchet@41313
   996
      #> fold (add_problem_line_weights hyp_weight) hyps
blanchet@41313
   997
    end
blanchet@41313
   998
blanchet@41313
   999
fun add_facts_weights facts =
blanchet@41313
  1000
  let
blanchet@41313
  1001
    val num_facts = length facts
blanchet@41313
  1002
    fun weight_of j =
blanchet@41313
  1003
      fact_min_weight + (fact_max_weight - fact_min_weight) * Real.fromInt j
blanchet@41313
  1004
                        / Real.fromInt num_facts
blanchet@41313
  1005
  in
blanchet@41313
  1006
    map weight_of (0 upto num_facts - 1) ~~ facts
blanchet@41313
  1007
    |> fold (uncurry add_problem_line_weights)
blanchet@41313
  1008
  end
blanchet@41313
  1009
blanchet@41313
  1010
(* Weights are from 0.0 (most important) to 1.0 (least important). *)
blanchet@41313
  1011
fun atp_problem_weights problem =
blanchet@42608
  1012
  let val get = these o AList.lookup (op =) problem in
blanchet@42608
  1013
    Symtab.empty
blanchet@42608
  1014
    |> add_conjectures_weights (get free_typesN @ get conjsN)
blanchet@42608
  1015
    |> add_facts_weights (get factsN)
blanchet@42608
  1016
    |> fold (fold (add_problem_line_weights type_info_default_weight) o get)
blanchet@42608
  1017
            [sym_declsN, class_relsN, aritiesN]
blanchet@42608
  1018
    |> Symtab.dest
blanchet@42608
  1019
    |> sort (prod_ord Real.compare string_ord o pairself swap)
blanchet@42608
  1020
  end
blanchet@41313
  1021
blanchet@38282
  1022
end;