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