src/HOL/Tools/Sledgehammer/sledgehammer_atp_translate.ML
author blanchet
Wed Dec 15 11:26:28 2010 +0100 (2010-12-15)
changeset 41136 30bedf58b177
parent 41134 de9e0adc21da
child 41137 8b634031b2a5
permissions -rw-r--r--
implemented new type system encoding "overload_args", which is more lightweight than "const_args" (the unsound default) and hopefully almost as sound
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@38282
    11
  type 'a problem = 'a ATP_Problem.problem
blanchet@40114
    12
  type translated_formula
blanchet@38282
    13
blanchet@41134
    14
  datatype type_system =
blanchet@41134
    15
    Tags of bool |
blanchet@41134
    16
    Preds of bool |
blanchet@41134
    17
    Const_Args |
blanchet@41134
    18
    Overload_Args |
blanchet@41134
    19
    No_Types
blanchet@41134
    20
blanchet@40204
    21
  val fact_prefix : string
blanchet@38282
    22
  val conjecture_prefix : string
blanchet@41136
    23
  val is_fully_typed : type_system -> bool
blanchet@41136
    24
  val num_atp_type_args : theory -> type_system -> string -> int
blanchet@41088
    25
  val translate_atp_fact :
blanchet@39005
    26
    Proof.context -> (string * 'a) * thm
blanchet@41091
    27
    -> translated_formula option * ((string * 'a) * thm)
blanchet@40059
    28
  val prepare_atp_problem :
blanchet@41134
    29
    Proof.context -> bool -> bool -> type_system -> bool -> term list -> term
blanchet@41091
    30
    -> (translated_formula option * ((string * 'a) * thm)) list
blanchet@38818
    31
    -> string problem * string Symtab.table * int * (string * 'a) list vector
blanchet@38282
    32
end;
blanchet@38282
    33
blanchet@40068
    34
structure Sledgehammer_ATP_Translate : SLEDGEHAMMER_ATP_TRANSLATE =
blanchet@38282
    35
struct
blanchet@38282
    36
blanchet@38282
    37
open ATP_Problem
blanchet@39494
    38
open Metis_Translate
blanchet@38282
    39
open Sledgehammer_Util
blanchet@38282
    40
blanchet@40204
    41
val fact_prefix = "fact_"
blanchet@38282
    42
val conjecture_prefix = "conj_"
blanchet@38282
    43
val helper_prefix = "help_"
blanchet@38282
    44
val class_rel_clause_prefix = "clrel_";
blanchet@38282
    45
val arity_clause_prefix = "arity_"
blanchet@39975
    46
val tfree_prefix = "tfree_"
blanchet@38282
    47
blanchet@38282
    48
(* Freshness almost guaranteed! *)
blanchet@38282
    49
val sledgehammer_weak_prefix = "Sledgehammer:"
blanchet@38282
    50
blanchet@40114
    51
type translated_formula =
blanchet@38752
    52
  {name: string,
blanchet@38752
    53
   kind: kind,
blanchet@38752
    54
   combformula: (name, combterm) formula,
blanchet@38752
    55
   ctypes_sorts: typ list}
blanchet@38282
    56
blanchet@41134
    57
datatype type_system =
blanchet@41134
    58
  Tags of bool |
blanchet@41134
    59
  Preds of bool |
blanchet@41134
    60
  Const_Args |
blanchet@41134
    61
  Overload_Args |
blanchet@41134
    62
  No_Types
blanchet@41134
    63
blanchet@41134
    64
fun is_fully_typed (Tags full_types) = full_types
blanchet@41134
    65
  | is_fully_typed (Preds full_types) = full_types
blanchet@41134
    66
  | is_fully_typed _ = false
blanchet@41134
    67
blanchet@41136
    68
(* This is an approximation. If it returns "true" for a constant that isn't
blanchet@41136
    69
   overloaded (i.e., that has one uniform definition), needless clutter is
blanchet@41136
    70
   generated; if it returns "false" for an overloaded constant, the ATP gets a
blanchet@41136
    71
   license to do unsound reasoning if the type system is "overloaded_args". *)
blanchet@41136
    72
fun is_overloaded thy s =
blanchet@41136
    73
  length (Defs.specifications_of (Theory.defs_of thy) s) > 1
blanchet@41136
    74
blanchet@41136
    75
fun needs_type_args thy type_sys s =
blanchet@41136
    76
  case type_sys of
blanchet@41136
    77
    Tags full_types => not full_types
blanchet@41136
    78
  | Preds full_types => not full_types
blanchet@41136
    79
  | Const_Args => true
blanchet@41136
    80
  | Overload_Args => is_overloaded thy s
blanchet@41136
    81
  | No_Types => false
blanchet@41136
    82
blanchet@41136
    83
fun num_atp_type_args thy type_sys s =
blanchet@41136
    84
  if needs_type_args thy type_sys s then num_type_args thy s else 0
blanchet@41136
    85
blanchet@38282
    86
fun mk_anot phi = AConn (ANot, [phi])
blanchet@38282
    87
fun mk_aconn c phi1 phi2 = AConn (c, [phi1, phi2])
blanchet@38282
    88
fun mk_ahorn [] phi = phi
blanchet@38282
    89
  | mk_ahorn (phi :: phis) psi =
blanchet@38282
    90
    AConn (AImplies, [fold (mk_aconn AAnd) phis phi, psi])
blanchet@38282
    91
blanchet@38282
    92
fun combformula_for_prop thy =
blanchet@38282
    93
  let
blanchet@40145
    94
    val do_term = combterm_from_term thy
blanchet@38282
    95
    fun do_quant bs q s T t' =
blanchet@38518
    96
      let val s = Name.variant (map fst bs) s in
blanchet@38518
    97
        do_formula ((s, T) :: bs) t'
blanchet@38518
    98
        #>> (fn phi => AQuant (q, [`make_bound_var s], phi))
blanchet@38518
    99
      end
blanchet@38282
   100
    and do_conn bs c t1 t2 =
blanchet@38282
   101
      do_formula bs t1 ##>> do_formula bs t2
blanchet@38282
   102
      #>> (fn (phi1, phi2) => AConn (c, [phi1, phi2]))
blanchet@38282
   103
    and do_formula bs t =
blanchet@38282
   104
      case t of
blanchet@38282
   105
        @{const Not} $ t1 =>
blanchet@38282
   106
        do_formula bs t1 #>> (fn phi => AConn (ANot, [phi]))
blanchet@38282
   107
      | Const (@{const_name All}, _) $ Abs (s, T, t') =>
blanchet@38282
   108
        do_quant bs AForall s T t'
blanchet@38282
   109
      | Const (@{const_name Ex}, _) $ Abs (s, T, t') =>
blanchet@38282
   110
        do_quant bs AExists s T t'
haftmann@38795
   111
      | @{const HOL.conj} $ t1 $ t2 => do_conn bs AAnd t1 t2
haftmann@38795
   112
      | @{const HOL.disj} $ t1 $ t2 => do_conn bs AOr t1 t2
haftmann@38786
   113
      | @{const HOL.implies} $ t1 $ t2 => do_conn bs AImplies t1 t2
haftmann@38864
   114
      | Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 =>
blanchet@38282
   115
        do_conn bs AIff t1 t2
blanchet@38282
   116
      | _ => (fn ts => do_term bs (Envir.eta_contract t)
blanchet@38282
   117
                       |>> AAtom ||> union (op =) ts)
blanchet@38282
   118
  in do_formula [] end
blanchet@38282
   119
blanchet@38618
   120
val presimplify_term = prop_of o Meson.presimplify oo Skip_Proof.make_thm
blanchet@38282
   121
blanchet@38282
   122
fun concealed_bound_name j = sledgehammer_weak_prefix ^ Int.toString j
blanchet@38282
   123
fun conceal_bounds Ts t =
blanchet@38282
   124
  subst_bounds (map (Free o apfst concealed_bound_name)
blanchet@38282
   125
                    (0 upto length Ts - 1 ~~ Ts), t)
blanchet@38282
   126
fun reveal_bounds Ts =
blanchet@38282
   127
  subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j))
blanchet@38282
   128
                    (0 upto length Ts - 1 ~~ Ts))
blanchet@38282
   129
blanchet@38608
   130
(* Removes the lambdas from an equation of the form "t = (%x. u)".
blanchet@39890
   131
   (Cf. "extensionalize_theorem" in "Meson_Clausify".) *)
blanchet@38608
   132
fun extensionalize_term t =
blanchet@38608
   133
  let
blanchet@38608
   134
    fun aux j (@{const Trueprop} $ t') = @{const Trueprop} $ aux j t'
blanchet@38608
   135
      | aux j (t as Const (s, Type (_, [Type (_, [_, T']),
blanchet@38608
   136
                                        Type (_, [_, res_T])]))
blanchet@38608
   137
                    $ t2 $ Abs (var_s, var_T, t')) =
haftmann@38864
   138
        if s = @{const_name HOL.eq} orelse s = @{const_name "=="} then
blanchet@38608
   139
          let val var_t = Var ((var_s, j), var_T) in
blanchet@38608
   140
            Const (s, T' --> T' --> res_T)
blanchet@38608
   141
              $ betapply (t2, var_t) $ subst_bound (var_t, t')
blanchet@38608
   142
            |> aux (j + 1)
blanchet@38608
   143
          end
blanchet@38608
   144
        else
blanchet@38608
   145
          t
blanchet@38608
   146
      | aux _ t = t
blanchet@38608
   147
  in aux (maxidx_of_term t + 1) t end
blanchet@38608
   148
blanchet@38282
   149
fun introduce_combinators_in_term ctxt kind t =
blanchet@38491
   150
  let val thy = ProofContext.theory_of ctxt in
blanchet@38491
   151
    if Meson.is_fol_term thy t then
blanchet@38491
   152
      t
blanchet@38491
   153
    else
blanchet@38491
   154
      let
blanchet@38491
   155
        fun aux Ts t =
blanchet@38491
   156
          case t of
blanchet@38491
   157
            @{const Not} $ t1 => @{const Not} $ aux Ts t1
blanchet@38491
   158
          | (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') =>
blanchet@38491
   159
            t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38652
   160
          | (t0 as Const (@{const_name All}, _)) $ t1 =>
blanchet@38652
   161
            aux Ts (t0 $ eta_expand Ts t1 1)
blanchet@38491
   162
          | (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') =>
blanchet@38491
   163
            t0 $ Abs (s, T, aux (T :: Ts) t')
blanchet@38652
   164
          | (t0 as Const (@{const_name Ex}, _)) $ t1 =>
blanchet@38652
   165
            aux Ts (t0 $ eta_expand Ts t1 1)
haftmann@38795
   166
          | (t0 as @{const HOL.conj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38795
   167
          | (t0 as @{const HOL.disj}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38786
   168
          | (t0 as @{const HOL.implies}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
haftmann@38864
   169
          | (t0 as Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])))
blanchet@38491
   170
              $ t1 $ t2 =>
blanchet@38491
   171
            t0 $ aux Ts t1 $ aux Ts t2
blanchet@38491
   172
          | _ => if not (exists_subterm (fn Abs _ => true | _ => false) t) then
blanchet@38491
   173
                   t
blanchet@38491
   174
                 else
blanchet@38491
   175
                   t |> conceal_bounds Ts
blanchet@38491
   176
                     |> Envir.eta_contract
blanchet@38491
   177
                     |> cterm_of thy
blanchet@39890
   178
                     |> Meson_Clausify.introduce_combinators_in_cterm
blanchet@38491
   179
                     |> prop_of |> Logic.dest_equals |> snd
blanchet@38491
   180
                     |> reveal_bounds Ts
blanchet@39370
   181
        val (t, ctxt') = Variable.import_terms true [t] ctxt |>> the_single
blanchet@38491
   182
      in t |> aux [] |> singleton (Variable.export_terms ctxt' ctxt) end
blanchet@38491
   183
      handle THM _ =>
blanchet@38491
   184
             (* A type variable of sort "{}" will make abstraction fail. *)
blanchet@38613
   185
             if kind = Conjecture then HOLogic.false_const
blanchet@38613
   186
             else HOLogic.true_const
blanchet@38491
   187
  end
blanchet@38282
   188
blanchet@38282
   189
(* Metis's use of "resolve_tac" freezes the schematic variables. We simulate the
blanchet@38282
   190
   same in Sledgehammer to prevent the discovery of unreplable proofs. *)
blanchet@38282
   191
fun freeze_term t =
blanchet@38282
   192
  let
blanchet@38282
   193
    fun aux (t $ u) = aux t $ aux u
blanchet@38282
   194
      | aux (Abs (s, T, t)) = Abs (s, T, aux t)
blanchet@38282
   195
      | aux (Var ((s, i), T)) =
blanchet@38282
   196
        Free (sledgehammer_weak_prefix ^ s ^ "_" ^ string_of_int i, T)
blanchet@38282
   197
      | aux t = t
blanchet@38282
   198
  in t |> exists_subterm is_Var t ? aux end
blanchet@38282
   199
blanchet@38604
   200
(* "Object_Logic.atomize_term" isn't as powerful as it could be; for example,
blanchet@38604
   201
    it leaves metaequalities over "prop"s alone. *)
blanchet@38605
   202
val atomize_term =
blanchet@38605
   203
  let
blanchet@38605
   204
    fun aux (@{const Trueprop} $ t1) = t1
blanchet@38605
   205
      | aux (Const (@{const_name all}, _) $ Abs (s, T, t')) =
blanchet@38605
   206
        HOLogic.all_const T $ Abs (s, T, aux t')
blanchet@38605
   207
      | aux (@{const "==>"} $ t1 $ t2) = HOLogic.mk_imp (pairself aux (t1, t2))
blanchet@38605
   208
      | aux (Const (@{const_name "=="}, Type (_, [@{typ prop}, _])) $ t1 $ t2) =
blanchet@38605
   209
        HOLogic.eq_const HOLogic.boolT $ aux t1 $ aux t2
blanchet@38605
   210
      | aux (Const (@{const_name "=="}, Type (_, [T, _])) $ t1 $ t2) =
blanchet@38605
   211
        HOLogic.eq_const T $ t1 $ t2
blanchet@38605
   212
      | aux _ = raise Fail "aux"
blanchet@38605
   213
  in perhaps (try aux) end
blanchet@38604
   214
blanchet@40204
   215
(* making fact and conjecture formulas *)
blanchet@38613
   216
fun make_formula ctxt presimp name kind t =
blanchet@38282
   217
  let
blanchet@38282
   218
    val thy = ProofContext.theory_of ctxt
blanchet@38608
   219
    val t = t |> Envir.beta_eta_contract
blanchet@38652
   220
              |> transform_elim_term
blanchet@38604
   221
              |> atomize_term
blanchet@38652
   222
    val need_trueprop = (fastype_of t = HOLogic.boolT)
blanchet@38652
   223
    val t = t |> need_trueprop ? HOLogic.mk_Trueprop
blanchet@38282
   224
              |> extensionalize_term
blanchet@38282
   225
              |> presimp ? presimplify_term thy
blanchet@38282
   226
              |> perhaps (try (HOLogic.dest_Trueprop))
blanchet@38282
   227
              |> introduce_combinators_in_term ctxt kind
blanchet@38613
   228
              |> kind <> Axiom ? freeze_term
blanchet@38282
   229
    val (combformula, ctypes_sorts) = combformula_for_prop thy t []
blanchet@38282
   230
  in
blanchet@38752
   231
    {name = name, combformula = combformula, kind = kind,
blanchet@38752
   232
     ctypes_sorts = ctypes_sorts}
blanchet@38282
   233
  end
blanchet@38282
   234
blanchet@41091
   235
fun make_fact ctxt presimp ((name, _), th) =
blanchet@38618
   236
  case make_formula ctxt presimp name Axiom (prop_of th) of
blanchet@38752
   237
    {combformula = AAtom (CombConst (("c_True", _), _, _)), ...} => NONE
blanchet@41091
   238
  | formula => SOME formula
blanchet@38613
   239
fun make_conjecture ctxt ts =
blanchet@38613
   240
  let val last = length ts - 1 in
blanchet@38613
   241
    map2 (fn j => make_formula ctxt true (Int.toString j)
blanchet@38613
   242
                               (if j = last then Conjecture else Hypothesis))
blanchet@38613
   243
         (0 upto last) ts
blanchet@38613
   244
  end
blanchet@38282
   245
blanchet@38282
   246
(** Helper facts **)
blanchet@38282
   247
blanchet@38282
   248
fun count_combterm (CombConst ((s, _), _, _)) =
blanchet@38282
   249
    Symtab.map_entry s (Integer.add 1)
blanchet@38282
   250
  | count_combterm (CombVar _) = I
blanchet@38282
   251
  | count_combterm (CombApp (t1, t2)) = fold count_combterm [t1, t2]
blanchet@38282
   252
fun count_combformula (AQuant (_, _, phi)) = count_combformula phi
blanchet@38282
   253
  | count_combformula (AConn (_, phis)) = fold count_combformula phis
blanchet@38282
   254
  | count_combformula (AAtom tm) = count_combterm tm
blanchet@40114
   255
fun count_translated_formula ({combformula, ...} : translated_formula) =
blanchet@38282
   256
  count_combformula combformula
blanchet@38282
   257
blanchet@38282
   258
val optional_helpers =
blanchet@39953
   259
  [(["c_COMBI"], @{thms Meson.COMBI_def}),
blanchet@39953
   260
   (["c_COMBK"], @{thms Meson.COMBK_def}),
blanchet@39953
   261
   (["c_COMBB"], @{thms Meson.COMBB_def}),
blanchet@39953
   262
   (["c_COMBC"], @{thms Meson.COMBC_def}),
blanchet@39953
   263
   (["c_COMBS"], @{thms Meson.COMBS_def})]
blanchet@41134
   264
val optional_fully_typed_helpers =
blanchet@38678
   265
  [(["c_True", "c_False", "c_If"], @{thms True_or_False}),
blanchet@38678
   266
   (["c_If"], @{thms if_True if_False})]
blanchet@39954
   267
val mandatory_helpers = @{thms Metis.fequal_def}
blanchet@38282
   268
blanchet@38282
   269
val init_counters =
blanchet@41134
   270
  [optional_helpers, optional_fully_typed_helpers] |> maps (maps fst)
blanchet@38678
   271
  |> sort_distinct string_ord |> map (rpair 0) |> Symtab.make
blanchet@38282
   272
blanchet@41134
   273
fun get_helper_facts ctxt is_FO type_sys conjectures facts =
blanchet@38282
   274
  let
blanchet@40069
   275
    val ct =
blanchet@40204
   276
      fold (fold count_translated_formula) [conjectures, facts] init_counters
blanchet@38282
   277
    fun is_needed c = the (Symtab.lookup ct c) > 0
blanchet@38698
   278
    fun baptize th = ((Thm.get_name_hint th, false), th)
blanchet@38282
   279
  in
blanchet@38282
   280
    (optional_helpers
blanchet@41134
   281
     |> is_fully_typed type_sys ? append optional_fully_typed_helpers
blanchet@38282
   282
     |> maps (fn (ss, ths) =>
blanchet@38698
   283
                 if exists is_needed ss then map baptize ths else [])) @
blanchet@38698
   284
    (if is_FO then [] else map baptize mandatory_helpers)
blanchet@41091
   285
    |> map_filter (make_fact ctxt false)
blanchet@38282
   286
  end
blanchet@38282
   287
blanchet@41091
   288
fun translate_atp_fact ctxt = `(make_fact ctxt true)
blanchet@39004
   289
blanchet@41134
   290
fun translate_formulas ctxt type_sys hyp_ts concl_t rich_facts =
blanchet@38282
   291
  let
blanchet@38282
   292
    val thy = ProofContext.theory_of ctxt
blanchet@41091
   293
    val fact_ts = map (prop_of o snd o snd) rich_facts
blanchet@41091
   294
    val (facts, fact_names) =
blanchet@41091
   295
      rich_facts
blanchet@41091
   296
      |> map_filter (fn (NONE, _) => NONE
blanchet@41091
   297
                      | (SOME fact, (name, _)) => SOME (fact, name))
blanchet@41091
   298
      |> ListPair.unzip
blanchet@40204
   299
    (* Remove existing facts from the conjecture, as this can dramatically
blanchet@39005
   300
       boost an ATP's performance (for some reason). *)
blanchet@40204
   301
    val hyp_ts = hyp_ts |> filter_out (member (op aconv) fact_ts)
blanchet@38282
   302
    val goal_t = Logic.list_implies (hyp_ts, concl_t)
blanchet@38282
   303
    val is_FO = Meson.is_fol_term thy goal_t
blanchet@38282
   304
    val subs = tfree_classes_of_terms [goal_t]
blanchet@40204
   305
    val supers = tvar_classes_of_terms fact_ts
blanchet@40204
   306
    val tycons = type_consts_of_terms thy (goal_t :: fact_ts)
blanchet@40204
   307
    (* TFrees in the conjecture; TVars in the facts *)
blanchet@38613
   308
    val conjectures = make_conjecture ctxt (hyp_ts @ [concl_t])
blanchet@41134
   309
    val helper_facts = get_helper_facts ctxt is_FO type_sys conjectures facts
blanchet@38282
   310
    val (supers', arity_clauses) = make_arity_clauses thy tycons supers
blanchet@38282
   311
    val class_rel_clauses = make_class_rel_clauses thy subs supers'
blanchet@38282
   312
  in
blanchet@40204
   313
    (fact_names |> map single |> Vector.fromList,
blanchet@40204
   314
     (conjectures, facts, helper_facts, class_rel_clauses, arity_clauses))
blanchet@38282
   315
  end
blanchet@38282
   316
blanchet@38282
   317
fun wrap_type ty t = ATerm ((type_wrapper_name, type_wrapper_name), [ty, t])
blanchet@38282
   318
blanchet@38282
   319
fun fo_term_for_combtyp (CombTVar name) = ATerm (name, [])
blanchet@38282
   320
  | fo_term_for_combtyp (CombTFree name) = ATerm (name, [])
blanchet@38282
   321
  | fo_term_for_combtyp (CombType (name, tys)) =
blanchet@38282
   322
    ATerm (name, map fo_term_for_combtyp tys)
blanchet@38282
   323
blanchet@38282
   324
fun fo_literal_for_type_literal (TyLitVar (class, name)) =
blanchet@38282
   325
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@38282
   326
  | fo_literal_for_type_literal (TyLitFree (class, name)) =
blanchet@38282
   327
    (true, ATerm (class, [ATerm (name, [])]))
blanchet@38282
   328
blanchet@38282
   329
fun formula_for_fo_literal (pos, t) = AAtom t |> not pos ? mk_anot
blanchet@38282
   330
blanchet@41136
   331
fun fo_term_for_combterm thy type_sys =
blanchet@38282
   332
  let
blanchet@38282
   333
    fun aux top_level u =
blanchet@38282
   334
      let
blanchet@38282
   335
        val (head, args) = strip_combterm_comb u
blanchet@38282
   336
        val (x, ty_args) =
blanchet@38282
   337
          case head of
blanchet@38282
   338
            CombConst (name as (s, s'), _, ty_args) =>
blanchet@41136
   339
            (case strip_prefix_and_unascii const_prefix s of
blanchet@41136
   340
               NONE =>
blanchet@41136
   341
               if s = "equal" then
blanchet@41136
   342
                 if top_level andalso length args = 2 then (name, [])
blanchet@41136
   343
                 else (("c_fequal", @{const_name Metis.fequal}), ty_args)
blanchet@41136
   344
               else
blanchet@41136
   345
                 (name, ty_args)
blanchet@41136
   346
             | SOME s'' =>
blanchet@41136
   347
               let
blanchet@41136
   348
                 val s'' = invert_const s''
blanchet@41136
   349
                 val ty_args =
blanchet@41136
   350
                   if needs_type_args thy type_sys s'' then ty_args else []
blanchet@41136
   351
                in
blanchet@41136
   352
                  if top_level then
blanchet@41136
   353
                    case s of
blanchet@41136
   354
                      "c_False" => (("$false", s'), [])
blanchet@41136
   355
                    | "c_True" => (("$true", s'), [])
blanchet@41136
   356
                    | _ => (name, ty_args)
blanchet@41136
   357
                  else
blanchet@41136
   358
                    (name, ty_args)
blanchet@41136
   359
                end)
blanchet@38282
   360
          | CombVar (name, _) => (name, [])
blanchet@38282
   361
          | CombApp _ => raise Fail "impossible \"CombApp\""
blanchet@38282
   362
        val t = ATerm (x, map fo_term_for_combtyp ty_args @
blanchet@38282
   363
                          map (aux false) args)
blanchet@38282
   364
    in
blanchet@41134
   365
      t |> (if type_sys = Tags true then
blanchet@41134
   366
              wrap_type (fo_term_for_combtyp (combtyp_of u))
blanchet@41134
   367
            else
blanchet@41134
   368
              I)
blanchet@38282
   369
    end
blanchet@38282
   370
  in aux true end
blanchet@38282
   371
blanchet@41136
   372
fun formula_for_combformula thy type_sys =
blanchet@38282
   373
  let
blanchet@38282
   374
    fun aux (AQuant (q, xs, phi)) = AQuant (q, xs, aux phi)
blanchet@38282
   375
      | aux (AConn (c, phis)) = AConn (c, map aux phis)
blanchet@41136
   376
      | aux (AAtom tm) = AAtom (fo_term_for_combterm thy type_sys tm)
blanchet@38282
   377
  in aux end
blanchet@38282
   378
blanchet@41136
   379
fun formula_for_fact thy type_sys
blanchet@40204
   380
                     ({combformula, ctypes_sorts, ...} : translated_formula) =
blanchet@38282
   381
  mk_ahorn (map (formula_for_fo_literal o fo_literal_for_type_literal)
blanchet@38282
   382
                (type_literals_for_types ctypes_sorts))
blanchet@41136
   383
           (formula_for_combformula thy type_sys combformula)
blanchet@38282
   384
blanchet@41136
   385
fun problem_line_for_fact thy prefix type_sys (formula as {name, kind, ...}) =
blanchet@41136
   386
  Fof (prefix ^ ascii_of name, kind, formula_for_fact thy type_sys formula)
blanchet@38282
   387
blanchet@38282
   388
fun problem_line_for_class_rel_clause (ClassRelClause {name, subclass,
blanchet@38282
   389
                                                       superclass, ...}) =
blanchet@38282
   390
  let val ty_arg = ATerm (("T", "T"), []) in
blanchet@38282
   391
    Fof (class_rel_clause_prefix ^ ascii_of name, Axiom,
blanchet@38282
   392
         AConn (AImplies, [AAtom (ATerm (subclass, [ty_arg])),
blanchet@38282
   393
                           AAtom (ATerm (superclass, [ty_arg]))]))
blanchet@38282
   394
  end
blanchet@38282
   395
blanchet@38282
   396
fun fo_literal_for_arity_literal (TConsLit (c, t, args)) =
blanchet@38282
   397
    (true, ATerm (c, [ATerm (t, map (fn arg => ATerm (arg, [])) args)]))
blanchet@38282
   398
  | fo_literal_for_arity_literal (TVarLit (c, sort)) =
blanchet@38282
   399
    (false, ATerm (c, [ATerm (sort, [])]))
blanchet@38282
   400
blanchet@38282
   401
fun problem_line_for_arity_clause (ArityClause {name, conclLit, premLits,
blanchet@38282
   402
                                                ...}) =
blanchet@38282
   403
  Fof (arity_clause_prefix ^ ascii_of name, Axiom,
blanchet@38282
   404
       mk_ahorn (map (formula_for_fo_literal o apfst not
blanchet@38282
   405
                      o fo_literal_for_arity_literal) premLits)
blanchet@38282
   406
                (formula_for_fo_literal
blanchet@38282
   407
                     (fo_literal_for_arity_literal conclLit)))
blanchet@38282
   408
blanchet@41136
   409
fun problem_line_for_conjecture thy type_sys
blanchet@40114
   410
        ({name, kind, combformula, ...} : translated_formula) =
blanchet@38282
   411
  Fof (conjecture_prefix ^ name, kind,
blanchet@41136
   412
       formula_for_combformula thy type_sys combformula)
blanchet@38282
   413
blanchet@40114
   414
fun free_type_literals_for_conjecture
blanchet@40114
   415
        ({ctypes_sorts, ...} : translated_formula) =
blanchet@38282
   416
  map fo_literal_for_type_literal (type_literals_for_types ctypes_sorts)
blanchet@38282
   417
blanchet@39975
   418
fun problem_line_for_free_type j lit =
blanchet@39975
   419
  Fof (tfree_prefix ^ string_of_int j, Hypothesis, formula_for_fo_literal lit)
blanchet@38282
   420
fun problem_lines_for_free_types conjectures =
blanchet@38282
   421
  let
blanchet@38282
   422
    val litss = map free_type_literals_for_conjecture conjectures
blanchet@38282
   423
    val lits = fold (union (op =)) litss []
blanchet@39975
   424
  in map2 problem_line_for_free_type (0 upto length lits - 1) lits end
blanchet@38282
   425
blanchet@38282
   426
(** "hBOOL" and "hAPP" **)
blanchet@38282
   427
blanchet@38282
   428
type const_info = {min_arity: int, max_arity: int, sub_level: bool}
blanchet@38282
   429
blanchet@38282
   430
fun consider_term top_level (ATerm ((s, _), ts)) =
blanchet@39452
   431
  (if is_atp_variable s then
blanchet@38282
   432
     I
blanchet@38282
   433
   else
blanchet@38282
   434
     let val n = length ts in
blanchet@38282
   435
       Symtab.map_default
blanchet@38282
   436
           (s, {min_arity = n, max_arity = 0, sub_level = false})
blanchet@38282
   437
           (fn {min_arity, max_arity, sub_level} =>
blanchet@38282
   438
               {min_arity = Int.min (n, min_arity),
blanchet@38282
   439
                max_arity = Int.max (n, max_arity),
blanchet@38282
   440
                sub_level = sub_level orelse not top_level})
blanchet@38282
   441
     end)
blanchet@38282
   442
  #> fold (consider_term (top_level andalso s = type_wrapper_name)) ts
blanchet@38282
   443
fun consider_formula (AQuant (_, _, phi)) = consider_formula phi
blanchet@38282
   444
  | consider_formula (AConn (_, phis)) = fold consider_formula phis
blanchet@38282
   445
  | consider_formula (AAtom tm) = consider_term true tm
blanchet@38282
   446
blanchet@38282
   447
fun consider_problem_line (Fof (_, _, phi)) = consider_formula phi
blanchet@38282
   448
fun consider_problem problem = fold (fold consider_problem_line o snd) problem
blanchet@38282
   449
blanchet@38282
   450
fun const_table_for_problem explicit_apply problem =
blanchet@38282
   451
  if explicit_apply then NONE
blanchet@38282
   452
  else SOME (Symtab.empty |> consider_problem problem)
blanchet@38282
   453
blanchet@41134
   454
fun min_arity_of thy type_sys NONE s =
blanchet@38282
   455
    (if s = "equal" orelse s = type_wrapper_name orelse
blanchet@38282
   456
        String.isPrefix type_const_prefix s orelse
blanchet@38282
   457
        String.isPrefix class_prefix s then
blanchet@38282
   458
       16383 (* large number *)
blanchet@38748
   459
     else case strip_prefix_and_unascii const_prefix s of
blanchet@41136
   460
       SOME s' => num_atp_type_args thy type_sys (invert_const s')
blanchet@38282
   461
     | NONE => 0)
blanchet@38282
   462
  | min_arity_of _ _ (SOME the_const_tab) s =
blanchet@38282
   463
    case Symtab.lookup the_const_tab s of
blanchet@38282
   464
      SOME ({min_arity, ...} : const_info) => min_arity
blanchet@38282
   465
    | NONE => 0
blanchet@38282
   466
blanchet@38282
   467
fun full_type_of (ATerm ((s, _), [ty, _])) =
blanchet@38282
   468
    if s = type_wrapper_name then ty else raise Fail "expected type wrapper"
blanchet@38282
   469
  | full_type_of _ = raise Fail "expected type wrapper"
blanchet@38282
   470
blanchet@38282
   471
fun list_hAPP_rev _ t1 [] = t1
blanchet@38282
   472
  | list_hAPP_rev NONE t1 (t2 :: ts2) =
blanchet@38282
   473
    ATerm (`I "hAPP", [list_hAPP_rev NONE t1 ts2, t2])
blanchet@38282
   474
  | list_hAPP_rev (SOME ty) t1 (t2 :: ts2) =
blanchet@38282
   475
    let val ty' = ATerm (`make_fixed_type_const @{type_name fun},
blanchet@38282
   476
                         [full_type_of t2, ty]) in
blanchet@38282
   477
      ATerm (`I "hAPP", [wrap_type ty' (list_hAPP_rev (SOME ty') t1 ts2), t2])
blanchet@38282
   478
    end
blanchet@38282
   479
blanchet@41134
   480
fun repair_applications_in_term thy type_sys const_tab =
blanchet@38282
   481
  let
blanchet@38282
   482
    fun aux opt_ty (ATerm (name as (s, _), ts)) =
blanchet@38282
   483
      if s = type_wrapper_name then
blanchet@38282
   484
        case ts of
blanchet@38282
   485
          [t1, t2] => ATerm (name, [aux NONE t1, aux (SOME t1) t2])
blanchet@38282
   486
        | _ => raise Fail "malformed type wrapper"
blanchet@38282
   487
      else
blanchet@38282
   488
        let
blanchet@38282
   489
          val ts = map (aux NONE) ts
blanchet@41134
   490
          val (ts1, ts2) = chop (min_arity_of thy type_sys const_tab s) ts
blanchet@38282
   491
        in list_hAPP_rev opt_ty (ATerm (name, ts1)) (rev ts2) end
blanchet@38282
   492
  in aux NONE end
blanchet@38282
   493
blanchet@38282
   494
fun boolify t = ATerm (`I "hBOOL", [t])
blanchet@38282
   495
blanchet@38282
   496
(* True if the constant ever appears outside of the top-level position in
blanchet@38282
   497
   literals, or if it appears with different arities (e.g., because of different
blanchet@38282
   498
   type instantiations). If false, the constant always receives all of its
blanchet@38282
   499
   arguments and is used as a predicate. *)
blanchet@38282
   500
fun is_predicate NONE s =
blanchet@38589
   501
    s = "equal" orelse s = "$false" orelse s = "$true" orelse
blanchet@38589
   502
    String.isPrefix type_const_prefix s orelse String.isPrefix class_prefix s
blanchet@38282
   503
  | is_predicate (SOME the_const_tab) s =
blanchet@38282
   504
    case Symtab.lookup the_const_tab s of
blanchet@38282
   505
      SOME {min_arity, max_arity, sub_level} =>
blanchet@38282
   506
      not sub_level andalso min_arity = max_arity
blanchet@38282
   507
    | NONE => false
blanchet@38282
   508
blanchet@38282
   509
fun repair_predicates_in_term const_tab (t as ATerm ((s, _), ts)) =
blanchet@38282
   510
  if s = type_wrapper_name then
blanchet@38282
   511
    case ts of
blanchet@38282
   512
      [_, t' as ATerm ((s', _), _)] =>
blanchet@38282
   513
      if is_predicate const_tab s' then t' else boolify t
blanchet@38282
   514
    | _ => raise Fail "malformed type wrapper"
blanchet@38282
   515
  else
blanchet@38282
   516
    t |> not (is_predicate const_tab s) ? boolify
blanchet@38282
   517
blanchet@38282
   518
fun close_universally phi =
blanchet@38282
   519
  let
blanchet@38282
   520
    fun term_vars bounds (ATerm (name as (s, _), tms)) =
blanchet@39452
   521
        (is_atp_variable s andalso not (member (op =) bounds name))
blanchet@38282
   522
          ? insert (op =) name
blanchet@38282
   523
        #> fold (term_vars bounds) tms
blanchet@38678
   524
    fun formula_vars bounds (AQuant (_, xs, phi)) =
blanchet@38282
   525
        formula_vars (xs @ bounds) phi
blanchet@38282
   526
      | formula_vars bounds (AConn (_, phis)) = fold (formula_vars bounds) phis
blanchet@38282
   527
      | formula_vars bounds (AAtom tm) = term_vars bounds tm
blanchet@38282
   528
  in
blanchet@38282
   529
    case formula_vars [] phi [] of [] => phi | xs => AQuant (AForall, xs, phi)
blanchet@38282
   530
  end
blanchet@38282
   531
blanchet@41134
   532
fun repair_formula thy explicit_forall type_sys const_tab =
blanchet@38282
   533
  let
blanchet@38282
   534
    fun aux (AQuant (q, xs, phi)) = AQuant (q, xs, aux phi)
blanchet@38282
   535
      | aux (AConn (c, phis)) = AConn (c, map aux phis)
blanchet@38282
   536
      | aux (AAtom tm) =
blanchet@41134
   537
        AAtom (tm |> repair_applications_in_term thy type_sys const_tab
blanchet@38282
   538
                  |> repair_predicates_in_term const_tab)
blanchet@38282
   539
  in aux #> explicit_forall ? close_universally end
blanchet@38282
   540
blanchet@41134
   541
fun repair_problem_line thy explicit_forall type_sys const_tab
blanchet@38282
   542
                        (Fof (ident, kind, phi)) =
blanchet@41134
   543
  Fof (ident, kind, repair_formula thy explicit_forall type_sys const_tab phi)
blanchet@38282
   544
fun repair_problem_with_const_table thy =
blanchet@38282
   545
  map o apsnd o map ooo repair_problem_line thy
blanchet@38282
   546
blanchet@41134
   547
fun repair_problem thy explicit_forall type_sys explicit_apply problem =
blanchet@41134
   548
  repair_problem_with_const_table thy explicit_forall type_sys
blanchet@38282
   549
      (const_table_for_problem explicit_apply problem) problem
blanchet@38282
   550
blanchet@41134
   551
fun prepare_atp_problem ctxt readable_names explicit_forall type_sys
blanchet@40204
   552
                        explicit_apply hyp_ts concl_t facts =
blanchet@38282
   553
  let
blanchet@38282
   554
    val thy = ProofContext.theory_of ctxt
blanchet@40204
   555
    val (fact_names, (conjectures, facts, helper_facts, class_rel_clauses,
blanchet@40204
   556
                      arity_clauses)) =
blanchet@41134
   557
      translate_formulas ctxt type_sys hyp_ts concl_t facts
blanchet@41136
   558
    val fact_lines = map (problem_line_for_fact thy fact_prefix type_sys) facts
blanchet@38282
   559
    val helper_lines =
blanchet@41136
   560
      map (problem_line_for_fact thy helper_prefix type_sys) helper_facts
blanchet@38282
   561
    val conjecture_lines =
blanchet@41136
   562
      map (problem_line_for_conjecture thy type_sys) conjectures
blanchet@38282
   563
    val tfree_lines = problem_lines_for_free_types conjectures
blanchet@38282
   564
    val class_rel_lines =
blanchet@38282
   565
      map problem_line_for_class_rel_clause class_rel_clauses
blanchet@38282
   566
    val arity_lines = map problem_line_for_arity_clause arity_clauses
blanchet@38282
   567
    (* Reordering these might or might not confuse the proof reconstruction
blanchet@38282
   568
       code or the SPASS Flotter hack. *)
blanchet@38282
   569
    val problem =
blanchet@40204
   570
      [("Relevant facts", fact_lines),
blanchet@38282
   571
       ("Class relationships", class_rel_lines),
blanchet@38282
   572
       ("Arity declarations", arity_lines),
blanchet@38282
   573
       ("Helper facts", helper_lines),
blanchet@38282
   574
       ("Conjectures", conjecture_lines),
blanchet@38282
   575
       ("Type variables", tfree_lines)]
blanchet@41134
   576
      |> repair_problem thy explicit_forall type_sys explicit_apply
blanchet@39452
   577
    val (problem, pool) = nice_atp_problem readable_names problem
blanchet@38282
   578
    val conjecture_offset =
blanchet@40204
   579
      length fact_lines + length class_rel_lines + length arity_lines
blanchet@38282
   580
      + length helper_lines
blanchet@38282
   581
  in
blanchet@38282
   582
    (problem,
blanchet@38282
   583
     case pool of SOME the_pool => snd the_pool | NONE => Symtab.empty,
blanchet@40204
   584
     conjecture_offset, fact_names)
blanchet@38282
   585
  end
blanchet@38282
   586
blanchet@38282
   587
end;