src/HOL/Tools/res_hol_clause.ML
author mengj
Sat Sep 30 14:32:36 2006 +0200 (2006-09-30 ago)
changeset 20791 497e1c9d4a9f
parent 20660 8606ddd42554
child 20864 bb75b876b260
permissions -rw-r--r--
Combinator axioms are now from Isabelle theorems, no need to use helper files.
Removed LAM2COMB exception.
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
fun comb_typ ("COMBI",t) = 
mengj@18356
   356
    let val t' = domain_type t
mengj@18356
   357
    in
mengj@18356
   358
	[simp_type_of t']
mengj@18356
   359
    end
mengj@18356
   360
  | comb_typ ("COMBK",t) = 
mengj@18725
   361
    let val a = domain_type t
mengj@18725
   362
	val b = domain_type (range_type t)
mengj@18356
   363
    in
mengj@18725
   364
	map simp_type_of [a,b]
mengj@18356
   365
    end
mengj@18356
   366
  | comb_typ ("COMBS",t) = 
mengj@18356
   367
    let val t' = domain_type t
mengj@18725
   368
	val a = domain_type t'
mengj@18725
   369
	val b = domain_type (range_type t')
mengj@18725
   370
	val c = range_type (range_type t')
mengj@18356
   371
    in 
mengj@18356
   372
	map simp_type_of [a,b,c]
mengj@18356
   373
    end
mengj@18356
   374
  | comb_typ ("COMBB",t) = 
mengj@18725
   375
    let val ab = domain_type t
mengj@18725
   376
	val ca = domain_type (range_type t)
mengj@18356
   377
	val a = domain_type ab
mengj@18725
   378
	val b = range_type ab
mengj@18725
   379
	val c = domain_type ca
mengj@18356
   380
    in
mengj@18356
   381
	map simp_type_of [a,b,c]
mengj@18356
   382
    end
mengj@18356
   383
  | comb_typ ("COMBC",t) =
mengj@18356
   384
    let val t1 = domain_type t
mengj@18725
   385
	val a = domain_type t1
mengj@18725
   386
	val b = domain_type (range_type t1)
mengj@18725
   387
	val c = range_type (range_type t1)
mengj@18356
   388
    in
mengj@18356
   389
	map simp_type_of [a,b,c]
mengj@20644
   390
    end
mengj@20644
   391
  | comb_typ ("COMBB_e",t) =
mengj@20644
   392
    let val t1 = domain_type t
mengj@20644
   393
	val a = domain_type t1
mengj@20644
   394
	val b = range_type t1
mengj@20644
   395
	val t2 = domain_type (range_type(range_type t))
mengj@20644
   396
	val c = domain_type t2
mengj@20644
   397
	val d = range_type t2
mengj@20644
   398
    in
mengj@20644
   399
	map simp_type_of [a,b,c,d]
mengj@20644
   400
    end
mengj@20644
   401
  | comb_typ ("COMBC_e",t) =
mengj@20644
   402
    let val t1 = domain_type t
mengj@20644
   403
	val a = domain_type t1
mengj@20644
   404
	val b = domain_type (range_type t1)
mengj@20644
   405
	val c = range_type (range_type t1)
mengj@20644
   406
	val d = domain_type (domain_type (range_type t))
mengj@20644
   407
    in
mengj@20644
   408
	map simp_type_of [a,b,c,d]
mengj@20644
   409
    end
mengj@20644
   410
  | comb_typ ("COMBS_e",t) = 
mengj@20644
   411
    let val t1 = domain_type t
mengj@20644
   412
	val a = domain_type t1
mengj@20644
   413
	val b = domain_type (range_type t1)
mengj@20644
   414
	val c = range_type (range_type t1)
mengj@20644
   415
	val d = domain_type (domain_type (range_type t))
mengj@20644
   416
    in
mengj@20644
   417
	map simp_type_of [a,b,c,d]
mengj@18356
   418
    end;
mengj@18356
   419
mengj@18356
   420
fun const_type_of ("COMBI",t) = 
mengj@18356
   421
    let val (tp,ts) = type_of t
mengj@18356
   422
	val I_var = comb_typ ("COMBI",t)
mengj@18356
   423
    in
mengj@18356
   424
	(tp,ts,I_var)
mengj@18356
   425
    end
mengj@18356
   426
  | const_type_of ("COMBK",t) =
mengj@18356
   427
    let val (tp,ts) = type_of t
mengj@18356
   428
	val K_var = comb_typ ("COMBK",t)
mengj@18356
   429
    in
mengj@18356
   430
	(tp,ts,K_var)
mengj@18356
   431
    end
mengj@18356
   432
  | const_type_of ("COMBS",t) =
mengj@18356
   433
    let val (tp,ts) = type_of t
mengj@18356
   434
	val S_var = comb_typ ("COMBS",t)
mengj@18356
   435
    in
mengj@18356
   436
	(tp,ts,S_var)
mengj@18356
   437
    end
mengj@18356
   438
  | const_type_of ("COMBB",t) =
mengj@18356
   439
    let val (tp,ts) = type_of t
mengj@18356
   440
	val B_var = comb_typ ("COMBB",t)
mengj@18356
   441
    in
mengj@18356
   442
	(tp,ts,B_var)
mengj@18356
   443
    end
mengj@18356
   444
  | const_type_of ("COMBC",t) =
mengj@18356
   445
    let val (tp,ts) = type_of t
mengj@18356
   446
	val C_var = comb_typ ("COMBC",t)
mengj@18356
   447
    in
mengj@18356
   448
	(tp,ts,C_var)
mengj@18356
   449
    end
mengj@20644
   450
  | const_type_of ("COMBB_e",t) =
mengj@20644
   451
    let val (tp,ts) = type_of t
mengj@20644
   452
	val B'_var = comb_typ ("COMBB_e",t)
mengj@20644
   453
    in
mengj@20644
   454
	(tp,ts,B'_var)
mengj@20644
   455
    end
mengj@20644
   456
  | const_type_of ("COMBC_e",t) =
mengj@20644
   457
    let val (tp,ts) = type_of t
mengj@20644
   458
	val C'_var = comb_typ ("COMBC_e",t)
mengj@20644
   459
    in
mengj@20644
   460
	(tp,ts,C'_var)
mengj@20644
   461
    end
mengj@20644
   462
  | const_type_of ("COMBS_e",t) =
mengj@20644
   463
    let val (tp,ts) = type_of t
mengj@20644
   464
	val S'_var = comb_typ ("COMBS_e",t)
mengj@20644
   465
    in
mengj@20644
   466
	(tp,ts,S'_var)
mengj@20644
   467
    end
mengj@18356
   468
  | const_type_of (c,t) =
mengj@18356
   469
    let val (tp,ts) = type_of t
mengj@18356
   470
	val tvars = !const_typargs(c,t)
mengj@18356
   471
	val tvars' = map simp_type_of tvars
mengj@18356
   472
    in
mengj@18356
   473
	(tp,ts,tvars')
mengj@18356
   474
    end;
mengj@18356
   475
mengj@20644
   476
mengj@18356
   477
fun is_bool_type (Type("bool",[])) = true
mengj@18356
   478
  | is_bool_type _ = false;
mengj@17998
   479
mengj@17998
   480
mengj@17998
   481
(* convert a Term.term (with combinators) into a combterm, also accummulate sort info *)
mengj@17998
   482
fun combterm_of (Const(c,t)) =
mengj@18356
   483
    let val (tp,ts,tvar_list) = const_type_of (c,t)
mengj@18356
   484
	val is_bool = is_bool_type t
mengj@18356
   485
	val c' = CombConst(ResClause.make_fixed_const c,tp,tvar_list)
mengj@17998
   486
	val c'' = if is_bool then Bool(c') else c'
mengj@17998
   487
    in
mengj@17998
   488
	(c'',ts)
mengj@17998
   489
    end
mengj@17998
   490
  | combterm_of (Free(v,t)) =
mengj@18356
   491
    let val (tp,ts) = type_of t
mengj@18356
   492
	val is_bool = is_bool_type t
mengj@17998
   493
	val v' = if ResClause.isMeta v then CombVar(ResClause.make_schematic_var(v,0),tp)
mengj@17998
   494
		 else CombFree(ResClause.make_fixed_var v,tp)
mengj@17998
   495
	val v'' = if is_bool then Bool(v') else v'
mengj@17998
   496
    in
mengj@17998
   497
	(v'',ts)
mengj@17998
   498
    end
mengj@17998
   499
  | combterm_of (Var(v,t)) =
mengj@18356
   500
    let val (tp,ts) = type_of t
mengj@18356
   501
	val is_bool = is_bool_type t
mengj@17998
   502
	val v' = CombVar(ResClause.make_schematic_var v,tp)
mengj@17998
   503
	val v'' = if is_bool then Bool(v') else v'
mengj@17998
   504
    in
mengj@17998
   505
	(v'',ts)
mengj@17998
   506
    end
mengj@17998
   507
  | combterm_of (t as (P $ Q)) =
mengj@17998
   508
    let val (P',tsP) = combterm_of P
mengj@17998
   509
	val (Q',tsQ) = combterm_of Q
mengj@17998
   510
	val tp = Term.type_of t
mengj@18356
   511
	val tp' = simp_type_of tp
mengj@18356
   512
	val is_bool = is_bool_type tp
mengj@17998
   513
	val t' = CombApp(P',Q',tp')
mengj@17998
   514
	val t'' = if is_bool then Bool(t') else t'
mengj@17998
   515
    in
mengj@17998
   516
	(t'',tsP union tsQ)
mengj@17998
   517
    end;
mengj@17998
   518
mengj@17998
   519
fun predicate_of ((Const("Not",_) $ P), polarity) =
mengj@17998
   520
    predicate_of (P, not polarity)
mengj@17998
   521
  | predicate_of (term,polarity) = (combterm_of term,polarity);
mengj@17998
   522
mengj@17998
   523
mengj@17998
   524
fun literals_of_term1 args (Const("Trueprop",_) $ P) = literals_of_term1 args P
mengj@17998
   525
  | literals_of_term1 args (Const("op |",_) $ P $ Q) = 
mengj@17998
   526
    let val args' = literals_of_term1 args P
mengj@17998
   527
    in
mengj@17998
   528
	literals_of_term1 args' Q
mengj@17998
   529
    end
mengj@17998
   530
  | literals_of_term1 (lits,ts) P =
mengj@17998
   531
    let val ((pred,ts'),pol) = predicate_of (P,true)
mengj@17998
   532
	val lits' = Literal(pol,pred)::lits
mengj@17998
   533
    in
mengj@17998
   534
	(lits',ts union ts')
mengj@17998
   535
    end;
mengj@17998
   536
mengj@17998
   537
mengj@17998
   538
fun literals_of_term P = literals_of_term1 ([],[]) P;
mengj@17998
   539
mengj@20274
   540
fun occurs a (CombVar(b,_)) = a = b
mengj@20274
   541
  | occurs a (CombApp(t1,t2,_)) = (occurs a t1) orelse (occurs a t2)
mengj@20274
   542
  | occurs _ _ = false
mengj@20274
   543
mengj@20274
   544
fun too_general_terms (CombVar(v,_), t) = not (occurs v t)
mengj@20274
   545
  | too_general_terms _ = false;
mengj@20274
   546
paulson@20360
   547
fun too_general_lit (Literal(true,(Bool(CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))))) =
paulson@20360
   548
      too_general_terms (t1,t2) orelse too_general_terms (t2,t1)
mengj@20274
   549
  | too_general_lit _ = false;
mengj@20274
   550
mengj@20130
   551
(* forbid a clause that contains hBOOL(V) *)
mengj@20130
   552
fun too_general [] = false
mengj@20130
   553
  | too_general (lit::lits) = 
mengj@20130
   554
    case lit of Literal(_,Bool(CombVar(_,_))) => true
mengj@20130
   555
	      | _ => too_general lits;
mengj@20130
   556
mengj@17998
   557
(* making axiom and conjecture clauses *)
mengj@20274
   558
exception MAKE_CLAUSE
mengj@20130
   559
fun make_clause(clause_id,axiom_name,kind,thm,is_user) =
mengj@19444
   560
    let val term = prop_of thm
mengj@20130
   561
	val term' = comb_of term is_user
mengj@20016
   562
	val (lits,ctypes_sorts) = literals_of_term term'
paulson@18856
   563
	val (ctvar_lits,ctfree_lits) = ResClause.add_typs_aux ctypes_sorts
mengj@17998
   564
    in
mengj@20016
   565
	if forall isFalse lits
mengj@20016
   566
	then error "Problem too trivial for resolution (empty clause)"
paulson@20360
   567
	else if too_general lits 
paulson@20360
   568
	then (Output.debug ("Omitting " ^ axiom_name ^ ": clause contains universal predicates"); 
paulson@20360
   569
	     raise MAKE_CLAUSE)
mengj@20274
   570
	else
mengj@20281
   571
	    if (!typ_level <> T_FULL) andalso kind=Axiom andalso forall too_general_lit lits 
paulson@20360
   572
	    then (Output.debug ("Omitting " ^ axiom_name ^ ": equalities are too general"); 
paulson@20360
   573
	          raise MAKE_CLAUSE) 
mengj@20016
   574
	else
mengj@20016
   575
	    Clause {clause_id = clause_id, axiom_name = axiom_name, th = thm, kind = kind,
mengj@20016
   576
		    literals = lits, ctypes_sorts = ctypes_sorts, 
mengj@20016
   577
		    ctvar_type_literals = ctvar_lits,
mengj@20016
   578
		    ctfree_type_literals = ctfree_lits}
mengj@17998
   579
    end;
mengj@17998
   580
mengj@20016
   581
paulson@20360
   582
fun make_axiom_clause thm (ax_name,cls_id,is_user) = 
paulson@20360
   583
      make_clause(cls_id,ax_name,Axiom,thm,is_user);
mengj@20016
   584
 
mengj@20130
   585
fun make_axiom_clauses [] user_lemmas = []
mengj@20130
   586
  | make_axiom_clauses ((thm,(name,id))::thms) user_lemmas =
mengj@20130
   587
    let val is_user = name mem user_lemmas
paulson@20360
   588
	val cls = SOME (make_axiom_clause thm (name,id,is_user)) 
paulson@20360
   589
	          handle MAKE_CLAUSE => NONE
mengj@20130
   590
	val clss = make_axiom_clauses thms user_lemmas
mengj@19354
   591
    in
mengj@20130
   592
	case cls of NONE => clss
paulson@20360
   593
		  | SOME(cls') => if isTaut cls' then clss 
paulson@20360
   594
		                  else (name,cls')::clss
mengj@19354
   595
    end;
mengj@19354
   596
mengj@19354
   597
mengj@17998
   598
fun make_conjecture_clauses_aux _ [] = []
paulson@20421
   599
  | make_conjecture_clauses_aux n (th::ths) =
paulson@20421
   600
      make_clause(n,"conjecture",Conjecture,th,true) ::
paulson@20421
   601
      make_conjecture_clauses_aux (n+1) ths;
mengj@17998
   602
mengj@17998
   603
val make_conjecture_clauses = make_conjecture_clauses_aux 0;
mengj@17998
   604
mengj@17998
   605
mengj@17998
   606
(**********************************************************************)
mengj@17998
   607
(* convert clause into ATP specific formats:                          *)
mengj@17998
   608
(* TPTP used by Vampire and E                                         *)
mengj@19720
   609
(* DFG used by SPASS                                                  *)
mengj@17998
   610
(**********************************************************************)
mengj@17998
   611
mengj@17998
   612
val type_wrapper = "typeinfo";
mengj@17998
   613
mengj@18356
   614
fun wrap_type (c,t) = 
mengj@18356
   615
    case !typ_level of T_FULL => type_wrapper ^ (ResClause.paren_pack [c,t])
mengj@18356
   616
		     | _ => c;
mengj@18356
   617
    
mengj@17998
   618
mengj@17998
   619
val bool_tp = ResClause.make_fixed_type_const "bool";
mengj@17998
   620
mengj@17998
   621
val app_str = "hAPP";
mengj@17998
   622
mengj@17998
   623
val bool_str = "hBOOL";
mengj@17998
   624
mengj@18356
   625
exception STRING_OF_COMBTERM of int;
mengj@17998
   626
mengj@17998
   627
(* convert literals of clauses into strings *)
mengj@18440
   628
fun string_of_combterm1_aux _ (CombConst(c,tp,_)) = 
mengj@18440
   629
    let val tp' = string_of_ctyp tp
mengj@19452
   630
	val c' = if c = "equal" then "fequal" else c
mengj@18440
   631
    in
mengj@19452
   632
	(wrap_type (c',tp'),tp')
mengj@18440
   633
    end
mengj@18440
   634
  | string_of_combterm1_aux _ (CombFree(v,tp)) = 
mengj@18440
   635
    let val tp' = string_of_ctyp tp
mengj@18440
   636
    in
mengj@18440
   637
	(wrap_type (v,tp'),tp')
mengj@18440
   638
    end
mengj@18440
   639
  | string_of_combterm1_aux _ (CombVar(v,tp)) = 
mengj@18440
   640
    let val tp' = string_of_ctyp tp
mengj@18440
   641
    in
mengj@18440
   642
	(wrap_type (v,tp'),tp')
mengj@18440
   643
    end
mengj@18356
   644
  | string_of_combterm1_aux is_pred (CombApp(t1,t2,tp)) =
mengj@18356
   645
    let val (s1,tp1) = string_of_combterm1_aux is_pred t1
mengj@18356
   646
	val (s2,tp2) = string_of_combterm1_aux is_pred t2
mengj@18440
   647
	val tp' = ResClause.string_of_fol_type tp
mengj@18440
   648
	val r =	case !typ_level of T_FULL => type_wrapper ^  (ResClause.paren_pack [(app_str ^ (ResClause.paren_pack [s1,s2])),tp'])
mengj@18356
   649
				 | T_PARTIAL => app_str ^ (ResClause.paren_pack [s1,s2,tp1])
mengj@18356
   650
				 | T_NONE => app_str ^ (ResClause.paren_pack [s1,s2])
mengj@18356
   651
				 | T_CONST => raise STRING_OF_COMBTERM (1) (*should not happen, if happened may be a bug*)
mengj@18440
   652
    in	(r,tp')
mengj@18356
   653
mengj@18356
   654
    end
mengj@19452
   655
  | string_of_combterm1_aux is_pred (Bool(CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))) =
mengj@19452
   656
    if is_pred then 
mengj@19452
   657
	let val (s1,_) = string_of_combterm1_aux false t1
mengj@19452
   658
	    val (s2,_) = string_of_combterm1_aux false t2
mengj@19452
   659
	in
mengj@19452
   660
	    ("equal" ^ (ResClause.paren_pack [s1,s2]),bool_tp)
mengj@19452
   661
	end
mengj@19452
   662
    else
mengj@19452
   663
	let val (t,_) = string_of_combterm1_aux false (CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))
mengj@19452
   664
	in
mengj@19452
   665
	    (t,bool_tp)
mengj@19452
   666
	end
mengj@18356
   667
  | string_of_combterm1_aux is_pred (Bool(t)) = 
mengj@18356
   668
    let val (t',_) = string_of_combterm1_aux false t
mengj@18356
   669
	val r = if is_pred then bool_str ^ (ResClause.paren_pack [t'])
mengj@18356
   670
		else t'
mengj@17998
   671
    in
mengj@18356
   672
	(r,bool_tp)
mengj@18356
   673
    end;
mengj@18356
   674
mengj@18356
   675
fun string_of_combterm1 is_pred term = fst (string_of_combterm1_aux is_pred term);
mengj@18356
   676
mengj@18440
   677
fun string_of_combterm2 _ (CombConst(c,tp,tvars)) = 
mengj@18440
   678
    let val tvars' = map string_of_ctyp tvars
mengj@19452
   679
	val c' = if c = "equal" then "fequal" else c
mengj@18440
   680
    in
mengj@19452
   681
	c' ^ (ResClause.paren_pack tvars')
mengj@18440
   682
    end
mengj@18356
   683
  | string_of_combterm2 _ (CombFree(v,tp)) = v
mengj@18356
   684
  | string_of_combterm2 _ (CombVar(v,tp)) = v
mengj@18356
   685
  | string_of_combterm2 is_pred (CombApp(t1,t2,tp)) =
mengj@18356
   686
    let val s1 = string_of_combterm2 is_pred t1
mengj@18356
   687
	val s2 = string_of_combterm2 is_pred t2
mengj@18356
   688
    in
mengj@18356
   689
	app_str ^ (ResClause.paren_pack [s1,s2])
mengj@18356
   690
    end
mengj@19452
   691
  | string_of_combterm2 is_pred (Bool(CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))) =
mengj@19452
   692
    if is_pred then 
mengj@19452
   693
	let val s1 = string_of_combterm2 false t1
mengj@19452
   694
	    val s2 = string_of_combterm2 false t2
mengj@19452
   695
	in
mengj@19452
   696
	    ("equal" ^ (ResClause.paren_pack [s1,s2]))
mengj@19452
   697
	end
mengj@19452
   698
    else
mengj@19452
   699
	string_of_combterm2 false (CombApp(CombApp(CombConst("equal",tp,tps),t1,tp1),t2,tp2))
mengj@19452
   700
 
mengj@18356
   701
  | string_of_combterm2 is_pred (Bool(t)) = 
mengj@18356
   702
    let val t' = string_of_combterm2 false t
mengj@17998
   703
    in
mengj@18200
   704
	if is_pred then bool_str ^ (ResClause.paren_pack [t'])
mengj@18200
   705
	else t'
mengj@17998
   706
    end;
mengj@17998
   707
mengj@18356
   708
mengj@18356
   709
mengj@18356
   710
fun string_of_combterm is_pred term = 
mengj@18356
   711
    case !typ_level of T_CONST => string_of_combterm2 is_pred term
mengj@18356
   712
		     | _ => string_of_combterm1 is_pred term;
mengj@18356
   713
mengj@18356
   714
mengj@17998
   715
fun string_of_clausename (cls_id,ax_name) = 
mengj@17998
   716
    ResClause.clause_prefix ^ ResClause.ascii_of ax_name ^ "_" ^ Int.toString cls_id;
mengj@17998
   717
mengj@17998
   718
fun string_of_type_clsname (cls_id,ax_name,idx) = 
mengj@17998
   719
    string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx);
mengj@17998
   720
mengj@17998
   721
mengj@19720
   722
(* tptp format *)
mengj@19720
   723
mengj@17998
   724
fun tptp_literal (Literal(pol,pred)) =
mengj@18200
   725
    let val pred_string = string_of_combterm true pred
mengj@17998
   726
	val pol_str = if pol then "++" else "--"
mengj@17998
   727
    in
mengj@17998
   728
	pol_str ^ pred_string
mengj@17998
   729
    end;
mengj@17998
   730
mengj@17998
   731
 
mengj@17998
   732
fun tptp_type_lits (Clause cls) = 
mengj@17998
   733
    let val lits = map tptp_literal (#literals cls)
mengj@17998
   734
	val ctvar_lits_strs =
mengj@18356
   735
	    case !typ_level of T_NONE => []
paulson@20360
   736
	      | _ => map ResClause.tptp_of_typeLit (#ctvar_type_literals cls)
mengj@17998
   737
	val ctfree_lits = 
mengj@18356
   738
	    case !typ_level of T_NONE => []
paulson@20360
   739
	      | _ => map ResClause.tptp_of_typeLit (#ctfree_type_literals cls)
mengj@17998
   740
    in
mengj@17998
   741
	(ctvar_lits_strs @ lits, ctfree_lits)
mengj@17998
   742
    end; 
mengj@18356
   743
    
mengj@18356
   744
    
mengj@17998
   745
fun clause2tptp cls =
mengj@17998
   746
    let val (lits,ctfree_lits) = tptp_type_lits cls
mengj@17998
   747
	val cls_id = get_clause_id cls
mengj@17998
   748
	val ax_name = get_axiomName cls
mengj@17998
   749
	val knd = string_of_kind cls
mengj@17998
   750
	val lits_str = ResClause.bracket_pack lits
mengj@17998
   751
	val cls_str = ResClause.gen_tptp_cls(cls_id,ax_name,knd,lits_str)
mengj@17998
   752
    in
mengj@17998
   753
	(cls_str,ctfree_lits)
mengj@17998
   754
    end;
mengj@17998
   755
mengj@17998
   756
mengj@19720
   757
(* dfg format *)
mengj@19720
   758
fun dfg_literal (Literal(pol,pred)) = ResClause.dfg_sign pol (string_of_combterm true pred);
mengj@19720
   759
mengj@19720
   760
fun dfg_clause_aux (Clause{literals, ctypes_sorts, ...}) = 
mengj@19720
   761
  let val lits = map dfg_literal literals
mengj@19720
   762
      val (tvar_lits,tfree_lits) = ResClause.add_typs_aux ctypes_sorts
mengj@19720
   763
      val tvar_lits_strs = 
mengj@19720
   764
	  case !typ_level of T_NONE => [] 
paulson@20360
   765
	      | _ => map ResClause.dfg_of_typeLit tvar_lits
mengj@19720
   766
      val tfree_lits =
mengj@19720
   767
          case !typ_level of T_NONE => []
paulson@20360
   768
	      | _ => map ResClause.dfg_of_typeLit tfree_lits 
mengj@19720
   769
  in
mengj@19720
   770
      (tvar_lits_strs @ lits, tfree_lits)
mengj@19720
   771
  end; 
mengj@19720
   772
mengj@19720
   773
fun get_uvars (CombConst(_,_,_)) vars = vars
mengj@19720
   774
  | get_uvars (CombFree(_,_)) vars = vars
mengj@19720
   775
  | get_uvars (CombVar(v,tp)) vars = (v::vars)
mengj@19720
   776
  | get_uvars (CombApp(P,Q,tp)) vars = get_uvars P (get_uvars Q vars)
mengj@19720
   777
  | get_uvars (Bool(c)) vars = get_uvars c vars;
mengj@19720
   778
mengj@19720
   779
mengj@19720
   780
fun get_uvars_l (Literal(_,c)) = get_uvars c [];
mengj@19720
   781
mengj@19720
   782
fun dfg_vars (Clause {literals,...}) = ResClause.union_all (map get_uvars_l literals);
mengj@19720
   783
 
mengj@19720
   784
fun clause2dfg (cls as Clause{axiom_name,clause_id,kind,ctypes_sorts,...}) =
mengj@19720
   785
    let val (lits,tfree_lits) = dfg_clause_aux cls 
mengj@19720
   786
        val vars = dfg_vars cls
mengj@19720
   787
        val tvars = ResClause.get_tvar_strs ctypes_sorts
mengj@19720
   788
	val knd = name_of_kind kind
mengj@19720
   789
	val lits_str = commas lits
mengj@19720
   790
	val cls_str = ResClause.gen_dfg_cls(clause_id, axiom_name, knd, lits_str, tvars@vars) 
mengj@19720
   791
    in (cls_str, tfree_lits) end;
mengj@19720
   792
mengj@19720
   793
mengj@19725
   794
fun init_combs (comb,funcs) =
mengj@19725
   795
    case !typ_level of T_CONST => 
paulson@20360
   796
	    (case comb of "c_COMBK" => Symtab.update (comb,2) funcs
paulson@20360
   797
			| "c_COMBS" => Symtab.update (comb,3) funcs
paulson@20360
   798
			| "c_COMBI" => Symtab.update (comb,1) funcs
paulson@20360
   799
			| "c_COMBB" => Symtab.update (comb,3) funcs
paulson@20360
   800
			| "c_COMBC" => Symtab.update (comb,3) funcs
mengj@20644
   801
			| "c_COMBB_e" => Symtab.update (comb,4) funcs
mengj@20644
   802
			| "c_COMBC_e" => Symtab.update (comb,4) funcs
mengj@20644
   803
			| "c_COMBS_e" => Symtab.update (comb,4) funcs
paulson@20360
   804
			| _ => funcs)
paulson@20360
   805
	  | _ => Symtab.update (comb,0) funcs;
mengj@19725
   806
mengj@19720
   807
fun init_funcs_tab funcs = 
mengj@19724
   808
    let val tp = !typ_level
paulson@20660
   809
	val funcs0 = foldl init_combs funcs ["c_COMBK","c_COMBS","c_COMBI","c_COMBB","c_COMBC",
paulson@20660
   810
	                                     "c_COMBB__e","c_COMBC__e","c_COMBS__e"]
mengj@19725
   811
	val funcs1 = case tp of T_PARTIAL => Symtab.update ("hAPP",3) funcs0
mengj@19725
   812
				      | _ => Symtab.update ("hAPP",2) funcs0
mengj@19724
   813
	val funcs2 = case tp of T_FULL => Symtab.update ("typeinfo",2) funcs1
mengj@19724
   814
				      | _ => funcs1
mengj@19724
   815
    in
mengj@19724
   816
	case tp of T_CONST => Symtab.update ("fequal",1) (Symtab.update ("hEXTENT",2) funcs2)
mengj@19724
   817
			 | _ => Symtab.update ("fequal",0) (Symtab.update ("hEXTENT",0) funcs2)
mengj@19724
   818
    end;
mengj@19720
   819
mengj@19720
   820
mengj@19725
   821
fun add_funcs (CombConst(c,_,tvars),funcs) =
mengj@19725
   822
    if c = "equal" then foldl ResClause.add_foltype_funcs funcs tvars
mengj@19725
   823
    else
mengj@19725
   824
	(case !typ_level of T_CONST => foldl ResClause.add_foltype_funcs (Symtab.update(c,length tvars) funcs) tvars
mengj@19725
   825
			  | _ => foldl ResClause.add_foltype_funcs (Symtab.update(c,0) funcs) tvars)
mengj@19724
   826
  | add_funcs (CombFree(v,ctp),funcs) = ResClause.add_foltype_funcs (ctp,Symtab.update (v,0) funcs) 
mengj@19720
   827
  | add_funcs (CombVar(_,ctp),funcs) = ResClause.add_foltype_funcs (ctp,funcs)
mengj@19720
   828
  | add_funcs (CombApp(P,Q,_),funcs) = add_funcs(P,add_funcs (Q,funcs))
mengj@19720
   829
  | add_funcs (Bool(t),funcs) = add_funcs (t,funcs);
mengj@19720
   830
mengj@19720
   831
mengj@19720
   832
fun add_literal_funcs (Literal(_,c), funcs) = add_funcs (c,funcs);
mengj@19720
   833
mengj@19720
   834
fun add_clause_funcs (Clause {literals, ...}, funcs) =
mengj@19720
   835
    foldl add_literal_funcs funcs literals
mengj@19720
   836
    handle Symtab.DUP a => raise ERROR ("function " ^ a ^ " has multiple arities")
mengj@19720
   837
mengj@19720
   838
fun funcs_of_clauses clauses arity_clauses =
mengj@19720
   839
    Symtab.dest (foldl ResClause.add_arityClause_funcs 
mengj@19720
   840
                       (foldl add_clause_funcs (init_funcs_tab Symtab.empty) clauses)
mengj@19720
   841
                       arity_clauses)
mengj@19720
   842
mengj@19720
   843
fun preds_of clsrel_clauses arity_clauses = 
mengj@19720
   844
    Symtab.dest
mengj@19720
   845
	(foldl ResClause.add_classrelClause_preds 
mengj@19720
   846
	       (foldl ResClause.add_arityClause_preds
mengj@19720
   847
		      (Symtab.update ("hBOOL",1) Symtab.empty)
mengj@19720
   848
		      arity_clauses)
mengj@19720
   849
	       clsrel_clauses)
mengj@19720
   850
mengj@18440
   851
mengj@18440
   852
(**********************************************************************)
mengj@19198
   853
(* write clauses to files                                             *)
mengj@19198
   854
(**********************************************************************)
mengj@19198
   855
mengj@20791
   856
local
mengj@19198
   857
mengj@20791
   858
val cnf_helper_thms = ResAxioms.cnf_rules_pairs o (map ResAxioms.pairname)
mengj@20644
   859
mengj@20791
   860
in
mengj@20644
   861
mengj@20791
   862
fun get_helper_clauses () =
mengj@20791
   863
    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
   864
	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
   865
	val S = if !combS_count > 0 then (Output.debug "Include combinator S"; cnf_helper_thms [comb_S]) else []
mengj@20791
   866
	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
   867
	val S' = if !combS'_count > 0 then (Output.debug "Include combinator S'"; cnf_helper_thms [comb_S']) else []
mengj@20791
   868
	val other = cnf_helper_thms [ext,fequal_imp_equal,equal_imp_fequal]
mengj@20791
   869
    in
mengj@20791
   870
	make_axiom_clauses (other @ IK @ BC @ S @ B'C' @ S') []
mengj@20791
   871
    end
mengj@20791
   872
mengj@20791
   873
end
mengj@20791
   874
mengj@20791
   875
(* tptp format *)
mengj@19491
   876
						  
mengj@19198
   877
(* write TPTP format to a single file *)
mengj@19198
   878
(* when "get_helper_clauses" is called, "include_combS" and "include_min_comb" should have correct values already *)
mengj@20130
   879
fun tptp_write_file thms filename (axclauses,classrel_clauses,arity_clauses) user_lemmas=
mengj@19444
   880
    let val clss = make_conjecture_clauses thms
mengj@20130
   881
        val (clnames,axclauses') = ListPair.unzip (make_axiom_clauses axclauses user_lemmas)
mengj@19198
   882
	val (tptp_clss,tfree_litss) = ListPair.unzip (map clause2tptp clss)
mengj@19198
   883
	val tfree_clss = map ResClause.tptp_tfree_clause (foldl (op union_string) [] tfree_litss)
mengj@19198
   884
	val out = TextIO.openOut filename
mengj@20791
   885
	val helper_clauses = (#2 o ListPair.unzip o get_helper_clauses) ()
mengj@19198
   886
    in
mengj@19198
   887
	List.app (curry TextIO.output out o #1 o clause2tptp) axclauses';
mengj@19198
   888
	ResClause.writeln_strs out tfree_clss;
mengj@19198
   889
	ResClause.writeln_strs out tptp_clss;
mengj@19198
   890
	List.app (curry TextIO.output out o ResClause.tptp_classrelClause) classrel_clauses;
mengj@19198
   891
	List.app (curry TextIO.output out o ResClause.tptp_arity_clause) arity_clauses;
mengj@20791
   892
	List.app (curry TextIO.output out o #1 o clause2tptp) helper_clauses;
paulson@20022
   893
	TextIO.closeOut out;
paulson@20022
   894
	clnames
mengj@19198
   895
    end;
mengj@19198
   896
mengj@19720
   897
mengj@20644
   898
mengj@19720
   899
(* dfg format *)
mengj@19720
   900
mengj@20130
   901
fun dfg_write_file  thms filename (axclauses,classrel_clauses,arity_clauses) user_lemmas =
mengj@19720
   902
    let val _ = Output.debug ("Preparing to write the DFG file " ^ filename) 
mengj@19720
   903
	val conjectures = make_conjecture_clauses thms
mengj@20130
   904
        val (clnames,axclauses') = ListPair.unzip (make_axiom_clauses axclauses user_lemmas)
mengj@19720
   905
	val (dfg_clss,tfree_litss) = ListPair.unzip (map clause2dfg conjectures)
mengj@19720
   906
	val clss = conjectures @ axclauses'
mengj@19720
   907
	val funcs = funcs_of_clauses clss arity_clauses
mengj@19720
   908
	and preds = preds_of classrel_clauses arity_clauses
mengj@19720
   909
	and probname = Path.pack (Path.base (Path.unpack filename))
mengj@19720
   910
	val (axstrs,_) =  ListPair.unzip (map clause2dfg axclauses')
mengj@19720
   911
	val tfree_clss = map ResClause.dfg_tfree_clause (ResClause.union_all tfree_litss)
mengj@19720
   912
	val out = TextIO.openOut filename
mengj@20791
   913
	val helper_clauses = (#2 o ListPair.unzip o get_helper_clauses) ()
mengj@20791
   914
	val helper_clauses_strs = (#1 o ListPair.unzip o (map clause2dfg)) helper_clauses
mengj@19720
   915
    in
mengj@19720
   916
	TextIO.output (out, ResClause.string_of_start probname); 
mengj@19720
   917
	TextIO.output (out, ResClause.string_of_descrip probname); 
mengj@19720
   918
	TextIO.output (out, ResClause.string_of_symbols (ResClause.string_of_funcs funcs) (ResClause.string_of_preds preds)); 
mengj@19720
   919
	TextIO.output (out, "list_of_clauses(axioms,cnf).\n");
mengj@19720
   920
	ResClause.writeln_strs out axstrs;
mengj@19720
   921
	List.app (curry TextIO.output out o ResClause.dfg_classrelClause) classrel_clauses;
mengj@19720
   922
	List.app (curry TextIO.output out o ResClause.dfg_arity_clause) arity_clauses;
mengj@20791
   923
	ResClause.writeln_strs out helper_clauses_strs;
mengj@19720
   924
	TextIO.output (out, "end_of_list.\n\nlist_of_clauses(conjectures,cnf).\n");
mengj@19720
   925
	ResClause.writeln_strs out tfree_clss;
mengj@19720
   926
	ResClause.writeln_strs out dfg_clss;
mengj@19720
   927
	TextIO.output (out, "end_of_list.\n\nend_problem.\n");
paulson@20022
   928
	TextIO.closeOut out;
paulson@20022
   929
	clnames
mengj@19720
   930
    end;
mengj@19720
   931
mengj@17998
   932
end