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