src/HOL/Tools/res_clause.ML
author paulson
Tue Mar 15 17:07:41 2005 +0100 (2005-03-15)
changeset 15610 f855fd163b62
parent 15608 f161fa6f8fd5
child 15615 d72b1867d09d
permissions -rw-r--r--
more concise ASCII escaping
paulson@15347
     1
(*  Author: Jia Meng, Cambridge University Computer Laboratory
paulson@15347
     2
    ID: $Id$
paulson@15347
     3
    Copyright 2004 University of Cambridge
paulson@15347
     4
paulson@15347
     5
ML data structure for storing/printing FOL clauses and arity clauses.
paulson@15347
     6
Typed equality is treated differently.
paulson@15347
     7
*)
paulson@15347
     8
paulson@15347
     9
signature RES_CLAUSE =
paulson@15347
    10
  sig
paulson@15347
    11
    exception ARCLAUSE of string
paulson@15347
    12
    exception CLAUSE of string
paulson@15347
    13
    type arityClause 
paulson@15347
    14
    type classrelClause
paulson@15347
    15
    val classrelClauses_of :
paulson@15347
    16
       string * string list -> classrelClause list
paulson@15347
    17
    type clause
paulson@15347
    18
    val keep_types : bool ref
paulson@15347
    19
    val make_axiom_arity_clause :
paulson@15347
    20
       string * (string * string list list) -> arityClause
paulson@15347
    21
    val make_axiom_classrelClause :
skalberg@15531
    22
       string * string option -> classrelClause
paulson@15347
    23
    val make_axiom_clause : Term.term -> string * int -> clause
paulson@15347
    24
    val make_axiom_clause_thm : Thm.thm -> string * int -> clause
paulson@15347
    25
    val make_conjecture_clause : Term.term -> clause
paulson@15347
    26
    val make_conjecture_clause_thm : Thm.thm -> clause
paulson@15347
    27
    val make_hypothesis_clause : Term.term -> clause
paulson@15347
    28
    val make_hypothesis_clause_thm : Thm.thm -> clause
paulson@15347
    29
    val special_equal : bool ref
paulson@15347
    30
    val tptp_arity_clause : arityClause -> string
paulson@15347
    31
    val tptp_classrelClause : classrelClause -> string
paulson@15347
    32
    val tptp_clause : clause -> string list
paulson@15347
    33
    val tptp_clauses2str : string list -> string
paulson@15347
    34
    val typed : unit -> unit
paulson@15347
    35
    val untyped : unit -> unit
paulson@15608
    36
    val clause2tptp : clause -> string * string list
paulson@15608
    37
    val tfree_clause : string -> string
paulson@15347
    38
  end;
paulson@15347
    39
paulson@15347
    40
structure ResClause : RES_CLAUSE =
paulson@15347
    41
struct
paulson@15347
    42
paulson@15347
    43
(* Added for typed equality *)
paulson@15347
    44
val special_equal = ref false; (* by default,equality does not carry type information *)
paulson@15347
    45
val eq_typ_wrapper = "typeinfo"; (* default string *)
paulson@15347
    46
paulson@15347
    47
paulson@15347
    48
val schematic_var_prefix = "V_";
paulson@15347
    49
val fixed_var_prefix = "v_";
paulson@15347
    50
paulson@15347
    51
paulson@15347
    52
val tvar_prefix = "Typ_";
paulson@15347
    53
val tfree_prefix = "typ_";
paulson@15347
    54
paulson@15347
    55
paulson@15347
    56
val clause_prefix = "cls_"; 
paulson@15347
    57
paulson@15347
    58
val arclause_prefix = "arcls_" 
paulson@15347
    59
paulson@15347
    60
val const_prefix = "const_";
paulson@15347
    61
val tconst_prefix = "tconst_"; 
paulson@15347
    62
paulson@15347
    63
val class_prefix = "clas_"; 
paulson@15347
    64
paulson@15347
    65
paulson@15347
    66
paulson@15347
    67
(**** some useful functions ****)
paulson@15347
    68
 
paulson@15347
    69
val const_trans_table =
paulson@15347
    70
      Symtab.make [("op =", "equal"),
paulson@15347
    71
	  	   ("op <=", "lessequals"),
paulson@15347
    72
		   ("op <", "less"),
paulson@15347
    73
		   ("op &", "and"),
paulson@15347
    74
		   ("op |", "or"),
paulson@15347
    75
		   ("op -->", "implies"),
paulson@15347
    76
		   ("op :", "in"),
paulson@15347
    77
		   ("op Un", "union"),
paulson@15347
    78
		   ("op Int", "inter")];
paulson@15347
    79
paulson@15347
    80
paulson@15347
    81
paulson@15610
    82
(*Escaping of special characters.
paulson@15610
    83
  Alphanumeric characters are left unchanged.
paulson@15610
    84
  The character _ goes to __
paulson@15610
    85
  Characters in the range ASCII space to / go to _A to _P, respectively.
paulson@15610
    86
  Other printing characters go to _NNN where NNN is the decimal ASCII code.*)
paulson@15610
    87
local
paulson@15610
    88
paulson@15610
    89
val A_minus_space = Char.ord #"A" - Char.ord #" ";
paulson@15610
    90
paulson@15347
    91
fun ascii_of_c c =
paulson@15610
    92
  if Char.isAlphaNum c then String.str c
paulson@15610
    93
  else if c = #"_" then "__"
paulson@15610
    94
  else if #" " <= c andalso c <= #"/" 
paulson@15610
    95
       then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space))
paulson@15610
    96
  else if Char.isPrint c then ("_" ^ Int.toString (Char.ord c))
paulson@15610
    97
  else ""
paulson@15347
    98
paulson@15610
    99
in
paulson@15610
   100
paulson@15610
   101
val ascii_of = String.translate ascii_of_c;
paulson@15610
   102
paulson@15610
   103
end;
paulson@15347
   104
paulson@15347
   105
paulson@15347
   106
(* another version of above functions that remove chars that may not be allowed by Vampire *)
paulson@15347
   107
fun make_schematic_var v = schematic_var_prefix ^ (ascii_of v);
paulson@15347
   108
fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x);
paulson@15347
   109
paulson@15347
   110
fun make_schematic_type_var v = tvar_prefix ^ (ascii_of v);
paulson@15347
   111
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of x);
paulson@15347
   112
paulson@15347
   113
fun make_fixed_const c = const_prefix ^ (ascii_of c);
paulson@15347
   114
fun make_fixed_type_const c = tconst_prefix ^ (ascii_of c);
paulson@15347
   115
paulson@15347
   116
fun make_type_class clas = class_prefix ^ (ascii_of clas);
paulson@15347
   117
paulson@15347
   118
paulson@15347
   119
paulson@15347
   120
paulson@15347
   121
fun lookup_const c =
paulson@15347
   122
    case Symtab.lookup (const_trans_table,c) of
skalberg@15531
   123
        SOME c' => c'
skalberg@15531
   124
      | NONE =>  make_fixed_const c;
paulson@15347
   125
paulson@15347
   126
paulson@15347
   127
paulson@15347
   128
(***** definitions and functions for FOL clauses, prepared for conversion into TPTP format or SPASS format. *****)
paulson@15347
   129
paulson@15347
   130
val keep_types = ref true; (* default is true *)
paulson@15347
   131
fun untyped () = (keep_types := false);
paulson@15347
   132
fun typed () = (keep_types := true);
paulson@15347
   133
paulson@15347
   134
paulson@15347
   135
datatype kind = Axiom | Hypothesis | Conjecture;
paulson@15347
   136
fun name_of_kind Axiom = "axiom"
paulson@15347
   137
  | name_of_kind Hypothesis = "hypothesis"
paulson@15347
   138
  | name_of_kind Conjecture = "conjecture";
paulson@15347
   139
paulson@15347
   140
type clause_id = int;
paulson@15347
   141
type axiom_name = string;
paulson@15347
   142
paulson@15347
   143
paulson@15347
   144
type polarity = bool;
paulson@15347
   145
paulson@15347
   146
type indexname = Term.indexname;
paulson@15347
   147
paulson@15347
   148
paulson@15347
   149
(* "tag" is used for vampire specific syntax  *)
paulson@15347
   150
type tag = bool; 
paulson@15347
   151
paulson@15347
   152
paulson@15347
   153
paulson@15347
   154
fun string_of_indexname (name,index) = name ^ "_" ^ (string_of_int index);
paulson@15347
   155
paulson@15347
   156
paulson@15347
   157
val id_ref = ref 0;
paulson@15347
   158
fun generate_id () = 
paulson@15347
   159
     let val id = !id_ref
paulson@15347
   160
     in
paulson@15347
   161
	 (id_ref:=id + 1; id)
paulson@15347
   162
     end;
paulson@15347
   163
paulson@15347
   164
paulson@15347
   165
paulson@15347
   166
(**** Isabelle FOL clauses ****)
paulson@15347
   167
paulson@15347
   168
(* by default it is false *)
paulson@15347
   169
val tagged = ref false;
paulson@15347
   170
paulson@15347
   171
type pred_name = string;
paulson@15347
   172
type sort = Term.sort;
paulson@15347
   173
type fol_type = string;
paulson@15347
   174
paulson@15347
   175
paulson@15347
   176
datatype type_literal = LTVar of string | LTFree of string;
paulson@15347
   177
paulson@15347
   178
paulson@15347
   179
datatype folTerm = UVar of string * fol_type| Fun of string * fol_type * folTerm list;
paulson@15347
   180
datatype predicate = Predicate of pred_name * fol_type * folTerm list;
paulson@15347
   181
paulson@15347
   182
paulson@15347
   183
datatype literal = Literal of polarity * predicate * tag;
paulson@15347
   184
paulson@15347
   185
paulson@15347
   186
datatype typ_var = FOLTVar of indexname | FOLTFree of string;
paulson@15347
   187
paulson@15347
   188
paulson@15347
   189
(* ML datatype used to repsent one single clause: disjunction of literals. *)
paulson@15347
   190
datatype clause = 
paulson@15347
   191
	 Clause of {clause_id: clause_id,
paulson@15347
   192
		    axiom_name: axiom_name,
paulson@15347
   193
		    kind: kind,
paulson@15347
   194
		    literals: literal list,
paulson@15347
   195
		    types_sorts: (typ_var * sort) list, 
paulson@15347
   196
                    tvar_type_literals: type_literal list, 
paulson@15347
   197
                    tfree_type_literals: type_literal list };
paulson@15347
   198
paulson@15347
   199
paulson@15347
   200
exception CLAUSE of string;
paulson@15347
   201
paulson@15347
   202
paulson@15347
   203
paulson@15347
   204
(*** make clauses ***)
paulson@15347
   205
paulson@15347
   206
paulson@15347
   207
fun make_clause (clause_id,axiom_name,kind,literals,types_sorts,tvar_type_literals,tfree_type_literals) =
paulson@15347
   208
     Clause {clause_id = clause_id, axiom_name = axiom_name, kind = kind, literals = literals, types_sorts = types_sorts,tvar_type_literals = tvar_type_literals,tfree_type_literals = tfree_type_literals};
paulson@15347
   209
paulson@15347
   210
paulson@15347
   211
paulson@15347
   212
fun type_of (Type (a, [])) = (make_fixed_type_const a,[]) 
paulson@15347
   213
  | type_of (Type (a, Ts)) = 
paulson@15347
   214
    let val foltyps_ts = map type_of Ts
paulson@15347
   215
        val (folTyps,ts) = ResLib.unzip foltyps_ts
paulson@15347
   216
        val ts' = ResLib.flat_noDup ts
paulson@15347
   217
    in    
paulson@15347
   218
        (((make_fixed_type_const a) ^ (ResLib.list_to_string folTyps)),ts') 
paulson@15347
   219
    end
paulson@15347
   220
  | type_of (TFree (a, s)) = (make_fixed_type_var a, [((FOLTFree a),s)])
paulson@15347
   221
  | type_of (TVar (v, s))  = (make_schematic_type_var (string_of_indexname v), [((FOLTVar v),s)]);
paulson@15390
   222
paulson@15390
   223
(* added: checkMeta: string -> bool *)
paulson@15390
   224
(* Any meta vars like ?x should be treated as universal vars,although it is represented as "Free(...)" by Isabelle *)
paulson@15390
   225
fun checkMeta s =
paulson@15390
   226
    let val chars = explode s
paulson@15390
   227
    in
paulson@15390
   228
	["M", "E", "T", "A", "H", "Y", "P", "1"] prefix chars
paulson@15390
   229
    end;
paulson@15390
   230
paulson@15347
   231
    
paulson@15347
   232
fun pred_name_type (Const(c,T)) = (lookup_const c,type_of T)
paulson@15390
   233
  | pred_name_type (Free(x,T))  = 
paulson@15390
   234
    let val is_meta = checkMeta x
paulson@15390
   235
    in
paulson@15390
   236
	if is_meta then (raise CLAUSE("Predicate Not First Order")) else
paulson@15390
   237
	(make_fixed_var x,type_of T)
paulson@15390
   238
    end
paulson@15347
   239
  | pred_name_type (Var(_,_))   = raise CLAUSE("Predicate Not First Order")
paulson@15347
   240
  | pred_name_type _          = raise CLAUSE("Predicate input unexpected");
paulson@15347
   241
paulson@15347
   242
fun fun_name_type (Const(c,T)) = (lookup_const c,type_of T)
paulson@15347
   243
  | fun_name_type (Free(x,T)) = (make_fixed_var x,type_of T)
paulson@15347
   244
  | fun_name_type _ = raise CLAUSE("Function Not First Order");
paulson@15347
   245
    
paulson@15347
   246
paulson@15347
   247
fun term_of (Var(ind_nm,T)) = 
paulson@15347
   248
    let val (folType,ts) = type_of T
paulson@15347
   249
    in
paulson@15347
   250
	(UVar(make_schematic_var(string_of_indexname ind_nm),folType),ts)
paulson@15347
   251
    end
paulson@15347
   252
  | term_of (Free(x,T)) = 
paulson@15390
   253
    let val is_meta = checkMeta x
paulson@15390
   254
	val (folType,ts) = type_of T
paulson@15347
   255
    in
paulson@15390
   256
	if is_meta then (UVar(make_schematic_var x,folType),ts)
paulson@15390
   257
	else
paulson@15390
   258
            (Fun(make_fixed_var x,folType,[]),ts)
paulson@15347
   259
    end
paulson@15347
   260
  | term_of (Const(c,T)) = 
paulson@15347
   261
    let val (folType,ts) = type_of T
paulson@15347
   262
     in
paulson@15347
   263
        (Fun(lookup_const c,folType,[]),ts)
paulson@15347
   264
    end    
paulson@15347
   265
  | term_of (app as (t $ a)) = 
paulson@15347
   266
    let val (f,args) = strip_comb app
paulson@15347
   267
        fun term_of_aux () = 
paulson@15347
   268
            let val (funName,(funType,ts1)) = fun_name_type f
paulson@15347
   269
                 val (args',ts2) = ResLib.unzip (map term_of args)
paulson@15347
   270
                 val ts3 = ResLib.flat_noDup (ts1::ts2)
paulson@15347
   271
            in
paulson@15347
   272
		(Fun(funName,funType,args'),ts3)
paulson@15347
   273
            end
paulson@15347
   274
    in
paulson@15347
   275
        case f of Const(_,_) => term_of_aux ()
paulson@15390
   276
                | Free(s,_)  => if (checkMeta s) then (raise CLAUSE("Function Not First Order")) else term_of_aux ()
paulson@15347
   277
                | _          => raise CLAUSE("Function Not First Order")
paulson@15347
   278
    end
paulson@15390
   279
  | term_of _ = raise CLAUSE("Function Not First Order"); 
paulson@15390
   280
paulson@15347
   281
paulson@15347
   282
paulson@15347
   283
paulson@15347
   284
(* For type equality *)
paulson@15347
   285
(* here "arg_typ" is the type of "="'s argument's type, not the type of the equality *)
paulson@15347
   286
(* Find type of equality arg *)
paulson@15347
   287
local
paulson@15347
   288
paulson@15347
   289
fun eq_arg_type (Type("fun",[T,_])) = 
paulson@15347
   290
    let val (folT,_) = type_of T;
paulson@15347
   291
    in
paulson@15347
   292
	folT
paulson@15347
   293
    end;
paulson@15347
   294
paulson@15347
   295
in
paulson@15347
   296
paulson@15347
   297
fun pred_of_eq ((Const ("op =", typ)),args) =
paulson@15347
   298
    let val arg_typ = eq_arg_type typ 
paulson@15347
   299
	val (args',ts) = ResLib.unzip (map term_of args)
paulson@15347
   300
	val equal_name = lookup_const "op ="
paulson@15347
   301
    in
paulson@15347
   302
	(Predicate(equal_name,arg_typ,args'),ResLib.flat_noDup ts)
paulson@15347
   303
    end;
paulson@15347
   304
paulson@15347
   305
end;
paulson@15347
   306
paulson@15347
   307
(* changed for non-equality predicate *)
paulson@15347
   308
(* The input "pred" cannot be an equality *)
paulson@15347
   309
fun pred_of_nonEq (pred,args) = 
paulson@15347
   310
    let val (predName,(predType,ts1)) = pred_name_type pred
paulson@15347
   311
	val (args',ts2) = ResLib.unzip (map term_of args)
paulson@15347
   312
	val ts3 = ResLib.flat_noDup (ts1::ts2)
paulson@15347
   313
    in
paulson@15347
   314
	(Predicate(predName,predType,args'),ts3)
paulson@15347
   315
    end;
paulson@15347
   316
paulson@15347
   317
paulson@15347
   318
(* Changed for typed equality *)
paulson@15347
   319
(* First check if the predicate is an equality or not, then call different functions for equality and non-equalities *)
paulson@15347
   320
fun predicate_of term =
paulson@15347
   321
    let val (pred,args) = strip_comb term
paulson@15347
   322
    in
paulson@15347
   323
	case pred of (Const ("op =", _)) => pred_of_eq (pred,args)
paulson@15347
   324
		   | _ => pred_of_nonEq (pred,args)
paulson@15347
   325
    end;
paulson@15347
   326
paulson@15347
   327
paulson@15347
   328
 
paulson@15347
   329
fun literals_of_term ((Const("Trueprop",_) $ P),lits_ts) = literals_of_term(P,lits_ts)
paulson@15347
   330
  | literals_of_term ((Const("op |",_) $ P $ Q),(lits,ts)) = 
paulson@15347
   331
    let val (lits',ts') = literals_of_term(P,(lits,ts))
paulson@15347
   332
    in
paulson@15347
   333
        literals_of_term(Q,(lits',ts'))
paulson@15347
   334
    end
paulson@15347
   335
  | literals_of_term ((Const("Not",_) $ P),(lits,ts)) = 
paulson@15347
   336
    let val (pred,ts') = predicate_of P
paulson@15347
   337
        val lits' = Literal(false,pred,false) :: lits
paulson@15347
   338
        val ts'' = ResLib.no_rep_app ts ts'
paulson@15347
   339
    in
paulson@15347
   340
        (lits',ts'')
paulson@15347
   341
    end
paulson@15347
   342
  | literals_of_term (P,(lits,ts)) = 
paulson@15347
   343
    let val (pred,ts') = predicate_of P
paulson@15347
   344
        val lits' = Literal(true,pred,false) :: lits
paulson@15347
   345
        val ts'' = ResLib.no_rep_app ts ts' 
paulson@15347
   346
    in
paulson@15347
   347
        (lits',ts'')
paulson@15347
   348
    end
paulson@15347
   349
  | literals_of_term _ = raise CLAUSE("Unexpected clause format");
paulson@15347
   350
     
paulson@15347
   351
paulson@15347
   352
fun literals_of_thm thm = 
paulson@15347
   353
    let val term_of_thm = prop_of thm
paulson@15347
   354
			  
paulson@15347
   355
    in
paulson@15347
   356
	literals_of_term (term_of_thm,([],[]))
paulson@15347
   357
    end;
paulson@15347
   358
    
paulson@15347
   359
 
paulson@15347
   360
fun sorts_on_typs (_, []) = []
paulson@15347
   361
  | sorts_on_typs ((FOLTVar(indx)), [s]) = [LTVar((make_type_class s) ^ "(" ^ (make_schematic_type_var(string_of_indexname indx)) ^ ")")]
paulson@15347
   362
  | sorts_on_typs ((FOLTVar(indx)), (s::ss))=  LTVar((make_type_class s) ^ "(" ^ (make_schematic_type_var(string_of_indexname indx)) ^ ")") :: (sorts_on_typs ((FOLTVar(indx)), ss))
paulson@15347
   363
  | sorts_on_typs ((FOLTFree(x)), [s]) = [LTFree((make_type_class s) ^ "(" ^ (make_fixed_type_var(x)) ^ ")")]
paulson@15347
   364
  | sorts_on_typs ((FOLTFree(x)), (s::ss)) = LTFree((make_type_class s) ^ "(" ^ (make_fixed_type_var(x)) ^ ")") :: (sorts_on_typs ((FOLTFree(x)), ss));
paulson@15347
   365
paulson@15347
   366
paulson@15347
   367
fun add_typs_aux [] = ([],[])
paulson@15347
   368
  | add_typs_aux ((FOLTVar(indx),s)::tss) = 
paulson@15347
   369
    let val vs = sorts_on_typs (FOLTVar(indx),s)
paulson@15347
   370
        val (vss,fss) = add_typs_aux tss
paulson@15347
   371
    in
paulson@15347
   372
        (ResLib.no_rep_app vs vss,fss)
paulson@15347
   373
    end
paulson@15347
   374
  | add_typs_aux ((FOLTFree(x),s)::tss) =
paulson@15347
   375
    let val fs = sorts_on_typs (FOLTFree(x),s)
paulson@15347
   376
        val (vss,fss) = add_typs_aux tss
paulson@15347
   377
    in
paulson@15347
   378
        (vss,ResLib.no_rep_app fs fss)
paulson@15347
   379
    end;
paulson@15347
   380
paulson@15347
   381
paulson@15347
   382
fun add_typs (Clause cls) = 
paulson@15347
   383
    let val ts = #types_sorts cls
paulson@15347
   384
    in
paulson@15347
   385
	add_typs_aux ts
paulson@15347
   386
    end;    
paulson@15347
   387
paulson@15347
   388
paulson@15347
   389
paulson@15347
   390
paulson@15347
   391
(** make axiom clauses, hypothesis clauses and conjecture clauses. **)
paulson@15347
   392
paulson@15347
   393
local 
paulson@15347
   394
    fun replace_dot "." = "_"
paulson@15347
   395
      | replace_dot c = c;
paulson@15347
   396
paulson@15347
   397
in
paulson@15347
   398
paulson@15347
   399
fun proper_ax_name ax_name = 
paulson@15347
   400
    let val chars = explode ax_name
paulson@15347
   401
    in
paulson@15347
   402
	implode (map replace_dot chars)
paulson@15347
   403
    end;
paulson@15347
   404
end;
paulson@15347
   405
paulson@15347
   406
fun make_axiom_clause_thm thm (name,number)=
paulson@15347
   407
    let val (lits,types_sorts) = literals_of_thm thm
paulson@15347
   408
	val cls_id = number
paulson@15347
   409
	val (tvar_lits,tfree_lits) = add_typs_aux types_sorts
paulson@15347
   410
	val ax_name = proper_ax_name name
paulson@15347
   411
    in 
paulson@15347
   412
	make_clause(cls_id,ax_name,Axiom,lits,types_sorts,tvar_lits,tfree_lits)
paulson@15347
   413
    end;
paulson@15347
   414
   
paulson@15347
   415
fun make_hypothesis_clause_thm thm =
paulson@15347
   416
    let val (lits,types_sorts) = literals_of_thm thm
paulson@15347
   417
	val cls_id = generate_id()
paulson@15347
   418
	val (tvar_lits,tfree_lits) = add_typs_aux types_sorts
paulson@15347
   419
    in
paulson@15347
   420
	make_clause(cls_id,"",Hypothesis,lits,types_sorts,tvar_lits,tfree_lits)
paulson@15347
   421
    end;
paulson@15347
   422
paulson@15347
   423
paulson@15347
   424
fun make_conjecture_clause_thm thm =
paulson@15347
   425
    let val (lits,types_sorts) = literals_of_thm thm
paulson@15347
   426
	val cls_id = generate_id()
paulson@15347
   427
	val (tvar_lits,tfree_lits) = add_typs_aux types_sorts
paulson@15347
   428
    in
paulson@15347
   429
	make_clause(cls_id,"",Conjecture,lits,types_sorts,tvar_lits,tfree_lits)
paulson@15347
   430
    end;
paulson@15347
   431
paulson@15347
   432
paulson@15347
   433
fun make_axiom_clause term (name,number)=
paulson@15347
   434
    let val (lits,types_sorts) = literals_of_term (term,([],[]))
paulson@15347
   435
	val cls_id = number
paulson@15347
   436
	val (tvar_lits,tfree_lits) = add_typs_aux types_sorts
paulson@15347
   437
	val ax_name = proper_ax_name name
paulson@15347
   438
    in 
paulson@15347
   439
	make_clause(cls_id,ax_name,Axiom,lits,types_sorts,tvar_lits,tfree_lits)
paulson@15347
   440
    end;
paulson@15347
   441
paulson@15347
   442
paulson@15347
   443
fun make_hypothesis_clause term =
paulson@15347
   444
    let val (lits,types_sorts) = literals_of_term (term,([],[]))
paulson@15347
   445
	val cls_id = generate_id()
paulson@15347
   446
	val (tvar_lits,tfree_lits) = add_typs_aux types_sorts
paulson@15347
   447
    in
paulson@15347
   448
	make_clause(cls_id,"",Hypothesis,lits,types_sorts,tvar_lits,tfree_lits)
paulson@15347
   449
    end;
paulson@15347
   450
    
paulson@15347
   451
 
paulson@15347
   452
fun make_conjecture_clause term =
paulson@15347
   453
    let val (lits,types_sorts) = literals_of_term (term,([],[]))
paulson@15347
   454
	val cls_id = generate_id()
paulson@15347
   455
	val (tvar_lits,tfree_lits) = add_typs_aux types_sorts
paulson@15347
   456
    in
paulson@15347
   457
	make_clause(cls_id,"",Conjecture,lits,types_sorts,tvar_lits,tfree_lits)
paulson@15347
   458
    end;
paulson@15347
   459
 
paulson@15347
   460
paulson@15347
   461
 
paulson@15347
   462
(**** Isabelle arities ****)
paulson@15347
   463
paulson@15347
   464
exception ARCLAUSE of string;
paulson@15347
   465
 
paulson@15347
   466
paulson@15347
   467
type class = string; 
paulson@15347
   468
type tcons = string; 
paulson@15347
   469
paulson@15347
   470
paulson@15347
   471
datatype arLit = TConsLit of bool * (class * tcons * string list) | TVarLit of bool * (class * string);
paulson@15347
   472
 
paulson@15347
   473
datatype arityClause =  
paulson@15347
   474
	 ArityClause of {clause_id: clause_id,
paulson@15347
   475
			 kind: kind,
paulson@15347
   476
			 conclLit: arLit,
paulson@15347
   477
			 premLits: arLit list};
paulson@15347
   478
paulson@15347
   479
paulson@15347
   480
fun get_TVars 0 = []
paulson@15347
   481
  | get_TVars n = ("T_" ^ (string_of_int n)) :: get_TVars (n-1);
paulson@15347
   482
paulson@15347
   483
paulson@15347
   484
paulson@15347
   485
fun pack_sort(_,[])  = raise ARCLAUSE("Empty Sort Found") 
paulson@15347
   486
  | pack_sort(tvar, [cls]) = [(make_type_class cls, tvar)] 
paulson@15347
   487
  | pack_sort(tvar, cls::srt) =  (make_type_class cls,tvar) :: (pack_sort(tvar, srt));
paulson@15347
   488
    
paulson@15347
   489
    
paulson@15347
   490
fun make_TVarLit (b,(cls,str)) = TVarLit(b,(cls,str));
paulson@15347
   491
fun make_TConsLit (b,(cls,tcons,tvars)) = TConsLit(b,(make_type_class cls,make_fixed_type_const tcons,tvars));
paulson@15347
   492
paulson@15347
   493
paulson@15347
   494
fun make_arity_clause (clause_id,kind,conclLit,premLits) =
paulson@15347
   495
    ArityClause {clause_id = clause_id, kind = kind, conclLit = conclLit, premLits = premLits};
paulson@15347
   496
paulson@15347
   497
paulson@15347
   498
fun make_axiom_arity_clause (tcons,(res,args)) =
paulson@15347
   499
     let val cls_id = generate_id()
paulson@15347
   500
	 val nargs = length args
paulson@15347
   501
	 val tvars = get_TVars nargs
paulson@15347
   502
	 val conclLit = make_TConsLit(true,(res,tcons,tvars))
paulson@15347
   503
         val tvars_srts = ResLib.zip tvars args
paulson@15347
   504
	 val tvars_srts' = ResLib.flat_noDup(map pack_sort tvars_srts)
paulson@15347
   505
         val false_tvars_srts' = ResLib.pair_ins false tvars_srts'
paulson@15347
   506
	 val premLits = map make_TVarLit false_tvars_srts'
paulson@15347
   507
     in
paulson@15347
   508
	 make_arity_clause (cls_id,Axiom,conclLit,premLits)
paulson@15347
   509
     end;
paulson@15347
   510
    
paulson@15347
   511
paulson@15347
   512
paulson@15347
   513
(**** Isabelle class relations ****)
paulson@15347
   514
paulson@15347
   515
paulson@15347
   516
datatype classrelClause = 
paulson@15347
   517
	 ClassrelClause of {clause_id: clause_id,
paulson@15347
   518
			    subclass: class,
skalberg@15531
   519
			    superclass: class option};
paulson@15347
   520
paulson@15347
   521
fun make_classrelClause (clause_id,subclass,superclass) =
paulson@15347
   522
    ClassrelClause {clause_id = clause_id,subclass = subclass, superclass = superclass};
paulson@15347
   523
paulson@15347
   524
paulson@15347
   525
fun make_axiom_classrelClause (subclass,superclass) =
paulson@15347
   526
    let val cls_id = generate_id()
paulson@15347
   527
	val sub = make_type_class subclass
skalberg@15531
   528
	val sup = case superclass of NONE => NONE 
skalberg@15531
   529
				   | SOME s => SOME (make_type_class s)
paulson@15347
   530
    in
paulson@15347
   531
	make_classrelClause(cls_id,sub,sup)
paulson@15347
   532
    end;
paulson@15347
   533
paulson@15347
   534
paulson@15347
   535
paulson@15347
   536
fun classrelClauses_of_aux (sub,[]) = []
skalberg@15531
   537
  | classrelClauses_of_aux (sub,(sup::sups)) = make_axiom_classrelClause(sub,SOME sup) :: (classrelClauses_of_aux (sub,sups));
paulson@15347
   538
paulson@15347
   539
paulson@15347
   540
fun classrelClauses_of (sub,sups) = 
skalberg@15531
   541
    case sups of [] => [make_axiom_classrelClause (sub,NONE)]
paulson@15347
   542
	       | _ => classrelClauses_of_aux (sub, sups);
paulson@15347
   543
paulson@15347
   544
paulson@15347
   545
paulson@15347
   546
(***** convert clauses to tptp format *****)
paulson@15347
   547
paulson@15347
   548
paulson@15347
   549
fun string_of_clauseID (Clause cls) = clause_prefix ^ (string_of_int (#clause_id cls));
paulson@15347
   550
paulson@15347
   551
paulson@15347
   552
fun string_of_kind (Clause cls) = name_of_kind (#kind cls);
paulson@15347
   553
paulson@15347
   554
fun string_of_axiomName (Clause cls) = #axiom_name cls;
paulson@15347
   555
paulson@15347
   556
fun string_of_term (UVar(x,_)) = x
paulson@15347
   557
  | string_of_term (Fun (name,typ,[])) = name
paulson@15347
   558
  | string_of_term (Fun (name,typ,terms)) = 
paulson@15347
   559
    let val terms' = map string_of_term terms
paulson@15347
   560
    in
paulson@15347
   561
        if (!keep_types) then name ^ (ResLib.list_to_string (typ :: terms'))
paulson@15347
   562
        else name ^ (ResLib.list_to_string terms')
paulson@15347
   563
    end;
paulson@15347
   564
paulson@15347
   565
paulson@15347
   566
paulson@15347
   567
(****!!!! Changed for typed equality !!!!****)
paulson@15347
   568
fun wrap_eq_type typ t = eq_typ_wrapper ^"(" ^ t ^ "," ^ typ ^ ")";
paulson@15347
   569
paulson@15347
   570
paulson@15347
   571
(****!!!! Changed for typed equality !!!!****)
paulson@15347
   572
(* Only need to wrap equality's arguments with "typeinfo" if the output clauses are typed && if we specifically ask for types to be included.   *)
paulson@15347
   573
fun string_of_equality (typ,terms) =
paulson@15347
   574
    let val [tstr1,tstr2] = map string_of_term terms
paulson@15347
   575
    in
paulson@15347
   576
	if ((!keep_types) andalso (!special_equal)) then 
paulson@15347
   577
	    "equal(" ^ (wrap_eq_type typ tstr1) ^ "," ^ (wrap_eq_type typ tstr2) ^ ")"
paulson@15347
   578
	else
paulson@15347
   579
	    "equal(" ^ tstr1 ^ "," ^ tstr2 ^ ")"
paulson@15347
   580
    end;
paulson@15347
   581
paulson@15347
   582
paulson@15347
   583
paulson@15347
   584
(* Changed for typed equality *)
paulson@15347
   585
(* before output the string of the predicate, check if the predicate corresponds to an equality or not. *)
paulson@15347
   586
fun string_of_predicate (Predicate("equal",typ,terms)) = string_of_equality(typ,terms)
paulson@15347
   587
  | string_of_predicate (Predicate(name,_,[])) = name 
paulson@15347
   588
  | string_of_predicate (Predicate(name,typ,terms)) = 
paulson@15347
   589
    let val terms_as_strings = map string_of_term terms
paulson@15347
   590
    in
paulson@15347
   591
        if (!keep_types) then name ^ (ResLib.list_to_string  (typ :: terms_as_strings))
paulson@15347
   592
        else name ^ (ResLib.list_to_string terms_as_strings) 
paulson@15347
   593
    end;
paulson@15347
   594
paulson@15347
   595
    
paulson@15347
   596
paulson@15347
   597
paulson@15347
   598
fun tptp_literal (Literal(pol,pred,tag)) =
paulson@15347
   599
    let val pred_string = string_of_predicate pred
paulson@15347
   600
	val tagged_pol = if (tag andalso !tagged) then (if pol then "+++" else "---")
paulson@15347
   601
                         else (if pol then "++" else "--")
paulson@15347
   602
     in
paulson@15347
   603
	tagged_pol ^ pred_string
paulson@15347
   604
    end;
paulson@15347
   605
paulson@15347
   606
paulson@15347
   607
paulson@15347
   608
fun tptp_of_typeLit (LTVar x) = "--" ^ x
paulson@15347
   609
  | tptp_of_typeLit (LTFree x) = "++" ^ x;
paulson@15347
   610
 
paulson@15347
   611
paulson@15347
   612
fun gen_tptp_cls (cls_id,ax_name,knd,lits) = 
paulson@15347
   613
    let val ax_str = (if ax_name = "" then "" else ("_" ^ ax_name))
paulson@15347
   614
    in
paulson@15347
   615
	"input_clause(" ^ cls_id ^ ax_str ^ "," ^ knd ^ "," ^ lits ^ ")."
paulson@15347
   616
    end;
paulson@15347
   617
paulson@15347
   618
paulson@15347
   619
fun gen_tptp_type_cls (cls_id,knd,tfree_lit,idx) = "input_clause(" ^ cls_id ^ "_tcs" ^ (string_of_int idx) ^ "," ^ knd ^ ",[" ^ tfree_lit ^ "]).";
paulson@15347
   620
paulson@15347
   621
paulson@15347
   622
fun tptp_clause_aux (Clause cls) = 
paulson@15347
   623
    let val lits = map tptp_literal (#literals cls)
paulson@15347
   624
	val tvar_lits_strs = if (!keep_types) then (map tptp_of_typeLit (#tvar_type_literals cls)) else []
paulson@15347
   625
	val tfree_lits = if (!keep_types) then (map tptp_of_typeLit (#tfree_type_literals cls)) else []
paulson@15347
   626
    in
paulson@15347
   627
	(tvar_lits_strs @ lits,tfree_lits)
paulson@15347
   628
    end; 
paulson@15347
   629
paulson@15608
   630
paulson@15347
   631
fun tptp_clause cls =
paulson@15347
   632
    let val (lits,tfree_lits) = tptp_clause_aux cls (*"lits" includes the typing assumptions (TVars)*)
paulson@15347
   633
	val cls_id = string_of_clauseID cls
paulson@15347
   634
	val ax_name = string_of_axiomName cls
paulson@15347
   635
	val knd = string_of_kind cls
paulson@15347
   636
	val lits_str = ResLib.list_to_string' lits
paulson@15347
   637
	val cls_str = gen_tptp_cls(cls_id,ax_name,knd,lits_str) 			fun typ_clss k [] = []
paulson@15347
   638
          | typ_clss k (tfree :: tfrees) = 
paulson@15347
   639
            (gen_tptp_type_cls(cls_id,knd,tfree,k)) ::  (typ_clss (k+1) tfrees)
paulson@15347
   640
    in 
paulson@15347
   641
	cls_str :: (typ_clss 0 tfree_lits)
paulson@15347
   642
    end;
paulson@15347
   643
paulson@15347
   644
paulson@15608
   645
fun clause2tptp cls =
paulson@15608
   646
    let val (lits,tfree_lits) = tptp_clause_aux cls (*"lits" includes the typing assumptions (TVars)*)
paulson@15608
   647
	val cls_id = string_of_clauseID cls
paulson@15608
   648
	val ax_name = string_of_axiomName cls
paulson@15608
   649
	val knd = string_of_kind cls
paulson@15608
   650
	val lits_str = ResLib.list_to_string' lits
paulson@15608
   651
	val cls_str = gen_tptp_cls(cls_id,ax_name,knd,lits_str) 
paulson@15608
   652
    in
paulson@15608
   653
	(cls_str,tfree_lits) 
paulson@15608
   654
    end;
paulson@15608
   655
paulson@15608
   656
paulson@15608
   657
fun tfree_clause tfree_lit = "input_clause(" ^ "tfree_tcs," ^ "conjecture" ^ ",[" ^ tfree_lit ^ "]).";
paulson@15608
   658
paulson@15347
   659
val delim = "\n";
paulson@15347
   660
val tptp_clauses2str = ResLib.list2str_sep delim; 
paulson@15347
   661
     
paulson@15347
   662
paulson@15347
   663
fun string_of_arClauseID (ArityClause arcls) = arclause_prefix ^ string_of_int(#clause_id arcls);
paulson@15347
   664
paulson@15347
   665
paulson@15347
   666
fun string_of_arLit (TConsLit(b,(c,t,args))) =
paulson@15347
   667
    let val pol = if b then "++" else "--"
paulson@15347
   668
	val  arg_strs = (case args of [] => "" | _ => ResLib.list_to_string args)
paulson@15347
   669
    in 
paulson@15347
   670
	pol ^ c ^ "(" ^ t ^ arg_strs ^ ")"
paulson@15347
   671
    end
paulson@15347
   672
  | string_of_arLit (TVarLit(b,(c,str))) =
paulson@15347
   673
    let val pol = if b then "++" else "--"
paulson@15347
   674
    in
paulson@15347
   675
	pol ^ c ^ "(" ^ str ^ ")"
paulson@15347
   676
    end;
paulson@15347
   677
    
paulson@15347
   678
paulson@15347
   679
fun string_of_conclLit (ArityClause arcls) = string_of_arLit (#conclLit arcls);
paulson@15347
   680
     
paulson@15347
   681
paulson@15347
   682
fun strings_of_premLits (ArityClause arcls) = map string_of_arLit (#premLits arcls);
paulson@15347
   683
		
paulson@15347
   684
paulson@15347
   685
fun string_of_arKind (ArityClause arcls) = name_of_kind(#kind arcls);
paulson@15347
   686
paulson@15347
   687
fun tptp_arity_clause arcls = 
paulson@15347
   688
    let val arcls_id = string_of_arClauseID arcls
paulson@15347
   689
	val concl_lit = string_of_conclLit arcls
paulson@15347
   690
	val prems_lits = strings_of_premLits arcls
paulson@15347
   691
	val knd = string_of_arKind arcls
paulson@15347
   692
	val all_lits = concl_lit :: prems_lits
paulson@15347
   693
    in
paulson@15452
   694
	"input_clause(" ^ arcls_id ^ "," ^ knd ^ "," ^ (ResLib.list_to_string' all_lits) ^ ")."
paulson@15347
   695
	
paulson@15347
   696
    end;
paulson@15347
   697
paulson@15347
   698
paulson@15347
   699
val clrelclause_prefix = "relcls_";
paulson@15347
   700
paulson@15347
   701
paulson@15347
   702
fun tptp_classrelLits sub sup = 
paulson@15347
   703
    let val tvar = "(T)"
paulson@15347
   704
    in 
skalberg@15531
   705
	case sup of NONE => "[++" ^ sub ^ tvar ^ "]"
skalberg@15531
   706
		  | (SOME supcls) =>  "[--" ^ sub ^ tvar ^ ",++" ^ supcls ^ tvar ^ "]"
paulson@15347
   707
    end;
paulson@15347
   708
paulson@15347
   709
paulson@15347
   710
fun tptp_classrelClause (ClassrelClause cls) =
paulson@15347
   711
    let val relcls_id = clrelclause_prefix ^ string_of_int(#clause_id cls)
paulson@15347
   712
	val sub = #subclass cls
paulson@15347
   713
	val sup = #superclass cls
paulson@15347
   714
	val lits = tptp_classrelLits sub sup
paulson@15347
   715
    in
paulson@15347
   716
	"input_clause(" ^ relcls_id ^ ",axiom," ^ lits ^ ")."
paulson@15347
   717
    end; 
paulson@15347
   718
    
paulson@15347
   719
end;