src/HOL/Tools/Sledgehammer/sledgehammer_hol_clause.ML
author blanchet
Mon Apr 19 19:41:30 2010 +0200 (2010-04-19 ago)
changeset 36233 1263bef003b3
parent 36231 bede2d49ba3b
child 36235 61159615a0c5
permissions -rw-r--r--
cosmetics
blanchet@35826
     1
(*  Title:      HOL/Sledgehammer/sledgehammer_hol_clause.ML
wenzelm@33311
     2
    Author:     Jia Meng, NICTA
mengj@17998
     3
wenzelm@24311
     4
FOL clauses translated from HOL formulae.
mengj@17998
     5
*)
mengj@17998
     6
blanchet@35826
     7
signature SLEDGEHAMMER_HOL_CLAUSE =
wenzelm@24311
     8
sig
blanchet@36170
     9
  type name = Sledgehammer_FOL_Clause.name
blanchet@35865
    10
  type kind = Sledgehammer_FOL_Clause.kind
blanchet@35865
    11
  type fol_type = Sledgehammer_FOL_Clause.fol_type
blanchet@35865
    12
  type classrel_clause = Sledgehammer_FOL_Clause.classrel_clause
blanchet@35865
    13
  type arity_clause = Sledgehammer_FOL_Clause.arity_clause
wenzelm@24311
    14
  type axiom_name = string
wenzelm@24311
    15
  type polarity = bool
blanchet@35865
    16
  type hol_clause_id = int
blanchet@35865
    17
wenzelm@24311
    18
  datatype combterm =
blanchet@36170
    19
    CombConst of name * fol_type * fol_type list (* Const and Free *) |
blanchet@36170
    20
    CombVar of name * fol_type |
blanchet@35865
    21
    CombApp of combterm * combterm
wenzelm@24311
    22
  datatype literal = Literal of polarity * combterm
blanchet@35865
    23
  datatype hol_clause =
blanchet@35865
    24
    HOLClause of {clause_id: hol_clause_id, axiom_name: axiom_name, th: thm,
blanchet@35865
    25
                  kind: kind, literals: literal list, ctypes_sorts: typ list}
blanchet@35865
    26
blanchet@35865
    27
  val type_of_combterm : combterm -> fol_type
blanchet@35865
    28
  val strip_combterm_comb : combterm -> combterm * combterm list
blanchet@35865
    29
  val literals_of_term : theory -> term -> literal list * typ list
blanchet@35865
    30
  exception TRIVIAL
blanchet@35865
    31
  val make_conjecture_clauses : bool -> theory -> thm list -> hol_clause list
blanchet@35865
    32
  val make_axiom_clauses : bool -> theory ->
blanchet@35865
    33
       (thm * (axiom_name * hol_clause_id)) list -> (axiom_name * hol_clause) list
blanchet@35865
    34
  val get_helper_clauses : bool -> theory -> bool ->
blanchet@35865
    35
       hol_clause list * (thm * (axiom_name * hol_clause_id)) list * string list ->
blanchet@35865
    36
       hol_clause list
blanchet@36169
    37
  val write_tptp_file : bool -> bool -> Path.T ->
blanchet@35865
    38
    hol_clause list * hol_clause list * hol_clause list * hol_clause list *
blanchet@36231
    39
    classrel_clause list * arity_clause list -> unit
blanchet@36222
    40
  val write_dfg_file : bool -> Path.T ->
blanchet@35865
    41
    hol_clause list * hol_clause list * hol_clause list * hol_clause list *
blanchet@36231
    42
    classrel_clause list * arity_clause list -> unit
wenzelm@24311
    43
end
mengj@17998
    44
blanchet@35826
    45
structure Sledgehammer_HOL_Clause : SLEDGEHAMMER_HOL_CLAUSE =
mengj@17998
    46
struct
mengj@17998
    47
blanchet@36167
    48
open Sledgehammer_Util
blanchet@35865
    49
open Sledgehammer_FOL_Clause
blanchet@35865
    50
open Sledgehammer_Fact_Preprocessor
paulson@22825
    51
blanchet@35963
    52
(* Parameter "full_types" below indicates that full type information is to be
nipkow@31800
    53
exported *)
paulson@22825
    54
blanchet@35865
    55
(* If true, each function will be directly applied to as many arguments as
blanchet@35865
    56
   possible, avoiding use of the "apply" operator. Use of hBOOL is also
blanchet@35865
    57
   minimized. *)
wenzelm@30153
    58
val minimize_applies = true;
paulson@22064
    59
wenzelm@33035
    60
fun min_arity_of const_min_arity c = the_default 0 (Symtab.lookup const_min_arity c);
paulson@22064
    61
paulson@22825
    62
(*True if the constant ever appears outside of the top-level position in literals.
paulson@22825
    63
  If false, the constant always receives all of its arguments and is used as a predicate.*)
wenzelm@33035
    64
fun needs_hBOOL const_needs_hBOOL c =
wenzelm@33035
    65
  not minimize_applies orelse
wenzelm@33035
    66
    the_default false (Symtab.lookup const_needs_hBOOL c);
paulson@22064
    67
mengj@19198
    68
mengj@17998
    69
(******************************************************)
mengj@17998
    70
(* data types for typed combinator expressions        *)
mengj@17998
    71
(******************************************************)
mengj@17998
    72
mengj@17998
    73
type axiom_name = string;
mengj@17998
    74
type polarity = bool;
blanchet@35865
    75
type hol_clause_id = int;
mengj@17998
    76
blanchet@35865
    77
datatype combterm =
blanchet@36170
    78
  CombConst of name * fol_type * fol_type list (* Const and Free *) |
blanchet@36170
    79
  CombVar of name * fol_type |
blanchet@35865
    80
  CombApp of combterm * combterm
wenzelm@24311
    81
mengj@17998
    82
datatype literal = Literal of polarity * combterm;
mengj@17998
    83
blanchet@35865
    84
datatype hol_clause =
blanchet@35865
    85
  HOLClause of {clause_id: hol_clause_id, axiom_name: axiom_name, th: thm,
blanchet@35865
    86
                kind: kind, literals: literal list, ctypes_sorts: typ list};
mengj@17998
    87
mengj@17998
    88
mengj@17998
    89
(*********************************************************************)
mengj@17998
    90
(* convert a clause with type Term.term to a clause with type clause *)
mengj@17998
    91
(*********************************************************************)
mengj@17998
    92
blanchet@36170
    93
fun isFalse (Literal (pol, CombConst ((c, _), _, _))) =
blanchet@35865
    94
      (pol andalso c = "c_False") orelse (not pol andalso c = "c_True")
mengj@17998
    95
  | isFalse _ = false;
mengj@17998
    96
blanchet@36170
    97
fun isTrue (Literal (pol, CombConst ((c, _), _, _))) =
mengj@17998
    98
      (pol andalso c = "c_True") orelse
mengj@17998
    99
      (not pol andalso c = "c_False")
mengj@17998
   100
  | isTrue _ = false;
wenzelm@24311
   101
blanchet@35865
   102
fun isTaut (HOLClause {literals,...}) = exists isTrue literals;
mengj@17998
   103
immler@30151
   104
fun type_of dfg (Type (a, Ts)) =
blanchet@36169
   105
    let val (folTypes,ts) = types_of dfg Ts in
blanchet@36169
   106
      (TyConstr (`(make_fixed_type_const dfg) a, folTypes), ts)
blanchet@36169
   107
    end
blanchet@36169
   108
  | type_of _ (tp as TFree (a, _)) = (TyFree (`make_fixed_type_var a), [tp])
blanchet@36169
   109
  | type_of _ (tp as TVar (x, _)) =
blanchet@36169
   110
    (TyVar (make_schematic_type_var x, string_of_indexname x), [tp])
immler@30151
   111
and types_of dfg Ts =
immler@30151
   112
      let val (folTyps,ts) = ListPair.unzip (map (type_of dfg) Ts)
blanchet@35865
   113
      in  (folTyps, union_all ts)  end;
mengj@17998
   114
mengj@17998
   115
(* same as above, but no gathering of sort information *)
immler@30151
   116
fun simp_type_of dfg (Type (a, Ts)) =
blanchet@36169
   117
      TyConstr (`(make_fixed_type_const dfg) a, map (simp_type_of dfg) Ts)
blanchet@36169
   118
  | simp_type_of _ (TFree (a, _)) = TyFree (`make_fixed_type_var a)
blanchet@36169
   119
  | simp_type_of _ (TVar (x, _)) =
blanchet@36169
   120
    TyVar (make_schematic_type_var x, string_of_indexname x);
mengj@18440
   121
mengj@18356
   122
immler@30151
   123
fun const_type_of dfg thy (c,t) =
immler@30151
   124
      let val (tp,ts) = type_of dfg t
immler@30151
   125
      in  (tp, ts, map (simp_type_of dfg) (Sign.const_typargs thy (c,t))) end;
mengj@18356
   126
mengj@17998
   127
(* convert a Term.term (with combinators) into a combterm, also accummulate sort info *)
immler@30151
   128
fun combterm_of dfg thy (Const(c,t)) =
immler@30151
   129
      let val (tp,ts,tvar_list) = const_type_of dfg thy (c,t)
blanchet@36170
   130
          val c' = CombConst (`(make_fixed_const dfg) c, tp, tvar_list)
paulson@22078
   131
      in  (c',ts)  end
wenzelm@32994
   132
  | combterm_of dfg _ (Free(v,t)) =
immler@30151
   133
      let val (tp,ts) = type_of dfg t
blanchet@36170
   134
          val v' = CombConst (`make_fixed_var v, tp, [])
paulson@22078
   135
      in  (v',ts)  end
wenzelm@32994
   136
  | combterm_of dfg _ (Var(v,t)) =
immler@30151
   137
      let val (tp,ts) = type_of dfg t
blanchet@36170
   138
          val v' = CombVar ((make_schematic_var v, string_of_indexname v), tp)
paulson@22078
   139
      in  (v',ts)  end
immler@30151
   140
  | combterm_of dfg thy (P $ Q) =
immler@30151
   141
      let val (P',tsP) = combterm_of dfg thy P
immler@30151
   142
          val (Q',tsQ) = combterm_of dfg thy Q
haftmann@33042
   143
      in  (CombApp(P',Q'), union (op =) tsP tsQ)  end
blanchet@35865
   144
  | combterm_of _ _ (t as Abs _) = raise CLAUSE ("HOL CLAUSE", t);
mengj@17998
   145
blanchet@35865
   146
fun predicate_of dfg thy ((@{const Not} $ P), polarity) = predicate_of dfg thy (P, not polarity)
immler@30151
   147
  | predicate_of dfg thy (t,polarity) = (combterm_of dfg thy (Envir.eta_contract t), polarity);
mengj@17998
   148
blanchet@35865
   149
fun literals_of_term1 dfg thy args (@{const Trueprop} $ P) = literals_of_term1 dfg thy args P
blanchet@35865
   150
  | literals_of_term1 dfg thy args (@{const "op |"} $ P $ Q) =
immler@30151
   151
      literals_of_term1 dfg thy (literals_of_term1 dfg thy args P) Q
immler@30151
   152
  | literals_of_term1 dfg thy (lits,ts) P =
immler@30151
   153
      let val ((pred,ts'),pol) = predicate_of dfg thy (P,true)
paulson@21509
   154
      in
haftmann@33042
   155
          (Literal(pol,pred)::lits, union (op =) ts ts')
paulson@21509
   156
      end;
mengj@17998
   157
immler@30151
   158
fun literals_of_term_dfg dfg thy P = literals_of_term1 dfg thy ([],[]) P;
immler@30151
   159
val literals_of_term = literals_of_term_dfg false;
mengj@17998
   160
blanchet@35865
   161
(* Trivial problem, which resolution cannot handle (empty clause) *)
blanchet@35865
   162
exception TRIVIAL;
wenzelm@28835
   163
mengj@17998
   164
(* making axiom and conjecture clauses *)
blanchet@35865
   165
fun make_clause dfg thy (clause_id, axiom_name, kind, th) =
immler@30151
   166
    let val (lits,ctypes_sorts) = literals_of_term_dfg dfg thy (prop_of th)
mengj@17998
   167
    in
blanchet@35865
   168
        if forall isFalse lits then
blanchet@35865
   169
            raise TRIVIAL
wenzelm@24311
   170
        else
blanchet@35865
   171
            HOLClause {clause_id = clause_id, axiom_name = axiom_name, th = th,
blanchet@35865
   172
                       kind = kind, literals = lits, ctypes_sorts = ctypes_sorts}
mengj@17998
   173
    end;
mengj@17998
   174
mengj@20016
   175
blanchet@36218
   176
fun add_axiom_clause dfg thy (th, (name, id)) =
blanchet@36218
   177
  let val cls = make_clause dfg thy (id, name, Axiom, th) in
blanchet@36218
   178
    not (isTaut cls) ? cons (name, cls)
blanchet@36218
   179
  end
mengj@19354
   180
blanchet@36218
   181
fun make_axiom_clauses dfg thy clauses =
blanchet@36218
   182
  fold (add_axiom_clause dfg thy) clauses []
mengj@19354
   183
wenzelm@32994
   184
fun make_conjecture_clauses_aux _ _ _ [] = []
immler@30151
   185
  | make_conjecture_clauses_aux dfg thy n (th::ths) =
blanchet@35865
   186
      make_clause dfg thy (n,"conjecture", Conjecture, th) ::
immler@30151
   187
      make_conjecture_clauses_aux dfg thy (n+1) ths;
mengj@17998
   188
immler@30151
   189
fun make_conjecture_clauses dfg thy = make_conjecture_clauses_aux dfg thy 0;
mengj@17998
   190
mengj@17998
   191
mengj@17998
   192
(**********************************************************************)
mengj@17998
   193
(* convert clause into ATP specific formats:                          *)
mengj@17998
   194
(* TPTP used by Vampire and E                                         *)
mengj@19720
   195
(* DFG used by SPASS                                                  *)
mengj@17998
   196
(**********************************************************************)
mengj@17998
   197
paulson@22078
   198
(*Result of a function type; no need to check that the argument type matches.*)
blanchet@36169
   199
fun result_type (TyConstr (("tc_fun", _), [_, tp2])) = tp2
blanchet@36168
   200
  | result_type _ = raise Fail "Non-function type"
paulson@22078
   201
wenzelm@32994
   202
fun type_of_combterm (CombConst (_, tp, _)) = tp
wenzelm@32994
   203
  | type_of_combterm (CombVar (_, tp)) = tp
wenzelm@32994
   204
  | type_of_combterm (CombApp (t1, _)) = result_type (type_of_combterm t1);
mengj@17998
   205
paulson@22064
   206
(*gets the head of a combinator application, along with the list of arguments*)
blanchet@35865
   207
fun strip_combterm_comb u =
paulson@22078
   208
    let fun stripc (CombApp(t,u), ts) = stripc (t, u::ts)
paulson@22064
   209
        |   stripc  x =  x
paulson@22064
   210
    in  stripc(u,[])  end;
paulson@22064
   211
paulson@22851
   212
val type_wrapper = "ti";
paulson@22851
   213
blanchet@36170
   214
fun head_needs_hBOOL const_needs_hBOOL (CombConst((c, _), _, _)) =
blanchet@36170
   215
    needs_hBOOL const_needs_hBOOL c
wenzelm@32994
   216
  | head_needs_hBOOL _ _ = true;
paulson@22851
   217
blanchet@36170
   218
fun wrap_type full_types (s, ty) pool =
blanchet@36170
   219
  if full_types then
blanchet@36170
   220
    let val (s', pool) = string_of_fol_type ty pool in
blanchet@36170
   221
      (type_wrapper ^ paren_pack [s, s'], pool)
blanchet@36170
   222
    end
blanchet@36170
   223
  else
blanchet@36170
   224
    (s, pool)
blanchet@36170
   225
blanchet@36170
   226
fun wrap_type_if full_types cnh (head, s, tp) =
blanchet@36170
   227
  if head_needs_hBOOL cnh head then wrap_type full_types (s, tp) else pair s
wenzelm@24311
   228
blanchet@35865
   229
fun apply ss = "hAPP" ^ paren_pack ss;
paulson@22851
   230
paulson@22064
   231
fun rev_apply (v, []) = v
paulson@22851
   232
  | rev_apply (v, arg::args) = apply [rev_apply (v, args), arg];
paulson@22064
   233
paulson@22064
   234
fun string_apply (v, args) = rev_apply (v, rev args);
paulson@22064
   235
blanchet@36170
   236
(* Apply an operator to the argument strings, using either the "apply" operator
blanchet@36170
   237
   or direct function application. *)
blanchet@36170
   238
fun string_of_application full_types cma (CombConst ((s, s'), _, tvars), args)
blanchet@36170
   239
                          pool =
blanchet@36170
   240
    let
blanchet@36170
   241
      val s = if s = "equal" then "c_fequal" else s
blanchet@36170
   242
      val nargs = min_arity_of cma s
blanchet@36170
   243
      val args1 = List.take (args, nargs)
blanchet@36170
   244
        handle Subscript =>
blanchet@36170
   245
               raise Fail (quote s ^ " has arity " ^ Int.toString nargs ^
blanchet@36170
   246
                           " but is applied to " ^ commas (map quote args))
blanchet@36170
   247
      val args2 = List.drop (args, nargs)
blanchet@36170
   248
      val (targs, pool) = if full_types then ([], pool)
blanchet@36170
   249
                          else pool_map string_of_fol_type tvars pool
blanchet@36170
   250
      val (s, pool) = nice_name (s, s') pool
blanchet@36170
   251
    in (string_apply (s ^ paren_pack (args1 @ targs), args2), pool) end
blanchet@36170
   252
  | string_of_application _ _ (CombVar (name, _), args) pool =
blanchet@36170
   253
    nice_name name pool |>> (fn s => string_apply (s, args))
wenzelm@24311
   254
blanchet@36170
   255
fun string_of_combterm (params as (full_types, cma, cnh)) t pool =
blanchet@36170
   256
  let
blanchet@36170
   257
    val (head, args) = strip_combterm_comb t
blanchet@36170
   258
    val (ss, pool) = pool_map (string_of_combterm params) args pool
blanchet@36170
   259
    val (s, pool) = string_of_application full_types cma (head, ss) pool
blanchet@36170
   260
  in wrap_type_if full_types cnh (head, s, type_of_combterm t) pool end
mengj@18356
   261
paulson@22064
   262
(*Boolean-valued terms are here converted to literals.*)
blanchet@36170
   263
fun boolify params c =
blanchet@36170
   264
  string_of_combterm params c #>> prefix "hBOOL" o paren_pack o single
paulson@22064
   265
blanchet@36170
   266
fun string_of_predicate (params as (_, _, cnh)) t =
paulson@22064
   267
  case t of
blanchet@36170
   268
    (CombApp (CombApp (CombConst (("equal", _), _, _), t1), t2)) =>
blanchet@36170
   269
    (* DFG only: new TPTP prefers infix equality *)
blanchet@36170
   270
    pool_map (string_of_combterm params) [t1, t2]
blanchet@36170
   271
    #>> prefix "equal" o paren_pack
blanchet@36170
   272
  | _ =>
blanchet@36170
   273
    case #1 (strip_combterm_comb t) of
blanchet@36170
   274
      CombConst ((s, _), _, _) =>
blanchet@36170
   275
      (if needs_hBOOL cnh s then boolify else string_of_combterm) params t
blanchet@36170
   276
    | _ => boolify params t
mengj@18356
   277
mengj@17998
   278
blanchet@36170
   279
(*** TPTP format ***)
mengj@19720
   280
blanchet@36170
   281
fun tptp_of_equality params pos (t1, t2) =
blanchet@36170
   282
  pool_map (string_of_combterm params) [t1, t2]
blanchet@36170
   283
  #>> space_implode (if pos then " = " else " != ")
wenzelm@24311
   284
blanchet@36170
   285
fun tptp_literal params
blanchet@36170
   286
        (Literal (pos, CombApp (CombApp (CombConst (("equal", _), _, _), t1),
blanchet@36170
   287
                                         t2))) =
blanchet@36170
   288
    tptp_of_equality params pos (t1, t2)
blanchet@36170
   289
  | tptp_literal params (Literal (pos, pred)) =
blanchet@36170
   290
    string_of_predicate params pred #>> tptp_sign pos
blanchet@36170
   291
 
blanchet@36170
   292
(* Given a clause, returns its literals paired with a list of literals
blanchet@36170
   293
   concerning TFrees; the latter should only occur in conjecture clauses. *)
blanchet@36170
   294
fun tptp_type_literals params pos (HOLClause {literals, ctypes_sorts, ...}) =
blanchet@36170
   295
  pool_map (tptp_literal params) literals
blanchet@36170
   296
  #>> rpair (map (tptp_of_typeLit pos) (add_typs ctypes_sorts))
wenzelm@24311
   297
blanchet@36170
   298
fun tptp_clause params (cls as HOLClause {axiom_name, clause_id, kind, ...})
blanchet@36170
   299
                pool =
blanchet@36170
   300
let
blanchet@36170
   301
    val ((lits, tylits), pool) =
blanchet@36170
   302
      tptp_type_literals params (kind = Conjecture) cls pool
paulson@24937
   303
  in
blanchet@36170
   304
    ((gen_tptp_cls (clause_id, axiom_name, kind, lits, tylits), tylits), pool)
blanchet@36170
   305
  end
mengj@17998
   306
mengj@17998
   307
blanchet@36170
   308
(*** DFG format ***)
paulson@21561
   309
blanchet@36170
   310
fun dfg_literal params (Literal (pos, pred)) =
blanchet@36170
   311
  string_of_predicate params pred #>> dfg_sign pos
mengj@19720
   312
blanchet@36170
   313
fun dfg_type_literals params pos (HOLClause {literals, ctypes_sorts, ...}) =
blanchet@36170
   314
  pool_map (dfg_literal params) literals
blanchet@36170
   315
  #>> rpair (map (dfg_of_typeLit pos) (add_typs ctypes_sorts))
mengj@19720
   316
blanchet@36170
   317
fun get_uvars (CombConst _) vars pool = (vars, pool)
blanchet@36170
   318
  | get_uvars (CombVar (name, _)) vars pool =
blanchet@36170
   319
    nice_name name pool |>> (fn var => var :: vars)
blanchet@36170
   320
  | get_uvars (CombApp (P, Q)) vars pool =
blanchet@36170
   321
    let val (vars, pool) = get_uvars P vars pool in get_uvars Q vars pool end
mengj@19720
   322
blanchet@36170
   323
fun get_uvars_l (Literal (_, c)) = get_uvars c [];
mengj@19720
   324
blanchet@36170
   325
fun dfg_vars (HOLClause {literals, ...}) =
blanchet@36170
   326
  pool_map get_uvars_l literals #>> union_all
wenzelm@24311
   327
blanchet@36170
   328
fun dfg_clause params (cls as HOLClause {axiom_name, clause_id, kind,
blanchet@36170
   329
                                         ctypes_sorts, ...}) pool =
blanchet@36170
   330
  let
blanchet@36170
   331
    val ((lits, tylits), pool) =
blanchet@36170
   332
      dfg_type_literals params (kind = Conjecture) cls pool
blanchet@36170
   333
    val (vars, pool) = dfg_vars cls pool
blanchet@36170
   334
    val tvars = get_tvar_strs ctypes_sorts
paulson@24937
   335
  in
blanchet@36170
   336
    ((gen_dfg_cls (clause_id, axiom_name, kind, lits, tylits, tvars @ vars),
blanchet@36170
   337
      tylits), pool)
blanchet@36170
   338
  end
paulson@24937
   339
mengj@19720
   340
paulson@22064
   341
(** For DFG format: accumulate function and predicate declarations **)
mengj@19720
   342
blanchet@36218
   343
fun add_types tvars = fold add_fol_type_funcs tvars
mengj@19720
   344
blanchet@36218
   345
fun add_decls (full_types, cma, cnh) (CombConst ((c, _), _, tvars))
blanchet@36218
   346
              (funcs, preds) =
blanchet@36170
   347
      if c = "equal" then
blanchet@36218
   348
        (add_types tvars funcs, preds)
paulson@21561
   349
      else
wenzelm@32960
   350
        let val arity = min_arity_of cma c
blanchet@35963
   351
            val ntys = if not full_types then length tvars else 0
wenzelm@32960
   352
            val addit = Symtab.update(c, arity+ntys)
wenzelm@32960
   353
        in
blanchet@36218
   354
            if needs_hBOOL cnh c then (add_types tvars (addit funcs), preds)
blanchet@36218
   355
            else (add_types tvars funcs, addit preds)
wenzelm@32960
   356
        end
blanchet@36218
   357
  | add_decls _ (CombVar (_, ctp)) (funcs, preds) =
blanchet@36218
   358
      (add_fol_type_funcs ctp funcs, preds)
blanchet@36218
   359
  | add_decls params (CombApp (P, Q)) decls =
blanchet@36218
   360
      decls |> add_decls params P |> add_decls params Q
mengj@19720
   361
blanchet@36218
   362
fun add_literal_decls params (Literal (_, c)) = add_decls params c
mengj@19720
   363
blanchet@36218
   364
fun add_clause_decls params (HOLClause {literals, ...}) decls =
blanchet@36218
   365
    fold (add_literal_decls params) literals decls
wenzelm@27187
   366
    handle Symtab.DUP a => error ("function " ^ a ^ " has multiple arities")
mengj@19720
   367
nipkow@31800
   368
fun decls_of_clauses params clauses arity_clauses =
blanchet@36218
   369
  let val functab = init_functab |> Symtab.update (type_wrapper, 2)
blanchet@36218
   370
                                 |> Symtab.update ("hAPP", 2)
blanchet@36218
   371
      val predtab = Symtab.empty |> Symtab.update ("hBOOL", 1)
blanchet@36218
   372
      val (functab, predtab) =
blanchet@36218
   373
        (functab, predtab) |> fold (add_clause_decls params) clauses
blanchet@36218
   374
                           |>> fold add_arity_clause_funcs arity_clauses
blanchet@36218
   375
  in (Symtab.dest functab, Symtab.dest predtab) end
mengj@19720
   376
blanchet@36218
   377
fun add_clause_preds (HOLClause {ctypes_sorts, ...}) preds =
blanchet@36218
   378
  fold add_type_sort_preds ctypes_sorts preds
wenzelm@27187
   379
  handle Symtab.DUP a => error ("predicate " ^ a ^ " has multiple arities")
paulson@21398
   380
paulson@21398
   381
(*Higher-order clauses have only the predicates hBOOL and type classes.*)
wenzelm@24311
   382
fun preds_of_clauses clauses clsrel_clauses arity_clauses =
blanchet@36218
   383
  Symtab.empty
blanchet@36218
   384
  |> fold add_clause_preds clauses
blanchet@36218
   385
  |> fold add_arity_clause_preds arity_clauses
blanchet@36218
   386
  |> fold add_classrel_clause_preds clsrel_clauses
blanchet@36218
   387
  |> Symtab.dest
mengj@18440
   388
mengj@18440
   389
(**********************************************************************)
mengj@19198
   390
(* write clauses to files                                             *)
mengj@19198
   391
(**********************************************************************)
mengj@19198
   392
paulson@21573
   393
val init_counters =
blanchet@35865
   394
  Symtab.make [("c_COMBI", 0), ("c_COMBK", 0), ("c_COMBB", 0), ("c_COMBC", 0),
blanchet@35865
   395
               ("c_COMBS", 0)];
wenzelm@24311
   396
blanchet@36218
   397
fun count_combterm (CombConst ((c, _), _, _)) =
blanchet@36218
   398
    Symtab.map_entry c (Integer.add 1)
blanchet@36218
   399
  | count_combterm (CombVar _) = I
blanchet@36218
   400
  | count_combterm (CombApp (t1, t2)) = count_combterm t1 #> count_combterm t2
paulson@21573
   401
blanchet@36218
   402
fun count_literal (Literal (_, t)) = count_combterm t
paulson@21573
   403
blanchet@36218
   404
fun count_clause (HOLClause {literals, ...}) = fold count_literal literals
paulson@21573
   405
blanchet@36218
   406
fun count_user_clause user_lemmas (HOLClause {axiom_name, literals, ...}) =
blanchet@36218
   407
  member (op =) user_lemmas axiom_name ? fold count_literal literals
paulson@21573
   408
blanchet@36228
   409
fun cnf_helper_thms thy = cnf_rules_pairs thy o map (`Thm.get_name_hint)
mengj@20644
   410
immler@31752
   411
fun get_helper_clauses dfg thy isFO (conjectures, axcls, user_lemmas) =
blanchet@35865
   412
  if isFO then
blanchet@35865
   413
    []
paulson@23386
   414
  else
immler@31752
   415
    let
immler@31752
   416
        val axclauses = map #2 (make_axiom_clauses dfg thy axcls)
blanchet@36218
   417
        val ct = init_counters |> fold count_clause conjectures
blanchet@36218
   418
                               |> fold (count_user_clause user_lemmas) axclauses
wenzelm@33035
   419
        fun needed c = the (Symtab.lookup ct c) > 0
wenzelm@24311
   420
        val IK = if needed "c_COMBI" orelse needed "c_COMBK"
blanchet@35865
   421
                 then cnf_helper_thms thy [@{thm COMBI_def}, @{thm COMBK_def}]
wenzelm@24311
   422
                 else []
wenzelm@24311
   423
        val BC = if needed "c_COMBB" orelse needed "c_COMBC"
blanchet@35865
   424
                 then cnf_helper_thms thy [@{thm COMBB_def}, @{thm COMBC_def}]
paulson@21135
   425
                 else []
blanchet@35865
   426
        val S = if needed "c_COMBS" then cnf_helper_thms thy [@{thm COMBS_def}]
wenzelm@24311
   427
                else []
blanchet@35865
   428
        val other = cnf_helper_thms thy [@{thm fequal_imp_equal},
blanchet@35865
   429
                                         @{thm equal_imp_fequal}]
mengj@20791
   430
    in
immler@30151
   431
        map #2 (make_axiom_clauses dfg thy (other @ IK @ BC @ S))
paulson@23386
   432
    end;
mengj@20791
   433
paulson@22064
   434
(*Find the minimal arity of each function mentioned in the term. Also, note which uses
paulson@22064
   435
  are not at top level, to see if hBOOL is needed.*)
immler@30150
   436
fun count_constants_term toplev t (const_min_arity, const_needs_hBOOL) =
blanchet@35865
   437
  let val (head, args) = strip_combterm_comb t
paulson@22064
   438
      val n = length args
blanchet@36233
   439
      val (const_min_arity, const_needs_hBOOL) =
blanchet@36233
   440
        (const_min_arity, const_needs_hBOOL)
blanchet@36233
   441
        |> fold (count_constants_term false) args
paulson@22064
   442
  in
paulson@22064
   443
      case head of
blanchet@36170
   444
          CombConst ((a, _),_,_) => (*predicate or function version of "equal"?*)
wenzelm@24311
   445
            let val a = if a="equal" andalso not toplev then "c_fequal" else a
wenzelm@24311
   446
            in
blanchet@36233
   447
              (const_min_arity |> Symtab.map_default (a, n) (Integer.min n),
blanchet@36233
   448
               const_needs_hBOOL |> not toplev ? Symtab.update (a, true))
wenzelm@24311
   449
            end
wenzelm@32994
   450
        | _ => (const_min_arity, const_needs_hBOOL)
paulson@22064
   451
  end;
paulson@22064
   452
paulson@22064
   453
(*A literal is a top-level term*)
immler@30150
   454
fun count_constants_lit (Literal (_,t)) (const_min_arity, const_needs_hBOOL) =
immler@30150
   455
  count_constants_term true t (const_min_arity, const_needs_hBOOL);
paulson@22064
   456
blanchet@35865
   457
fun count_constants_clause (HOLClause {literals, ...})
blanchet@35865
   458
                           (const_min_arity, const_needs_hBOOL) =
immler@30150
   459
  fold count_constants_lit literals (const_min_arity, const_needs_hBOOL);
paulson@22064
   460
immler@30150
   461
fun display_arity const_needs_hBOOL (c,n) =
blanchet@35865
   462
  trace_msg (fn () => "Constant: " ^ c ^
blanchet@35826
   463
                " arity:\t" ^ Int.toString n ^
immler@30150
   464
                (if needs_hBOOL const_needs_hBOOL c then " needs hBOOL" else ""));
paulson@22064
   465
immler@31865
   466
fun count_constants (conjectures, _, extra_clauses, helper_clauses, _, _) =
wenzelm@30153
   467
  if minimize_applies then
immler@30150
   468
     let val (const_min_arity, const_needs_hBOOL) =
immler@30150
   469
          fold count_constants_clause conjectures (Symtab.empty, Symtab.empty)
immler@31865
   470
       |> fold count_constants_clause extra_clauses
immler@30149
   471
       |> fold count_constants_clause helper_clauses
immler@30150
   472
     val _ = List.app (display_arity const_needs_hBOOL) (Symtab.dest (const_min_arity))
immler@30150
   473
     in (const_min_arity, const_needs_hBOOL) end
immler@30150
   474
  else (Symtab.empty, Symtab.empty);
paulson@22064
   475
blanchet@36218
   476
fun header () =
blanchet@36218
   477
  "% This file was generated by Isabelle (most likely Sledgehammer)\n" ^
blanchet@36218
   478
  "% " ^ timestamp () ^ "\n"
blanchet@36218
   479
blanchet@35865
   480
(* TPTP format *)
immler@31749
   481
blanchet@36222
   482
fun write_tptp_file readable_names full_types file clauses =
immler@31409
   483
  let
blanchet@36167
   484
    fun section _ [] = []
blanchet@36167
   485
      | section name ss = "\n% " ^ name ^ plural_s (length ss) ^ "\n" :: ss
blanchet@36222
   486
    val pool = empty_name_pool readable_names
immler@31865
   487
    val (conjectures, axclauses, _, helper_clauses,
immler@31865
   488
      classrel_clauses, arity_clauses) = clauses
nipkow@31791
   489
    val (cma, cnh) = count_constants clauses
blanchet@35963
   490
    val params = (full_types, cma, cnh)
blanchet@36170
   491
    val ((conjecture_clss, tfree_litss), pool) =
blanchet@36170
   492
      pool_map (tptp_clause params) conjectures pool |>> ListPair.unzip
blanchet@36218
   493
    val tfree_clss = map tptp_tfree_clause (fold (union (op =)) tfree_litss [])
blanchet@36170
   494
    val (ax_clss, pool) = pool_map (apfst fst oo tptp_clause params) axclauses
blanchet@36170
   495
                                   pool
blanchet@36170
   496
    val classrel_clss = map tptp_classrel_clause classrel_clauses
blanchet@36170
   497
    val arity_clss = map tptp_arity_clause arity_clauses
blanchet@36170
   498
    val (helper_clss, pool) = pool_map (apfst fst oo tptp_clause params)
blanchet@36170
   499
                                       helper_clauses pool
blanchet@36231
   500
  in
blanchet@36231
   501
    File.write_list file
blanchet@36231
   502
        (header () ::
blanchet@36231
   503
         section "Relevant fact" ax_clss @
blanchet@36231
   504
         section "Type variable" tfree_clss @
blanchet@36231
   505
         section "Conjecture" conjecture_clss @
blanchet@36231
   506
         section "Class relationship" classrel_clss @
blanchet@36231
   507
         section "Arity declaration" arity_clss @
blanchet@36231
   508
         section "Helper fact" helper_clss)
blanchet@36231
   509
  end
mengj@19198
   510
mengj@19720
   511
blanchet@35865
   512
(* DFG format *)
mengj@19720
   513
blanchet@36222
   514
fun write_dfg_file full_types file clauses =
immler@31409
   515
  let
blanchet@36219
   516
    (* Some of the helper functions below are not name-pool-aware. However,
blanchet@36219
   517
       there's no point in adding name pool support if the DFG format is on its
blanchet@36219
   518
       way out anyway. *)
blanchet@36219
   519
    val pool = NONE
immler@31865
   520
    val (conjectures, axclauses, _, helper_clauses,
immler@31865
   521
      classrel_clauses, arity_clauses) = clauses
nipkow@31791
   522
    val (cma, cnh) = count_constants clauses
blanchet@35963
   523
    val params = (full_types, cma, cnh)
blanchet@36170
   524
    val ((conjecture_clss, tfree_litss), pool) =
blanchet@36170
   525
      pool_map (dfg_clause params) conjectures pool |>> ListPair.unzip
immler@31838
   526
    and probname = Path.implode (Path.base file)
blanchet@36170
   527
    val (axstrs, pool) = pool_map (apfst fst oo dfg_clause params) axclauses pool
blanchet@35865
   528
    val tfree_clss = map dfg_tfree_clause (union_all tfree_litss)
blanchet@36170
   529
    val (helper_clauses_strs, pool) =
blanchet@36170
   530
      pool_map (apfst fst oo dfg_clause params) helper_clauses pool
blanchet@36218
   531
    val (funcs, cl_preds) = decls_of_clauses params (helper_clauses @ conjectures @ axclauses) arity_clauses
immler@31409
   532
    and ty_preds = preds_of_clauses axclauses classrel_clauses arity_clauses
blanchet@36170
   533
  in
blanchet@36231
   534
    File.write_list file
blanchet@36231
   535
        (header () ::
blanchet@36231
   536
         string_of_start probname ::
blanchet@36231
   537
         string_of_descrip probname ::
blanchet@36231
   538
         string_of_symbols (string_of_funcs funcs)
blanchet@36231
   539
                           (string_of_preds (cl_preds @ ty_preds)) ::
blanchet@36231
   540
         "list_of_clauses(axioms, cnf).\n" ::
blanchet@36231
   541
         axstrs @
blanchet@36231
   542
         map dfg_classrel_clause classrel_clauses @
blanchet@36231
   543
         map dfg_arity_clause arity_clauses @
blanchet@36231
   544
         helper_clauses_strs @
blanchet@36231
   545
         ["end_of_list.\n\nlist_of_clauses(conjectures, cnf).\n"] @
blanchet@36231
   546
         tfree_clss @
blanchet@36231
   547
         conjecture_clss @
blanchet@36231
   548
         ["end_of_list.\n\n",
blanchet@36231
   549
          "end_problem.\n"])
blanchet@36170
   550
  end
mengj@19720
   551
wenzelm@33311
   552
end;