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