src/HOL/Tools/Sledgehammer/sledgehammer_fact_filter.ML
author blanchet
Tue Jun 22 17:07:39 2010 +0200 (2010-06-22 ago)
changeset 37503 c2dfa26b9da6
parent 37502 a8f7b25d5478
child 37504 4308d2bbbca8
permissions -rw-r--r--
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet@35826
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_fact_filter.ML
wenzelm@33309
     2
    Author:     Jia Meng, Cambridge University Computer Laboratory, NICTA
blanchet@36393
     3
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@33309
     4
*)
paulson@15452
     5
blanchet@35826
     6
signature SLEDGEHAMMER_FACT_FILTER =
wenzelm@16802
     7
sig
blanchet@37500
     8
  type cnf_thm = Sledgehammer_Fact_Preprocessor.cnf_thm
blanchet@35865
     9
  type classrel_clause = Sledgehammer_FOL_Clause.classrel_clause
blanchet@35865
    10
  type arity_clause = Sledgehammer_FOL_Clause.arity_clause
blanchet@35865
    11
  type hol_clause = Sledgehammer_HOL_Clause.hol_clause
blanchet@36473
    12
blanchet@35966
    13
  type relevance_override =
blanchet@35966
    14
    {add: Facts.ref list,
blanchet@35966
    15
     del: Facts.ref list,
blanchet@35966
    16
     only: bool}
blanchet@35966
    17
blanchet@37344
    18
  val name_thms_pair_from_ref :
blanchet@37344
    19
    Proof.context -> thm list -> Facts.ref -> string * thm list
paulson@22989
    20
  val tvar_classes_of_terms : term list -> string list
paulson@22989
    21
  val tfree_classes_of_terms : term list -> string list
paulson@22989
    22
  val type_consts_of_terms : theory -> term list -> string list
blanchet@37399
    23
  val is_quasi_fol_term : theory -> term -> bool
blanchet@37347
    24
  val relevant_facts :
blanchet@37347
    25
    bool -> bool -> real -> real -> bool -> int -> bool -> relevance_override
blanchet@37500
    26
    -> Proof.context * (thm list * 'a) -> thm list -> cnf_thm list
blanchet@36473
    27
  val prepare_clauses :
blanchet@37500
    28
    bool -> thm list -> cnf_thm list -> cnf_thm list -> theory
blanchet@37500
    29
    -> string vector
blanchet@37500
    30
       * (hol_clause list * hol_clause list * hol_clause list
blanchet@37500
    31
          * hol_clause list * classrel_clause list * arity_clause list)
paulson@15347
    32
end;
paulson@15347
    33
blanchet@35826
    34
structure Sledgehammer_Fact_Filter : SLEDGEHAMMER_FACT_FILTER =
paulson@15347
    35
struct
paulson@15347
    36
blanchet@35865
    37
open Sledgehammer_FOL_Clause
blanchet@35865
    38
open Sledgehammer_Fact_Preprocessor
blanchet@35865
    39
open Sledgehammer_HOL_Clause
blanchet@35826
    40
blanchet@35966
    41
type relevance_override =
blanchet@35966
    42
  {add: Facts.ref list,
blanchet@35966
    43
   del: Facts.ref list,
blanchet@35966
    44
   only: bool}
paulson@21070
    45
wenzelm@28477
    46
(***************************************************************)
wenzelm@28477
    47
(* Relevance Filtering                                         *)
wenzelm@28477
    48
(***************************************************************)
mengj@19194
    49
blanchet@35865
    50
fun strip_Trueprop (@{const Trueprop} $ t) = t
paulson@24958
    51
  | strip_Trueprop t = t;
mengj@19194
    52
paulson@24287
    53
(*** constants with types ***)
paulson@24287
    54
paulson@24287
    55
(*An abstraction of Isabelle types*)
paulson@24287
    56
datatype const_typ =  CTVar | CType of string * const_typ list
paulson@24287
    57
paulson@24287
    58
(*Is the second type an instance of the first one?*)
paulson@24287
    59
fun match_type (CType(con1,args1)) (CType(con2,args2)) = 
paulson@24287
    60
      con1=con2 andalso match_types args1 args2
paulson@24287
    61
  | match_type CTVar _ = true
paulson@24287
    62
  | match_type _ CTVar = false
paulson@24287
    63
and match_types [] [] = true
paulson@24287
    64
  | match_types (a1::as1) (a2::as2) = match_type a1 a2 andalso match_types as1 as2;
paulson@24287
    65
paulson@24287
    66
(*Is there a unifiable constant?*)
paulson@24287
    67
fun uni_mem gctab (c,c_typ) =
paulson@24287
    68
  case Symtab.lookup gctab c of
paulson@24287
    69
      NONE => false
paulson@24287
    70
    | SOME ctyps_list => exists (match_types c_typ) ctyps_list;
paulson@24287
    71
  
paulson@24287
    72
(*Maps a "real" type to a const_typ*)
paulson@24287
    73
fun const_typ_of (Type (c,typs)) = CType (c, map const_typ_of typs) 
paulson@24287
    74
  | const_typ_of (TFree _) = CTVar
paulson@24287
    75
  | const_typ_of (TVar _) = CTVar
paulson@24287
    76
paulson@24287
    77
(*Pairs a constant with the list of its type instantiations (using const_typ)*)
paulson@24287
    78
fun const_with_typ thy (c,typ) = 
paulson@24287
    79
    let val tvars = Sign.const_typargs thy (c,typ)
paulson@24287
    80
    in (c, map const_typ_of tvars) end
paulson@24287
    81
    handle TYPE _ => (c,[]);   (*Variable (locale constant): monomorphic*)   
paulson@24287
    82
paulson@24287
    83
(*Add a const/type pair to the table, but a [] entry means a standard connective,
paulson@24287
    84
  which we ignore.*)
blanchet@37502
    85
fun add_const_type_to_table (c, ctyps) =
blanchet@37502
    86
  Symtab.map_default (c, [ctyps])
blanchet@37502
    87
                     (fn [] => [] | ctypss => insert (op =) ctyps ctypss)
paulson@24287
    88
paulson@24287
    89
(*Free variables are included, as well as constants, to handle locales*)
blanchet@37502
    90
fun add_term_consts_typs_rm thy (Const x) =
blanchet@37502
    91
    add_const_type_to_table (const_with_typ thy x)
blanchet@37502
    92
  | add_term_consts_typs_rm thy (Free x) =
blanchet@37502
    93
    add_const_type_to_table (const_with_typ thy x)
blanchet@37502
    94
  | add_term_consts_typs_rm _ (Const (@{const_name skolem_id}, _) $ _) = I
blanchet@37502
    95
  | add_term_consts_typs_rm thy (t $ u) =
blanchet@37502
    96
    add_term_consts_typs_rm thy t #> add_term_consts_typs_rm thy u
blanchet@37502
    97
  | add_term_consts_typs_rm thy (Abs (_, _, t)) = add_term_consts_typs_rm thy t
blanchet@37502
    98
  | add_term_consts_typs_rm _ _ = I
paulson@24287
    99
blanchet@37502
   100
blanchet@37502
   101
(* Including equality in this list might be expected to stop rules like
blanchet@37502
   102
   subset_antisym from being chosen, but for some reason filtering works better
blanchet@37502
   103
   with them listed. The logical signs All, Ex, &, and --> are omitted because
blanchet@37502
   104
   any remaining occurrences must be within comprehensions. *)
blanchet@37502
   105
val standard_consts =
blanchet@37502
   106
  [@{const_name Trueprop}, @{const_name "==>"}, @{const_name all},
blanchet@37502
   107
   @{const_name "=="}, @{const_name "op |"}, @{const_name Not},
blanchet@37502
   108
   @{const_name "op ="}];
paulson@24287
   109
paulson@24287
   110
val null_const_tab : const_typ list list Symtab.table = 
blanchet@37502
   111
    fold (Symtab.update o rpair []) standard_consts Symtab.empty
paulson@24287
   112
blanchet@37502
   113
fun get_goal_consts_typs thy goals =
blanchet@37502
   114
  fold (add_term_consts_typs_rm thy) goals null_const_tab
paulson@24287
   115
paulson@24287
   116
(*Inserts a dummy "constant" referring to the theory name, so that relevance
paulson@24287
   117
  takes the given theory into account.*)
blanchet@36220
   118
fun const_prop_of theory_relevant th =
blanchet@36220
   119
 if theory_relevant then
paulson@24287
   120
  let val name = Context.theory_name (theory_of_thm th)
paulson@24287
   121
      val t = Const (name ^ ". 1", HOLogic.boolT)
paulson@24287
   122
  in  t $ prop_of th  end
paulson@24287
   123
 else prop_of th;
paulson@24287
   124
paulson@24287
   125
(**** Constant / Type Frequencies ****)
paulson@24287
   126
paulson@24287
   127
(*A two-dimensional symbol table counts frequencies of constants. It's keyed first by
paulson@24287
   128
  constant name and second by its list of type instantiations. For the latter, we need
paulson@24287
   129
  a linear ordering on type const_typ list.*)
paulson@24287
   130
  
paulson@24287
   131
local
paulson@24287
   132
paulson@24287
   133
fun cons_nr CTVar = 0
paulson@24287
   134
  | cons_nr (CType _) = 1;
paulson@24287
   135
paulson@24287
   136
in
paulson@24287
   137
paulson@24287
   138
fun const_typ_ord TU =
paulson@24287
   139
  case TU of
paulson@24287
   140
    (CType (a, Ts), CType (b, Us)) =>
paulson@24287
   141
      (case fast_string_ord(a,b) of EQUAL => dict_ord const_typ_ord (Ts,Us) | ord => ord)
paulson@24287
   142
  | (T, U) => int_ord (cons_nr T, cons_nr U);
paulson@24287
   143
paulson@24287
   144
end;
paulson@24287
   145
wenzelm@31971
   146
structure CTtab = Table(type key = const_typ list val ord = dict_ord const_typ_ord);
paulson@24287
   147
blanchet@37503
   148
fun count_axiom_consts theory_relevant thy (thm, _) = 
blanchet@37503
   149
  let
blanchet@37503
   150
    fun do_const (a, T) =
blanchet@37503
   151
      let val (c, cts) = const_with_typ thy (a,T) in
blanchet@37503
   152
        (* Two-dimensional table update. Constant maps to types maps to
blanchet@37503
   153
           count. *)
blanchet@37503
   154
        CTtab.map_default (cts, 0) (Integer.add 1)
blanchet@37503
   155
        |> Symtab.map_default (c, CTtab.empty)
blanchet@37503
   156
      end
blanchet@37503
   157
    fun do_term (Const x) = do_const x
blanchet@37503
   158
      | do_term (Free x) = do_const x
blanchet@37503
   159
      | do_term (Const (@{const_name skolem_id}, _) $ _) = I
blanchet@37503
   160
      | do_term (t $ u) = do_term t #> do_term u
blanchet@37503
   161
      | do_term (Abs (_, _, t)) = do_term t
blanchet@37503
   162
      | do_term _ = I
blanchet@37503
   163
  in do_term (const_prop_of theory_relevant thm) end
paulson@24287
   164
paulson@24287
   165
paulson@24287
   166
(**** Actual Filtering Code ****)
paulson@24287
   167
paulson@24287
   168
(*The frequency of a constant is the sum of those of all instances of its type.*)
paulson@24287
   169
fun const_frequency ctab (c, cts) =
blanchet@36185
   170
  CTtab.fold (fn (cts', m) => match_types cts cts' ? Integer.add m)
blanchet@36185
   171
             (the (Symtab.lookup ctab c)) 0
paulson@24287
   172
blanchet@37503
   173
(*A surprising number of theorems contain only a few significant constants.
blanchet@37503
   174
  These include all induction rules, and other general theorems. Filtering
blanchet@37503
   175
  theorems in clause form reveals these complexities in the form of Skolem 
blanchet@37503
   176
  functions. If we were instead to filter theorems in their natural form,
blanchet@37503
   177
  some other method of measuring theorem complexity would become necessary.*)
blanchet@37503
   178
blanchet@37503
   179
(* "log" seems best in practice. A constant function of one ignores the constant
blanchet@37503
   180
   frequencies. *)
blanchet@37503
   181
fun log_weight2 (x:real) = 1.0 + 2.0 / Math.ln (x + 1.0)
blanchet@37503
   182
blanchet@37503
   183
(* Computes a constant's weight, as determined by its frequency. *)
blanchet@37503
   184
val ct_weight = log_weight2 o real oo const_frequency
paulson@24287
   185
paulson@24287
   186
(*Relevant constants are weighted according to frequency, 
paulson@24287
   187
  but irrelevant constants are simply counted. Otherwise, Skolem functions,
paulson@24287
   188
  which are rare, would harm a clause's chances of being picked.*)
paulson@24287
   189
fun clause_weight ctab gctyps consts_typs =
paulson@24287
   190
    let val rel = filter (uni_mem gctyps) consts_typs
blanchet@37503
   191
        val rel_weight = fold (curry Real.+ o ct_weight ctab) rel 0.0
paulson@24287
   192
    in
wenzelm@32960
   193
        rel_weight / (rel_weight + real (length consts_typs - length rel))
paulson@24287
   194
    end;
paulson@24287
   195
    
paulson@24287
   196
(*Multiplies out to a list of pairs: 'a * 'b list -> ('a * 'b) list -> ('a * 'b) list*)
wenzelm@30190
   197
fun add_expand_pairs (x,ys) xys = List.foldl (fn (y,acc) => (x,y)::acc) xys ys;
paulson@24287
   198
paulson@24287
   199
fun consts_typs_of_term thy t = 
blanchet@37502
   200
  let val tab = add_term_consts_typs_rm thy t null_const_tab in
blanchet@37502
   201
    Symtab.fold add_expand_pairs tab []
blanchet@37502
   202
  end
paulson@24287
   203
blanchet@36220
   204
fun pair_consts_typs_axiom theory_relevant thy (p as (thm, _)) =
blanchet@36220
   205
  (p, (consts_typs_of_term thy (const_prop_of theory_relevant thm)));
paulson@24287
   206
paulson@24287
   207
exception ConstFree;
paulson@24287
   208
fun dest_ConstFree (Const aT) = aT
paulson@24287
   209
  | dest_ConstFree (Free aT) = aT
paulson@24287
   210
  | dest_ConstFree _ = raise ConstFree;
paulson@24287
   211
paulson@24287
   212
(*Look for definitions of the form f ?x1 ... ?xn = t, but not reversed.*)
wenzelm@32994
   213
fun defines thy thm gctypes =
paulson@24287
   214
    let val tm = prop_of thm
wenzelm@32960
   215
        fun defs lhs rhs =
paulson@24287
   216
            let val (rator,args) = strip_comb lhs
wenzelm@32960
   217
                val ct = const_with_typ thy (dest_ConstFree rator)
haftmann@33037
   218
            in
haftmann@33037
   219
              forall is_Var args andalso uni_mem gctypes ct andalso
haftmann@33038
   220
                subset (op =) (Term.add_vars rhs [], Term.add_vars lhs [])
paulson@24287
   221
            end
wenzelm@32960
   222
            handle ConstFree => false
paulson@24287
   223
    in    
blanchet@35963
   224
        case tm of
blanchet@35963
   225
          @{const Trueprop} $ (Const (@{const_name "op ="}, _) $ lhs $ rhs) => 
blanchet@35963
   226
            defs lhs rhs 
blanchet@35963
   227
        | _ => false
paulson@24287
   228
    end;
paulson@24287
   229
blanchet@37500
   230
type annotated_clause = cnf_thm * ((string * const_typ list) list)
paulson@24287
   231
       
paulson@24287
   232
(*For a reverse sort, putting the largest values first.*)
blanchet@37500
   233
fun compare_pairs ((_, w1), (_, w2)) = Real.compare (w2, w1)
paulson@24287
   234
paulson@24287
   235
(*Limit the number of new clauses, to prevent runaway acceptance.*)
blanchet@37500
   236
fun take_best max_new (newpairs : (annotated_clause * real) list) =
paulson@24287
   237
  let val nnew = length newpairs
paulson@24287
   238
  in
wenzelm@28477
   239
    if nnew <= max_new then (map #1 newpairs, [])
paulson@24287
   240
    else 
paulson@24287
   241
      let val cls = sort compare_pairs newpairs
wenzelm@28477
   242
          val accepted = List.take (cls, max_new)
paulson@24287
   243
      in
blanchet@35865
   244
        trace_msg (fn () => ("Number of candidates, " ^ Int.toString nnew ^ 
wenzelm@32960
   245
                       ", exceeds the limit of " ^ Int.toString (max_new)));
blanchet@35865
   246
        trace_msg (fn () => ("Effective pass mark: " ^ Real.toString (#2 (List.last accepted))));
blanchet@35865
   247
        trace_msg (fn () => "Actually passed: " ^
blanchet@37500
   248
          space_implode ", " (map (fn (((_,((name,_), _)),_),_) => name) accepted));
paulson@24287
   249
wenzelm@32960
   250
        (map #1 accepted, map #1 (List.drop (cls, max_new)))
paulson@24287
   251
      end
paulson@24287
   252
  end;
paulson@24287
   253
blanchet@36922
   254
fun relevant_clauses ctxt relevance_convergence defs_relevant max_new
blanchet@37498
   255
                     ({add, del, ...} : relevance_override) ctab =
blanchet@36182
   256
  let
blanchet@37344
   257
    val thy = ProofContext.theory_of ctxt
blanchet@37501
   258
    val add_thms = maps (ProofContext.get_fact ctxt) add
blanchet@37501
   259
    val del_thms = maps (ProofContext.get_fact ctxt) del
blanchet@37344
   260
    fun iter threshold rel_consts =
blanchet@36182
   261
      let
blanchet@36182
   262
        fun relevant ([], _) [] = []  (* Nothing added this iteration *)
blanchet@37344
   263
          | relevant (newpairs, rejects) [] =
blanchet@36182
   264
            let
blanchet@36182
   265
              val (newrels, more_rejects) = take_best max_new newpairs
blanchet@36182
   266
              val new_consts = maps #2 newrels
blanchet@37502
   267
              val rel_consts' = fold add_const_type_to_table new_consts rel_consts
blanchet@37344
   268
              val threshold =
blanchet@37344
   269
                threshold + (1.0 - threshold) / relevance_convergence
wenzelm@32960
   270
            in
blanchet@36182
   271
              trace_msg (fn () => "relevant this iteration: " ^
blanchet@36182
   272
                                  Int.toString (length newrels));
blanchet@37344
   273
              map #1 newrels @ iter threshold rel_consts'
blanchet@37344
   274
                  (more_rejects @ rejects)
wenzelm@32960
   275
            end
blanchet@36182
   276
          | relevant (newrels, rejects)
blanchet@37503
   277
                     ((ax as (clsthm as (_, ((name, n), orig_th)),
blanchet@37501
   278
                              consts_typs)) :: axs) =
blanchet@35966
   279
            let
blanchet@37501
   280
              val weight = if member Thm.eq_thm add_thms orig_th then 1.0
blanchet@37501
   281
                           else if member Thm.eq_thm del_thms orig_th then 0.0
blanchet@35966
   282
                           else clause_weight ctab rel_consts consts_typs
wenzelm@32960
   283
            in
blanchet@37344
   284
              if weight >= threshold orelse
blanchet@36922
   285
                 (defs_relevant andalso defines thy (#1 clsthm) rel_consts) then
blanchet@36182
   286
                (trace_msg (fn () => name ^ " clause " ^ Int.toString n ^ 
blanchet@36182
   287
                                     " passes: " ^ Real.toString weight);
blanchet@36182
   288
                relevant ((ax, weight) :: newrels, rejects) axs)
blanchet@36182
   289
              else
blanchet@36182
   290
                relevant (newrels, ax :: rejects) axs
wenzelm@32960
   291
            end
blanchet@36182
   292
        in
blanchet@37344
   293
          trace_msg (fn () => "relevant_clauses, current threshold: " ^
blanchet@37344
   294
                              Real.toString threshold);
blanchet@36182
   295
          relevant ([], [])
blanchet@36182
   296
        end
blanchet@36182
   297
  in iter end
wenzelm@32960
   298
        
blanchet@36922
   299
fun relevance_filter ctxt relevance_threshold relevance_convergence
blanchet@36922
   300
                     defs_relevant max_new theory_relevant relevance_override
blanchet@37500
   301
                     thy (axioms : cnf_thm list) goals = 
blanchet@35966
   302
  if relevance_threshold > 0.0 then
blanchet@35963
   303
    let
blanchet@37503
   304
      val const_tab = fold (count_axiom_consts theory_relevant thy) axioms
blanchet@37503
   305
                           Symtab.empty
paulson@24287
   306
      val goal_const_tab = get_goal_consts_typs thy goals
blanchet@35963
   307
      val _ =
blanchet@35963
   308
        trace_msg (fn () => "Initial constants: " ^
blanchet@35963
   309
                            commas (Symtab.keys goal_const_tab))
blanchet@35963
   310
      val relevant =
blanchet@36922
   311
        relevant_clauses ctxt relevance_convergence defs_relevant max_new
blanchet@37344
   312
                         relevance_override const_tab relevance_threshold
blanchet@36922
   313
                         goal_const_tab
blanchet@36220
   314
                         (map (pair_consts_typs_axiom theory_relevant thy)
blanchet@36220
   315
                              axioms)
blanchet@35963
   316
    in
blanchet@35963
   317
      trace_msg (fn () => "Total relevant: " ^ Int.toString (length relevant));
blanchet@35963
   318
      relevant
blanchet@35963
   319
    end
blanchet@35963
   320
  else
blanchet@35963
   321
    axioms;
paulson@24287
   322
paulson@24287
   323
(***************************************************************)
mengj@19768
   324
(* Retrieving and filtering lemmas                             *)
mengj@19768
   325
(***************************************************************)
mengj@19768
   326
paulson@33022
   327
(*** retrieve lemmas and filter them ***)
mengj@19768
   328
mengj@19768
   329
(*Hashing to detect duplicate and variant clauses, e.g. from the [iff] attribute*)
mengj@19768
   330
paulson@22382
   331
fun setinsert (x,s) = Symtab.update (x,()) s;
mengj@19768
   332
paulson@20757
   333
(*Reject theorems with names like "List.filter.filter_list_def" or
paulson@21690
   334
  "Accessible_Part.acc.defs", as these are definitions arising from packages.*)
paulson@20757
   335
fun is_package_def a =
wenzelm@30364
   336
  let val names = Long_Name.explode a
paulson@21690
   337
  in
paulson@21690
   338
     length names > 2 andalso
paulson@21690
   339
     not (hd names = "local") andalso
paulson@21690
   340
     String.isSuffix "_def" a  orelse  String.isSuffix "_defs" a
paulson@21690
   341
  end;
paulson@20757
   342
blanchet@36061
   343
fun mk_clause_table xs =
blanchet@36061
   344
  fold (Termtab.update o `(prop_of o fst)) xs Termtab.empty
paulson@22382
   345
blanchet@36061
   346
fun make_unique xs =
blanchet@36061
   347
  Termtab.fold (cons o snd) (mk_clause_table xs) []
mengj@19768
   348
blanchet@36061
   349
(* Remove existing axiom clauses from the conjecture clauses, as this can
blanchet@36061
   350
   dramatically boost an ATP's performance (for some reason). *)
blanchet@36061
   351
fun subtract_cls ax_clauses =
blanchet@36061
   352
  filter_out (Termtab.defined (mk_clause_table ax_clauses) o prop_of)
mengj@19768
   353
blanchet@37345
   354
fun all_name_thms_pairs respect_no_atp ctxt chained_ths =
paulson@22382
   355
  let
wenzelm@26675
   356
    val global_facts = PureThy.facts_of (ProofContext.theory_of ctxt);
wenzelm@26278
   357
    val local_facts = ProofContext.facts_of ctxt;
wenzelm@33641
   358
    val full_space =
wenzelm@33641
   359
      Name_Space.merge (Facts.space_of global_facts, Facts.space_of local_facts);
wenzelm@33641
   360
wenzelm@33641
   361
    fun valid_facts facts =
wenzelm@33641
   362
      (facts, []) |-> Facts.fold_static (fn (name, ths0) =>
blanchet@37399
   363
        if Facts.is_concealed facts name orelse
blanchet@37399
   364
           (respect_no_atp andalso is_package_def name) orelse
blanchet@37399
   365
           member (op =) multi_base_blacklist (Long_Name.base_name name) then
blanchet@37399
   366
          I
blanchet@37399
   367
        else
blanchet@37399
   368
          let
blanchet@37399
   369
            fun check_thms a =
blanchet@37399
   370
              (case try (ProofContext.get_thms ctxt) a of
blanchet@37399
   371
                NONE => false
blanchet@37399
   372
              | SOME ths1 => Thm.eq_thms (ths0, ths1));
wenzelm@33641
   373
blanchet@37399
   374
            val name1 = Facts.extern facts name;
blanchet@37399
   375
            val name2 = Name_Space.extern full_space name;
blanchet@37399
   376
            val ths = filter_out is_theorem_bad_for_atps ths0;
blanchet@37399
   377
          in
blanchet@37399
   378
            case find_first check_thms [name1, name2, name] of
blanchet@37399
   379
              NONE => I
blanchet@37399
   380
            | SOME name' =>
blanchet@37399
   381
              cons (name' |> forall (member Thm.eq_thm chained_ths) ths
blanchet@37399
   382
                             ? prefix chained_prefix, ths)
blanchet@37399
   383
          end)
wenzelm@26675
   384
  in valid_facts global_facts @ valid_facts local_facts end;
paulson@21224
   385
wenzelm@33309
   386
fun multi_name a th (n, pairs) =
wenzelm@33309
   387
  (n + 1, (a ^ "(" ^ Int.toString n ^ ")", th) :: pairs);
paulson@21224
   388
blanchet@37498
   389
fun add_names (_, []) pairs = pairs
blanchet@37399
   390
  | add_names (a, [th]) pairs = (a, th) :: pairs
blanchet@37399
   391
  | add_names (a, ths) pairs = #2 (fold (multi_name a) ths (1, pairs))
paulson@21224
   392
paulson@21290
   393
fun is_multi (a, ths) = length ths > 1 orelse String.isSuffix ".axioms" a;
paulson@21290
   394
blanchet@36550
   395
(* The single-name theorems go after the multiple-name ones, so that single
blanchet@36550
   396
   names are preferred when both are available. *)
blanchet@37344
   397
fun name_thm_pairs respect_no_atp ctxt name_thms_pairs =
wenzelm@33309
   398
  let
blanchet@37344
   399
    val (mults, singles) = List.partition is_multi name_thms_pairs
blanchet@37399
   400
    val ps = [] |> fold add_names singles |> fold add_names mults
blanchet@36060
   401
  in ps |> respect_no_atp ? filter_out (No_ATPs.member ctxt o snd) end;
paulson@21224
   402
blanchet@37344
   403
fun is_named ("", th) =
blanchet@37344
   404
    (warning ("No name for theorem " ^
blanchet@37344
   405
              Display.string_of_thm_without_context th); false)
blanchet@37344
   406
  | is_named _ = true
blanchet@37344
   407
fun checked_name_thm_pairs respect_no_atp ctxt =
blanchet@37344
   408
  name_thm_pairs respect_no_atp ctxt
blanchet@37344
   409
  #> tap (fn ps => trace_msg
blanchet@37344
   410
                        (fn () => ("Considering " ^ Int.toString (length ps) ^
blanchet@37344
   411
                                   " theorems")))
blanchet@37344
   412
  #> filter is_named
paulson@19894
   413
blanchet@37344
   414
fun name_thms_pair_from_ref ctxt chained_ths xref =
blanchet@37344
   415
  let
blanchet@37344
   416
    val ths = ProofContext.get_fact ctxt xref
blanchet@37344
   417
    val name = Facts.string_of_ref xref
blanchet@37344
   418
               |> forall (member Thm.eq_thm chained_ths) ths
blanchet@37344
   419
                  ? prefix chained_prefix
blanchet@37344
   420
  in (name, ths) end
blanchet@37344
   421
mengj@19768
   422
paulson@21290
   423
(***************************************************************)
paulson@21290
   424
(* Type Classes Present in the Axiom or Conjecture Clauses     *)
paulson@21290
   425
(***************************************************************)
paulson@21290
   426
wenzelm@32952
   427
fun add_classes (sorts, cset) = List.foldl setinsert cset (flat sorts);
paulson@21290
   428
paulson@21290
   429
(*Remove this trivial type class*)
blanchet@35865
   430
fun delete_type cset = Symtab.delete_safe (the_single @{sort HOL.type}) cset;
paulson@21290
   431
paulson@21290
   432
fun tvar_classes_of_terms ts =
wenzelm@29270
   433
  let val sorts_list = map (map #2 o OldTerm.term_tvars) ts
wenzelm@30190
   434
  in  Symtab.keys (delete_type (List.foldl add_classes Symtab.empty sorts_list))  end;
paulson@21290
   435
paulson@21290
   436
fun tfree_classes_of_terms ts =
wenzelm@29270
   437
  let val sorts_list = map (map #2 o OldTerm.term_tfrees) ts
wenzelm@30190
   438
  in  Symtab.keys (delete_type (List.foldl add_classes Symtab.empty sorts_list))  end;
paulson@20526
   439
paulson@21373
   440
(*fold type constructors*)
paulson@21373
   441
fun fold_type_consts f (Type (a, Ts)) x = fold (fold_type_consts f) Ts (f (a,x))
wenzelm@32994
   442
  | fold_type_consts _ _ x = x;
paulson@21373
   443
paulson@21373
   444
val add_type_consts_in_type = fold_type_consts setinsert;
paulson@21373
   445
paulson@21397
   446
(*Type constructors used to instantiate overloaded constants are the only ones needed.*)
paulson@21397
   447
fun add_type_consts_in_term thy =
paulson@21397
   448
  let val const_typargs = Sign.const_typargs thy
paulson@21397
   449
      fun add_tcs (Const cT) x = fold add_type_consts_in_type (const_typargs cT) x
wenzelm@32994
   450
        | add_tcs (Abs (_, _, u)) x = add_tcs u x
paulson@21397
   451
        | add_tcs (t $ u) x = add_tcs t (add_tcs u x)
paulson@21397
   452
        | add_tcs _ x = x
paulson@21397
   453
  in  add_tcs  end
paulson@21373
   454
paulson@21397
   455
fun type_consts_of_terms thy ts =
paulson@21397
   456
  Symtab.keys (fold (add_type_consts_in_term thy) ts Symtab.empty);
paulson@21373
   457
paulson@21373
   458
mengj@19194
   459
(***************************************************************)
mengj@19194
   460
(* ATP invocation methods setup                                *)
mengj@19194
   461
(***************************************************************)
mengj@19194
   462
blanchet@37410
   463
fun is_quasi_fol_term thy =
blanchet@37410
   464
  Meson.is_fol_term thy o snd o conceal_skolem_somes ~1 []
blanchet@37399
   465
paulson@20526
   466
(*Ensures that no higher-order theorems "leak out"*)
blanchet@37399
   467
fun restrict_to_logic thy true cls =
blanchet@37399
   468
    filter (is_quasi_fol_term thy o prop_of o fst) cls
blanchet@37498
   469
  | restrict_to_logic _ false cls = cls
paulson@20526
   470
blanchet@37347
   471
(**** Predicates to detect unwanted clauses (prolific or likely to cause
blanchet@37347
   472
      unsoundness) ****)
paulson@21470
   473
paulson@21470
   474
(** Too general means, positive equality literal with a variable X as one operand,
paulson@21470
   475
  when X does not occur properly in the other operand. This rules out clearly
paulson@21470
   476
  inconsistent clauses such as V=a|V=b, though it by no means guarantees soundness. **)
wenzelm@21588
   477
blanchet@37348
   478
fun var_occurs_in_term ix =
blanchet@37348
   479
  let
blanchet@37348
   480
    fun aux (Var (jx, _)) = (ix = jx)
blanchet@37348
   481
      | aux (t1 $ t2) = aux t1 orelse aux t2
blanchet@37348
   482
      | aux (Abs (_, _, t)) = aux t
blanchet@37348
   483
      | aux _ = false
blanchet@37348
   484
  in aux end
paulson@21470
   485
blanchet@37348
   486
fun is_record_type T = not (null (Record.dest_recTs T))
paulson@21470
   487
paulson@21470
   488
(*Unwanted equalities include
paulson@21470
   489
  (1) those between a variable that does not properly occur in the second operand,
paulson@21470
   490
  (2) those between a variable and a record, since these seem to be prolific "cases" thms
wenzelm@21588
   491
*)
blanchet@37348
   492
fun too_general_eqterms (Var (ix,T), t) =
blanchet@37348
   493
    not (var_occurs_in_term ix t) orelse is_record_type T
paulson@21470
   494
  | too_general_eqterms _ = false;
paulson@21470
   495
blanchet@35865
   496
fun too_general_equality (Const (@{const_name "op ="}, _) $ x $ y) =
paulson@21470
   497
      too_general_eqterms (x,y) orelse too_general_eqterms(y,x)
paulson@21470
   498
  | too_general_equality _ = false;
paulson@21470
   499
wenzelm@29267
   500
fun has_typed_var tycons = exists_subterm
wenzelm@29267
   501
  (fn Var (_, Type (a, _)) => member (op =) tycons a | _ => false);
paulson@21431
   502
blanchet@37347
   503
(* Clauses are forbidden to contain variables of these types. The typical reason
blanchet@37347
   504
   is that they lead to unsoundness. Note that "unit" satisfies numerous
blanchet@37347
   505
   equations like "?x = ()". The resulting clause will have no type constraint,
blanchet@37347
   506
   yielding false proofs. Even "bool" leads to many unsound proofs, though only
blanchet@37347
   507
   for higher-order problems. *)
blanchet@37347
   508
val dangerous_types = [@{type_name unit}, @{type_name bool}];
paulson@22217
   509
blanchet@37347
   510
(* Clauses containing variables of type "unit" or "bool" or of the form
blanchet@37347
   511
   "?x = A | ?x = B | ?x = C" are likely to lead to unsound proofs if types are
blanchet@37347
   512
   omitted. *)
blanchet@37347
   513
fun is_dangerous_term _ @{prop True} = true
blanchet@37347
   514
  | is_dangerous_term full_types t =
blanchet@37347
   515
    not full_types andalso 
blanchet@37347
   516
    (has_typed_var dangerous_types t orelse
blanchet@37347
   517
     forall too_general_equality (HOLogic.disjuncts (strip_Trueprop t)))
paulson@21470
   518
blanchet@37347
   519
fun remove_dangerous_clauses full_types add_thms =
blanchet@37501
   520
  filter_out (fn (cnf_th, (_, orig_th)) =>
blanchet@37501
   521
                 not (member Thm.eq_thm add_thms orig_th) andalso
blanchet@37501
   522
                 is_dangerous_term full_types (prop_of cnf_th))
paulson@21431
   523
blanchet@37399
   524
fun is_fol_goal thy = forall (Meson.is_fol_term thy) o map prop_of
immler@30536
   525
blanchet@37347
   526
fun relevant_facts full_types respect_no_atp relevance_threshold
blanchet@37347
   527
                   relevance_convergence defs_relevant max_new theory_relevant
blanchet@37347
   528
                   (relevance_override as {add, del, only})
blanchet@37347
   529
                   (ctxt, (chained_ths, _)) goal_cls =
blanchet@36185
   530
  if (only andalso null add) orelse relevance_threshold > 1.0 then
blanchet@36185
   531
    []
blanchet@36185
   532
  else
blanchet@36185
   533
    let
blanchet@36185
   534
      val thy = ProofContext.theory_of ctxt
blanchet@37345
   535
      val has_override = not (null add) orelse not (null del)
blanchet@37399
   536
      val is_FO = is_fol_goal thy goal_cls
blanchet@37345
   537
      val axioms =
blanchet@37399
   538
        checked_name_thm_pairs (respect_no_atp andalso not only) ctxt
blanchet@37344
   539
            (if only then map (name_thms_pair_from_ref ctxt chained_ths) add
blanchet@37345
   540
             else all_name_thms_pairs respect_no_atp ctxt chained_ths)
blanchet@37345
   541
        |> cnf_rules_pairs thy
blanchet@37345
   542
        |> not has_override ? make_unique
blanchet@37399
   543
        |> not only ? restrict_to_logic thy is_FO
blanchet@37501
   544
        |> (if only then
blanchet@37501
   545
              I
blanchet@37501
   546
            else
blanchet@37501
   547
              remove_dangerous_clauses full_types
blanchet@37501
   548
                                       (maps (ProofContext.get_fact ctxt) add))
blanchet@36185
   549
    in
blanchet@36922
   550
      relevance_filter ctxt relevance_threshold relevance_convergence
blanchet@36922
   551
                       defs_relevant max_new theory_relevant relevance_override
blanchet@37345
   552
                       thy axioms (map prop_of goal_cls)
blanchet@37345
   553
      |> has_override ? make_unique
blanchet@36185
   554
    end
immler@30536
   555
immler@31752
   556
(* prepare for passing to writer,
immler@31752
   557
   create additional clauses based on the information from extra_cls *)
blanchet@37498
   558
fun prepare_clauses full_types goal_cls axcls extra_cls thy =
immler@31409
   559
  let
blanchet@37399
   560
    val is_FO = is_fol_goal thy goal_cls
blanchet@36061
   561
    val ccls = subtract_cls extra_cls goal_cls
blanchet@35865
   562
    val _ = app (fn th => trace_msg (fn _ => Display.string_of_thm_global thy th)) ccls
immler@30536
   563
    val ccltms = map prop_of ccls
immler@31752
   564
    and axtms = map (prop_of o #1) extra_cls
immler@30536
   565
    val subs = tfree_classes_of_terms ccltms
immler@30536
   566
    and supers = tvar_classes_of_terms axtms
blanchet@35865
   567
    and tycons = type_consts_of_terms thy (ccltms @ axtms)
immler@30536
   568
    (*TFrees in conjecture clauses; TVars in axiom clauses*)
blanchet@37498
   569
    val conjectures = make_conjecture_clauses thy ccls
blanchet@37498
   570
    val (_, extra_clauses) = ListPair.unzip (make_axiom_clauses thy extra_cls)
blanchet@37498
   571
    val (clnames, axiom_clauses) = ListPair.unzip (make_axiom_clauses thy axcls)
blanchet@37479
   572
    val helper_clauses =
blanchet@37498
   573
      get_helper_clauses thy is_FO full_types conjectures extra_cls
blanchet@37498
   574
    val (supers', arity_clauses) = make_arity_clauses thy tycons supers
blanchet@35865
   575
    val classrel_clauses = make_classrel_clauses thy subs supers'
immler@30536
   576
  in
immler@31752
   577
    (Vector.fromList clnames,
immler@31865
   578
      (conjectures, axiom_clauses, extra_clauses, helper_clauses, classrel_clauses, arity_clauses))
immler@31409
   579
  end
quigley@15644
   580
paulson@15347
   581
end;