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