src/HOL/Tools/res_hol_clause.ML
author wenzelm
Sat Jan 21 23:02:14 2006 +0100 (2006-01-21)
changeset 18728 6790126ab5f6
parent 18725 2d0af0574588
child 18856 4669dec681f4
permissions -rw-r--r--
simplified type attribute;
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@17998
    12
mengj@18276
    13
val include_combS = ref false;
mengj@18276
    14
val include_min_comb = ref false;
mengj@17998
    15
mengj@18356
    16
val const_typargs = ref (Library.K [] : (string*typ -> typ list));
mengj@18356
    17
mengj@18356
    18
fun init thy = (include_combS:=false;include_min_comb:=false;const_typargs := Sign.const_typargs thy);
mengj@17998
    19
mengj@17998
    20
(**********************************************************************)
mengj@17998
    21
(* convert a Term.term with lambdas into a Term.term with combinators *) 
mengj@17998
    22
(**********************************************************************)
mengj@17998
    23
mengj@17998
    24
fun is_free (Bound(a)) n = (a = n)
mengj@17998
    25
  | is_free (Abs(x,_,b)) n = (is_free b (n+1))
mengj@17998
    26
  | is_free (P $ Q) n = ((is_free P n) orelse (is_free Q n))
mengj@17998
    27
  | is_free _ _ = false;
mengj@17998
    28
mengj@17998
    29
mengj@17998
    30
exception LAM2COMB of term;
mengj@17998
    31
mengj@17998
    32
exception BND of term;
mengj@17998
    33
mengj@17998
    34
fun decre_bndVar (Bound n) = Bound (n-1)
mengj@17998
    35
  | decre_bndVar (P $ Q) = (decre_bndVar P) $ (decre_bndVar Q)
mengj@17998
    36
  | decre_bndVar t =
mengj@17998
    37
    case t of Const(_,_) => t
mengj@17998
    38
	    | Free(_,_) => t
mengj@17998
    39
	    | Var(_,_) => t
mengj@17998
    40
	    | Abs(_,_,_) => raise BND(t); (*should not occur*)
mengj@17998
    41
mengj@17998
    42
mengj@17998
    43
(*******************************************)
mengj@17998
    44
fun lam2comb (Abs(x,tp,Bound 0)) _ = 
mengj@17998
    45
    let val tpI = Type("fun",[tp,tp])
mengj@17998
    46
    in 
mengj@18276
    47
	include_min_comb:=true;
mengj@17998
    48
	Const("COMBI",tpI) 
mengj@17998
    49
    end
mengj@18356
    50
  | lam2comb (Abs(x,tp,Bound n)) Bnds = 
mengj@18356
    51
    let val (Bound n') = decre_bndVar (Bound n)
mengj@18356
    52
	val tb = List.nth(Bnds,n')
mengj@18356
    53
	val tK = Type("fun",[tb,Type("fun",[tp,tb])])
mengj@18356
    54
    in
mengj@18356
    55
	include_min_comb:=true;
mengj@18356
    56
	Const("COMBK",tK) $ (Bound n')
mengj@18356
    57
    end
mengj@17998
    58
  | lam2comb (Abs(x,t1,Const(c,t2))) _ = 
mengj@17998
    59
    let val tK = Type("fun",[t2,Type("fun",[t1,t2])])
mengj@17998
    60
    in 
mengj@18276
    61
	include_min_comb:=true;
mengj@17998
    62
	Const("COMBK",tK) $ Const(c,t2) 
mengj@17998
    63
    end
mengj@17998
    64
  | lam2comb (Abs(x,t1,Free(v,t2))) _ =
mengj@17998
    65
    let val tK = Type("fun",[t2,Type("fun",[t1,t2])])
mengj@17998
    66
    in
mengj@18276
    67
	include_min_comb:=true;
mengj@17998
    68
	Const("COMBK",tK) $ Free(v,t2)
mengj@17998
    69
    end
mengj@17998
    70
  | lam2comb (Abs(x,t1,Var(ind,t2))) _=
mengj@17998
    71
    let val tK = Type("fun",[t2,Type("fun",[t1,t2])])
mengj@17998
    72
    in
mengj@18276
    73
	include_min_comb:=true;
mengj@17998
    74
	Const("COMBK",tK) $ Var(ind,t2)
mengj@17998
    75
    end
mengj@17998
    76
  | lam2comb (t as (Abs(x,t1,P$(Bound 0)))) Bnds =
mengj@17998
    77
    let val nfreeP = not(is_free P 0)
mengj@17998
    78
	val tr = Term.type_of1(t1::Bnds,P)
mengj@17998
    79
    in
mengj@17998
    80
	if nfreeP then (decre_bndVar P)
mengj@17998
    81
	else (
mengj@17998
    82
	      let val tI = Type("fun",[t1,t1])
mengj@17998
    83
		  val P' = lam2comb (Abs(x,t1,P)) Bnds
mengj@17998
    84
		  val tp' = Term.type_of1(Bnds,P')
mengj@17998
    85
		  val tS = Type("fun",[tp',Type("fun",[tI,tr])])
mengj@17998
    86
	      in
mengj@18276
    87
		  include_min_comb:=true;
mengj@18276
    88
		  include_combS:=true;
mengj@17998
    89
		  Const("COMBS",tS) $ P' $ Const("COMBI",tI)
mengj@17998
    90
	      end)
mengj@17998
    91
    end
mengj@17998
    92
	    
mengj@17998
    93
  | lam2comb (t as (Abs(x,t1,P$Q))) Bnds =
mengj@17998
    94
    let val (nfreeP,nfreeQ) = (not(is_free P 0),not(is_free Q 0))
mengj@17998
    95
	val tpq = Term.type_of1(t1::Bnds, P$Q) 
mengj@17998
    96
    in
mengj@17998
    97
	if(nfreeP andalso nfreeQ) then (
mengj@17998
    98
	    let val tK = Type("fun",[tpq,Type("fun",[t1,tpq])])
mengj@17998
    99
		val PQ' = decre_bndVar(P $ Q)
mengj@17998
   100
	    in 
mengj@18276
   101
		include_min_comb:=true;
mengj@17998
   102
		Const("COMBK",tK) $ PQ'
mengj@17998
   103
	    end)
mengj@17998
   104
	else (
mengj@17998
   105
	      if nfreeP then (
mengj@17998
   106
			       let val Q' = lam2comb (Abs(x,t1,Q)) Bnds
mengj@17998
   107
				   val P' = decre_bndVar P
mengj@17998
   108
				   val tp = Term.type_of1(Bnds,P')
mengj@17998
   109
				   val tq' = Term.type_of1(Bnds, Q')
mengj@17998
   110
				   val tB = Type("fun",[tp,Type("fun",[tq',Type("fun",[t1,tpq])])])
mengj@17998
   111
			       in
mengj@18276
   112
				   include_min_comb:=true;
mengj@17998
   113
				   Const("COMBB",tB) $ P' $ Q' 
mengj@17998
   114
			       end)
mengj@17998
   115
	      else (
mengj@17998
   116
		    if nfreeQ then (
mengj@17998
   117
				    let val P' = lam2comb (Abs(x,t1,P)) Bnds
mengj@17998
   118
					val Q' = decre_bndVar Q
mengj@17998
   119
					val tq = Term.type_of1(Bnds,Q')
mengj@17998
   120
					val tp' = Term.type_of1(Bnds, P')
mengj@17998
   121
					val tC = Type("fun",[tp',Type("fun",[tq,Type("fun",[t1,tpq])])])
mengj@17998
   122
				    in
mengj@18276
   123
					include_min_comb:=true;
mengj@17998
   124
					Const("COMBC",tC) $ P' $ Q'
mengj@17998
   125
				    end)
mengj@17998
   126
		    else(
mengj@17998
   127
			 let val P' = lam2comb (Abs(x,t1,P)) Bnds
mengj@17998
   128
			     val Q' = lam2comb (Abs(x,t1,Q)) Bnds
mengj@17998
   129
			     val tp' = Term.type_of1(Bnds,P')
mengj@17998
   130
			     val tq' = Term.type_of1(Bnds,Q')
mengj@17998
   131
			     val tS = Type("fun",[tp',Type("fun",[tq',Type("fun",[t1,tpq])])])
mengj@17998
   132
			 in
mengj@18276
   133
			     include_min_comb:=true;
mengj@18276
   134
			     include_combS:=true;
mengj@17998
   135
			     Const("COMBS",tS) $ P' $ Q'
mengj@17998
   136
			 end)))
mengj@17998
   137
    end
mengj@17998
   138
  | lam2comb (t as (Abs(x,t1,_))) _ = raise LAM2COMB (t);
mengj@17998
   139
mengj@17998
   140
	     
mengj@17998
   141
mengj@17998
   142
(*********************)
mengj@17998
   143
mengj@17998
   144
fun to_comb (Abs(x,tp,b)) Bnds =
mengj@17998
   145
    let val b' = to_comb b (tp::Bnds)
mengj@17998
   146
    in lam2comb (Abs(x,tp,b')) Bnds end
mengj@17998
   147
  | to_comb (P $ Q) Bnds = ((to_comb P Bnds) $ (to_comb Q Bnds))
mengj@17998
   148
  | to_comb t _ = t;
mengj@17998
   149
 
mengj@17998
   150
    
mengj@17998
   151
fun comb_of t = to_comb t [];
mengj@17998
   152
mengj@17998
   153
mengj@17998
   154
(* print a term containing combinators, used for debugging *)
mengj@17998
   155
exception TERM_COMB of term;
mengj@17998
   156
mengj@17998
   157
fun string_of_term (Const(c,t)) = c
mengj@17998
   158
  | string_of_term (Free(v,t)) = v
mengj@17998
   159
  | string_of_term (Var((x,n),t)) =
mengj@17998
   160
    let val xn = x ^ "_" ^ (string_of_int n)
mengj@17998
   161
    in xn end
mengj@17998
   162
  | string_of_term (P $ Q) =
mengj@17998
   163
    let val P' = string_of_term P
mengj@17998
   164
	val Q' = string_of_term Q
mengj@17998
   165
    in
mengj@17998
   166
	"(" ^ P' ^ " " ^ Q' ^ ")" end
mengj@17998
   167
  | string_of_term t =  raise TERM_COMB (t);
mengj@17998
   168
mengj@17998
   169
mengj@17998
   170
mengj@17998
   171
(******************************************************)
mengj@17998
   172
(* data types for typed combinator expressions        *)
mengj@17998
   173
(******************************************************)
mengj@17998
   174
mengj@17998
   175
type axiom_name = string;
mengj@17998
   176
datatype kind = Axiom | Conjecture;
mengj@17998
   177
fun name_of_kind Axiom = "axiom"
mengj@17998
   178
  | name_of_kind Conjecture = "conjecture";
mengj@17998
   179
mengj@17998
   180
type polarity = bool;
mengj@17998
   181
type indexname = Term.indexname;
mengj@17998
   182
type clause_id = int;
mengj@17998
   183
type csort = Term.sort;
mengj@18440
   184
type ctyp = ResClause.fol_type;
mengj@18440
   185
mengj@18440
   186
val string_of_ctyp = ResClause.string_of_fol_type;
mengj@17998
   187
mengj@17998
   188
type ctyp_var = ResClause.typ_var;
mengj@17998
   189
mengj@17998
   190
type ctype_literal = ResClause.type_literal;
mengj@17998
   191
mengj@17998
   192
mengj@18356
   193
datatype combterm = CombConst of string * ctyp * ctyp list
mengj@17998
   194
		  | CombFree of string * ctyp
mengj@17998
   195
		  | CombVar of string * ctyp
mengj@17998
   196
		  | CombApp of combterm * combterm * ctyp
mengj@17998
   197
		  | Bool of combterm
mengj@17998
   198
		  | Equal of combterm * combterm;
mengj@17998
   199
datatype literal = Literal of polarity * combterm;
mengj@17998
   200
mengj@17998
   201
mengj@17998
   202
mengj@17998
   203
datatype clause = 
mengj@17998
   204
	 Clause of {clause_id: clause_id,
mengj@17998
   205
		    axiom_name: axiom_name,
mengj@17998
   206
		    kind: kind,
mengj@17998
   207
		    literals: literal list,
mengj@17998
   208
		    ctypes_sorts: (ctyp_var * csort) list, 
mengj@17998
   209
                    ctvar_type_literals: ctype_literal list, 
mengj@17998
   210
                    ctfree_type_literals: ctype_literal list};
mengj@17998
   211
mengj@17998
   212
mengj@17998
   213
mengj@17998
   214
fun string_of_kind (Clause cls) = name_of_kind (#kind cls);
mengj@17998
   215
fun get_axiomName (Clause cls) = #axiom_name cls;
mengj@17998
   216
fun get_clause_id (Clause cls) = #clause_id cls;
mengj@17998
   217
mengj@18440
   218
fun get_literals (c as Clause(cls)) = #literals cls;
mengj@18440
   219
mengj@17998
   220
mengj@17998
   221
mengj@18440
   222
exception TERM_ORD of string
mengj@18440
   223
mengj@18440
   224
fun term_ord (CombVar(_,_),CombVar(_,_)) = EQUAL
mengj@18440
   225
  | term_ord (CombVar(_,_),_) = LESS
mengj@18440
   226
  | term_ord (CombFree(_,_),CombVar(_,_)) = GREATER
mengj@18440
   227
  | term_ord (CombFree(f1,tp1),CombFree(f2,tp2)) = 
mengj@18440
   228
    let val ord1 = string_ord(f1,f2)
mengj@18440
   229
    in
mengj@18440
   230
	case ord1 of EQUAL => ResClause.types_ord ([tp1],[tp2])
mengj@18440
   231
		   | _ => ord1
mengj@18440
   232
    end
mengj@18440
   233
  | term_ord (CombFree(_,_),_) = LESS
mengj@18440
   234
  | term_ord (CombConst(_,_,_),CombVar(_,_)) = GREATER
mengj@18440
   235
  | term_ord (CombConst(_,_,_),CombFree(_,_)) = GREATER
mengj@18440
   236
  | term_ord (CombConst(c1,tp1,_),CombConst(c2,tp2,_)) = 
mengj@18440
   237
    let val ord1 = string_ord (c1,c2)
mengj@18440
   238
    in
mengj@18440
   239
	case ord1 of EQUAL => ResClause.types_ord ([tp1],[tp2])
mengj@18440
   240
		   | _ => ord1
mengj@18440
   241
    end
mengj@18440
   242
  | term_ord (CombConst(_,_,_),_) = LESS
mengj@18440
   243
  | term_ord (CombApp(_,_,_),Bool(_)) = raise TERM_ORD("bool")
mengj@18440
   244
  | term_ord (CombApp(_,_,_),Equal(_,_)) = LESS
mengj@18440
   245
  | term_ord (CombApp(f1,arg1,tp1),CombApp(f2,arg2,tp2)) =
mengj@18440
   246
    let val ord1 = term_ord (f1,f2)
mengj@18440
   247
	val ord2 = case ord1 of EQUAL => term_ord (arg1,arg2)
mengj@18440
   248
			      | _ => ord1
mengj@18440
   249
    in
mengj@18440
   250
	case ord2 of EQUAL => ResClause.types_ord ([tp1],[tp2])
mengj@18440
   251
		   | _ => ord2
mengj@18440
   252
    end
mengj@18440
   253
  | term_ord (CombApp(_,_,_),_) = GREATER
mengj@18440
   254
  | term_ord (Bool(_),_) = raise TERM_ORD("bool")
mengj@18440
   255
  | term_ord (Equal(t1,t2),Equal(t3,t4)) = ResClause.list_ord term_ord ([t1,t2],[t3,t4])
mengj@18440
   256
  | term_ord (Equal(_,_),_) = GREATER;
mengj@18440
   257
mengj@18440
   258
fun predicate_ord (Equal(_,_),Bool(_)) = LESS
mengj@18440
   259
  | predicate_ord (Equal(t1,t2),Equal(t3,t4)) = 
mengj@18440
   260
    ResClause.list_ord term_ord ([t1,t2],[t3,t4])
mengj@18440
   261
  | predicate_ord (Bool(_),Equal(_,_)) = GREATER
mengj@18440
   262
  | predicate_ord (Bool(t1),Bool(t2)) = term_ord (t1,t2)
mengj@18440
   263
mengj@18440
   264
mengj@18440
   265
fun literal_ord (Literal(false,_),Literal(true,_)) = LESS
mengj@18440
   266
  | literal_ord (Literal(true,_),Literal(false,_)) = GREATER
mengj@18440
   267
  | literal_ord (Literal(_,pred1),Literal(_,pred2)) = predicate_ord(pred1,pred2);
mengj@18440
   268
mengj@18440
   269
fun sort_lits lits = sort literal_ord lits;
mengj@17998
   270
mengj@17998
   271
(*********************************************************************)
mengj@17998
   272
(* convert a clause with type Term.term to a clause with type clause *)
mengj@17998
   273
(*********************************************************************)
mengj@17998
   274
mengj@18356
   275
fun isFalse (Literal(pol,Bool(CombConst(c,_,_)))) =
mengj@17998
   276
    (pol andalso c = "c_False") orelse
mengj@17998
   277
    (not pol andalso c = "c_True")
mengj@17998
   278
  | isFalse _ = false;
mengj@17998
   279
mengj@17998
   280
mengj@18356
   281
fun isTrue (Literal (pol,Bool(CombConst(c,_,_)))) =
mengj@17998
   282
      (pol andalso c = "c_True") orelse
mengj@17998
   283
      (not pol andalso c = "c_False")
mengj@17998
   284
  | isTrue _ = false;
mengj@17998
   285
  
mengj@17998
   286
fun isTaut (Clause {literals,...}) = exists isTrue literals;  
mengj@17998
   287
mengj@17998
   288
mengj@17998
   289
mengj@17998
   290
fun make_clause(clause_id,axiom_name,kind,literals,ctypes_sorts,ctvar_type_literals,ctfree_type_literals) =
mengj@17998
   291
    if forall isFalse literals
mengj@17998
   292
    then error "Problem too trivial for resolution (empty clause)"
mengj@17998
   293
    else
mengj@17998
   294
	Clause {clause_id = clause_id, axiom_name = axiom_name, kind = kind,
mengj@17998
   295
		literals = literals, ctypes_sorts = ctypes_sorts, 
mengj@17998
   296
		ctvar_type_literals = ctvar_type_literals,
mengj@17998
   297
		ctfree_type_literals = ctfree_type_literals};
mengj@17998
   298
mengj@18440
   299
fun type_of (Type (a, Ts)) =
mengj@18440
   300
    let val (folTypes,ts) = types_of Ts
mengj@17998
   301
	val t = ResClause.make_fixed_type_const a
mengj@17998
   302
    in
mengj@18440
   303
	(ResClause.mk_fol_type("Comp",t,folTypes),ts)
mengj@18440
   304
    end
mengj@18440
   305
  | type_of (tp as (TFree(a,s))) =
mengj@18440
   306
    let val t = ResClause.make_fixed_type_var a
mengj@18440
   307
    in
mengj@18440
   308
	(ResClause.mk_fol_type("Fixed",t,[]),[ResClause.mk_typ_var_sort tp])
mengj@17998
   309
    end
mengj@18440
   310
  | type_of (tp as (TVar(v,s))) =
mengj@18440
   311
    let val t = ResClause.make_schematic_type_var v
mengj@18440
   312
    in
mengj@18440
   313
	(ResClause.mk_fol_type("Var",t,[]),[ResClause.mk_typ_var_sort tp])
mengj@18440
   314
    end
mengj@18356
   315
mengj@18440
   316
and types_of Ts =
mengj@18440
   317
    let val foltyps_ts = map type_of Ts
mengj@18440
   318
	val (folTyps,ts) = ListPair.unzip foltyps_ts
mengj@18440
   319
    in
mengj@18440
   320
	(folTyps,ResClause.union_all ts)
mengj@18440
   321
    end;
mengj@17998
   322
mengj@17998
   323
(* same as above, but no gathering of sort information *)
mengj@18440
   324
fun simp_type_of (Type (a, Ts)) = 
mengj@18356
   325
    let val typs = map simp_type_of Ts
mengj@17998
   326
	val t = ResClause.make_fixed_type_const a
mengj@17998
   327
    in
mengj@18440
   328
	ResClause.mk_fol_type("Comp",t,typs)
mengj@17998
   329
    end
mengj@18440
   330
  | simp_type_of (TFree (a,s)) = ResClause.mk_fol_type("Fixed",ResClause.make_fixed_type_var a,[])
mengj@18440
   331
  | simp_type_of (TVar (v,s)) = ResClause.mk_fol_type("Var",ResClause.make_schematic_type_var v,[]);
mengj@18440
   332
mengj@18356
   333
fun comb_typ ("COMBI",t) = 
mengj@18356
   334
    let val t' = domain_type t
mengj@18356
   335
    in
mengj@18356
   336
	[simp_type_of t']
mengj@18356
   337
    end
mengj@18356
   338
  | comb_typ ("COMBK",t) = 
mengj@18725
   339
    let val a = domain_type t
mengj@18725
   340
	val b = domain_type (range_type t)
mengj@18356
   341
    in
mengj@18725
   342
	map simp_type_of [a,b]
mengj@18356
   343
    end
mengj@18356
   344
  | comb_typ ("COMBS",t) = 
mengj@18356
   345
    let val t' = domain_type t
mengj@18725
   346
	val a = domain_type t'
mengj@18725
   347
	val b = domain_type (range_type t')
mengj@18725
   348
	val c = range_type (range_type t')
mengj@18356
   349
    in 
mengj@18356
   350
	map simp_type_of [a,b,c]
mengj@18356
   351
    end
mengj@18356
   352
  | comb_typ ("COMBB",t) = 
mengj@18725
   353
    let val ab = domain_type t
mengj@18725
   354
	val ca = domain_type (range_type t)
mengj@18356
   355
	val a = domain_type ab
mengj@18725
   356
	val b = range_type ab
mengj@18725
   357
	val c = domain_type ca
mengj@18356
   358
    in
mengj@18356
   359
	map simp_type_of [a,b,c]
mengj@18356
   360
    end
mengj@18356
   361
  | comb_typ ("COMBC",t) =
mengj@18356
   362
    let val t1 = domain_type t
mengj@18725
   363
	val a = domain_type t1
mengj@18725
   364
	val b = domain_type (range_type t1)
mengj@18725
   365
	val c = range_type (range_type t1)
mengj@18356
   366
    in
mengj@18356
   367
	map simp_type_of [a,b,c]
mengj@18356
   368
    end;
mengj@18356
   369
mengj@18356
   370
fun const_type_of ("COMBI",t) = 
mengj@18356
   371
    let val (tp,ts) = type_of t
mengj@18356
   372
	val I_var = comb_typ ("COMBI",t)
mengj@18356
   373
    in
mengj@18356
   374
	(tp,ts,I_var)
mengj@18356
   375
    end
mengj@18356
   376
  | const_type_of ("COMBK",t) =
mengj@18356
   377
    let val (tp,ts) = type_of t
mengj@18356
   378
	val K_var = comb_typ ("COMBK",t)
mengj@18356
   379
    in
mengj@18356
   380
	(tp,ts,K_var)
mengj@18356
   381
    end
mengj@18356
   382
  | const_type_of ("COMBS",t) =
mengj@18356
   383
    let val (tp,ts) = type_of t
mengj@18356
   384
	val S_var = comb_typ ("COMBS",t)
mengj@18356
   385
    in
mengj@18356
   386
	(tp,ts,S_var)
mengj@18356
   387
    end
mengj@18356
   388
  | const_type_of ("COMBB",t) =
mengj@18356
   389
    let val (tp,ts) = type_of t
mengj@18356
   390
	val B_var = comb_typ ("COMBB",t)
mengj@18356
   391
    in
mengj@18356
   392
	(tp,ts,B_var)
mengj@18356
   393
    end
mengj@18356
   394
  | const_type_of ("COMBC",t) =
mengj@18356
   395
    let val (tp,ts) = type_of t
mengj@18356
   396
	val C_var = comb_typ ("COMBC",t)
mengj@18356
   397
    in
mengj@18356
   398
	(tp,ts,C_var)
mengj@18356
   399
    end
mengj@18356
   400
  | const_type_of (c,t) =
mengj@18356
   401
    let val (tp,ts) = type_of t
mengj@18356
   402
	val tvars = !const_typargs(c,t)
mengj@18356
   403
	val tvars' = map simp_type_of tvars
mengj@18356
   404
    in
mengj@18356
   405
	(tp,ts,tvars')
mengj@18356
   406
    end;
mengj@18356
   407
mengj@18356
   408
fun is_bool_type (Type("bool",[])) = true
mengj@18356
   409
  | is_bool_type _ = false;
mengj@17998
   410
mengj@17998
   411
mengj@17998
   412
(* convert a Term.term (with combinators) into a combterm, also accummulate sort info *)
mengj@17998
   413
fun combterm_of (Const(c,t)) =
mengj@18356
   414
    let val (tp,ts,tvar_list) = const_type_of (c,t)
mengj@18356
   415
	val is_bool = is_bool_type t
mengj@18356
   416
	val c' = CombConst(ResClause.make_fixed_const c,tp,tvar_list)
mengj@17998
   417
	val c'' = if is_bool then Bool(c') else c'
mengj@17998
   418
    in
mengj@17998
   419
	(c'',ts)
mengj@17998
   420
    end
mengj@17998
   421
  | combterm_of (Free(v,t)) =
mengj@18356
   422
    let val (tp,ts) = type_of t
mengj@18356
   423
	val is_bool = is_bool_type t
mengj@17998
   424
	val v' = if ResClause.isMeta v then CombVar(ResClause.make_schematic_var(v,0),tp)
mengj@17998
   425
		 else CombFree(ResClause.make_fixed_var v,tp)
mengj@17998
   426
	val v'' = if is_bool then Bool(v') else v'
mengj@17998
   427
    in
mengj@17998
   428
	(v'',ts)
mengj@17998
   429
    end
mengj@17998
   430
  | combterm_of (Var(v,t)) =
mengj@18356
   431
    let val (tp,ts) = type_of t
mengj@18356
   432
	val is_bool = is_bool_type t
mengj@17998
   433
	val v' = CombVar(ResClause.make_schematic_var v,tp)
mengj@17998
   434
	val v'' = if is_bool then Bool(v') else v'
mengj@17998
   435
    in
mengj@17998
   436
	(v'',ts)
mengj@17998
   437
    end
mengj@17998
   438
  | combterm_of (Const("op =",T) $ P $ Q) = (*FIXME: allow equal between bools?*)
mengj@17998
   439
    let val (P',tsP) = combterm_of P        
mengj@17998
   440
	val (Q',tsQ) = combterm_of Q
mengj@17998
   441
    in
mengj@17998
   442
	(Equal(P',Q'),tsP union tsQ)
mengj@17998
   443
    end
mengj@17998
   444
  | combterm_of (t as (P $ Q)) =
mengj@17998
   445
    let val (P',tsP) = combterm_of P
mengj@17998
   446
	val (Q',tsQ) = combterm_of Q
mengj@17998
   447
	val tp = Term.type_of t
mengj@18356
   448
	val tp' = simp_type_of tp
mengj@18356
   449
	val is_bool = is_bool_type tp
mengj@17998
   450
	val t' = CombApp(P',Q',tp')
mengj@17998
   451
	val t'' = if is_bool then Bool(t') else t'
mengj@17998
   452
    in
mengj@17998
   453
	(t'',tsP union tsQ)
mengj@17998
   454
    end;
mengj@17998
   455
mengj@17998
   456
fun predicate_of ((Const("Not",_) $ P), polarity) =
mengj@17998
   457
    predicate_of (P, not polarity)
mengj@17998
   458
  | predicate_of (term,polarity) = (combterm_of term,polarity);
mengj@17998
   459
mengj@17998
   460
mengj@17998
   461
fun literals_of_term1 args (Const("Trueprop",_) $ P) = literals_of_term1 args P
mengj@17998
   462
  | literals_of_term1 args (Const("op |",_) $ P $ Q) = 
mengj@17998
   463
    let val args' = literals_of_term1 args P
mengj@17998
   464
    in
mengj@17998
   465
	literals_of_term1 args' Q
mengj@17998
   466
    end
mengj@17998
   467
  | literals_of_term1 (lits,ts) P =
mengj@17998
   468
    let val ((pred,ts'),pol) = predicate_of (P,true)
mengj@17998
   469
	val lits' = Literal(pol,pred)::lits
mengj@17998
   470
    in
mengj@17998
   471
	(lits',ts union ts')
mengj@17998
   472
    end;
mengj@17998
   473
mengj@17998
   474
mengj@17998
   475
fun literals_of_term P = literals_of_term1 ([],[]) P;
mengj@17998
   476
mengj@17998
   477
mengj@17998
   478
(* making axiom and conjecture clauses *)
mengj@17998
   479
fun make_axiom_clause term (ax_name,cls_id) =
mengj@17998
   480
    let val term' = comb_of term
mengj@17998
   481
	val (lits,ctypes_sorts) = literals_of_term term'
mengj@18440
   482
	val lits' = sort_lits lits
mengj@17998
   483
	val (ctvar_lits,ctfree_lits) = ResClause.add_typs_aux2 ctypes_sorts
mengj@17998
   484
    in
mengj@17998
   485
	make_clause(cls_id,ax_name,Axiom,
mengj@18440
   486
		    lits',ctypes_sorts,ctvar_lits,ctfree_lits)
mengj@17998
   487
    end;
mengj@17998
   488
mengj@17998
   489
mengj@17998
   490
fun make_conjecture_clause n t =
mengj@17998
   491
    let val t' = comb_of t
mengj@17998
   492
	val (lits,ctypes_sorts) = literals_of_term t'
mengj@17998
   493
	val (ctvar_lits,ctfree_lits) = ResClause.add_typs_aux2 ctypes_sorts
mengj@17998
   494
    in
mengj@17998
   495
	make_clause(n,"conjecture",Conjecture,lits,ctypes_sorts,ctvar_lits,ctfree_lits)
mengj@17998
   496
    end;
mengj@17998
   497
mengj@17998
   498
mengj@17998
   499
mengj@17998
   500
fun make_conjecture_clauses_aux _ [] = []
mengj@17998
   501
  | make_conjecture_clauses_aux n (t::ts) =
mengj@17998
   502
    make_conjecture_clause n t :: make_conjecture_clauses_aux (n+1) ts;
mengj@17998
   503
mengj@17998
   504
val make_conjecture_clauses = make_conjecture_clauses_aux 0;
mengj@17998
   505
mengj@17998
   506
mengj@17998
   507
(**********************************************************************)
mengj@17998
   508
(* convert clause into ATP specific formats:                          *)
mengj@17998
   509
(* TPTP used by Vampire and E                                         *)
mengj@17998
   510
(**********************************************************************)
mengj@17998
   511
mengj@17998
   512
val type_wrapper = "typeinfo";
mengj@17998
   513
mengj@18356
   514
datatype type_level = T_FULL | T_PARTIAL | T_CONST | T_NONE;
mengj@18356
   515
mengj@18356
   516
val typ_level = ref T_PARTIAL;
mengj@17998
   517
mengj@18356
   518
fun full_types () = (typ_level:=T_FULL);
mengj@18356
   519
fun partial_types () = (typ_level:=T_PARTIAL);
mengj@18356
   520
fun const_types_only () = (typ_level:=T_CONST);
mengj@18356
   521
fun no_types () = (typ_level:=T_NONE);
mengj@18356
   522
mengj@18356
   523
mengj@18356
   524
fun find_typ_level () = !typ_level;
mengj@18356
   525
mengj@18356
   526
fun wrap_type (c,t) = 
mengj@18356
   527
    case !typ_level of T_FULL => type_wrapper ^ (ResClause.paren_pack [c,t])
mengj@18356
   528
		     | _ => c;
mengj@18356
   529
    
mengj@17998
   530
mengj@17998
   531
val bool_tp = ResClause.make_fixed_type_const "bool";
mengj@17998
   532
mengj@17998
   533
val app_str = "hAPP";
mengj@17998
   534
mengj@17998
   535
val bool_str = "hBOOL";
mengj@17998
   536
mengj@18356
   537
exception STRING_OF_COMBTERM of int;
mengj@17998
   538
mengj@17998
   539
(* convert literals of clauses into strings *)
mengj@18440
   540
fun string_of_combterm1_aux _ (CombConst(c,tp,_)) = 
mengj@18440
   541
    let val tp' = string_of_ctyp tp
mengj@18440
   542
    in
mengj@18440
   543
	(wrap_type (c,tp'),tp')
mengj@18440
   544
    end
mengj@18440
   545
  | string_of_combterm1_aux _ (CombFree(v,tp)) = 
mengj@18440
   546
    let val tp' = string_of_ctyp tp
mengj@18440
   547
    in
mengj@18440
   548
	(wrap_type (v,tp'),tp')
mengj@18440
   549
    end
mengj@18440
   550
  | string_of_combterm1_aux _ (CombVar(v,tp)) = 
mengj@18440
   551
    let val tp' = string_of_ctyp tp
mengj@18440
   552
    in
mengj@18440
   553
	(wrap_type (v,tp'),tp')
mengj@18440
   554
    end
mengj@18356
   555
  | string_of_combterm1_aux is_pred (CombApp(t1,t2,tp)) =
mengj@18356
   556
    let val (s1,tp1) = string_of_combterm1_aux is_pred t1
mengj@18356
   557
	val (s2,tp2) = string_of_combterm1_aux is_pred t2
mengj@18440
   558
	val tp' = ResClause.string_of_fol_type tp
mengj@18440
   559
	val r =	case !typ_level of T_FULL => type_wrapper ^  (ResClause.paren_pack [(app_str ^ (ResClause.paren_pack [s1,s2])),tp'])
mengj@18356
   560
				 | T_PARTIAL => app_str ^ (ResClause.paren_pack [s1,s2,tp1])
mengj@18356
   561
				 | T_NONE => app_str ^ (ResClause.paren_pack [s1,s2])
mengj@18356
   562
				 | T_CONST => raise STRING_OF_COMBTERM (1) (*should not happen, if happened may be a bug*)
mengj@18440
   563
    in	(r,tp')
mengj@18356
   564
mengj@18356
   565
    end
mengj@18356
   566
  | string_of_combterm1_aux is_pred (Bool(t)) = 
mengj@18356
   567
    let val (t',_) = string_of_combterm1_aux false t
mengj@18356
   568
	val r = if is_pred then bool_str ^ (ResClause.paren_pack [t'])
mengj@18356
   569
		else t'
mengj@17998
   570
    in
mengj@18356
   571
	(r,bool_tp)
mengj@17998
   572
    end
mengj@18356
   573
  | string_of_combterm1_aux _ (Equal(t1,t2)) =
mengj@18356
   574
    let val (s1,_) = string_of_combterm1_aux false t1
mengj@18356
   575
	val (s2,_) = string_of_combterm1_aux false t2
mengj@18356
   576
    in
mengj@18356
   577
	("equal" ^ (ResClause.paren_pack [s1,s2]),bool_tp) 
mengj@18356
   578
    end;
mengj@18356
   579
mengj@18356
   580
fun string_of_combterm1 is_pred term = fst (string_of_combterm1_aux is_pred term);
mengj@18356
   581
mengj@18440
   582
fun string_of_combterm2 _ (CombConst(c,tp,tvars)) = 
mengj@18440
   583
    let val tvars' = map string_of_ctyp tvars
mengj@18440
   584
    in
mengj@18440
   585
	c ^ (ResClause.paren_pack tvars')
mengj@18440
   586
    end
mengj@18356
   587
  | string_of_combterm2 _ (CombFree(v,tp)) = v
mengj@18356
   588
  | string_of_combterm2 _ (CombVar(v,tp)) = v
mengj@18356
   589
  | string_of_combterm2 is_pred (CombApp(t1,t2,tp)) =
mengj@18356
   590
    let val s1 = string_of_combterm2 is_pred t1
mengj@18356
   591
	val s2 = string_of_combterm2 is_pred t2
mengj@18356
   592
    in
mengj@18356
   593
	app_str ^ (ResClause.paren_pack [s1,s2])
mengj@18356
   594
    end
mengj@18356
   595
  | string_of_combterm2 is_pred (Bool(t)) = 
mengj@18356
   596
    let val t' = string_of_combterm2 false t
mengj@17998
   597
    in
mengj@18200
   598
	if is_pred then bool_str ^ (ResClause.paren_pack [t'])
mengj@18200
   599
	else t'
mengj@17998
   600
    end
mengj@18356
   601
  | string_of_combterm2 _ (Equal(t1,t2)) =
mengj@18356
   602
    let val s1 = string_of_combterm2 false t1
mengj@18356
   603
	val s2 = string_of_combterm2 false t2
mengj@17998
   604
    in
mengj@18356
   605
	("equal" ^ (ResClause.paren_pack [s1,s2])) 
mengj@17998
   606
    end;
mengj@17998
   607
mengj@18356
   608
mengj@18356
   609
mengj@18356
   610
fun string_of_combterm is_pred term = 
mengj@18356
   611
    case !typ_level of T_CONST => string_of_combterm2 is_pred term
mengj@18356
   612
		     | _ => string_of_combterm1 is_pred term;
mengj@18356
   613
mengj@18356
   614
mengj@17998
   615
fun string_of_clausename (cls_id,ax_name) = 
mengj@17998
   616
    ResClause.clause_prefix ^ ResClause.ascii_of ax_name ^ "_" ^ Int.toString cls_id;
mengj@17998
   617
mengj@17998
   618
fun string_of_type_clsname (cls_id,ax_name,idx) = 
mengj@17998
   619
    string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx);
mengj@17998
   620
mengj@17998
   621
mengj@17998
   622
fun tptp_literal (Literal(pol,pred)) =
mengj@18200
   623
    let val pred_string = string_of_combterm true pred
mengj@17998
   624
	val pol_str = if pol then "++" else "--"
mengj@17998
   625
    in
mengj@17998
   626
	pol_str ^ pred_string
mengj@17998
   627
    end;
mengj@17998
   628
mengj@17998
   629
 
mengj@17998
   630
fun tptp_type_lits (Clause cls) = 
mengj@17998
   631
    let val lits = map tptp_literal (#literals cls)
mengj@17998
   632
	val ctvar_lits_strs =
mengj@18356
   633
	    case !typ_level of T_NONE => []
mengj@18356
   634
			     | _ => (map ResClause.tptp_of_typeLit (#ctvar_type_literals cls)) 
mengj@17998
   635
	val ctfree_lits = 
mengj@18356
   636
	    case !typ_level of T_NONE => []
mengj@18356
   637
			     | _ => (map ResClause.tptp_of_typeLit (#ctfree_type_literals cls)) 
mengj@17998
   638
    in
mengj@17998
   639
	(ctvar_lits_strs @ lits, ctfree_lits)
mengj@17998
   640
    end; 
mengj@18356
   641
    
mengj@18356
   642
    
mengj@17998
   643
fun clause2tptp cls =
mengj@17998
   644
    let val (lits,ctfree_lits) = tptp_type_lits cls
mengj@17998
   645
	val cls_id = get_clause_id cls
mengj@17998
   646
	val ax_name = get_axiomName cls
mengj@17998
   647
	val knd = string_of_kind cls
mengj@17998
   648
	val lits_str = ResClause.bracket_pack lits
mengj@17998
   649
	val cls_str = ResClause.gen_tptp_cls(cls_id,ax_name,knd,lits_str)
mengj@17998
   650
    in
mengj@17998
   651
	(cls_str,ctfree_lits)
mengj@17998
   652
    end;
mengj@17998
   653
mengj@17998
   654
mengj@18440
   655
mengj@18440
   656
(**********************************************************************)
mengj@18440
   657
(* clause equalities and hashing functions                            *)
mengj@18440
   658
(**********************************************************************)
mengj@18440
   659
mengj@18440
   660
mengj@18440
   661
fun combterm_eq (CombConst(c1,tp1,tps1),CombConst(c2,tp2,tps2)) vtvars =
mengj@18440
   662
    let val (eq1,vtvars1) = if c1 = c2 then ResClause.types_eq (tps1,tps2) vtvars
mengj@18440
   663
			    else (false,vtvars)
mengj@18440
   664
    in
mengj@18440
   665
	(eq1,vtvars1)
mengj@18440
   666
    end
mengj@18440
   667
  | combterm_eq (CombConst(_,_,_),_) vtvars = (false,vtvars)
mengj@18440
   668
  | combterm_eq (CombFree(a1,tp1),CombFree(a2,tp2)) vtvars = 
mengj@18440
   669
    if a1 = a2 then ResClause.types_eq ([tp1],[tp2]) vtvars
mengj@18440
   670
    else (false,vtvars)
mengj@18440
   671
  | combterm_eq (CombFree(_,_),_) vtvars = (false,vtvars)
mengj@18440
   672
  | combterm_eq (CombVar(v1,tp1),CombVar(v2,tp2)) (vars,tvars) = 
mengj@18440
   673
    (case ResClause.check_var_pairs(v1,v2) vars of 0 => ResClause.types_eq ([tp1],[tp2]) ((v1,v2)::vars,tvars)
mengj@18440
   674
						 | 1 => ResClause.types_eq ([tp1],[tp2]) (vars,tvars)
mengj@18440
   675
						 | 2 => (false,(vars,tvars)))
mengj@18440
   676
  | combterm_eq (CombVar(_,_),_) vtvars = (false,vtvars)
mengj@18440
   677
  | combterm_eq (CombApp(f1,arg1,tp1),CombApp(f2,arg2,tp2)) vtvars =
mengj@18440
   678
    let val (eq1,vtvars1) = combterm_eq (f1,f2) vtvars
mengj@18440
   679
	val (eq2,vtvars2) = if eq1 then combterm_eq (arg1,arg2) vtvars1
mengj@18440
   680
			    else (eq1,vtvars1)
mengj@18440
   681
    in
mengj@18440
   682
	if eq2 then ResClause.types_eq ([tp1],[tp2]) vtvars2
mengj@18440
   683
	else (eq2,vtvars2)
mengj@18440
   684
    end
mengj@18440
   685
  | combterm_eq (CombApp(_,_,_),_) vtvars = (false,vtvars)
mengj@18440
   686
  | combterm_eq (Bool(t1),Bool(t2)) vtvars = combterm_eq (t1,t2) vtvars
mengj@18440
   687
  | combterm_eq (Bool(_),_) vtvars = (false,vtvars)
mengj@18440
   688
  | combterm_eq (Equal(t1,t2),Equal(t3,t4)) vtvars =
mengj@18440
   689
    let val (eq1,vtvars1) = combterm_eq (t1,t3) vtvars
mengj@18440
   690
    in
mengj@18440
   691
	if eq1 then combterm_eq (t2,t4) vtvars1
mengj@18440
   692
	else (eq1,vtvars1)
mengj@18440
   693
    end
mengj@18440
   694
  | combterm_eq (Equal(t1,t2),_) vtvars = (false,vtvars);
mengj@18440
   695
mengj@18440
   696
fun lit_eq (Literal(pol1,pred1),Literal(pol2,pred2)) vtvars =
mengj@18440
   697
    if (pol1 = pol2) then combterm_eq (pred1,pred2) vtvars
mengj@18440
   698
    else (false,vtvars);
mengj@18440
   699
mengj@18440
   700
fun lits_eq ([],[]) vtvars = (true,vtvars)
mengj@18440
   701
  | lits_eq (l1::ls1,l2::ls2) vtvars = 
mengj@18440
   702
    let val (eq1,vtvars1) = lit_eq (l1,l2) vtvars
mengj@18440
   703
    in
mengj@18440
   704
	if eq1 then lits_eq (ls1,ls2) vtvars1
mengj@18440
   705
	else (false,vtvars1)
mengj@18440
   706
    end;
mengj@18440
   707
mengj@18440
   708
fun clause_eq (cls1,cls2) =
mengj@18440
   709
    let val lits1 = get_literals cls1
mengj@18440
   710
	val lits2 = get_literals cls2
mengj@18440
   711
    in
mengj@18440
   712
	length lits1 = length lits2 andalso #1 (lits_eq (lits1,lits2) ([],[]))
mengj@18440
   713
    end;
mengj@18440
   714
mengj@18440
   715
val xor_words = List.foldl Word.xorb 0w0;
mengj@18440
   716
mengj@18440
   717
fun hash_combterm (CombVar(_,_),w) = w
paulson@18449
   718
  | hash_combterm (CombFree(f,_),w) = Polyhash.hashw_string(f,w)
paulson@18449
   719
  | hash_combterm (CombConst(c,tp,tps),w) = Polyhash.hashw_string(c,w)
paulson@18449
   720
  | hash_combterm (CombApp(f,arg,tp),w) = hash_combterm (arg, hash_combterm (f,w))
mengj@18440
   721
  | hash_combterm (Bool(t),w) = hash_combterm (t,w)
mengj@18440
   722
  | hash_combterm (Equal(t1,t2),w) = 
paulson@18449
   723
    List.foldl hash_combterm (Polyhash.hashw_string ("equal",w)) [t1,t2]
mengj@18440
   724
mengj@18440
   725
fun hash_literal (Literal(true,pred)) = hash_combterm(pred,0w0)
mengj@18440
   726
  | hash_literal (Literal(false,pred)) = Word.notb(hash_combterm(pred,0w0));
mengj@18440
   727
mengj@18440
   728
fun hash_clause clause = xor_words (map hash_literal (get_literals clause));
mengj@18440
   729
mengj@17998
   730
end