src/HOL/Tools/Sledgehammer/sledgehammer_fol_clause.ML
author blanchet
Wed Mar 17 18:16:31 2010 +0100 (2010-03-17)
changeset 35825 a6aad5a70ed4
parent 35092 src/HOL/Tools/res_clause.ML@cfe605c54e50
child 35826 1590abc3d42a
permissions -rw-r--r--
move Sledgehammer files in a directory of their own
     1 (*  Title:      HOL/Tools/res_clause.ML
     2     Author:     Jia Meng, Cambridge University Computer Laboratory
     3 
     4 Storing/printing FOL clauses and arity clauses.  Typed equality is
     5 treated differently.
     6 
     7 FIXME: combine with res_hol_clause!
     8 *)
     9 
    10 signature RES_CLAUSE =
    11 sig
    12   val schematic_var_prefix: string
    13   val fixed_var_prefix: string
    14   val tvar_prefix: string
    15   val tfree_prefix: string
    16   val clause_prefix: string
    17   val const_prefix: string
    18   val tconst_prefix: string
    19   val class_prefix: string
    20   val union_all: ''a list list -> ''a list
    21   val const_trans_table: string Symtab.table
    22   val type_const_trans_table: string Symtab.table
    23   val ascii_of: string -> string
    24   val undo_ascii_of: string -> string
    25   val paren_pack : string list -> string
    26   val make_schematic_var : string * int -> string
    27   val make_fixed_var : string -> string
    28   val make_schematic_type_var : string * int -> string
    29   val make_fixed_type_var : string -> string
    30   val make_fixed_const : bool -> string -> string
    31   val make_fixed_type_const : bool -> string -> string
    32   val make_type_class : string -> string
    33   datatype kind = Axiom | Conjecture
    34   type axiom_name = string
    35   datatype fol_type =
    36       AtomV of string
    37     | AtomF of string
    38     | Comp of string * fol_type list
    39   val string_of_fol_type : fol_type -> string
    40   datatype type_literal = LTVar of string * string | LTFree of string * string
    41   exception CLAUSE of string * term
    42   val add_typs : typ list -> type_literal list
    43   val get_tvar_strs: typ list -> string list
    44   datatype arLit =
    45       TConsLit of class * string * string list
    46     | TVarLit of class * string
    47   datatype arityClause = ArityClause of
    48    {axiom_name: axiom_name, conclLit: arLit, premLits: arLit list}
    49   datatype classrelClause = ClassrelClause of
    50    {axiom_name: axiom_name, subclass: class, superclass: class}
    51   val make_classrel_clauses: theory -> class list -> class list -> classrelClause list
    52   val make_arity_clauses_dfg: bool -> theory -> string list -> class list -> class list * arityClause list
    53   val make_arity_clauses: theory -> string list -> class list -> class list * arityClause list
    54   val add_type_sort_preds: typ * int Symtab.table -> int Symtab.table
    55   val add_classrelClause_preds : classrelClause * int Symtab.table -> int Symtab.table
    56   val class_of_arityLit: arLit -> class
    57   val add_arityClause_preds: arityClause * int Symtab.table -> int Symtab.table
    58   val add_foltype_funcs: fol_type * int Symtab.table -> int Symtab.table
    59   val add_arityClause_funcs: arityClause * int Symtab.table -> int Symtab.table
    60   val init_functab: int Symtab.table
    61   val dfg_sign: bool -> string -> string
    62   val dfg_of_typeLit: bool -> type_literal -> string
    63   val gen_dfg_cls: int * string * kind * string list * string list * string list -> string
    64   val string_of_preds: (string * Int.int) list -> string
    65   val string_of_funcs: (string * int) list -> string
    66   val string_of_symbols: string -> string -> string
    67   val string_of_start: string -> string
    68   val string_of_descrip : string -> string
    69   val dfg_tfree_clause : string -> string
    70   val dfg_classrelClause: classrelClause -> string
    71   val dfg_arity_clause: arityClause -> string
    72   val tptp_sign: bool -> string -> string
    73   val tptp_of_typeLit : bool -> type_literal -> string
    74   val gen_tptp_cls : int * string * kind * string list * string list -> string
    75   val tptp_tfree_clause : string -> string
    76   val tptp_arity_clause : arityClause -> string
    77   val tptp_classrelClause : classrelClause -> string
    78 end
    79 
    80 structure Res_Clause: RES_CLAUSE =
    81 struct
    82 
    83 val schematic_var_prefix = "V_";
    84 val fixed_var_prefix = "v_";
    85 
    86 val tvar_prefix = "T_";
    87 val tfree_prefix = "t_";
    88 
    89 val clause_prefix = "cls_";
    90 val arclause_prefix = "clsarity_"
    91 val clrelclause_prefix = "clsrel_";
    92 
    93 val const_prefix = "c_";
    94 val tconst_prefix = "tc_";
    95 val class_prefix = "class_";
    96 
    97 fun union_all xss = List.foldl (uncurry (union (op =))) [] xss;
    98 
    99 (*Provide readable names for the more common symbolic functions*)
   100 val const_trans_table =
   101       Symtab.make [(@{const_name "op ="}, "equal"),
   102                    (@{const_name Orderings.less_eq}, "lessequals"),
   103                    (@{const_name "op &"}, "and"),
   104                    (@{const_name "op |"}, "or"),
   105                    (@{const_name "op -->"}, "implies"),
   106                    (@{const_name "op :"}, "in"),
   107                    ("ATP_Linkup.fequal", "fequal"),
   108                    ("ATP_Linkup.COMBI", "COMBI"),
   109                    ("ATP_Linkup.COMBK", "COMBK"),
   110                    ("ATP_Linkup.COMBB", "COMBB"),
   111                    ("ATP_Linkup.COMBC", "COMBC"),
   112                    ("ATP_Linkup.COMBS", "COMBS"),
   113                    ("ATP_Linkup.COMBB'", "COMBB_e"),
   114                    ("ATP_Linkup.COMBC'", "COMBC_e"),
   115                    ("ATP_Linkup.COMBS'", "COMBS_e")];
   116 
   117 val type_const_trans_table =
   118       Symtab.make [("*", "prod"),
   119                    ("+", "sum"),
   120                    ("~=>", "map")];
   121 
   122 (*Escaping of special characters.
   123   Alphanumeric characters are left unchanged.
   124   The character _ goes to __
   125   Characters in the range ASCII space to / go to _A to _P, respectively.
   126   Other printing characters go to _nnn where nnn is the decimal ASCII code.*)
   127 val A_minus_space = Char.ord #"A" - Char.ord #" ";
   128 
   129 fun stringN_of_int 0 _ = ""
   130   | stringN_of_int k n = stringN_of_int (k-1) (n div 10) ^ Int.toString (n mod 10);
   131 
   132 fun ascii_of_c c =
   133   if Char.isAlphaNum c then String.str c
   134   else if c = #"_" then "__"
   135   else if #" " <= c andalso c <= #"/"
   136        then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space))
   137   else if Char.isPrint c
   138        then ("_" ^ stringN_of_int 3 (Char.ord c))  (*fixed width, in case more digits follow*)
   139   else ""
   140 
   141 val ascii_of = String.translate ascii_of_c;
   142 
   143 (** Remove ASCII armouring from names in proof files **)
   144 
   145 (*We don't raise error exceptions because this code can run inside the watcher.
   146   Also, the errors are "impossible" (hah!)*)
   147 fun undo_ascii_aux rcs [] = String.implode(rev rcs)
   148   | undo_ascii_aux rcs [#"_"] = undo_ascii_aux (#"_"::rcs) []  (*ERROR*)
   149       (*Three types of _ escapes: __, _A to _P, _nnn*)
   150   | undo_ascii_aux rcs (#"_" :: #"_" :: cs) = undo_ascii_aux (#"_"::rcs) cs
   151   | undo_ascii_aux rcs (#"_" :: c :: cs) =
   152       if #"A" <= c andalso c<= #"P"  (*translation of #" " to #"/"*)
   153       then undo_ascii_aux (Char.chr(Char.ord c - A_minus_space) :: rcs) cs
   154       else
   155         let val digits = List.take (c::cs, 3) handle Subscript => []
   156         in
   157             case Int.fromString (String.implode digits) of
   158                 NONE => undo_ascii_aux (c:: #"_"::rcs) cs  (*ERROR*)
   159               | SOME n => undo_ascii_aux (Char.chr n :: rcs) (List.drop (cs, 2))
   160         end
   161   | undo_ascii_aux rcs (c::cs) = undo_ascii_aux (c::rcs) cs;
   162 
   163 val undo_ascii_of = undo_ascii_aux [] o String.explode;
   164 
   165 (* convert a list of strings into one single string; surrounded by brackets *)
   166 fun paren_pack [] = ""   (*empty argument list*)
   167   | paren_pack strings = "(" ^ commas strings ^ ")";
   168 
   169 (*TSTP format uses (...) rather than the old [...]*)
   170 fun tptp_pack strings = "(" ^ space_implode " | " strings ^ ")";
   171 
   172 
   173 (*Remove the initial ' character from a type variable, if it is present*)
   174 fun trim_type_var s =
   175   if s <> "" andalso String.sub(s,0) = #"'" then String.extract(s,1,NONE)
   176   else error ("trim_type: Malformed type variable encountered: " ^ s);
   177 
   178 fun ascii_of_indexname (v,0) = ascii_of v
   179   | ascii_of_indexname (v,i) = ascii_of v ^ "_" ^ Int.toString i;
   180 
   181 fun make_schematic_var v = schematic_var_prefix ^ (ascii_of_indexname v);
   182 fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x);
   183 
   184 fun make_schematic_type_var (x,i) =
   185       tvar_prefix ^ (ascii_of_indexname (trim_type_var x,i));
   186 fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x));
   187 
   188 (*HACK because SPASS truncates identifiers to 63 characters :-(( *)
   189 (*32-bit hash,so we expect no collisions unless there are around 65536 long identifiers...*)
   190 fun controlled_length dfg_format s =
   191   if size s > 60 andalso dfg_format
   192   then Word.toString (Polyhash.hashw_string(s,0w0))
   193   else s;
   194 
   195 fun lookup_const dfg c =
   196     case Symtab.lookup const_trans_table c of
   197         SOME c' => c'
   198       | NONE => controlled_length dfg (ascii_of c);
   199 
   200 fun lookup_type_const dfg c =
   201     case Symtab.lookup type_const_trans_table c of
   202         SOME c' => c'
   203       | NONE => controlled_length dfg (ascii_of c);
   204 
   205 fun make_fixed_const _ "op =" = "equal"   (*MUST BE "equal" because it's built-in to ATPs*)
   206   | make_fixed_const dfg c      = const_prefix ^ lookup_const dfg c;
   207 
   208 fun make_fixed_type_const dfg c = tconst_prefix ^ lookup_type_const dfg c;
   209 
   210 fun make_type_class clas = class_prefix ^ ascii_of clas;
   211 
   212 
   213 (***** definitions and functions for FOL clauses, for conversion to TPTP or DFG format. *****)
   214 
   215 datatype kind = Axiom | Conjecture;
   216 
   217 type axiom_name = string;
   218 
   219 (**** Isabelle FOL clauses ****)
   220 
   221 (*FIXME: give the constructors more sensible names*)
   222 datatype fol_type = AtomV of string
   223                   | AtomF of string
   224                   | Comp of string * fol_type list;
   225 
   226 fun string_of_fol_type (AtomV x) = x
   227   | string_of_fol_type (AtomF x) = x
   228   | string_of_fol_type (Comp(tcon,tps)) =
   229       tcon ^ (paren_pack (map string_of_fol_type tps));
   230 
   231 (*First string is the type class; the second is a TVar or TFfree*)
   232 datatype type_literal = LTVar of string * string | LTFree of string * string;
   233 
   234 exception CLAUSE of string * term;
   235 
   236 fun atomic_type (TFree (a,_)) = AtomF(make_fixed_type_var a)
   237   | atomic_type (TVar (v,_))  = AtomV(make_schematic_type_var v);
   238 
   239 (*Flatten a type to a fol_type while accumulating sort constraints on the TFrees and
   240   TVars it contains.*)
   241 fun type_of dfg (Type (a, Ts)) =
   242       let val (folTyps, ts) = types_of dfg Ts
   243           val t = make_fixed_type_const dfg a
   244       in (Comp(t,folTyps), ts) end
   245   | type_of dfg T = (atomic_type T, [T])
   246 and types_of dfg Ts =
   247       let val (folTyps,ts) = ListPair.unzip (map (type_of dfg) Ts)
   248       in (folTyps, union_all ts) end;
   249 
   250 (*Make literals for sorted type variables*)
   251 fun sorts_on_typs_aux (_, [])   = []
   252   | sorts_on_typs_aux ((x,i),  s::ss) =
   253       let val sorts = sorts_on_typs_aux ((x,i), ss)
   254       in
   255           if s = "HOL.type" then sorts
   256           else if i = ~1 then LTFree(make_type_class s, make_fixed_type_var x) :: sorts
   257           else LTVar(make_type_class s, make_schematic_type_var (x,i)) :: sorts
   258       end;
   259 
   260 fun sorts_on_typs (TFree (a,s)) = sorts_on_typs_aux ((a,~1),s)
   261   | sorts_on_typs (TVar (v,s))  = sorts_on_typs_aux (v,s);
   262 
   263 fun pred_of_sort (LTVar (s,ty)) = (s,1)
   264   | pred_of_sort (LTFree (s,ty)) = (s,1)
   265 
   266 (*Given a list of sorted type variables, return a list of type literals.*)
   267 fun add_typs Ts = List.foldl (uncurry (union (op =))) [] (map sorts_on_typs Ts);
   268 
   269 (*The correct treatment of TFrees like 'a in lemmas (axiom clauses) is not clear.
   270   * Ignoring them leads to unsound proofs, since we do nothing to ensure that 'a
   271     in a lemma has the same sort as 'a in the conjecture.
   272   * Deleting such clauses will lead to problems with locales in other use of local results
   273     where 'a is fixed. Probably we should delete clauses unless the sorts agree.
   274   * Currently we include a class constraint in the clause, exactly as with TVars.
   275 *)
   276 
   277 (** make axiom and conjecture clauses. **)
   278 
   279 fun get_tvar_strs [] = []
   280   | get_tvar_strs ((TVar (indx,s))::Ts) =
   281       insert (op =) (make_schematic_type_var indx) (get_tvar_strs Ts)
   282   | get_tvar_strs((TFree _)::Ts) = get_tvar_strs Ts
   283 
   284 
   285 
   286 (**** Isabelle arities ****)
   287 
   288 exception ARCLAUSE of string;
   289 
   290 datatype arLit = TConsLit of class * string * string list
   291                | TVarLit of class * string;
   292 
   293 datatype arityClause =
   294          ArityClause of {axiom_name: axiom_name,
   295                          conclLit: arLit,
   296                          premLits: arLit list};
   297 
   298 
   299 fun gen_TVars 0 = []
   300   | gen_TVars n = ("T_" ^ Int.toString n) :: gen_TVars (n-1);
   301 
   302 fun pack_sort(_,[])  = []
   303   | pack_sort(tvar, "HOL.type"::srt) = pack_sort(tvar, srt)   (*IGNORE sort "type"*)
   304   | pack_sort(tvar, cls::srt) =  (cls, tvar) :: pack_sort(tvar, srt);
   305 
   306 (*Arity of type constructor tcon :: (arg1,...,argN)res*)
   307 fun make_axiom_arity_clause dfg (tcons, axiom_name, (cls,args)) =
   308    let val tvars = gen_TVars (length args)
   309        val tvars_srts = ListPair.zip (tvars,args)
   310    in
   311       ArityClause {axiom_name = axiom_name, 
   312                    conclLit = TConsLit (cls, make_fixed_type_const dfg tcons, tvars),
   313                    premLits = map TVarLit (union_all(map pack_sort tvars_srts))}
   314    end;
   315 
   316 
   317 (**** Isabelle class relations ****)
   318 
   319 datatype classrelClause =
   320          ClassrelClause of {axiom_name: axiom_name,
   321                             subclass: class,
   322                             superclass: class};
   323 
   324 (*Generate all pairs (sub,super) such that sub is a proper subclass of super in theory thy.*)
   325 fun class_pairs thy [] supers = []
   326   | class_pairs thy subs supers =
   327       let val class_less = Sorts.class_less(Sign.classes_of thy)
   328           fun add_super sub (super,pairs) =
   329                 if class_less (sub,super) then (sub,super)::pairs else pairs
   330           fun add_supers (sub,pairs) = List.foldl (add_super sub) pairs supers
   331       in  List.foldl add_supers [] subs  end;
   332 
   333 fun make_classrelClause (sub,super) =
   334   ClassrelClause {axiom_name = clrelclause_prefix ^ ascii_of sub ^ "_" ^ ascii_of super,
   335                   subclass = make_type_class sub,
   336                   superclass = make_type_class super};
   337 
   338 fun make_classrel_clauses thy subs supers =
   339   map make_classrelClause (class_pairs thy subs supers);
   340 
   341 
   342 (** Isabelle arities **)
   343 
   344 fun arity_clause dfg _ _ (tcons, []) = []
   345   | arity_clause dfg seen n (tcons, ("HOL.type",_)::ars) =  (*ignore*)
   346       arity_clause dfg seen n (tcons,ars)
   347   | arity_clause dfg seen n (tcons, (ar as (class,_)) :: ars) =
   348       if class mem_string seen then (*multiple arities for the same tycon, class pair*)
   349           make_axiom_arity_clause dfg (tcons, lookup_type_const dfg tcons ^ "_" ^ class ^ "_" ^ Int.toString n, ar) ::
   350           arity_clause dfg seen (n+1) (tcons,ars)
   351       else
   352           make_axiom_arity_clause dfg (tcons, lookup_type_const dfg tcons ^ "_" ^ class, ar) ::
   353           arity_clause dfg (class::seen) n (tcons,ars)
   354 
   355 fun multi_arity_clause dfg [] = []
   356   | multi_arity_clause dfg ((tcons,ars) :: tc_arlists) =
   357       arity_clause dfg [] 1 (tcons, ars)  @  multi_arity_clause dfg tc_arlists
   358 
   359 (*Generate all pairs (tycon,class,sorts) such that tycon belongs to class in theory thy
   360   provided its arguments have the corresponding sorts.*)
   361 fun type_class_pairs thy tycons classes =
   362   let val alg = Sign.classes_of thy
   363       fun domain_sorts (tycon,class) = Sorts.mg_domain alg tycon [class]
   364       fun add_class tycon (class,pairs) =
   365             (class, domain_sorts(tycon,class))::pairs
   366             handle Sorts.CLASS_ERROR _ => pairs
   367       fun try_classes tycon = (tycon, List.foldl (add_class tycon) [] classes)
   368   in  map try_classes tycons  end;
   369 
   370 (*Proving one (tycon, class) membership may require proving others, so iterate.*)
   371 fun iter_type_class_pairs thy tycons [] = ([], [])
   372   | iter_type_class_pairs thy tycons classes =
   373       let val cpairs = type_class_pairs thy tycons classes
   374           val newclasses = union_all (union_all (union_all (map (map #2 o #2) cpairs)))
   375             |> subtract (op =) classes |> subtract (op =) HOLogic.typeS
   376           val (classes', cpairs') = iter_type_class_pairs thy tycons newclasses
   377       in (union (op =) classes' classes, union (op =) cpairs' cpairs) end;
   378 
   379 fun make_arity_clauses_dfg dfg thy tycons classes =
   380   let val (classes', cpairs) = iter_type_class_pairs thy tycons classes
   381   in  (classes', multi_arity_clause dfg cpairs)  end;
   382 val make_arity_clauses = make_arity_clauses_dfg false;
   383 
   384 (**** Find occurrences of predicates in clauses ****)
   385 
   386 (*FIXME: multiple-arity checking doesn't work, as update_new is the wrong
   387   function (it flags repeated declarations of a function, even with the same arity)*)
   388 
   389 fun update_many (tab, keypairs) = List.foldl (uncurry Symtab.update) tab keypairs;
   390 
   391 fun add_type_sort_preds (T, preds) =
   392       update_many (preds, map pred_of_sort (sorts_on_typs T));
   393 
   394 fun add_classrelClause_preds (ClassrelClause {subclass,superclass,...}, preds) =
   395   Symtab.update (subclass,1) (Symtab.update (superclass,1) preds);
   396 
   397 fun class_of_arityLit (TConsLit (tclass, _, _)) = tclass
   398   | class_of_arityLit (TVarLit (tclass, _)) = tclass;
   399 
   400 fun add_arityClause_preds (ArityClause {conclLit,premLits,...}, preds) =
   401   let val classes = map (make_type_class o class_of_arityLit) (conclLit::premLits)
   402       fun upd (class,preds) = Symtab.update (class,1) preds
   403   in  List.foldl upd preds classes  end;
   404 
   405 (*** Find occurrences of functions in clauses ***)
   406 
   407 fun add_foltype_funcs (AtomV _, funcs) = funcs
   408   | add_foltype_funcs (AtomF a, funcs) = Symtab.update (a,0) funcs
   409   | add_foltype_funcs (Comp(a,tys), funcs) =
   410       List.foldl add_foltype_funcs (Symtab.update (a, length tys) funcs) tys;
   411 
   412 (*TFrees are recorded as constants*)
   413 fun add_type_sort_funcs (TVar _, funcs) = funcs
   414   | add_type_sort_funcs (TFree (a, _), funcs) =
   415       Symtab.update (make_fixed_type_var a, 0) funcs
   416 
   417 fun add_arityClause_funcs (ArityClause {conclLit,...}, funcs) =
   418   let val TConsLit (_, tcons, tvars) = conclLit
   419   in  Symtab.update (tcons, length tvars) funcs  end;
   420 
   421 (*This type can be overlooked because it is built-in...*)
   422 val init_functab = Symtab.update ("tc_itself", 1) Symtab.empty;
   423 
   424 
   425 (**** String-oriented operations ****)
   426 
   427 fun string_of_clausename (cls_id,ax_name) =
   428     clause_prefix ^ ascii_of ax_name ^ "_" ^ Int.toString cls_id;
   429 
   430 fun string_of_type_clsname (cls_id,ax_name,idx) =
   431     string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx);
   432 
   433 
   434 (**** Producing DFG files ****)
   435 
   436 (*Attach sign in DFG syntax: false means negate.*)
   437 fun dfg_sign true s = s
   438   | dfg_sign false s = "not(" ^ s ^ ")"
   439 
   440 fun dfg_of_typeLit pos (LTVar (s,ty))  = dfg_sign pos (s ^ "(" ^ ty ^ ")")
   441   | dfg_of_typeLit pos (LTFree (s,ty)) = dfg_sign pos (s ^ "(" ^ ty ^ ")");
   442 
   443 (*Enclose the clause body by quantifiers, if necessary*)
   444 fun dfg_forall [] body = body
   445   | dfg_forall vars body = "forall([" ^ commas vars ^ "],\n" ^ body ^ ")"
   446 
   447 fun gen_dfg_cls (cls_id, ax_name, Axiom, lits, tylits, vars) =
   448       "clause( %(axiom)\n" ^
   449       dfg_forall vars ("or(" ^ commas (tylits@lits) ^ ")") ^ ",\n" ^
   450       string_of_clausename (cls_id,ax_name) ^  ").\n\n"
   451   | gen_dfg_cls (cls_id, ax_name, Conjecture, lits, _, vars) =
   452       "clause( %(negated_conjecture)\n" ^
   453       dfg_forall vars ("or(" ^ commas lits ^ ")") ^ ",\n" ^
   454       string_of_clausename (cls_id,ax_name) ^  ").\n\n";
   455 
   456 fun string_of_arity (name, num) =  "(" ^ name ^ "," ^ Int.toString num ^ ")"
   457 
   458 fun string_of_preds [] = ""
   459   | string_of_preds preds = "predicates[" ^ commas(map string_of_arity preds) ^ "].\n";
   460 
   461 fun string_of_funcs [] = ""
   462   | string_of_funcs funcs = "functions[" ^ commas(map string_of_arity funcs) ^ "].\n" ;
   463 
   464 fun string_of_symbols predstr funcstr =
   465   "list_of_symbols.\n" ^ predstr  ^ funcstr  ^ "end_of_list.\n\n";
   466 
   467 fun string_of_start name = "begin_problem(" ^ name ^ ").\n\n";
   468 
   469 fun string_of_descrip name =
   470   "list_of_descriptions.\nname({*" ^ name ^
   471   "*}).\nauthor({*Isabelle*}).\nstatus(unknown).\ndescription({*auto-generated*}).\nend_of_list.\n\n"
   472 
   473 fun dfg_tfree_clause tfree_lit =
   474   "clause( %(negated_conjecture)\n" ^ "or( " ^ tfree_lit ^ "),\n" ^ "tfree_tcs" ^ ").\n\n"
   475 
   476 fun dfg_of_arLit (TConsLit (c,t,args)) =
   477       dfg_sign true (make_type_class c ^ "(" ^ t ^ paren_pack args ^ ")")
   478   | dfg_of_arLit (TVarLit (c,str)) =
   479       dfg_sign false (make_type_class c ^ "(" ^ str ^ ")")
   480 
   481 fun dfg_classrelLits sub sup =  "not(" ^ sub ^ "(T)), " ^ sup ^ "(T)";
   482 
   483 fun dfg_classrelClause (ClassrelClause {axiom_name,subclass,superclass,...}) =
   484   "clause(forall([T],\nor( " ^ dfg_classrelLits subclass superclass ^ ")),\n" ^
   485   axiom_name ^ ").\n\n";
   486 
   487 fun string_of_ar axiom_name = arclause_prefix ^ ascii_of axiom_name;
   488 
   489 fun dfg_arity_clause (ArityClause{axiom_name,conclLit,premLits,...}) =
   490   let val TConsLit (_,_,tvars) = conclLit
   491       val lits = map dfg_of_arLit (conclLit :: premLits)
   492   in
   493       "clause( %(axiom)\n" ^
   494       dfg_forall tvars ("or( " ^ commas lits ^ ")") ^ ",\n" ^
   495       string_of_ar axiom_name ^ ").\n\n"
   496   end;
   497 
   498 
   499 (**** Produce TPTP files ****)
   500 
   501 (*Attach sign in TPTP syntax: false means negate.*)
   502 fun tptp_sign true s = s
   503   | tptp_sign false s = "~ " ^ s
   504 
   505 fun tptp_of_typeLit pos (LTVar (s,ty))  = tptp_sign pos (s ^ "(" ^ ty ^ ")")
   506   | tptp_of_typeLit pos (LTFree (s,ty)) = tptp_sign pos  (s ^ "(" ^ ty ^ ")");
   507 
   508 fun gen_tptp_cls (cls_id,ax_name,Axiom,lits,tylits) =
   509       "cnf(" ^ string_of_clausename (cls_id,ax_name) ^ ",axiom," ^ 
   510                tptp_pack (tylits@lits) ^ ").\n"
   511   | gen_tptp_cls (cls_id,ax_name,Conjecture,lits,_) =
   512       "cnf(" ^ string_of_clausename (cls_id,ax_name) ^ ",negated_conjecture," ^ 
   513                tptp_pack lits ^ ").\n";
   514 
   515 fun tptp_tfree_clause tfree_lit =
   516     "cnf(" ^ "tfree_tcs," ^ "negated_conjecture" ^ "," ^ tptp_pack[tfree_lit] ^ ").\n";
   517 
   518 fun tptp_of_arLit (TConsLit (c,t,args)) =
   519       tptp_sign true (make_type_class c ^ "(" ^ t ^ paren_pack args ^ ")")
   520   | tptp_of_arLit (TVarLit (c,str)) =
   521       tptp_sign false (make_type_class c ^ "(" ^ str ^ ")")
   522 
   523 fun tptp_arity_clause (ArityClause{axiom_name,conclLit,premLits,...}) =
   524   "cnf(" ^ string_of_ar axiom_name ^ ",axiom," ^
   525   tptp_pack (map tptp_of_arLit (conclLit :: premLits)) ^ ").\n";
   526 
   527 fun tptp_classrelLits sub sup =
   528   let val tvar = "(T)"
   529   in  tptp_pack [tptp_sign false (sub^tvar), tptp_sign true (sup^tvar)]  end;
   530 
   531 fun tptp_classrelClause (ClassrelClause {axiom_name,subclass,superclass,...}) =
   532   "cnf(" ^ axiom_name ^ ",axiom," ^ tptp_classrelLits subclass superclass ^ ").\n"
   533 
   534 end;