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