src/HOL/Tools/ATP/atp_problem_generate.ML
author blanchet
Tue Mar 20 00:44:30 2012 +0100 (2012-03-20)
changeset 47030 7e80e14247fc
parent 46818 2a28e66e2e4c
child 47032 73cdeed236c0
permissions -rw-r--r--
internal renamings
blanchet@46320
     1
(*  Title:      HOL/Tools/ATP/atp_problem_generate.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@46320
     9
signature ATP_PROBLEM_GENERATE =
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@45301
    14
  type atp_format = ATP_Problem.atp_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@46340
    18
  datatype scope = Global | Local | Assum | Chained
blanchet@46393
    19
  datatype status = General | Induct | Intro | Elim | Simp | Spec_Eq
blanchet@46340
    20
  type stature = scope * status
blanchet@42613
    21
blanchet@44494
    22
  datatype polymorphism = Polymorphic | Raw_Monomorphic | Mangled_Monomorphic
blanchet@46301
    23
  datatype strictness = Strict | Non_Strict
blanchet@44811
    24
  datatype granularity = All_Vars | Positively_Naked_Vars | Ghost_Type_Arg_Vars
blanchet@42613
    25
  datatype type_level =
blanchet@44397
    26
    All_Types |
blanchet@46301
    27
    Noninf_Nonmono_Types of strictness * granularity |
blanchet@44811
    28
    Fin_Nonmono_Types of granularity |
blanchet@44397
    29
    Const_Arg_Types |
blanchet@43362
    30
    No_Types
blanchet@44782
    31
  type type_enc
blanchet@42613
    32
blanchet@44496
    33
  val type_tag_idempotence : bool Config.T
blanchet@44496
    34
  val type_tag_arguments : bool Config.T
blanchet@45513
    35
  val no_lamsN : string
blanchet@45513
    36
  val hide_lamsN : string
blanchet@46365
    37
  val liftingN : string
blanchet@46365
    38
  val combsN : string
blanchet@46365
    39
  val combs_and_liftingN : string
blanchet@46365
    40
  val combs_or_liftingN : string
blanchet@45513
    41
  val lam_liftingN : string
blanchet@45513
    42
  val keep_lamsN : string
blanchet@43496
    43
  val schematic_var_prefix : string
blanchet@43496
    44
  val fixed_var_prefix : string
blanchet@43496
    45
  val tvar_prefix : string
blanchet@43496
    46
  val tfree_prefix : string
blanchet@43496
    47
  val const_prefix : string
blanchet@43496
    48
  val type_const_prefix : string
blanchet@43496
    49
  val class_prefix : string
blanchet@45554
    50
  val lam_lifted_prefix : string
blanchet@45554
    51
  val lam_lifted_mono_prefix : string
blanchet@45554
    52
  val lam_lifted_poly_prefix : string
blanchet@43085
    53
  val skolem_const_prefix : string
blanchet@43085
    54
  val old_skolem_const_prefix : string
blanchet@43085
    55
  val new_skolem_const_prefix : string
blanchet@45554
    56
  val combinator_prefix : string
blanchet@43125
    57
  val type_decl_prefix : string
blanchet@43125
    58
  val sym_decl_prefix : string
blanchet@43989
    59
  val guards_sym_formula_prefix : string
blanchet@44396
    60
  val tags_sym_formula_prefix : string
blanchet@40204
    61
  val fact_prefix : string
blanchet@38282
    62
  val conjecture_prefix : string
blanchet@42881
    63
  val helper_prefix : string
blanchet@43125
    64
  val class_rel_clause_prefix : string
blanchet@43125
    65
  val arity_clause_prefix : string
blanchet@43125
    66
  val tfree_clause_prefix : string
blanchet@45554
    67
  val lam_fact_prefix : string
blanchet@42881
    68
  val typed_helper_suffix : string
blanchet@43125
    69
  val untyped_helper_suffix : string
blanchet@43159
    70
  val type_tag_idempotence_helper_name : string
blanchet@42966
    71
  val predicator_name : string
blanchet@42966
    72
  val app_op_name : string
blanchet@44396
    73
  val type_guard_name : string
blanchet@43104
    74
  val type_tag_name : string
blanchet@46435
    75
  val native_type_prefix : string
blanchet@43174
    76
  val prefixed_predicator_name : string
blanchet@43130
    77
  val prefixed_app_op_name : string
blanchet@43130
    78
  val prefixed_type_tag_name : string
blanchet@43496
    79
  val ascii_of : string -> string
blanchet@43496
    80
  val unascii_of : string -> string
blanchet@45511
    81
  val unprefix_and_unascii : string -> string -> string option
blanchet@43159
    82
  val proxy_table : (string * (string * (thm * (string * string)))) list
blanchet@43159
    83
  val proxify_const : string -> (string * string) option
blanchet@43496
    84
  val invert_const : string -> string
blanchet@43496
    85
  val unproxify_const : string -> string
blanchet@43093
    86
  val new_skolem_var_name_from_const : string -> string
blanchet@43248
    87
  val atp_irrelevant_consts : string list
blanchet@43248
    88
  val atp_schematic_consts_of : term -> typ list Symtab.table
blanchet@43828
    89
  val is_type_enc_higher_order : type_enc -> bool
blanchet@43626
    90
  val polymorphism_of_type_enc : type_enc -> polymorphism
blanchet@43626
    91
  val level_of_type_enc : type_enc -> type_level
blanchet@44397
    92
  val is_type_enc_quasi_sound : type_enc -> bool
blanchet@43626
    93
  val is_type_enc_fairly_sound : type_enc -> bool
blanchet@46301
    94
  val type_enc_from_string : strictness -> string -> type_enc
blanchet@45301
    95
  val adjust_type_enc : atp_format -> type_enc -> type_enc
blanchet@43136
    96
  val mk_aconns :
blanchet@43136
    97
    connective -> ('a, 'b, 'c) formula list -> ('a, 'b, 'c) formula
nik@43676
    98
  val unmangled_const : string -> string * (string, 'b) ho_term list
blanchet@46392
    99
  val unmangled_const_name : string -> string list
blanchet@43194
   100
  val helper_table : ((string * bool) * thm list) list
blanchet@45514
   101
  val trans_lams_from_string :
blanchet@45514
   102
    Proof.context -> type_enc -> string -> term list -> term list * term list
blanchet@43501
   103
  val factsN : string
blanchet@40059
   104
  val prepare_atp_problem :
blanchet@45301
   105
    Proof.context -> atp_format -> formula_kind -> formula_kind -> type_enc
blanchet@46409
   106
    -> bool -> string -> bool -> bool -> bool -> term list -> term
blanchet@46340
   107
    -> ((string * stature) * term) list
blanchet@46340
   108
    -> string problem * string Symtab.table * (string * stature) list vector
blanchet@45551
   109
       * (string * term) list * int Symtab.table
blanchet@47030
   110
  val atp_problem_selection_weights : string problem -> (string * real) list
blanchet@47030
   111
  val atp_problem_term_order_weights : string problem -> (string * int) list
blanchet@38282
   112
end;
blanchet@38282
   113
blanchet@46320
   114
structure ATP_Problem_Generate : ATP_PROBLEM_GENERATE =
blanchet@38282
   115
struct
blanchet@38282
   116
blanchet@43085
   117
open ATP_Util
blanchet@38282
   118
open ATP_Problem
blanchet@43085
   119
blanchet@43085
   120
type name = string * string
blanchet@43085
   121
blanchet@44496
   122
val type_tag_idempotence =
blanchet@44540
   123
  Attrib.setup_config_bool @{binding atp_type_tag_idempotence} (K false)
blanchet@44496
   124
val type_tag_arguments =
blanchet@44540
   125
  Attrib.setup_config_bool @{binding atp_type_tag_arguments} (K false)
blanchet@44496
   126
blanchet@45516
   127
val no_lamsN = "no_lams" (* used internally; undocumented *)
blanchet@45513
   128
val hide_lamsN = "hide_lams"
blanchet@46365
   129
val liftingN = "lifting"
blanchet@46365
   130
val combsN = "combs"
blanchet@46365
   131
val combs_and_liftingN = "combs_and_lifting"
blanchet@46365
   132
val combs_or_liftingN = "combs_or_lifting"
blanchet@45513
   133
val keep_lamsN = "keep_lams"
blanchet@46365
   134
val lam_liftingN = "lam_lifting" (* legacy *)
blanchet@44088
   135
blanchet@45779
   136
(* It's still unclear whether all TFF1 implementations will support type
blanchet@45779
   137
   signatures such as "!>[A : $tType] : $o", with ghost type variables. *)
blanchet@45779
   138
val avoid_first_order_ghost_type_vars = false
blanchet@44622
   139
blanchet@43085
   140
val bound_var_prefix = "B_"
blanchet@44403
   141
val all_bound_var_prefix = "BA_"
blanchet@44403
   142
val exist_bound_var_prefix = "BE_"
blanchet@43085
   143
val schematic_var_prefix = "V_"
blanchet@43085
   144
val fixed_var_prefix = "v_"
blanchet@43085
   145
val tvar_prefix = "T_"
blanchet@43085
   146
val tfree_prefix = "t_"
blanchet@43085
   147
val const_prefix = "c_"
blanchet@43085
   148
val type_const_prefix = "tc_"
blanchet@46435
   149
val native_type_prefix = "n_"
blanchet@43085
   150
val class_prefix = "cl_"
blanchet@43085
   151
blanchet@45509
   152
(* Freshness almost guaranteed! *)
blanchet@46392
   153
val atp_prefix = "ATP" ^ Long_Name.separator
blanchet@45509
   154
val atp_weak_prefix = "ATP:"
blanchet@45509
   155
blanchet@45554
   156
val lam_lifted_prefix = atp_weak_prefix ^ "Lam"
blanchet@45554
   157
val lam_lifted_mono_prefix = lam_lifted_prefix ^ "m"
blanchet@45554
   158
val lam_lifted_poly_prefix = lam_lifted_prefix ^ "p"
blanchet@43907
   159
blanchet@46392
   160
val skolem_const_prefix = atp_prefix ^ "Sko"
blanchet@43085
   161
val old_skolem_const_prefix = skolem_const_prefix ^ "o"
blanchet@43085
   162
val new_skolem_const_prefix = skolem_const_prefix ^ "n"
blanchet@43085
   163
blanchet@45554
   164
val combinator_prefix = "COMB"
blanchet@45554
   165
blanchet@42998
   166
val type_decl_prefix = "ty_"
blanchet@42998
   167
val sym_decl_prefix = "sy_"
blanchet@43989
   168
val guards_sym_formula_prefix = "gsy_"
blanchet@44396
   169
val tags_sym_formula_prefix = "tsy_"
blanchet@46409
   170
val uncurried_alias_eq_prefix = "unc_"
blanchet@40204
   171
val fact_prefix = "fact_"
blanchet@38282
   172
val conjecture_prefix = "conj_"
blanchet@38282
   173
val helper_prefix = "help_"
blanchet@43159
   174
val class_rel_clause_prefix = "clar_"
blanchet@38282
   175
val arity_clause_prefix = "arity_"
blanchet@43085
   176
val tfree_clause_prefix = "tfree_"
blanchet@38282
   177
blanchet@45554
   178
val lam_fact_prefix = "ATP.lambda_"
blanchet@42881
   179
val typed_helper_suffix = "_T"
blanchet@42881
   180
val untyped_helper_suffix = "_U"
blanchet@43159
   181
val type_tag_idempotence_helper_name = helper_prefix ^ "ti_idem"
blanchet@42881
   182
blanchet@44491
   183
val predicator_name = "pp"
blanchet@44491
   184
val app_op_name = "aa"
blanchet@44491
   185
val type_guard_name = "gg"
blanchet@44491
   186
val type_tag_name = "tt"
blanchet@42531
   187
blanchet@43174
   188
val prefixed_predicator_name = const_prefix ^ predicator_name
blanchet@43130
   189
val prefixed_app_op_name = const_prefix ^ app_op_name
blanchet@43130
   190
val prefixed_type_tag_name = const_prefix ^ type_tag_name
blanchet@43130
   191
blanchet@43085
   192
(*Escaping of special characters.
blanchet@43085
   193
  Alphanumeric characters are left unchanged.
blanchet@43085
   194
  The character _ goes to __
blanchet@43085
   195
  Characters in the range ASCII space to / go to _A to _P, respectively.
blanchet@43085
   196
  Other characters go to _nnn where nnn is the decimal ASCII code.*)
blanchet@43093
   197
val upper_a_minus_space = Char.ord #"A" - Char.ord #" "
blanchet@43085
   198
blanchet@43085
   199
fun stringN_of_int 0 _ = ""
blanchet@43085
   200
  | stringN_of_int k n =
blanchet@43085
   201
    stringN_of_int (k - 1) (n div 10) ^ string_of_int (n mod 10)
blanchet@43085
   202
blanchet@43085
   203
fun ascii_of_char c =
blanchet@43085
   204
  if Char.isAlphaNum c then
blanchet@43085
   205
    String.str c
blanchet@43085
   206
  else if c = #"_" then
blanchet@43085
   207
    "__"
blanchet@43085
   208
  else if #" " <= c andalso c <= #"/" then
blanchet@43085
   209
    "_" ^ String.str (Char.chr (Char.ord c + upper_a_minus_space))
blanchet@43085
   210
  else
blanchet@43085
   211
    (* fixed width, in case more digits follow *)
blanchet@43085
   212
    "_" ^ stringN_of_int 3 (Char.ord c)
blanchet@43085
   213
blanchet@43085
   214
val ascii_of = String.translate ascii_of_char
blanchet@43085
   215
blanchet@43085
   216
(** Remove ASCII armoring from names in proof files **)
blanchet@43085
   217
blanchet@43085
   218
(* We don't raise error exceptions because this code can run inside a worker
blanchet@43085
   219
   thread. Also, the errors are impossible. *)
blanchet@43085
   220
val unascii_of =
blanchet@43085
   221
  let
blanchet@43085
   222
    fun un rcs [] = String.implode(rev rcs)
blanchet@43085
   223
      | un rcs [#"_"] = un (#"_" :: rcs) [] (* ERROR *)
blanchet@43085
   224
        (* Three types of _ escapes: __, _A to _P, _nnn *)
blanchet@43496
   225
      | un rcs (#"_" :: #"_" :: cs) = un (#"_" :: rcs) cs
blanchet@43085
   226
      | un rcs (#"_" :: c :: cs) =
blanchet@43085
   227
        if #"A" <= c andalso c<= #"P" then
blanchet@43085
   228
          (* translation of #" " to #"/" *)
blanchet@43085
   229
          un (Char.chr (Char.ord c - upper_a_minus_space) :: rcs) cs
blanchet@43085
   230
        else
blanchet@43496
   231
          let val digits = List.take (c :: cs, 3) handle General.Subscript => [] in
blanchet@43085
   232
            case Int.fromString (String.implode digits) of
blanchet@43085
   233
              SOME n => un (Char.chr n :: rcs) (List.drop (cs, 2))
blanchet@43496
   234
            | NONE => un (c :: #"_" :: rcs) cs (* ERROR *)
blanchet@43085
   235
          end
blanchet@43085
   236
      | un rcs (c :: cs) = un (c :: rcs) cs
blanchet@43085
   237
  in un [] o String.explode end
blanchet@43085
   238
blanchet@43085
   239
(* If string s has the prefix s1, return the result of deleting it,
blanchet@43085
   240
   un-ASCII'd. *)
blanchet@45511
   241
fun unprefix_and_unascii s1 s =
blanchet@43085
   242
  if String.isPrefix s1 s then
blanchet@43085
   243
    SOME (unascii_of (String.extract (s, size s1, NONE)))
blanchet@43085
   244
  else
blanchet@43085
   245
    NONE
blanchet@43085
   246
blanchet@43159
   247
val proxy_table =
blanchet@43159
   248
  [("c_False", (@{const_name False}, (@{thm fFalse_def},
blanchet@43159
   249
       ("fFalse", @{const_name ATP.fFalse})))),
blanchet@43159
   250
   ("c_True", (@{const_name True}, (@{thm fTrue_def},
blanchet@43159
   251
       ("fTrue", @{const_name ATP.fTrue})))),
blanchet@43159
   252
   ("c_Not", (@{const_name Not}, (@{thm fNot_def},
blanchet@43159
   253
       ("fNot", @{const_name ATP.fNot})))),
blanchet@43159
   254
   ("c_conj", (@{const_name conj}, (@{thm fconj_def},
blanchet@43159
   255
       ("fconj", @{const_name ATP.fconj})))),
blanchet@43159
   256
   ("c_disj", (@{const_name disj}, (@{thm fdisj_def},
blanchet@43159
   257
       ("fdisj", @{const_name ATP.fdisj})))),
blanchet@43159
   258
   ("c_implies", (@{const_name implies}, (@{thm fimplies_def},
blanchet@43159
   259
       ("fimplies", @{const_name ATP.fimplies})))),
blanchet@43159
   260
   ("equal", (@{const_name HOL.eq}, (@{thm fequal_def},
nik@43678
   261
       ("fequal", @{const_name ATP.fequal})))),
nik@43678
   262
   ("c_All", (@{const_name All}, (@{thm fAll_def},
nik@43678
   263
       ("fAll", @{const_name ATP.fAll})))),
nik@43678
   264
   ("c_Ex", (@{const_name Ex}, (@{thm fEx_def},
nik@43678
   265
       ("fEx", @{const_name ATP.fEx}))))]
blanchet@43085
   266
blanchet@43159
   267
val proxify_const = AList.lookup (op =) proxy_table #> Option.map (snd o snd)
blanchet@43085
   268
blanchet@43085
   269
(* Readable names for the more common symbolic functions. Do not mess with the
blanchet@43085
   270
   table unless you know what you are doing. *)
blanchet@43085
   271
val const_trans_table =
blanchet@43085
   272
  [(@{type_name Product_Type.prod}, "prod"),
blanchet@43085
   273
   (@{type_name Sum_Type.sum}, "sum"),
blanchet@43085
   274
   (@{const_name False}, "False"),
blanchet@43085
   275
   (@{const_name True}, "True"),
blanchet@43085
   276
   (@{const_name Not}, "Not"),
blanchet@43085
   277
   (@{const_name conj}, "conj"),
blanchet@43085
   278
   (@{const_name disj}, "disj"),
blanchet@43085
   279
   (@{const_name implies}, "implies"),
blanchet@43085
   280
   (@{const_name HOL.eq}, "equal"),
nik@43678
   281
   (@{const_name All}, "All"),
nik@43678
   282
   (@{const_name Ex}, "Ex"),
blanchet@43085
   283
   (@{const_name If}, "If"),
blanchet@43085
   284
   (@{const_name Set.member}, "member"),
blanchet@45554
   285
   (@{const_name Meson.COMBI}, combinator_prefix ^ "I"),
blanchet@45554
   286
   (@{const_name Meson.COMBK}, combinator_prefix ^ "K"),
blanchet@45554
   287
   (@{const_name Meson.COMBB}, combinator_prefix ^ "B"),
blanchet@45554
   288
   (@{const_name Meson.COMBC}, combinator_prefix ^ "C"),
blanchet@45554
   289
   (@{const_name Meson.COMBS}, combinator_prefix ^ "S")]
blanchet@43085
   290
  |> Symtab.make
blanchet@43159
   291
  |> fold (Symtab.update o swap o snd o snd o snd) proxy_table
blanchet@43085
   292
blanchet@43085
   293
(* Invert the table of translations between Isabelle and ATPs. *)
blanchet@43085
   294
val const_trans_table_inv =
blanchet@43085
   295
  const_trans_table |> Symtab.dest |> map swap |> Symtab.make
blanchet@43085
   296
val const_trans_table_unprox =
blanchet@43085
   297
  Symtab.empty
blanchet@43159
   298
  |> fold (fn (_, (isa, (_, (_, atp)))) => Symtab.update (atp, isa)) proxy_table
blanchet@43085
   299
blanchet@43085
   300
val invert_const = perhaps (Symtab.lookup const_trans_table_inv)
blanchet@43085
   301
val unproxify_const = perhaps (Symtab.lookup const_trans_table_unprox)
blanchet@43085
   302
blanchet@43085
   303
fun lookup_const c =
blanchet@43085
   304
  case Symtab.lookup const_trans_table c of
blanchet@43085
   305
    SOME c' => c'
blanchet@43085
   306
  | NONE => ascii_of c
blanchet@43085
   307
blanchet@43622
   308
fun ascii_of_indexname (v, 0) = ascii_of v
blanchet@43622
   309
  | ascii_of_indexname (v, i) = ascii_of v ^ "_" ^ string_of_int i
blanchet@43085
   310
blanchet@43085
   311
fun make_bound_var x = bound_var_prefix ^ ascii_of x
blanchet@44403
   312
fun make_all_bound_var x = all_bound_var_prefix ^ ascii_of x
blanchet@44403
   313
fun make_exist_bound_var x = exist_bound_var_prefix ^ ascii_of x
blanchet@43085
   314
fun make_schematic_var v = schematic_var_prefix ^ ascii_of_indexname v
blanchet@43085
   315
fun make_fixed_var x = fixed_var_prefix ^ ascii_of x
blanchet@43085
   316
blanchet@43622
   317
fun make_schematic_type_var (x, i) =
blanchet@44595
   318
  tvar_prefix ^ (ascii_of_indexname (unprefix "'" x, i))
blanchet@43622
   319
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (unprefix "'" x))
blanchet@43085
   320
blanchet@45301
   321
(* "HOL.eq" and choice are mapped to the ATP's equivalents *)
nik@44587
   322
local
nik@44587
   323
  val choice_const = (fst o dest_Const o HOLogic.choice_const) Term.dummyT
nik@44587
   324
  fun default c = const_prefix ^ lookup_const c
nik@44587
   325
in
nik@44587
   326
  fun make_fixed_const _ @{const_name HOL.eq} = tptp_old_equal
blanchet@44754
   327
    | make_fixed_const (SOME (THF (_, _, THF_With_Choice))) c =
blanchet@44754
   328
      if c = choice_const then tptp_choice else default c
nik@44587
   329
    | make_fixed_const _ c = default c
nik@44587
   330
end
blanchet@43085
   331
blanchet@43085
   332
fun make_fixed_type_const c = type_const_prefix ^ lookup_const c
blanchet@43085
   333
blanchet@43085
   334
fun make_type_class clas = class_prefix ^ ascii_of clas
blanchet@43085
   335
blanchet@43093
   336
fun new_skolem_var_name_from_const s =
blanchet@43093
   337
  let val ss = s |> space_explode Long_Name.separator in
blanchet@43093
   338
    nth ss (length ss - 2)
blanchet@43093
   339
  end
blanchet@43093
   340
blanchet@43248
   341
(* These are either simplified away by "Meson.presimplify" (most of the time) or
blanchet@43248
   342
   handled specially via "fFalse", "fTrue", ..., "fequal". *)
blanchet@43248
   343
val atp_irrelevant_consts =
blanchet@43248
   344
  [@{const_name False}, @{const_name True}, @{const_name Not},
blanchet@43248
   345
   @{const_name conj}, @{const_name disj}, @{const_name implies},
blanchet@43248
   346
   @{const_name HOL.eq}, @{const_name If}, @{const_name Let}]
blanchet@43248
   347
blanchet@43248
   348
val atp_monomorph_bad_consts =
blanchet@43248
   349
  atp_irrelevant_consts @
blanchet@43248
   350
  (* These are ignored anyway by the relevance filter (unless they appear in
blanchet@43248
   351
     higher-order places) but not by the monomorphizer. *)
blanchet@43248
   352
  [@{const_name all}, @{const_name "==>"}, @{const_name "=="},
blanchet@43248
   353
   @{const_name Trueprop}, @{const_name All}, @{const_name Ex},
blanchet@43248
   354
   @{const_name Ex1}, @{const_name Ball}, @{const_name Bex}]
blanchet@43248
   355
blanchet@43258
   356
fun add_schematic_const (x as (_, T)) =
blanchet@43258
   357
  Monomorph.typ_has_tvars T ? Symtab.insert_list (op =) x
blanchet@43258
   358
val add_schematic_consts_of =
blanchet@43258
   359
  Term.fold_aterms (fn Const (x as (s, _)) =>
blanchet@43258
   360
                       not (member (op =) atp_monomorph_bad_consts s)
blanchet@43258
   361
                       ? add_schematic_const x
blanchet@43258
   362
                      | _ => I)
blanchet@43258
   363
fun atp_schematic_consts_of t = add_schematic_consts_of t Symtab.empty
blanchet@43248
   364
blanchet@43085
   365
(** Definitions and functions for FOL clauses and formulas for TPTP **)
blanchet@43085
   366
blanchet@43085
   367
(** Isabelle arities **)
blanchet@43085
   368
blanchet@44625
   369
type arity_atom = name * name * name list
blanchet@43085
   370
blanchet@43263
   371
val type_class = the_single @{sort type}
blanchet@43263
   372
blanchet@43086
   373
type arity_clause =
blanchet@43496
   374
  {name : string,
blanchet@44625
   375
   prem_atoms : arity_atom list,
blanchet@44625
   376
   concl_atom : arity_atom}
blanchet@44625
   377
blanchet@44625
   378
fun add_prem_atom tvar =
blanchet@44625
   379
  fold (fn s => s <> type_class ? cons (`make_type_class s, `I tvar, []))
blanchet@43085
   380
blanchet@43085
   381
(* Arity of type constructor "tcon :: (arg1, ..., argN) res" *)
blanchet@43085
   382
fun make_axiom_arity_clause (tcons, name, (cls, args)) =
blanchet@43085
   383
  let
blanchet@44595
   384
    val tvars = map (prefix tvar_prefix o string_of_int) (1 upto length args)
blanchet@43085
   385
    val tvars_srts = ListPair.zip (tvars, args)
blanchet@43085
   386
  in
blanchet@43086
   387
    {name = name,
blanchet@44625
   388
     prem_atoms = [] |> fold (uncurry add_prem_atom) tvars_srts,
blanchet@44625
   389
     concl_atom = (`make_type_class cls, `make_fixed_type_const tcons,
blanchet@44625
   390
                   tvars ~~ tvars)}
blanchet@43085
   391
  end
blanchet@43085
   392
blanchet@43085
   393
fun arity_clause _ _ (_, []) = []
blanchet@43495
   394
  | arity_clause seen n (tcons, ("HOL.type", _) :: ars) =  (* ignore *)
blanchet@43495
   395
    arity_clause seen n (tcons, ars)
blanchet@43495
   396
  | arity_clause seen n (tcons, (ar as (class, _)) :: ars) =
blanchet@43495
   397
    if member (op =) seen class then
blanchet@43495
   398
      (* multiple arities for the same (tycon, class) pair *)
blanchet@43495
   399
      make_axiom_arity_clause (tcons,
blanchet@43495
   400
          lookup_const tcons ^ "___" ^ ascii_of class ^ "_" ^ string_of_int n,
blanchet@43495
   401
          ar) ::
blanchet@43495
   402
      arity_clause seen (n + 1) (tcons, ars)
blanchet@43495
   403
    else
blanchet@43495
   404
      make_axiom_arity_clause (tcons, lookup_const tcons ^ "___" ^
blanchet@43495
   405
                               ascii_of class, ar) ::
blanchet@43495
   406
      arity_clause (class :: seen) n (tcons, ars)
blanchet@43085
   407
blanchet@43085
   408
fun multi_arity_clause [] = []
blanchet@43085
   409
  | multi_arity_clause ((tcons, ars) :: tc_arlists) =
blanchet@44772
   410
    arity_clause [] 1 (tcons, ars) @ multi_arity_clause tc_arlists
blanchet@43085
   411
blanchet@43622
   412
(* Generate all pairs (tycon, class, sorts) such that tycon belongs to class in
blanchet@43622
   413
   theory thy provided its arguments have the corresponding sorts. *)
blanchet@43085
   414
fun type_class_pairs thy tycons classes =
blanchet@43093
   415
  let
blanchet@43093
   416
    val alg = Sign.classes_of thy
blanchet@43093
   417
    fun domain_sorts tycon = Sorts.mg_domain alg tycon o single
blanchet@43093
   418
    fun add_class tycon class =
blanchet@43093
   419
      cons (class, domain_sorts tycon class)
blanchet@43093
   420
      handle Sorts.CLASS_ERROR _ => I
blanchet@43093
   421
    fun try_classes tycon = (tycon, fold (add_class tycon) classes [])
blanchet@43093
   422
  in map try_classes tycons end
blanchet@43085
   423
blanchet@43085
   424
(*Proving one (tycon, class) membership may require proving others, so iterate.*)
blanchet@43085
   425
fun iter_type_class_pairs _ _ [] = ([], [])
blanchet@43085
   426
  | iter_type_class_pairs thy tycons classes =
blanchet@43263
   427
      let
blanchet@43263
   428
        fun maybe_insert_class s =
blanchet@43263
   429
          (s <> type_class andalso not (member (op =) classes s))
blanchet@43263
   430
          ? insert (op =) s
blanchet@43263
   431
        val cpairs = type_class_pairs thy tycons classes
blanchet@43263
   432
        val newclasses =
blanchet@43263
   433
          [] |> fold (fold (fold (fold maybe_insert_class) o snd) o snd) cpairs
blanchet@43263
   434
        val (classes', cpairs') = iter_type_class_pairs thy tycons newclasses
blanchet@43266
   435
      in (classes' @ classes, union (op =) cpairs' cpairs) end
blanchet@43085
   436
blanchet@43085
   437
fun make_arity_clauses thy tycons =
blanchet@43085
   438
  iter_type_class_pairs thy tycons ##> multi_arity_clause
blanchet@43085
   439
blanchet@43085
   440
blanchet@43085
   441
(** Isabelle class relations **)
blanchet@43085
   442
blanchet@43086
   443
type class_rel_clause =
blanchet@43496
   444
  {name : string,
blanchet@43496
   445
   subclass : name,
blanchet@43496
   446
   superclass : name}
blanchet@43085
   447
blanchet@43622
   448
(* Generate all pairs (sub, super) such that sub is a proper subclass of super
blanchet@43622
   449
   in theory "thy". *)
blanchet@43085
   450
fun class_pairs _ [] _ = []
blanchet@43085
   451
  | class_pairs thy subs supers =
blanchet@43085
   452
      let
blanchet@43085
   453
        val class_less = Sorts.class_less (Sign.classes_of thy)
blanchet@43085
   454
        fun add_super sub super = class_less (sub, super) ? cons (sub, super)
blanchet@43085
   455
        fun add_supers sub = fold (add_super sub) supers
blanchet@43085
   456
      in fold add_supers subs [] end
blanchet@43085
   457
blanchet@43622
   458
fun make_class_rel_clause (sub, super) =
blanchet@43622
   459
  {name = sub ^ "_" ^ super, subclass = `make_type_class sub,
blanchet@43086
   460
   superclass = `make_type_class super}
blanchet@43085
   461
blanchet@43085
   462
fun make_class_rel_clauses thy subs supers =
blanchet@43093
   463
  map make_class_rel_clause (class_pairs thy subs supers)
blanchet@43085
   464
blanchet@43859
   465
(* intermediate terms *)
blanchet@43859
   466
datatype iterm =
blanchet@43859
   467
  IConst of name * typ * typ list |
blanchet@43859
   468
  IVar of name * typ |
blanchet@43859
   469
  IApp of iterm * iterm |
blanchet@43859
   470
  IAbs of (name * typ) * iterm
blanchet@43085
   471
blanchet@43859
   472
fun ityp_of (IConst (_, T, _)) = T
blanchet@43859
   473
  | ityp_of (IVar (_, T)) = T
blanchet@43859
   474
  | ityp_of (IApp (t1, _)) = snd (dest_funT (ityp_of t1))
blanchet@43859
   475
  | ityp_of (IAbs ((_, T), tm)) = T --> ityp_of tm
blanchet@43085
   476
blanchet@43085
   477
(*gets the head of a combinator application, along with the list of arguments*)
blanchet@43859
   478
fun strip_iterm_comb u =
blanchet@43496
   479
  let
blanchet@43859
   480
    fun stripc (IApp (t, u), ts) = stripc (t, u :: ts)
blanchet@43496
   481
      | stripc x = x
blanchet@43496
   482
  in stripc (u, []) end
blanchet@43085
   483
blanchet@45316
   484
fun atomic_types_of T = fold_atyps (insert (op =)) T []
blanchet@43085
   485
blanchet@45509
   486
val tvar_a_str = "'a"
blanchet@45509
   487
val tvar_a = TVar ((tvar_a_str, 0), HOLogic.typeS)
blanchet@45509
   488
val tvar_a_name = (make_schematic_type_var (tvar_a_str, 0), tvar_a_str)
blanchet@45509
   489
val itself_name = `make_fixed_type_const @{type_name itself}
blanchet@45509
   490
val TYPE_name = `(make_fixed_const NONE) @{const_name TYPE}
blanchet@45509
   491
val tvar_a_atype = AType (tvar_a_name, [])
blanchet@45509
   492
val a_itself_atype = AType (itself_name, [tvar_a_atype])
blanchet@45509
   493
blanchet@43085
   494
fun new_skolem_const_name s num_T_args =
blanchet@43085
   495
  [new_skolem_const_prefix, s, string_of_int num_T_args]
wenzelm@46711
   496
  |> Long_Name.implode
blanchet@43085
   497
blanchet@44594
   498
fun robust_const_type thy s =
blanchet@45509
   499
  if s = app_op_name then
blanchet@45509
   500
    Logic.varifyT_global @{typ "('a => 'b) => 'a => 'b"}
blanchet@45554
   501
  else if String.isPrefix lam_lifted_prefix s then
blanchet@45509
   502
    Logic.varifyT_global @{typ "'a => 'b"}
blanchet@45509
   503
  else
blanchet@45509
   504
    (* Old Skolems throw a "TYPE" exception here, which will be caught. *)
blanchet@45509
   505
    s |> Sign.the_const_type thy
blanchet@44594
   506
blanchet@46642
   507
val robust_const_ary =
blanchet@46642
   508
  let
blanchet@46642
   509
    fun ary (Type (@{type_name fun}, [_, T])) = 1 + ary T
blanchet@46642
   510
      | ary _ = 0
blanchet@46642
   511
  in ary oo robust_const_type end
blanchet@46642
   512
blanchet@44594
   513
(* This function only makes sense if "T" is as general as possible. *)
blanchet@44594
   514
fun robust_const_typargs thy (s, T) =
blanchet@45509
   515
  if s = app_op_name then
blanchet@45509
   516
    let val (T1, T2) = T |> domain_type |> dest_funT in [T1, T2] end
blanchet@45509
   517
  else if String.isPrefix old_skolem_const_prefix s then
blanchet@45509
   518
    [] |> Term.add_tvarsT T |> rev |> map TVar
blanchet@45554
   519
  else if String.isPrefix lam_lifted_prefix s then
blanchet@45554
   520
    if String.isPrefix lam_lifted_poly_prefix s then
blanchet@45511
   521
      let val (T1, T2) = T |> dest_funT in [T1, T2] end
blanchet@45511
   522
    else
blanchet@45511
   523
      []
blanchet@45509
   524
  else
blanchet@45509
   525
    (s, T) |> Sign.const_typargs thy
blanchet@44594
   526
blanchet@43859
   527
(* Converts an Isabelle/HOL term (with combinators) into an intermediate term.
blanchet@43859
   528
   Also accumulates sort infomation. *)
nik@44495
   529
fun iterm_from_term thy format bs (P $ Q) =
blanchet@43085
   530
    let
nik@44495
   531
      val (P', P_atomics_Ts) = iterm_from_term thy format bs P
nik@44495
   532
      val (Q', Q_atomics_Ts) = iterm_from_term thy format bs Q
blanchet@43859
   533
    in (IApp (P', Q'), union (op =) P_atomics_Ts Q_atomics_Ts) end
nik@44495
   534
  | iterm_from_term thy format _ (Const (c, T)) =
nik@44495
   535
    (IConst (`(make_fixed_const (SOME format)) c, T,
blanchet@44594
   536
             robust_const_typargs thy (c, T)),
blanchet@45316
   537
     atomic_types_of T)
nik@44495
   538
  | iterm_from_term _ _ _ (Free (s, T)) =
blanchet@45509
   539
    (IConst (`make_fixed_var s, T, []), atomic_types_of T)
nik@44495
   540
  | iterm_from_term _ format _ (Var (v as (s, _), T)) =
blanchet@43085
   541
    (if String.isPrefix Meson_Clausify.new_skolem_var_prefix s then
blanchet@43085
   542
       let
blanchet@43085
   543
         val Ts = T |> strip_type |> swap |> op ::
blanchet@43085
   544
         val s' = new_skolem_const_name s (length Ts)
nik@44495
   545
       in IConst (`(make_fixed_const (SOME format)) s', T, Ts) end
blanchet@43085
   546
     else
blanchet@45316
   547
       IVar ((make_schematic_var v, s), T), atomic_types_of T)
nik@44495
   548
  | iterm_from_term _ _ bs (Bound j) =
blanchet@45316
   549
    nth bs j |> (fn (_, (name, T)) => (IConst (name, T, []), atomic_types_of T))
nik@44495
   550
  | iterm_from_term thy format bs (Abs (s, T, t)) =
nik@43678
   551
    let
nik@43678
   552
      fun vary s = s |> AList.defined (op =) bs s ? vary o Symbol.bump_string
nik@43678
   553
      val s = vary s
blanchet@44403
   554
      val name = `make_bound_var s
nik@44495
   555
      val (tm, atomic_Ts) = iterm_from_term thy format ((s, (name, T)) :: bs) t
blanchet@45316
   556
    in (IAbs ((name, T), tm), union (op =) atomic_Ts (atomic_types_of T)) end
blanchet@43085
   557
blanchet@46340
   558
datatype scope = Global | Local | Assum | Chained
blanchet@46393
   559
datatype status = General | Induct | Intro | Elim | Simp | Spec_Eq
blanchet@46340
   560
type stature = scope * status
blanchet@43085
   561
blanchet@43624
   562
datatype order = First_Order | Higher_Order
blanchet@44494
   563
datatype polymorphism = Polymorphic | Raw_Monomorphic | Mangled_Monomorphic
blanchet@46301
   564
datatype strictness = Strict | Non_Strict
blanchet@44811
   565
datatype granularity = All_Vars | Positively_Naked_Vars | Ghost_Type_Arg_Vars
blanchet@42613
   566
datatype type_level =
blanchet@44397
   567
  All_Types |
blanchet@46301
   568
  Noninf_Nonmono_Types of strictness * granularity |
blanchet@44811
   569
  Fin_Nonmono_Types of granularity |
blanchet@44397
   570
  Const_Arg_Types |
blanchet@43362
   571
  No_Types
blanchet@42613
   572
blanchet@43626
   573
datatype type_enc =
blanchet@44591
   574
  Simple_Types of order * polymorphism * type_level |
blanchet@44768
   575
  Guards of polymorphism * type_level |
blanchet@44768
   576
  Tags of polymorphism * type_level
blanchet@44768
   577
blanchet@44768
   578
fun is_type_enc_higher_order (Simple_Types (Higher_Order, _, _)) = true
blanchet@44768
   579
  | is_type_enc_higher_order _ = false
blanchet@44768
   580
blanchet@44768
   581
fun polymorphism_of_type_enc (Simple_Types (_, poly, _)) = poly
blanchet@44768
   582
  | polymorphism_of_type_enc (Guards (poly, _)) = poly
blanchet@44768
   583
  | polymorphism_of_type_enc (Tags (poly, _)) = poly
blanchet@44768
   584
blanchet@44768
   585
fun level_of_type_enc (Simple_Types (_, _, level)) = level
blanchet@44768
   586
  | level_of_type_enc (Guards (_, level)) = level
blanchet@44768
   587
  | level_of_type_enc (Tags (_, level)) = level
blanchet@44768
   588
blanchet@44811
   589
fun granularity_of_type_level (Noninf_Nonmono_Types (_, grain)) = grain
blanchet@44811
   590
  | granularity_of_type_level (Fin_Nonmono_Types grain) = grain
blanchet@44811
   591
  | granularity_of_type_level _ = All_Vars
blanchet@44768
   592
blanchet@44768
   593
fun is_type_level_quasi_sound All_Types = true
blanchet@44768
   594
  | is_type_level_quasi_sound (Noninf_Nonmono_Types _) = true
blanchet@44768
   595
  | is_type_level_quasi_sound _ = false
blanchet@44768
   596
val is_type_enc_quasi_sound = is_type_level_quasi_sound o level_of_type_enc
blanchet@44768
   597
blanchet@44768
   598
fun is_type_level_fairly_sound (Fin_Nonmono_Types _) = true
blanchet@44768
   599
  | is_type_level_fairly_sound level = is_type_level_quasi_sound level
blanchet@44768
   600
val is_type_enc_fairly_sound = is_type_level_fairly_sound o level_of_type_enc
blanchet@44768
   601
blanchet@44768
   602
fun is_type_level_monotonicity_based (Noninf_Nonmono_Types _) = true
blanchet@44768
   603
  | is_type_level_monotonicity_based (Fin_Nonmono_Types _) = true
blanchet@44768
   604
  | is_type_level_monotonicity_based _ = false
blanchet@42613
   605
blanchet@44785
   606
(* "_query", "_bang", and "_at" are for the ASCII-challenged Metis and
blanchet@44785
   607
   Mirabelle. *)
blanchet@44785
   608
val queries = ["?", "_query"]
blanchet@44785
   609
val bangs = ["!", "_bang"]
blanchet@44785
   610
val ats = ["@", "_at"]
blanchet@44785
   611
blanchet@42689
   612
fun try_unsuffixes ss s =
blanchet@42689
   613
  fold (fn s' => fn NONE => try (unsuffix s') s | some => some) ss NONE
blanchet@42689
   614
blanchet@44785
   615
fun try_nonmono constr suffixes fallback s =
blanchet@44785
   616
  case try_unsuffixes suffixes s of
blanchet@44785
   617
    SOME s =>
blanchet@44785
   618
    (case try_unsuffixes suffixes s of
blanchet@44811
   619
       SOME s => (constr Positively_Naked_Vars, s)
blanchet@44785
   620
     | NONE =>
blanchet@44785
   621
       case try_unsuffixes ats s of
blanchet@44811
   622
         SOME s => (constr Ghost_Type_Arg_Vars, s)
blanchet@44811
   623
       | NONE => (constr All_Vars, s))
blanchet@44785
   624
  | NONE => fallback s
blanchet@44768
   625
blanchet@46301
   626
fun type_enc_from_string strictness s =
blanchet@42722
   627
  (case try (unprefix "poly_") s of
blanchet@42722
   628
     SOME s => (SOME Polymorphic, s)
blanchet@42613
   629
   | NONE =>
blanchet@44494
   630
     case try (unprefix "raw_mono_") s of
blanchet@44494
   631
       SOME s => (SOME Raw_Monomorphic, s)
blanchet@42722
   632
     | NONE =>
blanchet@44494
   633
       case try (unprefix "mono_") s of
blanchet@42722
   634
         SOME s => (SOME Mangled_Monomorphic, s)
blanchet@42722
   635
       | NONE => (NONE, s))
blanchet@44785
   636
  ||> (pair All_Types
blanchet@44785
   637
       |> try_nonmono Fin_Nonmono_Types bangs
blanchet@46301
   638
       |> try_nonmono (curry Noninf_Nonmono_Types strictness) queries)
blanchet@44768
   639
  |> (fn (poly, (level, core)) =>
blanchet@44768
   640
         case (core, (poly, level)) of
blanchet@46435
   641
           ("native", (SOME poly, _)) =>
blanchet@44742
   642
           (case (poly, level) of
blanchet@44742
   643
              (Polymorphic, All_Types) =>
blanchet@44742
   644
              Simple_Types (First_Order, Polymorphic, All_Types)
blanchet@44742
   645
            | (Mangled_Monomorphic, _) =>
blanchet@44811
   646
              if granularity_of_type_level level = All_Vars then
blanchet@44768
   647
                Simple_Types (First_Order, Mangled_Monomorphic, level)
blanchet@44768
   648
              else
blanchet@44768
   649
                raise Same.SAME
blanchet@44742
   650
            | _ => raise Same.SAME)
blanchet@46435
   651
         | ("native_higher", (SOME poly, _)) =>
blanchet@44591
   652
           (case (poly, level) of
blanchet@44754
   653
              (Polymorphic, All_Types) =>
blanchet@44754
   654
              Simple_Types (Higher_Order, Polymorphic, All_Types)
blanchet@44754
   655
            | (_, Noninf_Nonmono_Types _) => raise Same.SAME
blanchet@44742
   656
            | (Mangled_Monomorphic, _) =>
blanchet@44811
   657
              if granularity_of_type_level level = All_Vars then
blanchet@44768
   658
                Simple_Types (Higher_Order, Mangled_Monomorphic, level)
blanchet@44768
   659
              else
blanchet@44768
   660
                raise Same.SAME
blanchet@44742
   661
            | _ => raise Same.SAME)
blanchet@44810
   662
         | ("guards", (SOME poly, _)) =>
blanchet@45949
   663
           if poly = Mangled_Monomorphic andalso
blanchet@45949
   664
              granularity_of_type_level level = Ghost_Type_Arg_Vars then
blanchet@45949
   665
             raise Same.SAME
blanchet@45949
   666
           else
blanchet@45949
   667
             Guards (poly, level)
blanchet@44810
   668
         | ("tags", (SOME poly, _)) =>
blanchet@45949
   669
           if granularity_of_type_level level = Ghost_Type_Arg_Vars then
blanchet@45949
   670
             raise Same.SAME
blanchet@45949
   671
           else
blanchet@45949
   672
             Tags (poly, level)
blanchet@44768
   673
         | ("args", (SOME poly, All_Types (* naja *))) =>
blanchet@44768
   674
           Guards (poly, Const_Arg_Types)
blanchet@44768
   675
         | ("erased", (NONE, All_Types (* naja *))) =>
blanchet@44768
   676
           Guards (Polymorphic, No_Types)
blanchet@42753
   677
         | _ => raise Same.SAME)
blanchet@44785
   678
  handle Same.SAME => error ("Unknown type encoding: " ^ quote s ^ ".")
blanchet@42613
   679
blanchet@44754
   680
fun adjust_type_enc (THF (TPTP_Monomorphic, _, _))
blanchet@44754
   681
                    (Simple_Types (order, _, level)) =
blanchet@44591
   682
    Simple_Types (order, Mangled_Monomorphic, level)
blanchet@44754
   683
  | adjust_type_enc (THF _) type_enc = type_enc
blanchet@44754
   684
  | adjust_type_enc (TFF (TPTP_Monomorphic, _)) (Simple_Types (_, _, level)) =
blanchet@44591
   685
    Simple_Types (First_Order, Mangled_Monomorphic, level)
blanchet@45303
   686
  | adjust_type_enc (DFG DFG_Sorted) (Simple_Types (_, _, level)) =
blanchet@45301
   687
    Simple_Types (First_Order, Mangled_Monomorphic, level)
blanchet@44754
   688
  | adjust_type_enc (TFF _) (Simple_Types (_, poly, level)) =
blanchet@44591
   689
    Simple_Types (First_Order, poly, level)
blanchet@44591
   690
  | adjust_type_enc format (Simple_Types (_, poly, level)) =
blanchet@44768
   691
    adjust_type_enc format (Guards (poly, level))
blanchet@44416
   692
  | adjust_type_enc CNF_UEQ (type_enc as Guards stuff) =
blanchet@44416
   693
    (if is_type_enc_fairly_sound type_enc then Tags else Guards) stuff
blanchet@44416
   694
  | adjust_type_enc _ type_enc = type_enc
blanchet@43101
   695
blanchet@46818
   696
fun is_fol_term t =
blanchet@46818
   697
  case t of
blanchet@46818
   698
    @{const Not} $ t1 => is_fol_term t1
blanchet@46818
   699
  | Const (@{const_name All}, _) $ Abs (_, _, t') => is_fol_term t'
blanchet@46818
   700
  | Const (@{const_name All}, _) $ t1 => is_fol_term t1
blanchet@46818
   701
  | Const (@{const_name Ex}, _) $ Abs (_, _, t') => is_fol_term t'
blanchet@46818
   702
  | Const (@{const_name Ex}, _) $ t1 => is_fol_term t1
blanchet@46818
   703
  | @{const HOL.conj} $ t1 $ t2 => is_fol_term t1 andalso is_fol_term t2
blanchet@46818
   704
  | @{const HOL.disj} $ t1 $ t2 => is_fol_term t1 andalso is_fol_term t2
blanchet@46818
   705
  | @{const HOL.implies} $ t1 $ t2 => is_fol_term t1 andalso is_fol_term t2
blanchet@46818
   706
  | Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 =>
blanchet@46818
   707
    is_fol_term t1 andalso is_fol_term t2
blanchet@46818
   708
  | _ => not (exists_subterm (fn Abs _ => true | _ => false) t)
blanchet@46818
   709
blanchet@46818
   710
fun simple_translate_lambdas do_lambdas ctxt t =
blanchet@46818
   711
  if is_fol_term t then
blanchet@46818
   712
    t
blanchet@46818
   713
  else
blanchet@46818
   714
    let
blanchet@46818
   715
      fun trans Ts t =
blanchet@46818
   716
        case t of
blanchet@46818
   717
          @{const Not} $ t1 => @{const Not} $ trans Ts t1
blanchet@46818
   718
        | (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') =>
blanchet@46818
   719
          t0 $ Abs (s, T, trans (T :: Ts) t')
blanchet@46818
   720
        | (t0 as Const (@{const_name All}, _)) $ t1 =>
blanchet@46818
   721
          trans Ts (t0 $ eta_expand Ts t1 1)
blanchet@46818
   722
        | (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') =>
blanchet@46818
   723
          t0 $ Abs (s, T, trans (T :: Ts) t')
blanchet@46818
   724
        | (t0 as Const (@{const_name Ex}, _)) $ t1 =>
blanchet@46818
   725
          trans Ts (t0 $ eta_expand Ts t1 1)
blanchet@46818
   726
        | (t0 as @{const HOL.conj}) $ t1 $ t2 =>
blanchet@46818
   727
          t0 $ trans Ts t1 $ trans Ts t2
blanchet@46818
   728
        | (t0 as @{const HOL.disj}) $ t1 $ t2 =>
blanchet@46818
   729
          t0 $ trans Ts t1 $ trans Ts t2
blanchet@46818
   730
        | (t0 as @{const HOL.implies}) $ t1 $ t2 =>
blanchet@46818
   731
          t0 $ trans Ts t1 $ trans Ts t2
blanchet@46818
   732
        | (t0 as Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])))
blanchet@46818
   733
            $ t1 $ t2 =>
blanchet@46818
   734
          t0 $ trans Ts t1 $ trans Ts t2
blanchet@46818
   735
        | _ =>
blanchet@46818
   736
          if not (exists_subterm (fn Abs _ => true | _ => false) t) then t
blanchet@46818
   737
          else t |> Envir.eta_contract |> do_lambdas ctxt Ts
blanchet@46818
   738
      val (t, ctxt') = Variable.import_terms true [t] ctxt |>> the_single
blanchet@46818
   739
    in t |> trans [] |> singleton (Variable.export_terms ctxt' ctxt) end
blanchet@46818
   740
blanchet@46818
   741
fun do_cheaply_conceal_lambdas Ts (t1 $ t2) =
blanchet@46818
   742
    do_cheaply_conceal_lambdas Ts t1
blanchet@46818
   743
    $ do_cheaply_conceal_lambdas Ts t2
blanchet@46818
   744
  | do_cheaply_conceal_lambdas Ts (Abs (_, T, t)) =
blanchet@46818
   745
    Const (lam_lifted_poly_prefix ^ serial_string (),
blanchet@46818
   746
           T --> fastype_of1 (T :: Ts, t))
blanchet@46818
   747
  | do_cheaply_conceal_lambdas _ t = t
blanchet@46818
   748
blanchet@46818
   749
fun concealed_bound_name j = atp_weak_prefix ^ string_of_int j
blanchet@46818
   750
fun conceal_bounds Ts t =
blanchet@46818
   751
  subst_bounds (map (Free o apfst concealed_bound_name)
blanchet@46818
   752
                    (0 upto length Ts - 1 ~~ Ts), t)
blanchet@46818
   753
fun reveal_bounds Ts =
blanchet@46818
   754
  subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j))
blanchet@46818
   755
                    (0 upto length Ts - 1 ~~ Ts))
blanchet@46818
   756
blanchet@46818
   757
fun do_introduce_combinators ctxt Ts t =
blanchet@46818
   758
  let val thy = Proof_Context.theory_of ctxt in
blanchet@46818
   759
    t |> conceal_bounds Ts
blanchet@46818
   760
      |> cterm_of thy
blanchet@46818
   761
      |> Meson_Clausify.introduce_combinators_in_cterm
blanchet@46818
   762
      |> prop_of |> Logic.dest_equals |> snd
blanchet@46818
   763
      |> reveal_bounds Ts
blanchet@46818
   764
  end
blanchet@46818
   765
  (* A type variable of sort "{}" will make abstraction fail. *)
blanchet@46818
   766
  handle THM _ => t |> do_cheaply_conceal_lambdas Ts
blanchet@46818
   767
val introduce_combinators = simple_translate_lambdas do_introduce_combinators
blanchet@46818
   768
blanchet@45509
   769
fun constify_lifted (t $ u) = constify_lifted t $ constify_lifted u
blanchet@45509
   770
  | constify_lifted (Abs (s, T, t)) = Abs (s, T, constify_lifted t)
blanchet@45509
   771
  | constify_lifted (Free (x as (s, _))) =
blanchet@45554
   772
    (if String.isPrefix lam_lifted_prefix s then Const else Free) x
blanchet@45509
   773
  | constify_lifted t = t
blanchet@45509
   774
blanchet@46375
   775
(* Requires bound variables not to clash with any schematic variables (as should
blanchet@46375
   776
   be the case right after lambda-lifting). *)
blanchet@46385
   777
fun open_form unprefix (t as Const (@{const_name All}, _) $ Abs (s, T, t')) =
blanchet@46385
   778
    (case try unprefix s of
blanchet@46385
   779
       SOME s =>
blanchet@46385
   780
       let
blanchet@46385
   781
         val names = Name.make_context (map fst (Term.add_var_names t' []))
blanchet@46385
   782
         val (s, _) = Name.variant s names
blanchet@46385
   783
       in open_form unprefix (subst_bound (Var ((s, 0), T), t')) end
blanchet@46385
   784
     | NONE => t)
blanchet@46385
   785
  | open_form _ t = t
blanchet@46375
   786
blanchet@45554
   787
fun lift_lams_part_1 ctxt type_enc =
blanchet@45568
   788
  map close_form #> rpair ctxt
blanchet@44088
   789
  #-> Lambda_Lifting.lift_lambdas
blanchet@45564
   790
          (SOME ((if polymorphism_of_type_enc type_enc = Polymorphic then
blanchet@45564
   791
                    lam_lifted_poly_prefix
blanchet@45564
   792
                  else
blanchet@45564
   793
                    lam_lifted_mono_prefix) ^ "_a"))
blanchet@44088
   794
          Lambda_Lifting.is_quantifier
blanchet@45554
   795
  #> fst
blanchet@46818
   796
blanchet@46818
   797
fun lift_lams_part_2 ctxt (facts, lifted) =
blanchet@46818
   798
  (facts, lifted)
blanchet@46818
   799
  (* Lambda-lifting sometimes leaves some lambdas around; we need some way to get rid
blanchet@46818
   800
     of them *)
blanchet@46818
   801
  |> pairself (map (introduce_combinators ctxt))
blanchet@46818
   802
  |> pairself (map constify_lifted)
blanchet@46818
   803
  |>> map (open_form (unprefix close_form_prefix))
blanchet@46818
   804
  ||> map (open_form I)
blanchet@46818
   805
blanchet@46818
   806
fun lift_lams ctxt = lift_lams_part_2 ctxt oo lift_lams_part_1 ctxt
blanchet@44088
   807
blanchet@44088
   808
fun intentionalize_def (Const (@{const_name All}, _) $ Abs (_, _, t)) =
blanchet@44088
   809
    intentionalize_def t
blanchet@44088
   810
  | intentionalize_def (Const (@{const_name HOL.eq}, _) $ t $ u) =
blanchet@44088
   811
    let
blanchet@44088
   812
      fun lam T t = Abs (Name.uu, T, t)
blanchet@44088
   813
      val (head, args) = strip_comb t ||> rev
blanchet@44088
   814
      val head_T = fastype_of head
blanchet@44088
   815
      val n = length args
blanchet@44088
   816
      val arg_Ts = head_T |> binder_types |> take n |> rev
blanchet@44088
   817
      val u = u |> subst_atomic (args ~~ map Bound (0 upto n - 1))
blanchet@44088
   818
    in HOLogic.eq_const head_T $ head $ fold lam arg_Ts u end
blanchet@44088
   819
  | intentionalize_def t = t
blanchet@44088
   820
blanchet@40114
   821
type translated_formula =
blanchet@43496
   822
  {name : string,
blanchet@46340
   823
   stature : stature,
blanchet@43496
   824
   kind : formula_kind,
blanchet@43859
   825
   iformula : (name, typ, iterm) formula,
blanchet@43496
   826
   atomic_types : typ list}
blanchet@38282
   827
blanchet@46340
   828
fun update_iformula f ({name, stature, kind, iformula, atomic_types}
blanchet@43859
   829
                       : translated_formula) =
blanchet@46340
   830
  {name = name, stature = stature, kind = kind, iformula = f iformula,
blanchet@42562
   831
   atomic_types = atomic_types} : translated_formula
blanchet@42542
   832
blanchet@43859
   833
fun fact_lift f ({iformula, ...} : translated_formula) = f iformula
blanchet@42558
   834
blanchet@43064
   835
fun insert_type ctxt get_T x xs =
blanchet@43064
   836
  let val T = get_T x in
blanchet@44399
   837
    if exists (type_instance ctxt T o get_T) xs then xs
blanchet@44399
   838
    else x :: filter_out (type_generalization ctxt T o get_T) xs
blanchet@43064
   839
  end
blanchet@42677
   840
blanchet@42753
   841
(* The Booleans indicate whether all type arguments should be kept. *)
blanchet@42753
   842
datatype type_arg_policy =
blanchet@45937
   843
  Explicit_Type_Args of bool (* infer_from_term_args *) |
blanchet@44771
   844
  Mangled_Type_Args |
blanchet@42753
   845
  No_Type_Args
blanchet@41136
   846
blanchet@45945
   847
fun type_arg_policy monom_constrs type_enc s =
blanchet@45315
   848
  let val poly = polymorphism_of_type_enc type_enc in
blanchet@44774
   849
    if s = type_tag_name then
blanchet@45315
   850
      if poly = Mangled_Monomorphic then Mangled_Type_Args
blanchet@45315
   851
      else Explicit_Type_Args false
blanchet@44774
   852
    else case type_enc of
blanchet@45315
   853
      Simple_Types (_, Polymorphic, _) => Explicit_Type_Args false
blanchet@45315
   854
    | Tags (_, All_Types) => No_Type_Args
blanchet@44774
   855
    | _ =>
blanchet@44774
   856
      let val level = level_of_type_enc type_enc in
blanchet@44774
   857
        if level = No_Types orelse s = @{const_name HOL.eq} orelse
blanchet@44774
   858
           (s = app_op_name andalso level = Const_Arg_Types) then
blanchet@44774
   859
          No_Type_Args
blanchet@45315
   860
        else if poly = Mangled_Monomorphic then
blanchet@44774
   861
          Mangled_Type_Args
blanchet@45945
   862
        else if member (op =) monom_constrs s andalso
blanchet@45945
   863
                granularity_of_type_level level = Positively_Naked_Vars then
blanchet@45945
   864
          No_Type_Args
blanchet@44774
   865
        else
blanchet@44811
   866
          Explicit_Type_Args
blanchet@44811
   867
              (level = All_Types orelse
blanchet@44811
   868
               granularity_of_type_level level = Ghost_Type_Arg_Vars)
blanchet@44774
   869
      end
blanchet@44774
   870
  end
blanchet@42227
   871
blanchet@44625
   872
(* Make atoms for sorted type variables. *)
blanchet@43263
   873
fun generic_add_sorts_on_type (_, []) = I
blanchet@43263
   874
  | generic_add_sorts_on_type ((x, i), s :: ss) =
blanchet@43263
   875
    generic_add_sorts_on_type ((x, i), ss)
blanchet@43263
   876
    #> (if s = the_single @{sort HOL.type} then
blanchet@43093
   877
          I
blanchet@43093
   878
        else if i = ~1 then
blanchet@44623
   879
          insert (op =) (`make_type_class s, `make_fixed_type_var x)
blanchet@43093
   880
        else
blanchet@44623
   881
          insert (op =) (`make_type_class s,
blanchet@44623
   882
                         (make_schematic_type_var (x, i), x)))
blanchet@43263
   883
fun add_sorts_on_tfree (TFree (s, S)) = generic_add_sorts_on_type ((s, ~1), S)
blanchet@43263
   884
  | add_sorts_on_tfree _ = I
blanchet@43263
   885
fun add_sorts_on_tvar (TVar z) = generic_add_sorts_on_type z
blanchet@43263
   886
  | add_sorts_on_tvar _ = I
blanchet@43085
   887
blanchet@44625
   888
fun type_class_formula type_enc class arg =
blanchet@44625
   889
  AAtom (ATerm (class, arg ::
blanchet@44625
   890
      (case type_enc of
blanchet@44754
   891
         Simple_Types (First_Order, Polymorphic, _) =>
blanchet@45301
   892
         if avoid_first_order_ghost_type_vars then [ATerm (TYPE_name, [arg])]
blanchet@44754
   893
         else []
blanchet@44625
   894
       | _ => [])))
blanchet@44625
   895
fun formulas_for_types type_enc add_sorts_on_typ Ts =
blanchet@43626
   896
  [] |> level_of_type_enc type_enc <> No_Types ? fold add_sorts_on_typ Ts
blanchet@44625
   897
     |> map (fn (class, name) =>
blanchet@44625
   898
                type_class_formula type_enc class (ATerm (name, [])))
blanchet@41137
   899
blanchet@42534
   900
fun mk_aconns c phis =
blanchet@42534
   901
  let val (phis', phi') = split_last phis in
blanchet@42534
   902
    fold_rev (mk_aconn c) phis' phi'
blanchet@42534
   903
  end
blanchet@38282
   904
fun mk_ahorn [] phi = phi
blanchet@42534
   905
  | mk_ahorn phis psi = AConn (AImplies, [mk_aconns AAnd phis, psi])
blanchet@42522
   906
fun mk_aquant _ [] phi = phi
blanchet@42522
   907
  | mk_aquant q xs (phi as AQuant (q', xs', phi')) =
blanchet@42522
   908
    if q = q' then AQuant (q, xs @ xs', phi') else AQuant (q, xs, phi)
blanchet@42522
   909
  | mk_aquant q xs phi = AQuant (q, xs, phi)
blanchet@38282
   910
blanchet@45315
   911
fun close_universally add_term_vars phi =
blanchet@41145
   912
  let
blanchet@45315
   913
    fun add_formula_vars bounds (AQuant (_, xs, phi)) =
blanchet@45315
   914
        add_formula_vars (map fst xs @ bounds) phi
blanchet@45315
   915
      | add_formula_vars bounds (AConn (_, phis)) =
blanchet@45315
   916
        fold (add_formula_vars bounds) phis
blanchet@45315
   917
      | add_formula_vars bounds (AAtom tm) = add_term_vars bounds tm
blanchet@45315
   918
  in mk_aquant AForall (add_formula_vars [] phi []) phi end
blanchet@42522
   919
blanchet@45377
   920
fun add_term_vars bounds (ATerm (name as (s, _), tms)) =
blanchet@45377
   921
    (if is_tptp_variable s andalso
blanchet@45377
   922
        not (String.isPrefix tvar_prefix s) andalso
blanchet@45377
   923
        not (member (op =) bounds name) then
blanchet@45377
   924
       insert (op =) (name, NONE)
blanchet@45377
   925
     else
blanchet@45377
   926
       I)
blanchet@45377
   927
    #> fold (add_term_vars bounds) tms
blanchet@45377
   928
  | add_term_vars bounds (AAbs ((name, _), tm)) =
blanchet@45377
   929
    add_term_vars (name :: bounds) tm
blanchet@45401
   930
fun close_formula_universally phi = close_universally add_term_vars phi
blanchet@45315
   931
blanchet@45315
   932
fun add_iterm_vars bounds (IApp (tm1, tm2)) =
blanchet@45315
   933
    fold (add_iterm_vars bounds) [tm1, tm2]
blanchet@45315
   934
  | add_iterm_vars _ (IConst _) = I
blanchet@45315
   935
  | add_iterm_vars bounds (IVar (name, T)) =
blanchet@45315
   936
    not (member (op =) bounds name) ? insert (op =) (name, SOME T)
blanchet@45315
   937
  | add_iterm_vars bounds (IAbs (_, tm)) = add_iterm_vars bounds tm
blanchet@45315
   938
fun close_iformula_universally phi = close_universally add_iterm_vars phi
blanchet@41145
   939
blanchet@46338
   940
val fused_infinite_type_name = "ATP.fused_inf" (* shouldn't clash *)
blanchet@44594
   941
val fused_infinite_type = Type (fused_infinite_type_name, [])
blanchet@44594
   942
blanchet@44594
   943
fun tvar_name (x as (s, _)) = (make_schematic_type_var x, s)
blanchet@42994
   944
nik@43676
   945
fun ho_term_from_typ format type_enc =
blanchet@42994
   946
  let
blanchet@42994
   947
    fun term (Type (s, Ts)) =
blanchet@43626
   948
      ATerm (case (is_type_enc_higher_order type_enc, s) of
blanchet@42994
   949
               (true, @{type_name bool}) => `I tptp_bool_type
blanchet@42994
   950
             | (true, @{type_name fun}) => `I tptp_fun_type
blanchet@44594
   951
             | _ => if s = fused_infinite_type_name andalso
blanchet@44235
   952
                       is_format_typed format then
blanchet@43178
   953
                      `I tptp_individual_type
blanchet@43178
   954
                    else
blanchet@43178
   955
                      `make_fixed_type_const s,
blanchet@42994
   956
             map term Ts)
blanchet@42994
   957
    | term (TFree (s, _)) = ATerm (`make_fixed_type_var s, [])
blanchet@44594
   958
    | term (TVar (x, _)) = ATerm (tvar_name x, [])
blanchet@42994
   959
  in term end
blanchet@42562
   960
nik@43676
   961
fun ho_term_for_type_arg format type_enc T =
nik@43676
   962
  if T = dummyT then NONE else SOME (ho_term_from_typ format type_enc T)
blanchet@43401
   963
blanchet@42562
   964
(* This shouldn't clash with anything else. *)
blanchet@46409
   965
val uncurried_alias_sep = "\000"
blanchet@46392
   966
val mangled_type_sep = "\001"
blanchet@46392
   967
blanchet@46409
   968
val ascii_of_uncurried_alias_sep = ascii_of uncurried_alias_sep
blanchet@42542
   969
blanchet@42562
   970
fun generic_mangled_type_name f (ATerm (name, [])) = f name
blanchet@42562
   971
  | generic_mangled_type_name f (ATerm (name, tys)) =
blanchet@42761
   972
    f name ^ "(" ^ space_implode "," (map (generic_mangled_type_name f) tys)
blanchet@42761
   973
    ^ ")"
blanchet@43692
   974
  | generic_mangled_type_name _ _ = raise Fail "unexpected type abstraction"
blanchet@42542
   975
blanchet@44396
   976
fun mangled_type format type_enc =
blanchet@44396
   977
  generic_mangled_type_name fst o ho_term_from_typ format type_enc
blanchet@44396
   978
blanchet@46435
   979
fun make_native_type s =
blanchet@43085
   980
  if s = tptp_bool_type orelse s = tptp_fun_type orelse
blanchet@43085
   981
     s = tptp_individual_type then
blanchet@43085
   982
    s
blanchet@43085
   983
  else
blanchet@46435
   984
    native_type_prefix ^ ascii_of s
blanchet@43085
   985
nik@43676
   986
fun ho_type_from_ho_term type_enc pred_sym ary =
blanchet@42963
   987
  let
blanchet@44593
   988
    fun to_mangled_atype ty =
blanchet@46435
   989
      AType ((make_native_type (generic_mangled_type_name fst ty),
blanchet@44593
   990
              generic_mangled_type_name snd ty), [])
blanchet@44593
   991
    fun to_poly_atype (ATerm (name, tys)) = AType (name, map to_poly_atype tys)
blanchet@44593
   992
      | to_poly_atype _ = raise Fail "unexpected type abstraction"
blanchet@44593
   993
    val to_atype =
blanchet@44593
   994
      if polymorphism_of_type_enc type_enc = Polymorphic then to_poly_atype
blanchet@44593
   995
      else to_mangled_atype
blanchet@42963
   996
    fun to_afun f1 f2 tys = AFun (f1 (hd tys), f2 (nth tys 1))
blanchet@42998
   997
    fun to_fo 0 ty = if pred_sym then bool_atype else to_atype ty
blanchet@42994
   998
      | to_fo ary (ATerm (_, tys)) = to_afun to_atype (to_fo (ary - 1)) tys
blanchet@43692
   999
      | to_fo _ _ = raise Fail "unexpected type abstraction"
blanchet@42994
  1000
    fun to_ho (ty as ATerm ((s, _), tys)) =
nik@43676
  1001
        if s = tptp_fun_type then to_afun to_ho to_ho tys else to_atype ty
nik@43676
  1002
      | to_ho _ = raise Fail "unexpected type abstraction"
blanchet@43626
  1003
  in if is_type_enc_higher_order type_enc then to_ho else to_fo ary end
blanchet@42963
  1004
nik@43677
  1005
fun ho_type_from_typ format type_enc pred_sym ary =
nik@43676
  1006
  ho_type_from_ho_term type_enc pred_sym ary
nik@43676
  1007
  o ho_term_from_typ format type_enc
blanchet@42963
  1008
blanchet@46409
  1009
fun aliased_uncurried ary (s, s') =
blanchet@46409
  1010
  (s ^ ascii_of_uncurried_alias_sep ^ string_of_int ary, s' ^ string_of_int ary)
blanchet@46409
  1011
fun unaliased_uncurried (s, s') =
blanchet@46409
  1012
  case space_explode uncurried_alias_sep s of
blanchet@46392
  1013
    [_] => (s, s')
blanchet@46392
  1014
  | [s1, s2] => (s1, unsuffix s2 s')
blanchet@46392
  1015
  | _ => raise Fail "ill-formed explicit application alias"
blanchet@46392
  1016
blanchet@46392
  1017
fun raw_mangled_const_name type_name ty_args (s, s') =
blanchet@42963
  1018
  let
blanchet@42963
  1019
    fun type_suffix f g =
blanchet@46392
  1020
      fold_rev (curry (op ^) o g o prefix mangled_type_sep o type_name f)
blanchet@46392
  1021
               ty_args ""
blanchet@42963
  1022
  in (s ^ type_suffix fst ascii_of, s' ^ type_suffix snd I) end
blanchet@46392
  1023
fun mangled_const_name format type_enc =
blanchet@46392
  1024
  map_filter (ho_term_for_type_arg format type_enc)
blanchet@46392
  1025
  #> raw_mangled_const_name generic_mangled_type_name
blanchet@42542
  1026
blanchet@42542
  1027
val parse_mangled_ident =
blanchet@42542
  1028
  Scan.many1 (not o member (op =) ["(", ")", ","]) >> implode
blanchet@42542
  1029
blanchet@42542
  1030
fun parse_mangled_type x =
blanchet@42542
  1031
  (parse_mangled_ident
blanchet@42542
  1032
   -- Scan.optional ($$ "(" |-- Scan.optional parse_mangled_types [] --| $$ ")")
blanchet@42542
  1033
                    [] >> ATerm) x
blanchet@42542
  1034
and parse_mangled_types x =
blanchet@42542
  1035
  (parse_mangled_type ::: Scan.repeat ($$ "," |-- parse_mangled_type)) x
blanchet@42542
  1036
blanchet@42542
  1037
fun unmangled_type s =
blanchet@42542
  1038
  s |> suffix ")" |> raw_explode
blanchet@42542
  1039
    |> Scan.finite Symbol.stopper
blanchet@42542
  1040
           (Scan.error (!! (fn _ => raise Fail ("unrecognized mangled type " ^
blanchet@42542
  1041
                                                quote s)) parse_mangled_type))
blanchet@42542
  1042
    |> fst
blanchet@42542
  1043
blanchet@46392
  1044
fun unmangled_const_name s =
blanchet@46409
  1045
  (s, s) |> unaliased_uncurried |> fst |> space_explode mangled_type_sep
blanchet@42542
  1046
fun unmangled_const s =
blanchet@46392
  1047
  let val ss = unmangled_const_name s in
blanchet@42542
  1048
    (hd ss, map unmangled_type (tl ss))
blanchet@42542
  1049
  end
blanchet@42542
  1050
blanchet@44773
  1051
fun introduce_proxies_in_iterm type_enc =
blanchet@42568
  1052
  let
blanchet@43987
  1053
    fun tweak_ho_quant ho_quant T [IAbs _] = IConst (`I ho_quant, T, [])
blanchet@43987
  1054
      | tweak_ho_quant ho_quant (T as Type (_, [p_T as Type (_, [x_T, _]), _]))
blanchet@43987
  1055
                       _ =
blanchet@43987
  1056
        (* Eta-expand "!!" and "??", to work around LEO-II 1.2.8 parser
blanchet@43987
  1057
           limitation. This works in conjuction with special code in
blanchet@43987
  1058
           "ATP_Problem" that uses the syntactic sugar "!" and "?" whenever
blanchet@43987
  1059
           possible. *)
blanchet@43987
  1060
        IAbs ((`I "P", p_T),
blanchet@43987
  1061
              IApp (IConst (`I ho_quant, T, []),
blanchet@43987
  1062
                    IAbs ((`I "X", x_T),
blanchet@43987
  1063
                          IApp (IConst (`I "P", p_T, []),
blanchet@43987
  1064
                                IConst (`I "X", x_T, [])))))
blanchet@43987
  1065
      | tweak_ho_quant _ _ _ = raise Fail "unexpected type for quantifier"
blanchet@43987
  1066
    fun intro top_level args (IApp (tm1, tm2)) =
blanchet@43987
  1067
        IApp (intro top_level (tm2 :: args) tm1, intro false [] tm2)
blanchet@43987
  1068
      | intro top_level args (IConst (name as (s, _), T, T_args)) =
blanchet@42570
  1069
        (case proxify_const s of
blanchet@43159
  1070
           SOME proxy_base =>
blanchet@43626
  1071
           if top_level orelse is_type_enc_higher_order type_enc then
blanchet@43000
  1072
             case (top_level, s) of
blanchet@43987
  1073
               (_, "c_False") => IConst (`I tptp_false, T, [])
blanchet@43987
  1074
             | (_, "c_True") => IConst (`I tptp_true, T, [])
blanchet@43987
  1075
             | (false, "c_Not") => IConst (`I tptp_not, T, [])
blanchet@43987
  1076
             | (false, "c_conj") => IConst (`I tptp_and, T, [])
blanchet@43987
  1077
             | (false, "c_disj") => IConst (`I tptp_or, T, [])
blanchet@43987
  1078
             | (false, "c_implies") => IConst (`I tptp_implies, T, [])
blanchet@43987
  1079
             | (false, "c_All") => tweak_ho_quant tptp_ho_forall T args
blanchet@43987
  1080
             | (false, "c_Ex") => tweak_ho_quant tptp_ho_exists T args
blanchet@43000
  1081
             | (false, s) =>
blanchet@44097
  1082
               if is_tptp_equal s andalso length args = 2 then
blanchet@44097
  1083
                 IConst (`I tptp_equal, T, [])
blanchet@44097
  1084
               else
blanchet@44589
  1085
                 (* Use a proxy even for partially applied THF0 equality,
blanchet@44589
  1086
                    because the LEO-II and Satallax parsers complain about not
blanchet@44589
  1087
                    being able to infer the type of "=". *)
blanchet@44097
  1088
                 IConst (proxy_base |>> prefix const_prefix, T, T_args)
blanchet@43987
  1089
             | _ => IConst (name, T, [])
blanchet@42569
  1090
           else
blanchet@43987
  1091
             IConst (proxy_base |>> prefix const_prefix, T, T_args)
blanchet@45167
  1092
          | NONE => if s = tptp_choice then tweak_ho_quant tptp_choice T args
blanchet@45167
  1093
                    else IConst (name, T, T_args))
blanchet@43987
  1094
      | intro _ _ (IAbs (bound, tm)) = IAbs (bound, intro false [] tm)
blanchet@43987
  1095
      | intro _ _ tm = tm
blanchet@43987
  1096
  in intro true [] end
blanchet@42568
  1097
blanchet@46392
  1098
fun mangle_type_args_in_const format type_enc (name as (s, _)) T_args =
blanchet@46392
  1099
  case unprefix_and_unascii const_prefix s of
blanchet@46392
  1100
    NONE => (name, T_args)
blanchet@46392
  1101
  | SOME s'' =>
blanchet@46392
  1102
    case type_arg_policy [] type_enc (invert_const s'') of
blanchet@46392
  1103
      Mangled_Type_Args => (mangled_const_name format type_enc T_args name, [])
blanchet@46392
  1104
    | _ => (name, T_args)
blanchet@44774
  1105
fun mangle_type_args_in_iterm format type_enc =
blanchet@44774
  1106
  if polymorphism_of_type_enc type_enc = Mangled_Monomorphic then
blanchet@44774
  1107
    let
blanchet@44774
  1108
      fun mangle (IApp (tm1, tm2)) = IApp (mangle tm1, mangle tm2)
blanchet@44774
  1109
        | mangle (tm as IConst (_, _, [])) = tm
blanchet@46392
  1110
        | mangle (IConst (name, T, T_args)) =
blanchet@46392
  1111
          mangle_type_args_in_const format type_enc name T_args
blanchet@46392
  1112
          |> (fn (name, T_args) => IConst (name, T, T_args))
blanchet@44774
  1113
        | mangle (IAbs (bound, tm)) = IAbs (bound, mangle tm)
blanchet@44774
  1114
        | mangle tm = tm
blanchet@44774
  1115
    in mangle end
blanchet@44774
  1116
  else
blanchet@44774
  1117
    I
blanchet@44774
  1118
blanchet@44773
  1119
fun chop_fun 0 T = ([], T)
blanchet@44773
  1120
  | chop_fun n (Type (@{type_name fun}, [dom_T, ran_T])) =
blanchet@44773
  1121
    chop_fun (n - 1) ran_T |>> cons dom_T
blanchet@44773
  1122
  | chop_fun _ T = ([], T)
blanchet@44773
  1123
blanchet@44774
  1124
fun filter_const_type_args _ _ _ [] = []
blanchet@44774
  1125
  | filter_const_type_args thy s ary T_args =
blanchet@44773
  1126
    let
blanchet@44773
  1127
      val U = robust_const_type thy s
blanchet@44773
  1128
      val arg_U_vars = fold Term.add_tvarsT (U |> chop_fun ary |> fst) []
blanchet@44773
  1129
      val U_args = (s, U) |> robust_const_typargs thy
blanchet@44773
  1130
    in
blanchet@44773
  1131
      U_args ~~ T_args
blanchet@44773
  1132
      |> map (fn (U, T) =>
blanchet@44773
  1133
                 if member (op =) arg_U_vars (dest_TVar U) then dummyT else T)
blanchet@44773
  1134
    end
blanchet@44773
  1135
    handle TYPE _ => T_args
blanchet@44773
  1136
blanchet@46392
  1137
fun filter_type_args_in_const _ _ _ _ _ [] = []
blanchet@46392
  1138
  | filter_type_args_in_const thy monom_constrs type_enc ary s T_args =
blanchet@46392
  1139
    case unprefix_and_unascii const_prefix s of
blanchet@46392
  1140
      NONE =>
blanchet@46392
  1141
      if level_of_type_enc type_enc = No_Types orelse s = tptp_choice then []
blanchet@46392
  1142
      else T_args
blanchet@46392
  1143
    | SOME s'' =>
blanchet@46392
  1144
      let
blanchet@46392
  1145
        val s'' = invert_const s''
blanchet@46392
  1146
        fun filter_T_args false = T_args
blanchet@46392
  1147
          | filter_T_args true = filter_const_type_args thy s'' ary T_args
blanchet@46392
  1148
      in
blanchet@46392
  1149
        case type_arg_policy monom_constrs type_enc s'' of
blanchet@46392
  1150
          Explicit_Type_Args infer_from_term_args =>
blanchet@46392
  1151
          filter_T_args infer_from_term_args
blanchet@46392
  1152
        | No_Type_Args => []
blanchet@46392
  1153
        | Mangled_Type_Args => raise Fail "unexpected (un)mangled symbol"
blanchet@46392
  1154
      end
blanchet@45945
  1155
fun filter_type_args_in_iterm thy monom_constrs type_enc =
blanchet@38282
  1156
  let
blanchet@44774
  1157
    fun filt ary (IApp (tm1, tm2)) = IApp (filt (ary + 1) tm1, filt 0 tm2)
blanchet@44774
  1158
      | filt ary (IConst (name as (s, _), T, T_args)) =
blanchet@46392
  1159
        filter_type_args_in_const thy monom_constrs type_enc ary s T_args
blanchet@46392
  1160
        |> (fn T_args => IConst (name, T, T_args))
blanchet@44774
  1161
      | filt _ (IAbs (bound, tm)) = IAbs (bound, filt 0 tm)
blanchet@44774
  1162
      | filt _ tm = tm
blanchet@44774
  1163
  in filt 0 end
blanchet@44773
  1164
blanchet@44773
  1165
fun iformula_from_prop ctxt format type_enc eq_as_iff =
blanchet@44773
  1166
  let
blanchet@44773
  1167
    val thy = Proof_Context.theory_of ctxt
blanchet@45316
  1168
    fun do_term bs t atomic_Ts =
nik@44495
  1169
      iterm_from_term thy format bs (Envir.eta_contract t)
blanchet@44773
  1170
      |>> (introduce_proxies_in_iterm type_enc
blanchet@46392
  1171
           #> mangle_type_args_in_iterm format type_enc #> AAtom)
blanchet@45316
  1172
      ||> union (op =) atomic_Ts
blanchet@44403
  1173
    fun do_quant bs q pos s T t' =
blanchet@44403
  1174
      let
blanchet@44403
  1175
        val s = singleton (Name.variant_list (map fst bs)) s
blanchet@44403
  1176
        val universal = Option.map (q = AExists ? not) pos
blanchet@44403
  1177
        val name =
blanchet@44403
  1178
          s |> `(case universal of
blanchet@44403
  1179
                   SOME true => make_all_bound_var
blanchet@44403
  1180
                 | SOME false => make_exist_bound_var
blanchet@44403
  1181
                 | NONE => make_bound_var)
blanchet@44403
  1182
      in
blanchet@44403
  1183
        do_formula ((s, (name, T)) :: bs) pos t'
blanchet@44403
  1184
        #>> mk_aquant q [(name, SOME T)]
blanchet@45316
  1185
        ##> union (op =) (atomic_types_of T)
blanchet@38518
  1186
      end
blanchet@44403
  1187
    and do_conn bs c pos1 t1 pos2 t2 =
blanchet@44403
  1188
      do_formula bs pos1 t1 ##>> do_formula bs pos2 t2 #>> uncurry (mk_aconn c)
blanchet@44403
  1189
    and do_formula bs pos t =
blanchet@38282
  1190
      case t of
blanchet@44403
  1191
        @{const Trueprop} $ t1 => do_formula bs pos t1
blanchet@44403
  1192
      | @{const Not} $ t1 => do_formula bs (Option.map not pos) t1 #>> mk_anot
blanchet@38282
  1193
      | Const (@{const_name All}, _) $ Abs (s, T, t') =>
blanchet@44403
  1194
        do_quant bs AForall pos s T t'
blanchet@45167
  1195
      | (t0 as Const (@{const_name All}, _)) $ t1 =>
blanchet@45167
  1196
        do_formula bs pos (t0 $ eta_expand (map (snd o snd) bs) t1 1)
blanchet@38282
  1197
      | Const (@{const_name Ex}, _) $ Abs (s, T, t') =>
blanchet@44403
  1198
        do_quant bs AExists pos s T t'
blanchet@45167
  1199
      | (t0 as Const (@{const_name Ex}, _)) $ t1 =>
blanchet@45167
  1200
        do_formula bs pos (t0 $ eta_expand (map (snd o snd) bs) t1 1)
blanchet@44403
  1201
      | @{const HOL.conj} $ t1 $ t2 => do_conn bs AAnd pos t1 pos t2
blanchet@44403
  1202
      | @{const HOL.disj} $ t1 $ t2 => do_conn bs AOr pos t1 pos t2
blanchet@44403
  1203
      | @{const HOL.implies} $ t1 $ t2 =>
blanchet@44403
  1204
        do_conn bs AImplies (Option.map not pos) t1 pos t2
haftmann@38864
  1205
      | Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 =>
blanchet@44403
  1206
        if eq_as_iff then do_conn bs AIff NONE t1 NONE t2 else do_term bs t
blanchet@41140
  1207
      | _ => do_term bs t
blanchet@38282
  1208
  in do_formula [] end
blanchet@38282
  1209
blanchet@46093
  1210
fun presimplify_term ctxt t =
blanchet@46093
  1211
  t |> exists_Const (member (op =) Meson.presimplified_consts o fst) t
blanchet@46093
  1212
       ? (Skip_Proof.make_thm (Proof_Context.theory_of ctxt)
blanchet@46093
  1213
          #> Meson.presimplify
blanchet@46093
  1214
          #> prop_of)
blanchet@38282
  1215
blanchet@43265
  1216
fun is_fun_equality (@{const_name HOL.eq},
blanchet@43265
  1217
                     Type (_, [Type (@{type_name fun}, _), _])) = true
blanchet@43265
  1218
  | is_fun_equality _ = false
blanchet@43265
  1219
blanchet@42747
  1220
fun extensionalize_term ctxt t =
blanchet@43265
  1221
  if exists_Const is_fun_equality t then
blanchet@43265
  1222
    let val thy = Proof_Context.theory_of ctxt in
blanchet@43265
  1223
      t |> cterm_of thy |> Meson.extensionalize_conv ctxt
blanchet@43265
  1224
        |> prop_of |> Logic.dest_equals |> snd
blanchet@43265
  1225
    end
blanchet@43265
  1226
  else
blanchet@43265
  1227
    t
blanchet@38608
  1228
blanchet@45514
  1229
fun preprocess_abstractions_in_terms trans_lams facts =
blanchet@43862
  1230
  let
blanchet@43863
  1231
    val (facts, lambda_ts) =
blanchet@45514
  1232
      facts |> map (snd o snd) |> trans_lams
blanchet@43863
  1233
            |>> map2 (fn (name, (kind, _)) => fn t => (name, (kind, t))) facts
blanchet@45554
  1234
    val lam_facts =
blanchet@43863
  1235
      map2 (fn t => fn j =>
blanchet@46393
  1236
               ((lam_fact_prefix ^ Int.toString j, (Global, Spec_Eq)),
blanchet@46393
  1237
                (Axiom, t)))
blanchet@43863
  1238
           lambda_ts (1 upto length lambda_ts)
blanchet@45554
  1239
  in (facts, lam_facts) end
blanchet@38282
  1240
blanchet@38282
  1241
(* Metis's use of "resolve_tac" freezes the schematic variables. We simulate the
blanchet@42353
  1242
   same in Sledgehammer to prevent the discovery of unreplayable proofs. *)
blanchet@38282
  1243
fun freeze_term t =
blanchet@38282
  1244
  let
blanchet@44814
  1245
    fun freeze (t $ u) = freeze t $ freeze u
blanchet@44814
  1246
      | freeze (Abs (s, T, t)) = Abs (s, T, freeze t)
blanchet@44814
  1247
      | freeze (Var ((s, i), T)) =
blanchet@43863
  1248
        Free (atp_weak_prefix ^ s ^ "_" ^ string_of_int i, T)
blanchet@44814
  1249
      | freeze t = t
blanchet@44814
  1250
  in t |> exists_subterm is_Var t ? freeze end
blanchet@38282
  1251
blanchet@46818
  1252
fun default_formula role = if role = Conjecture then @{term False} else @{term True}
blanchet@46818
  1253
blanchet@46093
  1254
fun presimp_prop ctxt role t =
blanchet@45202
  1255
  (let
blanchet@45202
  1256
     val thy = Proof_Context.theory_of ctxt
blanchet@45202
  1257
     val t = t |> Envir.beta_eta_contract
blanchet@45202
  1258
               |> transform_elim_prop
blanchet@45202
  1259
               |> Object_Logic.atomize_term thy
blanchet@45202
  1260
     val need_trueprop = (fastype_of t = @{typ bool})
blanchet@45202
  1261
   in
blanchet@45202
  1262
     t |> need_trueprop ? HOLogic.mk_Trueprop
blanchet@45202
  1263
       |> extensionalize_term ctxt
blanchet@46093
  1264
       |> presimplify_term ctxt
blanchet@45202
  1265
       |> HOLogic.dest_Trueprop
blanchet@45202
  1266
   end
blanchet@46818
  1267
   handle TERM _ => default_formula role)
blanchet@45202
  1268
  |> pair role
blanchet@43096
  1269
blanchet@46340
  1270
fun make_formula ctxt format type_enc eq_as_iff name stature kind t =
blanchet@43096
  1271
  let
blanchet@45316
  1272
    val (iformula, atomic_Ts) =
blanchet@44773
  1273
      iformula_from_prop ctxt format type_enc eq_as_iff
blanchet@44773
  1274
                         (SOME (kind <> Conjecture)) t []
blanchet@45316
  1275
      |>> close_iformula_universally
blanchet@38282
  1276
  in
blanchet@46340
  1277
    {name = name, stature = stature, kind = kind, iformula = iformula,
blanchet@45316
  1278
     atomic_types = atomic_Ts}
blanchet@38282
  1279
  end
blanchet@38282
  1280
blanchet@46340
  1281
fun make_fact ctxt format type_enc eq_as_iff ((name, stature), t) =
blanchet@44773
  1282
  case t |> make_formula ctxt format type_enc (eq_as_iff andalso format <> CNF)
blanchet@46340
  1283
                         name stature Axiom of
blanchet@44773
  1284
    formula as {iformula = AAtom (IConst ((s, _), _, _)), ...} =>
blanchet@44773
  1285
    if s = tptp_true then NONE else SOME formula
blanchet@44773
  1286
  | formula => SOME formula
blanchet@42561
  1287
blanchet@46385
  1288
fun s_not_trueprop (@{const Trueprop} $ t) = @{const Trueprop} $ s_not t
blanchet@46385
  1289
  | s_not_trueprop t =
blanchet@46385
  1290
    if fastype_of t = @{typ bool} then s_not t
blanchet@46377
  1291
    else @{prop False} (* "t" is too meta *)
blanchet@44460
  1292
blanchet@44773
  1293
fun make_conjecture ctxt format type_enc =
blanchet@46340
  1294
  map (fn ((name, stature), (kind, t)) =>
blanchet@46385
  1295
          t |> kind = Conjecture ? s_not_trueprop
blanchet@46340
  1296
            |> make_formula ctxt format type_enc (format <> CNF) name stature
blanchet@46340
  1297
                            kind)
blanchet@38282
  1298
blanchet@42682
  1299
(** Finite and infinite type inference **)
blanchet@42682
  1300
blanchet@44814
  1301
fun tvar_footprint thy s ary =
blanchet@45511
  1302
  (case unprefix_and_unascii const_prefix s of
blanchet@44814
  1303
     SOME s =>
blanchet@44814
  1304
     s |> invert_const |> robust_const_type thy |> chop_fun ary |> fst
blanchet@44814
  1305
       |> map (fn T => Term.add_tvarsT T [] |> map fst)
blanchet@44814
  1306
   | NONE => [])
blanchet@44814
  1307
  handle TYPE _ => []
blanchet@44814
  1308
blanchet@44814
  1309
fun ghost_type_args thy s ary =
blanchet@45948
  1310
  if is_tptp_equal s then
blanchet@45948
  1311
    0 upto ary - 1
blanchet@45948
  1312
  else
blanchet@45948
  1313
    let
blanchet@45948
  1314
      val footprint = tvar_footprint thy s ary
blanchet@45948
  1315
      val eq = (s = @{const_name HOL.eq})
blanchet@45948
  1316
      fun ghosts _ [] = []
blanchet@45948
  1317
        | ghosts seen ((i, tvars) :: args) =
blanchet@45948
  1318
          ghosts (union (op =) seen tvars) args
blanchet@45948
  1319
          |> (eq orelse exists (fn tvar => not (member (op =) seen tvar)) tvars)
blanchet@45948
  1320
             ? cons i
blanchet@45948
  1321
    in
blanchet@45948
  1322
      if forall null footprint then
blanchet@45948
  1323
        []
blanchet@45948
  1324
      else
blanchet@45948
  1325
        0 upto length footprint - 1 ~~ footprint
blanchet@45948
  1326
        |> sort (rev_order o list_ord Term_Ord.indexname_ord o pairself snd)
blanchet@45948
  1327
        |> ghosts []
blanchet@45948
  1328
    end
blanchet@44814
  1329
blanchet@44399
  1330
type monotonicity_info =
blanchet@44399
  1331
  {maybe_finite_Ts : typ list,
blanchet@44399
  1332
   surely_finite_Ts : typ list,
blanchet@44399
  1333
   maybe_infinite_Ts : typ list,
blanchet@44399
  1334
   surely_infinite_Ts : typ list,
blanchet@44399
  1335
   maybe_nonmono_Ts : typ list}
blanchet@44399
  1336
blanchet@44397
  1337
(* These types witness that the type classes they belong to allow infinite
blanchet@44397
  1338
   models and hence that any types with these type classes is monotonic. *)
blanchet@44397
  1339
val known_infinite_types =
blanchet@44634
  1340
  [@{typ nat}, HOLogic.intT, HOLogic.realT, @{typ "nat => bool"}]
blanchet@44397
  1341
blanchet@46301
  1342
fun is_type_kind_of_surely_infinite ctxt strictness cached_Ts T =
blanchet@46301
  1343
  strictness <> Strict andalso is_type_surely_infinite ctxt true cached_Ts T
blanchet@42886
  1344
blanchet@42682
  1345
(* Finite types such as "unit", "bool", "bool * bool", and "bool => bool" are
blanchet@42682
  1346
   dangerous because their "exhaust" properties can easily lead to unsound ATP
blanchet@42682
  1347
   proofs. On the other hand, all HOL infinite types can be given the same
blanchet@42682
  1348
   models in first-order logic (via Löwenheim-Skolem). *)
blanchet@42682
  1349
blanchet@44399
  1350
fun should_encode_type _ (_ : monotonicity_info) All_Types _ = true
blanchet@44399
  1351
  | should_encode_type ctxt {maybe_finite_Ts, surely_infinite_Ts,
blanchet@44399
  1352
                             maybe_nonmono_Ts, ...}
blanchet@46301
  1353
                       (Noninf_Nonmono_Types (strictness, grain)) T =
blanchet@44811
  1354
    grain = Ghost_Type_Arg_Vars orelse
blanchet@44811
  1355
    (exists (type_intersect ctxt T) maybe_nonmono_Ts andalso
blanchet@44811
  1356
     not (exists (type_instance ctxt T) surely_infinite_Ts orelse
blanchet@44859
  1357
          (not (member (type_equiv ctxt) maybe_finite_Ts T) andalso
blanchet@46301
  1358
           is_type_kind_of_surely_infinite ctxt strictness surely_infinite_Ts
blanchet@44811
  1359
                                           T)))
blanchet@44399
  1360
  | should_encode_type ctxt {surely_finite_Ts, maybe_infinite_Ts,
blanchet@44399
  1361
                             maybe_nonmono_Ts, ...}
blanchet@44811
  1362
                       (Fin_Nonmono_Types grain) T =
blanchet@44811
  1363
    grain = Ghost_Type_Arg_Vars orelse
blanchet@44811
  1364
    (exists (type_intersect ctxt T) maybe_nonmono_Ts andalso
blanchet@44811
  1365
     (exists (type_generalization ctxt T) surely_finite_Ts orelse
blanchet@44859
  1366
      (not (member (type_equiv ctxt) maybe_infinite_Ts T) andalso
blanchet@44811
  1367
       is_type_surely_finite ctxt T)))
blanchet@42682
  1368
  | should_encode_type _ _ _ _ = false
blanchet@42682
  1369
blanchet@44768
  1370
fun should_guard_type ctxt mono (Guards (_, level)) should_guard_var T =
blanchet@44811
  1371
    should_guard_var () andalso should_encode_type ctxt mono level T
blanchet@44399
  1372
  | should_guard_type _ _ _ _ _ = false
blanchet@42682
  1373
blanchet@44403
  1374
fun is_maybe_universal_var (IConst ((s, _), _, _)) =
blanchet@44403
  1375
    String.isPrefix bound_var_prefix s orelse
blanchet@44403
  1376
    String.isPrefix all_bound_var_prefix s
blanchet@44403
  1377
  | is_maybe_universal_var (IVar _) = true
blanchet@44403
  1378
  | is_maybe_universal_var _ = false
blanchet@42836
  1379
blanchet@45947
  1380
datatype site =
blanchet@43361
  1381
  Top_Level of bool option |
blanchet@43361
  1382
  Eq_Arg of bool option |
blanchet@43361
  1383
  Elsewhere
blanchet@42829
  1384
blanchet@45949
  1385
fun should_tag_with_type _ _ _ (Top_Level _) _ _ = false
blanchet@45949
  1386
  | should_tag_with_type ctxt mono (Tags (_, level)) site u T =
blanchet@45949
  1387
    if granularity_of_type_level level = All_Vars then
blanchet@45949
  1388
      should_encode_type ctxt mono level T
blanchet@45949
  1389
    else
blanchet@45949
  1390
      (case (site, is_maybe_universal_var u) of
blanchet@45949
  1391
         (Eq_Arg _, true) => should_encode_type ctxt mono level T
blanchet@44814
  1392
       | _ => false)
blanchet@45949
  1393
  | should_tag_with_type _ _ _ _ _ _ = false
blanchet@42682
  1394
blanchet@44594
  1395
fun fused_type ctxt mono level =
blanchet@42994
  1396
  let
blanchet@44399
  1397
    val should_encode = should_encode_type ctxt mono level
blanchet@44594
  1398
    fun fuse 0 T = if should_encode T then T else fused_infinite_type
blanchet@44594
  1399
      | fuse ary (Type (@{type_name fun}, [T1, T2])) =
blanchet@44594
  1400
        fuse 0 T1 --> fuse (ary - 1) T2
blanchet@44594
  1401
      | fuse _ _ = raise Fail "expected function type"
blanchet@44594
  1402
  in fuse end
blanchet@42682
  1403
blanchet@44450
  1404
(** predicators and application operators **)
blanchet@41313
  1405
blanchet@42574
  1406
type sym_info =
blanchet@44829
  1407
  {pred_sym : bool, min_ary : int, max_ary : int, types : typ list,
blanchet@44829
  1408
   in_conj : bool}
blanchet@42563
  1409
blanchet@44829
  1410
fun default_sym_tab_entries type_enc =
blanchet@44829
  1411
  (make_fixed_const NONE @{const_name undefined},
blanchet@44829
  1412
       {pred_sym = false, min_ary = 0, max_ary = 0, types = [],
blanchet@44829
  1413
        in_conj = false}) ::
blanchet@44829
  1414
  ([tptp_false, tptp_true]
blanchet@44829
  1415
   |> map (rpair {pred_sym = true, min_ary = 0, max_ary = 0, types = [],
blanchet@44829
  1416
                  in_conj = false})) @
blanchet@44829
  1417
  ([tptp_equal, tptp_old_equal]
blanchet@44829
  1418
   |> map (rpair {pred_sym = true, min_ary = 2, max_ary = 2, types = [],
blanchet@44829
  1419
                  in_conj = false}))
blanchet@44829
  1420
  |> not (is_type_enc_higher_order type_enc)
blanchet@44829
  1421
     ? cons (prefixed_predicator_name,
blanchet@44829
  1422
             {pred_sym = true, min_ary = 1, max_ary = 1, types = [],
blanchet@44829
  1423
              in_conj = false})
blanchet@44829
  1424
blanchet@46392
  1425
datatype app_op_level = Incomplete_Apply | Sufficient_Apply | Full_Apply
blanchet@46389
  1426
blanchet@46392
  1427
fun sym_table_for_facts ctxt type_enc app_op_level conjs facts =
blanchet@42558
  1428
  let
blanchet@46642
  1429
    val thy = Proof_Context.theory_of ctxt
blanchet@44772
  1430
    fun consider_var_ary const_T var_T max_ary =
blanchet@43064
  1431
      let
blanchet@43064
  1432
        fun iter ary T =
blanchet@44399
  1433
          if ary = max_ary orelse type_instance ctxt var_T T orelse
blanchet@44399
  1434
             type_instance ctxt T var_T then
blanchet@43210
  1435
            ary
blanchet@43210
  1436
          else
blanchet@43210
  1437
            iter (ary + 1) (range_type T)
blanchet@43064
  1438
      in iter 0 const_T end
blanchet@44403
  1439
    fun add_universal_var T (accum as ((bool_vars, fun_var_Ts), sym_tab)) =
blanchet@46392
  1440
      if app_op_level = Sufficient_Apply andalso
blanchet@43201
  1441
         (can dest_funT T orelse T = @{typ bool}) then
blanchet@43201
  1442
        let
blanchet@43201
  1443
          val bool_vars' = bool_vars orelse body_type T = @{typ bool}
blanchet@44829
  1444
          fun repair_min_ary {pred_sym, min_ary, max_ary, types, in_conj} =
blanchet@43201
  1445
            {pred_sym = pred_sym andalso not bool_vars',
blanchet@44772
  1446
             min_ary = fold (fn T' => consider_var_ary T' T) types min_ary,
blanchet@44829
  1447
             max_ary = max_ary, types = types, in_conj = in_conj}
blanchet@43201
  1448
          val fun_var_Ts' =
blanchet@43201
  1449
            fun_var_Ts |> can dest_funT T ? insert_type ctxt I T
blanchet@43201
  1450
        in
blanchet@43201
  1451
          if bool_vars' = bool_vars andalso
blanchet@43201
  1452
             pointer_eq (fun_var_Ts', fun_var_Ts) then
blanchet@43201
  1453
            accum
blanchet@43167
  1454
          else
blanchet@44772
  1455
            ((bool_vars', fun_var_Ts'), Symtab.map (K repair_min_ary) sym_tab)
blanchet@43201
  1456
        end
blanchet@43201
  1457
      else
blanchet@43201
  1458
        accum
blanchet@46392
  1459
      fun add_iterm_syms conj_fact top_level tm
blanchet@46392
  1460
                         (accum as ((bool_vars, fun_var_Ts), sym_tab)) =
blanchet@46392
  1461
        let val (head, args) = strip_iterm_comb tm in
blanchet@46392
  1462
          (case head of
blanchet@46392
  1463
             IConst ((s, _), T, _) =>
blanchet@46392
  1464
             if String.isPrefix bound_var_prefix s orelse
blanchet@46392
  1465
                String.isPrefix all_bound_var_prefix s then
blanchet@46392
  1466
               add_universal_var T accum
blanchet@46392
  1467
             else if String.isPrefix exist_bound_var_prefix s then
blanchet@46392
  1468
               accum
blanchet@46392
  1469
             else
blanchet@46392
  1470
               let val ary = length args in
blanchet@46392
  1471
                 ((bool_vars, fun_var_Ts),
blanchet@46392
  1472
                  case Symtab.lookup sym_tab s of
blanchet@46392
  1473
                    SOME {pred_sym, min_ary, max_ary, types, in_conj} =>
blanchet@46392
  1474
                    let
blanchet@46392
  1475
                      val pred_sym =
blanchet@46392
  1476
                        pred_sym andalso top_level andalso not bool_vars
blanchet@46392
  1477
                      val types' = types |> insert_type ctxt I T
blanchet@46392
  1478
                      val in_conj = in_conj orelse conj_fact
blanchet@46392
  1479
                      val min_ary =
blanchet@46392
  1480
                        if app_op_level = Sufficient_Apply andalso
blanchet@46392
  1481
                           not (pointer_eq (types', types)) then
blanchet@46392
  1482
                          fold (consider_var_ary T) fun_var_Ts min_ary
blanchet@46392
  1483
                        else
blanchet@46392
  1484
                          min_ary
blanchet@46392
  1485
                    in
blanchet@46392
  1486
                      Symtab.update (s, {pred_sym = pred_sym,
blanchet@46392
  1487
                                         min_ary = Int.min (ary, min_ary),
blanchet@46392
  1488
                                         max_ary = Int.max (ary, max_ary),
blanchet@46392
  1489
                                         types = types', in_conj = in_conj})
blanchet@46392
  1490
                                    sym_tab
blanchet@46392
  1491
                    end
blanchet@46392
  1492
                  | NONE =>
blanchet@46392
  1493
                    let
blanchet@46392
  1494
                      val pred_sym = top_level andalso not bool_vars
blanchet@46639
  1495
                      val ary =
blanchet@46639
  1496
                        case unprefix_and_unascii const_prefix s of
blanchet@46639
  1497
                          SOME s =>
blanchet@46642
  1498
                          (if String.isSubstring uncurried_alias_sep s then
blanchet@46642
  1499
                             ary
blanchet@46642
  1500
                           else case try (robust_const_ary thy
blanchet@46642
  1501
                                          o invert_const o hd
blanchet@46642
  1502
                                          o unmangled_const_name) s of
blanchet@46642
  1503
                             SOME ary0 => Int.min (ary0, ary)
blanchet@46642
  1504
                           | NONE => ary)
blanchet@46639
  1505
                        | NONE => ary
blanchet@46392
  1506
                      val min_ary =
blanchet@46392
  1507
                        case app_op_level of
blanchet@46392
  1508
                          Incomplete_Apply => ary
blanchet@46392
  1509
                        | Sufficient_Apply =>
blanchet@46392
  1510
                          fold (consider_var_ary T) fun_var_Ts ary
blanchet@46392
  1511
                        | Full_Apply => 0
blanchet@46392
  1512
                    in
blanchet@46392
  1513
                      Symtab.update_new (s,
blanchet@46392
  1514
                          {pred_sym = pred_sym, min_ary = min_ary,
blanchet@46392
  1515
                           max_ary = ary, types = [T], in_conj = conj_fact})
blanchet@46392
  1516
                          sym_tab
blanchet@46392
  1517
                    end)
blanchet@46392
  1518
               end
blanchet@46392
  1519
           | IVar (_, T) => add_universal_var T accum
blanchet@46392
  1520
           | IAbs ((_, T), tm) =>
blanchet@46392
  1521
             accum |> add_universal_var T |> add_iterm_syms conj_fact false tm
blanchet@46392
  1522
           | _ => accum)
blanchet@46392
  1523
          |> fold (add_iterm_syms conj_fact false) args
blanchet@46392
  1524
        end
blanchet@44829
  1525
    fun add_fact_syms conj_fact =
blanchet@46392
  1526
      K (add_iterm_syms conj_fact true) |> formula_fold NONE |> fact_lift
blanchet@44829
  1527
  in
blanchet@44829
  1528
    ((false, []), Symtab.empty)
blanchet@44829
  1529
    |> fold (add_fact_syms true) conjs
blanchet@44829
  1530
    |> fold (add_fact_syms false) facts
blanchet@44829
  1531
    |> snd
blanchet@44829
  1532
    |> fold Symtab.update (default_sym_tab_entries type_enc)
blanchet@44829
  1533
  end
blanchet@38282
  1534
blanchet@44772
  1535
fun min_ary_of sym_tab s =
blanchet@42558
  1536
  case Symtab.lookup sym_tab s of
blanchet@42574
  1537
    SOME ({min_ary, ...} : sym_info) => min_ary
blanchet@42558
  1538
  | NONE =>
blanchet@45511
  1539
    case unprefix_and_unascii const_prefix s of
blanchet@42547
  1540
      SOME s =>
blanchet@46392
  1541
      let val s = s |> unmangled_const_name |> hd |> invert_const in
blanchet@42966
  1542
        if s = predicator_name then 1
blanchet@42966
  1543
        else if s = app_op_name then 2
blanchet@44396
  1544
        else if s = type_guard_name then 1
blanchet@42557
  1545
        else 0
blanchet@42547
  1546
      end
blanchet@42544
  1547
    | NONE => 0
blanchet@38282
  1548
blanchet@38282
  1549
(* True if the constant ever appears outside of the top-level position in
blanchet@38282
  1550
   literals, or if it appears with different arities (e.g., because of different
blanchet@38282
  1551
   type instantiations). If false, the constant always receives all of its
blanchet@38282
  1552
   arguments and is used as a predicate. *)
blanchet@42558
  1553
fun is_pred_sym sym_tab s =
blanchet@42558
  1554
  case Symtab.lookup sym_tab s of
blanchet@42574
  1555
    SOME ({pred_sym, min_ary, max_ary, ...} : sym_info) =>
blanchet@42574
  1556
    pred_sym andalso min_ary = max_ary
blanchet@42558
  1557
  | NONE => false
blanchet@38282
  1558
blanchet@44773
  1559
val app_op = `(make_fixed_const NONE) app_op_name
blanchet@42568
  1560
val predicator_combconst =
nik@44495
  1561
  IConst (`(make_fixed_const NONE) predicator_name, @{typ "bool => bool"}, [])
blanchet@42542
  1562
blanchet@43859
  1563
fun list_app head args = fold (curry (IApp o swap)) args head
blanchet@44773
  1564
fun predicator tm = IApp (predicator_combconst, tm)
blanchet@42544
  1565
blanchet@46410
  1566
fun mk_app_op format type_enc head arg =
blanchet@42544
  1567
  let
blanchet@46392
  1568
    val head_T = ityp_of head
blanchet@46392
  1569
    val (arg_T, res_T) = dest_funT head_T
blanchet@46392
  1570
    val app =
blanchet@46392
  1571
      IConst (app_op, head_T --> head_T, [arg_T, res_T])
blanchet@46392
  1572
      |> mangle_type_args_in_iterm format type_enc
blanchet@46392
  1573
  in list_app app [head, arg] end
blanchet@46392
  1574
blanchet@46400
  1575
fun firstorderize_fact thy monom_constrs format type_enc sym_tab
blanchet@46409
  1576
                       uncurried_aliases =
blanchet@46392
  1577
  let
blanchet@46410
  1578
    fun do_app arg head = mk_app_op format type_enc head arg
blanchet@44773
  1579
    fun list_app_ops head args = fold do_app args head
blanchet@44773
  1580
    fun introduce_app_ops tm =
blanchet@46392
  1581
      let val (head, args) = tm |> strip_iterm_comb ||> map introduce_app_ops in
blanchet@46392
  1582
        case head of
blanchet@46392
  1583
          IConst (name as (s, _), T, T_args) =>
blanchet@46409
  1584
          if uncurried_aliases andalso String.isPrefix const_prefix s then
blanchet@46392
  1585
            let
blanchet@46392
  1586
              val ary = length args
blanchet@46639
  1587
              val name =
blanchet@46639
  1588
                name |> ary > min_ary_of sym_tab s ? aliased_uncurried ary
blanchet@46392
  1589
            in list_app (IConst (name, T, T_args)) args end
blanchet@46392
  1590
          else
blanchet@46392
  1591
            args |> chop (min_ary_of sym_tab s)
blanchet@46392
  1592
                 |>> list_app head |-> list_app_ops
blanchet@46392
  1593
        | _ => list_app_ops head args
blanchet@46392
  1594
      end
blanchet@44773
  1595
    fun introduce_predicators tm =
blanchet@44773
  1596
      case strip_iterm_comb tm of
blanchet@44773
  1597
        (IConst ((s, _), _, _), _) =>
blanchet@44773
  1598
        if is_pred_sym sym_tab s then tm else predicator tm
blanchet@44773
  1599
      | _ => predicator tm
blanchet@44773
  1600
    val do_iterm =
blanchet@44773
  1601
      not (is_type_enc_higher_order type_enc)
blanchet@44773
  1602
      ? (introduce_app_ops #> introduce_predicators)
blanchet@45945
  1603
      #> filter_type_args_in_iterm thy monom_constrs type_enc
blanchet@44773
  1604
  in update_iformula (formula_map do_iterm) end
blanchet@42573
  1605
blanchet@42573
  1606
(** Helper facts **)
blanchet@42573
  1607
blanchet@44450
  1608
val not_ffalse = @{lemma "~ fFalse" by (unfold fFalse_def) fast}
blanchet@44450
  1609
val ftrue = @{lemma "fTrue" by (unfold fTrue_def) fast}
blanchet@44450
  1610
blanchet@43194
  1611
(* The Boolean indicates that a fairly sound type encoding is needed. *)
blanchet@43085
  1612
val helper_table =
blanchet@43194
  1613
  [(("COMBI", false), @{thms Meson.COMBI_def}),
blanchet@43194
  1614
   (("COMBK", false), @{thms Meson.COMBK_def}),
blanchet@43194
  1615
   (("COMBB", false), @{thms Meson.COMBB_def}),
blanchet@43194
  1616
   (("COMBC", false), @{thms Meson.COMBC_def}),
blanchet@43194
  1617
   (("COMBS", false), @{thms Meson.COMBS_def}),
blanchet@44450
  1618
   ((predicator_name, false), [not_ffalse, ftrue]),
blanchet@44450
  1619
   (("fFalse", false), [not_ffalse]),
blanchet@43194
  1620
   (("fFalse", true), @{thms True_or_False}),
blanchet@44450
  1621
   (("fTrue", false), [ftrue]),
blanchet@43194
  1622
   (("fTrue", true), @{thms True_or_False}),
blanchet@43194
  1623
   (("fNot", false),
blanchet@43194
  1624
    @{thms fNot_def [THEN Meson.iff_to_disjD, THEN conjunct1]
blanchet@43194
  1625
           fNot_def [THEN Meson.iff_to_disjD, THEN conjunct2]}),
blanchet@43194
  1626
   (("fconj", false),
blanchet@43194
  1627
    @{lemma "~ P | ~ Q | fconj P Q" "~ fconj P Q | P" "~ fconj P Q | Q"
blanchet@43194
  1628
        by (unfold fconj_def) fast+}),
blanchet@43194
  1629
   (("fdisj", false),
blanchet@43194
  1630
    @{lemma "~ P | fdisj P Q" "~ Q | fdisj P Q" "~ fdisj P Q | P | Q"
blanchet@43194
  1631
        by (unfold fdisj_def) fast+}),
blanchet@43194
  1632
   (("fimplies", false),
blanchet@43210
  1633
    @{lemma "P | fimplies P Q" "~ Q | fimplies P Q" "~ fimplies P Q | ~ P | Q"
blanchet@43194
  1634
        by (unfold fimplies_def) fast+}),
nik@43678
  1635
   (("fequal", true),
nik@43678
  1636
    (* This is a lie: Higher-order equality doesn't need a sound type encoding.
nik@43678
  1637
       However, this is done so for backward compatibility: Including the
nik@43678
  1638
       equality helpers by default in Metis breaks a few existing proofs. *)
nik@43678
  1639
    @{thms fequal_def [THEN Meson.iff_to_disjD, THEN conjunct1]
nik@43678
  1640
           fequal_def [THEN Meson.iff_to_disjD, THEN conjunct2]}),
blanchet@44003
  1641
   (* Partial characterization of "fAll" and "fEx". A complete characterization
blanchet@44003
  1642
      would require the axiom of choice for replay with Metis. *)
blanchet@44003
  1643
   (("fAll", false), [@{lemma "~ fAll P | P x" by (auto simp: fAll_def)}]),
blanchet@44003
  1644
   (("fEx", false), [@{lemma "~ P x | fEx P" by (auto simp: fEx_def)}]),
blanchet@43194
  1645
   (("If", true), @{thms if_True if_False True_or_False})]
blanchet@43194
  1646
  |> map (apsnd (map zero_var_indexes))
blanchet@43085
  1647
blanchet@45364
  1648
fun atype_of_type_vars (Simple_Types (_, Polymorphic, _)) = SOME atype_of_types
blanchet@45364
  1649
  | atype_of_type_vars _ = NONE
blanchet@45364
  1650
blanchet@45920
  1651
fun bound_tvars type_enc sorts Ts =
blanchet@45920
  1652
  (sorts ? mk_ahorn (formulas_for_types type_enc add_sorts_on_tvar Ts))
blanchet@45316
  1653
  #> mk_aquant AForall
blanchet@45316
  1654
        (map_filter (fn TVar (x as (s, _), _) =>
blanchet@45316
  1655
                        SOME ((make_schematic_type_var x, s),
blanchet@45364
  1656
                              atype_of_type_vars type_enc)
blanchet@45316
  1657
                      | _ => NONE) Ts)
blanchet@44404
  1658
blanchet@46392
  1659
fun eq_formula type_enc atomic_Ts bounds pred_sym tm1 tm2 =
blanchet@44404
  1660
  (if pred_sym then AConn (AIff, [AAtom tm1, AAtom tm2])
blanchet@44404
  1661
   else AAtom (ATerm (`I tptp_equal, [tm1, tm2])))
blanchet@46392
  1662
  |> mk_aquant AForall bounds
blanchet@45377
  1663
  |> close_formula_universally
blanchet@45920
  1664
  |> bound_tvars type_enc true atomic_Ts
blanchet@44404
  1665
blanchet@46406
  1666
val helper_rank = default_rank
blanchet@46406
  1667
val min_rank = 9 * helper_rank div 10
blanchet@46406
  1668
val max_rank = 4 * min_rank
blanchet@46406
  1669
blanchet@46406
  1670
fun rank_of_fact_num n j = min_rank + (max_rank - min_rank) * j div n
blanchet@46406
  1671
nik@44495
  1672
val type_tag = `(make_fixed_const NONE) type_tag_name
blanchet@43130
  1673
blanchet@45301
  1674
fun type_tag_idempotence_fact format type_enc =
blanchet@42573
  1675
  let
blanchet@42573
  1676
    fun var s = ATerm (`I s, [])
blanchet@44408
  1677
    fun tag tm = ATerm (type_tag, [var "A", tm])
blanchet@44408
  1678
    val tagged_var = tag (var "X")
blanchet@42573
  1679
  in
blanchet@43159
  1680
    Formula (type_tag_idempotence_helper_name, Axiom,
blanchet@46392
  1681
             eq_formula type_enc [] [] false (tag tagged_var) tagged_var,
blanchet@46406
  1682
             NONE, isabelle_info format spec_eqN helper_rank)
blanchet@42573
  1683
  end
blanchet@42573
  1684
blanchet@43626
  1685
fun should_specialize_helper type_enc t =
blanchet@44493
  1686
  polymorphism_of_type_enc type_enc <> Polymorphic andalso
blanchet@43628
  1687
  level_of_type_enc type_enc <> No_Types andalso
blanchet@43628
  1688
  not (null (Term.hidden_polymorphism t))
blanchet@43159
  1689
blanchet@43858
  1690
fun helper_facts_for_sym ctxt format type_enc (s, {types, ...} : sym_info) =
blanchet@45511
  1691
  case unprefix_and_unascii const_prefix s of
blanchet@42573
  1692
    SOME mangled_s =>
blanchet@42573
  1693
    let
blanchet@42573
  1694
      val thy = Proof_Context.theory_of ctxt
blanchet@46392
  1695
      val unmangled_s = mangled_s |> unmangled_const_name |> hd
blanchet@43628
  1696
      fun dub needs_fairly_sound j k =
blanchet@46339
  1697
        unmangled_s ^ "_" ^ string_of_int j ^ "_" ^ string_of_int k ^
blanchet@46339
  1698
        (if mangled_s = unmangled_s then "" else "_" ^ ascii_of mangled_s) ^
blanchet@46339
  1699
        (if needs_fairly_sound then typed_helper_suffix
blanchet@46339
  1700
         else untyped_helper_suffix)
blanchet@43159
  1701
      fun dub_and_inst needs_fairly_sound (th, j) =
blanchet@43628
  1702
        let val t = prop_of th in
blanchet@43628
  1703
          if should_specialize_helper type_enc t then
blanchet@43628
  1704
            map (fn T => specialize_type thy (invert_const unmangled_s, T) t)
blanchet@43628
  1705
                types
blanchet@43628
  1706
          else
blanchet@43628
  1707
            [t]
blanchet@43628
  1708
        end
blanchet@46339
  1709
        |> tag_list 1
blanchet@46393
  1710
        |> map (fn (k, t) =>
blanchet@46393
  1711
                   ((dub needs_fairly_sound j k, (Global, Spec_Eq)), t))
blanchet@43860
  1712
      val make_facts = map_filter (make_fact ctxt format type_enc false)
blanchet@43626
  1713
      val fairly_sound = is_type_enc_fairly_sound type_enc
blanchet@42573
  1714
    in
blanchet@43085
  1715
      helper_table
blanchet@43194
  1716
      |> maps (fn ((helper_s, needs_fairly_sound), ths) =>
blanchet@43159
  1717
                  if helper_s <> unmangled_s orelse
blanchet@42894
  1718
                     (needs_fairly_sound andalso not fairly_sound) then
blanchet@42573
  1719
                    []
blanchet@42573
  1720
                  else
blanchet@42573
  1721
                    ths ~~ (1 upto length ths)
blanchet@43628
  1722
                    |> maps (dub_and_inst needs_fairly_sound)
blanchet@43159
  1723
                    |> make_facts)
blanchet@42573
  1724
    end
blanchet@42573
  1725
  | NONE => []
blanchet@43858
  1726
fun helper_facts_for_sym_table ctxt format type_enc sym_tab =
blanchet@43858
  1727
  Symtab.fold_rev (append o helper_facts_for_sym ctxt format type_enc) sym_tab
blanchet@43858
  1728
                  []
blanchet@42573
  1729
blanchet@43085
  1730
(***************************************************************)
blanchet@43085
  1731
(* Type Classes Present in the Axiom or Conjecture Clauses     *)
blanchet@43085
  1732
(***************************************************************)
blanchet@43085
  1733
blanchet@43085
  1734
fun set_insert (x, s) = Symtab.update (x, ()) s
blanchet@43085
  1735
blanchet@43085
  1736
fun add_classes (sorts, cset) = List.foldl set_insert cset (flat sorts)
blanchet@43085
  1737
blanchet@43085
  1738
(* Remove this trivial type class (FIXME: similar code elsewhere) *)
blanchet@43085
  1739
fun delete_type cset = Symtab.delete_safe (the_single @{sort HOL.type}) cset
blanchet@43085
  1740
blanchet@43093
  1741
fun classes_of_terms get_Ts =
blanchet@43121
  1742
  map (map snd o get_Ts)
blanchet@43093
  1743
  #> List.foldl add_classes Symtab.empty
blanchet@43093
  1744
  #> delete_type #> Symtab.keys
blanchet@43085
  1745
wenzelm@44121
  1746
val tfree_classes_of_terms = classes_of_terms Misc_Legacy.term_tfrees
wenzelm@44121
  1747
val tvar_classes_of_terms = classes_of_terms Misc_Legacy.term_tvars
blanchet@43085
  1748
blanchet@43622
  1749
fun fold_type_constrs f (Type (s, Ts)) x =
blanchet@43622
  1750
    fold (fold_type_constrs f) Ts (f (s, x))
blanchet@43189
  1751
  | fold_type_constrs _ _ x = x
blanchet@43085
  1752
blanchet@43907
  1753
(* Type constructors used to instantiate overloaded constants are the only ones
blanchet@43907
  1754
   needed. *)
blanchet@43189
  1755
fun add_type_constrs_in_term thy =
blanchet@43085
  1756
  let
blanchet@43188
  1757
    fun add (Const (@{const_name Meson.skolem}, _) $ _) = I
blanchet@43181
  1758
      | add (t $ u) = add t #> add u
blanchet@44738
  1759
      | add (Const x) =
blanchet@44738
  1760
        x |> robust_const_typargs thy |> fold (fold_type_constrs set_insert)
blanchet@43181
  1761
      | add (Abs (_, _, u)) = add u
blanchet@43181
  1762
      | add _ = I
blanchet@43181
  1763
  in add end
blanchet@43085
  1764
blanchet@43189
  1765
fun type_constrs_of_terms thy ts =
blanchet@43189
  1766
  Symtab.keys (fold (add_type_constrs_in_term thy) ts Symtab.empty)
blanchet@43085
  1767
blanchet@45511
  1768
fun extract_lambda_def (Const (@{const_name HOL.eq}, _) $ t $ u) =
blanchet@45511
  1769
    let val (head, args) = strip_comb t in
blanchet@45511
  1770
      (head |> dest_Const |> fst,
blanchet@45511
  1771
       fold_rev (fn t as Var ((s, _), T) =>
blanchet@45511
  1772
                    (fn u => Abs (s, T, abstract_over (t, u)))
blanchet@45511
  1773
                  | _ => raise Fail "expected Var") args u)
blanchet@45511
  1774
    end
blanchet@45511
  1775
  | extract_lambda_def _ = raise Fail "malformed lifted lambda"
blanchet@45508
  1776
blanchet@45514
  1777
fun trans_lams_from_string ctxt type_enc lam_trans =
blanchet@45514
  1778
  if lam_trans = no_lamsN then
blanchet@45514
  1779
    rpair []
blanchet@45514
  1780
  else if lam_trans = hide_lamsN then
blanchet@45514
  1781
    lift_lams ctxt type_enc ##> K []
blanchet@46365
  1782
  else if lam_trans = liftingN orelse lam_trans = lam_liftingN then
blanchet@45514
  1783
    lift_lams ctxt type_enc
blanchet@46365
  1784
  else if lam_trans = combsN then
blanchet@45514
  1785
    map (introduce_combinators ctxt) #> rpair []
blanchet@46365
  1786
  else if lam_trans = combs_and_liftingN then
blanchet@46365
  1787
    lift_lams_part_1 ctxt type_enc
blanchet@46365
  1788
    ##> maps (fn t => [t, introduce_combinators ctxt (intentionalize_def t)])
blanchet@46818
  1789
    #> lift_lams_part_2 ctxt
blanchet@46368
  1790
  else if lam_trans = combs_or_liftingN then
blanchet@45554
  1791
    lift_lams_part_1 ctxt type_enc
blanchet@46368
  1792
    ##> map (fn t => case head_of (strip_qnt_body @{const_name All} t) of
blanchet@46368
  1793
                       @{term "op =::bool => bool => bool"} => t
blanchet@46368
  1794
                     | _ => introduce_combinators ctxt (intentionalize_def t))
blanchet@46818
  1795
    #> lift_lams_part_2 ctxt
blanchet@45514
  1796
  else if lam_trans = keep_lamsN then
blanchet@45514
  1797
    map (Envir.eta_contract) #> rpair []
blanchet@45514
  1798
  else
blanchet@45519
  1799
    error ("Unknown lambda translation scheme: " ^ quote lam_trans ^ ".")
blanchet@45514
  1800
blanchet@45514
  1801
fun translate_formulas ctxt format prem_kind type_enc lam_trans presimp hyp_ts
blanchet@45514
  1802
                       concl_t facts =
blanchet@42573
  1803
  let
blanchet@42573
  1804
    val thy = Proof_Context.theory_of ctxt
blanchet@45514
  1805
    val trans_lams = trans_lams_from_string ctxt type_enc lam_trans
blanchet@43861
  1806
    val fact_ts = facts |> map snd
blanchet@42573
  1807
    (* Remove existing facts from the conjecture, as this can dramatically
blanchet@42573
  1808
       boost an ATP's performance (for some reason). *)
blanchet@43192
  1809
    val hyp_ts =
blanchet@43192
  1810
      hyp_ts
blanchet@43192
  1811
      |> map (fn t => if member (op aconv) fact_ts t then @{prop True} else t)
blanchet@43864
  1812
    val facts = facts |> map (apsnd (pair Axiom))
blanchet@43864
  1813
    val conjs =
blanchet@46385
  1814
      map (pair prem_kind) hyp_ts @ [(Conjecture, s_not_trueprop concl_t)]
blanchet@45168
  1815
      |> map (apsnd freeze_term)
blanchet@46340
  1816
      |> map2 (pair o rpair (Local, General) o string_of_int)
blanchet@46340
  1817
              (0 upto length hyp_ts)
blanchet@45554
  1818
    val ((conjs, facts), lam_facts) =
blanchet@45511
  1819
      (conjs, facts)
blanchet@46093
  1820
      |> presimp ? pairself (map (apsnd (uncurry (presimp_prop ctxt))))
blanchet@45514
  1821
      |> (if lam_trans = no_lamsN then
blanchet@45511
  1822
            rpair []
blanchet@45511
  1823
          else
blanchet@45511
  1824
            op @
blanchet@45514
  1825
            #> preprocess_abstractions_in_terms trans_lams
blanchet@45511
  1826
            #>> chop (length conjs))
blanchet@44773
  1827
    val conjs = conjs |> make_conjecture ctxt format type_enc
blanchet@43863
  1828
    val (fact_names, facts) =
blanchet@43864
  1829
      facts
blanchet@43863
  1830
      |> map_filter (fn (name, (_, t)) =>
blanchet@43863
  1831
                        make_fact ctxt format type_enc true (name, t)
blanchet@43863
  1832
                        |> Option.map (pair name))
blanchet@43861
  1833
      |> ListPair.unzip
blanchet@46375
  1834
    val lifted = lam_facts |> map (extract_lambda_def o snd o snd)
blanchet@45554
  1835
    val lam_facts =
blanchet@45554
  1836
      lam_facts |> map_filter (make_fact ctxt format type_enc true o apsnd snd)
blanchet@43861
  1837
    val all_ts = concl_t :: hyp_ts @ fact_ts
blanchet@42573
  1838
    val subs = tfree_classes_of_terms all_ts
blanchet@42573
  1839
    val supers = tvar_classes_of_terms all_ts
blanchet@43189
  1840
    val tycons = type_constrs_of_terms thy all_ts
blanchet@43861
  1841
    val (supers, arity_clauses) =
blanchet@43626
  1842
      if level_of_type_enc type_enc = No_Types then ([], [])
blanchet@42573
  1843
      else make_arity_clauses thy tycons supers
blanchet@43861
  1844
    val class_rel_clauses = make_class_rel_clauses thy subs supers
blanchet@42573
  1845
  in
blanchet@45508
  1846
    (fact_names |> map single, union (op =) subs supers, conjs,
blanchet@45554
  1847
     facts @ lam_facts, class_rel_clauses, arity_clauses, lifted)
blanchet@42573
  1848
  end
blanchet@42573
  1849
nik@44495
  1850
val type_guard = `(make_fixed_const NONE) type_guard_name
blanchet@43130
  1851
blanchet@44774
  1852
fun type_guard_iterm format type_enc T tm =
blanchet@44396
  1853
  IApp (IConst (type_guard, T --> @{typ bool}, [T])
blanchet@44774
  1854
        |> mangle_type_args_in_iterm format type_enc, tm)
blanchet@42573
  1855
blanchet@43421
  1856
fun is_var_positively_naked_in_term _ (SOME false) _ accum = accum
blanchet@43421
  1857
  | is_var_positively_naked_in_term name _ (ATerm ((s, _), tms)) accum =
blanchet@43000
  1858
    accum orelse (is_tptp_equal s andalso member (op =) tms (ATerm (name, [])))
blanchet@43692
  1859
  | is_var_positively_naked_in_term _ _ _ _ = true
blanchet@44403
  1860
blanchet@45948
  1861
fun is_var_ghost_type_arg_in_term thy polym_constrs name pos tm accum =
blanchet@44811
  1862
  is_var_positively_naked_in_term name pos tm accum orelse
blanchet@44811
  1863
  let
blanchet@44811
  1864
    val var = ATerm (name, [])
blanchet@44811
  1865
    fun is_nasty_in_term (ATerm (_, [])) = false
blanchet@44811
  1866
      | is_nasty_in_term (ATerm ((s, _), tms)) =
blanchet@45948
  1867
        let
blanchet@45948
  1868
          val ary = length tms
blanchet@45948
  1869
          val polym_constr = member (op =) polym_constrs s
blanchet@45948
  1870
          val ghosts = ghost_type_args thy s ary
blanchet@45948
  1871
        in
blanchet@45948
  1872
          exists (fn (j, tm) =>
blanchet@45948
  1873
                     if polym_constr then
blanchet@45948
  1874
                       member (op =) ghosts j andalso
blanchet@45948
  1875
                       (tm = var orelse is_nasty_in_term tm)
blanchet@45948
  1876
                     else
blanchet@45948
  1877
                       tm = var andalso member (op =) ghosts j)
blanchet@45948
  1878
                 (0 upto ary - 1 ~~ tms)
blanchet@45948
  1879
          orelse (not polym_constr andalso exists is_nasty_in_term tms)
blanchet@45948
  1880
        end
blanchet@44811
  1881
      | is_nasty_in_term _ = true
blanchet@44811
  1882
  in is_nasty_in_term tm end
blanchet@44811
  1883
blanchet@45948
  1884
fun should_guard_var_in_formula thy polym_constrs level pos phi (SOME true)
blanchet@45948
  1885
                                name =
blanchet@44811
  1886
    (case granularity_of_type_level level of
blanchet@44811
  1887
       All_Vars => true
blanchet@44811
  1888
     | Positively_Naked_Vars =>
blanchet@44811
  1889
       formula_fold pos (is_var_positively_naked_in_term name) phi false
blanchet@44811
  1890
     | Ghost_Type_Arg_Vars =>
blanchet@46818
  1891
       formula_fold pos (is_var_ghost_type_arg_in_term thy polym_constrs name) phi
blanchet@46818
  1892
                    false)
blanchet@45948
  1893
  | should_guard_var_in_formula _ _ _ _ _ _ _ = true
blanchet@45948
  1894
blanchet@45948
  1895
fun always_guard_var_in_formula _ _ _ _ _ _ _ = true
blanchet@42834
  1896
blanchet@44405
  1897
fun should_generate_tag_bound_decl _ _ _ (SOME true) _ = false
blanchet@44768
  1898
  | should_generate_tag_bound_decl ctxt mono (Tags (_, level)) _ T =
blanchet@44811
  1899
    granularity_of_type_level level <> All_Vars andalso
blanchet@44782
  1900
    should_encode_type ctxt mono level T
blanchet@44405
  1901
  | should_generate_tag_bound_decl _ _ _ _ _ = false
blanchet@44404
  1902
nik@43677
  1903
fun mk_aterm format type_enc name T_args args =
nik@43677
  1904
  ATerm (name, map_filter (ho_term_for_type_arg format type_enc) T_args @ args)
blanchet@42994
  1905
blanchet@46392
  1906
fun do_bound_type ctxt format mono type_enc =
blanchet@46392
  1907
  case type_enc of
blanchet@46392
  1908
    Simple_Types (_, _, level) =>
blanchet@46392
  1909
    fused_type ctxt mono level 0
blanchet@46392
  1910
    #> ho_type_from_typ format type_enc false 0 #> SOME
blanchet@46392
  1911
  | _ => K NONE
blanchet@46392
  1912
blanchet@45949
  1913
fun tag_with_type ctxt format mono type_enc pos T tm =
blanchet@43859
  1914
  IConst (type_tag, T --> T, [T])
blanchet@44774
  1915
  |> mangle_type_args_in_iterm format type_enc
blanchet@45949
  1916
  |> ho_term_from_iterm ctxt format mono type_enc pos
blanchet@43692
  1917
  |> (fn ATerm (s, tms) => ATerm (s, tms @ [tm])
blanchet@43692
  1918
       | _ => raise Fail "unexpected lambda-abstraction")
blanchet@45949
  1919
and ho_term_from_iterm ctxt format mono type_enc =
blanchet@42573
  1920
  let
blanchet@45949
  1921
    fun term site u =
blanchet@42962
  1922
      let
blanchet@43859
  1923
        val (head, args) = strip_iterm_comb u
nik@43677
  1924
        val pos =
blanchet@45949
  1925
          case site of
nik@43677
  1926
            Top_Level pos => pos
nik@43677
  1927
          | Eq_Arg pos => pos
blanchet@44814
  1928
          | _ => NONE
nik@43677
  1929
        val t =
nik@43677
  1930
          case head of
blanchet@43859
  1931
            IConst (name as (s, _), _, T_args) =>
blanchet@46818
  1932
            let val arg_site = if is_tptp_equal s then Eq_Arg pos else Elsewhere in
blanchet@45949
  1933
              map (term arg_site) args |> mk_aterm format type_enc name T_args
nik@43677
  1934
            end
blanchet@43859
  1935
          | IVar (name, _) =>
blanchet@45949
  1936
            map (term Elsewhere) args |> mk_aterm format type_enc name []
blanchet@43859
  1937
          | IAbs ((name, T), tm) =>
blanchet@46818
  1938
            if is_type_enc_higher_order type_enc then
blanchet@46818
  1939
              AAbs ((name, ho_type_from_typ format type_enc true 0 T),
blanchet@46818
  1940
                    term Elsewhere tm)
blanchet@46818
  1941
            else
blanchet@46818
  1942
              ATerm (("LAMBDA", "LAMBDA"), []) (*###*)
blanchet@46818
  1943
(*###
blanchet@46818
  1944
              raise Fail "unexpected lambda-abstraction"
blanchet@46818
  1945
*)
blanchet@43859
  1946
          | IApp _ => raise Fail "impossible \"IApp\""
blanchet@43859
  1947
        val T = ityp_of u
blanchet@42962
  1948
      in
blanchet@45949
  1949
        if should_tag_with_type ctxt mono type_enc site u T then
blanchet@45949
  1950
          tag_with_type ctxt format mono type_enc pos T t
blanchet@45947
  1951
        else
blanchet@45947
  1952
          t
blanchet@42962
  1953
      end
blanchet@45949
  1954
  in term o Top_Level end
blanchet@45947
  1955
and formula_from_iformula ctxt polym_constrs format mono type_enc
blanchet@45947
  1956
                          should_guard_var =
blanchet@42829
  1957
  let
blanchet@44811
  1958
    val thy = Proof_Context.theory_of ctxt
blanchet@44811
  1959
    val level = level_of_type_enc type_enc
blanchet@45949
  1960
    val do_term = ho_term_from_iterm ctxt format mono type_enc
blanchet@42878
  1961
    fun do_out_of_bound_type pos phi universal (name, T) =
blanchet@44399
  1962
      if should_guard_type ctxt mono type_enc
blanchet@45948
  1963
             (fn () => should_guard_var thy polym_constrs level pos phi
blanchet@45948
  1964
                                        universal name) T then
blanchet@43859
  1965
        IVar (name, T)
blanchet@44774
  1966
        |> type_guard_iterm format type_enc T
blanchet@43361
  1967
        |> do_term pos |> AAtom |> SOME
blanchet@44405
  1968
      else if should_generate_tag_bound_decl ctxt mono type_enc universal T then
blanchet@44405
  1969
        let
blanchet@44405
  1970
          val var = ATerm (name, [])
blanchet@45949
  1971
          val tagged_var = tag_with_type ctxt format mono type_enc pos T var
blanchet@44405
  1972
        in SOME (AAtom (ATerm (`I tptp_equal, [tagged_var, var]))) end
blanchet@42573
  1973
      else
blanchet@42573
  1974
        NONE
blanchet@42878
  1975
    fun do_formula pos (AQuant (q, xs, phi)) =
blanchet@42878
  1976
        let
blanchet@42878
  1977
          val phi = phi |> do_formula pos
blanchet@42878
  1978
          val universal = Option.map (q = AExists ? not) pos
blanchet@46392
  1979
          val do_bound_type = do_bound_type ctxt format mono type_enc
blanchet@42878
  1980
        in
blanchet@42834
  1981
          AQuant (q, xs |> map (apsnd (fn NONE => NONE
blanchet@42834
  1982
                                        | SOME T => do_bound_type T)),
blanchet@42834
  1983
                  (if q = AForall then mk_ahorn else fold_rev (mk_aconn AAnd))
blanchet@42834
  1984
                      (map_filter
blanchet@42834
  1985
                           (fn (_, NONE) => NONE
blanchet@42834
  1986
                             | (s, SOME T) =>
blanchet@42878
  1987
                               do_out_of_bound_type pos phi universal (s, T))
blanchet@42878
  1988
                           xs)
blanchet@42834
  1989
                      phi)
blanchet@42834
  1990
        end
blanchet@42878
  1991
      | do_formula pos (AConn conn) = aconn_map pos do_formula conn
blanchet@43361
  1992
      | do_formula pos (AAtom tm) = AAtom (do_term pos tm)
blanchet@43493
  1993
  in do_formula end
blanchet@42573
  1994
blanchet@42573
  1995
(* Each fact is given a unique fact number to avoid name clashes (e.g., because
blanchet@42573
  1996
   of monomorphization). The TPTP explicitly forbids name clashes, and some of
blanchet@42573
  1997
   the remote provers might care. *)
blanchet@45947
  1998
fun formula_line_for_fact ctxt polym_constrs format prefix encode freshen pos
blanchet@46406
  1999
        mono type_enc rank (j, {name, stature, kind, iformula, atomic_types}) =
blanchet@43864
  2000
  (prefix ^ (if freshen then string_of_int j ^ "_" else "") ^ encode name, kind,
blanchet@43859
  2001
   iformula
blanchet@45947
  2002
   |> formula_from_iformula ctxt polym_constrs format mono type_enc
blanchet@45947
  2003
          should_guard_var_in_formula (if pos then SOME true else NONE)
blanchet@45377
  2004
   |> close_formula_universally
blanchet@45920
  2005
   |> bound_tvars type_enc true atomic_types,
blanchet@43493
  2006
   NONE,
blanchet@46406
  2007
   let val rank = rank j in
blanchet@46406
  2008
     case snd stature of
blanchet@46406
  2009
       Intro => isabelle_info format introN rank
blanchet@46406
  2010
     | Elim => isabelle_info format elimN rank
blanchet@46406
  2011
     | Simp => isabelle_info format simpN rank
blanchet@46406
  2012
     | Spec_Eq => isabelle_info format spec_eqN rank
blanchet@46406
  2013
     | _ => isabelle_info format "" rank
blanchet@46406
  2014
   end)
blanchet@43493
  2015
  |> Formula
blanchet@42573
  2016
blanchet@45301
  2017
fun formula_line_for_class_rel_clause format type_enc
blanchet@44593
  2018
        ({name, subclass, superclass, ...} : class_rel_clause) =
blanchet@44622
  2019
  let val ty_arg = ATerm (tvar_a_name, []) in
blanchet@42577
  2020
    Formula (class_rel_clause_prefix ^ ascii_of name, Axiom,
blanchet@44622
  2021
             AConn (AImplies,
blanchet@44625
  2022
                    [type_class_formula type_enc subclass ty_arg,
blanchet@44625
  2023
                     type_class_formula type_enc superclass ty_arg])
blanchet@45830
  2024
             |> mk_aquant AForall
blanchet@45830
  2025
                          [(tvar_a_name, atype_of_type_vars type_enc)],
blanchet@46406
  2026
             NONE, isabelle_info format introN helper_rank)
blanchet@42573
  2027
  end
blanchet@42573
  2028
blanchet@44625
  2029
fun formula_from_arity_atom type_enc (class, t, args) =
blanchet@44625
  2030
  ATerm (t, map (fn arg => ATerm (arg, [])) args)
blanchet@44625
  2031
  |> type_class_formula type_enc class
blanchet@42573
  2032
blanchet@45301
  2033
fun formula_line_for_arity_clause format type_enc
blanchet@45364
  2034
        ({name, prem_atoms, concl_atom} : arity_clause) =
blanchet@43495
  2035
  Formula (arity_clause_prefix ^ name, Axiom,
blanchet@44625
  2036
           mk_ahorn (map (formula_from_arity_atom type_enc) prem_atoms)
blanchet@44625
  2037
                    (formula_from_arity_atom type_enc concl_atom)
blanchet@45364
  2038
           |> mk_aquant AForall
blanchet@45364
  2039
                  (map (rpair (atype_of_type_vars type_enc)) (#3 concl_atom)),
blanchet@46406
  2040
           NONE, isabelle_info format introN helper_rank)
blanchet@42573
  2041
blanchet@45947
  2042
fun formula_line_for_conjecture ctxt polym_constrs format mono type_enc
blanchet@43859
  2043
        ({name, kind, iformula, atomic_types, ...} : translated_formula) =
blanchet@42577
  2044
  Formula (conjecture_prefix ^ name, kind,
blanchet@45316
  2045
           iformula
blanchet@45947
  2046
           |> formula_from_iformula ctxt polym_constrs format mono type_enc
blanchet@45316
  2047
                  should_guard_var_in_formula (SOME false)
blanchet@45377
  2048
           |> close_formula_universally
blanchet@46406
  2049
           |> bound_tvars type_enc true atomic_types, NONE, [])
blanchet@42573
  2050
blanchet@44625
  2051
fun formula_line_for_free_type j phi =
blanchet@46406
  2052
  Formula (tfree_clause_prefix ^ string_of_int j, Hypothesis, phi, NONE, [])
blanchet@44626
  2053
fun formula_lines_for_free_types type_enc (facts : translated_formula list) =
blanchet@42573
  2054
  let
blanchet@44625
  2055
    val phis =
blanchet@44625
  2056
      fold (union (op =)) (map #atomic_types facts) []
blanchet@44625
  2057
      |> formulas_for_types type_enc add_sorts_on_tfree
blanchet@44625
  2058
  in map2 formula_line_for_free_type (0 upto length phis - 1) phis end
blanchet@42573
  2059
blanchet@42573
  2060
(** Symbol declarations **)
blanchet@42544
  2061
blanchet@44754
  2062
fun decl_line_for_class order s =
blanchet@44595
  2063
  let val name as (s, _) = `make_type_class s in
blanchet@44622
  2064
    Decl (sym_decl_prefix ^ s, name,
blanchet@45779
  2065
          if order = First_Order then
blanchet@45779
  2066
            ATyAbs ([tvar_a_name],
blanchet@45779
  2067
                    if avoid_first_order_ghost_type_vars then
blanchet@45779
  2068
                      AFun (a_itself_atype, bool_atype)
blanchet@45779
  2069
                    else
blanchet@45779
  2070
                      bool_atype)
blanchet@44622
  2071
          else
blanchet@44754
  2072
            AFun (atype_of_types, bool_atype))
blanchet@44595
  2073
  end
blanchet@44595
  2074
blanchet@44595
  2075
fun decl_lines_for_classes type_enc classes =
blanchet@44595
  2076
  case type_enc of
blanchet@44754
  2077
    Simple_Types (order, Polymorphic, _) =>
blanchet@44754
  2078
    map (decl_line_for_class order) classes
blanchet@44595
  2079
  | _ => []
blanchet@44595
  2080
blanchet@46392
  2081
fun sym_decl_table_for_facts ctxt format type_enc sym_tab
blanchet@46392
  2082
                             (conjs, facts, extra_tms) =
blanchet@42574
  2083
  let
blanchet@44829
  2084
    fun add_iterm_syms tm =
blanchet@43859
  2085
      let val (head, args) = strip_iterm_comb tm in
blanchet@42574
  2086
        (case head of
blanchet@43859
  2087
           IConst ((s, s'), T, T_args) =>
blanchet@44594
  2088
           let
blanchet@44829
  2089
             val (pred_sym, in_conj) =
blanchet@44829
  2090
               case Symtab.lookup sym_tab s of
blanchet@44853
  2091
                 SOME ({pred_sym, in_conj, ...} : sym_info) =>
blanchet@44853
  2092
                 (pred_sym, in_conj)
blanchet@44829
  2093
               | NONE => (false, false)
blanchet@44594
  2094
             val decl_sym =
blanchet@44594
  2095
               (case type_enc of
blanchet@44594
  2096
                  Guards _ => not pred_sym
blanchet@44594
  2097
                | _ => true) andalso
blanchet@44594
  2098
               is_tptp_user_symbol s
blanchet@44594
  2099
           in
blanchet@44594
  2100
             if decl_sym then
blanchet@42576
  2101
               Symtab.map_default (s, [])
blanchet@42886
  2102
                   (insert_type ctxt #3 (s', T_args, T, pred_sym, length args,
blanchet@42886
  2103
                                         in_conj))
blanchet@42574
  2104
             else
blanchet@42574
  2105
               I
blanchet@42574
  2106
           end
blanchet@44829
  2107
         | IAbs (_, tm) => add_iterm_syms tm
blanchet@42574
  2108
         | _ => I)
blanchet@44829
  2109
        #> fold add_iterm_syms args
blanchet@42574
  2110
      end
blanchet@44829
  2111
    val add_fact_syms = K add_iterm_syms |> formula_fold NONE |> fact_lift
blanchet@43966
  2112
    fun add_formula_var_types (AQuant (_, xs, phi)) =
blanchet@43966
  2113
        fold (fn (_, SOME T) => insert_type ctxt I T | _ => I) xs
blanchet@43966
  2114
        #> add_formula_var_types phi
blanchet@43966
  2115
      | add_formula_var_types (AConn (_, phis)) =
blanchet@43966
  2116
        fold add_formula_var_types phis
blanchet@43966
  2117
      | add_formula_var_types _ = I
blanchet@43966
  2118
    fun var_types () =
blanchet@43966
  2119
      if polymorphism_of_type_enc type_enc = Polymorphic then [tvar_a]
blanchet@43966
  2120
      else fold (fact_lift add_formula_var_types) (conjs @ facts) []
blanchet@43966
  2121
    fun add_undefined_const T =
blanchet@43984
  2122
      let
blanchet@43984
  2123
        val (s, s') =
blanchet@44622
  2124
          `(make_fixed_const NONE) @{const_name undefined}
blanchet@45945
  2125
          |> (case type_arg_policy [] type_enc @{const_name undefined} of
blanchet@44771
  2126
                Mangled_Type_Args => mangled_const_name format type_enc [T]
blanchet@44001
  2127
              | _ => I)
blanchet@43984
  2128
      in
blanchet@43984
  2129
        Symtab.map_default (s, [])
blanchet@43984
  2130
                           (insert_type ctxt #3 (s', [T], T, false, 0, false))
blanchet@43984
  2131
      end
blanchet@44622
  2132
    fun add_TYPE_const () =
blanchet@44622
  2133
      let val (s, s') = TYPE_name in
blanchet@44622
  2134
        Symtab.map_default (s, [])
blanchet@44622
  2135
            (insert_type ctxt #3
blanchet@44622
  2136
                         (s', [tvar_a], @{typ "'a itself"}, false, 0, false))
blanchet@44622
  2137
      end
blanchet@42698
  2138
  in
blanchet@42698
  2139
    Symtab.empty
blanchet@43626
  2140
    |> is_type_enc_fairly_sound type_enc
blanchet@44829
  2141
       ? (fold (fold add_fact_syms) [conjs, facts]
blanchet@46392
  2142
          #> fold add_iterm_syms extra_tms
blanchet@43985
  2143
          #> (case type_enc of
blanchet@45829
  2144
                Simple_Types (First_Order, Polymorphic, _) =>
blanchet@45829
  2145
                if avoid_first_order_ghost_type_vars then add_TYPE_const ()
blanchet@45829
  2146
                else I
blanchet@44786
  2147
              | Simple_Types _ => I
blanchet@43985
  2148
              | _ => fold add_undefined_const (var_types ())))
blanchet@42698
  2149
  end
blanchet@42533
  2150
blanchet@44399
  2151
(* We add "bool" in case the helper "True_or_False" is included later. *)
blanchet@44634
  2152
fun default_mono level =
blanchet@44399
  2153
  {maybe_finite_Ts = [@{typ bool}],
blanchet@44399
  2154
   surely_finite_Ts = [@{typ bool}],
blanchet@44399
  2155
   maybe_infinite_Ts = known_infinite_types,
blanchet@44634
  2156
   surely_infinite_Ts =
blanchet@44634
  2157
     case level of
blanchet@46301
  2158
       Noninf_Nonmono_Types (Strict, _) => []
blanchet@44634
  2159
     | _ => known_infinite_types,
blanchet@44399
  2160
   maybe_nonmono_Ts = [@{typ bool}]}
blanchet@44399
  2161
blanchet@42685
  2162
(* This inference is described in section 2.3 of Claessen et al.'s "Sorting it
blanchet@42685
  2163
   out with monotonicity" paper presented at CADE 2011. *)
blanchet@44399
  2164
fun add_iterm_mononotonicity_info _ _ (SOME false) _ mono = mono
blanchet@44399
  2165
  | add_iterm_mononotonicity_info ctxt level _
blanchet@44399
  2166
        (IApp (IApp (IConst ((s, _), Type (_, [T, _]), _), tm1), tm2))
blanchet@44399
  2167
        (mono as {maybe_finite_Ts, surely_finite_Ts, maybe_infinite_Ts,
blanchet@44399
  2168
                  surely_infinite_Ts, maybe_nonmono_Ts}) =
blanchet@44403
  2169
    if is_tptp_equal s andalso exists is_maybe_universal_var [tm1, tm2] then
blanchet@44399
  2170
      case level of
blanchet@46301
  2171
        Noninf_Nonmono_Types (strictness, _) =>
blanchet@44399
  2172
        if exists (type_instance ctxt T) surely_infinite_Ts orelse
blanchet@44859
  2173
           member (type_equiv ctxt) maybe_finite_Ts T then
blanchet@44399
  2174
          mono
blanchet@46301
  2175
        else if is_type_kind_of_surely_infinite ctxt strictness
blanchet@44500
  2176
                                                surely_infinite_Ts T then
blanchet@44399
  2177
          {maybe_finite_Ts = maybe_finite_Ts,
blanchet@44399
  2178
           surely_finite_Ts = surely_finite_Ts,
blanchet@44399
  2179
           maybe_infinite_Ts = maybe_infinite_Ts,
blanchet@44399
  2180
           surely_infinite_Ts = surely_infinite_Ts |> insert_type ctxt I T,
blanchet@44399
  2181
           maybe_nonmono_Ts = maybe_nonmono_Ts}
blanchet@44399
  2182
        else
blanchet@44859
  2183
          {maybe_finite_Ts = maybe_finite_Ts |> insert (type_equiv ctxt) T,
blanchet@44399
  2184
           surely_finite_Ts = surely_finite_Ts,
blanchet@44399
  2185
           maybe_infinite_Ts = maybe_infinite_Ts,
blanchet@44399
  2186
           surely_infinite_Ts = surely_infinite_Ts,
blanchet@44399
  2187
           maybe_nonmono_Ts = maybe_nonmono_Ts |> insert_type ctxt I T}
blanchet@44768
  2188
      | Fin_Nonmono_Types _ =>
blanchet@44399
  2189
        if exists (type_instance ctxt T) surely_finite_Ts orelse
blanchet@44859
  2190
           member (type_equiv ctxt) maybe_infinite_Ts T then
blanchet@44399
  2191
          mono
blanchet@44399
  2192
        else if is_type_surely_finite ctxt T then
blanchet@44399
  2193
          {maybe_finite_Ts = maybe_finite_Ts,
blanchet@44399
  2194
           surely_finite_Ts = surely_finite_Ts |> insert_type ctxt I T,
blanchet@44399
  2195
           maybe_infinite_Ts = maybe_infinite_Ts,
blanchet@44399
  2196
           surely_infinite_Ts = surely_infinite_Ts,
blanchet@44399
  2197
           maybe_nonmono_Ts = maybe_nonmono_Ts |> insert_type ctxt I T}
blanchet@44399
  2198
        else
blanchet@44399
  2199
          {maybe_finite_Ts = maybe_finite_Ts,
blanchet@44399
  2200
           surely_finite_Ts = surely_finite_Ts,
blanchet@44859
  2201
           maybe_infinite_Ts = maybe_infinite_Ts |> insert (type_equiv ctxt) T,
blanchet@44399
  2202
           surely_infinite_Ts = surely_infinite_Ts,
blanchet@44399
  2203
           maybe_nonmono_Ts = maybe_nonmono_Ts}
blanchet@44399
  2204
      | _ => mono
blanchet@44399
  2205
    else
blanchet@44399
  2206
      mono
blanchet@44399
  2207
  | add_iterm_mononotonicity_info _ _ _ _ mono = mono
blanchet@44399
  2208
fun add_fact_mononotonicity_info ctxt level
blanchet@44399
  2209
        ({kind, iformula, ...} : translated_formula) =
blanchet@42834
  2210
  formula_fold (SOME (kind <> Conjecture))
blanchet@44399
  2211
               (add_iterm_mononotonicity_info ctxt level) iformula
blanchet@44399
  2212
fun mononotonicity_info_for_facts ctxt type_enc facts =
blanchet@43626
  2213
  let val level = level_of_type_enc type_enc in
blanchet@44634
  2214
    default_mono level
blanchet@44399
  2215
    |> is_type_level_monotonicity_based level
blanchet@44399
  2216
       ? fold (add_fact_mononotonicity_info ctxt level) facts
blanchet@42829
  2217
  end
blanchet@42677
  2218
blanchet@44501
  2219
fun add_iformula_monotonic_types ctxt mono type_enc =
blanchet@44501
  2220
  let
blanchet@44501
  2221
    val level = level_of_type_enc type_enc
blanchet@44501
  2222
    val should_encode = should_encode_type ctxt mono level
blanchet@44504
  2223
    fun add_type T = not (should_encode T) ? insert_type ctxt I T
blanchet@44506
  2224
    fun add_args (IApp (tm1, tm2)) = add_args tm1 #> add_term tm2
blanchet@44506
  2225
      | add_args _ = I
blanchet@44506
  2226
    and add_term tm = add_type (ityp_of tm) #> add_args tm
blanchet@44501
  2227
  in formula_fold NONE (K add_term) end
blanchet@44501
  2228
fun add_fact_monotonic_types ctxt mono type_enc =
blanchet@44501
  2229
  add_iformula_monotonic_types ctxt mono type_enc |> fact_lift
blanchet@44501
  2230
fun monotonic_types_for_facts ctxt mono type_enc facts =
blanchet@44811
  2231
  let val level = level_of_type_enc type_enc in
blanchet@44811
  2232
    [] |> (polymorphism_of_type_enc type_enc = Polymorphic andalso
blanchet@44811
  2233
           is_type_level_monotonicity_based level andalso
blanchet@44811
  2234
           granularity_of_type_level level <> Ghost_Type_Arg_Vars)
blanchet@44811
  2235
          ? fold (add_fact_monotonic_types ctxt mono type_enc) facts
blanchet@44811
  2236
  end
blanchet@44501
  2237
blanchet@44399
  2238
fun formula_line_for_guards_mono_type ctxt format mono type_enc T =
blanchet@44396
  2239
  Formula (guards_sym_formula_prefix ^
blanchet@44396
  2240
           ascii_of (mangled_type format type_enc T),
blanchet@44396
  2241
           Axiom,
blanchet@44396
  2242
           IConst (`make_bound_var "X", T, [])
blanchet@44774
  2243
           |> type_guard_iterm format type_enc T
blanchet@44396
  2244
           |> AAtom
blanchet@45947
  2245
           |> formula_from_iformula ctxt [] format mono type_enc
blanchet@45948
  2246
                                    always_guard_var_in_formula (SOME true)
blanchet@45377
  2247
           |> close_formula_universally
blanchet@45920
  2248
           |> bound_tvars type_enc true (atomic_types_of T),
blanchet@46406
  2249
           NONE, isabelle_info format introN helper_rank)
blanchet@44396
  2250
blanchet@44399
  2251
fun formula_line_for_tags_mono_type ctxt format mono type_enc T =
blanchet@44396
  2252
  let val x_var = ATerm (`make_bound_var "X", []) in
blanchet@44396
  2253
    Formula (tags_sym_formula_prefix ^
blanchet@44396
  2254
             ascii_of (mangled_type format type_enc T),
blanchet@44396
  2255
             Axiom,
blanchet@46392
  2256
             eq_formula type_enc (atomic_types_of T) [] false
blanchet@45949
  2257
                  (tag_with_type ctxt format mono type_enc NONE T x_var) x_var,
blanchet@46406
  2258
             NONE, isabelle_info format spec_eqN helper_rank)
blanchet@44396
  2259
  end
blanchet@44396
  2260
blanchet@44399
  2261
fun problem_lines_for_mono_types ctxt format mono type_enc Ts =
blanchet@44396
  2262
  case type_enc of
blanchet@44396
  2263
    Simple_Types _ => []
blanchet@44396
  2264
  | Guards _ =>
blanchet@44399
  2265
    map (formula_line_for_guards_mono_type ctxt format mono type_enc) Ts
blanchet@44399
  2266
  | Tags _ => map (formula_line_for_tags_mono_type ctxt format mono type_enc) Ts
blanchet@44396
  2267
blanchet@44399
  2268
fun decl_line_for_sym ctxt format mono type_enc s
blanchet@42994
  2269
                      (s', T_args, T, pred_sym, ary, _) =
blanchet@42994
  2270
  let
blanchet@44594
  2271
    val thy = Proof_Context.theory_of ctxt
blanchet@44594
  2272
    val (T, T_args) =
blanchet@44594
  2273
      if null T_args then
blanchet@44594
  2274
        (T, [])
blanchet@45511
  2275
      else case unprefix_and_unascii const_prefix s of
blanchet@44594
  2276
        SOME s' =>
blanchet@44594
  2277
        let
blanchet@44594
  2278
          val s' = s' |> invert_const
blanchet@44594
  2279
          val T = s' |> robust_const_type thy
blanchet@44594
  2280
        in (T, robust_const_typargs thy (s', T)) end
blanchet@45509
  2281
      | NONE => raise Fail "unexpected type arguments"
blanchet@42994
  2282
  in
blanchet@42998
  2283
    Decl (sym_decl_prefix ^ s, (s, s'),
blanchet@44594
  2284
          T |> fused_type ctxt mono (level_of_type_enc type_enc) ary
blanchet@44594
  2285
            |> ho_type_from_typ format type_enc pred_sym ary
blanchet@44594
  2286
            |> not (null T_args)
blanchet@44594
  2287
               ? curry ATyAbs (map (tvar_name o fst o dest_TVar) T_args))
blanchet@42994
  2288
  end
blanchet@42579
  2289
blanchet@46392
  2290
fun honor_conj_sym_kind in_conj conj_sym_kind =
blanchet@46392
  2291
  if in_conj then (conj_sym_kind, conj_sym_kind = Conjecture ? mk_anot)
blanchet@46392
  2292
  else (Axiom, I)
blanchet@46392
  2293
blanchet@44399
  2294
fun formula_line_for_guards_sym_decl ctxt format conj_sym_kind mono type_enc n s
blanchet@44399
  2295
                                     j (s', T_args, T, _, ary, in_conj) =
blanchet@42579
  2296
  let
blanchet@44811
  2297
    val thy = Proof_Context.theory_of ctxt
blanchet@46392
  2298
    val (kind, maybe_negate) = honor_conj_sym_kind in_conj conj_sym_kind
blanchet@42753
  2299
    val (arg_Ts, res_T) = chop_fun ary T
blanchet@44814
  2300
    val bound_names = 1 upto ary |> map (`I o make_bound_var o string_of_int)
blanchet@42829
  2301
    val bounds =
blanchet@43859
  2302
      bound_names ~~ arg_Ts |> map (fn (name, T) => IConst (name, T, []))
blanchet@42579
  2303
    val bound_Ts =
blanchet@44811
  2304
      if exists (curry (op =) dummyT) T_args then
blanchet@44811
  2305
        case level_of_type_enc type_enc of
blanchet@44811
  2306
          All_Types => map SOME arg_Ts
blanchet@44811
  2307
        | level =>
blanchet@44811
  2308
          if granularity_of_type_level level = Ghost_Type_Arg_Vars then
blanchet@44811
  2309
            let val ghosts = ghost_type_args thy s ary in
blanchet@44811
  2310
              map2 (fn j => if member (op =) ghosts j then SOME else K NONE)
blanchet@44814
  2311
                   (0 upto ary - 1) arg_Ts
blanchet@44811
  2312
            end
blanchet@44811
  2313
          else
blanchet@44814
  2314
            replicate ary NONE
blanchet@44811
  2315
      else
blanchet@44814
  2316
        replicate ary NONE
blanchet@42579
  2317
  in
blanchet@43989
  2318
    Formula (guards_sym_formula_prefix ^ s ^
blanchet@42709
  2319
             (if n > 1 then "_" ^ string_of_int j else ""), kind,
blanchet@43859
  2320
             IConst ((s, s'), T, T_args)
blanchet@43859
  2321
             |> fold (curry (IApp o swap)) bounds
blanchet@44774
  2322
             |> type_guard_iterm format type_enc res_T
blanchet@42963
  2323
             |> AAtom |> mk_aquant AForall (bound_names ~~ bound_Ts)
blanchet@45947
  2324
             |> formula_from_iformula ctxt [] format mono type_enc
blanchet@45948