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