src/HOL/Tools/Sledgehammer/sledgehammer_fol_clause.ML
author haftmann
Wed May 05 18:25:34 2010 +0200 (2010-05-05)
changeset 36692 54b64d4ad524
parent 36556 81dc2c20f052
child 36966 adc11fb3f3aa
permissions -rw-r--r--
farewell to old-style mem infixes -- type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
     1 (*  Title:      HOL/Tools/Sledgehammer/sledgehammer_fol_clause.ML
     2     Author:     Jia Meng, Cambridge University Computer Laboratory
     3     Author:     Jasmin Blanchette, TU Muenchen
     4 
     5 Storing/printing FOL clauses and arity clauses.  Typed equality is
     6 treated differently.
     7 
     8 FIXME: combine with sledgehammer_hol_clause!
     9 *)
    10 
    11 signature SLEDGEHAMMER_FOL_CLAUSE =
    12 sig
    13   val schematic_var_prefix: string
    14   val fixed_var_prefix: string
    15   val tvar_prefix: string
    16   val tfree_prefix: string
    17   val clause_prefix: string
    18   val const_prefix: string
    19   val tconst_prefix: string
    20   val class_prefix: string
    21   val union_all: ''a list list -> ''a list
    22   val const_trans_table: string Symtab.table
    23   val type_const_trans_table: string Symtab.table
    24   val ascii_of: string -> string
    25   val undo_ascii_of: string -> string
    26   val paren_pack : string list -> string
    27   val make_schematic_var : string * int -> string
    28   val make_fixed_var : string -> string
    29   val make_schematic_type_var : string * int -> string
    30   val make_fixed_type_var : string -> string
    31   val make_fixed_const : bool -> string -> string
    32   val make_fixed_type_const : bool -> string -> string
    33   val make_type_class : string -> string
    34   type name = string * string
    35   type name_pool = string Symtab.table * string Symtab.table
    36   val empty_name_pool : bool -> name_pool option
    37   val pool_map : ('a -> 'b -> 'c * 'b) -> 'a list -> 'b -> 'c list * 'b
    38   val nice_name : name -> name_pool option -> string * name_pool option
    39   datatype kind = Axiom | Conjecture
    40   type axiom_name = string
    41   datatype fol_type =
    42     TyVar of name |
    43     TyFree of name |
    44     TyConstr of name * fol_type list
    45   val string_of_fol_type :
    46     fol_type -> name_pool option -> string * name_pool option
    47   datatype type_literal =
    48     TyLitVar of string * name |
    49     TyLitFree of string * name
    50   exception CLAUSE of string * term
    51   val add_type_literals : typ list -> type_literal list
    52   val get_tvar_strs: typ list -> string list
    53   datatype arLit =
    54       TConsLit of class * string * string list
    55     | TVarLit of class * string
    56   datatype arity_clause = ArityClause of
    57    {axiom_name: axiom_name, conclLit: arLit, premLits: arLit list}
    58   datatype classrel_clause = ClassrelClause of
    59    {axiom_name: axiom_name, subclass: class, superclass: class}
    60   val make_classrel_clauses: theory -> class list -> class list -> classrel_clause list
    61   val make_arity_clauses_dfg: bool -> theory -> string list -> class list -> class list * arity_clause list
    62   val make_arity_clauses: theory -> string list -> class list -> class list * arity_clause list
    63   val add_type_sort_preds: typ -> int Symtab.table -> int Symtab.table
    64   val add_classrel_clause_preds :
    65     classrel_clause -> int Symtab.table -> int Symtab.table
    66   val class_of_arityLit: arLit -> class
    67   val add_arity_clause_preds: arity_clause -> int Symtab.table -> int Symtab.table
    68   val add_fol_type_funcs: fol_type -> int Symtab.table -> int Symtab.table
    69   val add_arity_clause_funcs:
    70     arity_clause -> int Symtab.table -> int Symtab.table
    71   val init_functab: int Symtab.table
    72   val dfg_sign: bool -> string -> string
    73   val dfg_of_type_literal: bool -> type_literal -> string
    74   val gen_dfg_cls: int * string * kind * string list * string list * string list -> string
    75   val string_of_preds: (string * Int.int) list -> string
    76   val string_of_funcs: (string * int) list -> string
    77   val string_of_symbols: string -> string -> string
    78   val string_of_start: string -> string
    79   val string_of_descrip : string -> string
    80   val dfg_tfree_clause : string -> string
    81   val dfg_classrel_clause: classrel_clause -> string
    82   val dfg_arity_clause: arity_clause -> string
    83   val tptp_sign: bool -> string -> string
    84   val tptp_of_type_literal :
    85     bool -> type_literal -> name_pool option -> string * name_pool option
    86   val gen_tptp_cls : int * string * kind * string list * string list -> string
    87   val tptp_tfree_clause : string -> string
    88   val tptp_arity_clause : arity_clause -> string
    89   val tptp_classrel_clause : classrel_clause -> string
    90 end
    91 
    92 structure Sledgehammer_FOL_Clause : SLEDGEHAMMER_FOL_CLAUSE =
    93 struct
    94 
    95 open Sledgehammer_Util
    96 
    97 val schematic_var_prefix = "V_";
    98 val fixed_var_prefix = "v_";
    99 
   100 val tvar_prefix = "T_";
   101 val tfree_prefix = "t_";
   102 
   103 val clause_prefix = "cls_";
   104 val arclause_prefix = "clsarity_"
   105 val clrelclause_prefix = "clsrel_";
   106 
   107 val const_prefix = "c_";
   108 val tconst_prefix = "tc_";
   109 val class_prefix = "class_";
   110 
   111 fun union_all xss = fold (union (op =)) xss []
   112 
   113 (* Readable names for the more common symbolic functions. Do not mess with the
   114    last six entries of the table unless you know what you are doing. *)
   115 val const_trans_table =
   116   Symtab.make [(@{const_name "op ="}, "equal"),
   117                (@{const_name "op &"}, "and"),
   118                (@{const_name "op |"}, "or"),
   119                (@{const_name "op -->"}, "implies"),
   120                (@{const_name "op :"}, "in"),
   121                (@{const_name fequal}, "fequal"),
   122                (@{const_name COMBI}, "COMBI"),
   123                (@{const_name COMBK}, "COMBK"),
   124                (@{const_name COMBB}, "COMBB"),
   125                (@{const_name COMBC}, "COMBC"),
   126                (@{const_name COMBS}, "COMBS")]
   127 
   128 val type_const_trans_table =
   129   Symtab.make [(@{type_name "*"}, "prod"),
   130                (@{type_name "+"}, "sum")]
   131 
   132 (*Escaping of special characters.
   133   Alphanumeric characters are left unchanged.
   134   The character _ goes to __
   135   Characters in the range ASCII space to / go to _A to _P, respectively.
   136   Other printing characters go to _nnn where nnn is the decimal ASCII code.*)
   137 val A_minus_space = Char.ord #"A" - Char.ord #" ";
   138 
   139 fun stringN_of_int 0 _ = ""
   140   | stringN_of_int k n = stringN_of_int (k-1) (n div 10) ^ Int.toString (n mod 10);
   141 
   142 fun ascii_of_c c =
   143   if Char.isAlphaNum c then String.str c
   144   else if c = #"_" then "__"
   145   else if #" " <= c andalso c <= #"/"
   146        then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space))
   147   else if Char.isPrint c
   148        then ("_" ^ stringN_of_int 3 (Char.ord c))  (*fixed width, in case more digits follow*)
   149   else ""
   150 
   151 val ascii_of = String.translate ascii_of_c;
   152 
   153 (** Remove ASCII armouring from names in proof files **)
   154 
   155 (*We don't raise error exceptions because this code can run inside the watcher.
   156   Also, the errors are "impossible" (hah!)*)
   157 fun undo_ascii_aux rcs [] = String.implode(rev rcs)
   158   | undo_ascii_aux rcs [#"_"] = undo_ascii_aux (#"_"::rcs) []  (*ERROR*)
   159       (*Three types of _ escapes: __, _A to _P, _nnn*)
   160   | undo_ascii_aux rcs (#"_" :: #"_" :: cs) = undo_ascii_aux (#"_"::rcs) cs
   161   | undo_ascii_aux rcs (#"_" :: c :: cs) =
   162       if #"A" <= c andalso c<= #"P"  (*translation of #" " to #"/"*)
   163       then undo_ascii_aux (Char.chr(Char.ord c - A_minus_space) :: rcs) cs
   164       else
   165         let val digits = List.take (c::cs, 3) handle Subscript => []
   166         in
   167             case Int.fromString (String.implode digits) of
   168                 NONE => undo_ascii_aux (c:: #"_"::rcs) cs  (*ERROR*)
   169               | SOME n => undo_ascii_aux (Char.chr n :: rcs) (List.drop (cs, 2))
   170         end
   171   | undo_ascii_aux rcs (c::cs) = undo_ascii_aux (c::rcs) cs;
   172 
   173 val undo_ascii_of = undo_ascii_aux [] o String.explode;
   174 
   175 (* convert a list of strings into one single string; surrounded by brackets *)
   176 fun paren_pack [] = ""   (*empty argument list*)
   177   | paren_pack strings = "(" ^ commas strings ^ ")";
   178 
   179 fun tptp_clause strings = "(" ^ space_implode " | " strings ^ ")"
   180 
   181 (*Remove the initial ' character from a type variable, if it is present*)
   182 fun trim_type_var s =
   183   if s <> "" andalso String.sub(s,0) = #"'" then String.extract(s,1,NONE)
   184   else error ("trim_type: Malformed type variable encountered: " ^ s);
   185 
   186 fun ascii_of_indexname (v,0) = ascii_of v
   187   | ascii_of_indexname (v,i) = ascii_of v ^ "_" ^ Int.toString i;
   188 
   189 fun make_schematic_var v = schematic_var_prefix ^ (ascii_of_indexname v);
   190 fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x);
   191 
   192 fun make_schematic_type_var (x,i) =
   193       tvar_prefix ^ (ascii_of_indexname (trim_type_var x,i));
   194 fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x));
   195 
   196 val max_dfg_symbol_length =
   197   if is_new_spass_version then 1000000 (* arbitrary large number *) else 63
   198 
   199 (* HACK because SPASS 3.0 truncates identifiers to 63 characters. *)
   200 fun controlled_length dfg s =
   201   if dfg andalso size s > max_dfg_symbol_length then
   202     String.extract (s, 0, SOME (max_dfg_symbol_length div 2 - 1)) ^ "__" ^
   203     String.extract (s, size s - max_dfg_symbol_length div 2 + 1, NONE)
   204   else
   205     s
   206 
   207 fun lookup_const dfg c =
   208     case Symtab.lookup const_trans_table c of
   209         SOME c' => c'
   210       | NONE => controlled_length dfg (ascii_of c);
   211 
   212 fun lookup_type_const dfg c =
   213     case Symtab.lookup type_const_trans_table c of
   214         SOME c' => c'
   215       | NONE => controlled_length dfg (ascii_of c);
   216 
   217 (* "op =" MUST BE "equal" because it's built into ATPs. *)
   218 fun make_fixed_const _ (@{const_name "op ="}) = "equal"
   219   | make_fixed_const dfg c = const_prefix ^ lookup_const dfg c;
   220 
   221 fun make_fixed_type_const dfg c = tconst_prefix ^ lookup_type_const dfg c;
   222 
   223 fun make_type_class clas = class_prefix ^ ascii_of clas;
   224 
   225 
   226 (**** name pool ****)
   227  
   228 type name = string * string
   229 type name_pool = string Symtab.table * string Symtab.table
   230 
   231 fun empty_name_pool readable_names =
   232   if readable_names then SOME (`I Symtab.empty) else NONE
   233 
   234 fun pool_fold f xs z = pair z #> fold_rev (fn x => uncurry (f x)) xs
   235 fun pool_map f xs =
   236   pool_fold (fn x => fn ys => fn pool => f x pool |>> (fn y => y :: ys)) xs []
   237 
   238 fun add_nice_name full_name nice_prefix j the_pool =
   239   let
   240     val nice_name = nice_prefix ^ (if j = 0 then "" else "_" ^ Int.toString j)
   241   in
   242     case Symtab.lookup (snd the_pool) nice_name of
   243       SOME full_name' =>
   244       if full_name = full_name' then (nice_name, the_pool)
   245       else add_nice_name full_name nice_prefix (j + 1) the_pool
   246     | NONE =>
   247       (nice_name, (Symtab.update_new (full_name, nice_name) (fst the_pool),
   248                    Symtab.update_new (nice_name, full_name) (snd the_pool)))
   249   end
   250 
   251 fun translate_first_char f s =
   252   String.str (f (String.sub (s, 0))) ^ String.extract (s, 1, NONE)
   253 
   254 fun readable_name full_name s =
   255   let
   256     val s = s |> Long_Name.base_name
   257               |> fold remove_all ["\<^sub>", "\<^bsub>", "\<^esub>", "\<^isub>"]
   258     val s' = s |> explode |> rev |> dropwhile (curry (op =) "'")
   259     val s' =
   260       (s' |> rev
   261           |> implode
   262           |> String.translate
   263                  (fn c => if Char.isAlphaNum c orelse c = #"_" then String.str c
   264                           else ""))
   265       ^ replicate_string (String.size s - length s') "_"
   266     val s' =
   267       if s' = "" orelse not (Char.isAlpha (String.sub (s', 0))) then "X" ^ s'
   268       else s'
   269     (* Avoid "equal", since it's built into ATPs; and "op" is very ambiguous
   270        ("op &", "op |", etc.). *)
   271     val s' = if s' = "equal" orelse s' = "op" then full_name else s'
   272   in
   273     case (Char.isLower (String.sub (full_name, 0)),
   274           Char.isLower (String.sub (s', 0))) of
   275       (true, false) => translate_first_char Char.toLower s'
   276     | (false, true) => translate_first_char Char.toUpper s'
   277     | _ => s'
   278   end
   279 
   280 fun nice_name (full_name, _) NONE = (full_name, NONE)
   281   | nice_name (full_name, desired_name) (SOME the_pool) =
   282     case Symtab.lookup (fst the_pool) full_name of
   283       SOME nice_name => (nice_name, SOME the_pool)
   284     | NONE => add_nice_name full_name (readable_name full_name desired_name) 0
   285                             the_pool
   286               |> apsnd SOME
   287 
   288 (**** Definitions and functions for FOL clauses, for conversion to TPTP or DFG
   289       format ****)
   290 
   291 datatype kind = Axiom | Conjecture;
   292 
   293 type axiom_name = string;
   294 
   295 (**** Isabelle FOL clauses ****)
   296 
   297 datatype fol_type =
   298   TyVar of name |
   299   TyFree of name |
   300   TyConstr of name * fol_type list
   301 
   302 fun string_of_fol_type (TyVar sp) pool = nice_name sp pool
   303   | string_of_fol_type (TyFree sp) pool = nice_name sp pool
   304   | string_of_fol_type (TyConstr (sp, tys)) pool =
   305     let
   306       val (s, pool) = nice_name sp pool
   307       val (ss, pool) = pool_map string_of_fol_type tys pool
   308     in (s ^ paren_pack ss, pool) end
   309 
   310 (* The first component is the type class; the second is a TVar or TFree. *)
   311 datatype type_literal =
   312   TyLitVar of string * name |
   313   TyLitFree of string * name
   314 
   315 exception CLAUSE of string * term;
   316 
   317 (*Make literals for sorted type variables*)
   318 fun sorts_on_typs_aux (_, [])   = []
   319   | sorts_on_typs_aux ((x,i),  s::ss) =
   320       let val sorts = sorts_on_typs_aux ((x,i), ss)
   321       in
   322           if s = "HOL.type" then sorts
   323           else if i = ~1 then TyLitFree (make_type_class s, `make_fixed_type_var x) :: sorts
   324           else TyLitVar (make_type_class s, (make_schematic_type_var (x,i), x)) :: sorts
   325       end;
   326 
   327 fun sorts_on_typs (TFree (a,s)) = sorts_on_typs_aux ((a,~1),s)
   328   | sorts_on_typs (TVar (v,s))  = sorts_on_typs_aux (v,s);
   329 
   330 fun pred_of_sort (TyLitVar (s, _)) = (s, 1)
   331   | pred_of_sort (TyLitFree (s, _)) = (s, 1)
   332 
   333 (*Given a list of sorted type variables, return a list of type literals.*)
   334 fun add_type_literals Ts = fold (union (op =)) (map sorts_on_typs Ts) []
   335 
   336 (*The correct treatment of TFrees like 'a in lemmas (axiom clauses) is not clear.
   337   *  Ignoring them leads to unsound proofs, since we do nothing to ensure that 'a
   338     in a lemma has the same sort as 'a in the conjecture.
   339   * Deleting such clauses will lead to problems with locales in other use of local results
   340     where 'a is fixed. Probably we should delete clauses unless the sorts agree.
   341   * Currently we include a class constraint in the clause, exactly as with TVars.
   342 *)
   343 
   344 (** make axiom and conjecture clauses. **)
   345 
   346 fun get_tvar_strs [] = []
   347   | get_tvar_strs ((TVar (indx,s))::Ts) =
   348       insert (op =) (make_schematic_type_var indx) (get_tvar_strs Ts)
   349   | get_tvar_strs((TFree _)::Ts) = get_tvar_strs Ts
   350 
   351 
   352 
   353 (**** Isabelle arities ****)
   354 
   355 datatype arLit = TConsLit of class * string * string list
   356                | TVarLit of class * string;
   357 
   358 datatype arity_clause =
   359          ArityClause of {axiom_name: axiom_name,
   360                          conclLit: arLit,
   361                          premLits: arLit list};
   362 
   363 
   364 fun gen_TVars 0 = []
   365   | gen_TVars n = ("T_" ^ Int.toString n) :: gen_TVars (n-1);
   366 
   367 fun pack_sort(_,[])  = []
   368   | pack_sort(tvar, "HOL.type"::srt) = pack_sort(tvar, srt)   (*IGNORE sort "type"*)
   369   | pack_sort(tvar, cls::srt) =  (cls, tvar) :: pack_sort(tvar, srt);
   370 
   371 (*Arity of type constructor tcon :: (arg1,...,argN)res*)
   372 fun make_axiom_arity_clause dfg (tcons, axiom_name, (cls,args)) =
   373    let val tvars = gen_TVars (length args)
   374        val tvars_srts = ListPair.zip (tvars,args)
   375    in
   376       ArityClause {axiom_name = axiom_name, 
   377                    conclLit = TConsLit (cls, make_fixed_type_const dfg tcons, tvars),
   378                    premLits = map TVarLit (union_all(map pack_sort tvars_srts))}
   379    end;
   380 
   381 
   382 (**** Isabelle class relations ****)
   383 
   384 datatype classrel_clause =
   385          ClassrelClause of {axiom_name: axiom_name,
   386                             subclass: class,
   387                             superclass: class};
   388 
   389 (*Generate all pairs (sub,super) such that sub is a proper subclass of super in theory thy.*)
   390 fun class_pairs thy [] supers = []
   391   | class_pairs thy subs supers =
   392       let
   393         val class_less = Sorts.class_less (Sign.classes_of thy)
   394         fun add_super sub super = class_less (sub, super) ? cons (sub, super)
   395         fun add_supers sub = fold (add_super sub) supers
   396       in fold add_supers subs [] end
   397 
   398 fun make_classrel_clause (sub,super) =
   399   ClassrelClause {axiom_name = clrelclause_prefix ^ ascii_of sub ^ "_" ^ ascii_of super,
   400                   subclass = make_type_class sub,
   401                   superclass = make_type_class super};
   402 
   403 fun make_classrel_clauses thy subs supers =
   404   map make_classrel_clause (class_pairs thy subs supers);
   405 
   406 
   407 (** Isabelle arities **)
   408 
   409 fun arity_clause dfg _ _ (tcons, []) = []
   410   | arity_clause dfg seen n (tcons, ("HOL.type",_)::ars) =  (*ignore*)
   411       arity_clause dfg seen n (tcons,ars)
   412   | arity_clause dfg seen n (tcons, (ar as (class,_)) :: ars) =
   413       if member (op =) seen class then (*multiple arities for the same tycon, class pair*)
   414           make_axiom_arity_clause dfg (tcons, lookup_type_const dfg tcons ^ "_" ^ class ^ "_" ^ Int.toString n, ar) ::
   415           arity_clause dfg seen (n+1) (tcons,ars)
   416       else
   417           make_axiom_arity_clause dfg (tcons, lookup_type_const dfg tcons ^ "_" ^ class, ar) ::
   418           arity_clause dfg (class::seen) n (tcons,ars)
   419 
   420 fun multi_arity_clause dfg [] = []
   421   | multi_arity_clause dfg ((tcons, ars) :: tc_arlists) =
   422       arity_clause dfg [] 1 (tcons, ars) @ multi_arity_clause dfg tc_arlists
   423 
   424 (*Generate all pairs (tycon,class,sorts) such that tycon belongs to class in theory thy
   425   provided its arguments have the corresponding sorts.*)
   426 fun type_class_pairs thy tycons classes =
   427   let val alg = Sign.classes_of thy
   428       fun domain_sorts tycon = Sorts.mg_domain alg tycon o single
   429       fun add_class tycon class =
   430         cons (class, domain_sorts tycon class)
   431         handle Sorts.CLASS_ERROR _ => I
   432       fun try_classes tycon = (tycon, fold (add_class tycon) classes [])
   433   in  map try_classes tycons  end;
   434 
   435 (*Proving one (tycon, class) membership may require proving others, so iterate.*)
   436 fun iter_type_class_pairs thy tycons [] = ([], [])
   437   | iter_type_class_pairs thy tycons classes =
   438       let val cpairs = type_class_pairs thy tycons classes
   439           val newclasses = union_all (union_all (union_all (map (map #2 o #2) cpairs)))
   440             |> subtract (op =) classes |> subtract (op =) HOLogic.typeS
   441           val (classes', cpairs') = iter_type_class_pairs thy tycons newclasses
   442       in (union (op =) classes' classes, union (op =) cpairs' cpairs) end;
   443 
   444 fun make_arity_clauses_dfg dfg thy tycons classes =
   445   let val (classes', cpairs) = iter_type_class_pairs thy tycons classes
   446   in  (classes', multi_arity_clause dfg cpairs)  end;
   447 val make_arity_clauses = make_arity_clauses_dfg false;
   448 
   449 (**** Find occurrences of predicates in clauses ****)
   450 
   451 (*FIXME: multiple-arity checking doesn't work, as update_new is the wrong
   452   function (it flags repeated declarations of a function, even with the same arity)*)
   453 
   454 fun update_many keypairs = fold Symtab.update keypairs
   455 
   456 val add_type_sort_preds = update_many o map pred_of_sort o sorts_on_typs
   457 
   458 fun add_classrel_clause_preds (ClassrelClause {subclass, superclass, ...}) =
   459   Symtab.update (subclass, 1) #> Symtab.update (superclass, 1)
   460 
   461 fun class_of_arityLit (TConsLit (tclass, _, _)) = tclass
   462   | class_of_arityLit (TVarLit (tclass, _)) = tclass;
   463 
   464 fun add_arity_clause_preds (ArityClause {conclLit, premLits, ...}) =
   465   let
   466     val classes = map (make_type_class o class_of_arityLit)
   467                       (conclLit :: premLits)
   468   in fold (Symtab.update o rpair 1) classes end;
   469 
   470 (*** Find occurrences of functions in clauses ***)
   471 
   472 fun add_fol_type_funcs (TyVar _) = I
   473   | add_fol_type_funcs (TyFree (s, _)) = Symtab.update (s, 0)
   474   | add_fol_type_funcs (TyConstr ((s, _), tys)) =
   475     Symtab.update (s, length tys) #> fold add_fol_type_funcs tys
   476 
   477 (*TFrees are recorded as constants*)
   478 fun add_type_sort_funcs (TVar _, funcs) = funcs
   479   | add_type_sort_funcs (TFree (a, _), funcs) =
   480       Symtab.update (make_fixed_type_var a, 0) funcs
   481 
   482 fun add_arity_clause_funcs (ArityClause {conclLit,...}) funcs =
   483   let val TConsLit (_, tcons, tvars) = conclLit
   484   in  Symtab.update (tcons, length tvars) funcs  end;
   485 
   486 (*This type can be overlooked because it is built-in...*)
   487 val init_functab = Symtab.update ("tc_itself", 1) Symtab.empty;
   488 
   489 
   490 (**** String-oriented operations ****)
   491 
   492 fun string_of_clausename (cls_id,ax_name) =
   493     clause_prefix ^ ascii_of ax_name ^ "_" ^ Int.toString cls_id;
   494 
   495 fun string_of_type_clsname (cls_id,ax_name,idx) =
   496     string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx);
   497 
   498 
   499 (**** Producing DFG files ****)
   500 
   501 (*Attach sign in DFG syntax: false means negate.*)
   502 fun dfg_sign true s = s
   503   | dfg_sign false s = "not(" ^ s ^ ")"
   504 
   505 fun dfg_of_type_literal pos (TyLitVar (s, (s', _))) =
   506     dfg_sign pos (s ^ "(" ^ s' ^ ")")
   507   | dfg_of_type_literal pos (TyLitFree (s, (s', _))) =
   508     dfg_sign pos (s ^ "(" ^ s' ^ ")");
   509 
   510 (*Enclose the clause body by quantifiers, if necessary*)
   511 fun dfg_forall [] body = body
   512   | dfg_forall vars body = "forall([" ^ commas vars ^ "],\n" ^ body ^ ")"
   513 
   514 fun gen_dfg_cls (cls_id, ax_name, Axiom, lits, tylits, vars) =
   515       "clause( %(axiom)\n" ^
   516       dfg_forall vars ("or(" ^ commas (tylits@lits) ^ ")") ^ ",\n" ^
   517       string_of_clausename (cls_id,ax_name) ^  ").\n\n"
   518   | gen_dfg_cls (cls_id, ax_name, Conjecture, lits, _, vars) =
   519       "clause( %(negated_conjecture)\n" ^
   520       dfg_forall vars ("or(" ^ commas lits ^ ")") ^ ",\n" ^
   521       string_of_clausename (cls_id,ax_name) ^  ").\n\n";
   522 
   523 fun string_of_arity (name, num) =  "(" ^ name ^ "," ^ Int.toString num ^ ")"
   524 
   525 fun string_of_preds [] = ""
   526   | string_of_preds preds = "predicates[" ^ commas(map string_of_arity preds) ^ "].\n";
   527 
   528 fun string_of_funcs [] = ""
   529   | string_of_funcs funcs = "functions[" ^ commas(map string_of_arity funcs) ^ "].\n" ;
   530 
   531 fun string_of_symbols predstr funcstr =
   532   "list_of_symbols.\n" ^ predstr  ^ funcstr  ^ "end_of_list.\n\n";
   533 
   534 fun string_of_start name = "begin_problem(" ^ name ^ ").\n\n";
   535 
   536 fun string_of_descrip name =
   537   "list_of_descriptions.\nname({*" ^ name ^
   538   "*}).\nauthor({*Isabelle*}).\nstatus(unknown).\ndescription({*auto-generated*}).\nend_of_list.\n\n"
   539 
   540 fun dfg_tfree_clause tfree_lit =
   541   "clause( %(negated_conjecture)\n" ^ "or( " ^ tfree_lit ^ "),\n" ^ "tfree_tcs" ^ ").\n\n"
   542 
   543 fun dfg_of_arLit (TConsLit (c,t,args)) =
   544       dfg_sign true (make_type_class c ^ "(" ^ t ^ paren_pack args ^ ")")
   545   | dfg_of_arLit (TVarLit (c,str)) =
   546       dfg_sign false (make_type_class c ^ "(" ^ str ^ ")")
   547 
   548 fun dfg_classrelLits sub sup =  "not(" ^ sub ^ "(T)), " ^ sup ^ "(T)";
   549 
   550 fun dfg_classrel_clause (ClassrelClause {axiom_name,subclass,superclass,...}) =
   551   "clause(forall([T],\nor( " ^ dfg_classrelLits subclass superclass ^ ")),\n" ^
   552   axiom_name ^ ").\n\n";
   553 
   554 fun string_of_ar axiom_name = arclause_prefix ^ ascii_of axiom_name;
   555 
   556 fun dfg_arity_clause (ArityClause{axiom_name,conclLit,premLits,...}) =
   557   let val TConsLit (_,_,tvars) = conclLit
   558       val lits = map dfg_of_arLit (conclLit :: premLits)
   559   in
   560       "clause( %(axiom)\n" ^
   561       dfg_forall tvars ("or( " ^ commas lits ^ ")") ^ ",\n" ^
   562       string_of_ar axiom_name ^ ").\n\n"
   563   end;
   564 
   565 
   566 (**** Produce TPTP files ****)
   567 
   568 fun tptp_sign true s = s
   569   | tptp_sign false s = "~ " ^ s
   570 
   571 fun tptp_of_type_literal pos (TyLitVar (s, name)) =
   572     nice_name name #>> (fn s' => tptp_sign pos (s ^ "(" ^ s' ^ ")"))
   573   | tptp_of_type_literal pos (TyLitFree (s, name)) =
   574     nice_name name #>> (fn s' => tptp_sign pos (s ^ "(" ^ s' ^ ")"))
   575 
   576 fun tptp_cnf name kind formula =
   577   "cnf(" ^ name ^ ", " ^ kind ^ ",\n    " ^ formula ^ ").\n"
   578 
   579 fun gen_tptp_cls (cls_id, ax_name, Axiom, lits, tylits) =
   580       tptp_cnf (string_of_clausename (cls_id, ax_name)) "axiom"
   581                (tptp_clause (tylits @ lits))
   582   | gen_tptp_cls (cls_id, ax_name, Conjecture, lits, _) =
   583       tptp_cnf (string_of_clausename (cls_id, ax_name)) "negated_conjecture"
   584                (tptp_clause lits)
   585 
   586 fun tptp_tfree_clause tfree_lit =
   587     tptp_cnf "tfree_tcs" "negated_conjecture" (tptp_clause [tfree_lit])
   588 
   589 fun tptp_of_arLit (TConsLit (c,t,args)) =
   590       tptp_sign true (make_type_class c ^ "(" ^ t ^ paren_pack args ^ ")")
   591   | tptp_of_arLit (TVarLit (c,str)) =
   592       tptp_sign false (make_type_class c ^ "(" ^ str ^ ")")
   593 
   594 fun tptp_arity_clause (ArityClause{axiom_name,conclLit,premLits,...}) =
   595   tptp_cnf (string_of_ar axiom_name) "axiom"
   596            (tptp_clause (map tptp_of_arLit (conclLit :: premLits)))
   597 
   598 fun tptp_classrelLits sub sup =
   599   let val tvar = "(T)"
   600   in  tptp_clause [tptp_sign false (sub^tvar), tptp_sign true (sup^tvar)]  end;
   601 
   602 fun tptp_classrel_clause (ClassrelClause {axiom_name,subclass,superclass,...}) =
   603   tptp_cnf axiom_name "axiom" (tptp_classrelLits subclass superclass)
   604 
   605 end;