src/HOL/Tools/res_hol_clause.ML
author wenzelm
Tue Nov 18 11:26:59 2008 +0100 (2008-11-18 ago)
changeset 28835 d4d8eba5f781
parent 27187 17b63e145986
child 30149 6b7ad52c5770
child 30240 5b25fee0362c
permissions -rw-r--r--
changes by Fabian Immler:
improved handling of prover errors;
explicit treatment of clauses that are too trivial for resolution;
wenzelm@24311
     1
(* ID: $Id$
mengj@17998
     2
   Author: Jia Meng, NICTA
mengj@17998
     3
wenzelm@24311
     4
FOL clauses translated from HOL formulae.
mengj@17998
     5
*)
mengj@17998
     6
wenzelm@24311
     7
signature RES_HOL_CLAUSE =
wenzelm@24311
     8
sig
wenzelm@24311
     9
  val ext: thm
wenzelm@24311
    10
  val comb_I: thm
wenzelm@24311
    11
  val comb_K: thm
wenzelm@24311
    12
  val comb_B: thm
wenzelm@24311
    13
  val comb_C: thm
wenzelm@24311
    14
  val comb_S: thm
paulson@24385
    15
  datatype type_level = T_FULL | T_CONST
wenzelm@24311
    16
  val typ_level: type_level ref
wenzelm@24311
    17
  val minimize_applies: bool ref
wenzelm@24311
    18
  type axiom_name = string
wenzelm@24311
    19
  type polarity = bool
wenzelm@24311
    20
  type clause_id = int
wenzelm@24311
    21
  datatype combterm =
wenzelm@24311
    22
      CombConst of string * ResClause.fol_type * ResClause.fol_type list (*Const and Free*)
wenzelm@24311
    23
    | CombVar of string * ResClause.fol_type
wenzelm@24311
    24
    | CombApp of combterm * combterm
wenzelm@24311
    25
  datatype literal = Literal of polarity * combterm
wenzelm@24311
    26
  val strip_comb: combterm -> combterm * combterm list
paulson@24940
    27
  val literals_of_term: theory -> term -> literal list * typ list
wenzelm@28835
    28
  exception TOO_TRIVIAL
wenzelm@24323
    29
  val tptp_write_file: theory -> bool -> thm list -> string ->
wenzelm@24311
    30
    (thm * (axiom_name * clause_id)) list * ResClause.classrelClause list *
wenzelm@24311
    31
      ResClause.arityClause list -> string list -> axiom_name list
wenzelm@24323
    32
  val dfg_write_file: theory -> bool -> thm list -> string ->
wenzelm@24311
    33
    (thm * (axiom_name * clause_id)) list * ResClause.classrelClause list *
wenzelm@24311
    34
      ResClause.arityClause list -> string list -> axiom_name list
wenzelm@24311
    35
end
mengj@17998
    36
wenzelm@24311
    37
structure ResHolClause: RES_HOL_CLAUSE =
mengj@17998
    38
struct
mengj@17998
    39
paulson@22078
    40
structure RC = ResClause;
paulson@22078
    41
mengj@20791
    42
(* theorems for combinators and function extensionality *)
mengj@20791
    43
val ext = thm "HOL.ext";
wenzelm@21254
    44
val comb_I = thm "ATP_Linkup.COMBI_def";
wenzelm@21254
    45
val comb_K = thm "ATP_Linkup.COMBK_def";
wenzelm@21254
    46
val comb_B = thm "ATP_Linkup.COMBB_def";
wenzelm@21254
    47
val comb_C = thm "ATP_Linkup.COMBC_def";
wenzelm@21254
    48
val comb_S = thm "ATP_Linkup.COMBS_def";
wenzelm@21254
    49
val fequal_imp_equal = thm "ATP_Linkup.fequal_imp_equal";
wenzelm@21254
    50
val equal_imp_fequal = thm "ATP_Linkup.equal_imp_fequal";
mengj@20791
    51
paulson@22825
    52
paulson@22825
    53
(*The different translations of types*)
paulson@24385
    54
datatype type_level = T_FULL | T_CONST;
paulson@22825
    55
paulson@22825
    56
val typ_level = ref T_CONST;
paulson@22825
    57
paulson@22064
    58
(*If true, each function will be directly applied to as many arguments as possible, avoiding
paulson@24385
    59
  use of the "apply" operator. Use of hBOOL is also minimized.*)
paulson@22078
    60
val minimize_applies = ref true;
paulson@22064
    61
paulson@22064
    62
val const_min_arity = ref (Symtab.empty : int Symtab.table);
paulson@22064
    63
paulson@22064
    64
val const_needs_hBOOL = ref (Symtab.empty : bool Symtab.table);
paulson@22064
    65
paulson@22064
    66
fun min_arity_of c = getOpt (Symtab.lookup(!const_min_arity) c, 0);
paulson@22064
    67
paulson@22825
    68
(*True if the constant ever appears outside of the top-level position in literals.
paulson@22825
    69
  If false, the constant always receives all of its arguments and is used as a predicate.*)
paulson@24385
    70
fun needs_hBOOL c = not (!minimize_applies) orelse
paulson@22064
    71
                    getOpt (Symtab.lookup(!const_needs_hBOOL) c, false);
paulson@22064
    72
mengj@19198
    73
mengj@17998
    74
(******************************************************)
mengj@17998
    75
(* data types for typed combinator expressions        *)
mengj@17998
    76
(******************************************************)
mengj@17998
    77
mengj@17998
    78
type axiom_name = string;
mengj@17998
    79
type polarity = bool;
mengj@17998
    80
type clause_id = int;
mengj@17998
    81
paulson@23386
    82
datatype combterm = CombConst of string * RC.fol_type * RC.fol_type list (*Const and Free*)
wenzelm@24311
    83
                  | CombVar of string * RC.fol_type
wenzelm@24311
    84
                  | CombApp of combterm * combterm
wenzelm@24311
    85
mengj@17998
    86
datatype literal = Literal of polarity * combterm;
mengj@17998
    87
wenzelm@24311
    88
datatype clause =
wenzelm@24311
    89
         Clause of {clause_id: clause_id,
wenzelm@24311
    90
                    axiom_name: axiom_name,
wenzelm@24311
    91
                    th: thm,
wenzelm@24311
    92
                    kind: RC.kind,
wenzelm@24311
    93
                    literals: literal list,
paulson@24940
    94
                    ctypes_sorts: typ list};
mengj@17998
    95
mengj@17998
    96
mengj@17998
    97
(*********************************************************************)
mengj@17998
    98
(* convert a clause with type Term.term to a clause with type clause *)
mengj@17998
    99
(*********************************************************************)
mengj@17998
   100
paulson@21561
   101
fun isFalse (Literal(pol, CombConst(c,_,_))) =
paulson@20360
   102
      (pol andalso c = "c_False") orelse
paulson@20360
   103
      (not pol andalso c = "c_True")
mengj@17998
   104
  | isFalse _ = false;
mengj@17998
   105
paulson@21561
   106
fun isTrue (Literal (pol, CombConst(c,_,_))) =
mengj@17998
   107
      (pol andalso c = "c_True") orelse
mengj@17998
   108
      (not pol andalso c = "c_False")
mengj@17998
   109
  | isTrue _ = false;
wenzelm@24311
   110
wenzelm@24311
   111
fun isTaut (Clause {literals,...}) = exists isTrue literals;
mengj@17998
   112
mengj@18440
   113
fun type_of (Type (a, Ts)) =
paulson@21561
   114
      let val (folTypes,ts) = types_of Ts
paulson@22078
   115
      in  (RC.Comp(RC.make_fixed_type_const a, folTypes), ts)  end
mengj@18440
   116
  | type_of (tp as (TFree(a,s))) =
paulson@24940
   117
      (RC.AtomF (RC.make_fixed_type_var a), [tp])
mengj@18440
   118
  | type_of (tp as (TVar(v,s))) =
paulson@24940
   119
      (RC.AtomV (RC.make_schematic_type_var v), [tp])
mengj@18440
   120
and types_of Ts =
paulson@22078
   121
      let val (folTyps,ts) = ListPair.unzip (map type_of Ts)
paulson@22078
   122
      in  (folTyps, RC.union_all ts)  end;
mengj@17998
   123
mengj@17998
   124
(* same as above, but no gathering of sort information *)
wenzelm@24311
   125
fun simp_type_of (Type (a, Ts)) =
paulson@22078
   126
      RC.Comp(RC.make_fixed_type_const a, map simp_type_of Ts)
paulson@22078
   127
  | simp_type_of (TFree (a,s)) = RC.AtomF(RC.make_fixed_type_var a)
paulson@22078
   128
  | simp_type_of (TVar (v,s)) = RC.AtomV(RC.make_schematic_type_var v);
mengj@18440
   129
mengj@18356
   130
wenzelm@24323
   131
fun const_type_of thy (c,t) =
paulson@22078
   132
      let val (tp,ts) = type_of t
wenzelm@24323
   133
      in  (tp, ts, map simp_type_of (Sign.const_typargs thy (c,t))) end;
mengj@18356
   134
mengj@17998
   135
(* convert a Term.term (with combinators) into a combterm, also accummulate sort info *)
wenzelm@24323
   136
fun combterm_of thy (Const(c,t)) =
wenzelm@24323
   137
      let val (tp,ts,tvar_list) = const_type_of thy (c,t)
wenzelm@24311
   138
          val c' = CombConst(RC.make_fixed_const c, tp, tvar_list)
paulson@22078
   139
      in  (c',ts)  end
wenzelm@24323
   140
  | combterm_of thy (Free(v,t)) =
paulson@21513
   141
      let val (tp,ts) = type_of t
paulson@25243
   142
          val v' = CombConst(RC.make_fixed_var v, tp, [])
paulson@22078
   143
      in  (v',ts)  end
wenzelm@24323
   144
  | combterm_of thy (Var(v,t)) =
paulson@21513
   145
      let val (tp,ts) = type_of t
wenzelm@24311
   146
          val v' = CombVar(RC.make_schematic_var v,tp)
paulson@22078
   147
      in  (v',ts)  end
paulson@24385
   148
  | combterm_of thy (P $ Q) =
wenzelm@24323
   149
      let val (P',tsP) = combterm_of thy P
wenzelm@24323
   150
          val (Q',tsQ) = combterm_of thy Q
paulson@24385
   151
      in  (CombApp(P',Q'), tsP union tsQ)  end
paulson@24385
   152
  | combterm_of thy (t as Abs _) = raise RC.CLAUSE("HOL CLAUSE",t);
mengj@17998
   153
wenzelm@24323
   154
fun predicate_of thy ((Const("Not",_) $ P), polarity) = predicate_of thy (P, not polarity)
paulson@25008
   155
  | predicate_of thy (t,polarity) = (combterm_of thy (Envir.eta_contract t), polarity);
mengj@17998
   156
wenzelm@24323
   157
fun literals_of_term1 thy args (Const("Trueprop",_) $ P) = literals_of_term1 thy args P
wenzelm@24323
   158
  | literals_of_term1 thy args (Const("op |",_) $ P $ Q) =
wenzelm@24323
   159
      literals_of_term1 thy (literals_of_term1 thy args P) Q
wenzelm@24323
   160
  | literals_of_term1 thy (lits,ts) P =
wenzelm@24323
   161
      let val ((pred,ts'),pol) = predicate_of thy (P,true)
paulson@21509
   162
      in
wenzelm@24311
   163
          (Literal(pol,pred)::lits, ts union ts')
paulson@21509
   164
      end;
mengj@17998
   165
wenzelm@24323
   166
fun literals_of_term thy P = literals_of_term1 thy ([],[]) P;
mengj@17998
   167
wenzelm@28835
   168
(* Problem too trivial for resolution (empty clause) *)
wenzelm@28835
   169
exception TOO_TRIVIAL;
wenzelm@28835
   170
mengj@17998
   171
(* making axiom and conjecture clauses *)
wenzelm@24323
   172
fun make_clause thy (clause_id,axiom_name,kind,th) =
paulson@24385
   173
    let val (lits,ctypes_sorts) = literals_of_term thy (prop_of th)
mengj@17998
   174
    in
wenzelm@24311
   175
        if forall isFalse lits
wenzelm@28835
   176
        then raise TOO_TRIVIAL
wenzelm@24311
   177
        else
wenzelm@24311
   178
            Clause {clause_id = clause_id, axiom_name = axiom_name, th = th, kind = kind,
paulson@24937
   179
                    literals = lits, ctypes_sorts = ctypes_sorts}
mengj@17998
   180
    end;
mengj@17998
   181
mengj@20016
   182
wenzelm@24323
   183
fun add_axiom_clause thy ((th,(name,id)), pairs) =
wenzelm@24323
   184
  let val cls = make_clause thy (id, name, RC.Axiom, th)
paulson@21573
   185
  in
paulson@21573
   186
      if isTaut cls then pairs else (name,cls)::pairs
paulson@21573
   187
  end;
mengj@19354
   188
wenzelm@24323
   189
fun make_axiom_clauses thy = foldl (add_axiom_clause thy) [];
mengj@19354
   190
wenzelm@24323
   191
fun make_conjecture_clauses_aux _ _ [] = []
wenzelm@24323
   192
  | make_conjecture_clauses_aux thy n (th::ths) =
wenzelm@24323
   193
      make_clause thy (n,"conjecture", RC.Conjecture, th) ::
wenzelm@24323
   194
      make_conjecture_clauses_aux thy (n+1) ths;
mengj@17998
   195
wenzelm@24323
   196
fun make_conjecture_clauses thy = make_conjecture_clauses_aux thy 0;
mengj@17998
   197
mengj@17998
   198
mengj@17998
   199
(**********************************************************************)
mengj@17998
   200
(* convert clause into ATP specific formats:                          *)
mengj@17998
   201
(* TPTP used by Vampire and E                                         *)
mengj@19720
   202
(* DFG used by SPASS                                                  *)
mengj@17998
   203
(**********************************************************************)
mengj@17998
   204
paulson@22078
   205
(*Result of a function type; no need to check that the argument type matches.*)
paulson@22078
   206
fun result_type (RC.Comp ("tc_fun", [_, tp2])) = tp2
wenzelm@27187
   207
  | result_type _ = error "result_type"
paulson@22078
   208
paulson@21513
   209
fun type_of_combterm (CombConst(c,tp,_)) = tp
paulson@21513
   210
  | type_of_combterm (CombVar(v,tp)) = tp
paulson@22078
   211
  | type_of_combterm (CombApp(t1,t2)) = result_type (type_of_combterm t1);
mengj@17998
   212
paulson@22064
   213
(*gets the head of a combinator application, along with the list of arguments*)
paulson@22064
   214
fun strip_comb u =
paulson@22078
   215
    let fun stripc (CombApp(t,u), ts) = stripc (t, u::ts)
paulson@22064
   216
        |   stripc  x =  x
paulson@22064
   217
    in  stripc(u,[])  end;
paulson@22064
   218
paulson@22851
   219
val type_wrapper = "ti";
paulson@22851
   220
paulson@22851
   221
fun head_needs_hBOOL (CombConst(c,_,_)) = needs_hBOOL c
paulson@22851
   222
  | head_needs_hBOOL _ = true;
paulson@22851
   223
wenzelm@24311
   224
fun wrap_type (s, tp) =
paulson@22851
   225
  if !typ_level=T_FULL then
paulson@22851
   226
      type_wrapper ^ RC.paren_pack [s, RC.string_of_fol_type tp]
paulson@22851
   227
  else s;
wenzelm@24311
   228
paulson@22851
   229
fun apply ss = "hAPP" ^ RC.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
paulson@22064
   236
(*Apply an operator to the argument strings, using either the "apply" operator or
paulson@22064
   237
  direct function application.*)
paulson@22851
   238
fun string_of_applic (CombConst(c,tp,tvars), args) =
paulson@22064
   239
      let val c = if c = "equal" then "c_fequal" else c
paulson@22064
   240
          val nargs = min_arity_of c
paulson@22851
   241
          val args1 = List.take(args, nargs)
wenzelm@27187
   242
            handle Subscript => error ("string_of_applic: " ^ c ^ " has arity " ^
wenzelm@27187
   243
                                         Int.toString nargs ^ " but is applied to " ^
wenzelm@27187
   244
                                         space_implode ", " args)
paulson@22064
   245
          val args2 = List.drop(args, nargs)
paulson@22851
   246
          val targs = if !typ_level = T_CONST then map RC.string_of_fol_type tvars
paulson@22851
   247
                      else []
paulson@21513
   248
      in
wenzelm@24311
   249
          string_apply (c ^ RC.paren_pack (args1@targs), args2)
paulson@21513
   250
      end
paulson@22851
   251
  | string_of_applic (CombVar(v,tp), args) = string_apply (v, args)
wenzelm@27187
   252
  | string_of_applic _ = error "string_of_applic";
paulson@22064
   253
paulson@22851
   254
fun wrap_type_if (head, s, tp) = if head_needs_hBOOL head then wrap_type (s, tp) else s;
wenzelm@24311
   255
paulson@24385
   256
fun string_of_combterm t =
paulson@22064
   257
  let val (head, args) = strip_comb t
wenzelm@24311
   258
  in  wrap_type_if (head,
paulson@24385
   259
                    string_of_applic (head, map string_of_combterm args),
paulson@22851
   260
                    type_of_combterm t)
paulson@22851
   261
  end;
mengj@18356
   262
paulson@22064
   263
(*Boolean-valued terms are here converted to literals.*)
paulson@22078
   264
fun boolify t = "hBOOL" ^ RC.paren_pack [string_of_combterm t];
paulson@22064
   265
wenzelm@24311
   266
fun string_of_predicate t =
paulson@22064
   267
  case t of
paulson@22078
   268
      (CombApp(CombApp(CombConst("equal",_,_), t1), t2)) =>
wenzelm@24311
   269
          (*DFG only: new TPTP prefers infix equality*)
wenzelm@24311
   270
          ("equal" ^ RC.paren_pack [string_of_combterm t1, string_of_combterm t2])
wenzelm@24311
   271
    | _ =>
paulson@22064
   272
          case #1 (strip_comb t) of
paulson@22064
   273
              CombConst(c,_,_) => if needs_hBOOL c then boolify t else string_of_combterm t
paulson@22064
   274
            | _ => boolify t;
mengj@18356
   275
wenzelm@24311
   276
fun string_of_clausename (cls_id,ax_name) =
paulson@22078
   277
    RC.clause_prefix ^ RC.ascii_of ax_name ^ "_" ^ Int.toString cls_id;
mengj@17998
   278
wenzelm@24311
   279
fun string_of_type_clsname (cls_id,ax_name,idx) =
mengj@17998
   280
    string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx);
mengj@17998
   281
mengj@17998
   282
paulson@21561
   283
(*** tptp format ***)
mengj@19720
   284
paulson@21513
   285
fun tptp_of_equality pol (t1,t2) =
paulson@21513
   286
  let val eqop = if pol then " = " else " != "
paulson@21513
   287
  in  string_of_combterm t1 ^ eqop ^ string_of_combterm t2  end;
paulson@21513
   288
wenzelm@24311
   289
fun tptp_literal (Literal(pol, CombApp(CombApp(CombConst("equal",_,_), t1), t2))) =
paulson@21513
   290
      tptp_of_equality pol (t1,t2)
wenzelm@24311
   291
  | tptp_literal (Literal(pol,pred)) =
paulson@22078
   292
      RC.tptp_sign pol (string_of_predicate pred);
wenzelm@24311
   293
paulson@22064
   294
(*Given a clause, returns its literals paired with a list of literals concerning TFrees;
paulson@22064
   295
  the latter should only occur in conjecture clauses.*)
paulson@24937
   296
fun tptp_type_lits pos (Clause{literals, ctypes_sorts, ...}) =
paulson@24937
   297
      (map tptp_literal literals, 
paulson@24937
   298
       map (RC.tptp_of_typeLit pos) (RC.add_typs ctypes_sorts));
wenzelm@24311
   299
paulson@21509
   300
fun clause2tptp (cls as Clause{axiom_name,clause_id,kind,ctypes_sorts,...}) =
paulson@24937
   301
  let val (lits,tylits) = tptp_type_lits (kind = RC.Conjecture) cls
paulson@24937
   302
  in
paulson@24937
   303
      (RC.gen_tptp_cls(clause_id,axiom_name,kind,lits,tylits), tylits)
paulson@24937
   304
  end;
mengj@17998
   305
mengj@17998
   306
paulson@21561
   307
(*** dfg format ***)
paulson@21561
   308
paulson@22078
   309
fun dfg_literal (Literal(pol,pred)) = RC.dfg_sign pol (string_of_predicate pred);
mengj@19720
   310
paulson@24937
   311
fun dfg_type_lits pos (Clause{literals, ctypes_sorts, ...}) =
paulson@24937
   312
      (map dfg_literal literals, 
paulson@24937
   313
       map (RC.dfg_of_typeLit pos) (RC.add_typs ctypes_sorts));
mengj@19720
   314
paulson@22078
   315
fun get_uvars (CombConst _) vars = vars
paulson@22078
   316
  | get_uvars (CombVar(v,_)) vars = (v::vars)
paulson@22078
   317
  | get_uvars (CombApp(P,Q)) vars = get_uvars P (get_uvars Q vars);
mengj@19720
   318
mengj@19720
   319
fun get_uvars_l (Literal(_,c)) = get_uvars c [];
mengj@19720
   320
paulson@22078
   321
fun dfg_vars (Clause {literals,...}) = RC.union_all (map get_uvars_l literals);
wenzelm@24311
   322
mengj@19720
   323
fun clause2dfg (cls as Clause{axiom_name,clause_id,kind,ctypes_sorts,...}) =
paulson@24937
   324
  let val (lits,tylits) = dfg_type_lits (kind = RC.Conjecture) cls
paulson@24937
   325
      val vars = dfg_vars cls
paulson@24937
   326
      val tvars = RC.get_tvar_strs ctypes_sorts
paulson@24937
   327
  in
paulson@24937
   328
      (RC.gen_dfg_cls(clause_id, axiom_name, kind, lits, tylits, tvars@vars), tylits)
paulson@24937
   329
  end;
paulson@24937
   330
mengj@19720
   331
paulson@22064
   332
(** For DFG format: accumulate function and predicate declarations **)
mengj@19720
   333
paulson@22078
   334
fun addtypes tvars tab = foldl RC.add_foltype_funcs tab tvars;
mengj@19720
   335
paulson@22825
   336
fun add_decls (CombConst(c,tp,tvars), (funcs,preds)) =
paulson@22064
   337
      if c = "equal" then (addtypes tvars funcs, preds)
paulson@21561
   338
      else
paulson@24385
   339
	let val arity = min_arity_of c
paulson@24385
   340
	    val ntys = if !typ_level = T_CONST then length tvars else 0
paulson@24385
   341
	    val addit = Symtab.update(c, arity+ntys)
paulson@24385
   342
	in
paulson@24385
   343
	    if needs_hBOOL c then (addtypes tvars (addit funcs), preds)
paulson@24385
   344
	    else (addtypes tvars funcs, addit preds)
paulson@24385
   345
	end
wenzelm@24311
   346
  | add_decls (CombVar(_,ctp), (funcs,preds)) =
paulson@22078
   347
      (RC.add_foltype_funcs (ctp,funcs), preds)
paulson@22078
   348
  | add_decls (CombApp(P,Q),decls) = add_decls(P,add_decls (Q,decls));
mengj@19720
   349
paulson@22064
   350
fun add_literal_decls (Literal(_,c), decls) = add_decls (c,decls);
mengj@19720
   351
paulson@22064
   352
fun add_clause_decls (Clause {literals, ...}, decls) =
paulson@22064
   353
    foldl add_literal_decls decls literals
wenzelm@27187
   354
    handle Symtab.DUP a => error ("function " ^ a ^ " has multiple arities")
mengj@19720
   355
paulson@22064
   356
fun decls_of_clauses clauses arity_clauses =
paulson@24385
   357
  let val init_functab = Symtab.update (type_wrapper,2) (Symtab.update ("hAPP",2) RC.init_functab)
paulson@22064
   358
      val init_predtab = Symtab.update ("hBOOL",1) Symtab.empty
paulson@22064
   359
      val (functab,predtab) = (foldl add_clause_decls (init_functab, init_predtab) clauses)
paulson@22064
   360
  in
wenzelm@24311
   361
      (Symtab.dest (foldl RC.add_arityClause_funcs functab arity_clauses),
paulson@22064
   362
       Symtab.dest predtab)
paulson@22064
   363
  end;
mengj@19720
   364
paulson@21398
   365
fun add_clause_preds (Clause {ctypes_sorts, ...}, preds) =
paulson@22078
   366
  foldl RC.add_type_sort_preds preds ctypes_sorts
wenzelm@27187
   367
  handle Symtab.DUP a => error ("predicate " ^ a ^ " has multiple arities")
paulson@21398
   368
paulson@21398
   369
(*Higher-order clauses have only the predicates hBOOL and type classes.*)
wenzelm@24311
   370
fun preds_of_clauses clauses clsrel_clauses arity_clauses =
mengj@19720
   371
    Symtab.dest
wenzelm@24311
   372
        (foldl RC.add_classrelClause_preds
wenzelm@24311
   373
               (foldl RC.add_arityClause_preds
wenzelm@24311
   374
                      (foldl add_clause_preds Symtab.empty clauses)
wenzelm@24311
   375
                      arity_clauses)
wenzelm@24311
   376
               clsrel_clauses)
mengj@19720
   377
mengj@18440
   378
mengj@18440
   379
(**********************************************************************)
mengj@19198
   380
(* write clauses to files                                             *)
mengj@19198
   381
(**********************************************************************)
mengj@19198
   382
paulson@21573
   383
val init_counters =
paulson@21573
   384
    Symtab.make [("c_COMBI", 0), ("c_COMBK", 0),
wenzelm@24311
   385
                 ("c_COMBB", 0), ("c_COMBC", 0),
paulson@24943
   386
                 ("c_COMBS", 0)];
wenzelm@24311
   387
wenzelm@24311
   388
fun count_combterm (CombConst(c,tp,_), ct) =
paulson@21573
   389
     (case Symtab.lookup ct c of NONE => ct  (*no counter*)
paulson@21573
   390
                               | SOME n => Symtab.update (c,n+1) ct)
paulson@21573
   391
  | count_combterm (CombVar(v,tp), ct) = ct
paulson@22078
   392
  | count_combterm (CombApp(t1,t2), ct) = count_combterm(t1, count_combterm(t2, ct));
paulson@21573
   393
paulson@21573
   394
fun count_literal (Literal(_,t), ct) = count_combterm(t,ct);
paulson@21573
   395
paulson@21573
   396
fun count_clause (Clause{literals,...}, ct) = foldl count_literal ct literals;
paulson@21573
   397
wenzelm@24311
   398
fun count_user_clause user_lemmas (Clause{axiom_name,literals,...}, ct) =
paulson@21573
   399
  if axiom_name mem_string user_lemmas then foldl count_literal ct literals
paulson@21573
   400
  else ct;
paulson@21573
   401
wenzelm@27178
   402
fun cnf_helper_thms thy =
wenzelm@27178
   403
  ResAxioms.cnf_rules_pairs thy o map ResAxioms.pairname
mengj@20644
   404
wenzelm@24323
   405
fun get_helper_clauses thy isFO (conjectures, axclauses, user_lemmas) =
paulson@23386
   406
  if isFO then []  (*first-order*)
paulson@23386
   407
  else
paulson@22064
   408
    let val ct0 = foldl count_clause init_counters conjectures
paulson@22064
   409
        val ct = foldl (count_user_clause user_lemmas) ct0 axclauses
paulson@22064
   410
        fun needed c = valOf (Symtab.lookup ct c) > 0
wenzelm@24311
   411
        val IK = if needed "c_COMBI" orelse needed "c_COMBK"
wenzelm@27178
   412
                 then (Output.debug (fn () => "Include combinator I K"); cnf_helper_thms thy [comb_I,comb_K])
wenzelm@24311
   413
                 else []
wenzelm@24311
   414
        val BC = if needed "c_COMBB" orelse needed "c_COMBC"
wenzelm@27178
   415
                 then (Output.debug (fn () => "Include combinator B C"); cnf_helper_thms thy [comb_B,comb_C])
paulson@21135
   416
                 else []
wenzelm@24311
   417
        val S = if needed "c_COMBS"
wenzelm@27178
   418
                then (Output.debug (fn () => "Include combinator S"); cnf_helper_thms thy [comb_S])
wenzelm@24311
   419
                else []
wenzelm@27178
   420
        val other = cnf_helper_thms thy [ext,fequal_imp_equal,equal_imp_fequal]
mengj@20791
   421
    in
paulson@24943
   422
        map #2 (make_axiom_clauses thy (other @ IK @ BC @ S))
paulson@23386
   423
    end;
mengj@20791
   424
paulson@22064
   425
(*Find the minimal arity of each function mentioned in the term. Also, note which uses
paulson@22064
   426
  are not at top level, to see if hBOOL is needed.*)
paulson@22064
   427
fun count_constants_term toplev t =
paulson@22064
   428
  let val (head, args) = strip_comb t
paulson@22064
   429
      val n = length args
paulson@22064
   430
      val _ = List.app (count_constants_term false) args
paulson@22064
   431
  in
paulson@22064
   432
      case head of
wenzelm@24311
   433
          CombConst (a,_,_) => (*predicate or function version of "equal"?*)
wenzelm@24311
   434
            let val a = if a="equal" andalso not toplev then "c_fequal" else a
wenzelm@24311
   435
            in
wenzelm@24311
   436
              const_min_arity := Symtab.map_default (a,n) (curry Int.min n) (!const_min_arity);
wenzelm@24311
   437
              if toplev then ()
wenzelm@24311
   438
              else const_needs_hBOOL := Symtab.update (a,true) (!const_needs_hBOOL)
wenzelm@24311
   439
            end
wenzelm@24311
   440
        | ts => ()
paulson@22064
   441
  end;
paulson@22064
   442
paulson@22064
   443
(*A literal is a top-level term*)
paulson@22064
   444
fun count_constants_lit (Literal (_,t)) = count_constants_term true t;
paulson@22064
   445
paulson@22064
   446
fun count_constants_clause (Clause{literals,...}) = List.app count_constants_lit literals;
paulson@22064
   447
paulson@22064
   448
fun display_arity (c,n) =
wenzelm@24311
   449
  Output.debug (fn () => "Constant: " ^ c ^ " arity:\t" ^ Int.toString n ^
paulson@22064
   450
                (if needs_hBOOL c then " needs hBOOL" else ""));
paulson@22064
   451
wenzelm@24311
   452
fun count_constants (conjectures, axclauses, helper_clauses) =
paulson@24385
   453
  if !minimize_applies then
wenzelm@24311
   454
    (const_min_arity := Symtab.empty;
paulson@23386
   455
     const_needs_hBOOL := Symtab.empty;
paulson@23386
   456
     List.app count_constants_clause conjectures;
paulson@22064
   457
     List.app count_constants_clause axclauses;
paulson@22064
   458
     List.app count_constants_clause helper_clauses;
paulson@22064
   459
     List.app display_arity (Symtab.dest (!const_min_arity)))
paulson@22064
   460
  else ();
paulson@22064
   461
mengj@20791
   462
(* tptp format *)
wenzelm@24311
   463
mengj@19198
   464
(* write TPTP format to a single file *)
wenzelm@24323
   465
fun tptp_write_file thy isFO thms filename (ax_tuples,classrel_clauses,arity_clauses) user_lemmas =
paulson@23386
   466
    let val _ = Output.debug (fn () => ("Preparing to write the TPTP file " ^ filename))
paulson@23386
   467
        val _ = RC.dfg_format := false
wenzelm@24323
   468
        val conjectures = make_conjecture_clauses thy thms
wenzelm@24323
   469
        val (clnames,axclauses) = ListPair.unzip (make_axiom_clauses thy ax_tuples)
wenzelm@24323
   470
        val helper_clauses = get_helper_clauses thy isFO (conjectures, axclauses, user_lemmas)
wenzelm@24311
   471
        val _ = count_constants (conjectures, axclauses, helper_clauses);
wenzelm@24311
   472
        val (tptp_clss,tfree_litss) = ListPair.unzip (map clause2tptp conjectures)
wenzelm@24311
   473
        val tfree_clss = map RC.tptp_tfree_clause (foldl (op union_string) [] tfree_litss)
paulson@22064
   474
        val out = TextIO.openOut filename
mengj@19198
   475
    in
wenzelm@24311
   476
        List.app (curry TextIO.output out o #1 o clause2tptp) axclauses;
wenzelm@24311
   477
        RC.writeln_strs out tfree_clss;
wenzelm@24311
   478
        RC.writeln_strs out tptp_clss;
wenzelm@24311
   479
        List.app (curry TextIO.output out o RC.tptp_classrelClause) classrel_clauses;
wenzelm@24311
   480
        List.app (curry TextIO.output out o RC.tptp_arity_clause) arity_clauses;
wenzelm@24311
   481
        List.app (curry TextIO.output out o #1 o clause2tptp) helper_clauses;
wenzelm@24311
   482
        TextIO.closeOut out;
wenzelm@24311
   483
        clnames
mengj@19198
   484
    end;
mengj@19198
   485
mengj@19720
   486
mengj@19720
   487
(* dfg format *)
mengj@19720
   488
wenzelm@24323
   489
fun dfg_write_file thy isFO thms filename (ax_tuples,classrel_clauses,arity_clauses) user_lemmas =
paulson@23386
   490
    let val _ = Output.debug (fn () => ("Preparing to write the DFG file " ^ filename))
paulson@23386
   491
        val _ = RC.dfg_format := true
wenzelm@24323
   492
        val conjectures = make_conjecture_clauses thy thms
wenzelm@24323
   493
        val (clnames,axclauses) = ListPair.unzip (make_axiom_clauses thy ax_tuples)
wenzelm@24323
   494
        val helper_clauses = get_helper_clauses thy isFO (conjectures, axclauses, user_lemmas)
wenzelm@24311
   495
        val _ = count_constants (conjectures, axclauses, helper_clauses);
wenzelm@24323
   496
        val (dfg_clss, tfree_litss) = ListPair.unzip (map clause2dfg conjectures)
wenzelm@24311
   497
        and probname = Path.implode (Path.base (Path.explode filename))
wenzelm@24311
   498
        val axstrs = map (#1 o clause2dfg) axclauses
wenzelm@24311
   499
        val tfree_clss = map RC.dfg_tfree_clause (RC.union_all tfree_litss)
wenzelm@24311
   500
        val out = TextIO.openOut filename
wenzelm@24311
   501
        val helper_clauses_strs = map (#1 o clause2dfg) helper_clauses
wenzelm@24311
   502
        val (funcs,cl_preds) = decls_of_clauses (helper_clauses @ conjectures @ axclauses) arity_clauses
wenzelm@24311
   503
        and ty_preds = preds_of_clauses axclauses classrel_clauses arity_clauses
mengj@19720
   504
    in
wenzelm@24311
   505
        TextIO.output (out, RC.string_of_start probname);
wenzelm@24311
   506
        TextIO.output (out, RC.string_of_descrip probname);
wenzelm@24311
   507
        TextIO.output (out, RC.string_of_symbols
wenzelm@24311
   508
                              (RC.string_of_funcs funcs)
wenzelm@24311
   509
                              (RC.string_of_preds (cl_preds @ ty_preds)));
wenzelm@24311
   510
        TextIO.output (out, "list_of_clauses(axioms,cnf).\n");
wenzelm@24311
   511
        RC.writeln_strs out axstrs;
wenzelm@24311
   512
        List.app (curry TextIO.output out o RC.dfg_classrelClause) classrel_clauses;
wenzelm@24311
   513
        List.app (curry TextIO.output out o RC.dfg_arity_clause) arity_clauses;
wenzelm@24311
   514
        RC.writeln_strs out helper_clauses_strs;
wenzelm@24311
   515
        TextIO.output (out, "end_of_list.\n\nlist_of_clauses(conjectures,cnf).\n");
wenzelm@24311
   516
        RC.writeln_strs out tfree_clss;
wenzelm@24311
   517
        RC.writeln_strs out dfg_clss;
wenzelm@24311
   518
        TextIO.output (out, "end_of_list.\n\n");
wenzelm@24311
   519
        (*VarWeight=3 helps the HO problems, probably by counteracting the presence of hAPP*)
wenzelm@24311
   520
        TextIO.output (out, "list_of_settings(SPASS).\n{*\nset_flag(VarWeight,3).\n*}\nend_of_list.\n\n");
wenzelm@24311
   521
        TextIO.output (out, "end_problem.\n");
wenzelm@24311
   522
        TextIO.closeOut out;
wenzelm@24311
   523
        clnames
mengj@19720
   524
    end;
mengj@19720
   525
wenzelm@21254
   526
end