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