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