src/HOL/Tools/res_hol_clause.ML
author mengj
Thu Oct 05 13:54:17 2006 +0200 (2006-10-05)
changeset 20865 2cfa020109c1
parent 20864 bb75b876b260
child 20953 1ea394dc2a0f
permissions -rw-r--r--
Changed and removed some functions related to combinators, since they are Isabelle constants now.
mengj@17998
     1
(* ID: $Id$ 
mengj@17998
     2
   Author: Jia Meng, NICTA
mengj@17998
     3
mengj@17998
     4
FOL clauses translated from HOL formulae.  Combinators are used to represent lambda terms.
mengj@17998
     5
mengj@17998
     6
*)
mengj@17998
     7
mengj@17998
     8
structure ResHolClause =
mengj@17998
     9
mengj@17998
    10
struct
mengj@17998
    11
mengj@20791
    12
(* theorems for combinators and function extensionality *)
mengj@20791
    13
val ext = thm "HOL.ext";
mengj@20791
    14
val comb_I = thm "Reconstruction.COMBI_def";
mengj@20791
    15
val comb_K = thm "Reconstruction.COMBK_def";
mengj@20791
    16
val comb_B = thm "Reconstruction.COMBB_def";
mengj@20791
    17
val comb_C = thm "Reconstruction.COMBC_def";
mengj@20791
    18
val comb_S = thm "Reconstruction.COMBS_def";
mengj@20791
    19
val comb_B' = thm "Reconstruction.COMBB'_def";
mengj@20791
    20
val comb_C' = thm "Reconstruction.COMBC'_def";
mengj@20791
    21
val comb_S' = thm "Reconstruction.COMBS'_def";
mengj@20791
    22
val fequal_imp_equal = thm "Reconstruction.fequal_imp_equal";
mengj@20791
    23
val equal_imp_fequal = thm "Reconstruction.equal_imp_fequal";
mengj@20791
    24
mengj@20791
    25
mengj@20644
    26
(* a flag to set if we use extra combinators B',C',S' *)
mengj@20644
    27
val use_combB'C'S' = ref true;
mengj@17998
    28
mengj@20644
    29
val combI_count = ref 0;
mengj@20644
    30
val combK_count = ref 0;
mengj@20644
    31
val combB_count = ref 0;
mengj@20644
    32
val combC_count = ref 0;
mengj@20644
    33
val combS_count = ref 0;
mengj@20644
    34
mengj@20644
    35
val combB'_count = ref 0;
mengj@20644
    36
val combC'_count = ref 0;
mengj@20644
    37
val combS'_count = ref 0; 
mengj@20644
    38
mengj@17998
    39
mengj@20644
    40
fun increI count_comb =  if count_comb then combI_count := !combI_count + 1 else ();
mengj@20644
    41
fun increK count_comb =  if count_comb then combK_count := !combK_count + 1 else ();
mengj@20644
    42
fun increB count_comb =  if count_comb then combB_count := !combB_count + 1 else ();
mengj@20644
    43
fun increC count_comb =  if count_comb then combC_count := !combC_count + 1 else ();
mengj@20644
    44
fun increS count_comb =  if count_comb then combS_count := !combS_count + 1 else (); 
mengj@20644
    45
fun increB' count_comb =  if count_comb then combB'_count := !combB'_count + 1 else (); 
mengj@20644
    46
fun increC' count_comb =  if count_comb then combC'_count := !combC'_count + 1 else ();
mengj@20644
    47
fun increS' count_comb =  if count_comb then combS'_count := !combS'_count + 1 else (); 
mengj@20644
    48
mengj@20644
    49
mengj@20644
    50
exception DECRE_COMB of string;
mengj@20644
    51
fun decreB count_comb n = if count_comb then (if !combB_count >= n then combB_count := !combB_count - n else raise (DECRE_COMB "COMBB")) else ();
mengj@20644
    52
mengj@20644
    53
fun decreC count_comb n = if count_comb then (if !combC_count >= n then combC_count := !combC_count - n else raise (DECRE_COMB "COMBC")) else ();
mengj@20644
    54
mengj@20644
    55
fun decreS count_comb n = if count_comb then (if !combS_count >= n then combS_count := !combS_count - n else raise (DECRE_COMB "COMBS")) else ();
mengj@20644
    56
mengj@20130
    57
mengj@18356
    58
val const_typargs = ref (Library.K [] : (string*typ -> typ list));
mengj@18356
    59
mengj@20644
    60
fun init thy = (combI_count:=0; combK_count:=0;combB_count:=0;combC_count:=0;combS_count:=0;combB'_count:=0;combC'_count:=0;combS'_count:=0;
paulson@20022
    61
                const_typargs := Sign.const_typargs thy);
mengj@19198
    62
mengj@17998
    63
(**********************************************************************)
mengj@17998
    64
(* convert a Term.term with lambdas into a Term.term with combinators *) 
mengj@17998
    65
(**********************************************************************)
mengj@17998
    66
mengj@17998
    67
fun is_free (Bound(a)) n = (a = n)
mengj@17998
    68
  | is_free (Abs(x,_,b)) n = (is_free b (n+1))
mengj@17998
    69
  | is_free (P $ Q) n = ((is_free P n) orelse (is_free Q n))
mengj@17998
    70
  | is_free _ _ = false;
mengj@17998
    71
mengj@17998
    72
mengj@17998
    73
exception BND of term;
mengj@17998
    74
mengj@17998
    75
fun decre_bndVar (Bound n) = Bound (n-1)
mengj@17998
    76
  | decre_bndVar (P $ Q) = (decre_bndVar P) $ (decre_bndVar Q)
mengj@17998
    77
  | decre_bndVar t =
mengj@17998
    78
    case t of Const(_,_) => t
mengj@17998
    79
	    | Free(_,_) => t
mengj@17998
    80
	    | Var(_,_) => t
mengj@17998
    81
	    | Abs(_,_,_) => raise BND(t); (*should not occur*)
mengj@17998
    82
mengj@17998
    83
mengj@17998
    84
(*******************************************)
mengj@20644
    85
fun mk_compact_comb (tm as (Const("COMBB",_)$p) $ (Const("COMBB",_)$q$r)) Bnds count_comb =
mengj@20644
    86
    let val tp_p = Term.type_of1(Bnds,p)
mengj@20644
    87
	val tp_q = Term.type_of1(Bnds,q)
mengj@20644
    88
	val tp_r = Term.type_of1(Bnds,r)
mengj@20644
    89
	val typ = Term.type_of1(Bnds,tm)
mengj@20644
    90
	val typ_B' = [tp_p,tp_q,tp_r] ---> typ
mengj@20644
    91
	val _ = increB' count_comb
mengj@20644
    92
	val _ = decreB count_comb 2
mengj@20644
    93
    in
mengj@20644
    94
	Const("COMBB_e",typ_B') $ p $ q $ r
mengj@20644
    95
    end
mengj@20644
    96
  | mk_compact_comb (tm as (Const("COMBC",_) $ (Const("COMBB",_)$p$q) $ r)) Bnds count_comb =
mengj@20644
    97
    let val tp_p = Term.type_of1(Bnds,p)
mengj@20644
    98
	val tp_q = Term.type_of1(Bnds,q)
mengj@20644
    99
	val tp_r = Term.type_of1(Bnds,r)
mengj@20644
   100
	val typ = Term.type_of1(Bnds,tm)
mengj@20644
   101
	val typ_C' = [tp_p,tp_q,tp_r] ---> typ
mengj@20644
   102
	val _ = increC' count_comb
mengj@20644
   103
	val _ = decreC count_comb 1
mengj@20644
   104
	val _ = decreB count_comb 1
mengj@20644
   105
    in
mengj@20644
   106
	Const("COMBC_e",typ_C') $ p $ q $ r
mengj@20644
   107
    end
mengj@20644
   108
  | mk_compact_comb (tm as (Const("COMBS",_) $ (Const("COMBB",_)$p$q) $ r)) Bnds count_comb =
mengj@20644
   109
    let val tp_p = Term.type_of1(Bnds,p)
mengj@20644
   110
	val tp_q = Term.type_of1(Bnds,q)
mengj@20644
   111
	val tp_r = Term.type_of1(Bnds,r)
mengj@20644
   112
	val typ = Term.type_of1(Bnds,tm)
mengj@20644
   113
	val typ_S' = [tp_p,tp_q,tp_r] ---> typ
mengj@20644
   114
	val _ = increS' count_comb
mengj@20644
   115
	val _ = decreS count_comb 1
mengj@20644
   116
	val _ = decreB count_comb 1
mengj@20644
   117
    in
mengj@20644
   118
	Const("COMBS_e",typ_S') $ p $ q $ r
mengj@20644
   119
    end
mengj@20644
   120
  | mk_compact_comb tm _ _ = tm;
mengj@20644
   121
mengj@20644
   122
fun compact_comb t Bnds count_comb = if !use_combB'C'S' then mk_compact_comb t Bnds count_comb else t;
mengj@20644
   123
mengj@20130
   124
fun lam2comb (Abs(x,tp,Bound 0)) _ count_comb = 
mengj@17998
   125
    let val tpI = Type("fun",[tp,tp])
mengj@20644
   126
	val _ = increI count_comb
mengj@17998
   127
    in 
mengj@17998
   128
	Const("COMBI",tpI) 
mengj@17998
   129
    end
mengj@20130
   130
  | lam2comb (Abs(x,tp,Bound n)) Bnds count_comb = 
mengj@18356
   131
    let val (Bound n') = decre_bndVar (Bound n)
mengj@18356
   132
	val tb = List.nth(Bnds,n')
mengj@18356
   133
	val tK = Type("fun",[tb,Type("fun",[tp,tb])])
mengj@20644
   134
	val _ = increK count_comb 
mengj@18356
   135
    in
mengj@18356
   136
	Const("COMBK",tK) $ (Bound n')
mengj@18356
   137
    end
mengj@20130
   138
  | lam2comb (Abs(x,t1,Const(c,t2))) _ count_comb = 
mengj@17998
   139
    let val tK = Type("fun",[t2,Type("fun",[t1,t2])])
mengj@20644
   140
	val _ = increK count_comb 
mengj@17998
   141
    in 
mengj@17998
   142
	Const("COMBK",tK) $ Const(c,t2) 
mengj@17998
   143
    end
mengj@20130
   144
  | lam2comb (Abs(x,t1,Free(v,t2))) _ count_comb =
mengj@17998
   145
    let val tK = Type("fun",[t2,Type("fun",[t1,t2])])
mengj@20644
   146
	val _ = increK count_comb
mengj@17998
   147
    in
mengj@17998
   148
	Const("COMBK",tK) $ Free(v,t2)
mengj@17998
   149
    end
mengj@20130
   150
  | lam2comb (Abs(x,t1,Var(ind,t2))) _ count_comb =
mengj@17998
   151
    let val tK = Type("fun",[t2,Type("fun",[t1,t2])])
mengj@20644
   152
	val _ = increK count_comb 
mengj@17998
   153
    in
mengj@17998
   154
	Const("COMBK",tK) $ Var(ind,t2)
mengj@17998
   155
    end
mengj@20130
   156
  | lam2comb (t as (Abs(x,t1,P$(Bound 0)))) Bnds count_comb =
mengj@17998
   157
    let val nfreeP = not(is_free P 0)
mengj@17998
   158
	val tr = Term.type_of1(t1::Bnds,P)
mengj@17998
   159
    in
mengj@17998
   160
	if nfreeP then (decre_bndVar P)
mengj@17998
   161
	else (
mengj@17998
   162
	      let val tI = Type("fun",[t1,t1])
mengj@20130
   163
		  val P' = lam2comb (Abs(x,t1,P)) Bnds count_comb
mengj@17998
   164
		  val tp' = Term.type_of1(Bnds,P')
mengj@17998
   165
		  val tS = Type("fun",[tp',Type("fun",[tI,tr])])
mengj@20644
   166
		  val _ = increI count_comb
mengj@20644
   167
		  val _ = increS count_comb
mengj@17998
   168
	      in
mengj@20644
   169
		  compact_comb (Const("COMBS",tS) $ P' $ Const("COMBI",tI)) Bnds count_comb
mengj@17998
   170
	      end)
mengj@17998
   171
    end
mengj@17998
   172
	    
mengj@20130
   173
  | lam2comb (t as (Abs(x,t1,P$Q))) Bnds count_comb =
mengj@17998
   174
    let val (nfreeP,nfreeQ) = (not(is_free P 0),not(is_free Q 0))
mengj@17998
   175
	val tpq = Term.type_of1(t1::Bnds, P$Q) 
mengj@17998
   176
    in
mengj@17998
   177
	if(nfreeP andalso nfreeQ) then (
mengj@17998
   178
	    let val tK = Type("fun",[tpq,Type("fun",[t1,tpq])])
mengj@17998
   179
		val PQ' = decre_bndVar(P $ Q)
mengj@20644
   180
		val _ = increK count_comb
mengj@17998
   181
	    in 
mengj@17998
   182
		Const("COMBK",tK) $ PQ'
mengj@17998
   183
	    end)
mengj@17998
   184
	else (
mengj@17998
   185
	      if nfreeP then (
mengj@20130
   186
			       let val Q' = lam2comb (Abs(x,t1,Q)) Bnds count_comb
mengj@17998
   187
				   val P' = decre_bndVar P
mengj@17998
   188
				   val tp = Term.type_of1(Bnds,P')
mengj@17998
   189
				   val tq' = Term.type_of1(Bnds, Q')
mengj@17998
   190
				   val tB = Type("fun",[tp,Type("fun",[tq',Type("fun",[t1,tpq])])])
mengj@20644
   191
				   val _ = increB count_comb
mengj@17998
   192
			       in
mengj@20644
   193
				   compact_comb (Const("COMBB",tB) $ P' $ Q') Bnds count_comb 
mengj@17998
   194
			       end)
mengj@17998
   195
	      else (
mengj@17998
   196
		    if nfreeQ then (
mengj@20130
   197
				    let val P' = lam2comb (Abs(x,t1,P)) Bnds count_comb
mengj@17998
   198
					val Q' = decre_bndVar Q
mengj@17998
   199
					val tq = Term.type_of1(Bnds,Q')
mengj@17998
   200
					val tp' = Term.type_of1(Bnds, P')
mengj@17998
   201
					val tC = Type("fun",[tp',Type("fun",[tq,Type("fun",[t1,tpq])])])
mengj@20644
   202
					val _ = increC count_comb
mengj@17998
   203
				    in
mengj@20644
   204
					compact_comb (Const("COMBC",tC) $ P' $ Q') Bnds count_comb
mengj@17998
   205
				    end)
mengj@17998
   206
		    else(
mengj@20130
   207
			 let val P' = lam2comb (Abs(x,t1,P)) Bnds count_comb
mengj@20130
   208
			     val Q' = lam2comb (Abs(x,t1,Q)) Bnds count_comb 
mengj@17998
   209
			     val tp' = Term.type_of1(Bnds,P')
mengj@17998
   210
			     val tq' = Term.type_of1(Bnds,Q')
mengj@17998
   211
			     val tS = Type("fun",[tp',Type("fun",[tq',Type("fun",[t1,tpq])])])
mengj@20644
   212
			     val _ = increS count_comb
mengj@17998
   213
			 in
mengj@20644
   214
			     compact_comb (Const("COMBS",tS) $ P' $ Q') Bnds count_comb
mengj@17998
   215
			 end)))
mengj@17998
   216
    end
mengj@20791
   217
  | lam2comb (t as (Abs(x,t1,_))) _ _ = raise ResClause.CLAUSE("HOL CLAUSE",t);
mengj@17998
   218
mengj@17998
   219
(*********************)
mengj@17998
   220
mengj@20130
   221
fun to_comb (Abs(x,tp,b)) Bnds count_comb =
mengj@20130
   222
    let val b' = to_comb b (tp::Bnds) count_comb
mengj@20130
   223
    in lam2comb (Abs(x,tp,b')) Bnds count_comb end
mengj@20130
   224
  | to_comb (P $ Q) Bnds count_comb = ((to_comb P Bnds count_comb) $ (to_comb Q Bnds count_comb))
mengj@20130
   225
  | to_comb t _ _ = t;
mengj@17998
   226
 
mengj@20644
   227
   
mengj@20130
   228
fun comb_of t count_comb = to_comb t [] count_comb;
mengj@20644
   229
 
mengj@17998
   230
(* print a term containing combinators, used for debugging *)
mengj@17998
   231
exception TERM_COMB of term;
mengj@17998
   232
mengj@17998
   233
fun string_of_term (Const(c,t)) = c
mengj@17998
   234
  | string_of_term (Free(v,t)) = v
paulson@20360
   235
  | string_of_term (Var((x,n),t)) = x ^ "_" ^ (string_of_int n)
mengj@17998
   236
  | string_of_term (P $ Q) =
paulson@20360
   237
      "(" ^ string_of_term P ^ " " ^ string_of_term Q ^ ")" 
mengj@17998
   238
  | string_of_term t =  raise TERM_COMB (t);
mengj@17998
   239
mengj@17998
   240
mengj@17998
   241
mengj@17998
   242
(******************************************************)
mengj@17998
   243
(* data types for typed combinator expressions        *)
mengj@17998
   244
(******************************************************)
mengj@17998
   245
mengj@20281
   246
datatype type_level = T_FULL | T_PARTIAL | T_CONST | T_NONE;
mengj@20281
   247
mengj@20281
   248
val typ_level = ref T_CONST;
mengj@20281
   249
mengj@20281
   250
fun full_types () = (typ_level:=T_FULL);
mengj@20281
   251
fun partial_types () = (typ_level:=T_PARTIAL);
mengj@20281
   252
fun const_types_only () = (typ_level:=T_CONST);
mengj@20281
   253
fun no_types () = (typ_level:=T_NONE);
mengj@20281
   254
mengj@20281
   255
mengj@20281
   256
fun find_typ_level () = !typ_level;
mengj@20281
   257
mengj@20281
   258
mengj@17998
   259
type axiom_name = string;
mengj@17998
   260
datatype kind = Axiom | Conjecture;
paulson@20360
   261
mengj@17998
   262
fun name_of_kind Axiom = "axiom"
mengj@17998
   263
  | name_of_kind Conjecture = "conjecture";
mengj@17998
   264
mengj@17998
   265
type polarity = bool;
mengj@17998
   266
type indexname = Term.indexname;
mengj@17998
   267
type clause_id = int;
mengj@17998
   268
type csort = Term.sort;
mengj@18440
   269
type ctyp = ResClause.fol_type;
mengj@18440
   270
mengj@18440
   271
val string_of_ctyp = ResClause.string_of_fol_type;
mengj@17998
   272
mengj@17998
   273
type ctyp_var = ResClause.typ_var;
mengj@17998
   274
mengj@17998
   275
type ctype_literal = ResClause.type_literal;
mengj@17998
   276
mengj@17998
   277
mengj@18356
   278
datatype combterm = CombConst of string * ctyp * ctyp list
mengj@17998
   279
		  | CombFree of string * ctyp
mengj@17998
   280
		  | CombVar of string * ctyp
mengj@17998
   281
		  | CombApp of combterm * combterm * ctyp
mengj@19452
   282
		  | Bool of combterm;
paulson@20360
   283
		  
mengj@17998
   284
datatype literal = Literal of polarity * combterm;
mengj@17998
   285
mengj@17998
   286
datatype clause = 
mengj@17998
   287
	 Clause of {clause_id: clause_id,
mengj@17998
   288
		    axiom_name: axiom_name,
paulson@19964
   289
		    th: thm,
mengj@17998
   290
		    kind: kind,
mengj@17998
   291
		    literals: literal list,
mengj@17998
   292
		    ctypes_sorts: (ctyp_var * csort) list, 
mengj@17998
   293
                    ctvar_type_literals: ctype_literal list, 
mengj@17998
   294
                    ctfree_type_literals: ctype_literal list};
mengj@17998
   295
mengj@17998
   296
mengj@17998
   297
fun string_of_kind (Clause cls) = name_of_kind (#kind cls);
mengj@17998
   298
fun get_axiomName (Clause cls) = #axiom_name cls;
mengj@17998
   299
fun get_clause_id (Clause cls) = #clause_id cls;
mengj@17998
   300
mengj@18440
   301
fun get_literals (c as Clause(cls)) = #literals cls;
mengj@18440
   302
mengj@17998
   303
mengj@17998
   304
(*********************************************************************)
mengj@17998
   305
(* convert a clause with type Term.term to a clause with type clause *)
mengj@17998
   306
(*********************************************************************)
mengj@17998
   307
mengj@18356
   308
fun isFalse (Literal(pol,Bool(CombConst(c,_,_)))) =
paulson@20360
   309
      (pol andalso c = "c_False") orelse
paulson@20360
   310
      (not pol andalso c = "c_True")
mengj@17998
   311
  | isFalse _ = false;
mengj@17998
   312
mengj@17998
   313
mengj@18356
   314
fun isTrue (Literal (pol,Bool(CombConst(c,_,_)))) =
mengj@17998
   315
      (pol andalso c = "c_True") orelse
mengj@17998
   316
      (not pol andalso c = "c_False")
mengj@17998
   317
  | isTrue _ = false;
mengj@17998
   318
  
mengj@17998
   319
fun isTaut (Clause {literals,...}) = exists isTrue literals;  
mengj@17998
   320
mengj@18440
   321
fun type_of (Type (a, Ts)) =
mengj@18440
   322
    let val (folTypes,ts) = types_of Ts
mengj@17998
   323
	val t = ResClause.make_fixed_type_const a
mengj@17998
   324
    in
mengj@18440
   325
	(ResClause.mk_fol_type("Comp",t,folTypes),ts)
mengj@18440
   326
    end
mengj@18440
   327
  | type_of (tp as (TFree(a,s))) =
mengj@18440
   328
    let val t = ResClause.make_fixed_type_var a
mengj@18440
   329
    in
mengj@18440
   330
	(ResClause.mk_fol_type("Fixed",t,[]),[ResClause.mk_typ_var_sort tp])
mengj@17998
   331
    end
mengj@18440
   332
  | type_of (tp as (TVar(v,s))) =
mengj@18440
   333
    let val t = ResClause.make_schematic_type_var v
mengj@18440
   334
    in
mengj@18440
   335
	(ResClause.mk_fol_type("Var",t,[]),[ResClause.mk_typ_var_sort tp])
mengj@18440
   336
    end
mengj@18356
   337
mengj@18440
   338
and types_of Ts =
mengj@18440
   339
    let val foltyps_ts = map type_of Ts
mengj@18440
   340
	val (folTyps,ts) = ListPair.unzip foltyps_ts
mengj@18440
   341
    in
mengj@18440
   342
	(folTyps,ResClause.union_all ts)
mengj@18440
   343
    end;
mengj@17998
   344
mengj@17998
   345
(* same as above, but no gathering of sort information *)
mengj@18440
   346
fun simp_type_of (Type (a, Ts)) = 
mengj@18356
   347
    let val typs = map simp_type_of Ts
mengj@17998
   348
	val t = ResClause.make_fixed_type_const a
mengj@17998
   349
    in
mengj@18440
   350
	ResClause.mk_fol_type("Comp",t,typs)
mengj@17998
   351
    end
mengj@18440
   352
  | simp_type_of (TFree (a,s)) = ResClause.mk_fol_type("Fixed",ResClause.make_fixed_type_var a,[])
mengj@18440
   353
  | simp_type_of (TVar (v,s)) = ResClause.mk_fol_type("Var",ResClause.make_schematic_type_var v,[]);
mengj@18440
   354
mengj@18356
   355
mengj@20865
   356
fun const_type_of (c,t) =
mengj@18356
   357
    let val (tp,ts) = type_of t
mengj@18356
   358
	val tvars = !const_typargs(c,t)
mengj@18356
   359
	val tvars' = map simp_type_of tvars
mengj@18356
   360
    in
mengj@18356
   361
	(tp,ts,tvars')
mengj@18356
   362
    end;
mengj@18356
   363
mengj@20644
   364
mengj@18356
   365
fun is_bool_type (Type("bool",[])) = true
mengj@18356
   366
  | is_bool_type _ = false;
mengj@17998
   367
mengj@17998
   368
mengj@17998
   369
(* convert a Term.term (with combinators) into a combterm, also accummulate sort info *)
mengj@17998
   370
fun combterm_of (Const(c,t)) =
mengj@18356
   371
    let val (tp,ts,tvar_list) = const_type_of (c,t)
mengj@18356
   372
	val is_bool = is_bool_type t
mengj@18356
   373
	val c' = CombConst(ResClause.make_fixed_const c,tp,tvar_list)
mengj@17998
   374
	val c'' = if is_bool then Bool(c') else c'
mengj@17998
   375
    in
mengj@17998
   376
	(c'',ts)
mengj@17998
   377
    end
mengj@17998
   378
  | combterm_of (Free(v,t)) =
mengj@18356
   379
    let val (tp,ts) = type_of t
mengj@18356
   380
	val is_bool = is_bool_type t
mengj@17998
   381
	val v' = if ResClause.isMeta v then CombVar(ResClause.make_schematic_var(v,0),tp)
mengj@17998
   382
		 else CombFree(ResClause.make_fixed_var v,tp)
mengj@17998
   383
	val v'' = if is_bool then Bool(v') else v'
mengj@17998
   384
    in
mengj@17998
   385
	(v'',ts)
mengj@17998
   386
    end
mengj@17998
   387
  | combterm_of (Var(v,t)) =
mengj@18356
   388
    let val (tp,ts) = type_of t
mengj@18356
   389
	val is_bool = is_bool_type t
mengj@17998
   390
	val v' = CombVar(ResClause.make_schematic_var v,tp)
mengj@17998
   391
	val v'' = if is_bool then Bool(v') else v'
mengj@17998
   392
    in
mengj@17998
   393
	(v'',ts)
mengj@17998
   394
    end
mengj@17998
   395
  | combterm_of (t as (P $ Q)) =
mengj@17998
   396
    let val (P',tsP) = combterm_of P
mengj@17998
   397
	val (Q',tsQ) = combterm_of Q
mengj@17998
   398
	val tp = Term.type_of t
mengj@18356
   399
	val tp' = simp_type_of tp
mengj@18356
   400
	val is_bool = is_bool_type tp
mengj@17998
   401
	val t' = CombApp(P',Q',tp')
mengj@17998
   402
	val t'' = if is_bool then Bool(t') else t'
mengj@17998
   403
    in
mengj@17998
   404
	(t'',tsP union tsQ)
mengj@17998
   405
    end;
mengj@17998
   406
mengj@17998
   407
fun predicate_of ((Const("Not",_) $ P), polarity) =
mengj@17998
   408
    predicate_of (P, not polarity)
mengj@17998
   409
  | predicate_of (term,polarity) = (combterm_of term,polarity);
mengj@17998
   410
mengj@17998
   411
mengj@17998
   412
fun literals_of_term1 args (Const("Trueprop",_) $ P) = literals_of_term1 args P
mengj@17998
   413
  | literals_of_term1 args (Const("op |",_) $ P $ Q) = 
mengj@17998
   414
    let val args' = literals_of_term1 args P
mengj@17998
   415
    in
mengj@17998
   416
	literals_of_term1 args' Q
mengj@17998
   417
    end
mengj@17998
   418
  | literals_of_term1 (lits,ts) P =
mengj@17998
   419
    let val ((pred,ts'),pol) = predicate_of (P,true)
mengj@17998
   420
	val lits' = Literal(pol,pred)::lits
mengj@17998
   421
    in
mengj@17998
   422
	(lits',ts union ts')
mengj@17998
   423
    end;
mengj@17998
   424
mengj@17998
   425
mengj@17998
   426
fun literals_of_term P = literals_of_term1 ([],[]) P;
mengj@17998
   427
mengj@20274
   428
fun occurs a (CombVar(b,_)) = a = b
mengj@20274
   429
  | occurs a (CombApp(t1,t2,_)) = (occurs a t1) orelse (occurs a t2)
mengj@20274
   430
  | occurs _ _ = false
mengj@20274
   431
mengj@20274
   432
fun too_general_terms (CombVar(v,_), t) = not (occurs v t)
mengj@20274
   433
  | too_general_terms _ = false;
mengj@20274
   434
paulson@20360
   435
fun too_general_lit (Literal(true,(Bool(CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))))) =
paulson@20360
   436
      too_general_terms (t1,t2) orelse too_general_terms (t2,t1)
mengj@20274
   437
  | too_general_lit _ = false;
mengj@20274
   438
mengj@20130
   439
(* forbid a clause that contains hBOOL(V) *)
mengj@20130
   440
fun too_general [] = false
mengj@20130
   441
  | too_general (lit::lits) = 
mengj@20130
   442
    case lit of Literal(_,Bool(CombVar(_,_))) => true
mengj@20130
   443
	      | _ => too_general lits;
mengj@20130
   444
mengj@17998
   445
(* making axiom and conjecture clauses *)
mengj@20274
   446
exception MAKE_CLAUSE
mengj@20130
   447
fun make_clause(clause_id,axiom_name,kind,thm,is_user) =
mengj@19444
   448
    let val term = prop_of thm
mengj@20130
   449
	val term' = comb_of term is_user
mengj@20016
   450
	val (lits,ctypes_sorts) = literals_of_term term'
paulson@18856
   451
	val (ctvar_lits,ctfree_lits) = ResClause.add_typs_aux ctypes_sorts
mengj@17998
   452
    in
mengj@20016
   453
	if forall isFalse lits
mengj@20016
   454
	then error "Problem too trivial for resolution (empty clause)"
paulson@20360
   455
	else if too_general lits 
paulson@20360
   456
	then (Output.debug ("Omitting " ^ axiom_name ^ ": clause contains universal predicates"); 
paulson@20360
   457
	     raise MAKE_CLAUSE)
mengj@20274
   458
	else
mengj@20281
   459
	    if (!typ_level <> T_FULL) andalso kind=Axiom andalso forall too_general_lit lits 
paulson@20360
   460
	    then (Output.debug ("Omitting " ^ axiom_name ^ ": equalities are too general"); 
paulson@20360
   461
	          raise MAKE_CLAUSE) 
mengj@20016
   462
	else
mengj@20016
   463
	    Clause {clause_id = clause_id, axiom_name = axiom_name, th = thm, kind = kind,
mengj@20016
   464
		    literals = lits, ctypes_sorts = ctypes_sorts, 
mengj@20016
   465
		    ctvar_type_literals = ctvar_lits,
mengj@20016
   466
		    ctfree_type_literals = ctfree_lits}
mengj@17998
   467
    end;
mengj@17998
   468
mengj@20016
   469
paulson@20360
   470
fun make_axiom_clause thm (ax_name,cls_id,is_user) = 
paulson@20360
   471
      make_clause(cls_id,ax_name,Axiom,thm,is_user);
mengj@20016
   472
 
mengj@20130
   473
fun make_axiom_clauses [] user_lemmas = []
mengj@20130
   474
  | make_axiom_clauses ((thm,(name,id))::thms) user_lemmas =
mengj@20130
   475
    let val is_user = name mem user_lemmas
paulson@20360
   476
	val cls = SOME (make_axiom_clause thm (name,id,is_user)) 
paulson@20360
   477
	          handle MAKE_CLAUSE => NONE
mengj@20130
   478
	val clss = make_axiom_clauses thms user_lemmas
mengj@19354
   479
    in
mengj@20130
   480
	case cls of NONE => clss
paulson@20360
   481
		  | SOME(cls') => if isTaut cls' then clss 
paulson@20360
   482
		                  else (name,cls')::clss
mengj@19354
   483
    end;
mengj@19354
   484
mengj@19354
   485
mengj@17998
   486
fun make_conjecture_clauses_aux _ [] = []
paulson@20421
   487
  | make_conjecture_clauses_aux n (th::ths) =
paulson@20421
   488
      make_clause(n,"conjecture",Conjecture,th,true) ::
paulson@20421
   489
      make_conjecture_clauses_aux (n+1) ths;
mengj@17998
   490
mengj@17998
   491
val make_conjecture_clauses = make_conjecture_clauses_aux 0;
mengj@17998
   492
mengj@17998
   493
mengj@17998
   494
(**********************************************************************)
mengj@17998
   495
(* convert clause into ATP specific formats:                          *)
mengj@17998
   496
(* TPTP used by Vampire and E                                         *)
mengj@19720
   497
(* DFG used by SPASS                                                  *)
mengj@17998
   498
(**********************************************************************)
mengj@17998
   499
mengj@17998
   500
val type_wrapper = "typeinfo";
mengj@17998
   501
mengj@18356
   502
fun wrap_type (c,t) = 
mengj@18356
   503
    case !typ_level of T_FULL => type_wrapper ^ (ResClause.paren_pack [c,t])
mengj@18356
   504
		     | _ => c;
mengj@18356
   505
    
mengj@17998
   506
mengj@17998
   507
val bool_tp = ResClause.make_fixed_type_const "bool";
mengj@17998
   508
mengj@17998
   509
val app_str = "hAPP";
mengj@17998
   510
mengj@17998
   511
val bool_str = "hBOOL";
mengj@17998
   512
mengj@18356
   513
exception STRING_OF_COMBTERM of int;
mengj@17998
   514
mengj@17998
   515
(* convert literals of clauses into strings *)
mengj@18440
   516
fun string_of_combterm1_aux _ (CombConst(c,tp,_)) = 
mengj@18440
   517
    let val tp' = string_of_ctyp tp
paulson@20864
   518
	val c' = if c = "equal" then "c_fequal" else c
mengj@18440
   519
    in
mengj@19452
   520
	(wrap_type (c',tp'),tp')
mengj@18440
   521
    end
mengj@18440
   522
  | string_of_combterm1_aux _ (CombFree(v,tp)) = 
mengj@18440
   523
    let val tp' = string_of_ctyp tp
mengj@18440
   524
    in
mengj@18440
   525
	(wrap_type (v,tp'),tp')
mengj@18440
   526
    end
mengj@18440
   527
  | string_of_combterm1_aux _ (CombVar(v,tp)) = 
mengj@18440
   528
    let val tp' = string_of_ctyp tp
mengj@18440
   529
    in
mengj@18440
   530
	(wrap_type (v,tp'),tp')
mengj@18440
   531
    end
mengj@18356
   532
  | string_of_combterm1_aux is_pred (CombApp(t1,t2,tp)) =
mengj@18356
   533
    let val (s1,tp1) = string_of_combterm1_aux is_pred t1
mengj@18356
   534
	val (s2,tp2) = string_of_combterm1_aux is_pred t2
mengj@18440
   535
	val tp' = ResClause.string_of_fol_type tp
mengj@18440
   536
	val r =	case !typ_level of T_FULL => type_wrapper ^  (ResClause.paren_pack [(app_str ^ (ResClause.paren_pack [s1,s2])),tp'])
mengj@18356
   537
				 | T_PARTIAL => app_str ^ (ResClause.paren_pack [s1,s2,tp1])
mengj@18356
   538
				 | T_NONE => app_str ^ (ResClause.paren_pack [s1,s2])
mengj@18356
   539
				 | T_CONST => raise STRING_OF_COMBTERM (1) (*should not happen, if happened may be a bug*)
mengj@18440
   540
    in	(r,tp')
mengj@18356
   541
mengj@18356
   542
    end
mengj@19452
   543
  | string_of_combterm1_aux is_pred (Bool(CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))) =
mengj@19452
   544
    if is_pred then 
mengj@19452
   545
	let val (s1,_) = string_of_combterm1_aux false t1
mengj@19452
   546
	    val (s2,_) = string_of_combterm1_aux false t2
mengj@19452
   547
	in
mengj@19452
   548
	    ("equal" ^ (ResClause.paren_pack [s1,s2]),bool_tp)
mengj@19452
   549
	end
mengj@19452
   550
    else
mengj@19452
   551
	let val (t,_) = string_of_combterm1_aux false (CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))
mengj@19452
   552
	in
mengj@19452
   553
	    (t,bool_tp)
mengj@19452
   554
	end
mengj@18356
   555
  | string_of_combterm1_aux is_pred (Bool(t)) = 
mengj@18356
   556
    let val (t',_) = string_of_combterm1_aux false t
mengj@18356
   557
	val r = if is_pred then bool_str ^ (ResClause.paren_pack [t'])
mengj@18356
   558
		else t'
mengj@17998
   559
    in
mengj@18356
   560
	(r,bool_tp)
mengj@18356
   561
    end;
mengj@18356
   562
mengj@18356
   563
fun string_of_combterm1 is_pred term = fst (string_of_combterm1_aux is_pred term);
mengj@18356
   564
mengj@18440
   565
fun string_of_combterm2 _ (CombConst(c,tp,tvars)) = 
mengj@18440
   566
    let val tvars' = map string_of_ctyp tvars
paulson@20864
   567
	val c' = if c = "equal" then "c_fequal" else c
mengj@18440
   568
    in
mengj@19452
   569
	c' ^ (ResClause.paren_pack tvars')
mengj@18440
   570
    end
mengj@18356
   571
  | string_of_combterm2 _ (CombFree(v,tp)) = v
mengj@18356
   572
  | string_of_combterm2 _ (CombVar(v,tp)) = v
mengj@18356
   573
  | string_of_combterm2 is_pred (CombApp(t1,t2,tp)) =
mengj@18356
   574
    let val s1 = string_of_combterm2 is_pred t1
mengj@18356
   575
	val s2 = string_of_combterm2 is_pred t2
mengj@18356
   576
    in
mengj@18356
   577
	app_str ^ (ResClause.paren_pack [s1,s2])
mengj@18356
   578
    end
mengj@19452
   579
  | string_of_combterm2 is_pred (Bool(CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))) =
mengj@19452
   580
    if is_pred then 
mengj@19452
   581
	let val s1 = string_of_combterm2 false t1
mengj@19452
   582
	    val s2 = string_of_combterm2 false t2
mengj@19452
   583
	in
mengj@19452
   584
	    ("equal" ^ (ResClause.paren_pack [s1,s2]))
mengj@19452
   585
	end
mengj@19452
   586
    else
mengj@19452
   587
	string_of_combterm2 false (CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))
mengj@19452
   588
 
mengj@18356
   589
  | string_of_combterm2 is_pred (Bool(t)) = 
mengj@18356
   590
    let val t' = string_of_combterm2 false t
mengj@17998
   591
    in
mengj@18200
   592
	if is_pred then bool_str ^ (ResClause.paren_pack [t'])
mengj@18200
   593
	else t'
mengj@17998
   594
    end;
mengj@17998
   595
mengj@18356
   596
mengj@18356
   597
mengj@18356
   598
fun string_of_combterm is_pred term = 
mengj@18356
   599
    case !typ_level of T_CONST => string_of_combterm2 is_pred term
mengj@18356
   600
		     | _ => string_of_combterm1 is_pred term;
mengj@18356
   601
mengj@18356
   602
mengj@17998
   603
fun string_of_clausename (cls_id,ax_name) = 
mengj@17998
   604
    ResClause.clause_prefix ^ ResClause.ascii_of ax_name ^ "_" ^ Int.toString cls_id;
mengj@17998
   605
mengj@17998
   606
fun string_of_type_clsname (cls_id,ax_name,idx) = 
mengj@17998
   607
    string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx);
mengj@17998
   608
mengj@17998
   609
mengj@19720
   610
(* tptp format *)
mengj@19720
   611
mengj@17998
   612
fun tptp_literal (Literal(pol,pred)) =
mengj@18200
   613
    let val pred_string = string_of_combterm true pred
mengj@17998
   614
	val pol_str = if pol then "++" else "--"
mengj@17998
   615
    in
mengj@17998
   616
	pol_str ^ pred_string
mengj@17998
   617
    end;
mengj@17998
   618
mengj@17998
   619
 
mengj@17998
   620
fun tptp_type_lits (Clause cls) = 
mengj@17998
   621
    let val lits = map tptp_literal (#literals cls)
mengj@17998
   622
	val ctvar_lits_strs =
mengj@18356
   623
	    case !typ_level of T_NONE => []
paulson@20360
   624
	      | _ => map ResClause.tptp_of_typeLit (#ctvar_type_literals cls)
mengj@17998
   625
	val ctfree_lits = 
mengj@18356
   626
	    case !typ_level of T_NONE => []
paulson@20360
   627
	      | _ => map ResClause.tptp_of_typeLit (#ctfree_type_literals cls)
mengj@17998
   628
    in
mengj@17998
   629
	(ctvar_lits_strs @ lits, ctfree_lits)
mengj@17998
   630
    end; 
mengj@18356
   631
    
mengj@18356
   632
    
mengj@17998
   633
fun clause2tptp cls =
mengj@17998
   634
    let val (lits,ctfree_lits) = tptp_type_lits cls
mengj@17998
   635
	val cls_id = get_clause_id cls
mengj@17998
   636
	val ax_name = get_axiomName cls
mengj@17998
   637
	val knd = string_of_kind cls
mengj@17998
   638
	val lits_str = ResClause.bracket_pack lits
mengj@17998
   639
	val cls_str = ResClause.gen_tptp_cls(cls_id,ax_name,knd,lits_str)
mengj@17998
   640
    in
mengj@17998
   641
	(cls_str,ctfree_lits)
mengj@17998
   642
    end;
mengj@17998
   643
mengj@17998
   644
mengj@19720
   645
(* dfg format *)
mengj@19720
   646
fun dfg_literal (Literal(pol,pred)) = ResClause.dfg_sign pol (string_of_combterm true pred);
mengj@19720
   647
mengj@19720
   648
fun dfg_clause_aux (Clause{literals, ctypes_sorts, ...}) = 
mengj@19720
   649
  let val lits = map dfg_literal literals
mengj@19720
   650
      val (tvar_lits,tfree_lits) = ResClause.add_typs_aux ctypes_sorts
mengj@19720
   651
      val tvar_lits_strs = 
mengj@19720
   652
	  case !typ_level of T_NONE => [] 
paulson@20360
   653
	      | _ => map ResClause.dfg_of_typeLit tvar_lits
mengj@19720
   654
      val tfree_lits =
mengj@19720
   655
          case !typ_level of T_NONE => []
paulson@20360
   656
	      | _ => map ResClause.dfg_of_typeLit tfree_lits 
mengj@19720
   657
  in
mengj@19720
   658
      (tvar_lits_strs @ lits, tfree_lits)
mengj@19720
   659
  end; 
mengj@19720
   660
mengj@19720
   661
fun get_uvars (CombConst(_,_,_)) vars = vars
mengj@19720
   662
  | get_uvars (CombFree(_,_)) vars = vars
mengj@19720
   663
  | get_uvars (CombVar(v,tp)) vars = (v::vars)
mengj@19720
   664
  | get_uvars (CombApp(P,Q,tp)) vars = get_uvars P (get_uvars Q vars)
mengj@19720
   665
  | get_uvars (Bool(c)) vars = get_uvars c vars;
mengj@19720
   666
mengj@19720
   667
mengj@19720
   668
fun get_uvars_l (Literal(_,c)) = get_uvars c [];
mengj@19720
   669
mengj@19720
   670
fun dfg_vars (Clause {literals,...}) = ResClause.union_all (map get_uvars_l literals);
mengj@19720
   671
 
mengj@19720
   672
fun clause2dfg (cls as Clause{axiom_name,clause_id,kind,ctypes_sorts,...}) =
mengj@19720
   673
    let val (lits,tfree_lits) = dfg_clause_aux cls 
mengj@19720
   674
        val vars = dfg_vars cls
mengj@19720
   675
        val tvars = ResClause.get_tvar_strs ctypes_sorts
mengj@19720
   676
	val knd = name_of_kind kind
mengj@19720
   677
	val lits_str = commas lits
mengj@19720
   678
	val cls_str = ResClause.gen_dfg_cls(clause_id, axiom_name, knd, lits_str, tvars@vars) 
mengj@19720
   679
    in (cls_str, tfree_lits) end;
mengj@19720
   680
mengj@19720
   681
mengj@19720
   682
fun init_funcs_tab funcs = 
mengj@19724
   683
    let val tp = !typ_level
mengj@20865
   684
	val funcs1 = case tp of T_PARTIAL => Symtab.update ("hAPP",3) funcs
mengj@20865
   685
				      | _ => Symtab.update ("hAPP",2) funcs
mengj@19724
   686
	val funcs2 = case tp of T_FULL => Symtab.update ("typeinfo",2) funcs1
mengj@19724
   687
				      | _ => funcs1
mengj@19724
   688
    in
mengj@20865
   689
	funcs2
mengj@19724
   690
    end;
mengj@19720
   691
mengj@19720
   692
mengj@19725
   693
fun add_funcs (CombConst(c,_,tvars),funcs) =
mengj@19725
   694
    if c = "equal" then foldl ResClause.add_foltype_funcs funcs tvars
mengj@19725
   695
    else
mengj@19725
   696
	(case !typ_level of T_CONST => foldl ResClause.add_foltype_funcs (Symtab.update(c,length tvars) funcs) tvars
mengj@19725
   697
			  | _ => foldl ResClause.add_foltype_funcs (Symtab.update(c,0) funcs) tvars)
mengj@19724
   698
  | add_funcs (CombFree(v,ctp),funcs) = ResClause.add_foltype_funcs (ctp,Symtab.update (v,0) funcs) 
mengj@19720
   699
  | add_funcs (CombVar(_,ctp),funcs) = ResClause.add_foltype_funcs (ctp,funcs)
mengj@19720
   700
  | add_funcs (CombApp(P,Q,_),funcs) = add_funcs(P,add_funcs (Q,funcs))
mengj@19720
   701
  | add_funcs (Bool(t),funcs) = add_funcs (t,funcs);
mengj@19720
   702
mengj@19720
   703
mengj@19720
   704
fun add_literal_funcs (Literal(_,c), funcs) = add_funcs (c,funcs);
mengj@19720
   705
mengj@19720
   706
fun add_clause_funcs (Clause {literals, ...}, funcs) =
mengj@19720
   707
    foldl add_literal_funcs funcs literals
mengj@19720
   708
    handle Symtab.DUP a => raise ERROR ("function " ^ a ^ " has multiple arities")
mengj@19720
   709
mengj@19720
   710
fun funcs_of_clauses clauses arity_clauses =
mengj@19720
   711
    Symtab.dest (foldl ResClause.add_arityClause_funcs 
mengj@19720
   712
                       (foldl add_clause_funcs (init_funcs_tab Symtab.empty) clauses)
mengj@19720
   713
                       arity_clauses)
mengj@19720
   714
mengj@19720
   715
fun preds_of clsrel_clauses arity_clauses = 
mengj@19720
   716
    Symtab.dest
mengj@19720
   717
	(foldl ResClause.add_classrelClause_preds 
mengj@19720
   718
	       (foldl ResClause.add_arityClause_preds
mengj@19720
   719
		      (Symtab.update ("hBOOL",1) Symtab.empty)
mengj@19720
   720
		      arity_clauses)
mengj@19720
   721
	       clsrel_clauses)
mengj@19720
   722
mengj@18440
   723
mengj@18440
   724
(**********************************************************************)
mengj@19198
   725
(* write clauses to files                                             *)
mengj@19198
   726
(**********************************************************************)
mengj@19198
   727
mengj@20791
   728
local
mengj@19198
   729
mengj@20791
   730
val cnf_helper_thms = ResAxioms.cnf_rules_pairs o (map ResAxioms.pairname)
mengj@20644
   731
mengj@20791
   732
in
mengj@20644
   733
mengj@20791
   734
fun get_helper_clauses () =
mengj@20791
   735
    let val IK = if !combI_count > 0 orelse !combK_count > 0 then (Output.debug "Include combinator I K"; cnf_helper_thms [comb_I,comb_K]) else []
mengj@20791
   736
	val BC = if !combB_count > 0 orelse !combC_count > 0 then (Output.debug "Include combinator B C"; cnf_helper_thms [comb_B,comb_C]) else []
mengj@20791
   737
	val S = if !combS_count > 0 then (Output.debug "Include combinator S"; cnf_helper_thms [comb_S]) else []
mengj@20791
   738
	val B'C' = if !combB'_count > 0 orelse !combC'_count > 0 then (Output.debug "Include combinator B' C'"; cnf_helper_thms [comb_B', comb_C']) else []
mengj@20791
   739
	val S' = if !combS'_count > 0 then (Output.debug "Include combinator S'"; cnf_helper_thms [comb_S']) else []
mengj@20791
   740
	val other = cnf_helper_thms [ext,fequal_imp_equal,equal_imp_fequal]
mengj@20791
   741
    in
mengj@20791
   742
	make_axiom_clauses (other @ IK @ BC @ S @ B'C' @ S') []
mengj@20791
   743
    end
mengj@20791
   744
mengj@20791
   745
end
mengj@20791
   746
mengj@20791
   747
(* tptp format *)
mengj@19491
   748
						  
mengj@19198
   749
(* write TPTP format to a single file *)
mengj@19198
   750
(* when "get_helper_clauses" is called, "include_combS" and "include_min_comb" should have correct values already *)
mengj@20130
   751
fun tptp_write_file thms filename (axclauses,classrel_clauses,arity_clauses) user_lemmas=
mengj@19444
   752
    let val clss = make_conjecture_clauses thms
mengj@20130
   753
        val (clnames,axclauses') = ListPair.unzip (make_axiom_clauses axclauses user_lemmas)
mengj@19198
   754
	val (tptp_clss,tfree_litss) = ListPair.unzip (map clause2tptp clss)
mengj@19198
   755
	val tfree_clss = map ResClause.tptp_tfree_clause (foldl (op union_string) [] tfree_litss)
mengj@19198
   756
	val out = TextIO.openOut filename
mengj@20791
   757
	val helper_clauses = (#2 o ListPair.unzip o get_helper_clauses) ()
mengj@19198
   758
    in
mengj@19198
   759
	List.app (curry TextIO.output out o #1 o clause2tptp) axclauses';
mengj@19198
   760
	ResClause.writeln_strs out tfree_clss;
mengj@19198
   761
	ResClause.writeln_strs out tptp_clss;
mengj@19198
   762
	List.app (curry TextIO.output out o ResClause.tptp_classrelClause) classrel_clauses;
mengj@19198
   763
	List.app (curry TextIO.output out o ResClause.tptp_arity_clause) arity_clauses;
mengj@20791
   764
	List.app (curry TextIO.output out o #1 o clause2tptp) helper_clauses;
paulson@20022
   765
	TextIO.closeOut out;
paulson@20022
   766
	clnames
mengj@19198
   767
    end;
mengj@19198
   768
mengj@19720
   769
mengj@20644
   770
mengj@19720
   771
(* dfg format *)
mengj@19720
   772
mengj@20130
   773
fun dfg_write_file  thms filename (axclauses,classrel_clauses,arity_clauses) user_lemmas =
mengj@19720
   774
    let val _ = Output.debug ("Preparing to write the DFG file " ^ filename) 
mengj@19720
   775
	val conjectures = make_conjecture_clauses thms
mengj@20130
   776
        val (clnames,axclauses') = ListPair.unzip (make_axiom_clauses axclauses user_lemmas)
mengj@19720
   777
	val (dfg_clss,tfree_litss) = ListPair.unzip (map clause2dfg conjectures)
mengj@19720
   778
	and probname = Path.pack (Path.base (Path.unpack filename))
mengj@19720
   779
	val (axstrs,_) =  ListPair.unzip (map clause2dfg axclauses')
mengj@19720
   780
	val tfree_clss = map ResClause.dfg_tfree_clause (ResClause.union_all tfree_litss)
mengj@19720
   781
	val out = TextIO.openOut filename
mengj@20791
   782
	val helper_clauses = (#2 o ListPair.unzip o get_helper_clauses) ()
mengj@20791
   783
	val helper_clauses_strs = (#1 o ListPair.unzip o (map clause2dfg)) helper_clauses
paulson@20864
   784
	val funcs = funcs_of_clauses (helper_clauses @ conjectures @ axclauses') arity_clauses
paulson@20864
   785
	and preds = preds_of classrel_clauses arity_clauses
mengj@19720
   786
    in
mengj@19720
   787
	TextIO.output (out, ResClause.string_of_start probname); 
mengj@19720
   788
	TextIO.output (out, ResClause.string_of_descrip probname); 
mengj@19720
   789
	TextIO.output (out, ResClause.string_of_symbols (ResClause.string_of_funcs funcs) (ResClause.string_of_preds preds)); 
mengj@19720
   790
	TextIO.output (out, "list_of_clauses(axioms,cnf).\n");
mengj@19720
   791
	ResClause.writeln_strs out axstrs;
mengj@19720
   792
	List.app (curry TextIO.output out o ResClause.dfg_classrelClause) classrel_clauses;
mengj@19720
   793
	List.app (curry TextIO.output out o ResClause.dfg_arity_clause) arity_clauses;
mengj@20791
   794
	ResClause.writeln_strs out helper_clauses_strs;
mengj@19720
   795
	TextIO.output (out, "end_of_list.\n\nlist_of_clauses(conjectures,cnf).\n");
mengj@19720
   796
	ResClause.writeln_strs out tfree_clss;
mengj@19720
   797
	ResClause.writeln_strs out dfg_clss;
mengj@19720
   798
	TextIO.output (out, "end_of_list.\n\nend_problem.\n");
paulson@20022
   799
	TextIO.closeOut out;
paulson@20022
   800
	clnames
mengj@19720
   801
    end;
mengj@19720
   802
mengj@17998
   803
end