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