src/HOL/Tools/res_clause.ML
author mengj
Thu Dec 15 05:47:26 2005 +0100 (2005-12-15)
changeset 18409 080094128a09
parent 18403 df0c0f35c897
child 18411 2d3165a0fb40
permissions -rw-r--r--
Added functions to test equivalence between clauses.
paulson@15347
     1
(*  Author: Jia Meng, Cambridge University Computer Laboratory
quigley@17150
     2
paulson@15347
     3
    ID: $Id$
paulson@15347
     4
    Copyright 2004 University of Cambridge
paulson@15347
     5
paulson@15347
     6
ML data structure for storing/printing FOL clauses and arity clauses.
paulson@15347
     7
Typed equality is treated differently.
paulson@15347
     8
*)
paulson@15347
     9
quigley@17150
    10
(* works for writeoutclasimp on typed *)
paulson@15347
    11
signature RES_CLAUSE =
paulson@15347
    12
  sig
paulson@17404
    13
  val keep_types : bool ref
paulson@17404
    14
  val special_equal : bool ref
paulson@17404
    15
  val tagged : bool ref
paulson@17404
    16
paulson@17404
    17
  exception ARCLAUSE of string
paulson@17404
    18
  exception CLAUSE of string * term
paulson@17404
    19
  type arityClause 
paulson@17404
    20
  type classrelClause
paulson@17404
    21
  type clause
paulson@17404
    22
  val init : theory -> unit
paulson@17404
    23
  val make_axiom_clause : Term.term -> string * int -> clause
paulson@17888
    24
  val make_conjecture_clauses : term list -> clause list
paulson@17404
    25
  val get_axiomName : clause ->  string
paulson@17404
    26
  val isTaut : clause -> bool
paulson@17404
    27
  val num_of_clauses : clause -> int
quigley@17150
    28
paulson@17404
    29
  val clause2dfg : clause -> string * string list
paulson@17404
    30
  val clauses2dfg : clause list -> string -> clause list -> clause list ->
paulson@17422
    31
	   (string * int) list -> (string * int) list -> string
paulson@17404
    32
  val tfree_dfg_clause : string -> string
quigley@17150
    33
paulson@17845
    34
  val arity_clause_thy: theory -> arityClause list 
paulson@17845
    35
  val classrel_clauses_thy: theory -> classrelClause list 
paulson@17845
    36
paulson@17404
    37
  val tptp_arity_clause : arityClause -> string
paulson@17404
    38
  val tptp_classrelClause : classrelClause -> string
paulson@17404
    39
  val tptp_clause : clause -> string list
paulson@17404
    40
  val clause2tptp : clause -> string * string list
paulson@17404
    41
  val tfree_clause : string -> string
paulson@17404
    42
  val schematic_var_prefix : string
paulson@17404
    43
  val fixed_var_prefix : string
paulson@17404
    44
  val tvar_prefix : string
paulson@17404
    45
  val tfree_prefix : string
paulson@17404
    46
  val clause_prefix : string 
paulson@17404
    47
  val arclause_prefix : string
paulson@17404
    48
  val const_prefix : string
paulson@17404
    49
  val tconst_prefix : string 
paulson@17404
    50
  val class_prefix : string 
mengj@17908
    51
mengj@17908
    52
  val union_all : ''a list list -> ''a list
mengj@17908
    53
  val ascii_of : String.string -> String.string
mengj@17908
    54
  val paren_pack : string list -> string
mengj@17908
    55
  val bracket_pack : string list -> string
mengj@17908
    56
  val make_schematic_var : String.string * int -> string
mengj@17908
    57
  val make_fixed_var : String.string -> string
mengj@17908
    58
  val make_schematic_type_var : string * int -> string
mengj@17908
    59
  val make_fixed_type_var : string -> string
mengj@17908
    60
  val make_fixed_const : String.string -> string		
mengj@17908
    61
  val make_fixed_type_const : String.string -> string   
mengj@17908
    62
  val make_type_class : String.string -> string
mengj@17999
    63
  val isMeta : String.string -> bool
mengj@17999
    64
  
mengj@17999
    65
  type typ_var
mengj@17999
    66
  val mk_typ_var_sort : Term.typ -> typ_var * sort
mengj@17999
    67
  type type_literal
mengj@17999
    68
  val add_typs_aux2 : (typ_var * string list) list -> type_literal list * type_literal list
mengj@17999
    69
  val gen_tptp_cls : int * string * string * string -> string
mengj@17999
    70
  val gen_tptp_type_cls : int * string * string * string * int -> string
mengj@17999
    71
  val tptp_of_typeLit : type_literal -> string
mengj@18275
    72
paulson@15347
    73
  end;
paulson@15347
    74
quigley@17150
    75
structure ResClause: RES_CLAUSE =
paulson@15347
    76
struct
paulson@15347
    77
paulson@15347
    78
(* Added for typed equality *)
paulson@15347
    79
val special_equal = ref false; (* by default,equality does not carry type information *)
paulson@15347
    80
val eq_typ_wrapper = "typeinfo"; (* default string *)
paulson@15347
    81
paulson@15347
    82
paulson@15347
    83
val schematic_var_prefix = "V_";
paulson@15347
    84
val fixed_var_prefix = "v_";
paulson@15347
    85
paulson@17230
    86
val tvar_prefix = "T_";
paulson@17230
    87
val tfree_prefix = "t_";
paulson@15347
    88
paulson@15347
    89
val clause_prefix = "cls_"; 
paulson@17525
    90
val arclause_prefix = "clsarity_" 
paulson@17525
    91
val clrelclause_prefix = "clsrel_";
paulson@15347
    92
paulson@17230
    93
val const_prefix = "c_";
paulson@17230
    94
val tconst_prefix = "tc_"; 
paulson@15347
    95
paulson@16199
    96
val class_prefix = "class_"; 
paulson@15347
    97
paulson@15347
    98
paulson@17775
    99
fun union_all xss = foldl (op union) [] xss;
paulson@17775
   100
paulson@15347
   101
 
paulson@17775
   102
(*Provide readable names for the more common symbolic functions*)
paulson@15347
   103
val const_trans_table =
paulson@15347
   104
      Symtab.make [("op =", "equal"),
paulson@15347
   105
	  	   ("op <=", "lessequals"),
paulson@15347
   106
		   ("op <", "less"),
paulson@15347
   107
		   ("op &", "and"),
paulson@15347
   108
		   ("op |", "or"),
paulson@17375
   109
		   ("op +", "plus"),
paulson@17375
   110
		   ("op -", "minus"),
paulson@17375
   111
		   ("op *", "times"),
paulson@15347
   112
		   ("op -->", "implies"),
paulson@17375
   113
		   ("{}", "emptyset"),
paulson@15347
   114
		   ("op :", "in"),
paulson@15347
   115
		   ("op Un", "union"),
paulson@18390
   116
		   ("op Int", "inter"),
paulson@18390
   117
		   ("List.op @", "append")];
paulson@15347
   118
paulson@17230
   119
val type_const_trans_table =
paulson@17230
   120
      Symtab.make [("*", "t_prod"),
paulson@17230
   121
	  	   ("+", "t_sum"),
paulson@17230
   122
		   ("~=>", "t_map")];
paulson@15347
   123
paulson@15610
   124
(*Escaping of special characters.
paulson@15610
   125
  Alphanumeric characters are left unchanged.
paulson@15610
   126
  The character _ goes to __
paulson@15610
   127
  Characters in the range ASCII space to / go to _A to _P, respectively.
paulson@15610
   128
  Other printing characters go to _NNN where NNN is the decimal ASCII code.*)
paulson@15610
   129
local
paulson@15610
   130
paulson@15610
   131
val A_minus_space = Char.ord #"A" - Char.ord #" ";
paulson@15610
   132
paulson@15347
   133
fun ascii_of_c c =
paulson@15610
   134
  if Char.isAlphaNum c then String.str c
paulson@15610
   135
  else if c = #"_" then "__"
paulson@15610
   136
  else if #" " <= c andalso c <= #"/" 
paulson@15610
   137
       then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space))
paulson@15610
   138
  else if Char.isPrint c then ("_" ^ Int.toString (Char.ord c))
paulson@15610
   139
  else ""
paulson@15347
   140
paulson@15610
   141
in
paulson@15610
   142
paulson@15610
   143
val ascii_of = String.translate ascii_of_c;
paulson@15610
   144
paulson@15610
   145
end;
paulson@15347
   146
paulson@17525
   147
(* convert a list of strings into one single string; surrounded by brackets *)
paulson@18218
   148
fun paren_pack [] = ""   (*empty argument list*)
paulson@18218
   149
  | paren_pack strings = "(" ^ commas strings ^ ")";
paulson@17525
   150
paulson@17525
   151
fun bracket_pack strings = "[" ^ commas strings ^ "]";
paulson@17525
   152
paulson@17525
   153
paulson@16925
   154
(*Remove the initial ' character from a type variable, if it is present*)
paulson@16925
   155
fun trim_type_var s =
paulson@16925
   156
  if s <> "" andalso String.sub(s,0) = #"'" then String.extract(s,1,NONE)
paulson@16925
   157
  else error ("trim_type: Malformed type variable encountered: " ^ s);
paulson@16925
   158
paulson@16903
   159
fun ascii_of_indexname (v,0) = ascii_of v
paulson@17525
   160
  | ascii_of_indexname (v,i) = ascii_of v ^ "_" ^ Int.toString i;
paulson@15347
   161
paulson@17230
   162
fun make_schematic_var v = schematic_var_prefix ^ (ascii_of_indexname v);
paulson@15347
   163
fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x);
paulson@15347
   164
paulson@16925
   165
fun make_schematic_type_var (x,i) = 
paulson@16925
   166
      tvar_prefix ^ (ascii_of_indexname (trim_type_var x,i));
paulson@16925
   167
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x));
paulson@15347
   168
paulson@17230
   169
fun make_fixed_const c =
wenzelm@17412
   170
    case Symtab.lookup const_trans_table c of
paulson@17230
   171
        SOME c' => c'
wenzelm@17261
   172
      | NONE =>  const_prefix ^ ascii_of c;
paulson@17230
   173
paulson@17230
   174
fun make_fixed_type_const c = 
wenzelm@17412
   175
    case Symtab.lookup type_const_trans_table c of
paulson@17230
   176
        SOME c' => c'
wenzelm@17261
   177
      | NONE =>  tconst_prefix ^ ascii_of c;
quigley@17150
   178
wenzelm@17261
   179
fun make_type_class clas = class_prefix ^ ascii_of clas;
quigley@17150
   180
quigley@17150
   181
quigley@17150
   182
paulson@15347
   183
(***** definitions and functions for FOL clauses, prepared for conversion into TPTP format or SPASS format. *****)
paulson@15347
   184
paulson@17230
   185
val keep_types = ref true;
paulson@15347
   186
paulson@15347
   187
datatype kind = Axiom | Hypothesis | Conjecture;
paulson@15347
   188
fun name_of_kind Axiom = "axiom"
paulson@15347
   189
  | name_of_kind Hypothesis = "hypothesis"
paulson@15347
   190
  | name_of_kind Conjecture = "conjecture";
paulson@15347
   191
paulson@15347
   192
type clause_id = int;
paulson@15347
   193
type axiom_name = string;
paulson@15347
   194
paulson@15347
   195
paulson@15347
   196
type polarity = bool;
paulson@15347
   197
paulson@15347
   198
type indexname = Term.indexname;
paulson@15347
   199
paulson@15347
   200
paulson@15347
   201
(* "tag" is used for vampire specific syntax  *)
paulson@15347
   202
type tag = bool; 
paulson@15347
   203
paulson@15347
   204
paulson@15347
   205
(**** Isabelle FOL clauses ****)
paulson@15347
   206
paulson@15347
   207
val tagged = ref false;
paulson@15347
   208
paulson@15347
   209
type pred_name = string;
paulson@15347
   210
type sort = Term.sort;
mengj@18402
   211
mengj@18402
   212
mengj@18402
   213
mengj@18402
   214
datatype typ_var = FOLTVar of indexname | FOLTFree of string;
mengj@18402
   215
mengj@18402
   216
datatype fol_type = AtomV of string
mengj@18402
   217
		  | AtomF of string
mengj@18402
   218
		  | Comp of string * fol_type list;
mengj@18402
   219
mengj@18402
   220
fun string_of_fol_type (AtomV x) = x
mengj@18402
   221
  | string_of_fol_type (AtomF x) = x
mengj@18402
   222
  | string_of_fol_type (Comp(tcon,tps)) = 
mengj@18402
   223
    let val tstrs = map string_of_fol_type tps
mengj@18402
   224
    in
mengj@18402
   225
	tcon ^ (paren_pack tstrs)
mengj@18402
   226
    end;
mengj@18402
   227
paulson@15347
   228
paulson@15347
   229
datatype type_literal = LTVar of string | LTFree of string;
paulson@15347
   230
paulson@17317
   231
datatype folTerm = UVar of string * fol_type
paulson@18218
   232
                 | Fun of string * fol_type list * folTerm list;
paulson@18218
   233
datatype predicate = Predicate of pred_name * fol_type list * folTerm list;
paulson@15347
   234
paulson@15347
   235
datatype literal = Literal of polarity * predicate * tag;
paulson@15347
   236
mengj@17999
   237
fun mk_typ_var_sort (TFree(a,s)) = (FOLTFree a,s)
mengj@17999
   238
  | mk_typ_var_sort (TVar(v,s)) = (FOLTVar v,s);
mengj@17999
   239
mengj@17999
   240
paulson@15347
   241
paulson@15347
   242
(* ML datatype used to repsent one single clause: disjunction of literals. *)
paulson@15347
   243
datatype clause = 
paulson@15347
   244
	 Clause of {clause_id: clause_id,
paulson@15347
   245
		    axiom_name: axiom_name,
paulson@15347
   246
		    kind: kind,
paulson@15347
   247
		    literals: literal list,
paulson@15347
   248
		    types_sorts: (typ_var * sort) list, 
paulson@15347
   249
                    tvar_type_literals: type_literal list, 
quigley@17150
   250
                    tfree_type_literals: type_literal list ,
quigley@17150
   251
                    tvars: string list,
quigley@17150
   252
                    predicates: (string*int) list,
quigley@17150
   253
                    functions: (string*int) list};
quigley@17150
   254
paulson@15347
   255
paulson@17404
   256
exception CLAUSE of string * term;
paulson@15347
   257
mengj@18402
   258
fun get_literals (c as Clause(cls)) = #literals cls;
mengj@18402
   259
mengj@18402
   260
fun components_of_literal (Literal (pol,pred,tag)) = ((pol,pred),tag);
mengj@18402
   261
mengj@18402
   262
fun predicate_name (Predicate(predname,_,_)) = predname;
mengj@18402
   263
paulson@15347
   264
paulson@15347
   265
(*** make clauses ***)
paulson@15347
   266
paulson@17317
   267
fun isFalse (Literal (pol,Predicate(a,_,[]),_)) =
paulson@17317
   268
      (pol andalso a = "c_False") orelse
paulson@17317
   269
      (not pol andalso a = "c_True")
paulson@17317
   270
  | isFalse _ = false;
paulson@17317
   271
paulson@17404
   272
fun isTrue (Literal (pol,Predicate(a,_,[]),_)) =
paulson@17404
   273
      (pol andalso a = "c_True") orelse
paulson@17404
   274
      (not pol andalso a = "c_False")
paulson@17404
   275
  | isTrue _ = false;
paulson@17404
   276
  
paulson@17404
   277
fun isTaut (Clause {literals,...}) = exists isTrue literals;  
paulson@17404
   278
paulson@17234
   279
fun make_clause (clause_id,axiom_name,kind,literals,
paulson@17234
   280
                 types_sorts,tvar_type_literals,
paulson@17230
   281
                 tfree_type_literals,tvars, predicates, functions) =
paulson@17317
   282
  if forall isFalse literals 
paulson@17234
   283
  then error "Problem too trivial for resolution (empty clause)"
paulson@17234
   284
  else
paulson@17230
   285
     Clause {clause_id = clause_id, axiom_name = axiom_name, kind = kind, 
paulson@17230
   286
             literals = literals, types_sorts = types_sorts,
paulson@17230
   287
             tvar_type_literals = tvar_type_literals,
paulson@17230
   288
             tfree_type_literals = tfree_type_literals,
paulson@17230
   289
             tvars = tvars, predicates = predicates, 
paulson@17230
   290
             functions = functions};
quigley@17150
   291
paulson@15347
   292
paulson@17317
   293
(** Some Clause destructor functions **)
paulson@17317
   294
paulson@17317
   295
fun string_of_kind (Clause cls) = name_of_kind (#kind cls);
paulson@17317
   296
paulson@17317
   297
fun get_axiomName (Clause cls) = #axiom_name cls;
paulson@17317
   298
paulson@17317
   299
fun get_clause_id (Clause cls) = #clause_id cls;
paulson@17317
   300
paulson@17317
   301
fun funcs_of_cls (Clause cls) = #functions cls;
paulson@17317
   302
paulson@17317
   303
fun preds_of_cls (Clause cls) = #predicates cls;
paulson@17317
   304
paulson@17317
   305
paulson@18218
   306
(*Declarations of the current theory--to allow suppressing types.*)
paulson@18218
   307
val const_typargs = ref (Library.K [] : (string*typ -> typ list));
paulson@17317
   308
paulson@18218
   309
fun num_typargs(s,T) = if !keep_types then length (!const_typargs (s,T)) else 0;
paulson@16925
   310
paulson@16925
   311
(*Initialize the type suppression mechanism with the current theory before
paulson@16925
   312
    producing any clauses!*)
paulson@18218
   313
fun init thy = (const_typargs := Sign.const_typargs thy);
paulson@16925
   314
    
quigley@17150
   315
mengj@18402
   316
(*Flatten a type to a fol_type while accumulating sort constraints on the TFrees and
paulson@16925
   317
  TVars it contains.*)    
paulson@18218
   318
fun type_of (Type (a, Ts)) = 
paulson@18218
   319
      let val (folTyps, (ts, funcs)) = types_of Ts 
paulson@18218
   320
	  val t = make_fixed_type_const a
paulson@18218
   321
      in    
mengj@18402
   322
	  (Comp(t,folTyps), (ts, (t, length Ts)::funcs))
paulson@18218
   323
      end
paulson@18218
   324
  | type_of (TFree (a,s)) = 
paulson@18218
   325
      let val t = make_fixed_type_var a
mengj@18402
   326
      in (AtomF(t), ([((FOLTFree a),s)], [(t,0)])) end
mengj@18402
   327
  | type_of (TVar (v, s)) = (AtomV(make_schematic_type_var v), ([((FOLTVar v),s)], []))
paulson@18218
   328
and types_of Ts =
paulson@17230
   329
      let val foltyps_ts = map type_of Ts 
paulson@17230
   330
	  val (folTyps,ts_funcs) = ListPair.unzip foltyps_ts
paulson@17230
   331
	  val (ts, funcslist) = ListPair.unzip ts_funcs
paulson@17230
   332
      in    
paulson@18218
   333
	  (folTyps, (union_all ts, union_all funcslist))
paulson@18218
   334
      end;
quigley@17150
   335
paulson@15390
   336
paulson@18218
   337
fun const_types_of (c,T) = types_of (!const_typargs (c,T));
paulson@16925
   338
paulson@16903
   339
(* Any variables created via the METAHYPS tactical should be treated as
paulson@16903
   340
   universal vars, although it is represented as "Free(...)" by Isabelle *)
paulson@16903
   341
val isMeta = String.isPrefix "METAHYP1_"
quigley@17150
   342
paulson@17230
   343
fun pred_name_type (Const(c,T)) = 
paulson@18218
   344
      let val (contys,(folTyps,funcs)) = const_types_of (c,T)
paulson@18218
   345
      in (make_fixed_const c, (contys,folTyps), funcs) end
paulson@15390
   346
  | pred_name_type (Free(x,T))  = 
paulson@17404
   347
      if isMeta x then raise CLAUSE("Predicate Not First Order 1", Free(x,T)) 
paulson@18218
   348
      else (make_fixed_var x, ([],[]), [])
paulson@17404
   349
  | pred_name_type (v as Var _) = raise CLAUSE("Predicate Not First Order 2", v)
paulson@17404
   350
  | pred_name_type t        = raise CLAUSE("Predicate input unexpected", t);
paulson@15347
   351
paulson@15615
   352
paulson@18218
   353
(* For typed equality *)
paulson@15615
   354
(* here "arg_typ" is the type of "="'s argument's type, not the type of the equality *)
paulson@15615
   355
(* Find type of equality arg *)
paulson@15615
   356
fun eq_arg_type (Type("fun",[T,_])) = 
paulson@15615
   357
    let val (folT,_) = type_of T;
paulson@17230
   358
    in  folT  end;
paulson@15347
   359
paulson@18218
   360
fun fun_name_type (Const("op =",T)) args =   (*FIXME: Is this special treatment of = needed??*)
paulson@18218
   361
      let val t = make_fixed_const "op ="
paulson@18218
   362
      in (t, ([eq_arg_type T], []), [(t,2)]) end
paulson@18218
   363
  | fun_name_type (Const(c,T)) args = 
paulson@17230
   364
      let val t = make_fixed_const c
paulson@18218
   365
	  val (contys, (folTyps,funcs)) = const_types_of (c,T)
paulson@18218
   366
	  val arity = num_typargs(c,T) + length args
paulson@17230
   367
      in
paulson@18218
   368
	  (t, (contys,folTyps), ((t,arity)::funcs))
paulson@17230
   369
      end
paulson@17230
   370
 | fun_name_type (Free(x,T)) args  = 
paulson@17230
   371
      let val t = make_fixed_var x
paulson@18218
   372
      in  (t, ([],[]), [(t, length args)]) end
paulson@17404
   373
  | fun_name_type f args = raise CLAUSE("Function Not First Order 1", f);
quigley@17150
   374
paulson@15615
   375
paulson@15347
   376
fun term_of (Var(ind_nm,T)) = 
paulson@17230
   377
      let val (folType,(ts,funcs)) = type_of T
paulson@17230
   378
      in
paulson@17230
   379
	  (UVar(make_schematic_var ind_nm, folType), (ts, funcs))
paulson@17230
   380
      end
paulson@15347
   381
  | term_of (Free(x,T)) = 
paulson@17404
   382
      let val (folType, (ts,funcs)) = type_of T
paulson@17230
   383
      in
paulson@17230
   384
	  if isMeta x then (UVar(make_schematic_var(x,0),folType),
paulson@17230
   385
			    (ts, ((make_schematic_var(x,0)),0)::funcs))
paulson@17230
   386
	  else
paulson@18218
   387
	      (Fun(make_fixed_var x, [folType], []), 
paulson@17404
   388
	       (ts, ((make_fixed_var x),0)::funcs))
paulson@17230
   389
      end
paulson@17230
   390
  | term_of (Const(c,T)) =  (* impossible to be equality *)
paulson@18218
   391
      let val (contys, (folTyps,funcs)) = const_types_of (c,T)
paulson@17404
   392
      in
paulson@18218
   393
	  (Fun(make_fixed_const c, contys, []),
paulson@18218
   394
	   (folTyps, ((make_fixed_const c),0)::funcs))
paulson@17230
   395
      end    
paulson@18218
   396
  | term_of app = 
paulson@17230
   397
      let val (f,args) = strip_comb app
paulson@18218
   398
          val _ = case f of Const(_,_) => ()
paulson@18218
   399
			  | Free(s,_)  => 
paulson@18218
   400
			      if isMeta s 
paulson@18218
   401
			      then raise CLAUSE("Function Not First Order 2", f)
paulson@18218
   402
			      else ()
paulson@18218
   403
			  | _ => raise CLAUSE("Function Not First Order 3", f);
paulson@18218
   404
	  val (funName,(contys,ts1),funcs) = fun_name_type f args
paulson@18218
   405
	  val (args',(ts2,funcs')) = terms_of args
paulson@17230
   406
      in
paulson@18218
   407
	  (Fun(funName,contys,args'), 
paulson@18218
   408
	   (union_all (ts1::ts2), 
paulson@18218
   409
	    union_all(funcs::funcs')))
paulson@17230
   410
      end
paulson@18218
   411
  | term_of t = raise CLAUSE("Function Not First Order 4", t)
paulson@18218
   412
and terms_of ts =  
paulson@18218
   413
      let val (args, ts_funcs) = ListPair.unzip (map term_of ts)
paulson@18218
   414
      in
paulson@18218
   415
	  (args, ListPair.unzip ts_funcs)
paulson@18218
   416
      end
paulson@15390
   417
paulson@15347
   418
paulson@17404
   419
fun pred_of (Const("op =", typ), args) =
paulson@17404
   420
      let val arg_typ = eq_arg_type typ 
paulson@18218
   421
	  val (args',(ts,funcs)) = terms_of args
paulson@17404
   422
	  val equal_name = make_fixed_const "op ="
paulson@17404
   423
      in
paulson@18218
   424
	  (Predicate(equal_name,[arg_typ],args'),
paulson@17775
   425
	   union_all ts, 
paulson@17404
   426
	   [((make_fixed_var equal_name), 2)], 
paulson@17775
   427
	   union_all funcs)
paulson@17404
   428
      end
paulson@17404
   429
  | pred_of (pred,args) = 
paulson@17404
   430
      let val (predName,(predType,ts1), pfuncs) = pred_name_type pred
paulson@18218
   431
	  val (args',(ts2,ffuncs)) = terms_of args
paulson@17775
   432
	  val ts3 = union_all (ts1::ts2)
paulson@17775
   433
	  val ffuncs' = union_all ffuncs
paulson@17888
   434
	  val newfuncs = pfuncs union ffuncs'
paulson@17404
   435
	  val arity = 
paulson@17404
   436
	    case pred of
paulson@18218
   437
		Const (c,T) => num_typargs(c,T) + length args
paulson@17404
   438
	      | _ => length args
paulson@17404
   439
      in
paulson@17404
   440
	  (Predicate(predName,predType,args'), ts3, 
paulson@17404
   441
	   [(predName, arity)], newfuncs)
paulson@17404
   442
      end;
paulson@15347
   443
paulson@15347
   444
paulson@17404
   445
(*Treatment of literals, possibly negated or tagged*)
paulson@17404
   446
fun predicate_of ((Const("Not",_) $ P), polarity, tag) =
paulson@17404
   447
      predicate_of (P, not polarity, tag)
paulson@17404
   448
  | predicate_of ((Const("HOL.tag",_) $ P), polarity, tag) =
paulson@17404
   449
      predicate_of (P, polarity, true)
paulson@17404
   450
  | predicate_of (term,polarity,tag) =
paulson@17404
   451
        (pred_of (strip_comb term), polarity, tag);
paulson@15347
   452
paulson@17888
   453
fun literals_of_term1 args (Const("Trueprop",_) $ P) = literals_of_term1 args P
paulson@17888
   454
  | literals_of_term1 (args as (lits, ts, preds, funcs)) (Const("op |",_) $ P $ Q) = 
paulson@17888
   455
      let val (lits', ts', preds', funcs') = literals_of_term1 args P
paulson@17234
   456
      in
paulson@17888
   457
	  literals_of_term1 (lits', ts', preds' union preds, funcs' union funcs) Q
paulson@17234
   458
      end
paulson@17888
   459
  | literals_of_term1 (lits, ts, preds, funcs) P =
paulson@17888
   460
      let val ((pred, ts', preds', funcs'), pol, tag) = predicate_of (P,true,false)
paulson@17404
   461
	  val lits' = Literal(pol,pred,tag) :: lits
paulson@17234
   462
      in
paulson@17888
   463
	  (lits', ts union ts', preds' union preds, funcs' union funcs)
paulson@17234
   464
      end;
quigley@17150
   465
quigley@17150
   466
paulson@17888
   467
val literals_of_term = literals_of_term1 ([],[],[],[]);
quigley@17150
   468
quigley@17150
   469
mengj@18403
   470
mengj@18403
   471
fun list_ord _ ([],[]) = EQUAL
mengj@18403
   472
  | list_ord _ ([],_) = LESS
mengj@18403
   473
  | list_ord _ (_,[]) = GREATER
mengj@18403
   474
  | list_ord ord (x::xs, y::ys) =
mengj@18403
   475
    let val xy_ord = ord(x,y)
mengj@18403
   476
    in
mengj@18403
   477
	case xy_ord of EQUAL => list_ord ord (xs,ys)
mengj@18403
   478
		     | _ => xy_ord
mengj@18403
   479
    end;
mengj@18403
   480
mengj@18403
   481
fun type_ord (AtomV(_),AtomV(_)) = EQUAL
mengj@18403
   482
  | type_ord (AtomV(_),_) = LESS
mengj@18403
   483
  | type_ord (AtomF(_),AtomV(_)) = GREATER
mengj@18403
   484
  | type_ord (AtomF(f1),AtomF(f2)) = string_ord (f1,f2)
mengj@18403
   485
  | type_ord (AtomF(_),_) = LESS
mengj@18403
   486
  | type_ord (Comp(_,_),AtomV(_)) = GREATER
mengj@18403
   487
  | type_ord (Comp(_,_),AtomF(_)) = GREATER
mengj@18403
   488
  | type_ord (Comp(con1,args1),Comp(con2,args2)) = 
mengj@18403
   489
    let val con_ord = string_ord(con1,con2)
mengj@18403
   490
    in
mengj@18403
   491
	case con_ord of EQUAL => types_ord (args1,args2)
mengj@18403
   492
		      | _ => con_ord
mengj@18403
   493
    end
mengj@18403
   494
and
mengj@18403
   495
mengj@18403
   496
types_ord ([],[]) = EQUAL
mengj@18403
   497
  | types_ord (tps1,tps2) = list_ord type_ord (tps1,tps2);
mengj@18403
   498
mengj@18402
   499
mengj@18403
   500
fun term_ord (UVar(_,_),UVar(_,_)) = EQUAL
mengj@18403
   501
  | term_ord (UVar(_,_),_) = LESS
mengj@18403
   502
  | term_ord (Fun(_,_,_),UVar(_)) = GREATER
mengj@18403
   503
  | term_ord (Fun(f1,tps1,tms1),Fun(f2,tps2,tms2)) = 
mengj@18403
   504
    let val fn_ord = string_ord (f1,f2)
mengj@18403
   505
    in
mengj@18403
   506
	case fn_ord of EQUAL => 
mengj@18403
   507
		       let val tms_ord = terms_ord (tms1,tms2)
mengj@18403
   508
		       in
mengj@18403
   509
			   case tms_ord of EQUAL => types_ord (tps1,tps2)
mengj@18403
   510
					 | _ => tms_ord
mengj@18403
   511
		       end
mengj@18403
   512
		     | _ => fn_ord
mengj@18403
   513
    end
mengj@18403
   514
mengj@18403
   515
and
mengj@18403
   516
mengj@18403
   517
terms_ord ([],[]) = EQUAL
mengj@18403
   518
  | terms_ord (tms1,tms2) = list_ord term_ord (tms1,tms2);
mengj@18403
   519
mengj@18403
   520
mengj@18403
   521
mengj@18403
   522
fun predicate_ord (Predicate(predname1,ftyps1,ftms1),Predicate(predname2,ftyps2,ftms2)) = 
mengj@18403
   523
    let val predname_ord = string_ord (predname1,predname2)
mengj@18403
   524
    in
mengj@18403
   525
	case predname_ord of EQUAL => 
mengj@18403
   526
			     let val ftms_ord = terms_ord(ftms1,ftms2)
mengj@18403
   527
			     in
mengj@18403
   528
				 case ftms_ord of EQUAL => types_ord(ftyps1,ftyps2)
mengj@18403
   529
						| _ => ftms_ord
mengj@18403
   530
			     end
mengj@18403
   531
			   | _ => predname_ord
mengj@18403
   532
    end;
mengj@18402
   533
mengj@18402
   534
fun literal_ord (Literal(false,_,_),Literal(true,_,_)) = LESS
mengj@18402
   535
  | literal_ord (Literal(true,_,_),Literal(false,_,_)) = GREATER
mengj@18402
   536
  | literal_ord (Literal(_,pred1,_),Literal(_,pred2,_)) = predicate_ord(pred1,pred2);
mengj@18402
   537
mengj@18402
   538
fun sort_lits lits = sort literal_ord lits;
mengj@18402
   539
mengj@18409
   540
(********** clause equivalence ******************)
mengj@18409
   541
mengj@18409
   542
fun check_var_pairs (x,y) [] = 0 
mengj@18409
   543
  | check_var_pairs (x,y) ((u,v)::w) =
mengj@18409
   544
    if (x,y) = (u,v) then 1 
mengj@18409
   545
    else
mengj@18409
   546
	if (x = u) orelse (y = v) then 2 (*conflict*)
mengj@18409
   547
	else check_var_pairs (x,y) w;
mengj@18409
   548
mengj@18409
   549
mengj@18409
   550
fun type_eq (AtomV(v1),AtomV(v2)) (vars,tvars) =
mengj@18409
   551
    (case check_var_pairs (v1,v2) tvars of 0 => (true,(vars,(v1,v2)::tvars))
mengj@18409
   552
					 | 1 => (true,(vars,tvars))
mengj@18409
   553
					 | 2 => (false,(vars,tvars)))
mengj@18409
   554
  | type_eq (AtomV(_),_) vtvars = (false,vtvars)
mengj@18409
   555
  | type_eq (AtomF(f1),AtomF(f2)) vtvars = (f1=f2,vtvars)
mengj@18409
   556
  | type_eq (AtomF(_),_) vtvars = (false,vtvars)
mengj@18409
   557
  | type_eq (Comp(con1,args1),Comp(con2,args2)) vtvars =
mengj@18409
   558
    let val (eq1,vtvars1) = 
mengj@18409
   559
	    if (con1 = con2) then types_eq (args1,args2) vtvars
mengj@18409
   560
	    else (false,vtvars)
mengj@18409
   561
    in
mengj@18409
   562
	(eq1,vtvars1)
mengj@18409
   563
    end
mengj@18409
   564
  | type_eq (Comp(_,_),_) vtvars = (false,vtvars)
mengj@18409
   565
mengj@18409
   566
and
mengj@18409
   567
mengj@18409
   568
types_eq ([],[]) vtvars = (true,vtvars)
mengj@18409
   569
| types_eq (tp1::tps1,tp2::tps2) vtvars =
mengj@18409
   570
  let val (eq1,vtvars1) = type_eq (tp1,tp2) vtvars
mengj@18409
   571
      val (eq2,vtvars2) = if eq1 then types_eq (tps1,tps2) vtvars1
mengj@18409
   572
			  else (eq1,vtvars1)
mengj@18409
   573
  in
mengj@18409
   574
      (eq2,vtvars2)
mengj@18409
   575
  end;
mengj@18409
   576
mengj@18409
   577
mengj@18409
   578
fun term_eq (UVar(v1,tp1),UVar(v2,tp2)) (vars,tvars) =
mengj@18409
   579
    (case check_var_pairs (v1,v2) vars of 0 => type_eq (tp1,tp2) (((v1,v2)::vars),tvars)
mengj@18409
   580
					| 1 => type_eq (tp1,tp2) (vars,tvars)
mengj@18409
   581
					| 2 => (false,(vars,tvars)))
mengj@18409
   582
  | term_eq (UVar(_,_),_) vtvars = (false,vtvars)
mengj@18409
   583
  | term_eq (Fun(f1,tps1,tms1),Fun(f2,tps2,tms2)) vtvars =
mengj@18409
   584
    let val (eq1,vtvars1) = 
mengj@18409
   585
	    if (f1 = f2) then terms_eq (tms1,tms2) vtvars
mengj@18409
   586
	    else (false,vtvars)
mengj@18409
   587
	val (eq2,vtvars2) =
mengj@18409
   588
	    if eq1 then types_eq (tps1,tps2) vtvars1
mengj@18409
   589
	    else (eq1,vtvars1)
mengj@18409
   590
    in
mengj@18409
   591
	(eq2,vtvars2)
mengj@18409
   592
    end
mengj@18409
   593
  | term_eq (Fun(_,_,_),_) vtvars = (false,vtvars)
mengj@18409
   594
mengj@18409
   595
and
mengj@18409
   596
mengj@18409
   597
terms_eq ([],[]) vtvars = (true,vtvars)
mengj@18409
   598
| terms_eq (tm1::tms1,tm2::tms2) vtvars =
mengj@18409
   599
  let val (eq1,vtvars1) = term_eq (tm1,tm2) vtvars
mengj@18409
   600
      val (eq2,vtvars2) = if eq1 then terms_eq (tms1,tms2) vtvars1
mengj@18409
   601
				 else (eq1,vtvars1)
mengj@18409
   602
  in
mengj@18409
   603
      (eq2,vtvars2)
mengj@18409
   604
  end;
mengj@18409
   605
					     
mengj@18409
   606
mengj@18409
   607
fun pred_eq (Predicate(predname1,tps1,tms1),Predicate(predname2,tps2,tms2)) vtvars =
mengj@18409
   608
    let val (eq1,vtvars1) = 
mengj@18409
   609
	    if (predname1 = predname2) then terms_eq (tms1,tms2) vtvars
mengj@18409
   610
	    else (false,vtvars)
mengj@18409
   611
	val (eq2,vtvars2) = 
mengj@18409
   612
	    if eq1 then types_eq (tps1,tps2) vtvars1
mengj@18409
   613
	    else (eq1,vtvars1)
mengj@18409
   614
    in
mengj@18409
   615
	(eq2,vtvars2)
mengj@18409
   616
    end;
mengj@18409
   617
					      
mengj@18409
   618
mengj@18409
   619
fun lit_eq (Literal(pol1,pred1,_),Literal(pol2,pred2,_)) vtvars =
mengj@18409
   620
    if (pol1 = pol2) then pred_eq (pred1,pred2) vtvars
mengj@18409
   621
    else (false,vtvars);
mengj@18409
   622
mengj@18409
   623
(*must have the same number of literals*)
mengj@18409
   624
fun lits_eq ([],[]) vtvars = (true,vtvars)
mengj@18409
   625
  | lits_eq (l1::ls1,l2::ls2) vtvars = 
mengj@18409
   626
    let val (eq1,vtvars1) = lit_eq (l1,l2) vtvars
mengj@18409
   627
    in
mengj@18409
   628
	if eq1 then lits_eq (ls1,ls2) vtvars1
mengj@18409
   629
	else (false,vtvars1)
mengj@18409
   630
    end;
mengj@18409
   631
mengj@18409
   632
mengj@18409
   633
fun cls_eq (cls1,cls2) =
mengj@18409
   634
    let val lits1 = get_literals cls1
mengj@18409
   635
	val lits2 = get_literals cls2
mengj@18409
   636
    in
mengj@18409
   637
	(length lits1 = length lits2) andalso (fst (lits_eq (lits1,lits2) ([],[])))
mengj@18409
   638
    end;
mengj@18409
   639
mengj@18409
   640
mengj@18402
   641
mengj@18402
   642
quigley@17150
   643
(* FIX: not sure what to do with these funcs *)
quigley@17150
   644
paulson@16199
   645
(*Make literals for sorted type variables*) 
quigley@17150
   646
fun sorts_on_typs (_, [])   = ([]) 
paulson@16199
   647
  | sorts_on_typs (v, "HOL.type" :: s) =
paulson@16199
   648
      sorts_on_typs (v,s)   (*Ignore sort "type"*)
paulson@17230
   649
  | sorts_on_typs ((FOLTVar indx), (s::ss)) =
paulson@17230
   650
      LTVar((make_type_class s) ^ 
paulson@17230
   651
        "(" ^ (make_schematic_type_var indx) ^ ")") :: 
paulson@17230
   652
      (sorts_on_typs ((FOLTVar indx), ss))
paulson@17230
   653
  | sorts_on_typs ((FOLTFree x), (s::ss)) =
paulson@17230
   654
      LTFree((make_type_class s) ^ "(" ^ (make_fixed_type_var x) ^ ")") :: 
paulson@17230
   655
      (sorts_on_typs ((FOLTFree x), ss));
paulson@15347
   656
quigley@17150
   657
paulson@17312
   658
(*UGLY: seems to be parsing the "show sorts" output, removing anything that
paulson@17312
   659
  starts with a left parenthesis.*)
paulson@17312
   660
fun remove_type str = hd (String.fields (fn c => c = #"(") str);
quigley@17150
   661
quigley@17150
   662
fun pred_of_sort (LTVar x) = ((remove_type x),1)
quigley@17150
   663
|   pred_of_sort (LTFree x) = ((remove_type x),1)
quigley@17150
   664
quigley@17150
   665
quigley@17150
   666
quigley@17150
   667
paulson@16199
   668
(*Given a list of sorted type variables, return two separate lists.
paulson@16199
   669
  The first is for TVars, the second for TFrees.*)
quigley@17150
   670
fun add_typs_aux [] preds  = ([],[], preds)
paulson@17230
   671
  | add_typs_aux ((FOLTVar indx,s)::tss) preds = 
paulson@17230
   672
      let val vs = sorts_on_typs (FOLTVar indx, s)
quigley@17150
   673
          val preds' = (map pred_of_sort vs)@preds
quigley@17150
   674
	  val (vss,fss, preds'') = add_typs_aux tss preds'
quigley@17150
   675
      in
paulson@17775
   676
	  (vs union vss, fss, preds'')
quigley@17150
   677
      end
paulson@17230
   678
  | add_typs_aux ((FOLTFree x,s)::tss) preds  =
paulson@17230
   679
      let val fs = sorts_on_typs (FOLTFree x, s)
quigley@17150
   680
          val preds' = (map pred_of_sort fs)@preds
quigley@17150
   681
	  val (vss,fss, preds'') = add_typs_aux tss preds'
quigley@17150
   682
      in
paulson@17775
   683
	  (vss, fs union fss, preds'')
quigley@17150
   684
      end;
quigley@17150
   685
mengj@17999
   686
fun add_typs_aux2 [] = ([],[])
mengj@17999
   687
  | add_typs_aux2 ((FOLTVar indx,s)::tss) =
mengj@17999
   688
    let val vs = sorts_on_typs (FOLTVar indx,s)
mengj@17999
   689
	val (vss,fss) = add_typs_aux2 tss
mengj@17999
   690
    in
mengj@17999
   691
	(vs union vss,fss)
mengj@17999
   692
    end
mengj@17999
   693
  | add_typs_aux2 ((FOLTFree x,s)::tss) =
mengj@17999
   694
    let val fs = sorts_on_typs (FOLTFree x,s)
mengj@17999
   695
	val (vss,fss) = add_typs_aux2 tss
mengj@17999
   696
    in
mengj@17999
   697
	(vss,fs union fss)
mengj@17999
   698
    end;
mengj@17999
   699
mengj@17999
   700
quigley@17150
   701
fun add_typs (Clause cls) preds  = add_typs_aux (#types_sorts cls) preds 
paulson@15347
   702
paulson@15347
   703
paulson@15347
   704
(** make axiom clauses, hypothesis clauses and conjecture clauses. **)
quigley@17150
   705
quigley@17150
   706
fun get_tvar_strs [] = []
paulson@17230
   707
  | get_tvar_strs ((FOLTVar indx,s)::tss) = 
paulson@17230
   708
      let val vstr = make_schematic_type_var indx
quigley@17150
   709
      in
paulson@17888
   710
	  vstr ins (get_tvar_strs tss)
quigley@17150
   711
      end
paulson@17230
   712
  | get_tvar_strs((FOLTFree x,s)::tss) = distinct (get_tvar_strs tss)
quigley@17150
   713
quigley@17150
   714
(* FIX add preds and funcs to add typs aux here *)
quigley@17150
   715
paulson@17230
   716
fun make_axiom_clause_thm thm (ax_name,cls_id) =
paulson@17888
   717
    let val (lits,types_sorts, preds, funcs) = literals_of_term (prop_of thm)
mengj@18402
   718
	val lits' = sort_lits lits
quigley@17150
   719
	val (tvar_lits,tfree_lits, preds) = add_typs_aux types_sorts preds 
quigley@17150
   720
        val tvars = get_tvar_strs types_sorts
quigley@17150
   721
    in 
paulson@17230
   722
	make_clause(cls_id,ax_name,Axiom,
mengj@18402
   723
	            lits',types_sorts,tvar_lits,tfree_lits,
paulson@17230
   724
	            tvars, preds, funcs)
paulson@15347
   725
    end;
paulson@15347
   726
paulson@15347
   727
mengj@18199
   728
(* check if a clause is FOL first*)
paulson@17888
   729
fun make_conjecture_clause n t =
mengj@18199
   730
    let val _ = check_is_fol_term t
mengj@18199
   731
	    handle TERM("check_is_fol_term",_) => raise CLAUSE("Goal is not FOL",t)
mengj@18199
   732
	val (lits,types_sorts, preds, funcs) = literals_of_term t
quigley@17150
   733
	val (tvar_lits,tfree_lits, preds) = add_typs_aux types_sorts preds 
quigley@17150
   734
        val tvars = get_tvar_strs types_sorts
quigley@17150
   735
    in
paulson@17845
   736
	make_clause(n,"conjecture",Conjecture,
paulson@17230
   737
	            lits,types_sorts,tvar_lits,tfree_lits,
paulson@17230
   738
	            tvars, preds, funcs)
quigley@17150
   739
    end;
paulson@17845
   740
    
paulson@17845
   741
fun make_conjecture_clauses_aux _ [] = []
paulson@17888
   742
  | make_conjecture_clauses_aux n (t::ts) =
paulson@17888
   743
      make_conjecture_clause n t :: make_conjecture_clauses_aux (n+1) ts
paulson@17845
   744
paulson@17845
   745
val make_conjecture_clauses = make_conjecture_clauses_aux 0
quigley@17150
   746
quigley@17150
   747
mengj@18199
   748
(*before converting an axiom clause to "clause" format, check if it is FOL*)
paulson@17230
   749
fun make_axiom_clause term (ax_name,cls_id) =
mengj@18199
   750
    let val _ = check_is_fol_term term 
mengj@18199
   751
	    handle TERM("check_is_fol_term",_) => raise CLAUSE("Axiom is not FOL", term) 
mengj@18199
   752
	val (lits,types_sorts, preds,funcs) = literals_of_term term
mengj@18402
   753
	val lits' = sort_lits lits
paulson@17230
   754
	val (tvar_lits,tfree_lits, preds) = add_typs_aux types_sorts preds
quigley@17150
   755
        val tvars = get_tvar_strs types_sorts	
paulson@15347
   756
    in 
paulson@17230
   757
	make_clause(cls_id,ax_name,Axiom,
mengj@18402
   758
	            lits',types_sorts,tvar_lits,tfree_lits,
paulson@17230
   759
	            tvars, preds,funcs)
paulson@15347
   760
    end;
paulson@15347
   761
paulson@15347
   762
paulson@15347
   763
paulson@15347
   764
 
paulson@15347
   765
(**** Isabelle arities ****)
paulson@15347
   766
paulson@15347
   767
exception ARCLAUSE of string;
paulson@15347
   768
 
paulson@15347
   769
paulson@15347
   770
type class = string; 
paulson@15347
   771
type tcons = string; 
paulson@15347
   772
paulson@15347
   773
paulson@15347
   774
datatype arLit = TConsLit of bool * (class * tcons * string list) | TVarLit of bool * (class * string);
paulson@15347
   775
 
paulson@15347
   776
datatype arityClause =  
paulson@15347
   777
	 ArityClause of {clause_id: clause_id,
paulson@17845
   778
	  	         axiom_name: axiom_name,
paulson@15347
   779
			 kind: kind,
paulson@15347
   780
			 conclLit: arLit,
paulson@15347
   781
			 premLits: arLit list};
paulson@15347
   782
paulson@15347
   783
paulson@15347
   784
fun get_TVars 0 = []
paulson@17525
   785
  | get_TVars n = ("T_" ^ (Int.toString n)) :: get_TVars (n-1);
paulson@15347
   786
paulson@15347
   787
paulson@15347
   788
paulson@15347
   789
fun pack_sort(_,[])  = raise ARCLAUSE("Empty Sort Found") 
paulson@15347
   790
  | pack_sort(tvar, [cls]) = [(make_type_class cls, tvar)] 
paulson@15347
   791
  | pack_sort(tvar, cls::srt) =  (make_type_class cls,tvar) :: (pack_sort(tvar, srt));
paulson@15347
   792
    
paulson@15347
   793
    
paulson@15347
   794
fun make_TVarLit (b,(cls,str)) = TVarLit(b,(cls,str));
paulson@15347
   795
fun make_TConsLit (b,(cls,tcons,tvars)) = TConsLit(b,(make_type_class cls,make_fixed_type_const tcons,tvars));
paulson@15347
   796
paulson@17845
   797
fun make_axiom_arity_clause (tcons,n,(res,args)) =
paulson@17845
   798
   let val nargs = length args
paulson@17845
   799
       val tvars = get_TVars nargs
paulson@17845
   800
       val tvars_srts = ListPair.zip (tvars,args)
paulson@17845
   801
       val tvars_srts' = union_all(map pack_sort tvars_srts)
paulson@17845
   802
       val false_tvars_srts' = map (pair false) tvars_srts'
paulson@17845
   803
   in
paulson@17845
   804
      ArityClause {clause_id = n, kind = Axiom, 
paulson@17845
   805
                   axiom_name = tcons,
paulson@17845
   806
                   conclLit = make_TConsLit(true,(res,tcons,tvars)), 
paulson@17845
   807
                   premLits = map make_TVarLit false_tvars_srts'}
paulson@17845
   808
   end;
paulson@15347
   809
    
paulson@17305
   810
(*The number of clauses generated from cls, including type clauses*)
paulson@17305
   811
fun num_of_clauses (Clause cls) =
paulson@17305
   812
    let val num_tfree_lits = 
paulson@17305
   813
	      if !keep_types then length (#tfree_type_literals cls)
paulson@17305
   814
	      else 0
paulson@17305
   815
    in 	1 + num_tfree_lits  end;
paulson@15347
   816
paulson@15347
   817
paulson@15347
   818
(**** Isabelle class relations ****)
paulson@15347
   819
paulson@15347
   820
paulson@15347
   821
datatype classrelClause = 
paulson@15347
   822
	 ClassrelClause of {clause_id: clause_id,
paulson@15347
   823
			    subclass: class,
skalberg@15531
   824
			    superclass: class option};
paulson@15347
   825
paulson@17845
   826
paulson@17845
   827
fun make_axiom_classrelClause n subclass superclass =
paulson@17845
   828
  ClassrelClause {clause_id = n,
paulson@17845
   829
                  subclass = subclass, superclass = superclass};
paulson@15347
   830
paulson@15347
   831
paulson@17845
   832
fun classrelClauses_of_aux n sub [] = []
paulson@17845
   833
  | classrelClauses_of_aux n sub (sup::sups) =
paulson@17845
   834
      make_axiom_classrelClause n sub (SOME sup) :: classrelClauses_of_aux (n+1) sub sups;
paulson@15347
   835
paulson@15347
   836
paulson@15347
   837
fun classrelClauses_of (sub,sups) = 
paulson@17845
   838
    case sups of [] => [make_axiom_classrelClause 0 sub NONE]
paulson@17845
   839
	       | _ => classrelClauses_of_aux 0 sub sups;
paulson@17845
   840
paulson@17845
   841
paulson@17845
   842
(***** Isabelle arities *****)
paulson@17845
   843
paulson@17845
   844
paulson@17845
   845
fun arity_clause _ (tcons, []) = []
paulson@17845
   846
  | arity_clause n (tcons, ar::ars) =
paulson@17845
   847
      make_axiom_arity_clause (tcons,n,ar) :: 
paulson@17845
   848
      arity_clause (n+1) (tcons,ars);
paulson@17845
   849
paulson@17845
   850
fun multi_arity_clause [] = []
paulson@17845
   851
  | multi_arity_clause (tcon_ar :: tcons_ars)  =
paulson@17845
   852
      arity_clause 0 tcon_ar  @  multi_arity_clause tcons_ars 
paulson@17845
   853
paulson@17845
   854
fun arity_clause_thy thy =
paulson@17845
   855
  let val arities = #arities (Type.rep_tsig (Sign.tsig_of thy))
paulson@17845
   856
  in multi_arity_clause (Symtab.dest arities) end;
paulson@17845
   857
paulson@17845
   858
paulson@17845
   859
(* Isabelle classes *)
paulson@17845
   860
paulson@17845
   861
type classrelClauses = classrelClause list Symtab.table;
paulson@17845
   862
paulson@17845
   863
val classrel_of = #2 o #classes o Type.rep_tsig o Sign.tsig_of;
paulson@17845
   864
fun classrel_clauses_classrel (C: Sorts.classes) = map classrelClauses_of (Graph.dest C);
paulson@17845
   865
val classrel_clauses_thy = List.concat o classrel_clauses_classrel o classrel_of;
paulson@17845
   866
paulson@15347
   867
paulson@15347
   868
paulson@15347
   869
(****!!!! Changed for typed equality !!!!****)
paulson@17230
   870
paulson@15347
   871
fun wrap_eq_type typ t = eq_typ_wrapper ^"(" ^ t ^ "," ^ typ ^ ")";
paulson@15347
   872
paulson@18218
   873
(*Only need to wrap equality's arguments with "typeinfo" if the output clauses are typed 
paulson@18218
   874
 and if we specifically ask for types to be included.   *)
paulson@15347
   875
fun string_of_equality (typ,terms) =
paulson@17230
   876
      let val [tstr1,tstr2] = map string_of_term terms
mengj@18402
   877
	  val typ' = string_of_fol_type typ
paulson@17230
   878
      in
paulson@17230
   879
	  if !keep_types andalso !special_equal 
mengj@18402
   880
	  then "equal(" ^ (wrap_eq_type typ' tstr1) ^ "," ^ 
mengj@18402
   881
		 	  (wrap_eq_type typ' tstr2) ^ ")"
paulson@17230
   882
	  else "equal(" ^ tstr1 ^ "," ^ tstr2 ^ ")"
paulson@17230
   883
      end
paulson@17230
   884
and string_of_term (UVar(x,_)) = x
paulson@18218
   885
  | string_of_term (Fun("equal",[typ],terms)) = string_of_equality(typ,terms)
paulson@18218
   886
  | string_of_term (Fun (name,typs,[])) = name (*Overloaded consts like 0 don't get types!*)
paulson@18218
   887
  | string_of_term (Fun (name,typs,terms)) = 
paulson@18218
   888
      let val terms_as_strings = map string_of_term terms
mengj@18402
   889
	  val typs' = if !keep_types then map string_of_fol_type typs else []
mengj@18275
   890
      in  name ^ (paren_pack (terms_as_strings @ typs'))  end
paulson@18218
   891
  | string_of_term _ = error "string_of_term";      
paulson@15347
   892
paulson@15347
   893
(* before output the string of the predicate, check if the predicate corresponds to an equality or not. *)
paulson@18218
   894
fun string_of_predicate (Predicate("equal",[typ],terms)) = string_of_equality(typ,terms)
paulson@18218
   895
  | string_of_predicate (Predicate(name,typs,terms)) = 
paulson@17230
   896
      let val terms_as_strings = map string_of_term terms
mengj@18402
   897
	  val typs' = if !keep_types then map string_of_fol_type typs else []
mengj@18275
   898
      in  name ^ (paren_pack (terms_as_strings @ typs'))  end
paulson@18218
   899
  | string_of_predicate _ = error "string_of_predicate";      
quigley@17150
   900
paulson@17317
   901
paulson@17317
   902
fun string_of_clausename (cls_id,ax_name) = 
paulson@17525
   903
    clause_prefix ^ ascii_of ax_name ^ "_" ^ Int.toString cls_id;
paulson@17317
   904
paulson@17317
   905
fun string_of_type_clsname (cls_id,ax_name,idx) = 
paulson@17525
   906
    string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx);
quigley@17150
   907
    
quigley@17150
   908
quigley@17150
   909
(********************************)
quigley@17150
   910
(* Code for producing DFG files *)
quigley@17150
   911
(********************************)
quigley@17150
   912
quigley@17150
   913
fun dfg_literal (Literal(pol,pred,tag)) =
quigley@17150
   914
    let val pred_string = string_of_predicate pred
paulson@17234
   915
    in
paulson@17234
   916
	if pol then pred_string else "not(" ^pred_string ^ ")"  
quigley@17150
   917
    end;
quigley@17150
   918
quigley@17150
   919
quigley@17150
   920
(* FIX: what does this mean? *)
quigley@17150
   921
(*fun dfg_of_typeLit (LTVar x) = "not(" ^ x ^ ")"
quigley@17150
   922
  | dfg_of_typeLit (LTFree x) = "(" ^ x ^ ")";*)
quigley@17150
   923
quigley@17150
   924
fun dfg_of_typeLit (LTVar x) =  x 
quigley@17150
   925
  | dfg_of_typeLit (LTFree x) = x ;
quigley@17150
   926
 
paulson@17230
   927
(*Make the string of universal quantifiers for a clause*)
paulson@17230
   928
fun forall_open ([],[]) = ""
paulson@17230
   929
  | forall_open (vars,tvars) = "forall([" ^ (commas (tvars@vars))^ "],\n"
quigley@17150
   930
paulson@17230
   931
fun forall_close ([],[]) = ""
paulson@17230
   932
  | forall_close (vars,tvars) = ")"
quigley@17150
   933
paulson@17230
   934
fun gen_dfg_cls (cls_id,ax_name,knd,lits,tvars,vars) = 
paulson@17317
   935
    "clause( %(" ^ knd ^ ")\n" ^ forall_open(vars,tvars) ^ 
paulson@17317
   936
    "or(" ^ lits ^ ")" ^ forall_close(vars,tvars) ^ ",\n" ^ 
paulson@17317
   937
    string_of_clausename (cls_id,ax_name) ^  ").";
quigley@17150
   938
paulson@17317
   939
fun gen_dfg_type_cls (cls_id,ax_name,knd,tfree_lit,idx,tvars,vars) = 
paulson@17317
   940
    "clause( %(" ^ knd ^ ")\n" ^ forall_open(vars,tvars) ^ 
paulson@17317
   941
    "or( " ^ tfree_lit ^ ")" ^ forall_close(vars,tvars) ^ ",\n" ^ 
paulson@17317
   942
    string_of_type_clsname (cls_id,ax_name,idx) ^  ").";
quigley@17150
   943
quigley@17150
   944
fun dfg_clause_aux (Clause cls) = 
paulson@17230
   945
  let val lits = map dfg_literal (#literals cls)
paulson@17230
   946
      val tvar_lits_strs = 
paulson@17230
   947
	  if !keep_types then map dfg_of_typeLit (#tvar_type_literals cls) 
paulson@17230
   948
	  else []
paulson@17230
   949
      val tfree_lits =
paulson@17230
   950
          if !keep_types then map dfg_of_typeLit (#tfree_type_literals cls)
paulson@17230
   951
          else []
paulson@17230
   952
  in
paulson@17234
   953
      (tvar_lits_strs @ lits, tfree_lits)
paulson@17230
   954
  end; 
quigley@17150
   955
quigley@17150
   956
quigley@17150
   957
fun dfg_folterms (Literal(pol,pred,tag)) = 
paulson@18218
   958
  let val Predicate (predname, _, folterms) = pred
paulson@18218
   959
  in  folterms  end
quigley@17150
   960
quigley@17150
   961
 
paulson@17404
   962
fun get_uvars (UVar(a,typ)) = [a] 
paulson@17775
   963
|   get_uvars (Fun (_,typ,tlist)) = union_all(map get_uvars tlist)
quigley@17150
   964
quigley@17150
   965
paulson@17404
   966
fun is_uvar (UVar _) = true
paulson@17404
   967
|   is_uvar (Fun _) = false;
paulson@17404
   968
paulson@17404
   969
fun uvar_name (UVar(a,_)) = a
paulson@17404
   970
|   uvar_name (Fun (a,_,_)) = raise CLAUSE("Not a variable", Const(a,dummyT));
paulson@17404
   971
quigley@17150
   972
fun dfg_vars (Clause cls) =
paulson@17404
   973
    let val lits = #literals cls
paulson@18218
   974
        val folterms = List.concat (map dfg_folterms lits)
quigley@17150
   975
    in 
paulson@17775
   976
        union_all(map get_uvars folterms)
quigley@17150
   977
    end
quigley@17150
   978
quigley@17150
   979
quigley@17150
   980
fun dfg_tvars (Clause cls) =(#tvars cls)
quigley@17150
   981
quigley@17150
   982
quigley@17150
   983
	
quigley@17150
   984
(* make this return funcs and preds too? *)
paulson@18218
   985
fun string_of_predname (Predicate("equal",_,terms)) = "EQUALITY"
paulson@18218
   986
  | string_of_predname (Predicate(name,_,terms)) = name
quigley@17150
   987
    
quigley@17150
   988
	
quigley@17150
   989
quigley@17150
   990
fun concat_with sep []  = ""
quigley@17150
   991
  | concat_with sep [x] = "(" ^ x ^ ")"
quigley@17150
   992
  | concat_with sep (x::xs) = "(" ^ x ^ ")" ^  sep ^ (concat_with sep xs);
quigley@17150
   993
paulson@17234
   994
fun dfg_pred (Literal(pol,pred,tag)) ax_name = 
paulson@17234
   995
    (string_of_predname pred) ^ " " ^ ax_name
quigley@17150
   996
quigley@17150
   997
fun dfg_clause cls =
paulson@17230
   998
    let val (lits,tfree_lits) = dfg_clause_aux cls 
paulson@17230
   999
             (*"lits" includes the typing assumptions (TVars)*)
quigley@17150
  1000
        val vars = dfg_vars cls
quigley@17150
  1001
        val tvars = dfg_tvars cls
quigley@17150
  1002
	val knd = string_of_kind cls
paulson@17234
  1003
	val lits_str = commas lits
paulson@17317
  1004
	val cls_id = get_clause_id cls
paulson@17317
  1005
	val axname = get_axiomName cls
paulson@17317
  1006
	val cls_str = gen_dfg_cls(cls_id,axname,knd,lits_str,tvars, vars) 			
quigley@17150
  1007
        fun typ_clss k [] = []
quigley@17150
  1008
          | typ_clss k (tfree :: tfrees) = 
paulson@17317
  1009
              (gen_dfg_type_cls(cls_id,axname,knd,tfree,k, tvars,vars)) :: 
paulson@17234
  1010
              (typ_clss (k+1) tfrees)
quigley@17150
  1011
    in 
quigley@17150
  1012
	cls_str :: (typ_clss 0 tfree_lits)
quigley@17150
  1013
    end;
quigley@17150
  1014
paulson@17525
  1015
fun string_of_arity (name, num) =  name ^ "," ^ (Int.toString num) 
quigley@17150
  1016
paulson@17234
  1017
fun string_of_preds preds = 
paulson@17234
  1018
  "predicates[" ^ (concat_with ", " (map string_of_arity preds)) ^ "].\n";
quigley@17150
  1019
paulson@17234
  1020
fun string_of_funcs funcs =
paulson@17234
  1021
  "functions[" ^ (concat_with ", " (map string_of_arity funcs)) ^ "].\n" ;
quigley@17150
  1022
quigley@17150
  1023
paulson@17234
  1024
fun string_of_symbols predstr funcstr = 
paulson@17234
  1025
  "list_of_symbols.\n" ^ predstr  ^ funcstr  ^ "end_of_list.\n\n";
quigley@17150
  1026
quigley@17150
  1027
paulson@17234
  1028
fun string_of_axioms axstr = 
paulson@17234
  1029
  "list_of_clauses(axioms,cnf).\n" ^ axstr ^ "end_of_list.\n\n";
quigley@17150
  1030
quigley@17150
  1031
paulson@17234
  1032
fun string_of_conjectures conjstr = 
paulson@17234
  1033
  "list_of_clauses(conjectures,cnf).\n" ^ conjstr ^ "end_of_list.\n\n";
quigley@17150
  1034
paulson@17234
  1035
fun string_of_descrip () = 
paulson@17234
  1036
  "list_of_descriptions.\nname({*[ File     : ],[ Names    :]*}).\nauthor({*[ Source   :]*}).\nstatus(unknown).\ndescription({*[ Refs     :]*}).\nend_of_list.\n\n"
quigley@17150
  1037
quigley@17150
  1038
quigley@17150
  1039
fun string_of_start name = "%------------------------------------------------------------------------------\nbegin_problem(" ^ name ^ ").\n\n";
quigley@17150
  1040
quigley@17150
  1041
quigley@17150
  1042
fun string_of_end () = "end_problem.\n%------------------------------------------------------------------------------";
quigley@17150
  1043
quigley@17150
  1044
quigley@17150
  1045
fun clause2dfg cls =
paulson@17234
  1046
    let val (lits,tfree_lits) = dfg_clause_aux cls 
paulson@17234
  1047
            (*"lits" includes the typing assumptions (TVars)*)
paulson@17317
  1048
	val cls_id = get_clause_id cls
paulson@17317
  1049
	val ax_name = get_axiomName cls
quigley@17150
  1050
        val vars = dfg_vars cls
quigley@17150
  1051
        val tvars = dfg_tvars cls
quigley@17150
  1052
        val funcs = funcs_of_cls cls
quigley@17150
  1053
        val preds = preds_of_cls cls
quigley@17150
  1054
	val knd = string_of_kind cls
paulson@17234
  1055
	val lits_str = commas lits
quigley@17150
  1056
	val cls_str = gen_dfg_cls(cls_id,ax_name,knd,lits_str,tvars,vars) 
quigley@17150
  1057
    in
quigley@17150
  1058
	(cls_str,tfree_lits) 
quigley@17150
  1059
    end;
quigley@17150
  1060
quigley@17150
  1061
quigley@17150
  1062
paulson@17234
  1063
fun tfree_dfg_clause tfree_lit =
paulson@17422
  1064
  "clause( %(conjecture)\n" ^ "or( " ^ tfree_lit ^ "),\n" ^ "tfree_tcs" ^ ")."
quigley@17150
  1065
quigley@17150
  1066
paulson@17422
  1067
fun gen_dfg_file probname axioms conjectures funcs preds = 
paulson@17230
  1068
    let val axstrs_tfrees = (map clause2dfg axioms)
quigley@17150
  1069
	val (axstrs, atfrees) = ListPair.unzip axstrs_tfrees
paulson@17764
  1070
        val axstr = (space_implode "\n" axstrs) ^ "\n\n"
paulson@17230
  1071
        val conjstrs_tfrees = (map clause2dfg conjectures)
quigley@17150
  1072
	val (conjstrs, atfrees) = ListPair.unzip conjstrs_tfrees
paulson@17775
  1073
        val tfree_clss = map tfree_dfg_clause (union_all atfrees) 
paulson@17764
  1074
        val conjstr = (space_implode "\n" (tfree_clss@conjstrs)) ^ "\n\n"
quigley@17150
  1075
        val funcstr = string_of_funcs funcs
quigley@17150
  1076
        val predstr = string_of_preds preds
quigley@17150
  1077
    in
paulson@17230
  1078
       (string_of_start probname) ^ (string_of_descrip ()) ^ 
paulson@17764
  1079
       (string_of_symbols funcstr predstr) ^  
paulson@17230
  1080
       (string_of_axioms axstr) ^
paulson@17230
  1081
       (string_of_conjectures conjstr) ^ (string_of_end ())
quigley@17150
  1082
    end;
quigley@17150
  1083
   
paulson@17422
  1084
fun clauses2dfg [] probname axioms conjectures funcs preds = 
paulson@17775
  1085
      let val funcs' = (union_all(map funcs_of_cls axioms)) @ funcs
paulson@17775
  1086
	  val preds' = (union_all(map preds_of_cls axioms)) @ preds
paulson@17230
  1087
      in
paulson@17422
  1088
	 gen_dfg_file probname axioms conjectures funcs' preds' 
paulson@17230
  1089
      end
paulson@17422
  1090
 | clauses2dfg (cls::clss) probname axioms conjectures funcs preds = 
paulson@17230
  1091
     let val (lits,tfree_lits) = dfg_clause_aux cls
paulson@17230
  1092
	       (*"lits" includes the typing assumptions (TVars)*)
paulson@17317
  1093
	 val cls_id = get_clause_id cls
paulson@17317
  1094
	 val ax_name = get_axiomName cls
paulson@17230
  1095
	 val vars = dfg_vars cls
paulson@17230
  1096
	 val tvars = dfg_tvars cls
paulson@17888
  1097
	 val funcs' = (funcs_of_cls cls) union funcs
paulson@17888
  1098
	 val preds' = (preds_of_cls cls) union preds
paulson@17230
  1099
	 val knd = string_of_kind cls
paulson@17230
  1100
	 val lits_str = concat_with ", " lits
paulson@17230
  1101
	 val axioms' = if knd = "axiom" then (cls::axioms) else axioms
paulson@17230
  1102
	 val conjectures' = 
paulson@17230
  1103
	     if knd = "conjecture" then (cls::conjectures) else conjectures
paulson@17230
  1104
     in
paulson@17422
  1105
	 clauses2dfg clss probname axioms' conjectures' funcs' preds' 
paulson@17230
  1106
     end;
quigley@17150
  1107
quigley@17150
  1108
paulson@17845
  1109
fun string_of_arClauseID (ArityClause {clause_id,axiom_name,...}) =
paulson@17845
  1110
    arclause_prefix ^ ascii_of axiom_name ^ "_" ^ Int.toString clause_id;
quigley@17150
  1111
quigley@17150
  1112
fun string_of_arKind (ArityClause arcls) = name_of_kind(#kind arcls);
quigley@17150
  1113
paulson@17525
  1114
(*FIXME!!! currently is TPTP format!*)
paulson@17525
  1115
fun dfg_of_arLit (TConsLit(b,(c,t,args))) =
paulson@17525
  1116
      let val pol = if b then "++" else "--"
paulson@18218
  1117
	  val arg_strs = paren_pack args
paulson@17525
  1118
      in 
paulson@17525
  1119
	  pol ^ c ^ "(" ^ t ^ arg_strs ^ ")"
paulson@17525
  1120
      end
paulson@17525
  1121
  | dfg_of_arLit (TVarLit(b,(c,str))) =
paulson@17525
  1122
      let val pol = if b then "++" else "--"
paulson@17525
  1123
      in
paulson@17525
  1124
	  pol ^ c ^ "(" ^ str ^ ")"
paulson@17525
  1125
      end;
paulson@17525
  1126
    
paulson@17525
  1127
paulson@17525
  1128
fun dfg_of_conclLit (ArityClause arcls) = dfg_of_arLit (#conclLit arcls);
paulson@17525
  1129
     
paulson@17525
  1130
paulson@17525
  1131
fun dfg_of_premLits (ArityClause arcls) = map dfg_of_arLit (#premLits arcls);
paulson@17525
  1132
		
paulson@17525
  1133
paulson@17525
  1134
paulson@17525
  1135
(*FIXME: would this have variables in a forall? *)
quigley@17150
  1136
quigley@17150
  1137
fun dfg_arity_clause arcls = 
paulson@17525
  1138
  let val arcls_id = string_of_arClauseID arcls
paulson@17525
  1139
      val concl_lit = dfg_of_conclLit arcls
paulson@17525
  1140
      val prems_lits = dfg_of_premLits arcls
paulson@17525
  1141
      val knd = string_of_arKind arcls
paulson@17525
  1142
      val all_lits = concl_lit :: prems_lits
paulson@17525
  1143
  in
paulson@17525
  1144
      "clause( %(" ^ knd ^ ")\n" ^  "or( " ^ (bracket_pack all_lits) ^ ")),\n" ^
paulson@17525
  1145
       arcls_id ^  ")."
paulson@17525
  1146
  end;
quigley@17150
  1147
quigley@17150
  1148
quigley@17150
  1149
(********************************)
quigley@17150
  1150
(* code to produce TPTP files   *)
quigley@17150
  1151
(********************************)
quigley@17150
  1152
paulson@15347
  1153
fun tptp_literal (Literal(pol,pred,tag)) =
paulson@15347
  1154
    let val pred_string = string_of_predicate pred
paulson@17230
  1155
	val tagged_pol = 
paulson@17230
  1156
	      if (tag andalso !tagged) then (if pol then "+++" else "---")
paulson@17230
  1157
	      else (if pol then "++" else "--")
paulson@15347
  1158
     in
paulson@15347
  1159
	tagged_pol ^ pred_string
paulson@15347
  1160
    end;
paulson@15347
  1161
paulson@15347
  1162
fun tptp_of_typeLit (LTVar x) = "--" ^ x
paulson@15347
  1163
  | tptp_of_typeLit (LTFree x) = "++" ^ x;
paulson@15347
  1164
 
paulson@15347
  1165
paulson@15347
  1166
fun gen_tptp_cls (cls_id,ax_name,knd,lits) = 
paulson@17317
  1167
    "input_clause(" ^ string_of_clausename (cls_id,ax_name) ^ "," ^ 
paulson@17317
  1168
    knd ^ "," ^ lits ^ ").";
paulson@15347
  1169
paulson@17317
  1170
fun gen_tptp_type_cls (cls_id,ax_name,knd,tfree_lit,idx) = 
paulson@17317
  1171
    "input_clause(" ^ string_of_type_clsname (cls_id,ax_name,idx) ^ "," ^ 
paulson@17230
  1172
    knd ^ ",[" ^ tfree_lit ^ "]).";
paulson@15347
  1173
paulson@17422
  1174
fun tptp_type_lits (Clause cls) = 
paulson@15347
  1175
    let val lits = map tptp_literal (#literals cls)
paulson@17230
  1176
	val tvar_lits_strs =
paulson@17230
  1177
	      if !keep_types 
paulson@17230
  1178
	      then (map tptp_of_typeLit (#tvar_type_literals cls)) 
paulson@17230
  1179
	      else []
paulson@17230
  1180
	val tfree_lits = 
paulson@17230
  1181
	      if !keep_types
paulson@17230
  1182
	      then (map tptp_of_typeLit (#tfree_type_literals cls)) 
paulson@17230
  1183
	      else []
paulson@15347
  1184
    in
paulson@17305
  1185
	(tvar_lits_strs @ lits, tfree_lits)
paulson@15347
  1186
    end; 
paulson@15347
  1187
paulson@15347
  1188
fun tptp_clause cls =
paulson@17422
  1189
    let val (lits,tfree_lits) = tptp_type_lits cls 
paulson@17305
  1190
            (*"lits" includes the typing assumptions (TVars)*)
paulson@17317
  1191
	val cls_id = get_clause_id cls
paulson@17317
  1192
	val ax_name = get_axiomName cls
paulson@15347
  1193
	val knd = string_of_kind cls
paulson@17525
  1194
	val lits_str = bracket_pack lits
paulson@17305
  1195
	val cls_str = gen_tptp_cls(cls_id,ax_name,knd,lits_str) 			 
paulson@17305
  1196
	fun typ_clss k [] = []
paulson@15347
  1197
          | typ_clss k (tfree :: tfrees) = 
paulson@17317
  1198
              gen_tptp_type_cls(cls_id,ax_name,knd,tfree,k) :: 
paulson@17317
  1199
              typ_clss (k+1) tfrees
paulson@15347
  1200
    in 
paulson@15347
  1201
	cls_str :: (typ_clss 0 tfree_lits)
paulson@15347
  1202
    end;
paulson@15347
  1203
paulson@15608
  1204
fun clause2tptp cls =
paulson@17422
  1205
    let val (lits,tfree_lits) = tptp_type_lits cls 
paulson@17305
  1206
            (*"lits" includes the typing assumptions (TVars)*)
paulson@17317
  1207
	val cls_id = get_clause_id cls
paulson@17317
  1208
	val ax_name = get_axiomName cls
paulson@15608
  1209
	val knd = string_of_kind cls
paulson@17525
  1210
	val lits_str = bracket_pack lits
paulson@15608
  1211
	val cls_str = gen_tptp_cls(cls_id,ax_name,knd,lits_str) 
paulson@15608
  1212
    in
paulson@15608
  1213
	(cls_str,tfree_lits) 
paulson@15608
  1214
    end;
paulson@15608
  1215
paulson@15608
  1216
paulson@17230
  1217
fun tfree_clause tfree_lit =
paulson@17230
  1218
    "input_clause(" ^ "tfree_tcs," ^ "conjecture" ^ ",[" ^ tfree_lit ^ "]).";
paulson@15608
  1219
paulson@15347
  1220
paulson@17525
  1221
fun tptp_of_arLit (TConsLit(b,(c,t,args))) =
paulson@17525
  1222
      let val pol = if b then "++" else "--"
paulson@18218
  1223
	  val  arg_strs = paren_pack args
paulson@17525
  1224
      in 
paulson@17525
  1225
	  pol ^ c ^ "(" ^ t ^ arg_strs ^ ")"
paulson@17525
  1226
      end
paulson@17525
  1227
  | tptp_of_arLit (TVarLit(b,(c,str))) =
paulson@17525
  1228
      let val pol = if b then "++" else "--"
paulson@17525
  1229
      in
paulson@17525
  1230
	  pol ^ c ^ "(" ^ str ^ ")"
paulson@17525
  1231
      end;
paulson@15347
  1232
    
paulson@15347
  1233
paulson@17525
  1234
fun tptp_of_conclLit (ArityClause arcls) = tptp_of_arLit (#conclLit arcls);
paulson@15347
  1235
     
paulson@17525
  1236
fun tptp_of_premLits (ArityClause arcls) = map tptp_of_arLit (#premLits arcls);
paulson@15347
  1237
		
paulson@15347
  1238
fun tptp_arity_clause arcls = 
paulson@15347
  1239
    let val arcls_id = string_of_arClauseID arcls
paulson@17525
  1240
	val concl_lit = tptp_of_conclLit arcls
paulson@17525
  1241
	val prems_lits = tptp_of_premLits arcls
paulson@15347
  1242
	val knd = string_of_arKind arcls
paulson@15347
  1243
	val all_lits = concl_lit :: prems_lits
paulson@15347
  1244
    in
paulson@17317
  1245
	"input_clause(" ^ arcls_id ^ "," ^ knd ^ "," ^ 
paulson@17525
  1246
	(bracket_pack all_lits) ^ ")."
paulson@15347
  1247
    end;
paulson@15347
  1248
paulson@15347
  1249
fun tptp_classrelLits sub sup = 
paulson@15347
  1250
    let val tvar = "(T)"
paulson@15347
  1251
    in 
skalberg@15531
  1252
	case sup of NONE => "[++" ^ sub ^ tvar ^ "]"
skalberg@15531
  1253
		  | (SOME supcls) =>  "[--" ^ sub ^ tvar ^ ",++" ^ supcls ^ tvar ^ "]"
paulson@15347
  1254
    end;
paulson@15347
  1255
paulson@15347
  1256
paulson@17845
  1257
fun tptp_classrelClause (ClassrelClause {clause_id,subclass,superclass,...}) =
paulson@17845
  1258
    let val relcls_id = clrelclause_prefix ^ ascii_of subclass ^ "_" ^ 
paulson@17845
  1259
                        Int.toString clause_id
paulson@17845
  1260
	val lits = tptp_classrelLits (make_type_class subclass) 
paulson@17845
  1261
	                (Option.map make_type_class superclass)
paulson@15347
  1262
    in
paulson@15347
  1263
	"input_clause(" ^ relcls_id ^ ",axiom," ^ lits ^ ")."
paulson@15347
  1264
    end; 
quigley@17150
  1265
paulson@15347
  1266
end;