src/HOL/Tools/Sledgehammer/sledgehammer_atp_translate.ML
author blanchet
Thu May 12 15:29:19 2011 +0200 (2011-05-12)
changeset 42761 8ea9c6fa8b53
parent 42755 4603154a3018
child 42778 896aaab98563
permissions -rw-r--r--
fixed several bugs in Isar proof reconstruction, in particular w.r.t. mangled types and hAPP
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@40068
     9
signature SLEDGEHAMMER_ATP_TRANSLATE =
blanchet@38282
    10
sig
blanchet@42227
    11
  type 'a fo_term = 'a ATP_Problem.fo_term
blanchet@42709
    12
  type formula_kind = ATP_Problem.formula_kind
blanchet@38282
    13
  type 'a problem = 'a ATP_Problem.problem
blanchet@42640
    14
  type locality = Sledgehammer_Filter.locality
blanchet@42613
    15
blanchet@42613
    16
  datatype polymorphism = Polymorphic | Monomorphic | Mangled_Monomorphic
blanchet@42613
    17
  datatype type_level =
blanchet@42613
    18
    All_Types | Nonmonotonic_Types | Finite_Types | Const_Arg_Types | No_Types
blanchet@42613
    19
blanchet@42613
    20
  datatype type_system =
blanchet@42722
    21
    Simple_Types of type_level |
blanchet@42613
    22
    Preds of polymorphism * type_level |
blanchet@42613
    23
    Tags of polymorphism * type_level
blanchet@42613
    24
blanchet@40114
    25
  type translated_formula
blanchet@38282
    26
blanchet@42646
    27
  val readable_names : bool Config.T
blanchet@40204
    28
  val fact_prefix : string
blanchet@38282
    29
  val conjecture_prefix : string
blanchet@42568
    30
  val predicator_base : string
blanchet@42544
    31
  val explicit_app_base : string
blanchet@42549
    32
  val type_pred_base : string
blanchet@42562
    33
  val tff_type_prefix : string
blanchet@42613
    34
  val type_sys_from_string : string -> type_system
blanchet@42613
    35
  val polymorphism_of_type_sys : type_system -> polymorphism
blanchet@42613
    36
  val level_of_type_sys : type_system -> type_level
blanchet@42613
    37
  val is_type_sys_virtually_sound : type_system -> bool
blanchet@42613
    38
  val is_type_sys_fairly_sound : type_system -> bool
blanchet@42542
    39
  val unmangled_const : string -> string * string fo_term list
blanchet@41088
    40
  val translate_atp_fact :
blanchet@42640
    41
    Proof.context -> bool -> (string * locality) * thm
blanchet@42640
    42
    -> translated_formula option * ((string * locality) * thm)
blanchet@40059
    43
  val prepare_atp_problem :
blanchet@42709
    44
    Proof.context -> formula_kind -> formula_kind -> type_system -> bool
blanchet@42709
    45
    -> term list -> term
blanchet@41091
    46
    -> (translated_formula option * ((string * 'a) * thm)) list
blanchet@42541
    47
    -> string problem * string Symtab.table * int * int
blanchet@42755
    48
       * (string * 'a) list vector * int Symtab.table
blanchet@41313
    49
  val atp_problem_weights : string problem -> (string * real) list
blanchet@38282
    50
end;
blanchet@38282
    51
blanchet@41140
    52
structure Sledgehammer_ATP_Translate : SLEDGEHAMMER_ATP_TRANSLATE =
blanchet@38282
    53
struct
blanchet@38282
    54
blanchet@38282
    55
open ATP_Problem
blanchet@39494
    56
open Metis_Translate
blanchet@38282
    57
open Sledgehammer_Util
blanchet@42640
    58
open Sledgehammer_Filter
blanchet@42640
    59
blanchet@42640
    60
(* experimental *)
blanchet@42640
    61
val generate_useful_info = false
blanchet@38282
    62
blanchet@42568
    63
(* Readable names are often much shorter, especially if types are mangled in
blanchet@42589
    64
   names. Also, the logic for generating legal SNARK sort names is only
blanchet@42589
    65
   implemented for readable names. Finally, readable names are, well, more
blanchet@42589
    66
   readable. For these reason, they are enabled by default. *)
blanchet@42646
    67
val readable_names =
blanchet@42646
    68
  Attrib.setup_config_bool @{binding sledgehammer_atp_readable_names} (K true)
blanchet@42568
    69
blanchet@42543
    70
val type_decl_prefix = "type_"
blanchet@42543
    71
val sym_decl_prefix = "sym_"
blanchet@40204
    72
val fact_prefix = "fact_"
blanchet@38282
    73
val conjecture_prefix = "conj_"
blanchet@38282
    74
val helper_prefix = "help_"
blanchet@42543
    75
val class_rel_clause_prefix = "crel_";
blanchet@38282
    76
val arity_clause_prefix = "arity_"
blanchet@39975
    77
val tfree_prefix = "tfree_"
blanchet@38282
    78
blanchet@42568
    79
val predicator_base = "hBOOL"
blanchet@42544
    80
val explicit_app_base = "hAPP"
blanchet@42542
    81
val type_pred_base = "is"
blanchet@42562
    82
val tff_type_prefix = "ty_"
blanchet@42531
    83
blanchet@42562
    84
fun make_tff_type s = tff_type_prefix ^ ascii_of s
blanchet@42531
    85
blanchet@38282
    86
(* Freshness almost guaranteed! *)
blanchet@38282
    87
val sledgehammer_weak_prefix = "Sledgehammer:"
blanchet@38282
    88
blanchet@42613
    89
datatype polymorphism = Polymorphic | Monomorphic | Mangled_Monomorphic
blanchet@42613
    90
datatype type_level =
blanchet@42613
    91
  All_Types | Nonmonotonic_Types | Finite_Types | Const_Arg_Types | No_Types
blanchet@42613
    92
blanchet@42613
    93
datatype type_system =
blanchet@42722
    94
  Simple_Types of type_level |
blanchet@42613
    95
  Preds of polymorphism * type_level |
blanchet@42613
    96
  Tags of polymorphism * type_level
blanchet@42613
    97
blanchet@42689
    98
fun try_unsuffixes ss s =
blanchet@42689
    99
  fold (fn s' => fn NONE => try (unsuffix s') s | some => some) ss NONE
blanchet@42689
   100
blanchet@42613
   101
fun type_sys_from_string s =
blanchet@42722
   102
  (case try (unprefix "poly_") s of
blanchet@42722
   103
     SOME s => (SOME Polymorphic, s)
blanchet@42613
   104
   | NONE =>
blanchet@42613
   105
     case try (unprefix "mono_") s of
blanchet@42722
   106
       SOME s => (SOME Monomorphic, s)
blanchet@42722
   107
     | NONE =>
blanchet@42722
   108
       case try (unprefix "mangled_") s of
blanchet@42722
   109
         SOME s => (SOME Mangled_Monomorphic, s)
blanchet@42722
   110
       | NONE => (NONE, s))
blanchet@42613
   111
  ||> (fn s =>
blanchet@42689
   112
          (* "_query" and "_bang" are for the ASCII-challenged Mirabelle. *)
blanchet@42689
   113
          case try_unsuffixes ["?", "_query"] s of
blanchet@42613
   114
            SOME s => (Nonmonotonic_Types, s)
blanchet@42613
   115
          | NONE =>
blanchet@42689
   116
            case try_unsuffixes ["!", "_bang"] s of
blanchet@42613
   117
              SOME s => (Finite_Types, s)
blanchet@42613
   118
            | NONE => (All_Types, s))
blanchet@42722
   119
  |> (fn (poly, (level, core)) =>
blanchet@42722
   120
         case (core, (poly, level)) of
blanchet@42722
   121
           ("simple_types", (NONE, level)) => Simple_Types level
blanchet@42753
   122
         | ("preds", (SOME Polymorphic, level)) =>
blanchet@42753
   123
           if level = All_Types then Preds (Polymorphic, level)
blanchet@42753
   124
           else raise Same.SAME
blanchet@42722
   125
         | ("preds", (SOME poly, level)) => Preds (poly, level)
blanchet@42753
   126
         | ("tags", (SOME Polymorphic, level)) =>
blanchet@42753
   127
           if level = All_Types orelse level = Finite_Types then
blanchet@42753
   128
             Tags (Polymorphic, level)
blanchet@42753
   129
           else
blanchet@42753
   130
             raise Same.SAME
blanchet@42722
   131
         | ("tags", (SOME poly, level)) => Tags (poly, level)
blanchet@42722
   132
         | ("args", (SOME poly, All_Types (* naja *))) =>
blanchet@42722
   133
           Preds (poly, Const_Arg_Types)
blanchet@42722
   134
         | ("erased", (NONE, All_Types (* naja *))) =>
blanchet@42722
   135
           Preds (Polymorphic, No_Types)
blanchet@42753
   136
         | _ => raise Same.SAME)
blanchet@42753
   137
  handle Same.SAME => error ("Unknown type system: " ^ quote s ^ ".")
blanchet@42613
   138
blanchet@42722
   139
fun polymorphism_of_type_sys (Simple_Types _) = Mangled_Monomorphic
blanchet@42613
   140
  | polymorphism_of_type_sys (Preds (poly, _)) = poly
blanchet@42613
   141
  | polymorphism_of_type_sys (Tags (poly, _)) = poly
blanchet@42613
   142
blanchet@42722
   143
fun level_of_type_sys (Simple_Types level) = level
blanchet@42613
   144
  | level_of_type_sys (Preds (_, level)) = level
blanchet@42613
   145
  | level_of_type_sys (Tags (_, level)) = level
blanchet@42613
   146
blanchet@42687
   147
fun is_type_level_virtually_sound level =
blanchet@42687
   148
  level = All_Types orelse level = Nonmonotonic_Types
blanchet@42613
   149
val is_type_sys_virtually_sound =
blanchet@42613
   150
  is_type_level_virtually_sound o level_of_type_sys
blanchet@42613
   151
blanchet@42613
   152
fun is_type_level_fairly_sound level =
blanchet@42613
   153
  is_type_level_virtually_sound level orelse level = Finite_Types
blanchet@42613
   154
val is_type_sys_fairly_sound = is_type_level_fairly_sound o level_of_type_sys
blanchet@42613
   155
blanchet@42687
   156
fun is_type_level_partial level =
blanchet@42687
   157
  level = Nonmonotonic_Types orelse level = Finite_Types
blanchet@42687
   158
blanchet@42573
   159
fun formula_map f (AQuant (q, xs, phi)) = AQuant (q, xs, formula_map f phi)
blanchet@42573
   160
  | formula_map f (AConn (c, phis)) = AConn (c, map (formula_map f) phis)
blanchet@42573
   161
  | formula_map f (AAtom tm) = AAtom (f tm)
blanchet@42573
   162
blanchet@42680
   163
fun formula_fold pos f =
blanchet@42677
   164
  let
blanchet@42677
   165
    fun aux pos (AQuant (_, _, phi)) = aux pos phi
blanchet@42680
   166
      | aux pos (AConn (ANot, [phi])) = aux (Option.map not pos) phi
blanchet@42677
   167
      | aux pos (AConn (AImplies, [phi1, phi2])) =
blanchet@42680
   168
        aux (Option.map not pos) phi1 #> aux pos phi2
blanchet@42680
   169
      | aux pos (AConn (AAnd, phis)) = fold (aux pos) phis
blanchet@42680
   170
      | aux pos (AConn (AOr, phis)) = fold (aux pos) phis
blanchet@42680
   171
      | aux _ (AConn (_, phis)) = fold (aux NONE) phis
blanchet@42677
   172
      | aux pos (AAtom tm) = f pos tm
blanchet@42680
   173
  in aux (SOME pos) end
blanchet@42573
   174
blanchet@40114
   175
type translated_formula =
blanchet@38752
   176
  {name: string,
blanchet@42640
   177
   locality: locality,
blanchet@42525
   178
   kind: formula_kind,
blanchet@42562
   179
   combformula: (name, typ, combterm) formula,
blanchet@42562
   180
   atomic_types: typ list}
blanchet@38282
   181
blanchet@42640
   182
fun update_combformula f ({name, locality, kind, combformula, atomic_types}
blanchet@42640
   183
                          : translated_formula) =
blanchet@42640
   184
  {name = name, locality = locality, kind = kind, combformula = f combformula,
blanchet@42562
   185
   atomic_types = atomic_types} : translated_formula
blanchet@42542
   186
blanchet@42558
   187
fun fact_lift f ({combformula, ...} : translated_formula) = f combformula
blanchet@42558
   188
blanchet@42572
   189
val boring_consts = [explicit_app_base, @{const_name Metis.fequal}]
blanchet@42572
   190
blanchet@42572
   191
fun should_omit_type_args type_sys s =
blanchet@42589
   192
  s <> type_pred_base andalso s <> type_tag_name andalso
blanchet@42589
   193
  (s = @{const_name HOL.eq} orelse level_of_type_sys type_sys = No_Types orelse
blanchet@42589
   194
   (case type_sys of
blanchet@42589
   195
      Tags (_, All_Types) => true
blanchet@42589
   196
    | _ => polymorphism_of_type_sys type_sys <> Mangled_Monomorphic andalso
blanchet@42589
   197
           member (op =) boring_consts s))
blanchet@42677
   198
blanchet@42753
   199
(* The Booleans indicate whether all type arguments should be kept. *)
blanchet@42753
   200
datatype type_arg_policy =
blanchet@42753
   201
  Explicit_Type_Args of bool |
blanchet@42753
   202
  Mangled_Type_Args of bool |
blanchet@42753
   203
  No_Type_Args
blanchet@41136
   204
blanchet@42753
   205
(* FIXME: Find out whether and when erasing the non-result type arguments is
blanchet@42753
   206
   sound. *)
blanchet@42589
   207
fun general_type_arg_policy type_sys =
blanchet@42589
   208
  if level_of_type_sys type_sys = No_Types then
blanchet@42589
   209
    No_Type_Args
blanchet@42589
   210
  else if polymorphism_of_type_sys type_sys = Mangled_Monomorphic then
blanchet@42753
   211
    Mangled_Type_Args (is_type_sys_virtually_sound type_sys)
blanchet@42589
   212
  else
blanchet@42753
   213
    Explicit_Type_Args (is_type_sys_virtually_sound type_sys)
blanchet@42563
   214
blanchet@42524
   215
fun type_arg_policy type_sys s =
blanchet@42572
   216
  if should_omit_type_args type_sys s then No_Type_Args
blanchet@42563
   217
  else general_type_arg_policy type_sys
blanchet@42227
   218
blanchet@42353
   219
fun atp_type_literals_for_types type_sys kind Ts =
blanchet@42589
   220
  if level_of_type_sys type_sys = No_Types then
blanchet@42353
   221
    []
blanchet@42353
   222
  else
blanchet@42353
   223
    Ts |> type_literals_for_types
blanchet@42353
   224
       |> filter (fn TyLitVar _ => kind <> Conjecture
blanchet@42353
   225
                   | TyLitFree _ => kind = Conjecture)
blanchet@41137
   226
blanchet@42709
   227
fun mk_anot phi = AConn (ANot, [phi])
blanchet@38282
   228
fun mk_aconn c phi1 phi2 = AConn (c, [phi1, phi2])
blanchet@42534
   229
fun mk_aconns c phis =
blanchet@42534
   230
  let val (phis', phi') = split_last phis in
blanchet@42534
   231
    fold_rev (mk_aconn c) phis' phi'
blanchet@42534
   232
  end
blanchet@38282
   233
fun mk_ahorn [] phi = phi
blanchet@42534
   234
  | mk_ahorn phis psi = AConn (AImplies, [mk_aconns AAnd phis, psi])
blanchet@42522
   235
fun mk_aquant _ [] phi = phi
blanchet@42522
   236
  | mk_aquant q xs (phi as AQuant (q', xs', phi')) =
blanchet@42522
   237
    if q = q' then AQuant (q, xs @ xs', phi') else AQuant (q, xs, phi)
blanchet@42522
   238
  | mk_aquant q xs phi = AQuant (q, xs, phi)
blanchet@38282
   239
blanchet@42522
   240
fun close_universally atom_vars phi =
blanchet@41145
   241
  let
blanchet@41145
   242
    fun formula_vars bounds (AQuant (_, xs, phi)) =
blanchet@42526
   243
        formula_vars (map fst xs @ bounds) phi
blanchet@41145
   244
      | formula_vars bounds (AConn (_, phis)) = fold (formula_vars bounds) phis
blanchet@42522
   245
      | formula_vars bounds (AAtom tm) =
blanchet@42526
   246
        union (op =) (atom_vars tm []
blanchet@42526
   247
                      |> filter_out (member (op =) bounds o fst))
blanchet@42522
   248
  in mk_aquant AForall (formula_vars [] phi []) phi end
blanchet@42522
   249
blanchet@42531
   250
fun combterm_vars (CombApp (tm1, tm2)) = fold combterm_vars [tm1, tm2]
blanchet@42522
   251
  | combterm_vars (CombConst _) = I
blanchet@42574
   252
  | combterm_vars (CombVar (name, T)) = insert (op =) (name, SOME T)
blanchet@42674
   253
fun close_combformula_universally phi = close_universally combterm_vars phi
blanchet@42522
   254
blanchet@42522
   255
fun term_vars (ATerm (name as (s, _), tms)) =
blanchet@42531
   256
  is_atp_variable s ? insert (op =) (name, NONE)
blanchet@42526
   257
  #> fold term_vars tms
blanchet@42674
   258
fun close_formula_universally phi = close_universally term_vars phi
blanchet@41145
   259
blanchet@42562
   260
fun fo_term_from_typ (Type (s, Ts)) =
blanchet@42562
   261
    ATerm (`make_fixed_type_const s, map fo_term_from_typ Ts)
blanchet@42562
   262
  | fo_term_from_typ (TFree (s, _)) =
blanchet@42562
   263
    ATerm (`make_fixed_type_var s, [])
blanchet@42562
   264
  | fo_term_from_typ (TVar ((x as (s, _)), _)) =
blanchet@42562
   265
    ATerm ((make_schematic_type_var x, s), [])
blanchet@42562
   266
blanchet@42562
   267
(* This shouldn't clash with anything else. *)
blanchet@42542
   268
val mangled_type_sep = "\000"
blanchet@42542
   269
blanchet@42562
   270
fun generic_mangled_type_name f (ATerm (name, [])) = f name
blanchet@42562
   271
  | generic_mangled_type_name f (ATerm (name, tys)) =
blanchet@42761
   272
    f name ^ "(" ^ space_implode "," (map (generic_mangled_type_name f) tys)
blanchet@42761
   273
    ^ ")"
blanchet@42562
   274
val mangled_type_name =
blanchet@42562
   275
  fo_term_from_typ
blanchet@42562
   276
  #> (fn ty => (make_tff_type (generic_mangled_type_name fst ty),
blanchet@42562
   277
                generic_mangled_type_name snd ty))
blanchet@42542
   278
blanchet@42574
   279
fun generic_mangled_type_suffix f g Ts =
blanchet@42542
   280
  fold_rev (curry (op ^) o g o prefix mangled_type_sep
blanchet@42574
   281
            o generic_mangled_type_name f) Ts ""
blanchet@42562
   282
fun mangled_const_name T_args (s, s') =
blanchet@42562
   283
  let val ty_args = map fo_term_from_typ T_args in
blanchet@42562
   284
    (s ^ generic_mangled_type_suffix fst ascii_of ty_args,
blanchet@42562
   285
     s' ^ generic_mangled_type_suffix snd I ty_args)
blanchet@42562
   286
  end
blanchet@42542
   287
blanchet@42542
   288
val parse_mangled_ident =
blanchet@42542
   289
  Scan.many1 (not o member (op =) ["(", ")", ","]) >> implode
blanchet@42542
   290
blanchet@42542
   291
fun parse_mangled_type x =
blanchet@42542
   292
  (parse_mangled_ident
blanchet@42542
   293
   -- Scan.optional ($$ "(" |-- Scan.optional parse_mangled_types [] --| $$ ")")
blanchet@42542
   294
                    [] >> ATerm) x
blanchet@42542
   295
and parse_mangled_types x =
blanchet@42542
   296
  (parse_mangled_type ::: Scan.repeat ($$ "," |-- parse_mangled_type)) x
blanchet@42542
   297
blanchet@42542
   298
fun unmangled_type s =
blanchet@42542
   299
  s |> suffix ")" |> raw_explode
blanchet@42542
   300
    |> Scan.finite Symbol.stopper
blanchet@42542
   301
           (Scan.error (!! (fn _ => raise Fail ("unrecognized mangled type " ^
blanchet@42542
   302
                                                quote s)) parse_mangled_type))
blanchet@42542
   303
    |> fst
blanchet@42542
   304
blanchet@42561
   305
val unmangled_const_name = space_explode mangled_type_sep #> hd
blanchet@42542
   306
fun unmangled_const s =
blanchet@42542
   307
  let val ss = space_explode mangled_type_sep s in
blanchet@42542
   308
    (hd ss, map unmangled_type (tl ss))
blanchet@42542
   309
  end
blanchet@42542
   310
blanchet@42674
   311
fun introduce_proxies tm =
blanchet@42568
   312
  let
blanchet@42568
   313
    fun aux top_level (CombApp (tm1, tm2)) =
blanchet@42568
   314
        CombApp (aux top_level tm1, aux false tm2)
blanchet@42574
   315
      | aux top_level (CombConst (name as (s, s'), T, T_args)) =
blanchet@42570
   316
        (case proxify_const s of
blanchet@42568
   317
           SOME proxy_base =>
blanchet@42568
   318
           if top_level then
blanchet@42568
   319
             (case s of
blanchet@42568
   320
                "c_False" => (tptp_false, s')
blanchet@42568
   321
              | "c_True" => (tptp_true, s')
blanchet@42568
   322
              | _ => name, [])
blanchet@42569
   323
           else
blanchet@42574
   324
             (proxy_base |>> prefix const_prefix, T_args)
blanchet@42574
   325
          | NONE => (name, T_args))
blanchet@42574
   326
        |> (fn (name, T_args) => CombConst (name, T, T_args))
blanchet@42568
   327
      | aux _ tm = tm
blanchet@42674
   328
  in aux true tm end
blanchet@42568
   329
blanchet@42562
   330
fun combformula_from_prop thy eq_as_iff =
blanchet@38282
   331
  let
blanchet@42568
   332
    fun do_term bs t atomic_types =
blanchet@41140
   333
      combterm_from_term thy bs (Envir.eta_contract t)
blanchet@42568
   334
      |>> (introduce_proxies #> AAtom)
blanchet@42568
   335
      ||> union (op =) atomic_types
blanchet@38282
   336
    fun do_quant bs q s T t' =
blanchet@38518
   337
      let val s = Name.variant (map fst bs) s in
blanchet@38518
   338
        do_formula ((s, T) :: bs) t'
blanchet@42562
   339
        #>> mk_aquant q [(`make_bound_var s, SOME T)]
blanchet@38518
   340
      end
blanchet@38282
   341
    and do_conn bs c t1 t2 =
blanchet@38282
   342
      do_formula bs t1 ##>> do_formula bs t2
blanchet@42531
   343
      #>> uncurry (mk_aconn c)
blanchet@38282
   344
    and do_formula bs t =
blanchet@38282
   345
      case t of
blanchet@42531
   346
        @{const Not} $ t1 => do_formula bs t1 #>> mk_anot
blanchet@38282
   347
      | Const (@{const_name All}, _) $ Abs (s, T, t') =>
blanchet@38282
   348
        do_quant bs AForall s T t'
blanchet@38282
   349
      | Const (@{const_name Ex}, _) $ Abs (s, T, t') =>
blanchet@38282
   350
        do_quant bs AExists s T t'
haftmann@38795
   351
      | @{const HOL.conj} $ t1 $ t2 => do_conn bs AAnd t1 t2
haftmann@38795
   352
      | @{const HOL.disj} $ t1 $ t2 => do_conn bs AOr t1 t2
haftmann@38786
   353
      | @{const HOL.implies} $ t1 $ t2 => do_conn bs AImplies t1 t2
haftmann@38864
   354
      | Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 =>
blanchet@41140
   355
        if eq_as_iff then do_conn bs AIff t1 t2 else do_term bs t
blanchet@41140
   356
      | _ => do_term bs t
blanchet@38282
   357
  in do_formula [] end
blanchet@38282
   358
blanchet@42750
   359
fun presimplify_term ctxt =
blanchet@42750
   360
  Skip_Proof.make_thm (Proof_Context.theory_of ctxt)
blanchet@42750
   361
  #> Meson.presimplify ctxt
blanchet@42750
   362
  #> prop_of
blanchet@38282
   363
wenzelm@41491
   364
fun concealed_bound_name j = sledgehammer_weak_prefix ^ string_of_int j
blanchet@38282
   365
fun conceal_bounds Ts t =
blanchet@38282
   366
  subst_bounds (map (Free o apfst concealed_bound_name)
blanchet@38282
   367
                    (0 upto length Ts - 1 ~~ Ts), t)
blanchet@38282
   368
fun reveal_bounds Ts =
blanchet@38282
   369
  subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j))
blanchet@38282
   370
                    (0 upto length Ts - 1 ~~ Ts))
blanchet@38282
   371
blanchet@42747
   372
fun extensionalize_term ctxt t =
blanchet@42747
   373
  let val thy = Proof_Context.theory_of ctxt in
blanchet@42747
   374
    t |> cterm_of thy |> Meson.extensionalize_conv ctxt
blanchet@42747
   375
      |> prop_of |> Logic.dest_equals |> snd
blanchet@42747
   376
  end
blanchet@38608
   377
blanchet@38282
   378
fun introduce_combinators_in_term ctxt kind t =
wenzelm@42361
   379
  let val thy = Proof_Context.theory_of ctxt in
blanchet@38491
   380
    if Meson.is_fol_term thy t then
blanchet@38491
   381
      t
blanchet@38491
   382
    else
blanchet@38491
   383
      let
blanchet@38491
   384
        fun aux Ts t =
blanchet@38491
   385
          case t of
blanchet@38491
   386
            @{const Not} $ t1 => @{const Not} $ aux Ts t1
blanchet@38491
   387
          | (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') =>
blanchet@38491
   388
            t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38652
   389
          | (t0 as Const (@{const_name All}, _)) $ t1 =>
blanchet@38652
   390
            aux Ts (t0 $ eta_expand Ts t1 1)
blanchet@38491
   391
          | (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') =>
blanchet@38491
   392
            t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38652
   393
          | (t0 as Const (@{const_name Ex}, _)) $ t1 =>
blanchet@38652
   394
            aux Ts (t0 $ eta_expand Ts t1 1)
haftmann@38795
   395
          | (t0 as @{const HOL.conj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38795
   396
          | (t0 as @{const HOL.disj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38786
   397
          | (t0 as @{const HOL.implies}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38864
   398
          | (t0 as Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])))
blanchet@38491
   399
              $ t1 $ t2 =>
blanchet@38491
   400
            t0 $ aux Ts t1 $ aux Ts t2
blanchet@38491
   401
          | _ => if not (exists_subterm (fn Abs _ => true | _ => false) t) then
blanchet@38491
   402
                   t
blanchet@38491
   403
                 else
blanchet@38491
   404
                   t |> conceal_bounds Ts
blanchet@38491
   405
                     |> Envir.eta_contract
blanchet@38491
   406
                     |> cterm_of thy
blanchet@39890
   407
                     |> Meson_Clausify.introduce_combinators_in_cterm
blanchet@38491
   408
                     |> prop_of |> Logic.dest_equals |> snd
blanchet@38491
   409
                     |> reveal_bounds Ts
blanchet@39370
   410
        val (t, ctxt') = Variable.import_terms true [t] ctxt |>> the_single
blanchet@38491
   411
      in t |> aux [] |> singleton (Variable.export_terms ctxt' ctxt) end
blanchet@38491
   412
      handle THM _ =>
blanchet@38491
   413
             (* A type variable of sort "{}" will make abstraction fail. *)
blanchet@38613
   414
             if kind = Conjecture then HOLogic.false_const
blanchet@38613
   415
             else HOLogic.true_const
blanchet@38491
   416
  end
blanchet@38282
   417
blanchet@38282
   418
(* Metis's use of "resolve_tac" freezes the schematic variables. We simulate the
blanchet@42353
   419
   same in Sledgehammer to prevent the discovery of unreplayable proofs. *)
blanchet@38282
   420
fun freeze_term t =
blanchet@38282
   421
  let
blanchet@38282
   422
    fun aux (t $ u) = aux t $ aux u
blanchet@38282
   423
      | aux (Abs (s, T, t)) = Abs (s, T, aux t)
blanchet@38282
   424
      | aux (Var ((s, i), T)) =
blanchet@38282
   425
        Free (sledgehammer_weak_prefix ^ s ^ "_" ^ string_of_int i, T)
blanchet@38282
   426
      | aux t = t
blanchet@38282
   427
  in t |> exists_subterm is_Var t ? aux end
blanchet@38282
   428
blanchet@40204
   429
(* making fact and conjecture formulas *)
blanchet@42640
   430
fun make_formula ctxt eq_as_iff presimp name loc kind t =
blanchet@38282
   431
  let
wenzelm@42361
   432
    val thy = Proof_Context.theory_of ctxt
blanchet@38608
   433
    val t = t |> Envir.beta_eta_contract
blanchet@38652
   434
              |> transform_elim_term
blanchet@41211
   435
              |> Object_Logic.atomize_term thy
blanchet@42563
   436
    val need_trueprop = (fastype_of t = @{typ bool})
blanchet@38652
   437
    val t = t |> need_trueprop ? HOLogic.mk_Trueprop
blanchet@42742
   438
              |> Raw_Simplifier.rewrite_term thy
blanchet@42742
   439
                     (Meson.unfold_set_const_simps ctxt) []
blanchet@42747
   440
              |> extensionalize_term ctxt
blanchet@42750
   441
              |> presimp ? presimplify_term ctxt
blanchet@38282
   442
              |> perhaps (try (HOLogic.dest_Trueprop))
blanchet@38282
   443
              |> introduce_combinators_in_term ctxt kind
blanchet@38613
   444
              |> kind <> Axiom ? freeze_term
blanchet@42562
   445
    val (combformula, atomic_types) =
blanchet@42562
   446
      combformula_from_prop thy eq_as_iff t []
blanchet@38282
   447
  in
blanchet@42640
   448
    {name = name, locality = loc, kind = kind, combformula = combformula,
blanchet@42562
   449
     atomic_types = atomic_types}
blanchet@38282
   450
  end
blanchet@38282
   451
blanchet@42640
   452
fun make_fact ctxt keep_trivial eq_as_iff presimp ((name, loc), t) =
blanchet@42640
   453
  case (keep_trivial, make_formula ctxt eq_as_iff presimp name loc Axiom t) of
blanchet@41990
   454
    (false, {combformula = AAtom (CombConst (("c_True", _), _, _)), ...}) =>
blanchet@41990
   455
    NONE
blanchet@41990
   456
  | (_, formula) => SOME formula
blanchet@42561
   457
blanchet@42709
   458
fun make_conjecture ctxt prem_kind ts =
blanchet@38613
   459
  let val last = length ts - 1 in
blanchet@42709
   460
    map2 (fn j => fn t =>
blanchet@42709
   461
             let
blanchet@42709
   462
               val (kind, maybe_negate) =
blanchet@42709
   463
                 if j = last then
blanchet@42709
   464
                   (Conjecture, I)
blanchet@42709
   465
                 else
blanchet@42709
   466
                   (prem_kind,
blanchet@42709
   467
                    if prem_kind = Conjecture then update_combformula mk_anot
blanchet@42709
   468
                    else I)
blanchet@42709
   469
              in
blanchet@42709
   470
                make_formula ctxt true true (string_of_int j) Chained kind t
blanchet@42709
   471
                |> maybe_negate
blanchet@42709
   472
              end)
blanchet@38613
   473
         (0 upto last) ts
blanchet@38613
   474
  end
blanchet@38282
   475
blanchet@42682
   476
(** Finite and infinite type inference **)
blanchet@42682
   477
blanchet@42682
   478
(* Finite types such as "unit", "bool", "bool * bool", and "bool => bool" are
blanchet@42682
   479
   dangerous because their "exhaust" properties can easily lead to unsound ATP
blanchet@42682
   480
   proofs. On the other hand, all HOL infinite types can be given the same
blanchet@42682
   481
   models in first-order logic (via Löwenheim-Skolem). *)
blanchet@42682
   482
blanchet@42682
   483
fun should_encode_type _ _ All_Types _ = true
blanchet@42682
   484
  | should_encode_type ctxt _ Finite_Types T = is_type_surely_finite ctxt T
blanchet@42682
   485
  | should_encode_type _ nonmono_Ts Nonmonotonic_Types T =
blanchet@42682
   486
    exists (curry Type.raw_instance T) nonmono_Ts
blanchet@42682
   487
  | should_encode_type _ _ _ _ = false
blanchet@42682
   488
blanchet@42682
   489
fun should_predicate_on_type ctxt nonmono_Ts (Preds (_, level)) T =
blanchet@42682
   490
    should_encode_type ctxt nonmono_Ts level T
blanchet@42682
   491
  | should_predicate_on_type _ _ _ _ = false
blanchet@42682
   492
blanchet@42682
   493
fun should_tag_with_type ctxt nonmono_Ts (Tags (_, level)) T =
blanchet@42682
   494
    should_encode_type ctxt nonmono_Ts level T
blanchet@42682
   495
  | should_tag_with_type _ _ _ _ = false
blanchet@42682
   496
blanchet@42682
   497
val homo_infinite_T = @{typ ind} (* any infinite type *)
blanchet@42682
   498
blanchet@42682
   499
fun homogenized_type ctxt nonmono_Ts level T =
blanchet@42682
   500
  if should_encode_type ctxt nonmono_Ts level T then T else homo_infinite_T
blanchet@42682
   501
blanchet@42573
   502
(** "hBOOL" and "hAPP" **)
blanchet@41313
   503
blanchet@42574
   504
type sym_info =
blanchet@42563
   505
  {pred_sym : bool, min_ary : int, max_ary : int, typ : typ option}
blanchet@42563
   506
blanchet@42574
   507
fun add_combterm_syms_to_table explicit_apply =
blanchet@42558
   508
  let
blanchet@42558
   509
    fun aux top_level tm =
blanchet@42558
   510
      let val (head, args) = strip_combterm_comb tm in
blanchet@42558
   511
        (case head of
blanchet@42563
   512
           CombConst ((s, _), T, _) =>
blanchet@42558
   513
           if String.isPrefix bound_var_prefix s then
blanchet@42558
   514
             I
blanchet@42558
   515
           else
blanchet@42563
   516
             let val ary = length args in
blanchet@42558
   517
               Symtab.map_default
blanchet@42558
   518
                   (s, {pred_sym = true,
blanchet@42563
   519
                        min_ary = if explicit_apply then 0 else ary,
blanchet@42563
   520
                        max_ary = 0, typ = SOME T})
blanchet@42563
   521
                   (fn {pred_sym, min_ary, max_ary, typ} =>
blanchet@42558
   522
                       {pred_sym = pred_sym andalso top_level,
blanchet@42563
   523
                        min_ary = Int.min (ary, min_ary),
blanchet@42563
   524
                        max_ary = Int.max (ary, max_ary),
blanchet@42563
   525
                        typ = if typ = SOME T then typ else NONE})
blanchet@42558
   526
            end
blanchet@42558
   527
         | _ => I)
blanchet@42558
   528
        #> fold (aux false) args
blanchet@42558
   529
      end
blanchet@42558
   530
  in aux true end
blanchet@42674
   531
fun add_fact_syms_to_table explicit_apply =
blanchet@42680
   532
  fact_lift (formula_fold true (K (add_combterm_syms_to_table explicit_apply)))
blanchet@38282
   533
blanchet@42675
   534
val default_sym_table_entries : (string * sym_info) list =
blanchet@42563
   535
  [("equal", {pred_sym = true, min_ary = 2, max_ary = 2, typ = NONE}),
blanchet@42568
   536
   (make_fixed_const predicator_base,
blanchet@42563
   537
    {pred_sym = true, min_ary = 1, max_ary = 1, typ = NONE})] @
blanchet@42568
   538
  ([tptp_false, tptp_true]
blanchet@42563
   539
   |> map (rpair {pred_sym = true, min_ary = 0, max_ary = 0, typ = NONE}))
blanchet@41140
   540
blanchet@42544
   541
fun sym_table_for_facts explicit_apply facts =
blanchet@42568
   542
  Symtab.empty |> fold Symtab.default default_sym_table_entries
blanchet@42574
   543
               |> fold (add_fact_syms_to_table explicit_apply) facts
blanchet@38282
   544
blanchet@42558
   545
fun min_arity_of sym_tab s =
blanchet@42558
   546
  case Symtab.lookup sym_tab s of
blanchet@42574
   547
    SOME ({min_ary, ...} : sym_info) => min_ary
blanchet@42558
   548
  | NONE =>
blanchet@42558
   549
    case strip_prefix_and_unascii const_prefix s of
blanchet@42547
   550
      SOME s =>
blanchet@42570
   551
      let val s = s |> unmangled_const_name |> invert_const in
blanchet@42568
   552
        if s = predicator_base then 1
blanchet@42547
   553
        else if s = explicit_app_base then 2
blanchet@42547
   554
        else if s = type_pred_base then 1
blanchet@42557
   555
        else 0
blanchet@42547
   556
      end
blanchet@42544
   557
    | NONE => 0
blanchet@38282
   558
blanchet@38282
   559
(* True if the constant ever appears outside of the top-level position in
blanchet@38282
   560
   literals, or if it appears with different arities (e.g., because of different
blanchet@38282
   561
   type instantiations). If false, the constant always receives all of its
blanchet@38282
   562
   arguments and is used as a predicate. *)
blanchet@42558
   563
fun is_pred_sym sym_tab s =
blanchet@42558
   564
  case Symtab.lookup sym_tab s of
blanchet@42574
   565
    SOME ({pred_sym, min_ary, max_ary, ...} : sym_info) =>
blanchet@42574
   566
    pred_sym andalso min_ary = max_ary
blanchet@42558
   567
  | NONE => false
blanchet@38282
   568
blanchet@42568
   569
val predicator_combconst =
blanchet@42568
   570
  CombConst (`make_fixed_const predicator_base, @{typ "bool => bool"}, [])
blanchet@42568
   571
fun predicator tm = CombApp (predicator_combconst, tm)
blanchet@42542
   572
blanchet@42568
   573
fun introduce_predicators_in_combterm sym_tab tm =
blanchet@42542
   574
  case strip_combterm_comb tm of
blanchet@42542
   575
    (CombConst ((s, _), _, _), _) =>
blanchet@42568
   576
    if is_pred_sym sym_tab s then tm else predicator tm
blanchet@42568
   577
  | _ => predicator tm
blanchet@42542
   578
blanchet@42544
   579
fun list_app head args = fold (curry (CombApp o swap)) args head
blanchet@42544
   580
blanchet@42544
   581
fun explicit_app arg head =
blanchet@42544
   582
  let
blanchet@42562
   583
    val head_T = combtyp_of head
blanchet@42693
   584
    val (arg_T, res_T) = dest_funT head_T
blanchet@42544
   585
    val explicit_app =
blanchet@42562
   586
      CombConst (`make_fixed_const explicit_app_base, head_T --> head_T,
blanchet@42693
   587
                 [arg_T, res_T])
blanchet@42544
   588
  in list_app explicit_app [head, arg] end
blanchet@42544
   589
fun list_explicit_app head args = fold explicit_app args head
blanchet@38282
   590
blanchet@42565
   591
fun introduce_explicit_apps_in_combterm sym_tab =
blanchet@42544
   592
  let
blanchet@42544
   593
    fun aux tm =
blanchet@42544
   594
      case strip_combterm_comb tm of
blanchet@42544
   595
        (head as CombConst ((s, _), _, _), args) =>
blanchet@42544
   596
        args |> map aux
blanchet@42557
   597
             |> chop (min_arity_of sym_tab s)
blanchet@42544
   598
             |>> list_app head
blanchet@42544
   599
             |-> list_explicit_app
blanchet@42544
   600
      | (head, args) => list_explicit_app head (map aux args)
blanchet@42544
   601
  in aux end
blanchet@38282
   602
blanchet@42753
   603
fun chop_fun 0 T = ([], T)
blanchet@42753
   604
  | chop_fun n (Type (@{type_name fun}, [dom_T, ran_T])) =
blanchet@42753
   605
    chop_fun (n - 1) ran_T |>> cons dom_T
blanchet@42753
   606
  | chop_fun _ _ = raise Fail "unexpected non-function"
blanchet@42753
   607
blanchet@42753
   608
fun filter_type_args thy s arity T_args =
blanchet@42573
   609
  let
blanchet@42753
   610
    val U = s |> Sign.the_const_type thy (* may throw "TYPE" *)
blanchet@42753
   611
    val res_U = U |> chop_fun arity |> snd
blanchet@42753
   612
    val res_U_vars = Term.add_tvarsT res_U []
blanchet@42753
   613
    val U_args = (s, U) |> Sign.const_typargs thy
blanchet@42753
   614
  in
blanchet@42753
   615
    U_args ~~ T_args
blanchet@42753
   616
    |> map_filter (fn (U, T) =>
blanchet@42753
   617
                      if member (op =) res_U_vars (dest_TVar U) then SOME T
blanchet@42753
   618
                      else NONE)
blanchet@42753
   619
  end
blanchet@42753
   620
  handle TYPE _ => T_args
blanchet@42753
   621
blanchet@42753
   622
fun enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys =
blanchet@42753
   623
  let
blanchet@42753
   624
    val thy = Proof_Context.theory_of ctxt
blanchet@42753
   625
    fun aux arity (CombApp (tm1, tm2)) =
blanchet@42753
   626
        CombApp (aux (arity + 1) tm1, aux 0 tm2)
blanchet@42753
   627
      | aux arity (CombConst (name as (s, _), T, T_args)) =
blanchet@42701
   628
        let
blanchet@42701
   629
          val level = level_of_type_sys type_sys
blanchet@42701
   630
          val (T, T_args) =
blanchet@42701
   631
            (* Aggressively merge most "hAPPs" if the type system is unsound
blanchet@42701
   632
               anyway, by distinguishing overloads only on the homogenized
blanchet@42701
   633
               result type. *)
blanchet@42701
   634
            if s = const_prefix ^ explicit_app_base andalso
blanchet@42726
   635
               length T_args = 2 andalso
blanchet@42701
   636
               not (is_type_sys_virtually_sound type_sys) then
blanchet@42701
   637
              T_args |> map (homogenized_type ctxt nonmono_Ts level)
blanchet@42701
   638
                     |> (fn Ts => let val T = hd Ts --> nth Ts 1 in
blanchet@42753
   639
                                    (T --> T, tl Ts) (* ### FIXME: need tl? *)
blanchet@42701
   640
                                  end)
blanchet@42701
   641
            else
blanchet@42701
   642
              (T, T_args)
blanchet@42701
   643
        in
blanchet@42701
   644
          (case strip_prefix_and_unascii const_prefix s of
blanchet@42701
   645
             NONE => (name, T_args)
blanchet@42701
   646
           | SOME s'' =>
blanchet@42753
   647
             let
blanchet@42753
   648
               val s'' = invert_const s''
blanchet@42753
   649
               fun filtered_T_args true = T_args
blanchet@42753
   650
                 | filtered_T_args false = filter_type_args thy s'' arity T_args
blanchet@42753
   651
             in
blanchet@42701
   652
               case type_arg_policy type_sys s'' of
blanchet@42753
   653
                 Explicit_Type_Args keep_all => (name, filtered_T_args keep_all)
blanchet@42753
   654
               | Mangled_Type_Args keep_all =>
blanchet@42753
   655
                 (mangled_const_name (filtered_T_args keep_all) name, [])
blanchet@42753
   656
               | No_Type_Args => (name, [])
blanchet@42701
   657
             end)
blanchet@42701
   658
          |> (fn (name, T_args) => CombConst (name, T, T_args))
blanchet@42701
   659
        end
blanchet@42753
   660
      | aux _ tm = tm
blanchet@42753
   661
  in aux 0 end
blanchet@42573
   662
blanchet@42701
   663
fun repair_combterm ctxt nonmono_Ts type_sys sym_tab =
blanchet@42565
   664
  introduce_explicit_apps_in_combterm sym_tab
blanchet@42568
   665
  #> introduce_predicators_in_combterm sym_tab
blanchet@42753
   666
  #> enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys
blanchet@42701
   667
fun repair_fact ctxt nonmono_Ts type_sys sym_tab =
blanchet@42701
   668
  update_combformula (formula_map
blanchet@42701
   669
      (repair_combterm ctxt nonmono_Ts type_sys sym_tab))
blanchet@42573
   670
blanchet@42573
   671
(** Helper facts **)
blanchet@42573
   672
blanchet@42573
   673
fun ti_ti_helper_fact () =
blanchet@42573
   674
  let
blanchet@42573
   675
    fun var s = ATerm (`I s, [])
blanchet@42589
   676
    fun tag tm = ATerm (`make_fixed_const type_tag_name, [var "X", tm])
blanchet@42573
   677
  in
blanchet@42612
   678
    Formula (helper_prefix ^ "ti_ti", Axiom,
blanchet@42573
   679
             AAtom (ATerm (`I "equal", [tag (tag (var "Y")), tag (var "Y")]))
blanchet@42573
   680
             |> close_formula_universally, NONE, NONE)
blanchet@42573
   681
  end
blanchet@42573
   682
blanchet@42574
   683
fun helper_facts_for_sym ctxt type_sys (s, {typ, ...} : sym_info) =
blanchet@42573
   684
  case strip_prefix_and_unascii const_prefix s of
blanchet@42573
   685
    SOME mangled_s =>
blanchet@42573
   686
    let
blanchet@42573
   687
      val thy = Proof_Context.theory_of ctxt
blanchet@42573
   688
      val unmangled_s = mangled_s |> unmangled_const_name
blanchet@42579
   689
      fun dub_and_inst c needs_some_types (th, j) =
blanchet@42579
   690
        ((c ^ "_" ^ string_of_int j ^ (if needs_some_types then "T" else ""),
blanchet@42640
   691
          Chained),
blanchet@42573
   692
         let val t = th |> prop_of in
blanchet@42753
   693
           t |> ((case general_type_arg_policy type_sys of
blanchet@42753
   694
                    Mangled_Type_Args _ => true
blanchet@42753
   695
                  | _ => false) andalso
blanchet@42573
   696
                 not (null (Term.hidden_polymorphism t)))
blanchet@42573
   697
                ? (case typ of
blanchet@42573
   698
                     SOME T => specialize_type thy (invert_const unmangled_s, T)
blanchet@42573
   699
                   | NONE => I)
blanchet@42573
   700
         end)
blanchet@42573
   701
      fun make_facts eq_as_iff =
blanchet@42573
   702
        map_filter (make_fact ctxt false eq_as_iff false)
blanchet@42589
   703
      val has_some_types = is_type_sys_fairly_sound type_sys
blanchet@42573
   704
    in
blanchet@42573
   705
      metis_helpers
blanchet@42579
   706
      |> maps (fn (metis_s, (needs_some_types, ths)) =>
blanchet@42573
   707
                  if metis_s <> unmangled_s orelse
blanchet@42589
   708
                     (needs_some_types andalso not has_some_types) then
blanchet@42573
   709
                    []
blanchet@42573
   710
                  else
blanchet@42573
   711
                    ths ~~ (1 upto length ths)
blanchet@42579
   712
                    |> map (dub_and_inst mangled_s needs_some_types)
blanchet@42579
   713
                    |> make_facts (not needs_some_types))
blanchet@42573
   714
    end
blanchet@42573
   715
  | NONE => []
blanchet@42573
   716
fun helper_facts_for_sym_table ctxt type_sys sym_tab =
blanchet@42573
   717
  Symtab.fold_rev (append o helper_facts_for_sym ctxt type_sys) sym_tab []
blanchet@42573
   718
blanchet@42573
   719
fun translate_atp_fact ctxt keep_trivial =
blanchet@42573
   720
  `(make_fact ctxt keep_trivial true true o apsnd prop_of)
blanchet@42573
   721
blanchet@42709
   722
fun translate_formulas ctxt prem_kind type_sys hyp_ts concl_t rich_facts =
blanchet@42573
   723
  let
blanchet@42573
   724
    val thy = Proof_Context.theory_of ctxt
blanchet@42573
   725
    val fact_ts = map (prop_of o snd o snd) rich_facts
blanchet@42573
   726
    val (facts, fact_names) =
blanchet@42573
   727
      rich_facts
blanchet@42573
   728
      |> map_filter (fn (NONE, _) => NONE
blanchet@42573
   729
                      | (SOME fact, (name, _)) => SOME (fact, name))
blanchet@42573
   730
      |> ListPair.unzip
blanchet@42573
   731
    (* Remove existing facts from the conjecture, as this can dramatically
blanchet@42573
   732
       boost an ATP's performance (for some reason). *)
blanchet@42573
   733
    val hyp_ts = hyp_ts |> filter_out (member (op aconv) fact_ts)
blanchet@42573
   734
    val goal_t = Logic.list_implies (hyp_ts, concl_t)
blanchet@42573
   735
    val all_ts = goal_t :: fact_ts
blanchet@42573
   736
    val subs = tfree_classes_of_terms all_ts
blanchet@42573
   737
    val supers = tvar_classes_of_terms all_ts
blanchet@42573
   738
    val tycons = type_consts_of_terms thy all_ts
blanchet@42709
   739
    val conjs = make_conjecture ctxt prem_kind (hyp_ts @ [concl_t])
blanchet@42573
   740
    val (supers', arity_clauses) =
blanchet@42589
   741
      if level_of_type_sys type_sys = No_Types then ([], [])
blanchet@42573
   742
      else make_arity_clauses thy tycons supers
blanchet@42573
   743
    val class_rel_clauses = make_class_rel_clauses thy subs supers'
blanchet@42573
   744
  in
blanchet@42573
   745
    (fact_names |> map single, (conjs, facts, class_rel_clauses, arity_clauses))
blanchet@42573
   746
  end
blanchet@42573
   747
blanchet@42573
   748
fun fo_literal_from_type_literal (TyLitVar (class, name)) =
blanchet@42573
   749
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
   750
  | fo_literal_from_type_literal (TyLitFree (class, name)) =
blanchet@42573
   751
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@42573
   752
blanchet@42573
   753
fun formula_from_fo_literal (pos, t) = AAtom t |> not pos ? mk_anot
blanchet@42573
   754
blanchet@42701
   755
fun type_pred_combatom ctxt nonmono_Ts type_sys T tm =
blanchet@42573
   756
  CombApp (CombConst (`make_fixed_const type_pred_base, T --> @{typ bool}, [T]),
blanchet@42573
   757
           tm)
blanchet@42753
   758
  |> enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys
blanchet@42573
   759
  |> AAtom
blanchet@42573
   760
blanchet@42680
   761
fun formula_from_combformula ctxt nonmono_Ts type_sys =
blanchet@42573
   762
  let
blanchet@42589
   763
    fun tag_with_type type_sys T tm =
blanchet@42589
   764
      CombConst (`make_fixed_const type_tag_name, T --> T, [T])
blanchet@42753
   765
      |> enforce_type_arg_policy_in_combterm ctxt nonmono_Ts type_sys
blanchet@42589
   766
      |> do_term true
blanchet@42589
   767
      |> (fn ATerm (s, tms) => ATerm (s, tms @ [tm]))
blanchet@42589
   768
    and do_term top_level u =
blanchet@42573
   769
      let
blanchet@42573
   770
        val (head, args) = strip_combterm_comb u
blanchet@42574
   771
        val (x, T_args) =
blanchet@42573
   772
          case head of
blanchet@42574
   773
            CombConst (name, _, T_args) => (name, T_args)
blanchet@42573
   774
          | CombVar (name, _) => (name, [])
blanchet@42573
   775
          | CombApp _ => raise Fail "impossible \"CombApp\""
blanchet@42574
   776
        val t = ATerm (x, map fo_term_from_typ T_args @
blanchet@42573
   777
                          map (do_term false) args)
blanchet@42574
   778
        val T = combtyp_of u
blanchet@42573
   779
      in
blanchet@42680
   780
        t |> (if not top_level andalso
blanchet@42680
   781
                should_tag_with_type ctxt nonmono_Ts type_sys T then
blanchet@42589
   782
                tag_with_type type_sys T
blanchet@42573
   783
              else
blanchet@42573
   784
                I)
blanchet@42573
   785
      end
blanchet@42573
   786
    val do_bound_type =
blanchet@42682
   787
      case type_sys of
blanchet@42722
   788
        Simple_Types level =>
blanchet@42682
   789
        SOME o mangled_type_name o homogenized_type ctxt nonmono_Ts level
blanchet@42682
   790
      | _ => K NONE
blanchet@42573
   791
    fun do_out_of_bound_type (s, T) =
blanchet@42680
   792
      if should_predicate_on_type ctxt nonmono_Ts type_sys T then
blanchet@42701
   793
        type_pred_combatom ctxt nonmono_Ts type_sys T (CombVar (s, T))
blanchet@42573
   794
        |> do_formula |> SOME
blanchet@42573
   795
      else
blanchet@42573
   796
        NONE
blanchet@42573
   797
    and do_formula (AQuant (q, xs, phi)) =
blanchet@42573
   798
        AQuant (q, xs |> map (apsnd (fn NONE => NONE
blanchet@42574
   799
                                      | SOME T => do_bound_type T)),
blanchet@42573
   800
                (if q = AForall then mk_ahorn else fold_rev (mk_aconn AAnd))
blanchet@42573
   801
                    (map_filter
blanchet@42573
   802
                         (fn (_, NONE) => NONE
blanchet@42574
   803
                           | (s, SOME T) => do_out_of_bound_type (s, T)) xs)
blanchet@42573
   804
                    (do_formula phi))
blanchet@42573
   805
      | do_formula (AConn (c, phis)) = AConn (c, map do_formula phis)
blanchet@42573
   806
      | do_formula (AAtom tm) = AAtom (do_term true tm)
blanchet@42573
   807
  in do_formula end
blanchet@42573
   808
blanchet@42727
   809
fun bound_atomic_types type_sys Ts =
blanchet@42727
   810
  mk_ahorn (map (formula_from_fo_literal o fo_literal_from_type_literal)
blanchet@42727
   811
                (atp_type_literals_for_types type_sys Axiom Ts))
blanchet@42727
   812
blanchet@42680
   813
fun formula_for_fact ctxt nonmono_Ts type_sys
blanchet@42573
   814
                     ({combformula, atomic_types, ...} : translated_formula) =
blanchet@42727
   815
  combformula
blanchet@42727
   816
  |> close_combformula_universally
blanchet@42727
   817
  |> formula_from_combformula ctxt nonmono_Ts type_sys
blanchet@42727
   818
  |> bound_atomic_types type_sys atomic_types
blanchet@42573
   819
  |> close_formula_universally
blanchet@42573
   820
blanchet@42640
   821
fun useful_isabelle_info s = SOME (ATerm ("[]", [ATerm ("isabelle_" ^ s, [])]))
blanchet@42640
   822
blanchet@42573
   823
(* Each fact is given a unique fact number to avoid name clashes (e.g., because
blanchet@42573
   824
   of monomorphization). The TPTP explicitly forbids name clashes, and some of
blanchet@42573
   825
   the remote provers might care. *)
blanchet@42680
   826
fun formula_line_for_fact ctxt prefix nonmono_Ts type_sys
blanchet@42640
   827
                          (j, formula as {name, locality, kind, ...}) =
blanchet@42680
   828
  Formula (prefix ^ (if polymorphism_of_type_sys type_sys = Polymorphic then ""
blanchet@42680
   829
                     else string_of_int j ^ "_") ^
blanchet@42647
   830
           ascii_of name,
blanchet@42680
   831
           kind, formula_for_fact ctxt nonmono_Ts type_sys formula, NONE,
blanchet@42640
   832
           if generate_useful_info then
blanchet@42640
   833
             case locality of
blanchet@42640
   834
               Intro => useful_isabelle_info "intro"
blanchet@42640
   835
             | Elim => useful_isabelle_info "elim"
blanchet@42640
   836
             | Simp => useful_isabelle_info "simp"
blanchet@42640
   837
             | _ => NONE
blanchet@42640
   838
           else
blanchet@42640
   839
             NONE)
blanchet@42573
   840
blanchet@42573
   841
fun formula_line_for_class_rel_clause (ClassRelClause {name, subclass,
blanchet@42573
   842
                                                       superclass, ...}) =
blanchet@42573
   843
  let val ty_arg = ATerm (`I "T", []) in
blanchet@42577
   844
    Formula (class_rel_clause_prefix ^ ascii_of name, Axiom,
blanchet@42573
   845
             AConn (AImplies, [AAtom (ATerm (subclass, [ty_arg])),
blanchet@42573
   846
                               AAtom (ATerm (superclass, [ty_arg]))])
blanchet@42573
   847
             |> close_formula_universally, NONE, NONE)
blanchet@42573
   848
  end
blanchet@42573
   849
blanchet@42573
   850
fun fo_literal_from_arity_literal (TConsLit (c, t, args)) =
blanchet@42573
   851
    (true, ATerm (c, [ATerm (t, map (fn arg => ATerm (arg, [])) args)]))
blanchet@42573
   852
  | fo_literal_from_arity_literal (TVarLit (c, sort)) =
blanchet@42573
   853
    (false, ATerm (c, [ATerm (sort, [])]))
blanchet@42573
   854
blanchet@42573
   855
fun formula_line_for_arity_clause (ArityClause {name, conclLit, premLits,
blanchet@42573
   856
                                                ...}) =
blanchet@42577
   857
  Formula (arity_clause_prefix ^ ascii_of name, Axiom,
blanchet@42573
   858
           mk_ahorn (map (formula_from_fo_literal o apfst not
blanchet@42573
   859
                          o fo_literal_from_arity_literal) premLits)
blanchet@42573
   860
                    (formula_from_fo_literal
blanchet@42573
   861
                         (fo_literal_from_arity_literal conclLit))
blanchet@42573
   862
           |> close_formula_universally, NONE, NONE)
blanchet@42573
   863
blanchet@42680
   864
fun formula_line_for_conjecture ctxt nonmono_Ts type_sys
blanchet@42573
   865
        ({name, kind, combformula, ...} : translated_formula) =
blanchet@42577
   866
  Formula (conjecture_prefix ^ name, kind,
blanchet@42680
   867
           formula_from_combformula ctxt nonmono_Ts type_sys
blanchet@42573
   868
                                    (close_combformula_universally combformula)
blanchet@42573
   869
           |> close_formula_universally, NONE, NONE)
blanchet@42573
   870
blanchet@42573
   871
fun free_type_literals type_sys ({atomic_types, ...} : translated_formula) =
blanchet@42573
   872
  atomic_types |> atp_type_literals_for_types type_sys Conjecture
blanchet@42573
   873
               |> map fo_literal_from_type_literal
blanchet@42573
   874
blanchet@42573
   875
fun formula_line_for_free_type j lit =
blanchet@42577
   876
  Formula (tfree_prefix ^ string_of_int j, Hypothesis,
blanchet@42573
   877
           formula_from_fo_literal lit, NONE, NONE)
blanchet@42573
   878
fun formula_lines_for_free_types type_sys facts =
blanchet@42573
   879
  let
blanchet@42573
   880
    val litss = map (free_type_literals type_sys) facts
blanchet@42573
   881
    val lits = fold (union (op =)) litss []
blanchet@42573
   882
  in map2 formula_line_for_free_type (0 upto length lits - 1) lits end
blanchet@42573
   883
blanchet@42573
   884
(** Symbol declarations **)
blanchet@42544
   885
blanchet@42677
   886
fun insert_type get_T x xs =
blanchet@42677
   887
  let val T = get_T x in
blanchet@42677
   888
    if exists (curry Type.raw_instance T o get_T) xs then xs
blanchet@42677
   889
    else x :: filter_out ((fn T' => Type.raw_instance (T', T)) o get_T) xs
blanchet@42677
   890
  end
blanchet@42677
   891
blanchet@42574
   892
fun should_declare_sym type_sys pred_sym s =
blanchet@42542
   893
  not (String.isPrefix bound_var_prefix s) andalso s <> "equal" andalso
blanchet@42753
   894
  not (String.isPrefix tptp_special_prefix s) andalso
blanchet@42722
   895
  ((case type_sys of Simple_Types _ => true | _ => false) orelse not pred_sym)
blanchet@38282
   896
blanchet@42698
   897
fun sym_decl_table_for_facts type_sys repaired_sym_tab (conjs, facts) =
blanchet@42574
   898
  let
blanchet@42698
   899
    fun add_combterm in_conj tm =
blanchet@42574
   900
      let val (head, args) = strip_combterm_comb tm in
blanchet@42574
   901
        (case head of
blanchet@42574
   902
           CombConst ((s, s'), T, T_args) =>
blanchet@42574
   903
           let val pred_sym = is_pred_sym repaired_sym_tab s in
blanchet@42574
   904
             if should_declare_sym type_sys pred_sym s then
blanchet@42576
   905
               Symtab.map_default (s, [])
blanchet@42698
   906
                   (insert_type #3 (s', T_args, T, pred_sym, length args,
blanchet@42698
   907
                                    in_conj))
blanchet@42574
   908
             else
blanchet@42574
   909
               I
blanchet@42574
   910
           end
blanchet@42574
   911
         | _ => I)
blanchet@42698
   912
        #> fold (add_combterm in_conj) args
blanchet@42574
   913
      end
blanchet@42698
   914
    fun add_fact in_conj =
blanchet@42698
   915
      fact_lift (formula_fold true (K (add_combterm in_conj)))
blanchet@42698
   916
  in
blanchet@42698
   917
    Symtab.empty
blanchet@42698
   918
    |> is_type_sys_fairly_sound type_sys
blanchet@42698
   919
       ? (fold (add_fact true) conjs #> fold (add_fact false) facts)
blanchet@42698
   920
  end
blanchet@42533
   921
blanchet@42677
   922
fun is_var_or_bound_var (CombConst ((s, _), _, _)) =
blanchet@42677
   923
    String.isPrefix bound_var_prefix s
blanchet@42677
   924
  | is_var_or_bound_var (CombVar _) = true
blanchet@42677
   925
  | is_var_or_bound_var _ = false
blanchet@42677
   926
blanchet@42685
   927
(* This inference is described in section 2.3 of Claessen et al.'s "Sorting it
blanchet@42685
   928
   out with monotonicity" paper presented at CADE 2011. *)
blanchet@42680
   929
fun add_combterm_nonmonotonic_types _ (SOME false) _ = I
blanchet@42680
   930
  | add_combterm_nonmonotonic_types ctxt _
blanchet@42680
   931
        (CombApp (CombApp (CombConst (("equal", _), Type (_, [T, _]), _), tm1),
blanchet@42680
   932
                  tm2)) =
blanchet@42680
   933
    (exists is_var_or_bound_var [tm1, tm2] andalso
blanchet@42680
   934
     not (is_type_surely_infinite ctxt T)) ? insert_type I T
blanchet@42680
   935
  | add_combterm_nonmonotonic_types _ _ _ = I
blanchet@42680
   936
fun add_fact_nonmonotonic_types ctxt ({kind, combformula, ...}
blanchet@42680
   937
                                      : translated_formula) =
blanchet@42680
   938
  formula_fold (kind <> Conjecture) (add_combterm_nonmonotonic_types ctxt)
blanchet@42680
   939
               combformula
blanchet@42680
   940
fun add_nonmonotonic_types_for_facts ctxt type_sys facts =
blanchet@42680
   941
  level_of_type_sys type_sys = Nonmonotonic_Types
blanchet@42731
   942
  ? (fold (add_fact_nonmonotonic_types ctxt) facts
blanchet@42731
   943
     (* in case helper "True_or_False" is included *)
blanchet@42731
   944
     #> insert_type I @{typ bool})
blanchet@42677
   945
blanchet@42753
   946
fun result_type_of_decl (_, _, T, _, ary, _) = chop_fun ary T |> snd
blanchet@42579
   947
blanchet@42754
   948
fun decl_line_for_sym ctxt nonmono_Ts level s (s', _, T, pred_sym, ary, _) =
blanchet@42754
   949
  let
blanchet@42754
   950
    val translate_type =
blanchet@42754
   951
      mangled_type_name o homogenized_type ctxt nonmono_Ts level
blanchet@42754
   952
    val (arg_tys, res_ty) =
blanchet@42754
   953
      T |> chop_fun ary |>> map translate_type ||> translate_type
blanchet@42754
   954
  in
blanchet@42754
   955
    Decl (sym_decl_prefix ^ s, (s, s'), arg_tys,
blanchet@42754
   956
          if pred_sym then `I tptp_tff_bool_type else res_ty)
blanchet@42579
   957
  end
blanchet@42579
   958
blanchet@42592
   959
fun is_polymorphic_type T = fold_atyps (fn TVar _ => K true | _ => I) T false
blanchet@42592
   960
blanchet@42709
   961
fun formula_line_for_sym_decl ctxt conj_sym_kind nonmono_Ts type_sys n s j
blanchet@42698
   962
                              (s', T_args, T, _, ary, in_conj) =
blanchet@42579
   963
  let
blanchet@42709
   964
    val (kind, maybe_negate) =
blanchet@42709
   965
      if in_conj then (conj_sym_kind, conj_sym_kind = Conjecture ? mk_anot)
blanchet@42709
   966
      else (Axiom, I)
blanchet@42753
   967
    val (arg_Ts, res_T) = chop_fun ary T
blanchet@42579
   968
    val bound_names =
blanchet@42579
   969
      1 upto length arg_Ts |> map (`I o make_bound_var o string_of_int)
blanchet@42579
   970
    val bound_tms =
blanchet@42579
   971
      bound_names ~~ arg_Ts |> map (fn (name, T) => CombConst (name, T, []))
blanchet@42579
   972
    val bound_Ts =
blanchet@42592
   973
      arg_Ts |> map (fn T => if n > 1 orelse is_polymorphic_type T then SOME T
blanchet@42592
   974
                             else NONE)
blanchet@42579
   975
  in
blanchet@42612
   976
    Formula (sym_decl_prefix ^ s ^
blanchet@42709
   977
             (if n > 1 then "_" ^ string_of_int j else ""), kind,
blanchet@42579
   978
             CombConst ((s, s'), T, T_args)
blanchet@42579
   979
             |> fold (curry (CombApp o swap)) bound_tms
blanchet@42701
   980
             |> type_pred_combatom ctxt nonmono_Ts type_sys res_T
blanchet@42579
   981
             |> mk_aquant AForall (bound_names ~~ bound_Ts)
blanchet@42680
   982
             |> formula_from_combformula ctxt nonmono_Ts type_sys
blanchet@42727
   983
             |> n > 1 ? bound_atomic_types type_sys (atyps_of T)
blanchet@42709
   984
             |> close_formula_universally
blanchet@42709
   985
             |> maybe_negate,
blanchet@42579
   986
             NONE, NONE)
blanchet@42579
   987
  end
blanchet@42579
   988
blanchet@42709
   989
fun problem_lines_for_sym_decls ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42709
   990
                                (s, decls) =
blanchet@42682
   991
  case type_sys of
blanchet@42754
   992
    Simple_Types level => map (decl_line_for_sym ctxt nonmono_Ts level s) decls
blanchet@42682
   993
  | _ =>
blanchet@42574
   994
    let
blanchet@42579
   995
      val decls =
blanchet@42579
   996
        case decls of
blanchet@42579
   997
          decl :: (decls' as _ :: _) =>
blanchet@42592
   998
          let val T = result_type_of_decl decl in
blanchet@42592
   999
            if forall ((fn T' => Type.raw_instance (T', T))
blanchet@42592
  1000
                       o result_type_of_decl) decls' then
blanchet@42592
  1001
              [decl]
blanchet@42592
  1002
            else
blanchet@42592
  1003
              decls
blanchet@42592
  1004
          end
blanchet@42579
  1005
        | _ => decls
blanchet@42579
  1006
      val n = length decls
blanchet@42579
  1007
      val decls =
blanchet@42680
  1008
        decls |> filter (should_predicate_on_type ctxt nonmono_Ts type_sys
blanchet@42579
  1009
                         o result_type_of_decl)
blanchet@42574
  1010
    in
blanchet@42709
  1011
      (0 upto length decls - 1, decls)
blanchet@42709
  1012
      |-> map2 (formula_line_for_sym_decl ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42709
  1013
                                          n s)
blanchet@42574
  1014
    end
blanchet@42579
  1015
blanchet@42709
  1016
fun problem_lines_for_sym_decl_table ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42709
  1017
                                     sym_decl_tab =
blanchet@42709
  1018
  Symtab.fold_rev (append o problem_lines_for_sym_decls ctxt conj_sym_kind
blanchet@42709
  1019
                                                        nonmono_Ts type_sys)
blanchet@42574
  1020
                  sym_decl_tab []
blanchet@42543
  1021
blanchet@42543
  1022
fun add_tff_types_in_formula (AQuant (_, xs, phi)) =
blanchet@42543
  1023
    union (op =) (map_filter snd xs) #> add_tff_types_in_formula phi
blanchet@42543
  1024
  | add_tff_types_in_formula (AConn (_, phis)) =
blanchet@42543
  1025
    fold add_tff_types_in_formula phis
blanchet@42543
  1026
  | add_tff_types_in_formula (AAtom _) = I
blanchet@42539
  1027
blanchet@42562
  1028
fun add_tff_types_in_problem_line (Decl (_, _, arg_Ts, res_T)) =
blanchet@42562
  1029
    union (op =) (res_T :: arg_Ts)
blanchet@42577
  1030
  | add_tff_types_in_problem_line (Formula (_, _, phi, _, _)) =
blanchet@42543
  1031
    add_tff_types_in_formula phi
blanchet@42543
  1032
blanchet@42543
  1033
fun tff_types_in_problem problem =
blanchet@42543
  1034
  fold (fold add_tff_types_in_problem_line o snd) problem []
blanchet@42543
  1035
blanchet@42545
  1036
fun decl_line_for_tff_type (s, s') =
blanchet@42568
  1037
  Decl (type_decl_prefix ^ ascii_of s, (s, s'), [], `I tptp_tff_type_of_types)
blanchet@42543
  1038
blanchet@42543
  1039
val type_declsN = "Types"
blanchet@42544
  1040
val sym_declsN = "Symbol types"
blanchet@41157
  1041
val factsN = "Relevant facts"
blanchet@41157
  1042
val class_relsN = "Class relationships"
blanchet@42543
  1043
val aritiesN = "Arities"
blanchet@41157
  1044
val helpersN = "Helper facts"
blanchet@41157
  1045
val conjsN = "Conjectures"
blanchet@41313
  1046
val free_typesN = "Type variables"
blanchet@41157
  1047
blanchet@41157
  1048
fun offset_of_heading_in_problem _ [] j = j
blanchet@41157
  1049
  | offset_of_heading_in_problem needle ((heading, lines) :: problem) j =
blanchet@41157
  1050
    if heading = needle then j
blanchet@41157
  1051
    else offset_of_heading_in_problem needle problem (j + length lines)
blanchet@41157
  1052
blanchet@42709
  1053
fun prepare_atp_problem ctxt conj_sym_kind prem_kind type_sys explicit_apply
blanchet@42709
  1054
                        hyp_ts concl_t facts =
blanchet@38282
  1055
  let
blanchet@41313
  1056
    val (fact_names, (conjs, facts, class_rel_clauses, arity_clauses)) =
blanchet@42709
  1057
      translate_formulas ctxt prem_kind type_sys hyp_ts concl_t facts
blanchet@42563
  1058
    val sym_tab = conjs @ facts |> sym_table_for_facts explicit_apply
blanchet@42682
  1059
    val nonmono_Ts =
blanchet@42682
  1060
      [] |> fold (add_nonmonotonic_types_for_facts ctxt type_sys) [facts, conjs]
blanchet@42701
  1061
    val repair = repair_fact ctxt nonmono_Ts type_sys sym_tab
blanchet@42682
  1062
    val (conjs, facts) = (conjs, facts) |> pairself (map repair)
blanchet@42680
  1063
    val repaired_sym_tab = conjs @ facts |> sym_table_for_facts false
blanchet@42573
  1064
    val helpers =
blanchet@42682
  1065
      repaired_sym_tab |> helper_facts_for_sym_table ctxt type_sys |> map repair
blanchet@42680
  1066
    val sym_decl_lines =
blanchet@42731
  1067
      (conjs, helpers @ facts)
blanchet@42680
  1068
      |> sym_decl_table_for_facts type_sys repaired_sym_tab
blanchet@42709
  1069
      |> problem_lines_for_sym_decl_table ctxt conj_sym_kind nonmono_Ts type_sys
blanchet@42522
  1070
    (* Reordering these might confuse the proof reconstruction code or the SPASS
blanchet@42522
  1071
       Flotter hack. *)
blanchet@38282
  1072
    val problem =
blanchet@42561
  1073
      [(sym_declsN, sym_decl_lines),
blanchet@42680
  1074
       (factsN, map (formula_line_for_fact ctxt fact_prefix nonmono_Ts type_sys)
blanchet@42180
  1075
                    (0 upto length facts - 1 ~~ facts)),
blanchet@42545
  1076
       (class_relsN, map formula_line_for_class_rel_clause class_rel_clauses),
blanchet@42545
  1077
       (aritiesN, map formula_line_for_arity_clause arity_clauses),
blanchet@42680
  1078
       (helpersN, map (formula_line_for_fact ctxt helper_prefix nonmono_Ts
blanchet@42680
  1079
                                             type_sys)
blanchet@42563
  1080
                      (0 upto length helpers - 1 ~~ helpers)
blanchet@42579
  1081
                  |> (case type_sys of
blanchet@42589
  1082
                        Tags (Polymorphic, level) =>
blanchet@42687
  1083
                        is_type_level_partial level
blanchet@42589
  1084
                        ? cons (ti_ti_helper_fact ())
blanchet@42579
  1085
                      | _ => I)),
blanchet@42680
  1086
       (conjsN, map (formula_line_for_conjecture ctxt nonmono_Ts type_sys)
blanchet@42680
  1087
                    conjs),
blanchet@42545
  1088
       (free_typesN, formula_lines_for_free_types type_sys (facts @ conjs))]
blanchet@42543
  1089
    val problem =
blanchet@42561
  1090
      problem
blanchet@42682
  1091
      |> (case type_sys of
blanchet@42722
  1092
            Simple_Types _ =>
blanchet@42561
  1093
            cons (type_declsN,
blanchet@42561
  1094
                  map decl_line_for_tff_type (tff_types_in_problem problem))
blanchet@42682
  1095
          | _ => I)
blanchet@42646
  1096
    val (problem, pool) =
blanchet@42646
  1097
      problem |> nice_atp_problem (Config.get ctxt readable_names)
blanchet@42755
  1098
    fun add_sym_arity (s, {min_ary, ...}) =
blanchet@42755
  1099
      if min_ary > 0 then
blanchet@42755
  1100
        case strip_prefix_and_unascii const_prefix s of
blanchet@42755
  1101
          SOME s => Symtab.insert (op =) (s, min_ary)
blanchet@42755
  1102
        | NONE => I
blanchet@42755
  1103
      else
blanchet@42755
  1104
        I
blanchet@38282
  1105
  in
blanchet@38282
  1106
    (problem,
blanchet@38282
  1107
     case pool of SOME the_pool => snd the_pool | NONE => Symtab.empty,
blanchet@42585
  1108
     offset_of_heading_in_problem conjsN problem 0,
blanchet@42541
  1109
     offset_of_heading_in_problem factsN problem 0,
blanchet@42755
  1110
     fact_names |> Vector.fromList,
blanchet@42755
  1111
     Symtab.empty |> Symtab.fold add_sym_arity sym_tab)
blanchet@38282
  1112
  end
blanchet@38282
  1113
blanchet@41313
  1114
(* FUDGE *)
blanchet@41313
  1115
val conj_weight = 0.0
blanchet@41770
  1116
val hyp_weight = 0.1
blanchet@41770
  1117
val fact_min_weight = 0.2
blanchet@41313
  1118
val fact_max_weight = 1.0
blanchet@42608
  1119
val type_info_default_weight = 0.8
blanchet@41313
  1120
blanchet@41313
  1121
fun add_term_weights weight (ATerm (s, tms)) =
blanchet@42734
  1122
  (not (is_atp_variable s) andalso s <> "equal" andalso
blanchet@42753
  1123
   not (String.isPrefix tptp_special_prefix s)) ? Symtab.default (s, weight)
blanchet@41313
  1124
  #> fold (add_term_weights weight) tms
blanchet@42577
  1125
fun add_problem_line_weights weight (Formula (_, _, phi, _, _)) =
blanchet@42680
  1126
    formula_fold true (K (add_term_weights weight)) phi
blanchet@42528
  1127
  | add_problem_line_weights _ _ = I
blanchet@41313
  1128
blanchet@41313
  1129
fun add_conjectures_weights [] = I
blanchet@41313
  1130
  | add_conjectures_weights conjs =
blanchet@41313
  1131
    let val (hyps, conj) = split_last conjs in
blanchet@41313
  1132
      add_problem_line_weights conj_weight conj
blanchet@41313
  1133
      #> fold (add_problem_line_weights hyp_weight) hyps
blanchet@41313
  1134
    end
blanchet@41313
  1135
blanchet@41313
  1136
fun add_facts_weights facts =
blanchet@41313
  1137
  let
blanchet@41313
  1138
    val num_facts = length facts
blanchet@41313
  1139
    fun weight_of j =
blanchet@41313
  1140
      fact_min_weight + (fact_max_weight - fact_min_weight) * Real.fromInt j
blanchet@41313
  1141
                        / Real.fromInt num_facts
blanchet@41313
  1142
  in
blanchet@41313
  1143
    map weight_of (0 upto num_facts - 1) ~~ facts
blanchet@41313
  1144
    |> fold (uncurry add_problem_line_weights)
blanchet@41313
  1145
  end
blanchet@41313
  1146
blanchet@41313
  1147
(* Weights are from 0.0 (most important) to 1.0 (least important). *)
blanchet@41313
  1148
fun atp_problem_weights problem =
blanchet@42608
  1149
  let val get = these o AList.lookup (op =) problem in
blanchet@42608
  1150
    Symtab.empty
blanchet@42608
  1151
    |> add_conjectures_weights (get free_typesN @ get conjsN)
blanchet@42608
  1152
    |> add_facts_weights (get factsN)
blanchet@42608
  1153
    |> fold (fold (add_problem_line_weights type_info_default_weight) o get)
blanchet@42608
  1154
            [sym_declsN, class_relsN, aritiesN]
blanchet@42608
  1155
    |> Symtab.dest
blanchet@42608
  1156
    |> sort (prod_ord Real.compare string_ord o pairself swap)
blanchet@42608
  1157
  end
blanchet@41313
  1158
blanchet@38282
  1159
end;