src/HOL/Tools/ATP/atp_translate.ML
author blanchet
Sun Jul 17 14:11:35 2011 +0200 (2011-07-17)
changeset 43858 be41d12de6fa
parent 43857 a875729380a4
child 43859 b7890554c424
permissions -rw-r--r--
simplify code -- there are no lambdas in helpers anyway
wenzelm@43283
     1
(*  Title:      HOL/Tools/ATP/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@43085
     9
signature ATP_TRANSLATE =
blanchet@38282
    10
sig
nik@43676
    11
  type ('a, 'b) ho_term = ('a, 'b) ATP_Problem.ho_term
blanchet@43136
    12
  type connective = ATP_Problem.connective
blanchet@43136
    13
  type ('a, 'b, 'c) formula = ('a, 'b, 'c) ATP_Problem.formula
blanchet@42939
    14
  type format = ATP_Problem.format
blanchet@42709
    15
  type formula_kind = ATP_Problem.formula_kind
blanchet@38282
    16
  type 'a problem = 'a ATP_Problem.problem
blanchet@43085
    17
blanchet@43421
    18
  datatype locality =
blanchet@43421
    19
    General | Helper | Extensionality | Intro | Elim | Simp | Local | Assum |
blanchet@43421
    20
    Chained
blanchet@42613
    21
blanchet@43624
    22
  datatype order = First_Order | Higher_Order
blanchet@42613
    23
  datatype polymorphism = Polymorphic | Monomorphic | Mangled_Monomorphic
blanchet@42613
    24
  datatype type_level =
blanchet@43362
    25
    All_Types | Noninf_Nonmono_Types | Fin_Nonmono_Types | Const_Arg_Types |
blanchet@43362
    26
    No_Types
blanchet@43128
    27
  datatype type_heaviness = Heavyweight | Lightweight
blanchet@42613
    28
blanchet@43626
    29
  datatype type_enc =
blanchet@43624
    30
    Simple_Types of order * type_level |
blanchet@42837
    31
    Preds of polymorphism * type_level * type_heaviness |
blanchet@42837
    32
    Tags of polymorphism * type_level * type_heaviness
blanchet@42613
    33
blanchet@43085
    34
  val bound_var_prefix : string
blanchet@43496
    35
  val schematic_var_prefix : string
blanchet@43496
    36
  val fixed_var_prefix : string
blanchet@43496
    37
  val tvar_prefix : string
blanchet@43496
    38
  val tfree_prefix : string
blanchet@43496
    39
  val const_prefix : string
blanchet@43496
    40
  val type_const_prefix : string
blanchet@43496
    41
  val class_prefix : string
blanchet@43085
    42
  val skolem_const_prefix : string
blanchet@43085
    43
  val old_skolem_const_prefix : string
blanchet@43085
    44
  val new_skolem_const_prefix : string
blanchet@43125
    45
  val type_decl_prefix : string
blanchet@43125
    46
  val sym_decl_prefix : string
blanchet@43125
    47
  val preds_sym_formula_prefix : string
blanchet@43129
    48
  val lightweight_tags_sym_formula_prefix : string
blanchet@40204
    49
  val fact_prefix : string
blanchet@38282
    50
  val conjecture_prefix : string
blanchet@42881
    51
  val helper_prefix : string
blanchet@43125
    52
  val class_rel_clause_prefix : string
blanchet@43125
    53
  val arity_clause_prefix : string
blanchet@43125
    54
  val tfree_clause_prefix : string
blanchet@42881
    55
  val typed_helper_suffix : string
blanchet@43125
    56
  val untyped_helper_suffix : string
blanchet@43159
    57
  val type_tag_idempotence_helper_name : string
blanchet@42966
    58
  val predicator_name : string
blanchet@42966
    59
  val app_op_name : string
blanchet@43104
    60
  val type_tag_name : string
blanchet@42966
    61
  val type_pred_name : string
blanchet@42962
    62
  val simple_type_prefix : string
blanchet@43174
    63
  val prefixed_predicator_name : string
blanchet@43130
    64
  val prefixed_app_op_name : string
blanchet@43130
    65
  val prefixed_type_tag_name : string
blanchet@43496
    66
  val ascii_of : string -> string
blanchet@43496
    67
  val unascii_of : string -> string
blanchet@43085
    68
  val strip_prefix_and_unascii : string -> string -> string option
blanchet@43159
    69
  val proxy_table : (string * (string * (thm * (string * string)))) list
blanchet@43159
    70
  val proxify_const : string -> (string * string) option
blanchet@43496
    71
  val invert_const : string -> string
blanchet@43496
    72
  val unproxify_const : string -> string
blanchet@43093
    73
  val new_skolem_var_name_from_const : string -> string
blanchet@43093
    74
  val num_type_args : theory -> string -> int
blanchet@43248
    75
  val atp_irrelevant_consts : string list
blanchet@43248
    76
  val atp_schematic_consts_of : term -> typ list Symtab.table
blanchet@43085
    77
  val is_locality_global : locality -> bool
blanchet@43626
    78
  val type_enc_from_string : string -> type_enc
blanchet@43828
    79
  val is_type_enc_higher_order : type_enc -> bool
blanchet@43626
    80
  val polymorphism_of_type_enc : type_enc -> polymorphism
blanchet@43626
    81
  val level_of_type_enc : type_enc -> type_level
blanchet@43626
    82
  val is_type_enc_virtually_sound : type_enc -> bool
blanchet@43626
    83
  val is_type_enc_fairly_sound : type_enc -> bool
blanchet@43626
    84
  val choose_format : format list -> type_enc -> format * type_enc
blanchet@43136
    85
  val mk_aconns :
blanchet@43136
    86
    connective -> ('a, 'b, 'c) formula list -> ('a, 'b, 'c) formula
nik@43676
    87
  val unmangled_const : string -> string * (string, 'b) ho_term list
blanchet@43130
    88
  val unmangled_const_name : string -> string
blanchet@43194
    89
  val helper_table : ((string * bool) * thm list) list
blanchet@43501
    90
  val factsN : string
blanchet@43856
    91
  val conceal_lambdas : Proof.context -> term -> term
blanchet@43856
    92
  val introduce_combinators : Proof.context -> term -> term
blanchet@40059
    93
  val prepare_atp_problem :
blanchet@43626
    94
    Proof.context -> format -> formula_kind -> formula_kind -> type_enc -> bool
blanchet@43856
    95
    -> bool -> (term list -> term list) -> bool -> bool -> term list -> term
blanchet@43304
    96
    -> ((string * locality) * term) list
blanchet@42541
    97
    -> string problem * string Symtab.table * int * int
blanchet@43214
    98
       * (string * locality) list vector * int list * int Symtab.table
blanchet@41313
    99
  val atp_problem_weights : string problem -> (string * real) list
blanchet@38282
   100
end;
blanchet@38282
   101
blanchet@43085
   102
structure ATP_Translate : ATP_TRANSLATE =
blanchet@38282
   103
struct
blanchet@38282
   104
blanchet@43085
   105
open ATP_Util
blanchet@38282
   106
open ATP_Problem
blanchet@43085
   107
blanchet@43085
   108
type name = string * string
blanchet@43085
   109
blanchet@43828
   110
val generate_info = false (* experimental *)
blanchet@38282
   111
blanchet@43693
   112
fun isabelle_info s =
blanchet@43693
   113
  if generate_info then SOME (ATerm ("[]", [ATerm ("isabelle_" ^ s, [])]))
blanchet@43693
   114
  else NONE
blanchet@42879
   115
blanchet@43693
   116
val introN = "intro"
blanchet@43693
   117
val elimN = "elim"
blanchet@43693
   118
val simpN = "simp"
blanchet@42879
   119
blanchet@43085
   120
val bound_var_prefix = "B_"
blanchet@43085
   121
val schematic_var_prefix = "V_"
blanchet@43085
   122
val fixed_var_prefix = "v_"
blanchet@43085
   123
blanchet@43085
   124
val tvar_prefix = "T_"
blanchet@43085
   125
val tfree_prefix = "t_"
blanchet@43085
   126
blanchet@43085
   127
val const_prefix = "c_"
blanchet@43085
   128
val type_const_prefix = "tc_"
blanchet@43085
   129
val class_prefix = "cl_"
blanchet@43085
   130
blanchet@43085
   131
val skolem_const_prefix = "Sledgehammer" ^ Long_Name.separator ^ "Sko"
blanchet@43085
   132
val old_skolem_const_prefix = skolem_const_prefix ^ "o"
blanchet@43085
   133
val new_skolem_const_prefix = skolem_const_prefix ^ "n"
blanchet@43085
   134
blanchet@42998
   135
val type_decl_prefix = "ty_"
blanchet@42998
   136
val sym_decl_prefix = "sy_"
blanchet@43125
   137
val preds_sym_formula_prefix = "psy_"
blanchet@43129
   138
val lightweight_tags_sym_formula_prefix = "tsy_"
blanchet@40204
   139
val fact_prefix = "fact_"
blanchet@38282
   140
val conjecture_prefix = "conj_"
blanchet@38282
   141
val helper_prefix = "help_"
blanchet@43159
   142
val class_rel_clause_prefix = "clar_"
blanchet@38282
   143
val arity_clause_prefix = "arity_"
blanchet@43085
   144
val tfree_clause_prefix = "tfree_"
blanchet@38282
   145
blanchet@42881
   146
val typed_helper_suffix = "_T"
blanchet@42881
   147
val untyped_helper_suffix = "_U"
blanchet@43159
   148
val type_tag_idempotence_helper_name = helper_prefix ^ "ti_idem"
blanchet@42881
   149
blanchet@42966
   150
val predicator_name = "hBOOL"
blanchet@42966
   151
val app_op_name = "hAPP"
blanchet@43104
   152
val type_tag_name = "ti"
blanchet@42966
   153
val type_pred_name = "is"
blanchet@42962
   154
val simple_type_prefix = "ty_"
blanchet@42531
   155
blanchet@43174
   156
val prefixed_predicator_name = const_prefix ^ predicator_name
blanchet@43130
   157
val prefixed_app_op_name = const_prefix ^ app_op_name
blanchet@43130
   158
val prefixed_type_tag_name = const_prefix ^ type_tag_name
blanchet@43130
   159
blanchet@38282
   160
(* Freshness almost guaranteed! *)
blanchet@38282
   161
val sledgehammer_weak_prefix = "Sledgehammer:"
blanchet@38282
   162
blanchet@43827
   163
val concealed_lambda_prefix = sledgehammer_weak_prefix ^ "lambda_"
blanchet@43827
   164
blanchet@43085
   165
(*Escaping of special characters.
blanchet@43085
   166
  Alphanumeric characters are left unchanged.
blanchet@43085
   167
  The character _ goes to __
blanchet@43085
   168
  Characters in the range ASCII space to / go to _A to _P, respectively.
blanchet@43085
   169
  Other characters go to _nnn where nnn is the decimal ASCII code.*)
blanchet@43093
   170
val upper_a_minus_space = Char.ord #"A" - Char.ord #" "
blanchet@43085
   171
blanchet@43085
   172
fun stringN_of_int 0 _ = ""
blanchet@43085
   173
  | stringN_of_int k n =
blanchet@43085
   174
    stringN_of_int (k - 1) (n div 10) ^ string_of_int (n mod 10)
blanchet@43085
   175
blanchet@43085
   176
fun ascii_of_char c =
blanchet@43085
   177
  if Char.isAlphaNum c then
blanchet@43085
   178
    String.str c
blanchet@43085
   179
  else if c = #"_" then
blanchet@43085
   180
    "__"
blanchet@43085
   181
  else if #" " <= c andalso c <= #"/" then
blanchet@43085
   182
    "_" ^ String.str (Char.chr (Char.ord c + upper_a_minus_space))
blanchet@43085
   183
  else
blanchet@43085
   184
    (* fixed width, in case more digits follow *)
blanchet@43085
   185
    "_" ^ stringN_of_int 3 (Char.ord c)
blanchet@43085
   186
blanchet@43085
   187
val ascii_of = String.translate ascii_of_char
blanchet@43085
   188
blanchet@43085
   189
(** Remove ASCII armoring from names in proof files **)
blanchet@43085
   190
blanchet@43085
   191
(* We don't raise error exceptions because this code can run inside a worker
blanchet@43085
   192
   thread. Also, the errors are impossible. *)
blanchet@43085
   193
val unascii_of =
blanchet@43085
   194
  let
blanchet@43085
   195
    fun un rcs [] = String.implode(rev rcs)
blanchet@43085
   196
      | un rcs [#"_"] = un (#"_" :: rcs) [] (* ERROR *)
blanchet@43085
   197
        (* Three types of _ escapes: __, _A to _P, _nnn *)
blanchet@43496
   198
      | un rcs (#"_" :: #"_" :: cs) = un (#"_" :: rcs) cs
blanchet@43085
   199
      | un rcs (#"_" :: c :: cs) =
blanchet@43085
   200
        if #"A" <= c andalso c<= #"P" then
blanchet@43085
   201
          (* translation of #" " to #"/" *)
blanchet@43085
   202
          un (Char.chr (Char.ord c - upper_a_minus_space) :: rcs) cs
blanchet@43085
   203
        else
blanchet@43496
   204
          let val digits = List.take (c :: cs, 3) handle General.Subscript => [] in
blanchet@43085
   205
            case Int.fromString (String.implode digits) of
blanchet@43085
   206
              SOME n => un (Char.chr n :: rcs) (List.drop (cs, 2))
blanchet@43496
   207
            | NONE => un (c :: #"_" :: rcs) cs (* ERROR *)
blanchet@43085
   208
          end
blanchet@43085
   209
      | un rcs (c :: cs) = un (c :: rcs) cs
blanchet@43085
   210
  in un [] o String.explode end
blanchet@43085
   211
blanchet@43085
   212
(* If string s has the prefix s1, return the result of deleting it,
blanchet@43085
   213
   un-ASCII'd. *)
blanchet@43085
   214
fun strip_prefix_and_unascii s1 s =
blanchet@43085
   215
  if String.isPrefix s1 s then
blanchet@43085
   216
    SOME (unascii_of (String.extract (s, size s1, NONE)))
blanchet@43085
   217
  else
blanchet@43085
   218
    NONE
blanchet@43085
   219
blanchet@43159
   220
val proxy_table =
blanchet@43159
   221
  [("c_False", (@{const_name False}, (@{thm fFalse_def},
blanchet@43159
   222
       ("fFalse", @{const_name ATP.fFalse})))),
blanchet@43159
   223
   ("c_True", (@{const_name True}, (@{thm fTrue_def},
blanchet@43159
   224
       ("fTrue", @{const_name ATP.fTrue})))),
blanchet@43159
   225
   ("c_Not", (@{const_name Not}, (@{thm fNot_def},
blanchet@43159
   226
       ("fNot", @{const_name ATP.fNot})))),
blanchet@43159
   227
   ("c_conj", (@{const_name conj}, (@{thm fconj_def},
blanchet@43159
   228
       ("fconj", @{const_name ATP.fconj})))),
blanchet@43159
   229
   ("c_disj", (@{const_name disj}, (@{thm fdisj_def},
blanchet@43159
   230
       ("fdisj", @{const_name ATP.fdisj})))),
blanchet@43159
   231
   ("c_implies", (@{const_name implies}, (@{thm fimplies_def},
blanchet@43159
   232
       ("fimplies", @{const_name ATP.fimplies})))),
blanchet@43159
   233
   ("equal", (@{const_name HOL.eq}, (@{thm fequal_def},
nik@43678
   234
       ("fequal", @{const_name ATP.fequal})))),
nik@43678
   235
   ("c_All", (@{const_name All}, (@{thm fAll_def},
nik@43678
   236
       ("fAll", @{const_name ATP.fAll})))),
nik@43678
   237
   ("c_Ex", (@{const_name Ex}, (@{thm fEx_def},
nik@43678
   238
       ("fEx", @{const_name ATP.fEx}))))]
blanchet@43085
   239
blanchet@43159
   240
val proxify_const = AList.lookup (op =) proxy_table #> Option.map (snd o snd)
blanchet@43085
   241
blanchet@43085
   242
(* Readable names for the more common symbolic functions. Do not mess with the
blanchet@43085
   243
   table unless you know what you are doing. *)
blanchet@43085
   244
val const_trans_table =
blanchet@43085
   245
  [(@{type_name Product_Type.prod}, "prod"),
blanchet@43085
   246
   (@{type_name Sum_Type.sum}, "sum"),
blanchet@43085
   247
   (@{const_name False}, "False"),
blanchet@43085
   248
   (@{const_name True}, "True"),
blanchet@43085
   249
   (@{const_name Not}, "Not"),
blanchet@43085
   250
   (@{const_name conj}, "conj"),
blanchet@43085
   251
   (@{const_name disj}, "disj"),
blanchet@43085
   252
   (@{const_name implies}, "implies"),
blanchet@43085
   253
   (@{const_name HOL.eq}, "equal"),
nik@43678
   254
   (@{const_name All}, "All"),
nik@43678
   255
   (@{const_name Ex}, "Ex"),
blanchet@43085
   256
   (@{const_name If}, "If"),
blanchet@43085
   257
   (@{const_name Set.member}, "member"),
blanchet@43085
   258
   (@{const_name Meson.COMBI}, "COMBI"),
blanchet@43085
   259
   (@{const_name Meson.COMBK}, "COMBK"),
blanchet@43085
   260
   (@{const_name Meson.COMBB}, "COMBB"),
blanchet@43085
   261
   (@{const_name Meson.COMBC}, "COMBC"),
blanchet@43085
   262
   (@{const_name Meson.COMBS}, "COMBS")]
blanchet@43085
   263
  |> Symtab.make
blanchet@43159
   264
  |> fold (Symtab.update o swap o snd o snd o snd) proxy_table
blanchet@43085
   265
blanchet@43085
   266
(* Invert the table of translations between Isabelle and ATPs. *)
blanchet@43085
   267
val const_trans_table_inv =
blanchet@43085
   268
  const_trans_table |> Symtab.dest |> map swap |> Symtab.make
blanchet@43085
   269
val const_trans_table_unprox =
blanchet@43085
   270
  Symtab.empty
blanchet@43159
   271
  |> fold (fn (_, (isa, (_, (_, atp)))) => Symtab.update (atp, isa)) proxy_table
blanchet@43085
   272
blanchet@43085
   273
val invert_const = perhaps (Symtab.lookup const_trans_table_inv)
blanchet@43085
   274
val unproxify_const = perhaps (Symtab.lookup const_trans_table_unprox)
blanchet@43085
   275
blanchet@43085
   276
fun lookup_const c =
blanchet@43085
   277
  case Symtab.lookup const_trans_table c of
blanchet@43085
   278
    SOME c' => c'
blanchet@43085
   279
  | NONE => ascii_of c
blanchet@43085
   280
blanchet@43622
   281
fun ascii_of_indexname (v, 0) = ascii_of v
blanchet@43622
   282
  | ascii_of_indexname (v, i) = ascii_of v ^ "_" ^ string_of_int i
blanchet@43085
   283
blanchet@43085
   284
fun make_bound_var x = bound_var_prefix ^ ascii_of x
blanchet@43085
   285
fun make_schematic_var v = schematic_var_prefix ^ ascii_of_indexname v
blanchet@43085
   286
fun make_fixed_var x = fixed_var_prefix ^ ascii_of x
blanchet@43085
   287
blanchet@43622
   288
fun make_schematic_type_var (x, i) =
blanchet@43622
   289
      tvar_prefix ^ (ascii_of_indexname (unprefix "'" x, i))
blanchet@43622
   290
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (unprefix "'" x))
blanchet@43085
   291
blanchet@43622
   292
(* "HOL.eq" is mapped to the ATP's equality. *)
blanchet@43622
   293
fun make_fixed_const @{const_name HOL.eq} = tptp_old_equal
blanchet@43085
   294
  | make_fixed_const c = const_prefix ^ lookup_const c
blanchet@43085
   295
blanchet@43085
   296
fun make_fixed_type_const c = type_const_prefix ^ lookup_const c
blanchet@43085
   297
blanchet@43085
   298
fun make_type_class clas = class_prefix ^ ascii_of clas
blanchet@43085
   299
blanchet@43093
   300
fun new_skolem_var_name_from_const s =
blanchet@43093
   301
  let val ss = s |> space_explode Long_Name.separator in
blanchet@43093
   302
    nth ss (length ss - 2)
blanchet@43093
   303
  end
blanchet@43093
   304
blanchet@43093
   305
(* The number of type arguments of a constant, zero if it's monomorphic. For
blanchet@43093
   306
   (instances of) Skolem pseudoconstants, this information is encoded in the
blanchet@43093
   307
   constant name. *)
blanchet@43093
   308
fun num_type_args thy s =
blanchet@43093
   309
  if String.isPrefix skolem_const_prefix s then
blanchet@43093
   310
    s |> space_explode Long_Name.separator |> List.last |> Int.fromString |> the
blanchet@43093
   311
  else
blanchet@43093
   312
    (s, Sign.the_const_type thy s) |> Sign.const_typargs thy |> length
blanchet@43093
   313
blanchet@43248
   314
(* These are either simplified away by "Meson.presimplify" (most of the time) or
blanchet@43248
   315
   handled specially via "fFalse", "fTrue", ..., "fequal". *)
blanchet@43248
   316
val atp_irrelevant_consts =
blanchet@43248
   317
  [@{const_name False}, @{const_name True}, @{const_name Not},
blanchet@43248
   318
   @{const_name conj}, @{const_name disj}, @{const_name implies},
blanchet@43248
   319
   @{const_name HOL.eq}, @{const_name If}, @{const_name Let}]
blanchet@43248
   320
blanchet@43248
   321
val atp_monomorph_bad_consts =
blanchet@43248
   322
  atp_irrelevant_consts @
blanchet@43248
   323
  (* These are ignored anyway by the relevance filter (unless they appear in
blanchet@43248
   324
     higher-order places) but not by the monomorphizer. *)
blanchet@43248
   325
  [@{const_name all}, @{const_name "==>"}, @{const_name "=="},
blanchet@43248
   326
   @{const_name Trueprop}, @{const_name All}, @{const_name Ex},
blanchet@43248
   327
   @{const_name Ex1}, @{const_name Ball}, @{const_name Bex}]
blanchet@43248
   328
blanchet@43258
   329
fun add_schematic_const (x as (_, T)) =
blanchet@43258
   330
  Monomorph.typ_has_tvars T ? Symtab.insert_list (op =) x
blanchet@43258
   331
val add_schematic_consts_of =
blanchet@43258
   332
  Term.fold_aterms (fn Const (x as (s, _)) =>
blanchet@43258
   333
                       not (member (op =) atp_monomorph_bad_consts s)
blanchet@43258
   334
                       ? add_schematic_const x
blanchet@43258
   335
                      | _ => I)
blanchet@43258
   336
fun atp_schematic_consts_of t = add_schematic_consts_of t Symtab.empty
blanchet@43248
   337
blanchet@43085
   338
(** Definitions and functions for FOL clauses and formulas for TPTP **)
blanchet@43085
   339
blanchet@43085
   340
(* The first component is the type class; the second is a "TVar" or "TFree". *)
blanchet@43085
   341
datatype type_literal =
blanchet@43085
   342
  TyLitVar of name * name |
blanchet@43085
   343
  TyLitFree of name * name
blanchet@43085
   344
blanchet@43085
   345
blanchet@43085
   346
(** Isabelle arities **)
blanchet@43085
   347
blanchet@43085
   348
datatype arity_literal =
blanchet@43085
   349
  TConsLit of name * name * name list |
blanchet@43085
   350
  TVarLit of name * name
blanchet@43085
   351
blanchet@43085
   352
fun gen_TVars 0 = []
blanchet@43093
   353
  | gen_TVars n = ("T_" ^ string_of_int n) :: gen_TVars (n-1)
blanchet@43085
   354
blanchet@43263
   355
val type_class = the_single @{sort type}
blanchet@43263
   356
blanchet@43263
   357
fun add_packed_sort tvar =
blanchet@43263
   358
  fold (fn s => s <> type_class ? cons (`make_type_class s, `I tvar))
blanchet@43085
   359
blanchet@43086
   360
type arity_clause =
blanchet@43496
   361
  {name : string,
blanchet@43496
   362
   prem_lits : arity_literal list,
blanchet@43496
   363
   concl_lits : arity_literal}
blanchet@43085
   364
blanchet@43085
   365
(* Arity of type constructor "tcon :: (arg1, ..., argN) res" *)
blanchet@43085
   366
fun make_axiom_arity_clause (tcons, name, (cls, args)) =
blanchet@43085
   367
  let
blanchet@43085
   368
    val tvars = gen_TVars (length args)
blanchet@43085
   369
    val tvars_srts = ListPair.zip (tvars, args)
blanchet@43085
   370
  in
blanchet@43086
   371
    {name = name,
blanchet@43263
   372
     prem_lits = [] |> fold (uncurry add_packed_sort) tvars_srts |> map TVarLit,
blanchet@43086
   373
     concl_lits = TConsLit (`make_type_class cls,
blanchet@43086
   374
                            `make_fixed_type_const tcons,
blanchet@43086
   375
                            tvars ~~ tvars)}
blanchet@43085
   376
  end
blanchet@43085
   377
blanchet@43085
   378
fun arity_clause _ _ (_, []) = []
blanchet@43495
   379
  | arity_clause seen n (tcons, ("HOL.type", _) :: ars) =  (* ignore *)
blanchet@43495
   380
    arity_clause seen n (tcons, ars)
blanchet@43495
   381
  | arity_clause seen n (tcons, (ar as (class, _)) :: ars) =
blanchet@43495
   382
    if member (op =) seen class then
blanchet@43495
   383
      (* multiple arities for the same (tycon, class) pair *)
blanchet@43495
   384
      make_axiom_arity_clause (tcons,
blanchet@43495
   385
          lookup_const tcons ^ "___" ^ ascii_of class ^ "_" ^ string_of_int n,
blanchet@43495
   386
          ar) ::
blanchet@43495
   387
      arity_clause seen (n + 1) (tcons, ars)
blanchet@43495
   388
    else
blanchet@43495
   389
      make_axiom_arity_clause (tcons, lookup_const tcons ^ "___" ^
blanchet@43495
   390
                               ascii_of class, ar) ::
blanchet@43495
   391
      arity_clause (class :: seen) n (tcons, ars)
blanchet@43085
   392
blanchet@43085
   393
fun multi_arity_clause [] = []
blanchet@43085
   394
  | multi_arity_clause ((tcons, ars) :: tc_arlists) =
blanchet@43085
   395
      arity_clause [] 1 (tcons, ars) @ multi_arity_clause tc_arlists
blanchet@43085
   396
blanchet@43622
   397
(* Generate all pairs (tycon, class, sorts) such that tycon belongs to class in
blanchet@43622
   398
   theory thy provided its arguments have the corresponding sorts. *)
blanchet@43085
   399
fun type_class_pairs thy tycons classes =
blanchet@43093
   400
  let
blanchet@43093
   401
    val alg = Sign.classes_of thy
blanchet@43093
   402
    fun domain_sorts tycon = Sorts.mg_domain alg tycon o single
blanchet@43093
   403
    fun add_class tycon class =
blanchet@43093
   404
      cons (class, domain_sorts tycon class)
blanchet@43093
   405
      handle Sorts.CLASS_ERROR _ => I
blanchet@43093
   406
    fun try_classes tycon = (tycon, fold (add_class tycon) classes [])
blanchet@43093
   407
  in map try_classes tycons end
blanchet@43085
   408
blanchet@43085
   409
(*Proving one (tycon, class) membership may require proving others, so iterate.*)
blanchet@43085
   410
fun iter_type_class_pairs _ _ [] = ([], [])
blanchet@43085
   411
  | iter_type_class_pairs thy tycons classes =
blanchet@43263
   412
      let
blanchet@43263
   413
        fun maybe_insert_class s =
blanchet@43263
   414
          (s <> type_class andalso not (member (op =) classes s))
blanchet@43263
   415
          ? insert (op =) s
blanchet@43263
   416
        val cpairs = type_class_pairs thy tycons classes
blanchet@43263
   417
        val newclasses =
blanchet@43263
   418
          [] |> fold (fold (fold (fold maybe_insert_class) o snd) o snd) cpairs
blanchet@43263
   419
        val (classes', cpairs') = iter_type_class_pairs thy tycons newclasses
blanchet@43266
   420
      in (classes' @ classes, union (op =) cpairs' cpairs) end
blanchet@43085
   421
blanchet@43085
   422
fun make_arity_clauses thy tycons =
blanchet@43085
   423
  iter_type_class_pairs thy tycons ##> multi_arity_clause
blanchet@43085
   424
blanchet@43085
   425
blanchet@43085
   426
(** Isabelle class relations **)
blanchet@43085
   427
blanchet@43086
   428
type class_rel_clause =
blanchet@43496
   429
  {name : string,
blanchet@43496
   430
   subclass : name,
blanchet@43496
   431
   superclass : name}
blanchet@43085
   432
blanchet@43622
   433
(* Generate all pairs (sub, super) such that sub is a proper subclass of super
blanchet@43622
   434
   in theory "thy". *)
blanchet@43085
   435
fun class_pairs _ [] _ = []
blanchet@43085
   436
  | class_pairs thy subs supers =
blanchet@43085
   437
      let
blanchet@43085
   438
        val class_less = Sorts.class_less (Sign.classes_of thy)
blanchet@43085
   439
        fun add_super sub super = class_less (sub, super) ? cons (sub, super)
blanchet@43085
   440
        fun add_supers sub = fold (add_super sub) supers
blanchet@43085
   441
      in fold add_supers subs [] end
blanchet@43085
   442
blanchet@43622
   443
fun make_class_rel_clause (sub, super) =
blanchet@43622
   444
  {name = sub ^ "_" ^ super, subclass = `make_type_class sub,
blanchet@43086
   445
   superclass = `make_type_class super}
blanchet@43085
   446
blanchet@43085
   447
fun make_class_rel_clauses thy subs supers =
blanchet@43093
   448
  map make_class_rel_clause (class_pairs thy subs supers)
blanchet@43085
   449
blanchet@43085
   450
datatype combterm =
blanchet@43085
   451
  CombConst of name * typ * typ list |
blanchet@43085
   452
  CombVar of name * typ |
nik@43677
   453
  CombApp of combterm * combterm |
nik@43677
   454
  CombAbs of (name * typ) * combterm
blanchet@43085
   455
blanchet@43085
   456
fun combtyp_of (CombConst (_, T, _)) = T
blanchet@43085
   457
  | combtyp_of (CombVar (_, T)) = T
blanchet@43085
   458
  | combtyp_of (CombApp (t1, _)) = snd (dest_funT (combtyp_of t1))
nik@43677
   459
  | combtyp_of (CombAbs ((_, T), tm)) = T --> combtyp_of tm
blanchet@43085
   460
blanchet@43085
   461
(*gets the head of a combinator application, along with the list of arguments*)
blanchet@43085
   462
fun strip_combterm_comb u =
blanchet@43496
   463
  let
blanchet@43496
   464
    fun stripc (CombApp (t, u), ts) = stripc (t, u :: ts)
blanchet@43496
   465
      | stripc x = x
blanchet@43496
   466
  in stripc (u, []) end
blanchet@43085
   467
blanchet@43085
   468
fun atyps_of T = fold_atyps (insert (op =)) T []
blanchet@43085
   469
blanchet@43085
   470
fun new_skolem_const_name s num_T_args =
blanchet@43085
   471
  [new_skolem_const_prefix, s, string_of_int num_T_args]
blanchet@43085
   472
  |> space_implode Long_Name.separator
blanchet@43085
   473
blanchet@43085
   474
(* Converts a term (with combinators) into a combterm. Also accumulates sort
blanchet@43085
   475
   infomation. *)
blanchet@43085
   476
fun combterm_from_term thy bs (P $ Q) =
blanchet@43085
   477
    let
blanchet@43085
   478
      val (P', P_atomics_Ts) = combterm_from_term thy bs P
blanchet@43085
   479
      val (Q', Q_atomics_Ts) = combterm_from_term thy bs Q
blanchet@43085
   480
    in (CombApp (P', Q'), union (op =) P_atomics_Ts Q_atomics_Ts) end
blanchet@43085
   481
  | combterm_from_term thy _ (Const (c, T)) =
blanchet@43085
   482
    let
blanchet@43085
   483
      val tvar_list =
blanchet@43085
   484
        (if String.isPrefix old_skolem_const_prefix c then
blanchet@43085
   485
           [] |> Term.add_tvarsT T |> map TVar
blanchet@43085
   486
         else
blanchet@43085
   487
           (c, T) |> Sign.const_typargs thy)
blanchet@43085
   488
      val c' = CombConst (`make_fixed_const c, T, tvar_list)
blanchet@43085
   489
    in (c', atyps_of T) end
blanchet@43085
   490
  | combterm_from_term _ _ (Free (v, T)) =
blanchet@43085
   491
    (CombConst (`make_fixed_var v, T, []), atyps_of T)
blanchet@43085
   492
  | combterm_from_term _ _ (Var (v as (s, _), T)) =
blanchet@43085
   493
    (if String.isPrefix Meson_Clausify.new_skolem_var_prefix s then
blanchet@43085
   494
       let
blanchet@43085
   495
         val Ts = T |> strip_type |> swap |> op ::
blanchet@43085
   496
         val s' = new_skolem_const_name s (length Ts)
blanchet@43085
   497
       in CombConst (`make_fixed_const s', T, Ts) end
blanchet@43085
   498
     else
blanchet@43085
   499
       CombVar ((make_schematic_var v, s), T), atyps_of T)
blanchet@43085
   500
  | combterm_from_term _ bs (Bound j) =
blanchet@43085
   501
    nth bs j
blanchet@43085
   502
    |> (fn (s, T) => (CombConst (`make_bound_var s, T, []), atyps_of T))
nik@43677
   503
  | combterm_from_term thy bs (Abs (s, T, t)) =
nik@43678
   504
    let
nik@43678
   505
      fun vary s = s |> AList.defined (op =) bs s ? vary o Symbol.bump_string
nik@43678
   506
      val s = vary s
nik@43678
   507
      val (tm, atomic_Ts) = combterm_from_term thy ((s, T) :: bs) t
nik@43678
   508
    in
nik@43677
   509
      (CombAbs ((`make_bound_var s, T), tm),
nik@43677
   510
       union (op =) atomic_Ts (atyps_of T))
nik@43677
   511
    end
blanchet@43085
   512
blanchet@43421
   513
datatype locality =
blanchet@43421
   514
  General | Helper | Extensionality | Intro | Elim | Simp | Local | Assum |
blanchet@43421
   515
  Chained
blanchet@43085
   516
blanchet@43085
   517
(* (quasi-)underapproximation of the truth *)
blanchet@43085
   518
fun is_locality_global Local = false
blanchet@43085
   519
  | is_locality_global Assum = false
blanchet@43085
   520
  | is_locality_global Chained = false
blanchet@43085
   521
  | is_locality_global _ = true
blanchet@43085
   522
blanchet@43624
   523
datatype order = First_Order | Higher_Order
blanchet@42613
   524
datatype polymorphism = Polymorphic | Monomorphic | Mangled_Monomorphic
blanchet@42613
   525
datatype type_level =
blanchet@43362
   526
  All_Types | Noninf_Nonmono_Types | Fin_Nonmono_Types | Const_Arg_Types |
blanchet@43362
   527
  No_Types
blanchet@43128
   528
datatype type_heaviness = Heavyweight | Lightweight
blanchet@42613
   529
blanchet@43626
   530
datatype type_enc =
blanchet@43624
   531
  Simple_Types of order * type_level |
blanchet@42837
   532
  Preds of polymorphism * type_level * type_heaviness |
blanchet@42837
   533
  Tags of polymorphism * type_level * type_heaviness
blanchet@42613
   534
blanchet@42689
   535
fun try_unsuffixes ss s =
blanchet@42689
   536
  fold (fn s' => fn NONE => try (unsuffix s') s | some => some) ss NONE
blanchet@42689
   537
blanchet@43626
   538
fun type_enc_from_string s =
blanchet@42722
   539
  (case try (unprefix "poly_") s of
blanchet@42722
   540
     SOME s => (SOME Polymorphic, s)
blanchet@42613
   541
   | NONE =>
blanchet@42613
   542
     case try (unprefix "mono_") s of
blanchet@42722
   543
       SOME s => (SOME Monomorphic, s)
blanchet@42722
   544
     | NONE =>
blanchet@42722
   545
       case try (unprefix "mangled_") s of
blanchet@42722
   546
         SOME s => (SOME Mangled_Monomorphic, s)
blanchet@42722
   547
       | NONE => (NONE, s))
blanchet@42613
   548
  ||> (fn s =>
blanchet@43624
   549
          (* "_query" and "_bang" are for the ASCII-challenged Metis and
blanchet@43624
   550
             Mirabelle. *)
blanchet@42689
   551
          case try_unsuffixes ["?", "_query"] s of
blanchet@43362
   552
            SOME s => (Noninf_Nonmono_Types, s)
blanchet@42613
   553
          | NONE =>
blanchet@42689
   554
            case try_unsuffixes ["!", "_bang"] s of
blanchet@43362
   555
              SOME s => (Fin_Nonmono_Types, s)
blanchet@42613
   556
            | NONE => (All_Types, s))
blanchet@42828
   557
  ||> apsnd (fn s =>
blanchet@42837
   558
                case try (unsuffix "_heavy") s of
blanchet@43128
   559
                  SOME s => (Heavyweight, s)
blanchet@43128
   560
                | NONE => (Lightweight, s))
blanchet@42837
   561
  |> (fn (poly, (level, (heaviness, core))) =>
blanchet@42837
   562
         case (core, (poly, level, heaviness)) of
blanchet@43624
   563
           ("simple", (NONE, _, Lightweight)) =>
blanchet@43624
   564
           Simple_Types (First_Order, level)
blanchet@43624
   565
         | ("simple_higher", (NONE, _, Lightweight)) =>
nik@43676
   566
           if level = Noninf_Nonmono_Types then raise Same.SAME
nik@43676
   567
           else Simple_Types (Higher_Order, level)
blanchet@42854
   568
         | ("preds", (SOME poly, _, _)) => Preds (poly, level, heaviness)
blanchet@42886
   569
         | ("tags", (SOME Polymorphic, _, _)) =>
blanchet@43361
   570
           Tags (Polymorphic, level, heaviness)
blanchet@42854
   571
         | ("tags", (SOME poly, _, _)) => Tags (poly, level, heaviness)
blanchet@43128
   572
         | ("args", (SOME poly, All_Types (* naja *), Lightweight)) =>
blanchet@43128
   573
           Preds (poly, Const_Arg_Types, Lightweight)
blanchet@43128
   574
         | ("erased", (NONE, All_Types (* naja *), Lightweight)) =>
blanchet@43128
   575
           Preds (Polymorphic, No_Types, Lightweight)
blanchet@42753
   576
         | _ => raise Same.SAME)
blanchet@42753
   577
  handle Same.SAME => error ("Unknown type system: " ^ quote s ^ ".")
blanchet@42613
   578
blanchet@43626
   579
fun is_type_enc_higher_order (Simple_Types (Higher_Order, _)) = true
blanchet@43626
   580
  | is_type_enc_higher_order _ = false
blanchet@43624
   581
blanchet@43626
   582
fun polymorphism_of_type_enc (Simple_Types _) = Mangled_Monomorphic
blanchet@43626
   583
  | polymorphism_of_type_enc (Preds (poly, _, _)) = poly
blanchet@43626
   584
  | polymorphism_of_type_enc (Tags (poly, _, _)) = poly
blanchet@42613
   585
blanchet@43626
   586
fun level_of_type_enc (Simple_Types (_, level)) = level
blanchet@43626
   587
  | level_of_type_enc (Preds (_, level, _)) = level
blanchet@43626
   588
  | level_of_type_enc (Tags (_, level, _)) = level
blanchet@42828
   589
blanchet@43626
   590
fun heaviness_of_type_enc (Simple_Types _) = Heavyweight
blanchet@43626
   591
  | heaviness_of_type_enc (Preds (_, _, heaviness)) = heaviness
blanchet@43626
   592
  | heaviness_of_type_enc (Tags (_, _, heaviness)) = heaviness
blanchet@42831
   593
blanchet@42687
   594
fun is_type_level_virtually_sound level =
blanchet@43362
   595
  level = All_Types orelse level = Noninf_Nonmono_Types
blanchet@43626
   596
val is_type_enc_virtually_sound =
blanchet@43626
   597
  is_type_level_virtually_sound o level_of_type_enc
blanchet@42613
   598
blanchet@42613
   599
fun is_type_level_fairly_sound level =
blanchet@43362
   600
  is_type_level_virtually_sound level orelse level = Fin_Nonmono_Types
blanchet@43626
   601
val is_type_enc_fairly_sound = is_type_level_fairly_sound o level_of_type_enc
blanchet@42613
   602
blanchet@43624
   603
fun choose_format formats (Simple_Types (order, level)) =
blanchet@43624
   604
    if member (op =) formats THF then
blanchet@43624
   605
      (THF, Simple_Types (order, level))
blanchet@43624
   606
    else if member (op =) formats TFF then
blanchet@43624
   607
      (TFF, Simple_Types (First_Order, level))
blanchet@43624
   608
    else
blanchet@43624
   609
      choose_format formats (Preds (Mangled_Monomorphic, level, Heavyweight))
blanchet@43626
   610
  | choose_format formats type_enc =
blanchet@43101
   611
    (case hd formats of
blanchet@43101
   612
       CNF_UEQ =>
blanchet@43626
   613
       (CNF_UEQ, case type_enc of
blanchet@43101
   614
                   Preds stuff =>
blanchet@43626
   615
                   (if is_type_enc_fairly_sound type_enc then Tags else Preds)
blanchet@43101
   616
                       stuff
blanchet@43626
   617
                 | _ => type_enc)
blanchet@43626
   618
     | format => (format, type_enc))
blanchet@43101
   619
blanchet@40114
   620
type translated_formula =
blanchet@43496
   621
  {name : string,
blanchet@43496
   622
   locality : locality,
blanchet@43496
   623
   kind : formula_kind,
blanchet@43496
   624
   combformula : (name, typ, combterm) formula,
blanchet@43496
   625
   atomic_types : typ list}
blanchet@38282
   626
blanchet@42640
   627
fun update_combformula f ({name, locality, kind, combformula, atomic_types}
blanchet@42640
   628
                          : translated_formula) =
blanchet@42640
   629
  {name = name, locality = locality, kind = kind, combformula = f combformula,
blanchet@42562
   630
   atomic_types = atomic_types} : translated_formula
blanchet@42542
   631
blanchet@42558
   632
fun fact_lift f ({combformula, ...} : translated_formula) = f combformula
blanchet@42558
   633
blanchet@43064
   634
val type_instance = Sign.typ_instance o Proof_Context.theory_of
blanchet@43064
   635
blanchet@43064
   636
fun insert_type ctxt get_T x xs =
blanchet@43064
   637
  let val T = get_T x in
blanchet@43064
   638
    if exists (curry (type_instance ctxt) T o get_T) xs then xs
blanchet@43064
   639
    else x :: filter_out (curry (type_instance ctxt o swap) T o get_T) xs
blanchet@43064
   640
  end
blanchet@42677
   641
blanchet@42753
   642
(* The Booleans indicate whether all type arguments should be kept. *)
blanchet@42753
   643
datatype type_arg_policy =
blanchet@42753
   644
  Explicit_Type_Args of bool |
blanchet@42753
   645
  Mangled_Type_Args of bool |
blanchet@42753
   646
  No_Type_Args
blanchet@41136
   647
blanchet@42836
   648
fun should_drop_arg_type_args (Simple_Types _) =
blanchet@42836
   649
    false (* since TFF doesn't support overloading *)
blanchet@43626
   650
  | should_drop_arg_type_args type_enc =
blanchet@43626
   651
    level_of_type_enc type_enc = All_Types andalso
blanchet@43626
   652
    heaviness_of_type_enc type_enc = Heavyweight
blanchet@42831
   653
blanchet@43626
   654
fun type_arg_policy type_enc s =
blanchet@43628
   655
  if s = type_tag_name then
blanchet@43626
   656
    (if polymorphism_of_type_enc type_enc = Mangled_Monomorphic then
blanchet@43623
   657
       Mangled_Type_Args
blanchet@43623
   658
     else
blanchet@43623
   659
       Explicit_Type_Args) false
blanchet@43628
   660
  else case type_enc of
blanchet@43628
   661
    Tags (_, All_Types, Heavyweight) => No_Type_Args
blanchet@43628
   662
  | _ =>
blanchet@43628
   663
    if level_of_type_enc type_enc = No_Types orelse
blanchet@43628
   664
       s = @{const_name HOL.eq} orelse
blanchet@43628
   665
       (s = app_op_name andalso
blanchet@43628
   666
        level_of_type_enc type_enc = Const_Arg_Types) then
blanchet@43628
   667
      No_Type_Args
blanchet@43628
   668
    else
blanchet@43628
   669
      should_drop_arg_type_args type_enc
blanchet@43628
   670
      |> (if polymorphism_of_type_enc type_enc = Mangled_Monomorphic then
blanchet@43628
   671
            Mangled_Type_Args
blanchet@43628
   672
          else
blanchet@43628
   673
            Explicit_Type_Args)
blanchet@42227
   674
blanchet@43628
   675
(* Make literals for sorted type variables. *)
blanchet@43263
   676
fun generic_add_sorts_on_type (_, []) = I
blanchet@43263
   677
  | generic_add_sorts_on_type ((x, i), s :: ss) =
blanchet@43263
   678
    generic_add_sorts_on_type ((x, i), ss)
blanchet@43263
   679
    #> (if s = the_single @{sort HOL.type} then
blanchet@43093
   680
          I
blanchet@43093
   681
        else if i = ~1 then
blanchet@43263
   682
          insert (op =) (TyLitFree (`make_type_class s, `make_fixed_type_var x))
blanchet@43093
   683
        else
blanchet@43263
   684
          insert (op =) (TyLitVar (`make_type_class s,
blanchet@43263
   685
                                   (make_schematic_type_var (x, i), x))))
blanchet@43263
   686
fun add_sorts_on_tfree (TFree (s, S)) = generic_add_sorts_on_type ((s, ~1), S)
blanchet@43263
   687
  | add_sorts_on_tfree _ = I
blanchet@43263
   688
fun add_sorts_on_tvar (TVar z) = generic_add_sorts_on_type z
blanchet@43263
   689
  | add_sorts_on_tvar _ = I
blanchet@43085
   690
blanchet@43626
   691
fun type_literals_for_types type_enc add_sorts_on_typ Ts =
blanchet@43626
   692
  [] |> level_of_type_enc type_enc <> No_Types ? fold add_sorts_on_typ Ts
blanchet@41137
   693
blanchet@42534
   694
fun mk_aconns c phis =
blanchet@42534
   695
  let val (phis', phi') = split_last phis in
blanchet@42534
   696
    fold_rev (mk_aconn c) phis' phi'
blanchet@42534
   697
  end
blanchet@38282
   698
fun mk_ahorn [] phi = phi
blanchet@42534
   699
  | mk_ahorn phis psi = AConn (AImplies, [mk_aconns AAnd phis, psi])
blanchet@42522
   700
fun mk_aquant _ [] phi = phi
blanchet@42522
   701
  | mk_aquant q xs (phi as AQuant (q', xs', phi')) =
blanchet@42522
   702
    if q = q' then AQuant (q, xs @ xs', phi') else AQuant (q, xs, phi)
blanchet@42522
   703
  | mk_aquant q xs phi = AQuant (q, xs, phi)
blanchet@38282
   704
blanchet@42522
   705
fun close_universally atom_vars phi =
blanchet@41145
   706
  let
blanchet@41145
   707
    fun formula_vars bounds (AQuant (_, xs, phi)) =
blanchet@42526
   708
        formula_vars (map fst xs @ bounds) phi
blanchet@41145
   709
      | formula_vars bounds (AConn (_, phis)) = fold (formula_vars bounds) phis
blanchet@42522
   710
      | formula_vars bounds (AAtom tm) =
blanchet@42526
   711
        union (op =) (atom_vars tm []
blanchet@42526
   712
                      |> filter_out (member (op =) bounds o fst))
blanchet@42522
   713
  in mk_aquant AForall (formula_vars [] phi []) phi end
blanchet@42522
   714
blanchet@42531
   715
fun combterm_vars (CombApp (tm1, tm2)) = fold combterm_vars [tm1, tm2]
blanchet@42522
   716
  | combterm_vars (CombConst _) = I
blanchet@42574
   717
  | combterm_vars (CombVar (name, T)) = insert (op =) (name, SOME T)
nik@43677
   718
  | combterm_vars (CombAbs (_, tm)) = combterm_vars tm
blanchet@42674
   719
fun close_combformula_universally phi = close_universally combterm_vars phi
blanchet@42522
   720
nik@43676
   721
fun term_vars bounds (ATerm (name as (s, _), tms)) =
nik@43676
   722
    (is_tptp_variable s andalso not (member (op =) bounds name))
nik@43676
   723
    ? insert (op =) (name, NONE) #> fold (term_vars bounds) tms
nik@43676
   724
  | term_vars bounds (AAbs ((name, _), tm)) = term_vars (name :: bounds) tm
nik@43676
   725
fun close_formula_universally phi = close_universally (term_vars []) phi
blanchet@41145
   726
blanchet@42994
   727
val homo_infinite_type_name = @{type_name ind} (* any infinite type *)
blanchet@42994
   728
val homo_infinite_type = Type (homo_infinite_type_name, [])
blanchet@42994
   729
nik@43676
   730
fun ho_term_from_typ format type_enc =
blanchet@42994
   731
  let
blanchet@42994
   732
    fun term (Type (s, Ts)) =
blanchet@43626
   733
      ATerm (case (is_type_enc_higher_order type_enc, s) of
blanchet@42994
   734
               (true, @{type_name bool}) => `I tptp_bool_type
blanchet@42994
   735
             | (true, @{type_name fun}) => `I tptp_fun_type
blanchet@43178
   736
             | _ => if s = homo_infinite_type_name andalso
blanchet@43178
   737
                       (format = TFF orelse format = THF) then
blanchet@43178
   738
                      `I tptp_individual_type
blanchet@43178
   739
                    else
blanchet@43178
   740
                      `make_fixed_type_const s,
blanchet@42994
   741
             map term Ts)
blanchet@42994
   742
    | term (TFree (s, _)) = ATerm (`make_fixed_type_var s, [])
blanchet@42994
   743
    | term (TVar ((x as (s, _)), _)) =
blanchet@42994
   744
      ATerm ((make_schematic_type_var x, s), [])
blanchet@42994
   745
  in term end
blanchet@42562
   746
nik@43676
   747
fun ho_term_for_type_arg format type_enc T =
nik@43676
   748
  if T = dummyT then NONE else SOME (ho_term_from_typ format type_enc T)
blanchet@43401
   749
blanchet@42562
   750
(* This shouldn't clash with anything else. *)
blanchet@42542
   751
val mangled_type_sep = "\000"
blanchet@42542
   752
blanchet@42562
   753
fun generic_mangled_type_name f (ATerm (name, [])) = f name
blanchet@42562
   754
  | generic_mangled_type_name f (ATerm (name, tys)) =
blanchet@42761
   755
    f name ^ "(" ^ space_implode "," (map (generic_mangled_type_name f) tys)
blanchet@42761
   756
    ^ ")"
blanchet@43692
   757
  | generic_mangled_type_name _ _ = raise Fail "unexpected type abstraction"
blanchet@42542
   758
blanchet@42998
   759
val bool_atype = AType (`I tptp_bool_type)
blanchet@42998
   760
blanchet@43085
   761
fun make_simple_type s =
blanchet@43085
   762
  if s = tptp_bool_type orelse s = tptp_fun_type orelse
blanchet@43085
   763
     s = tptp_individual_type then
blanchet@43085
   764
    s
blanchet@43085
   765
  else
blanchet@43085
   766
    simple_type_prefix ^ ascii_of s
blanchet@43085
   767
nik@43676
   768
fun ho_type_from_ho_term type_enc pred_sym ary =
blanchet@42963
   769
  let
blanchet@42963
   770
    fun to_atype ty =
blanchet@42963
   771
      AType ((make_simple_type (generic_mangled_type_name fst ty),
blanchet@42963
   772
              generic_mangled_type_name snd ty))
blanchet@42963
   773
    fun to_afun f1 f2 tys = AFun (f1 (hd tys), f2 (nth tys 1))
blanchet@42998
   774
    fun to_fo 0 ty = if pred_sym then bool_atype else to_atype ty
blanchet@42994
   775
      | to_fo ary (ATerm (_, tys)) = to_afun to_atype (to_fo (ary - 1)) tys
blanchet@43692
   776
      | to_fo _ _ = raise Fail "unexpected type abstraction"
blanchet@42994
   777
    fun to_ho (ty as ATerm ((s, _), tys)) =
nik@43676
   778
        if s = tptp_fun_type then to_afun to_ho to_ho tys else to_atype ty
nik@43676
   779
      | to_ho _ = raise Fail "unexpected type abstraction"
blanchet@43626
   780
  in if is_type_enc_higher_order type_enc then to_ho else to_fo ary end
blanchet@42963
   781
nik@43677
   782
fun ho_type_from_typ format type_enc pred_sym ary =
nik@43676
   783
  ho_type_from_ho_term type_enc pred_sym ary
nik@43676
   784
  o ho_term_from_typ format type_enc
blanchet@42963
   785
blanchet@43626
   786
fun mangled_const_name format type_enc T_args (s, s') =
blanchet@42963
   787
  let
nik@43676
   788
    val ty_args = T_args |> map_filter (ho_term_for_type_arg format type_enc)
blanchet@42963
   789
    fun type_suffix f g =
blanchet@42963
   790
      fold_rev (curry (op ^) o g o prefix mangled_type_sep
blanchet@42963
   791
                o generic_mangled_type_name f) ty_args ""
blanchet@42963
   792
  in (s ^ type_suffix fst ascii_of, s' ^ type_suffix snd I) end
blanchet@42542
   793
blanchet@42542
   794
val parse_mangled_ident =
blanchet@42542
   795
  Scan.many1 (not o member (op =) ["(", ")", ","]) >> implode
blanchet@42542
   796
blanchet@42542
   797
fun parse_mangled_type x =
blanchet@42542
   798
  (parse_mangled_ident
blanchet@42542
   799
   -- Scan.optional ($$ "(" |-- Scan.optional parse_mangled_types [] --| $$ ")")
blanchet@42542
   800
                    [] >> ATerm) x
blanchet@42542
   801
and parse_mangled_types x =
blanchet@42542
   802
  (parse_mangled_type ::: Scan.repeat ($$ "," |-- parse_mangled_type)) x
blanchet@42542
   803
blanchet@42542
   804
fun unmangled_type s =
blanchet@42542
   805
  s |> suffix ")" |> raw_explode
blanchet@42542
   806
    |> Scan.finite Symbol.stopper
blanchet@42542
   807
           (Scan.error (!! (fn _ => raise Fail ("unrecognized mangled type " ^
blanchet@42542
   808
                                                quote s)) parse_mangled_type))
blanchet@42542
   809
    |> fst
blanchet@42542
   810
blanchet@42561
   811
val unmangled_const_name = space_explode mangled_type_sep #> hd
blanchet@42542
   812
fun unmangled_const s =
blanchet@42542
   813
  let val ss = space_explode mangled_type_sep s in
blanchet@42542
   814
    (hd ss, map unmangled_type (tl ss))
blanchet@42542
   815
  end
blanchet@42542
   816
blanchet@43626
   817
fun introduce_proxies type_enc =
blanchet@42568
   818
  let
blanchet@43017
   819
    fun intro top_level (CombApp (tm1, tm2)) =
blanchet@43017
   820
        CombApp (intro top_level tm1, intro false tm2)
blanchet@43017
   821
      | intro top_level (CombConst (name as (s, _), T, T_args)) =
blanchet@42570
   822
        (case proxify_const s of
blanchet@43159
   823
           SOME proxy_base =>
blanchet@43626
   824
           if top_level orelse is_type_enc_higher_order type_enc then
blanchet@43000
   825
             case (top_level, s) of
blanchet@43000
   826
               (_, "c_False") => (`I tptp_false, [])
blanchet@43000
   827
             | (_, "c_True") => (`I tptp_true, [])
blanchet@43000
   828
             | (false, "c_Not") => (`I tptp_not, [])
blanchet@43000
   829
             | (false, "c_conj") => (`I tptp_and, [])
blanchet@43000
   830
             | (false, "c_disj") => (`I tptp_or, [])
blanchet@43000
   831
             | (false, "c_implies") => (`I tptp_implies, [])
nik@43678
   832
             | (false, "c_All") => (`I tptp_ho_forall, [])
nik@43678
   833
             | (false, "c_Ex") => (`I tptp_ho_exists, [])
blanchet@43000
   834
             | (false, s) =>
blanchet@43017
   835
               if is_tptp_equal s then (`I tptp_equal, [])
blanchet@43017
   836
               else (proxy_base |>> prefix const_prefix, T_args)
blanchet@43000
   837
             | _ => (name, [])
blanchet@42569
   838
           else
blanchet@42574
   839
             (proxy_base |>> prefix const_prefix, T_args)
blanchet@42574
   840
          | NONE => (name, T_args))
blanchet@42574
   841
        |> (fn (name, T_args) => CombConst (name, T, T_args))
nik@43677
   842
      | intro _ (CombAbs (bound, tm)) = CombAbs (bound, intro false tm)
blanchet@43017
   843
      | intro _ tm = tm
blanchet@43017
   844
  in intro true end
blanchet@42568
   845
blanchet@43626
   846
fun combformula_from_prop thy type_enc eq_as_iff =
blanchet@38282
   847
  let
blanchet@42568
   848
    fun do_term bs t atomic_types =
blanchet@41140
   849
      combterm_from_term thy bs (Envir.eta_contract t)
blanchet@43626
   850
      |>> (introduce_proxies type_enc #> AAtom)
blanchet@42568
   851
      ||> union (op =) atomic_types
blanchet@38282
   852
    fun do_quant bs q s T t' =
wenzelm@43324
   853
      let val s = singleton (Name.variant_list (map fst bs)) s in
blanchet@38518
   854
        do_formula ((s, T) :: bs) t'
blanchet@42562
   855
        #>> mk_aquant q [(`make_bound_var s, SOME T)]
blanchet@38518
   856
      end
blanchet@38282
   857
    and do_conn bs c t1 t2 =
blanchet@43198
   858
      do_formula bs t1 ##>> do_formula bs t2 #>> uncurry (mk_aconn c)
blanchet@38282
   859
    and do_formula bs t =
blanchet@38282
   860
      case t of
blanchet@43096
   861
        @{const Trueprop} $ t1 => do_formula bs t1
blanchet@43096
   862
      | @{const Not} $ t1 => do_formula bs t1 #>> mk_anot
blanchet@38282
   863
      | Const (@{const_name All}, _) $ Abs (s, T, t') =>
blanchet@38282
   864
        do_quant bs AForall s T t'
blanchet@38282
   865
      | Const (@{const_name Ex}, _) $ Abs (s, T, t') =>
blanchet@38282
   866
        do_quant bs AExists s T t'
haftmann@38795
   867
      | @{const HOL.conj} $ t1 $ t2 => do_conn bs AAnd t1 t2
haftmann@38795
   868
      | @{const HOL.disj} $ t1 $ t2 => do_conn bs AOr t1 t2
haftmann@38786
   869
      | @{const HOL.implies} $ t1 $ t2 => do_conn bs AImplies t1 t2
haftmann@38864
   870
      | Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 =>
blanchet@41140
   871
        if eq_as_iff then do_conn bs AIff t1 t2 else do_term bs t
blanchet@41140
   872
      | _ => do_term bs t
blanchet@38282
   873
  in do_formula [] end
blanchet@38282
   874
blanchet@43264
   875
fun presimplify_term _ [] t = t
blanchet@43264
   876
  | presimplify_term ctxt presimp_consts t =
blanchet@43264
   877
    t |> exists_Const (member (op =) presimp_consts o fst) t
blanchet@43264
   878
         ? (Skip_Proof.make_thm (Proof_Context.theory_of ctxt)
blanchet@43264
   879
            #> Meson.presimplify ctxt
blanchet@43264
   880
            #> prop_of)
blanchet@38282
   881
wenzelm@41491
   882
fun concealed_bound_name j = sledgehammer_weak_prefix ^ string_of_int j
blanchet@38282
   883
fun conceal_bounds Ts t =
blanchet@38282
   884
  subst_bounds (map (Free o apfst concealed_bound_name)
blanchet@38282
   885
                    (0 upto length Ts - 1 ~~ Ts), t)
blanchet@38282
   886
fun reveal_bounds Ts =
blanchet@38282
   887
  subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j))
blanchet@38282
   888
                    (0 upto length Ts - 1 ~~ Ts))
blanchet@38282
   889
blanchet@43265
   890
fun is_fun_equality (@{const_name HOL.eq},
blanchet@43265
   891
                     Type (_, [Type (@{type_name fun}, _), _])) = true
blanchet@43265
   892
  | is_fun_equality _ = false
blanchet@43265
   893
blanchet@42747
   894
fun extensionalize_term ctxt t =
blanchet@43265
   895
  if exists_Const is_fun_equality t then
blanchet@43265
   896
    let val thy = Proof_Context.theory_of ctxt in
blanchet@43265
   897
      t |> cterm_of thy |> Meson.extensionalize_conv ctxt
blanchet@43265
   898
        |> prop_of |> Logic.dest_equals |> snd
blanchet@43265
   899
    end
blanchet@43265
   900
  else
blanchet@43265
   901
    t
blanchet@38608
   902
blanchet@43856
   903
fun generic_translate_lambdas do_lambdas ctxt t =
blanchet@43856
   904
  let
blanchet@43856
   905
    fun aux Ts t =
blanchet@43856
   906
      case t of
blanchet@43856
   907
        @{const Not} $ t1 => @{const Not} $ aux Ts t1
blanchet@43856
   908
      | (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') =>
blanchet@43856
   909
        t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@43856
   910
      | (t0 as Const (@{const_name All}, _)) $ t1 =>
blanchet@43856
   911
        aux Ts (t0 $ eta_expand Ts t1 1)
blanchet@43856
   912
      | (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') =>
blanchet@43856
   913
        t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@43856
   914
      | (t0 as Const (@{const_name Ex}, _)) $ t1 =>
blanchet@43856
   915
        aux Ts (t0 $ eta_expand Ts t1 1)
blanchet@43856
   916
      | (t0 as @{const HOL.conj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
blanchet@43856
   917
      | (t0 as @{const HOL.disj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
blanchet@43856
   918
      | (t0 as @{const HOL.implies}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
blanchet@43856
   919
      | (t0 as Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])))
blanchet@43856
   920
          $ t1 $ t2 =>
blanchet@43856
   921
        t0 $ aux Ts t1 $ aux Ts t2
blanchet@43856
   922
      | _ =>
blanchet@43856
   923
        if not (exists_subterm (fn Abs _ => true | _ => false) t) then t
blanchet@43856
   924
        else t |> Envir.eta_contract |> do_lambdas ctxt Ts
blanchet@43856
   925
    val (t, ctxt') = Variable.import_terms true [t] ctxt |>> the_single
blanchet@43856
   926
  in t |> aux [] |> singleton (Variable.export_terms ctxt' ctxt) end
blanchet@43856
   927
blanchet@43856
   928
fun do_conceal_lambdas Ts (t1 $ t2) =
blanchet@43856
   929
    do_conceal_lambdas Ts t1 $ do_conceal_lambdas Ts t2
blanchet@43856
   930
  | do_conceal_lambdas Ts (Abs (_, T, t)) =
blanchet@43828
   931
    (* slightly unsound because of hash collisions *)
blanchet@43827
   932
    Free (concealed_lambda_prefix ^ string_of_int (hash_term t),
blanchet@43827
   933
          T --> fastype_of1 (Ts, t))
blanchet@43856
   934
  | do_conceal_lambdas _ t = t
blanchet@43856
   935
val conceal_lambdas = generic_translate_lambdas (K do_conceal_lambdas)
blanchet@43827
   936
blanchet@43856
   937
fun do_introduce_combinators ctxt Ts =
blanchet@43856
   938
  let val thy = Proof_Context.theory_of ctxt in
blanchet@43856
   939
    conceal_bounds Ts
blanchet@43856
   940
    #> cterm_of thy
blanchet@43856
   941
    #> Meson_Clausify.introduce_combinators_in_cterm
blanchet@43856
   942
    #> prop_of #> Logic.dest_equals #> snd
blanchet@43856
   943
    #> reveal_bounds Ts
blanchet@43856
   944
  end
blanchet@43856
   945
val introduce_combinators = generic_translate_lambdas do_introduce_combinators
blanchet@43856
   946
blanchet@43856
   947
fun process_abstractions_in_term ctxt trans_lambdas kind t =
wenzelm@42361
   948
  let val thy = Proof_Context.theory_of ctxt in
blanchet@38491
   949
    if Meson.is_fol_term thy t then
blanchet@38491
   950
      t
blanchet@38491
   951
    else
blanchet@43856
   952
      t |> singleton trans_lambdas
blanchet@38491
   953
      handle THM _ =>
blanchet@38491
   954
             (* A type variable of sort "{}" will make abstraction fail. *)
blanchet@38613
   955
             if kind = Conjecture then HOLogic.false_const
blanchet@38613
   956
             else HOLogic.true_const
blanchet@38491
   957
  end
blanchet@38282
   958
blanchet@38282
   959
(* Metis's use of "resolve_tac" freezes the schematic variables. We simulate the
blanchet@42353
   960
   same in Sledgehammer to prevent the discovery of unreplayable proofs. *)
blanchet@38282
   961
fun freeze_term t =
blanchet@38282
   962
  let
blanchet@38282
   963
    fun aux (t $ u) = aux t $ aux u
blanchet@38282
   964
      | aux (Abs (s, T, t)) = Abs (s, T, aux t)
blanchet@38282
   965
      | aux (Var ((s, i), T)) =
blanchet@38282
   966
        Free (sledgehammer_weak_prefix ^ s ^ "_" ^ string_of_int i, T)
blanchet@38282
   967
      | aux t = t
blanchet@38282
   968
  in t |> exists_subterm is_Var t ? aux end
blanchet@38282
   969
blanchet@43856
   970
fun preprocess_prop ctxt trans_lambdas presimp_consts kind t =
blanchet@38282
   971
  let
wenzelm@42361
   972
    val thy = Proof_Context.theory_of ctxt
blanchet@38608
   973
    val t = t |> Envir.beta_eta_contract
blanchet@42944
   974
              |> transform_elim_prop
blanchet@41211
   975
              |> Object_Logic.atomize_term thy
blanchet@42563
   976
    val need_trueprop = (fastype_of t = @{typ bool})
blanchet@43096
   977
  in
blanchet@43096
   978
    t |> need_trueprop ? HOLogic.mk_Trueprop
blanchet@43096
   979
      |> Raw_Simplifier.rewrite_term thy (Meson.unfold_set_const_simps ctxt) []
blanchet@43096
   980
      |> extensionalize_term ctxt
blanchet@43264
   981
      |> presimplify_term ctxt presimp_consts
blanchet@43120
   982
      |> perhaps (try (HOLogic.dest_Trueprop))
blanchet@43856
   983
      |> process_abstractions_in_term ctxt trans_lambdas kind
blanchet@43096
   984
  end
blanchet@43096
   985
blanchet@43096
   986
(* making fact and conjecture formulas *)
blanchet@43626
   987
fun make_formula thy type_enc eq_as_iff name loc kind t =
blanchet@43096
   988
  let
blanchet@42962
   989
    val (combformula, atomic_types) =
blanchet@43626
   990
      combformula_from_prop thy type_enc eq_as_iff t []
blanchet@38282
   991
  in
blanchet@42640
   992
    {name = name, locality = loc, kind = kind, combformula = combformula,
blanchet@42562
   993
     atomic_types = atomic_types}
blanchet@38282
   994
  end
blanchet@38282
   995
blanchet@43857
   996
fun make_fact ctxt format type_enc trans_lambdas eq_as_iff preproc
blanchet@43857
   997
              presimp_consts ((name, loc), t) =
blanchet@43096
   998
  let val thy = Proof_Context.theory_of ctxt in
blanchet@43856
   999
    case t |> preproc ? preprocess_prop ctxt trans_lambdas presimp_consts Axiom
blanchet@43626
  1000
           |> make_formula thy type_enc (eq_as_iff andalso format <> CNF) name
blanchet@43624
  1001
                           loc Axiom of
blanchet@43295
  1002
      formula as {combformula = AAtom (CombConst ((s, _), _, _)), ...} =>
blanchet@43096
  1003
      if s = tptp_true then NONE else SOME formula
blanchet@43295
  1004
    | formula => SOME formula
blanchet@43096
  1005
  end
blanchet@42561
  1006
blanchet@43856
  1007
fun make_conjecture ctxt format prem_kind type_enc trans_lambdas preproc
blanchet@43828
  1008
                    presimp_consts ts =
blanchet@43096
  1009
  let
blanchet@43096
  1010
    val thy = Proof_Context.theory_of ctxt
blanchet@43096
  1011
    val last = length ts - 1
blanchet@43096
  1012
  in
blanchet@42709
  1013
    map2 (fn j => fn t =>
blanchet@42709
  1014
             let
blanchet@42709
  1015
               val (kind, maybe_negate) =
blanchet@42709
  1016
                 if j = last then
blanchet@42709
  1017
                   (Conjecture, I)
blanchet@42709
  1018
                 else
blanchet@42709
  1019
                   (prem_kind,
blanchet@42709
  1020
                    if prem_kind = Conjecture then update_combformula mk_anot
blanchet@42709
  1021
                    else I)
blanchet@42709
  1022
              in
blanchet@43264
  1023
                t |> preproc ?
blanchet@43856
  1024
                     (preprocess_prop ctxt trans_lambdas presimp_consts kind
blanchet@43828
  1025
                      #> freeze_term)
blanchet@43626
  1026
                  |> make_formula thy type_enc (format <> CNF) (string_of_int j)
blanchet@43624
  1027
                                  Local kind
blanchet@42962
  1028
                  |> maybe_negate
blanchet@42709
  1029
              end)
blanchet@38613
  1030
         (0 upto last) ts
blanchet@38613
  1031
  end
blanchet@38282
  1032
blanchet@42682
  1033
(** Finite and infinite type inference **)
blanchet@42682
  1034
blanchet@42886
  1035
fun deep_freeze_atyp (TVar (_, S)) = TFree ("v", S)
blanchet@42886
  1036
  | deep_freeze_atyp T = T
blanchet@42886
  1037
val deep_freeze_type = map_atyps deep_freeze_atyp
blanchet@42886
  1038
blanchet@42682
  1039
(* Finite types such as "unit", "bool", "bool * bool", and "bool => bool" are
blanchet@42682
  1040
   dangerous because their "exhaust" properties can easily lead to unsound ATP
blanchet@42682
  1041
   proofs. On the other hand, all HOL infinite types can be given the same
blanchet@42682
  1042
   models in first-order logic (via Löwenheim-Skolem). *)
blanchet@42682
  1043
blanchet@42886
  1044
fun should_encode_type ctxt (nonmono_Ts as _ :: _) _ T =
blanchet@42886
  1045
    exists (curry (type_instance ctxt) (deep_freeze_type T)) nonmono_Ts
blanchet@42836
  1046
  | should_encode_type _ _ All_Types _ = true
blanchet@43572
  1047
  | should_encode_type ctxt _ Fin_Nonmono_Types T =
blanchet@43572
  1048
    is_type_surely_finite ctxt false T
blanchet@42682
  1049
  | should_encode_type _ _ _ _ = false
blanchet@42682
  1050
blanchet@42837
  1051
fun should_predicate_on_type ctxt nonmono_Ts (Preds (_, level, heaviness))
blanchet@42834
  1052
                             should_predicate_on_var T =
blanchet@43128
  1053
    (heaviness = Heavyweight orelse should_predicate_on_var ()) andalso
blanchet@42878
  1054
    should_encode_type ctxt nonmono_Ts level T
blanchet@42834
  1055
  | should_predicate_on_type _ _ _ _ _ = false
blanchet@42682
  1056
blanchet@42836
  1057
fun is_var_or_bound_var (CombConst ((s, _), _, _)) =
blanchet@42836
  1058
    String.isPrefix bound_var_prefix s
blanchet@42836
  1059
  | is_var_or_bound_var (CombVar _) = true
blanchet@42836
  1060
  | is_var_or_bound_var _ = false
blanchet@42836
  1061
blanchet@43361
  1062
datatype tag_site =
blanchet@43361
  1063
  Top_Level of bool option |
blanchet@43361
  1064
  Eq_Arg of bool option |
blanchet@43361
  1065
  Elsewhere
blanchet@42829
  1066
blanchet@43361
  1067
fun should_tag_with_type _ _ _ (Top_Level _) _ _ = false
blanchet@43361
  1068
  | should_tag_with_type ctxt nonmono_Ts (Tags (poly, level, heaviness)) site
blanchet@43361
  1069
                         u T =
blanchet@42837
  1070
    (case heaviness of
blanchet@43128
  1071
       Heavyweight => should_encode_type ctxt nonmono_Ts level T
blanchet@43128
  1072
     | Lightweight =>
blanchet@42836
  1073
       case (site, is_var_or_bound_var u) of
blanchet@43361
  1074
         (Eq_Arg pos, true) =>
blanchet@43361
  1075
         (* The first disjunct prevents a subtle soundness issue explained in
blanchet@43361
  1076
            Blanchette's Ph.D. thesis. See also
blanchet@43361
  1077
            "formula_lines_for_lightweight_tags_sym_decl". *)
blanchet@43361
  1078
         (pos <> SOME false andalso poly = Polymorphic andalso
blanchet@43361
  1079
          level <> All_Types andalso heaviness = Lightweight andalso
blanchet@43361
  1080
          exists (fn T' => type_instance ctxt (T', T)) nonmono_Ts) orelse
blanchet@43361
  1081
         should_encode_type ctxt nonmono_Ts level T
blanchet@42829
  1082
       | _ => false)
blanchet@42829
  1083
  | should_tag_with_type _ _ _ _ _ _ = false
blanchet@42682
  1084
blanchet@42994
  1085
fun homogenized_type ctxt nonmono_Ts level =
blanchet@42994
  1086
  let
blanchet@42994
  1087
    val should_encode = should_encode_type ctxt nonmono_Ts level
blanchet@42994
  1088
    fun homo 0 T = if should_encode T then T else homo_infinite_type
blanchet@42994
  1089
      | homo ary (Type (@{type_name fun}, [T1, T2])) =
blanchet@42994
  1090
        homo 0 T1 --> homo (ary - 1) T2
blanchet@42994
  1091
      | homo _ _ = raise Fail "expected function type"
blanchet@42994
  1092
  in homo end
blanchet@42682
  1093
blanchet@42573
  1094
(** "hBOOL" and "hAPP" **)
blanchet@41313
  1095
blanchet@42574
  1096
type sym_info =
blanchet@43064
  1097
  {pred_sym : bool, min_ary : int, max_ary : int, types : typ list}
blanchet@42563
  1098
blanchet@43064
  1099
fun add_combterm_syms_to_table ctxt explicit_apply =
blanchet@42558
  1100
  let
blanchet@43064
  1101
    fun consider_var_arity const_T var_T max_ary =
blanchet@43064
  1102
      let
blanchet@43064
  1103
        fun iter ary T =
blanchet@43210
  1104
          if ary = max_ary orelse type_instance ctxt (var_T, T) orelse
blanchet@43210
  1105
             type_instance ctxt (T, var_T) then
blanchet@43210
  1106
            ary
blanchet@43210
  1107
          else
blanchet@43210
  1108
            iter (ary + 1) (range_type T)
blanchet@43064
  1109
      in iter 0 const_T end
blanchet@43201
  1110
    fun add_var_or_bound_var T (accum as ((bool_vars, fun_var_Ts), sym_tab)) =
blanchet@43201
  1111
      if explicit_apply = NONE andalso
blanchet@43201
  1112
         (can dest_funT T orelse T = @{typ bool}) then
blanchet@43201
  1113
        let
blanchet@43201
  1114
          val bool_vars' = bool_vars orelse body_type T = @{typ bool}
blanchet@43201
  1115
          fun repair_min_arity {pred_sym, min_ary, max_ary, types} =
blanchet@43201
  1116
            {pred_sym = pred_sym andalso not bool_vars',
blanchet@43213
  1117
             min_ary = fold (fn T' => consider_var_arity T' T) types min_ary,
blanchet@43201
  1118
             max_ary = max_ary, types = types}
blanchet@43201
  1119
          val fun_var_Ts' =
blanchet@43201
  1120
            fun_var_Ts |> can dest_funT T ? insert_type ctxt I T
blanchet@43201
  1121
        in
blanchet@43201
  1122
          if bool_vars' = bool_vars andalso
blanchet@43201
  1123
             pointer_eq (fun_var_Ts', fun_var_Ts) then
blanchet@43201
  1124
            accum
blanchet@43167
  1125
          else
blanchet@43213
  1126
            ((bool_vars', fun_var_Ts'), Symtab.map (K repair_min_arity) sym_tab)
blanchet@43201
  1127
        end
blanchet@43201
  1128
      else
blanchet@43201
  1129
        accum
blanchet@43201
  1130
    fun add top_level tm (accum as ((bool_vars, fun_var_Ts), sym_tab)) =
blanchet@43201
  1131
      let val (head, args) = strip_combterm_comb tm in
blanchet@42558
  1132
        (case head of
blanchet@42563
  1133
           CombConst ((s, _), T, _) =>
blanchet@42558
  1134
           if String.isPrefix bound_var_prefix s then
blanchet@43201
  1135
             add_var_or_bound_var T accum
blanchet@42558
  1136
           else
blanchet@43139
  1137
             let val ary = length args in
blanchet@43201
  1138
               ((bool_vars, fun_var_Ts),
blanchet@43064
  1139
                case Symtab.lookup sym_tab s of
blanchet@43064
  1140
                  SOME {pred_sym, min_ary, max_ary, types} =>
blanchet@43064
  1141
                  let
blanchet@43201
  1142
                    val pred_sym =
blanchet@43201
  1143
                      pred_sym andalso top_level andalso not bool_vars
blanchet@43064
  1144
                    val types' = types |> insert_type ctxt I T
blanchet@43064
  1145
                    val min_ary =
blanchet@43064
  1146
                      if is_some explicit_apply orelse
blanchet@43064
  1147
                         pointer_eq (types', types) then
blanchet@43064
  1148
                        min_ary
blanchet@43064
  1149
                      else
blanchet@43201
  1150
                        fold (consider_var_arity T) fun_var_Ts min_ary
blanchet@43064
  1151
                  in
blanchet@43201
  1152
                    Symtab.update (s, {pred_sym = pred_sym,
blanchet@43064
  1153
                                       min_ary = Int.min (ary, min_ary),
blanchet@43064
  1154
                                       max_ary = Int.max (ary, max_ary),
blanchet@43064
  1155
                                       types = types'})
blanchet@43064
  1156
                                  sym_tab
blanchet@43064
  1157
                  end
blanchet@43064
  1158
                | NONE =>
blanchet@43064
  1159
                  let
blanchet@43201
  1160
                    val pred_sym = top_level andalso not bool_vars
blanchet@43064
  1161
                    val min_ary =
blanchet@43064
  1162
                      case explicit_apply of
blanchet@43064
  1163
                        SOME true => 0
blanchet@43064
  1164
                      | SOME false => ary
blanchet@43201
  1165
                      | NONE => fold (consider_var_arity T) fun_var_Ts ary
blanchet@43064
  1166
                  in
blanchet@43201
  1167
                    Symtab.update_new (s, {pred_sym = pred_sym,
blanchet@43064
  1168
                                           min_ary = min_ary, max_ary = ary,
blanchet@43064
  1169
                                           types = [T]})
blanchet@43064
  1170
                                      sym_tab
blanchet@43064
  1171
                  end)
blanchet@43064
  1172
             end
blanchet@43201
  1173
         | CombVar (_, T) => add_var_or_bound_var T accum
nik@43678
  1174
         | CombAbs ((_, T), tm) =>
nik@43678
  1175
           accum |> add_var_or_bound_var T |> add false tm
blanchet@43064
  1176
         | _ => accum)
blanchet@43064
  1177
        |> fold (add false) args
blanchet@42558
  1178
      end
blanchet@43064
  1179
  in add true end
blanchet@43064
  1180
fun add_fact_syms_to_table ctxt explicit_apply =
blanchet@43064
  1181
  fact_lift (formula_fold NONE
blanchet@43064
  1182
                          (K (add_combterm_syms_to_table ctxt explicit_apply)))
blanchet@38282
  1183
blanchet@43139
  1184
val default_sym_tab_entries : (string * sym_info) list =
blanchet@43174
  1185
  (prefixed_predicator_name,
blanchet@43139
  1186
   {pred_sym = true, min_ary = 1, max_ary = 1, types = []}) ::
blanchet@42568
  1187
  ([tptp_false, tptp_true]
blanchet@43139
  1188
   |> map (rpair {pred_sym = true, min_ary = 0, max_ary = 0, types = []})) @
blanchet@43139
  1189
  ([tptp_equal, tptp_old_equal]
blanchet@43139
  1190
   |> map (rpair {pred_sym = true, min_ary = 2, max_ary = 2, types = []}))
blanchet@41140
  1191
blanchet@43064
  1192
fun sym_table_for_facts ctxt explicit_apply facts =
blanchet@43201
  1193
  ((false, []), Symtab.empty)
blanchet@43201
  1194
  |> fold (add_fact_syms_to_table ctxt explicit_apply) facts |> snd
blanchet@43139
  1195
  |> fold Symtab.update default_sym_tab_entries
blanchet@38282
  1196
blanchet@42558
  1197
fun min_arity_of sym_tab s =
blanchet@42558
  1198
  case Symtab.lookup sym_tab s of
blanchet@42574
  1199
    SOME ({min_ary, ...} : sym_info) => min_ary
blanchet@42558
  1200
  | NONE =>
blanchet@42558
  1201
    case strip_prefix_and_unascii const_prefix s of
blanchet@42547
  1202
      SOME s =>
blanchet@42570
  1203
      let val s = s |> unmangled_const_name |> invert_const in
blanchet@42966
  1204
        if s = predicator_name then 1
blanchet@42966
  1205
        else if s = app_op_name then 2
blanchet@42966
  1206
        else if s = type_pred_name then 1
blanchet@42557
  1207
        else 0
blanchet@42547
  1208
      end
blanchet@42544
  1209
    | NONE => 0
blanchet@38282
  1210
blanchet@38282
  1211
(* True if the constant ever appears outside of the top-level position in
blanchet@38282
  1212
   literals, or if it appears with different arities (e.g., because of different
blanchet@38282
  1213
   type instantiations). If false, the constant always receives all of its
blanchet@38282
  1214
   arguments and is used as a predicate. *)
blanchet@42558
  1215
fun is_pred_sym sym_tab s =
blanchet@42558
  1216
  case Symtab.lookup sym_tab s of
blanchet@42574
  1217
    SOME ({pred_sym, min_ary, max_ary, ...} : sym_info) =>
blanchet@42574
  1218
    pred_sym andalso min_ary = max_ary
blanchet@42558
  1219
  | NONE => false
blanchet@38282
  1220
blanchet@42568
  1221
val predicator_combconst =
blanchet@42966
  1222
  CombConst (`make_fixed_const predicator_name, @{typ "bool => bool"}, [])
blanchet@42568
  1223
fun predicator tm = CombApp (predicator_combconst, tm)
blanchet@42542
  1224
blanchet@42568
  1225
fun introduce_predicators_in_combterm sym_tab tm =
blanchet@42542
  1226
  case strip_combterm_comb tm of
blanchet@42542
  1227
    (CombConst ((s, _), _, _), _) =>
blanchet@42568
  1228
    if is_pred_sym sym_tab s then tm else predicator tm
blanchet@42568
  1229
  | _ => predicator tm
blanchet@42542
  1230
blanchet@42544
  1231
fun list_app head args = fold (curry (CombApp o swap)) args head
blanchet@42544
  1232
blanchet@43130
  1233
val app_op = `make_fixed_const app_op_name
blanchet@43130
  1234
blanchet@42544
  1235
fun explicit_app arg head =
blanchet@42544
  1236
  let
blanchet@42562
  1237
    val head_T = combtyp_of head
blanchet@42693
  1238
    val (arg_T, res_T) = dest_funT head_T
blanchet@42544
  1239
    val explicit_app =
blanchet@43130
  1240
      CombConst (app_op, head_T --> head_T, [arg_T, res_T])
blanchet@42544
  1241
  in list_app explicit_app [head, arg] end
blanchet@42544
  1242
fun list_explicit_app head args = fold explicit_app args head
blanchet@38282
  1243
blanchet@42565
  1244
fun introduce_explicit_apps_in_combterm sym_tab =
blanchet@42544
  1245
  let
blanchet@42544
  1246
    fun aux tm =
blanchet@42544
  1247
      case strip_combterm_comb tm of
blanchet@42544
  1248
        (head as CombConst ((s, _), _, _), args) =>
blanchet@42544
  1249
        args |> map aux
blanchet@42557
  1250
             |> chop (min_arity_of sym_tab s)
blanchet@42544
  1251
             |>> list_app head
blanchet@42544
  1252
             |-> list_explicit_app
blanchet@42544
  1253
      | (head, args) => list_explicit_app head (map aux args)
blanchet@42544
  1254
  in aux end
blanchet@38282
  1255
blanchet@42753
  1256
fun chop_fun 0 T = ([], T)
blanchet@42753
  1257
  | chop_fun n (Type (@{type_name fun}, [dom_T, ran_T])) =
blanchet@42753
  1258
    chop_fun (n - 1) ran_T |>> cons dom_T
blanchet@42753
  1259
  | chop_fun _ _ = raise Fail "unexpected non-function"
blanchet@42753
  1260
blanchet@42780
  1261
fun filter_type_args _ _ _ [] = []
blanchet@42780
  1262
  | filter_type_args thy s arity T_args =
blanchet@42834
  1263
    let
blanchet@42834
  1264
      (* will throw "TYPE" for pseudo-constants *)
blanchet@42966
  1265
      val U = if s = app_op_name then
blanchet@42834
  1266
                @{typ "('a => 'b) => 'a => 'b"} |> Logic.varifyT_global
blanchet@42834
  1267
              else
blanchet@42834
  1268
                s |> Sign.the_const_type thy
blanchet@42834
  1269
    in
blanchet@42781
  1270
      case Term.add_tvarsT (U |> chop_fun arity |> snd) [] of
blanchet@42781
  1271
        [] => []
blanchet@42781
  1272
      | res_U_vars =>
blanchet@42781
  1273
        let val U_args = (s, U) |> Sign.const_typargs thy in
blanchet@42781
  1274
          U_args ~~ T_args
blanchet@43401
  1275
          |> map (fn (U, T) =>
blanchet@43401
  1276
                     if member (op =) res_U_vars (dest_TVar U) then T
blanchet@43401
  1277
                     else dummyT)
blanchet@42781
  1278
        end
blanchet@42780
  1279
    end
blanchet@42780
  1280
    handle TYPE _ => T_args
blanchet@42753
  1281
blanchet@43626
  1282
fun enforce_type_arg_policy_in_combterm ctxt format type_enc =
blanchet@42753
  1283
  let
blanchet@42753
  1284
    val thy = Proof_Context.theory_of ctxt
blanchet@42753
  1285
    fun aux arity (CombApp (tm1, tm2)) =
blanchet@42753
  1286
        CombApp (aux (arity + 1) tm1, aux 0 tm2)
blanchet@42753
  1287
      | aux arity (CombConst (name as (s, _), T, T_args)) =
blanchet@43179
  1288
        (case strip_prefix_and_unascii const_prefix s of
blanchet@43179
  1289
           NONE => (name, T_args)
blanchet@43179
  1290
         | SOME s'' =>
blanchet@43179
  1291
           let
blanchet@43179
  1292
             val s'' = invert_const s''
blanchet@43179
  1293
             fun filtered_T_args false = T_args
blanchet@43179
  1294
               | filtered_T_args true = filter_type_args thy s'' arity T_args
blanchet@43179
  1295
           in
blanchet@43626
  1296
             case type_arg_policy type_enc s'' of
blanchet@43179
  1297
               Explicit_Type_Args drop_args =>
blanchet@43179
  1298
               (name, filtered_T_args drop_args)
blanchet@43179
  1299
             | Mangled_Type_Args drop_args =>
blanchet@43626
  1300
               (mangled_const_name format type_enc (filtered_T_args drop_args)
blanchet@43179
  1301
                                   name, [])
blanchet@43179
  1302
             | No_Type_Args => (name, [])
blanchet@43179
  1303
           end)
blanchet@43179
  1304
        |> (fn (name, T_args) => CombConst (name, T, T_args))
nik@43677
  1305
      | aux _ (CombAbs (bound, tm)) = CombAbs (bound, aux 0 tm)
blanchet@42753
  1306
      | aux _ tm = tm
blanchet@42753
  1307
  in aux 0 end
blanchet@42573
  1308
blanchet@43626
  1309
fun repair_combterm ctxt format type_enc sym_tab =
blanchet@43626
  1310
  not (is_type_enc_higher_order type_enc)
blanchet@42994
  1311
  ? (introduce_explicit_apps_in_combterm sym_tab
blanchet@42994
  1312
     #> introduce_predicators_in_combterm sym_tab)
blanchet@43626
  1313
  #> enforce_type_arg_policy_in_combterm ctxt format type_enc
blanchet@43626
  1314
fun repair_fact ctxt format type_enc sym_tab =
blanchet@42701
  1315
  update_combformula (formula_map
blanchet@43626
  1316
      (repair_combterm ctxt format type_enc sym_tab))
blanchet@42573
  1317
blanchet@42573
  1318
(** Helper facts **)
blanchet@42573
  1319
blanchet@43194
  1320
(* The Boolean indicates that a fairly sound type encoding is needed. *)
blanchet@43085
  1321
val helper_table =
blanchet@43194
  1322
  [(("COMBI", false), @{thms Meson.COMBI_def}),
blanchet@43194
  1323
   (("COMBK", false), @{thms Meson.COMBK_def}),
blanchet@43194
  1324
   (("COMBB", false), @{thms Meson.COMBB_def}),
blanchet@43194
  1325
   (("COMBC", false), @{thms Meson.COMBC_def}),
blanchet@43194
  1326
   (("COMBS", false), @{thms Meson.COMBS_def}),
blanchet@43194
  1327
   (("fFalse", false), [@{lemma "~ fFalse" by (unfold fFalse_def) fast}]),
blanchet@43194
  1328
   (("fFalse", true), @{thms True_or_False}),
blanchet@43194
  1329
   (("fTrue", false), [@{lemma "fTrue" by (unfold fTrue_def) fast}]),
blanchet@43194
  1330
   (("fTrue", true), @{thms True_or_False}),
blanchet@43194
  1331
   (("fNot", false),
blanchet@43194
  1332
    @{thms fNot_def [THEN Meson.iff_to_disjD, THEN conjunct1]
blanchet@43194
  1333
           fNot_def [THEN Meson.iff_to_disjD, THEN conjunct2]}),
blanchet@43194
  1334
   (("fconj", false),
blanchet@43194
  1335
    @{lemma "~ P | ~ Q | fconj P Q" "~ fconj P Q | P" "~ fconj P Q | Q"
blanchet@43194
  1336
        by (unfold fconj_def) fast+}),
blanchet@43194
  1337
   (("fdisj", false),
blanchet@43194
  1338
    @{lemma "~ P | fdisj P Q" "~ Q | fdisj P Q" "~ fdisj P Q | P | Q"
blanchet@43194
  1339
        by (unfold fdisj_def) fast+}),
blanchet@43194
  1340
   (("fimplies", false),
blanchet@43210
  1341
    @{lemma "P | fimplies P Q" "~ Q | fimplies P Q" "~ fimplies P Q | ~ P | Q"
blanchet@43194
  1342
        by (unfold fimplies_def) fast+}),
nik@43678
  1343
   (("fequal", true),
nik@43678
  1344
    (* This is a lie: Higher-order equality doesn't need a sound type encoding.
nik@43678
  1345
       However, this is done so for backward compatibility: Including the
nik@43678
  1346
       equality helpers by default in Metis breaks a few existing proofs. *)
nik@43678
  1347
    @{thms fequal_def [THEN Meson.iff_to_disjD, THEN conjunct1]
nik@43678
  1348
           fequal_def [THEN Meson.iff_to_disjD, THEN conjunct2]}),
nik@43678
  1349
   (("fAll", false), []), (*TODO: add helpers*)
nik@43678
  1350
   (("fEx", false), []), (*TODO: add helpers*)
blanchet@43194
  1351
   (("If", true), @{thms if_True if_False True_or_False})]
blanchet@43194
  1352
  |> map (apsnd (map zero_var_indexes))
blanchet@43085
  1353
blanchet@43130
  1354
val type_tag = `make_fixed_const type_tag_name
blanchet@43130
  1355
blanchet@43159
  1356
fun type_tag_idempotence_fact () =
blanchet@42573
  1357
  let
blanchet@42573
  1358
    fun var s = ATerm (`I s, [])
blanchet@43159
  1359
    fun tag tm = ATerm (type_tag, [var "T", tm])
blanchet@43207
  1360
    val tagged_a = tag (var "A")
blanchet@42573
  1361
  in
blanchet@43159
  1362
    Formula (type_tag_idempotence_helper_name, Axiom,
blanchet@43207
  1363
             AAtom (ATerm (`I tptp_equal, [tag tagged_a, tagged_a]))
blanchet@43693
  1364
             |> close_formula_universally, isabelle_info simpN, NONE)
blanchet@42573
  1365
  end
blanchet@42573
  1366
blanchet@43626
  1367
fun should_specialize_helper type_enc t =
blanchet@43628
  1368
  polymorphism_of_type_enc type_enc = Mangled_Monomorphic andalso
blanchet@43628
  1369
  level_of_type_enc type_enc <> No_Types andalso
blanchet@43628
  1370
  not (null (Term.hidden_polymorphism t))
blanchet@43159
  1371
blanchet@43858
  1372
fun helper_facts_for_sym ctxt format type_enc (s, {types, ...} : sym_info) =
blanchet@42573
  1373
  case strip_prefix_and_unascii const_prefix s of
blanchet@42573
  1374
    SOME mangled_s =>
blanchet@42573
  1375
    let
blanchet@42573
  1376
      val thy = Proof_Context.theory_of ctxt
blanchet@42573
  1377
      val unmangled_s = mangled_s |> unmangled_const_name
blanchet@43628
  1378
      fun dub needs_fairly_sound j k =
blanchet@43628
  1379
        (unmangled_s ^ "_" ^ string_of_int j ^ "_" ^ string_of_int k ^
blanchet@43628
  1380
         (if mangled_s = unmangled_s then "" else "_" ^ ascii_of mangled_s) ^
blanchet@43628
  1381
         (if needs_fairly_sound then typed_helper_suffix
blanchet@43628
  1382
          else untyped_helper_suffix),
blanchet@43628
  1383
         Helper)
blanchet@43159
  1384
      fun dub_and_inst needs_fairly_sound (th, j) =
blanchet@43628
  1385
        let val t = prop_of th in
blanchet@43628
  1386
          if should_specialize_helper type_enc t then
blanchet@43628
  1387
            map (fn T => specialize_type thy (invert_const unmangled_s, T) t)
blanchet@43628
  1388
                types
blanchet@43628
  1389
          else
blanchet@43628
  1390
            [t]
blanchet@43628
  1391
        end
blanchet@43628
  1392
        |> map (fn (k, t) => (dub needs_fairly_sound j k, t)) o tag_list 1
blanchet@43159
  1393
      val make_facts =
blanchet@43858
  1394
        map_filter (make_fact ctxt format type_enc I false false [])
blanchet@43626
  1395
      val fairly_sound = is_type_enc_fairly_sound type_enc
blanchet@42573
  1396
    in
blanchet@43085
  1397
      helper_table
blanchet@43194
  1398
      |> maps (fn ((helper_s, needs_fairly_sound), ths) =>
blanchet@43159
  1399
                  if helper_s <> unmangled_s orelse
blanchet@42894
  1400
                     (needs_fairly_sound andalso not fairly_sound) then
blanchet@42573
  1401
                    []
blanchet@42573
  1402
                  else
blanchet@42573
  1403
                    ths ~~ (1 upto length ths)
blanchet@43628
  1404
                    |> maps (dub_and_inst needs_fairly_sound)
blanchet@43159
  1405
                    |> make_facts)
blanchet@42573
  1406
    end
blanchet@42573
  1407
  | NONE => []
blanchet@43858
  1408
fun helper_facts_for_sym_table ctxt format type_enc sym_tab =
blanchet@43858
  1409
  Symtab.fold_rev (append o helper_facts_for_sym ctxt format type_enc) sym_tab
blanchet@43858
  1410
                  []
blanchet@42573
  1411
blanchet@43085
  1412
(***************************************************************)
blanchet@43085
  1413
(* Type Classes Present in the Axiom or Conjecture Clauses     *)
blanchet@43085
  1414
(***************************************************************)
blanchet@43085
  1415
blanchet@43085
  1416
fun set_insert (x, s) = Symtab.update (x, ()) s
blanchet@43085
  1417
blanchet@43085
  1418
fun add_classes (sorts, cset) = List.foldl set_insert cset (flat sorts)
blanchet@43085
  1419
blanchet@43085
  1420
(* Remove this trivial type class (FIXME: similar code elsewhere) *)
blanchet@43085
  1421
fun delete_type cset = Symtab.delete_safe (the_single @{sort HOL.type}) cset
blanchet@43085
  1422
blanchet@43093
  1423
fun classes_of_terms get_Ts =
blanchet@43121
  1424
  map (map snd o get_Ts)
blanchet@43093
  1425
  #> List.foldl add_classes Symtab.empty
blanchet@43093
  1426
  #> delete_type #> Symtab.keys
blanchet@43085
  1427
blanchet@43093
  1428
val tfree_classes_of_terms = classes_of_terms OldTerm.term_tfrees
blanchet@43093
  1429
val tvar_classes_of_terms = classes_of_terms OldTerm.term_tvars
blanchet@43085
  1430
blanchet@43622
  1431
fun fold_type_constrs f (Type (s, Ts)) x =
blanchet@43622
  1432
    fold (fold_type_constrs f) Ts (f (s, x))
blanchet@43189
  1433
  | fold_type_constrs _ _ x = x
blanchet@43085
  1434
blanchet@43085
  1435
(*Type constructors used to instantiate overloaded constants are the only ones needed.*)
blanchet@43189
  1436
fun add_type_constrs_in_term thy =
blanchet@43085
  1437
  let
blanchet@43188
  1438
    fun add (Const (@{const_name Meson.skolem}, _) $ _) = I
blanchet@43181
  1439
      | add (t $ u) = add t #> add u
blanchet@43188
  1440
      | add (Const (x as (s, _))) =
blanchet@43188
  1441
        if String.isPrefix skolem_const_prefix s then I
blanchet@43189
  1442
        else x |> Sign.const_typargs thy |> fold (fold_type_constrs set_insert)
blanchet@43181
  1443
      | add (Abs (_, _, u)) = add u
blanchet@43181
  1444
      | add _ = I
blanchet@43181
  1445
  in add end
blanchet@43085
  1446
blanchet@43189
  1447
fun type_constrs_of_terms thy ts =
blanchet@43189
  1448
  Symtab.keys (fold (add_type_constrs_in_term thy) ts Symtab.empty)
blanchet@43085
  1449
blanchet@43856
  1450
fun translate_formulas ctxt format prem_kind type_enc trans_lambdas preproc
blanchet@43828
  1451
                       hyp_ts concl_t facts =
blanchet@42573
  1452
  let
blanchet@42573
  1453
    val thy = Proof_Context.theory_of ctxt
blanchet@43222
  1454
    val fact_ts = facts |> map snd
blanchet@43264
  1455
    val presimp_consts = Meson.presimplified_consts ctxt
blanchet@43828
  1456
    val make_fact =
blanchet@43856
  1457
      make_fact ctxt format type_enc trans_lambdas true preproc presimp_consts
blanchet@42573
  1458
    val (facts, fact_names) =
blanchet@43264
  1459
      facts |> map (fn (name, t) => (name, t) |> make_fact |> rpair name)
blanchet@43214
  1460
            |> map_filter (try (apfst the))
blanchet@43214
  1461
            |> ListPair.unzip
blanchet@42573
  1462
    (* Remove existing facts from the conjecture, as this can dramatically
blanchet@42573
  1463
       boost an ATP's performance (for some reason). *)
blanchet@43192
  1464
    val hyp_ts =
blanchet@43192
  1465
      hyp_ts
blanchet@43192
  1466
      |> map (fn t => if member (op aconv) fact_ts t then @{prop True} else t)
blanchet@42573
  1467
    val goal_t = Logic.list_implies (hyp_ts, concl_t)
blanchet@42573
  1468
    val all_ts = goal_t :: fact_ts
blanchet@42573
  1469
    val subs = tfree_classes_of_terms all_ts
blanchet@42573
  1470
    val supers = tvar_classes_of_terms all_ts
blanchet@43189
  1471
    val tycons = type_constrs_of_terms thy all_ts
blanchet@42994
  1472
    val conjs =
blanchet@43096
  1473
      hyp_ts @ [concl_t]
blanchet@43856
  1474
      |> make_conjecture ctxt format prem_kind type_enc trans_lambdas preproc
blanchet@43828
  1475
                         presimp_consts
blanchet@42573
  1476
    val (supers', arity_clauses) =
blanchet@43626
  1477
      if level_of_type_enc type_enc = No_Types then ([], [])
blanchet@42573
  1478
      else make_arity_clauses thy tycons supers
blanchet@42573
  1479
    val class_rel_clauses = make_class_rel_clauses thy subs supers'
blanchet@42573
  1480
  in
blanchet@42573
  1481
    (fact_names |> map single, (conjs, facts, class_rel_clauses, arity_clauses))
blanchet@42573
  1482
  end
blanchet@42573
  1483
blanchet@42573
  1484
fun fo_literal_from_type_literal (TyLitVar (class, name)) =
blanchet@42573
  1485
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
  1486
  | fo_literal_from_type_literal (TyLitFree (class, name)) =
blanchet@42573
  1487
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
  1488
blanchet@42573
  1489
fun formula_from_fo_literal (pos, t) = AAtom t |> not pos ? mk_anot
blanchet@42573
  1490
blanchet@43130
  1491
val type_pred = `make_fixed_const type_pred_name
blanchet@43130
  1492
blanchet@43626
  1493
fun type_pred_combterm ctxt format type_enc T tm =
blanchet@43179
  1494
  CombApp (CombConst (type_pred, T --> @{typ bool}, [T])
blanchet@43626
  1495
           |> enforce_type_arg_policy_in_combterm ctxt format type_enc, tm)
blanchet@42573
  1496
blanchet@43421
  1497
fun is_var_positively_naked_in_term _ (SOME false) _ accum = accum
blanchet@43421
  1498
  | is_var_positively_naked_in_term name _ (ATerm ((s, _), tms)) accum =
blanchet@43000
  1499
    accum orelse (is_tptp_equal s andalso member (op =) tms (ATerm (name, [])))
blanchet@43692
  1500
  | is_var_positively_naked_in_term _ _ _ _ = true
blanchet@43493
  1501
fun should_predicate_on_var_in_formula pos phi (SOME true) name =
blanchet@43421
  1502
    formula_fold pos (is_var_positively_naked_in_term name) phi false
blanchet@43493
  1503
  | should_predicate_on_var_in_formula _ _ _ _ = true
blanchet@42834
  1504
nik@43677
  1505
fun mk_aterm format type_enc name T_args args =
nik@43677
  1506
  ATerm (name, map_filter (ho_term_for_type_arg format type_enc) T_args @ args)
blanchet@42994
  1507
blanchet@43626
  1508
fun tag_with_type ctxt format nonmono_Ts type_enc pos T tm =
blanchet@43130
  1509
  CombConst (type_tag, T --> T, [T])
blanchet@43626
  1510
  |> enforce_type_arg_policy_in_combterm ctxt format type_enc
nik@43677
  1511
  |> ho_term_from_combterm ctxt format nonmono_Ts type_enc (Top_Level pos)
blanchet@43692
  1512
  |> (fn ATerm (s, tms) => ATerm (s, tms @ [tm])
blanchet@43692
  1513
       | _ => raise Fail "unexpected lambda-abstraction")
nik@43677
  1514
and ho_term_from_combterm ctxt format nonmono_Ts type_enc =
blanchet@42573
  1515
  let
blanchet@42962
  1516
    fun aux site u =
blanchet@42962
  1517
      let
blanchet@42962
  1518
        val (head, args) = strip_combterm_comb u
nik@43677
  1519
        val pos =
blanchet@43361
  1520
          case site of
nik@43677
  1521
            Top_Level pos => pos
nik@43677
  1522
          | Eq_Arg pos => pos
nik@43677
  1523
          | Elsewhere => NONE
nik@43677
  1524
        val t =
nik@43677
  1525
          case head of
nik@43677
  1526
            CombConst (name as (s, _), _, T_args) =>
nik@43677
  1527
            let
nik@43677
  1528
              val arg_site = if is_tptp_equal s then Eq_Arg pos else Elsewhere
nik@43677
  1529
            in
nik@43677
  1530
              mk_aterm format type_enc name T_args (map (aux arg_site) args)
nik@43677
  1531
            end
nik@43678
  1532
          | CombVar (name, _) => mk_aterm format type_enc name [] (map (aux Elsewhere) args)
nik@43677
  1533
          | CombAbs ((name, T), tm) =>
nik@43677
  1534
            AAbs ((name, ho_type_from_typ format type_enc true 0 T), aux Elsewhere tm)
nik@43677
  1535
          | CombApp _ => raise Fail "impossible \"CombApp\""
blanchet@42962
  1536
        val T = combtyp_of u
blanchet@42962
  1537
      in
blanchet@43626
  1538
        t |> (if should_tag_with_type ctxt nonmono_Ts type_enc site u T then
blanchet@43626
  1539
                tag_with_type ctxt format nonmono_Ts type_enc pos T
blanchet@42962
  1540
              else
blanchet@42962
  1541
                I)
blanchet@42962
  1542
      end
blanchet@42962
  1543
  in aux end
blanchet@43626
  1544
and formula_from_combformula ctxt format nonmono_Ts type_enc
blanchet@42962
  1545
                             should_predicate_on_var =
blanchet@42829
  1546
  let
blanchet@43361
  1547
    fun do_term pos =
nik@43677
  1548
      ho_term_from_combterm ctxt format nonmono_Ts type_enc (Top_Level pos)
blanchet@42573
  1549
    val do_bound_type =
blanchet@43626
  1550
      case type_enc of
blanchet@43624
  1551
        Simple_Types (_, level) =>
blanchet@42994
  1552
        homogenized_type ctxt nonmono_Ts level 0
nik@43677
  1553
        #> ho_type_from_typ format type_enc false 0 #> SOME
blanchet@42682
  1554
      | _ => K NONE
blanchet@42878
  1555
    fun do_out_of_bound_type pos phi universal (name, T) =
blanchet@43626
  1556
      if should_predicate_on_type ctxt nonmono_Ts type_enc
blanchet@42878
  1557
             (fn () => should_predicate_on_var pos phi universal name) T then
blanchet@42834
  1558
        CombVar (name, T)
blanchet@43626
  1559
        |> type_pred_combterm ctxt format type_enc T
blanchet@43361
  1560
        |> do_term pos |> AAtom |> SOME
blanchet@42573
  1561
      else
blanchet@42573
  1562
        NONE
blanchet@42878
  1563
    fun do_formula pos (AQuant (q, xs, phi)) =
blanchet@42878
  1564
        let
blanchet@42878
  1565
          val phi = phi |> do_formula pos
blanchet@42878
  1566
          val universal = Option.map (q = AExists ? not) pos
blanchet@42878
  1567
        in
blanchet@42834
  1568
          AQuant (q, xs |> map (apsnd (fn NONE => NONE
blanchet@42834
  1569
                                        | SOME T => do_bound_type T)),
blanchet@42834
  1570
                  (if q = AForall then mk_ahorn else fold_rev (mk_aconn AAnd))
blanchet@42834
  1571
                      (map_filter
blanchet@42834
  1572
                           (fn (_, NONE) => NONE
blanchet@42834
  1573
                             | (s, SOME T) =>
blanchet@42878
  1574
                               do_out_of_bound_type pos phi universal (s, T))
blanchet@42878
  1575
                           xs)
blanchet@42834
  1576
                      phi)
blanchet@42834
  1577
        end
blanchet@42878
  1578
      | do_formula pos (AConn conn) = aconn_map pos do_formula conn
blanchet@43361
  1579
      | do_formula pos (AAtom tm) = AAtom (do_term pos tm)
blanchet@43493
  1580
  in do_formula end
blanchet@42573
  1581
blanchet@43626
  1582
fun bound_tvars type_enc Ts =
blanchet@42727
  1583
  mk_ahorn (map (formula_from_fo_literal o fo_literal_from_type_literal)
blanchet@43626
  1584
                (type_literals_for_types type_enc add_sorts_on_tvar Ts))
blanchet@42727
  1585
blanchet@42573
  1586
(* Each fact is given a unique fact number to avoid name clashes (e.g., because
blanchet@42573
  1587
   of monomorphization). The TPTP explicitly forbids name clashes, and some of
blanchet@42573
  1588
   the remote provers might care. *)
blanchet@43501
  1589
fun formula_line_for_fact ctxt format prefix encode freshen pos nonmono_Ts
blanchet@43626
  1590
        type_enc (j, {name, locality, kind, combformula, atomic_types}) =
blanchet@43501
  1591
  (prefix ^ (if freshen then string_of_int j ^ "_" else "") ^ encode name,
blanchet@43493
  1592
   kind,
blanchet@43493
  1593
   combformula
blanchet@43493
  1594
   |> close_combformula_universally
blanchet@43626
  1595
   |> formula_from_combformula ctxt format nonmono_Ts type_enc
blanchet@43493
  1596
                               should_predicate_on_var_in_formula
blanchet@43501
  1597
                               (if pos then SOME true else NONE)
blanchet@43626
  1598
   |> bound_tvars type_enc atomic_types
blanchet@43493
  1599
   |> close_formula_universally,
blanchet@43493
  1600
   NONE,
blanchet@43493
  1601
   case locality of
blanchet@43693
  1602
     Intro => isabelle_info introN
blanchet@43693
  1603
   | Elim => isabelle_info elimN
blanchet@43693
  1604
   | Simp => isabelle_info simpN
blanchet@43493
  1605
   | _ => NONE)
blanchet@43493
  1606
  |> Formula
blanchet@42573
  1607
blanchet@43086
  1608
fun formula_line_for_class_rel_clause ({name, subclass, superclass, ...}
blanchet@43086
  1609
                                       : class_rel_clause) =
blanchet@42573
  1610
  let val ty_arg = ATerm (`I "T", []) in
blanchet@42577
  1611
    Formula (class_rel_clause_prefix ^ ascii_of name, Axiom,
blanchet@42573
  1612
             AConn (AImplies, [AAtom (ATerm (subclass, [ty_arg])),
blanchet@42573
  1613
                               AAtom (ATerm (superclass, [ty_arg]))])
blanchet@43693
  1614
             |> close_formula_universally, isabelle_info introN, NONE)
blanchet@42573
  1615
  end
blanchet@42573
  1616
blanchet@42573
  1617
fun fo_literal_from_arity_literal (TConsLit (c, t, args)) =
blanchet@42573
  1618
    (true, ATerm (c, [ATerm (t, map (fn arg => ATerm (arg, [])) args)]))
blanchet@42573
  1619
  | fo_literal_from_arity_literal (TVarLit (c, sort)) =
blanchet@42573
  1620
    (false, ATerm (c, [ATerm (sort, [])]))
blanchet@42573
  1621
blanchet@43086
  1622
fun formula_line_for_arity_clause ({name, prem_lits, concl_lits, ...}
blanchet@43086
  1623
                                   : arity_clause) =
blanchet@43495
  1624
  Formula (arity_clause_prefix ^ name, Axiom,
blanchet@42573
  1625
           mk_ahorn (map (formula_from_fo_literal o apfst not
blanchet@42895
  1626
                          o fo_literal_from_arity_literal) prem_lits)
blanchet@42573
  1627
                    (formula_from_fo_literal
blanchet@42895
  1628
                         (fo_literal_from_arity_literal concl_lits))
blanchet@43693
  1629
           |> close_formula_universally, isabelle_info introN, NONE)
blanchet@42573
  1630
blanchet@43626
  1631
fun formula_line_for_conjecture ctxt format nonmono_Ts type_enc
blanchet@43098
  1632
        ({name, kind, combformula, atomic_types, ...} : translated_formula) =
blanchet@42577
  1633
  Formula (conjecture_prefix ^ name, kind,
blanchet@43626
  1634
           formula_from_combformula ctxt format nonmono_Ts type_enc
blanchet@43493
  1635
               should_predicate_on_var_in_formula (SOME false)
blanchet@42939
  1636
               (close_combformula_universally combformula)
blanchet@43626
  1637
           |> bound_tvars type_enc atomic_types
blanchet@42573
  1638
           |> close_formula_universally, NONE, NONE)
blanchet@42573
  1639
blanchet@43626
  1640
fun free_type_literals type_enc ({atomic_types, ...} : translated_formula) =
blanchet@43626
  1641
  atomic_types |> type_literals_for_types type_enc add_sorts_on_tfree
blanchet@42573
  1642
               |> map fo_literal_from_type_literal
blanchet@42573
  1643
blanchet@42573
  1644
fun formula_line_for_free_type j lit =
blanchet@43085
  1645
  Formula (tfree_clause_prefix ^ string_of_int j, Hypothesis,
blanchet@42573
  1646
           formula_from_fo_literal lit, NONE, NONE)
blanchet@43626
  1647
fun formula_lines_for_free_types type_enc facts =
blanchet@42573
  1648
  let
blanchet@43626
  1649
    val litss = map (free_type_literals type_enc) facts
blanchet@42573
  1650
    val lits = fold (union (op =)) litss []
blanchet@42573
  1651
  in map2 formula_line_for_free_type (0 upto length lits - 1) lits end
blanchet@42573
  1652
blanchet@42573
  1653
(** Symbol declarations **)
blanchet@42544
  1654
blanchet@43626
  1655
fun should_declare_sym type_enc pred_sym s =
blanchet@42998
  1656
  is_tptp_user_symbol s andalso not (String.isPrefix bound_var_prefix s) andalso
blanchet@43626
  1657
  (case type_enc of
blanchet@42894
  1658
     Simple_Types _ => true
blanchet@43128
  1659
   | Tags (_, _, Lightweight) => true
blanchet@42894
  1660
   | _ => not pred_sym)
blanchet@38282
  1661
blanchet@43626
  1662
fun sym_decl_table_for_facts ctxt type_enc repaired_sym_tab (conjs, facts) =
blanchet@42574
  1663
  let
blanchet@42698
  1664
    fun add_combterm in_conj tm =
blanchet@42574
  1665
      let val (head, args) = strip_combterm_comb tm in
blanchet@42574
  1666
        (case head of
blanchet@42574
  1667
           CombConst ((s, s'), T, T_args) =>
blanchet@42574
  1668
           let val pred_sym = is_pred_sym repaired_sym_tab s in
blanchet@43626
  1669
             if should_declare_sym type_enc pred_sym s then
blanchet@42576
  1670
               Symtab.map_default (s, [])
blanchet@42886
  1671
                   (insert_type ctxt #3 (s', T_args, T, pred_sym, length args,
blanchet@42886
  1672
                                         in_conj))
blanchet@42574
  1673
             else
blanchet@42574
  1674
               I
blanchet@42574
  1675
           end
nik@43678
  1676
         | CombAbs (_, tm) => add_combterm in_conj tm
blanchet@42574
  1677
         | _ => I)
blanchet@42698
  1678
        #> fold (add_combterm in_conj) args
blanchet@42574
  1679
      end
blanchet@42698
  1680
    fun add_fact in_conj =
blanchet@42834
  1681
      fact_lift (formula_fold NONE (K (add_combterm in_conj)))
blanchet@42698
  1682
  in
blanchet@42698
  1683
    Symtab.empty
blanchet@43626
  1684
    |> is_type_enc_fairly_sound type_enc
blanchet@42698
  1685
       ? (fold (add_fact true) conjs #> fold (add_fact false) facts)
blanchet@42698
  1686
  end
blanchet@42533
  1687
blanchet@42685
  1688
(* This inference is described in section 2.3 of Claessen et al.'s "Sorting it
blanchet@42685
  1689
   out with monotonicity" paper presented at CADE 2011. *)
blanchet@43572
  1690
fun add_combterm_nonmonotonic_types _ _ _ _ (SOME false) _ = I
blanchet@43572
  1691
  | add_combterm_nonmonotonic_types ctxt level sound locality _
blanchet@43179
  1692
        (CombApp (CombApp (CombConst ((s, _), Type (_, [T, _]), _), tm1),
blanchet@43179
  1693
                           tm2)) =
blanchet@43000
  1694
    (is_tptp_equal s andalso exists is_var_or_bound_var [tm1, tm2] andalso
blanchet@42829
  1695
     (case level of
blanchet@43362
  1696
        Noninf_Nonmono_Types =>
blanchet@43293
  1697
        not (is_locality_global locality) orelse
blanchet@43572
  1698
        not (is_type_surely_infinite ctxt sound T)
blanchet@43572
  1699
      | Fin_Nonmono_Types => is_type_surely_finite ctxt false T
blanchet@42886
  1700
      | _ => true)) ? insert_type ctxt I (deep_freeze_type T)
blanchet@43572
  1701
  | add_combterm_nonmonotonic_types _ _ _ _ _ _ = I
blanchet@43572
  1702
fun add_fact_nonmonotonic_types ctxt level sound
blanchet@43572
  1703
        ({kind, locality, combformula, ...} : translated_formula) =
blanchet@42834
  1704
  formula_fold (SOME (kind <> Conjecture))
blanchet@43572
  1705
               (add_combterm_nonmonotonic_types ctxt level sound locality)
blanchet@43572
  1706
               combformula
blanchet@43626
  1707
fun nonmonotonic_types_for_facts ctxt type_enc sound facts =
blanchet@43626
  1708
  let val level = level_of_type_enc type_enc in
blanchet@43362
  1709
    if level = Noninf_Nonmono_Types orelse level = Fin_Nonmono_Types then
blanchet@43572
  1710
      [] |> fold (add_fact_nonmonotonic_types ctxt level sound) facts
blanchet@42886
  1711
         (* We must add "bool" in case the helper "True_or_False" is added
blanchet@42886
  1712
            later. In addition, several places in the code rely on the list of
blanchet@42886
  1713
            nonmonotonic types not being empty. *)
blanchet@42886
  1714
         |> insert_type ctxt I @{typ bool}
blanchet@42886
  1715
    else
blanchet@42886
  1716
      []
blanchet@42829
  1717
  end
blanchet@42677
  1718
blanchet@43626
  1719
fun decl_line_for_sym ctxt format nonmono_Ts type_enc s
blanchet@42994
  1720
                      (s', T_args, T, pred_sym, ary, _) =
blanchet@42994
  1721
  let
blanchet@43178
  1722
    val (T_arg_Ts, level) =
blanchet@43626
  1723
      case type_enc of
blanchet@43624
  1724
        Simple_Types (_, level) => ([], level)
blanchet@43178
  1725
      | _ => (replicate (length T_args) homo_infinite_type, No_Types)
blanchet@42994
  1726
  in
blanchet@42998
  1727
    Decl (sym_decl_prefix ^ s, (s, s'),
blanchet@42994
  1728
          (T_arg_Ts ---> (T |> homogenized_type ctxt nonmono_Ts level ary))
nik@43677
  1729
          |> ho_type_from_typ format type_enc pred_sym (length T_arg_Ts + ary))
blanchet@42994
  1730
  end
blanchet@42579
  1731
blanchet@43125
  1732
fun formula_line_for_preds_sym_decl ctxt format conj_sym_kind nonmono_Ts
blanchet@43626
  1733
        poly_nonmono_Ts type_enc n s j (s', T_args, T, _, ary, in_conj) =
blanchet@42579
  1734
  let
blanchet@42709
  1735
    val (kind, maybe_negate) =
blanchet@42709
  1736
      if in_conj then (conj_sym_kind, conj_sym_kind = Conjecture ? mk_anot)
blanchet@42709
  1737
      else (Axiom, I)
blanchet@42753
  1738
    val (arg_Ts, res_T) = chop_fun ary T
blanchet@43399
  1739
    val num_args = length arg_Ts
blanchet@42579
  1740
    val bound_names =
blanchet@43399
  1741
      1 upto num_args |> map (`I o make_bound_var o string_of_int)
blanchet@42829
  1742
    val bounds =
blanchet@42579
  1743
      bound_names ~~ arg_Ts |> map (fn (name, T) => CombConst (name, T, []))
blanchet@43401
  1744
    val sym_needs_arg_types = n > 1 orelse exists (curry (op =) dummyT) T_args
blanchet@43401
  1745
    fun should_keep_arg_type T =
blanchet@43401
  1746
      sym_needs_arg_types orelse
blanchet@43626
  1747
      not (should_predicate_on_type ctxt nonmono_Ts type_enc (K false) T)
blanchet@42579
  1748
    val bound_Ts =
blanchet@43401
  1749
      arg_Ts |> map (fn T => if should_keep_arg_type T then SOME T else NONE)
blanchet@42579
  1750
  in
blanchet@43125
  1751
    Formula (preds_sym_formula_prefix ^ s ^
blanchet@42709
  1752
             (if n > 1 then "_" ^ string_of_int j else ""), kind,
blanchet@42579
  1753
             CombConst ((s, s'), T, T_args)
blanchet@42829
  1754
             |> fold (curry (CombApp o swap)) bounds
blanchet@43626
  1755
             |> type_pred_combterm ctxt format type_enc res_T
blanchet@42963
  1756
             |> AAtom |> mk_aquant AForall (bound_names ~~ bound_Ts)
blanchet@43626
  1757
             |> formula_from_combformula ctxt format poly_nonmono_Ts type_enc
blanchet@43493
  1758
                                         (K (K (K (K true)))) (SOME true)
blanchet@43626
  1759
             |> n > 1 ? bound_tvars type_enc (atyps_of T)
blanchet@42709
  1760
             |> close_formula_universally
blanchet@42709
  1761
             |> maybe_negate,
blanchet@43693
  1762
             isabelle_info introN, NONE)
blanchet@42579
  1763
  end
blanchet@42579
  1764
blanchet@43129
  1765
fun formula_lines_for_lightweight_tags_sym_decl ctxt format conj_sym_kind
blanchet@43626
  1766
        poly_nonmono_Ts type_enc n s
blanchet@43401
  1767
        (j, (s', T_args, T, pred_sym, ary, in_conj)) =
blanchet@42829
  1768
  let
blanchet@42829
  1769
    val ident_base =
blanchet@43129
  1770
      lightweight_tags_sym_formula_prefix ^ s ^
blanchet@43125
  1771
      (if n > 1 then "_" ^ string_of_int j else "")
blanchet@42852
  1772
    val (kind, maybe_negate) =
blanchet@42852
  1773
      if in_conj then (conj_sym_kind, conj_sym_kind = Conjecture ? mk_anot)
blanchet@42852
  1774
      else (Axiom, I)
blanchet@42829
  1775
    val (arg_Ts, res_T) = chop_fun ary T
blanchet@42829
  1776
    val bound_names =
blanchet@42829
  1777
      1 upto length arg_Ts |> map (`I o make_bound_var o string_of_int)
blanchet@42829
  1778
    val bounds = bound_names |> map (fn name => ATerm (name, []))
nik@43677
  1779
    val cst = mk_aterm format type_enc (s, s') T_args
blanchet@42830
  1780
    val atomic_Ts = atyps_of T
blanchet@42834
  1781
    fun eq tms =
blanchet@42834
  1782
      (if pred_sym then AConn (AIff, map AAtom tms)
blanchet@43000
  1783
       else AAtom (ATerm (`I tptp_equal, tms)))
blanchet@43626
  1784
      |> bound_tvars type_enc atomic_Ts
blanchet@42830
  1785
      |> close_formula_universally
blanchet@42852
  1786
      |> maybe_negate
blanchet@43361
  1787
    (* See also "should_tag_with_type". *)
blanchet@43361
  1788
    fun should_encode T =
blanchet@43401
  1789
      should_encode_type ctxt poly_nonmono_Ts All_Types T orelse
blanchet@43626
  1790
      (case type_enc of
blanchet@43361
  1791
         Tags (Polymorphic, level, Lightweight) =>
blanchet@43361
  1792
         level <> All_Types andalso Monomorph.typ_has_tvars T
blanchet@43361
  1793
       | _ => false)
blanchet@43626
  1794
    val tag_with = tag_with_type ctxt format poly_nonmono_Ts type_enc NONE
blanchet@42829
  1795
    val add_formula_for_res =
blanchet@42829
  1796
      if should_encode res_T then
blanchet@42852
  1797
        cons (Formula (ident_base ^ "_res", kind,
blanchet@42994
  1798
                       eq [tag_with res_T (cst bounds), cst bounds],
blanchet@43693
  1799
                       isabelle_info simpN, NONE))
blanchet@42829
  1800
      else
blanchet@42829
  1801
        I
blanchet@42829
  1802
    fun add_formula_for_arg k =
blanchet@42829
  1803
      let val arg_T = nth arg_Ts k in
blanchet@42829
  1804
        if should_encode arg_T then
blanchet@42829
  1805
          case chop k bounds of
blanchet@42829
  1806
            (bounds1, bound :: bounds2) =>
blanchet@42852
  1807
            cons (Formula (ident_base ^ "_arg" ^ string_of_int (k + 1), kind,
blanchet@42994
  1808
                           eq [cst (bounds1 @ tag_with arg_T bound :: bounds2),
blanchet@42994
  1809
                               cst bounds],
blanchet@43693
  1810
                           isabelle_info simpN, NONE))
blanchet@42829
  1811
          | _ => raise Fail "expected nonempty tail"
blanchet@42829
  1812
        else
blanchet@42829
  1813
          I
blanchet@42829
  1814
      end
blanchet@42829
  1815
  in
blanchet@42834
  1816
    [] |> not pred_sym ? add_formula_for_res
blanchet@42829
  1817
       |> fold add_formula_for_arg (ary - 1 downto 0)
blanchet@42829
  1818
  end
blanchet@42829
  1819
blanchet@42836
  1820
fun result_type_of_decl (_, _, T, _, ary, _) = chop_fun ary T |> snd
blanchet@42836
  1821
blanchet@43401
  1822
fun problem_lines_for_sym_decls ctxt format conj_sym_kind nonmono_Ts
blanchet@43626
  1823
                                poly_nonmono_Ts type_enc (s, decls) =
blanchet@43626
  1824
  case type_enc of
blanchet@42998
  1825
    Simple_Types _ =>
blanchet@43626
  1826
    decls |> map (decl_line_for_sym ctxt format nonmono_Ts type_enc s)
blanchet@42998
  1827
  | Preds _ =>
blanchet@42998
  1828
    let
blanchet@42998
  1829
      val decls =
blanchet@42998
  1830
        case decls of
blanchet@42998
  1831
          decl :: (decls' as _ :: _) =>
blanchet@42998
  1832
          let val T = result_type_of_decl decl in
blanchet@42998
  1833
            if forall (curry (type_instance ctxt o swap) T
blanchet@42998
  1834
                       o result_type_of_decl) decls' then
blanchet@42998
  1835
              [decl]
blanchet@42998
  1836
            else
blanchet@42998
  1837
              decls
blanchet@42998
  1838
          end
blanchet@42998
  1839
        | _ => decls
blanchet@42998
  1840
      val n = length decls
blanchet@42998
  1841
      val decls =
blanchet@43626
  1842
        decls |> filter (should_predicate_on_type ctxt poly_nonmono_Ts type_enc
blanchet@43401
  1843
                                                  (K true)
blanchet@43401
  1844
                         o result_type_of_decl)
blanchet@42998
  1845
    in
blanchet@42998
  1846
      (0 upto length decls - 1, decls)
blanchet@43125
  1847
      |-> map2 (formula_line_for_preds_sym_decl ctxt format conj_sym_kind
blanchet@43626
  1848
                   nonmono_Ts poly_nonmono_Ts type_enc n s)
blanchet@42998
  1849
    end
blanchet@42998
  1850
  | Tags (_, _, heaviness) =>
blanchet@42998
  1851
    (case heaviness of
blanchet@43128
  1852
       Heavyweight => []
blanchet@43128
  1853
     | Lightweight =>
blanchet@42998
  1854
       let val n = length decls in
blanchet@42998
  1855
         (0 upto n - 1 ~~ decls)
blanchet@43129
  1856
         |> maps (formula_lines_for_lightweight_tags_sym_decl ctxt format
blanchet@43626
  1857
                      conj_sym_kind poly_nonmono_Ts type_enc n s)
blanchet@42998
  1858
       end)
blanchet@42579
  1859
blanchet@42956
  1860
fun problem_lines_for_sym_decl_table ctxt format conj_sym_kind nonmono_Ts
blanchet@43626
  1861
                                     poly_nonmono_Ts type_enc sym_decl_tab =
blanchet@42998
  1862
  sym_decl_tab
blanchet@42998
  1863
  |> Symtab.dest
blanchet@42998
  1864
  |> sort_wrt fst
blanchet@42998
  1865
  |> rpair []
blanchet@42998
  1866
  |-> fold_rev (append o problem_lines_for_sym_decls ctxt format conj_sym_kind
blanchet@43626
  1867
                             nonmono_Ts poly_nonmono_Ts type_enc)
blanchet@42543
  1868
blanchet@43185
  1869
fun needs_type_tag_idempotence (Tags (poly, level, heaviness)) =
blanchet@43185
  1870
    poly <> Mangled_Monomorphic andalso
blanchet@43185
  1871
    ((level = All_Types andalso heaviness = Lightweight) orelse
blanchet@43362
  1872
     level = Noninf_Nonmono_Types orelse level = Fin_Nonmono_Types)
blanchet@43159
  1873
  | needs_type_tag_idempotence _ = false
blanchet@42831
  1874
blanchet@42939
  1875
fun offset_of_heading_in_problem _ [] j = j
blanchet@42939
  1876
  | offset_of_heading_in_problem needle ((heading, lines) :: problem) j =
blanchet@42939
  1877
    if heading = needle then j
blanchet@42939
  1878
    else offset_of_heading_in_problem needle problem (j + length lines)
blanchet@42939
  1879
blanchet@42998
  1880
val implicit_declsN = "Should-be-implicit typings"
blanchet@42998
  1881
val explicit_declsN = "Explicit typings"
blanchet@41157
  1882
val factsN = "Relevant facts"
blanchet@41157
  1883
val class_relsN = "Class relationships"
blanchet@42543
  1884
val aritiesN = "Arities"
blanchet@41157
  1885
val helpersN = "Helper facts"
blanchet@41157
  1886
val conjsN = "Conjectures"
blanchet@41313
  1887
val free_typesN = "Type variables"
blanchet@41157
  1888
blanchet@43828
  1889
val explicit_apply = NONE (* for experiments *)
blanchet@43259
  1890
blanchet@43626
  1891
fun prepare_atp_problem ctxt format conj_sym_kind prem_kind type_enc sound
blanchet@43856
  1892
        exporter trans_lambdas readable_names preproc hyp_ts concl_t facts =
blanchet@38282
  1893
  let
blanchet@43626
  1894
    val (format, type_enc) = choose_format [format] type_enc
blanchet@41313
  1895
    val (fact_names, (conjs, facts, class_rel_clauses, arity_clauses)) =
blanchet@43856
  1896
      translate_formulas ctxt format prem_kind type_enc trans_lambdas preproc
blanchet@43828
  1897
                         hyp_ts concl_t facts
blanchet@43064
  1898
    val sym_tab = conjs @ facts |> sym_table_for_facts ctxt explicit_apply
blanchet@43572
  1899
    val nonmono_Ts =
blanchet@43626
  1900
      conjs @ facts |> nonmonotonic_types_for_facts ctxt type_enc sound
blanchet@43626
  1901
    val repair = repair_fact ctxt format type_enc sym_tab
blanchet@42682
  1902
    val (conjs, facts) = (conjs, facts) |> pairself (map repair)
blanchet@43064
  1903
    val repaired_sym_tab =
blanchet@43064
  1904
      conjs @ facts |> sym_table_for_facts ctxt (SOME false)
blanchet@42573
  1905
    val helpers =
blanchet@43858
  1906
      repaired_sym_tab |> helper_facts_for_sym_table ctxt format type_enc
blanchet@43858
  1907
                       |> map repair
blanchet@43401
  1908
    val poly_nonmono_Ts =
blanchet@43213
  1909
      if null nonmono_Ts orelse nonmono_Ts = [@{typ bool}] orelse
blanchet@43626
  1910
         polymorphism_of_type_enc type_enc <> Polymorphic then
blanchet@42894
  1911
        nonmono_Ts
blanchet@42894
  1912
      else
blanchet@42894
  1913
        [TVar (("'a", 0), HOLogic.typeS)]
blanchet@42680
  1914
    val sym_decl_lines =
blanchet@42731
  1915
      (conjs, helpers @ facts)
blanchet@43626
  1916
      |> sym_decl_table_for_facts ctxt type_enc repaired_sym_tab
blanchet@43401
  1917
      |> problem_lines_for_sym_decl_table ctxt format conj_sym_kind nonmono_Ts
blanchet@43626
  1918
                                               poly_nonmono_Ts type_enc
blanchet@42881
  1919
    val helper_lines =
blanchet@42956
  1920
      0 upto length helpers - 1 ~~ helpers
blanchet@43501
  1921
      |> map (formula_line_for_fact ctxt format helper_prefix I false true
blanchet@43626
  1922
                                    poly_nonmono_Ts type_enc)
blanchet@43626
  1923
      |> (if needs_type_tag_idempotence type_enc then
blanchet@43159
  1924
            cons (type_tag_idempotence_fact ())
blanchet@43159
  1925
          else
blanchet@43159
  1926
            I)
blanchet@42522
  1927
    (* Reordering these might confuse the proof reconstruction code or the SPASS
blanchet@43039
  1928
       FLOTTER hack. *)
blanchet@38282
  1929
    val problem =
blanchet@42998
  1930
      [(explicit_declsN, sym_decl_lines),
blanchet@42956
  1931
       (factsN,
blanchet@43501
  1932
        map (formula_line_for_fact ctxt format fact_prefix ascii_of
blanchet@43501
  1933
                                   (not exporter) (not exporter) nonmono_Ts
blanchet@43626
  1934
                                   type_enc)
blanchet@42956
  1935
            (0 upto length facts - 1 ~~ facts)),
blanchet@42545
  1936
       (class_relsN, map formula_line_for_class_rel_clause class_rel_clauses),
blanchet@42545
  1937
       (aritiesN, map formula_line_for_arity_clause arity_clauses),
blanchet@42881
  1938
       (helpersN, helper_lines),
blanchet@42962
  1939
       (conjsN,
blanchet@43626
  1940
        map (formula_line_for_conjecture ctxt format nonmono_Ts type_enc)
blanchet@42962
  1941
            conjs),
blanchet@43626
  1942
       (free_typesN, formula_lines_for_free_types type_enc (facts @ conjs))]
blanchet@42543
  1943
    val problem =
blanchet@42561
  1944
      problem
blanchet@43092
  1945
      |> (case format of
blanchet@43092
  1946
            CNF => ensure_cnf_problem
blanchet@43092
  1947
          | CNF_UEQ => filter_cnf_ueq_problem
blanchet@43092
  1948
          | _ => I)
blanchet@42998
  1949
      |> (if is_format_typed format then
blanchet@42998
  1950
            declare_undeclared_syms_in_atp_problem type_decl_prefix
blanchet@42998
  1951
                                                   implicit_declsN
blanchet@42998
  1952
          else
blanchet@42998
  1953
            I)
blanchet@43092
  1954
    val (problem, pool) = problem |> nice_atp_problem readable_names
blanchet@42881
  1955
    val helpers_offset = offset_of_heading_in_problem helpersN problem 0
blanchet@42881
  1956
    val typed_helpers =
blanchet@42881
  1957
      map_filter (fn (j, {name, ...}) =>
blanchet@42881
  1958
                     if String.isSuffix typed_helper_suffix name then SOME j
blanchet@42881
  1959
                     else NONE)
blanchet@42881
  1960
                 ((helpers_offset + 1 upto helpers_offset + length helpers)
blanchet@42881
  1961
                  ~~ helpers)
blanchet@42778
  1962
    fun add_sym_arity (s, {min_ary, ...} : sym_info) =
blanchet@42755
  1963
      if min_ary > 0 then
blanchet@42755
  1964
        case strip_prefix_and_unascii const_prefix s of
blanchet@42755
  1965
          SOME s => Symtab.insert (op =) (s, min_ary)
blanchet@42755
  1966
        | NONE => I
blanchet@42755
  1967
      else
blanchet@42755
  1968
        I
blanchet@38282
  1969
  in
blanchet@38282
  1970
    (problem,
blanchet@38282
  1971
     case pool of SOME the_pool => snd the_pool | NONE => Symtab.empty,
blanchet@42585
  1972
     offset_of_heading_in_problem conjsN problem 0,
blanchet@42541
  1973
     offset_of_heading_in_problem factsN problem 0,
blanchet@42755
  1974
     fact_names |> Vector.fromList,
blanchet@42881
  1975
     typed_helpers,
blanchet@42755
  1976
     Symtab.empty |> Symtab.fold add_sym_arity sym_tab)
blanchet@38282
  1977
  end
blanchet@38282
  1978
blanchet@41313
  1979
(* FUDGE *)
blanchet@41313
  1980
val conj_weight = 0.0
blanchet@41770
  1981
val hyp_weight = 0.1
blanchet@41770
  1982
val fact_min_weight = 0.2
blanchet@41313
  1983
val fact_max_weight = 1.0
blanchet@42608
  1984
val type_info_default_weight = 0.8
blanchet@41313
  1985
blanchet@41313
  1986
fun add_term_weights weight (ATerm (s, tms)) =
nik@43676
  1987
    is_tptp_user_symbol s ? Symtab.default (s, weight)
nik@43676
  1988
    #> fold (add_term_weights weight) tms
nik@43676
  1989
  | add_term_weights weight (AAbs (_, tm)) = add_term_weights weight tm
blanchet@42577
  1990
fun add_problem_line_weights weight (Formula (_, _, phi, _, _)) =
blanchet@42834
  1991
    formula_fold NONE (K (add_term_weights weight)) phi
blanchet@42528
  1992
  | add_problem_line_weights _ _ = I
blanchet@41313
  1993
blanchet@41313
  1994
fun add_conjectures_weights [] = I
blanchet@41313
  1995
  | add_conjectures_weights conjs =
blanchet@41313
  1996
    let val (hyps, conj) = split_last conjs in
blanchet@41313
  1997
      add_problem_line_weights conj_weight conj
blanchet@41313
  1998
      #> fold (add_problem_line_weights hyp_weight) hyps
blanchet@41313
  1999
    end
blanchet@41313
  2000
blanchet@41313
  2001
fun add_facts_weights facts =
blanchet@41313
  2002
  let
blanchet@41313
  2003
    val num_facts = length facts
blanchet@41313
  2004
    fun weight_of j =
blanchet@41313
  2005
      fact_min_weight + (fact_max_weight - fact_min_weight) * Real.fromInt j
blanchet@41313
  2006
                        / Real.fromInt num_facts
blanchet@41313
  2007
  in
blanchet@41313
  2008
    map weight_of (0 upto num_facts - 1) ~~ facts
blanchet@41313
  2009
    |> fold (uncurry add_problem_line_weights)
blanchet@41313
  2010
  end
blanchet@41313
  2011
blanchet@41313
  2012
(* Weights are from 0.0 (most important) to 1.0 (least important). *)
blanchet@41313
  2013
fun atp_problem_weights problem =
blanchet@42608
  2014
  let val get = these o AList.lookup (op =) problem in
blanchet@42608
  2015
    Symtab.empty
blanchet@42608
  2016
    |> add_conjectures_weights (get free_typesN @ get conjsN)
blanchet@42608
  2017
    |> add_facts_weights (get factsN)
blanchet@42608
  2018
    |> fold (fold (add_problem_line_weights type_info_default_weight) o get)
blanchet@42998
  2019
            [explicit_declsN, class_relsN, aritiesN]
blanchet@42608
  2020
    |> Symtab.dest
blanchet@42608
  2021
    |> sort (prod_ord Real.compare string_ord o pairself swap)
blanchet@42608
  2022
  end
blanchet@41313
  2023
blanchet@38282
  2024
end;