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