src/Pure/Isar/find_theorems.ML
author kleing
Wed Feb 11 14:48:14 2009 +1100 (2009-02-11)
changeset 29857 2cc976ed8a3c
parent 29848 a7c164e228e1
child 29858 c8cee17d7e50
permissions -rw-r--r--
FindTheorems: add solves feature; tidy up const name subsettin; patch by Timothy Bourke
wenzelm@16033
     1
(*  Title:      Pure/Isar/find_theorems.ML
wenzelm@26283
     2
    Author:     Rafal Kolanski and Gerwin Klein, NICTA
wenzelm@16033
     3
wenzelm@16033
     4
Retrieve theorems from proof context.
wenzelm@16033
     5
*)
wenzelm@16033
     6
wenzelm@16033
     7
signature FIND_THEOREMS =
wenzelm@16033
     8
sig
wenzelm@25992
     9
  val limit: int ref
kleing@29857
    10
  val tac_limit: int ref
kleing@29857
    11
wenzelm@16036
    12
  datatype 'term criterion =
kleing@29857
    13
    Name of string | Intro | Elim | Dest | Solves | Simp of 'term |
kleing@29857
    14
    Pattern of 'term
kleing@29857
    15
kleing@29857
    16
  val find_theorems: Proof.context -> thm option -> bool ->
kleing@29857
    17
    (bool * string criterion) list -> (Facts.ref * thm) list
kleing@29857
    18
kleing@29857
    19
  val print_theorems: Proof.context -> thm option -> int option -> bool ->
wenzelm@16036
    20
    (bool * string criterion) list -> unit
wenzelm@16033
    21
end;
wenzelm@16033
    22
wenzelm@16033
    23
structure FindTheorems: FIND_THEOREMS =
wenzelm@16033
    24
struct
wenzelm@16033
    25
wenzelm@16033
    26
(** search criteria **)
wenzelm@16033
    27
wenzelm@16036
    28
datatype 'term criterion =
kleing@29857
    29
  Name of string | Intro | Elim | Dest | Solves | Simp of 'term |
kleing@29857
    30
  Pattern of 'term;
wenzelm@16036
    31
wenzelm@16036
    32
fun read_criterion _ (Name name) = Name name
wenzelm@16036
    33
  | read_criterion _ Intro = Intro
wenzelm@16036
    34
  | read_criterion _ Elim = Elim
wenzelm@16036
    35
  | read_criterion _ Dest = Dest
kleing@29857
    36
  | read_criterion _ Solves = Solves
wenzelm@24683
    37
  | read_criterion ctxt (Simp str) = Simp (ProofContext.read_term_pattern ctxt str)
wenzelm@24683
    38
  | read_criterion ctxt (Pattern str) = Pattern (ProofContext.read_term_pattern ctxt str);
wenzelm@16033
    39
wenzelm@16036
    40
fun pretty_criterion ctxt (b, c) =
wenzelm@16036
    41
  let
wenzelm@16036
    42
    fun prfx s = if b then s else "-" ^ s;
wenzelm@16036
    43
  in
wenzelm@16036
    44
    (case c of
wenzelm@16036
    45
      Name name => Pretty.str (prfx "name: " ^ quote name)
wenzelm@16036
    46
    | Intro => Pretty.str (prfx "intro")
wenzelm@16036
    47
    | Elim => Pretty.str (prfx "elim")
wenzelm@16036
    48
    | Dest => Pretty.str (prfx "dest")
kleing@29857
    49
    | Solves => Pretty.str (prfx "solves")
kleing@16088
    50
    | Simp pat => Pretty.block [Pretty.str (prfx "simp:"), Pretty.brk 1,
wenzelm@24920
    51
        Pretty.quote (Syntax.pretty_term ctxt (Term.show_dummy_patterns pat))]
wenzelm@16036
    52
    | Pattern pat => Pretty.enclose (prfx " \"") "\""
wenzelm@24920
    53
        [Syntax.pretty_term ctxt (Term.show_dummy_patterns pat)])
wenzelm@16036
    54
  end;
wenzelm@16033
    55
wenzelm@16033
    56
(** search criterion filters **)
wenzelm@16033
    57
kleing@16895
    58
(*generated filters are to be of the form
wenzelm@26336
    59
  input: (Facts.ref * thm)
wenzelm@17106
    60
  output: (p:int, s:int) option, where
kleing@16895
    61
    NONE indicates no match
wenzelm@17106
    62
    p is the primary sorting criterion
kleing@16895
    63
      (eg. number of assumptions in the theorem)
kleing@16895
    64
    s is the secondary sorting criterion
kleing@16895
    65
      (eg. size of the substitution for intro, elim and dest)
kleing@16895
    66
  when applying a set of filters to a thm, fold results in:
kleing@16895
    67
    (biggest p, sum of all s)
wenzelm@17106
    68
  currently p and s only matter for intro, elim, dest and simp filters,
wenzelm@17106
    69
  otherwise the default ordering is used.
kleing@16895
    70
*)
kleing@16895
    71
kleing@16088
    72
kleing@16088
    73
(* matching theorems *)
wenzelm@17106
    74
wenzelm@17205
    75
fun is_nontrivial thy = Term.is_Const o Term.head_of o ObjectLogic.drop_judgment thy;
kleing@16088
    76
kleing@16964
    77
(*extract terms from term_src, refine them to the parts that concern us,
kleing@16964
    78
  if po try match them against obj else vice versa.
kleing@16964
    79
  trivial matches are ignored.
kleing@16964
    80
  returns: smallest substitution size*)
kleing@16964
    81
fun is_matching_thm (extract_terms, refine_term) ctxt po obj term_src =
kleing@16088
    82
  let
wenzelm@17106
    83
    val thy = ProofContext.theory_of ctxt;
kleing@16088
    84
wenzelm@16486
    85
    fun matches pat =
wenzelm@17106
    86
      is_nontrivial thy pat andalso
wenzelm@17205
    87
      Pattern.matches thy (if po then (pat, obj) else (obj, pat));
kleing@16895
    88
kleing@16895
    89
    fun substsize pat =
wenzelm@18184
    90
      let val (_, subst) =
wenzelm@18184
    91
        Pattern.match thy (if po then (pat, obj) else (obj, pat)) (Vartab.empty, Vartab.empty)
wenzelm@17205
    92
      in Vartab.fold (fn (_, (_, t)) => fn n => size_of_term t + n) subst 0 end;
kleing@16088
    93
kleing@16895
    94
    fun bestmatch [] = NONE
wenzelm@17205
    95
     |  bestmatch xs = SOME (foldr1 Int.min xs);
kleing@16895
    96
kleing@16964
    97
    val match_thm = matches o refine_term;
wenzelm@16486
    98
  in
wenzelm@26283
    99
    map (substsize o refine_term) (filter match_thm (extract_terms term_src))
wenzelm@26283
   100
    |> bestmatch
kleing@16088
   101
  end;
kleing@16088
   102
kleing@16088
   103
wenzelm@16033
   104
(* filter_name *)
wenzelm@16033
   105
wenzelm@17755
   106
fun match_string pat str =
wenzelm@17755
   107
  let
wenzelm@17755
   108
    fun match [] _ = true
wenzelm@17755
   109
      | match (p :: ps) s =
wenzelm@17755
   110
          size p <= size s andalso
wenzelm@17755
   111
            (case try (unprefix p) s of
wenzelm@17755
   112
              SOME s' => match ps s'
wenzelm@17755
   113
            | NONE => match (p :: ps) (String.substring (s, 1, size s - 1)));
wenzelm@17755
   114
  in match (space_explode "*" pat) str end;
wenzelm@16033
   115
wenzelm@17106
   116
fun filter_name str_pat (thmref, _) =
wenzelm@26336
   117
  if match_string str_pat (Facts.name_of_ref thmref)
wenzelm@17205
   118
  then SOME (0, 0) else NONE;
wenzelm@16033
   119
wenzelm@16033
   120
kleing@29857
   121
(* filter intro/elim/dest/solves rules *)
wenzelm@16033
   122
wenzelm@17205
   123
fun filter_dest ctxt goal (_, thm) =
wenzelm@16033
   124
  let
kleing@16964
   125
    val extract_dest =
wenzelm@17205
   126
     (fn thm => if Thm.no_prems thm then [] else [Thm.full_prop_of thm],
wenzelm@16033
   127
      hd o Logic.strip_imp_prems);
wenzelm@16033
   128
    val prems = Logic.prems_of_goal goal 1;
kleing@16895
   129
kleing@16964
   130
    fun try_subst prem = is_matching_thm extract_dest ctxt true prem thm;
wenzelm@19482
   131
    val successful = prems |> map_filter try_subst;
wenzelm@16033
   132
  in
kleing@16895
   133
    (*if possible, keep best substitution (one with smallest size)*)
wenzelm@17106
   134
    (*dest rules always have assumptions, so a dest with one
kleing@16895
   135
      assumption is as good as an intro rule with none*)
wenzelm@17205
   136
    if not (null successful)
wenzelm@17205
   137
    then SOME (Thm.nprems_of thm - 1, foldr1 Int.min successful) else NONE
wenzelm@16033
   138
  end;
wenzelm@16033
   139
wenzelm@17205
   140
fun filter_intro ctxt goal (_, thm) =
wenzelm@16033
   141
  let
wenzelm@17205
   142
    val extract_intro = (single o Thm.full_prop_of, Logic.strip_imp_concl);
wenzelm@16036
   143
    val concl = Logic.concl_of_goal goal 1;
kleing@16964
   144
    val ss = is_matching_thm extract_intro ctxt true concl thm;
wenzelm@16033
   145
  in
wenzelm@18939
   146
    if is_some ss then SOME (Thm.nprems_of thm, the ss) else NONE
wenzelm@16033
   147
  end;
wenzelm@16033
   148
wenzelm@17205
   149
fun filter_elim ctxt goal (_, thm) =
kleing@16964
   150
  if not (Thm.no_prems thm) then
kleing@16964
   151
    let
wenzelm@17205
   152
      val rule = Thm.full_prop_of thm;
kleing@16964
   153
      val prems = Logic.prems_of_goal goal 1;
kleing@16964
   154
      val goal_concl = Logic.concl_of_goal goal 1;
wenzelm@26283
   155
      val rule_mp = hd (Logic.strip_imp_prems rule);
kleing@16964
   156
      val rule_concl = Logic.strip_imp_concl rule;
wenzelm@26283
   157
      fun combine t1 t2 = Const ("*combine*", dummyT --> dummyT) $ (t1 $ t2);
kleing@16964
   158
      val rule_tree = combine rule_mp rule_concl;
wenzelm@26283
   159
      fun goal_tree prem = combine prem goal_concl;
wenzelm@17106
   160
      fun try_subst prem =
kleing@16964
   161
        is_matching_thm (single, I) ctxt true (goal_tree prem) rule_tree;
wenzelm@19482
   162
      val successful = prems |> map_filter try_subst;
kleing@16964
   163
    in
wenzelm@17106
   164
    (*elim rules always have assumptions, so an elim with one
kleing@16964
   165
      assumption is as good as an intro rule with none*)
wenzelm@17106
   166
      if is_nontrivial (ProofContext.theory_of ctxt) (Thm.major_prem_of thm)
wenzelm@17205
   167
        andalso not (null successful)
wenzelm@17205
   168
      then SOME (Thm.nprems_of thm - 1, foldr1 Int.min successful) else NONE
kleing@16964
   169
    end
kleing@16964
   170
  else NONE
wenzelm@16036
   171
kleing@29857
   172
val tac_limit = ref 5;
kleing@29857
   173
kleing@29857
   174
fun filter_solves ctxt goal = let
kleing@29857
   175
    val baregoal = Logic.get_goal (prop_of goal) 1;
kleing@29857
   176
kleing@29857
   177
    fun etacn thm i = Seq.take (!tac_limit) o etac thm i;
kleing@29857
   178
    fun try_thm thm = if Thm.no_prems thm then rtac thm 1 goal
kleing@29857
   179
                      else (etacn thm THEN_ALL_NEW
kleing@29857
   180
                             (Goal.norm_hhf_tac THEN'
kleing@29857
   181
                               Method.assumption_tac ctxt)) 1 goal;
kleing@29857
   182
  in
kleing@29857
   183
    fn (_, thm) => if (is_some o Seq.pull o try_thm) thm
kleing@29857
   184
                   then SOME (Thm.nprems_of thm, 0) else NONE
kleing@29857
   185
  end;
wenzelm@16033
   186
kleing@16074
   187
(* filter_simp *)
wenzelm@16033
   188
wenzelm@17205
   189
fun filter_simp ctxt t (_, thm) =
wenzelm@16033
   190
  let
wenzelm@16033
   191
    val (_, {mk_rews = {mk, ...}, ...}) =
wenzelm@29302
   192
      Simplifier.rep_ss (Simplifier.local_simpset_of ctxt);
wenzelm@17106
   193
    val extract_simp =
wenzelm@17205
   194
      (map Thm.full_prop_of o mk, #1 o Logic.dest_equals o Logic.strip_imp_concl);
kleing@16964
   195
    val ss = is_matching_thm extract_simp ctxt false t thm
wenzelm@17106
   196
  in
wenzelm@18939
   197
    if is_some ss then SOME (Thm.nprems_of thm, the ss) else NONE
kleing@16964
   198
  end;
wenzelm@16033
   199
wenzelm@16033
   200
wenzelm@16033
   201
(* filter_pattern *)
wenzelm@16033
   202
kleing@29857
   203
fun get_names t = (Term.add_const_names t []) union (Term.add_free_names t []);
kleing@29857
   204
fun get_thm_names (_, thm) = get_names (Thm.full_prop_of thm);
kleing@29857
   205
  (* Including all constants and frees is only sound because
kleing@29857
   206
     matching uses higher-order patterns. If full matching
kleing@29857
   207
     were used, then constants that may be subject to
kleing@29857
   208
     beta-reduction after substitution of frees should
kleing@29857
   209
     not be included for LHS set because they could be
kleing@29857
   210
     thrown away by the substituted function.
kleing@29857
   211
     e.g. for (?F 1 2) do not include 1 or 2, if it were
kleing@29857
   212
          possible for ?F to be (% x y. 3)
kleing@29857
   213
     The largest possible set should always be included on
kleing@29857
   214
     the RHS. *)
kleing@28900
   215
kleing@28900
   216
fun filter_pattern ctxt pat = let
kleing@29857
   217
    val pat_consts = get_names pat;
kleing@28900
   218
kleing@29857
   219
    fun check (t, NONE) = check (t, SOME (get_thm_names t))
kleing@28900
   220
      | check ((_, thm), c as SOME thm_consts) =
kleing@28900
   221
          (if pat_consts subset_string thm_consts
kleing@28900
   222
              andalso (Pattern.matches_subterm (ProofContext.theory_of ctxt)
kleing@28900
   223
                                               (pat, Thm.full_prop_of thm))
kleing@28900
   224
           then SOME (0, 0) else NONE, c);
kleing@28900
   225
  in check end;
wenzelm@16033
   226
wenzelm@16033
   227
(* interpret criteria as filters *)
wenzelm@16033
   228
wenzelm@16036
   229
local
wenzelm@16036
   230
wenzelm@16036
   231
fun err_no_goal c =
wenzelm@16036
   232
  error ("Current goal required for " ^ c ^ " search criterion");
wenzelm@16036
   233
kleing@29857
   234
val fix_goal = Thm.prop_of;
kleing@29857
   235
val fix_goalo = Option.map fix_goal;
kleing@29857
   236
kleing@28900
   237
fun filter_crit _ _ (Name name) = apfst (filter_name name)
wenzelm@16036
   238
  | filter_crit _ NONE Intro = err_no_goal "intro"
wenzelm@16036
   239
  | filter_crit _ NONE Elim = err_no_goal "elim"
wenzelm@16036
   240
  | filter_crit _ NONE Dest = err_no_goal "dest"
kleing@29857
   241
  | filter_crit _ NONE Solves = err_no_goal "solves"
kleing@29857
   242
  | filter_crit ctxt (SOME goal) Intro = apfst (filter_intro ctxt
kleing@29857
   243
                                                  (fix_goal goal))
kleing@29857
   244
  | filter_crit ctxt (SOME goal) Elim = apfst (filter_elim ctxt 
kleing@29857
   245
                                                  (fix_goal goal))
kleing@29857
   246
  | filter_crit ctxt (SOME goal) Dest = apfst (filter_dest ctxt
kleing@29857
   247
                                                  (fix_goal goal))
kleing@29857
   248
  | filter_crit ctxt (SOME goal) Solves = apfst (filter_solves ctxt goal)
kleing@28900
   249
  | filter_crit ctxt _ (Simp pat) = apfst (filter_simp ctxt pat)
kleing@16088
   250
  | filter_crit ctxt _ (Pattern pat) = filter_pattern ctxt pat;
wenzelm@16036
   251
wenzelm@19502
   252
fun opt_not x = if is_some x then NONE else SOME (0, 0);
kleing@16895
   253
wenzelm@17756
   254
fun opt_add (SOME (a, x)) (SOME (b, y)) = SOME (Int.max (a, b), x + y : int)
wenzelm@26283
   255
  | opt_add _ _ = NONE;
kleing@16895
   256
kleing@28900
   257
fun app_filters thm = let
kleing@28900
   258
    fun app (NONE, _, _) = NONE
kleing@28900
   259
      | app (SOME v, consts, []) = SOME (v, thm)
kleing@28900
   260
      | app (r, consts, f::fs) = let val (r', consts') = f (thm, consts)
kleing@28900
   261
                                 in app (opt_add r r', consts', fs) end;
kleing@28900
   262
  in app end;
kleing@28900
   263
wenzelm@16036
   264
in
wenzelm@16033
   265
wenzelm@16033
   266
fun filter_criterion ctxt opt_goal (b, c) =
kleing@28900
   267
  (if b then I else (apfst opt_not)) o filter_crit ctxt opt_goal c;
kleing@16895
   268
kleing@16895
   269
fun all_filters filters thms =
kleing@16895
   270
  let
kleing@28900
   271
    fun eval_filters thm = app_filters thm (SOME (0, 0), NONE, filters);
wenzelm@16033
   272
kleing@16895
   273
    (*filters return: (number of assumptions, substitution size) option, so
kleing@16964
   274
      sort (desc. in both cases) according to number of assumptions first,
kleing@16895
   275
      then by the substitution size*)
wenzelm@17205
   276
    fun thm_ord (((p0, s0), _), ((p1, s1), _)) =
wenzelm@17205
   277
      prod_ord int_ord int_ord ((p1, s1), (p0, s0));
kleing@28900
   278
  in map_filter eval_filters thms |> sort thm_ord |> map #2 end;
wenzelm@16033
   279
wenzelm@16036
   280
end;
wenzelm@16036
   281
wenzelm@16033
   282
kleing@22414
   283
(* removing duplicates, preferring nicer names, roughly n log n *)
kleing@22340
   284
wenzelm@25226
   285
local
wenzelm@25226
   286
huffman@27486
   287
val index_ord = option_ord (K EQUAL);
wenzelm@25226
   288
val hidden_ord = bool_ord o pairself NameSpace.is_hidden;
wenzelm@25226
   289
val qual_ord = int_ord o pairself (length o NameSpace.explode);
wenzelm@25226
   290
val txt_ord = int_ord o pairself size;
wenzelm@25226
   291
huffman@27486
   292
fun nicer_name (x, i) (y, j) =
huffman@27486
   293
  (case hidden_ord (x, y) of EQUAL =>
huffman@27486
   294
    (case index_ord (i, j) of EQUAL =>
huffman@27486
   295
      (case qual_ord (x, y) of EQUAL => txt_ord (x, y) | ord => ord)
huffman@27486
   296
    | ord => ord)
wenzelm@25226
   297
  | ord => ord) <> GREATER;
wenzelm@25226
   298
Timothy@29848
   299
fun rem_cdups nicer xs =
wenzelm@26336
   300
  let
wenzelm@26336
   301
    fun rem_c rev_seen [] = rev rev_seen
wenzelm@26336
   302
      | rem_c rev_seen [x] = rem_c (x :: rev_seen) []
wenzelm@26336
   303
      | rem_c rev_seen ((x as ((n, t), _)) :: (y as ((n', t'), _)) :: xs) =
wenzelm@26336
   304
        if Thm.eq_thm_prop (t, t')
wenzelm@26336
   305
        then rem_c rev_seen ((if nicer n n' then x else y) :: xs)
wenzelm@26336
   306
        else rem_c (x :: rev_seen) (y :: xs)
wenzelm@26336
   307
  in rem_c [] xs end;
wenzelm@25226
   308
wenzelm@26336
   309
in
wenzelm@25226
   310
Timothy@29848
   311
fun nicer_shortest ctxt = let
Timothy@29848
   312
    val ns = ProofContext.theory_of ctxt
Timothy@29848
   313
             |> PureThy.facts_of
Timothy@29848
   314
             |> Facts.space_of;
Timothy@29848
   315
Timothy@29848
   316
    val len_sort = sort (int_ord o (pairself size));
Timothy@29848
   317
    fun shorten s = (case len_sort (NameSpace.get_accesses ns s) of
Timothy@29848
   318
                       [] => s
Timothy@29848
   319
                     | s'::_ => s');
Timothy@29848
   320
Timothy@29848
   321
    fun nicer (Facts.Named ((x, _), i)) (Facts.Named ((y, _), j)) =
Timothy@29848
   322
          nicer_name (shorten x, i) (shorten y, j)
Timothy@29848
   323
      | nicer (Facts.Fact _) (Facts.Named _) = true
Timothy@29848
   324
      | nicer (Facts.Named _) (Facts.Fact _) = false;
Timothy@29848
   325
  in nicer end;
Timothy@29848
   326
Timothy@29848
   327
fun rem_thm_dups nicer xs =
wenzelm@26336
   328
  xs ~~ (1 upto length xs)
wenzelm@29269
   329
  |> sort (TermOrd.fast_term_ord o pairself (Thm.prop_of o #2 o #1))
Timothy@29848
   330
  |> rem_cdups nicer
wenzelm@26336
   331
  |> sort (int_ord o pairself #2)
wenzelm@26336
   332
  |> map #1;
kleing@22340
   333
wenzelm@26336
   334
end;
kleing@22340
   335
kleing@22340
   336
wenzelm@16033
   337
(* print_theorems *)
wenzelm@16033
   338
wenzelm@26283
   339
fun all_facts_of ctxt =
wenzelm@26336
   340
  maps Facts.selections
wenzelm@27173
   341
   (Facts.dest_static [] (PureThy.facts_of (ProofContext.theory_of ctxt)) @
wenzelm@27173
   342
    Facts.dest_static [] (ProofContext.facts_of ctxt));
wenzelm@17972
   343
wenzelm@25992
   344
val limit = ref 40;
wenzelm@25992
   345
kleing@29857
   346
fun find_theorems ctxt opt_goal rem_dups raw_criteria =
wenzelm@16033
   347
  let
kleing@29857
   348
    val add_prems = Seq.hd o (TRY (Method.insert_tac
kleing@29857
   349
                                     (Assumption.prems_of ctxt) 1));
kleing@29857
   350
    val opt_goal' = Option.map add_prems opt_goal;
kleing@29857
   351
wenzelm@16036
   352
    val criteria = map (apsnd (read_criterion ctxt)) raw_criteria;
kleing@29857
   353
    val filters = map (filter_criterion ctxt opt_goal') criteria;
wenzelm@16033
   354
wenzelm@26283
   355
    val raw_matches = all_filters filters (all_facts_of ctxt);
kleing@28900
   356
wenzelm@22360
   357
    val matches =
kleing@22414
   358
      if rem_dups
Timothy@29848
   359
      then rem_thm_dups (nicer_shortest ctxt) raw_matches
wenzelm@22360
   360
      else raw_matches;
kleing@29857
   361
  in matches end;
kleing@29857
   362
kleing@29857
   363
fun print_theorems ctxt opt_goal opt_limit rem_dups raw_criteria = let
kleing@29857
   364
    val start = start_timing ();
kleing@29857
   365
kleing@29857
   366
    val criteria = map (apsnd (read_criterion ctxt)) raw_criteria;
kleing@29857
   367
    val matches = find_theorems ctxt opt_goal rem_dups raw_criteria;
kleing@22340
   368
wenzelm@16033
   369
    val len = length matches;
wenzelm@25992
   370
    val lim = the_default (! limit) opt_limit;
wenzelm@25992
   371
    val thms = Library.drop (len - lim, matches);
wenzelm@16033
   372
kleing@29857
   373
    fun prt_fact (thmref, thm) = Pretty.block
kleing@29857
   374
      [Pretty.str (Facts.string_of_ref thmref), Pretty.str ":", Pretty.brk 1,
kleing@29857
   375
        ProofContext.pretty_thm ctxt thm];
kleing@29857
   376
kleing@28900
   377
    val end_msg = " in " ^
kleing@28900
   378
                  (List.nth (String.tokens Char.isSpace (end_timing start), 3))
kleing@28900
   379
                  ^ " secs"
wenzelm@16033
   380
  in
kleing@28900
   381
    Pretty.big_list "searched for:" (map (pretty_criterion ctxt) criteria)
kleing@29857
   382
        :: Pretty.str "" ::
kleing@28900
   383
     (if null thms then [Pretty.str ("nothing found" ^ end_msg)]
wenzelm@16033
   384
      else
wenzelm@16036
   385
        [Pretty.str ("found " ^ string_of_int len ^ " theorems" ^
kleing@28900
   386
          (if len <= lim then ""
kleing@28900
   387
           else " (" ^ string_of_int lim ^ " displayed)")
kleing@28900
   388
           ^ end_msg ^ ":"), Pretty.str ""] @
kleing@22340
   389
        map prt_fact thms)
wenzelm@16033
   390
    |> Pretty.chunks |> Pretty.writeln
kleing@29857
   391
  end
wenzelm@16033
   392
wenzelm@16033
   393
end;