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