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