src/HOL/Tools/Sledgehammer/sledgehammer_filter.ML
author blanchet
Wed, 01 Feb 2012 12:47:43 +0100
changeset 46388 e7445478d90b
parent 46379 de5dd84717c1
child 46393 69f2d19f7d33
permissions -rw-r--r--
proper statuses for "fact_from_ref"
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
38988
483879af0643 finished renaming
blanchet
parents: 38986
diff changeset
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_filter.ML
38027
505657ddb047 standardize "Author" tags
blanchet
parents: 37995
diff changeset
     2
    Author:     Jia Meng, Cambridge University Computer Laboratory and NICTA
36393
be73a2b2443b support readable names even when Isar proof reconstruction is enabled -- useful for debugging
blanchet
parents: 36227
diff changeset
     3
    Author:     Jasmin Blanchette, TU Muenchen
39958
88c9aa5666de tuned comments
blanchet
parents: 39946
diff changeset
     4
88c9aa5666de tuned comments
blanchet
parents: 39946
diff changeset
     5
Sledgehammer's relevance filter.
33309
5f67433e6dd8 proper header;
wenzelm
parents: 33306
diff changeset
     6
*)
15452
e2a721567f67 Jia Meng: delta simpsets and clasets
paulson
parents: 15347
diff changeset
     7
38988
483879af0643 finished renaming
blanchet
parents: 38986
diff changeset
     8
signature SLEDGEHAMMER_FILTER =
16802
6eeee59dac4c use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents: 16767
diff changeset
     9
sig
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
    10
  type status = ATP_Problem_Generate.status
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
    11
  type stature = ATP_Problem_Generate.stature
38752
6628adcae4a7 consider "locality" when assigning weights to facts
blanchet
parents: 38751
diff changeset
    12
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    13
  type relevance_fudge =
42738
2a9dcff63b80 remove unused parameter
blanchet
parents: 42735
diff changeset
    14
    {local_const_multiplier : real,
41159
1e12d6495423 honor "overlord" option for SMT solvers as well and don't pass "ext" to them
blanchet
parents: 41158
diff changeset
    15
     worse_irrel_freq : real,
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    16
     higher_order_irrel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    17
     abs_rel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    18
     abs_irrel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    19
     skolem_irrel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    20
     theory_const_rel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    21
     theory_const_irrel_weight : real,
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
    22
     chained_const_irrel_weight : real,
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    23
     intro_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    24
     elim_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    25
     simp_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    26
     local_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    27
     assum_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    28
     chained_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    29
     max_imperfect : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    30
     max_imperfect_exp : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    31
     threshold_divisor : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    32
     ridiculous_threshold : real}
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    33
35966
f8c738abaed8 honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents: 35963
diff changeset
    34
  type relevance_override =
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    35
    {add : (Facts.ref * Attrib.src list) list,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    36
     del : (Facts.ref * Attrib.src list) list,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    37
     only : bool}
35966
f8c738abaed8 honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents: 35963
diff changeset
    38
42646
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
    39
  val trace : bool Config.T
42728
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
    40
  val ignore_no_atp : bool Config.T
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
    41
  val instantiate_inducts : bool Config.T
44462
d9a657c44380 more reliable "sledgehammer\_tac" reconstruction, by avoiding "insert_tac"
blanchet
parents: 44400
diff changeset
    42
  val no_relevance_override : relevance_override
43351
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
    43
  val const_names_in_fact :
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
    44
    theory -> (string * typ -> term list -> bool * term list) -> term
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
    45
    -> string list
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
    46
  val clasimpset_rule_table_of : Proof.context -> status Termtab.table
40205
277508b07418 if "debug" is on, print list of relevant facts (poweruser request);
blanchet
parents: 40204
diff changeset
    47
  val fact_from_ref :
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
    48
    Proof.context -> unit Symtab.table -> thm list -> status Termtab.table
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
    49
    -> Facts.ref * Attrib.src list -> ((string * stature) * thm) list
41767
44b2a0385001 export useful function (needed in a Sledgehammer-related experiment)
blanchet
parents: 41491
diff changeset
    50
  val all_facts :
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
    51
    Proof.context -> bool -> 'a Symtab.table -> bool -> thm list -> thm list
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
    52
    -> (((unit -> string) * stature) * thm) list
43351
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
    53
  val nearly_all_facts :
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
    54
    Proof.context -> bool -> relevance_override -> thm list -> term list -> term
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
    55
    -> (((unit -> string) * stature) * thm) list
37347
635425a442e8 show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents: 37345
diff changeset
    56
  val relevant_facts :
44625
4a1132815a70 more tuning
blanchet
parents: 44586
diff changeset
    57
    Proof.context -> real * real -> int
41336
0ea5b9c7d233 proper handling of the arguments of SMT builtins -- for numerals, ignore the arguments (Pls, Bit0, Bit1, ..), for functions, consider them;
blanchet
parents: 41279
diff changeset
    58
    -> (string * typ -> term list -> bool * term list) -> relevance_fudge
41066
3890ef4e02f9 pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
blanchet
parents: 40418
diff changeset
    59
    -> relevance_override -> thm list -> term list -> term
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
    60
    -> (((unit -> string) * stature) * thm) list
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
    61
    -> ((string * stature) * thm) list
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    62
end;
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    63
38988
483879af0643 finished renaming
blanchet
parents: 38986
diff changeset
    64
structure Sledgehammer_Filter : SLEDGEHAMMER_FILTER =
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    65
struct
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    66
46320
0b8b73b49848 renamed two files to make room for a new file
blanchet
parents: 46217
diff changeset
    67
open ATP_Problem_Generate
44934
blanchet
parents: 44785
diff changeset
    68
open Metis_Tactic
38652
e063be321438 perform eta-expansion of quantifier bodies in Sledgehammer translation when needed + transform elim rules later;
blanchet
parents: 38644
diff changeset
    69
open Sledgehammer_Util
e063be321438 perform eta-expansion of quantifier bodies in Sledgehammer translation when needed + transform elim rules later;
blanchet
parents: 38644
diff changeset
    70
42646
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
    71
val trace =
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
    72
  Attrib.setup_config_bool @{binding sledgehammer_filter_trace} (K false)
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
    73
fun trace_msg ctxt msg = if Config.get ctxt trace then tracing (msg ()) else ()
35826
1590abc3d42a renamed Sledgehammer structures
blanchet
parents: 35825
diff changeset
    74
41273
35ce17cd7967 made the relevance filter treat unatomizable facts like "atomize_all" properly (these result in problems that get E spinning seemingly forever);
blanchet
parents: 41211
diff changeset
    75
(* experimental features *)
42728
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
    76
val ignore_no_atp =
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
    77
  Attrib.setup_config_bool @{binding sledgehammer_ignore_no_atp} (K false)
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
    78
val instantiate_inducts =
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
    79
  Attrib.setup_config_bool @{binding sledgehammer_instantiate_inducts} (K false)
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
    80
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    81
type relevance_fudge =
42738
2a9dcff63b80 remove unused parameter
blanchet
parents: 42735
diff changeset
    82
  {local_const_multiplier : real,
41159
1e12d6495423 honor "overlord" option for SMT solvers as well and don't pass "ext" to them
blanchet
parents: 41158
diff changeset
    83
   worse_irrel_freq : real,
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    84
   higher_order_irrel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    85
   abs_rel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    86
   abs_irrel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    87
   skolem_irrel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    88
   theory_const_rel_weight : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    89
   theory_const_irrel_weight : real,
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
    90
   chained_const_irrel_weight : real,
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    91
   intro_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    92
   elim_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    93
   simp_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    94
   local_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    95
   assum_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    96
   chained_bonus : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    97
   max_imperfect : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    98
   max_imperfect_exp : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
    99
   threshold_divisor : real,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   100
   ridiculous_threshold : real}
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   101
35966
f8c738abaed8 honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents: 35963
diff changeset
   102
type relevance_override =
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   103
  {add : (Facts.ref * Attrib.src list) list,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   104
   del : (Facts.ref * Attrib.src list) list,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   105
   only : bool}
21070
0a898140fea2 Added more debugging info
paulson
parents: 20995
diff changeset
   106
44462
d9a657c44380 more reliable "sledgehammer\_tac" reconstruction, by avoiding "insert_tac"
blanchet
parents: 44400
diff changeset
   107
val no_relevance_override = {add = [], del = [], only = false}
d9a657c44380 more reliable "sledgehammer\_tac" reconstruction, by avoiding "insert_tac"
blanchet
parents: 44400
diff changeset
   108
37616
c8d2d84d6011 always perform relevance filtering on original formulas
blanchet
parents: 37580
diff changeset
   109
val sledgehammer_prefix = "Sledgehammer" ^ Long_Name.separator
39896
13b3a2ba9ea7 encode axiom number and cluster number in all zapped quantifiers to help discharging new skolemizer assumptions
blanchet
parents: 39718
diff changeset
   110
val abs_name = sledgehammer_prefix ^ "abs"
13b3a2ba9ea7 encode axiom number and cluster number in all zapped quantifiers to help discharging new skolemizer assumptions
blanchet
parents: 39718
diff changeset
   111
val skolem_prefix = sledgehammer_prefix ^ "sko"
38992
542474156c66 introduce fudge factors to deal with "theory const"
blanchet
parents: 38988
diff changeset
   112
val theory_const_suffix = Long_Name.separator ^ " 1"
37616
c8d2d84d6011 always perform relevance filtering on original formulas
blanchet
parents: 37580
diff changeset
   113
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   114
val crude_zero_vars =
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   115
  map_aterms (fn Var ((s, _), T) => Var ((s, 0), T) | t => t)
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   116
  #> map_types (map_type_tvar (fn ((s, _), S) => TVar ((s, 0), S)))
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   117
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   118
fun clasimpset_rule_table_of ctxt =
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   119
  let
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   120
    val thy = Proof_Context.theory_of ctxt
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   121
    val atomize = HOLogic.mk_Trueprop o Object_Logic.atomize_term thy
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   122
    fun add stature g f =
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   123
      fold (Termtab.update o rpair stature o g o crude_zero_vars o prop_of o f)
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   124
    val {safeIs, safeEs, hazIs, hazEs, ...} =
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   125
      ctxt |> claset_of |> Classical.rep_cs
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   126
    val intros = Item_Net.content safeIs @ Item_Net.content hazIs
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   127
    val elims =
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   128
      Item_Net.content safeEs @ Item_Net.content hazEs
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   129
      |> map Classical.classical_rule
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   130
    val simps = ctxt |> simpset_of |> dest_ss |> #simps
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   131
    val eqs =
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   132
      ctxt |> Spec_Rules.get
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   133
           |> filter (curry (op =) Spec_Rules.Equational o fst)
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   134
           |> maps (snd o snd)
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   135
  in
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   136
    Termtab.empty |> add Simp I snd simps
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   137
                  |> add Simp atomize snd simps
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   138
                  |> add Eq I I eqs
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   139
                  |> add Elim I I elims
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   140
                  |> add Intro I I intros
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   141
  end
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   142
40227
e31e3f0071d4 support non-identifier-like fact names in Sledgehammer (e.g., "my lemma") by quoting them
blanchet
parents: 40205
diff changeset
   143
fun needs_quoting reserved s =
40375
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   144
  Symtab.defined reserved s orelse
42290
b1f544c84040 discontinued special treatment of structure Lexicon;
wenzelm
parents: 41999
diff changeset
   145
  exists (not o Lexicon.is_identifier) (Long_Name.explode s)
40227
e31e3f0071d4 support non-identifier-like fact names in Sledgehammer (e.g., "my lemma") by quoting them
blanchet
parents: 40205
diff changeset
   146
40375
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   147
fun make_name reserved multi j name =
40227
e31e3f0071d4 support non-identifier-like fact names in Sledgehammer (e.g., "my lemma") by quoting them
blanchet
parents: 40205
diff changeset
   148
  (name |> needs_quoting reserved name ? quote) ^
41491
a2ad5b824051 eliminated Int.toString;
wenzelm
parents: 41336
diff changeset
   149
  (if multi then "(" ^ string_of_int j ^ ")" else "")
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   150
40375
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   151
fun explode_interval _ (Facts.FromTo (i, j)) = i upto j
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   152
  | explode_interval max (Facts.From i) = i upto i + max - 1
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   153
  | explode_interval _ (Facts.Single i) = [i]
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   154
41279
e0400b05a62c escape backticks in altstrings
blanchet
parents: 41273
diff changeset
   155
val backquote =
e0400b05a62c escape backticks in altstrings
blanchet
parents: 41273
diff changeset
   156
  raw_explode #> map (fn "`" => "\\`" | s => s) #> implode #> enclose "`" "`"
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   157
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   158
fun is_assum assms th = exists (fn ct => prop_of th aconv term_of ct) assms
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   159
fun is_chained chained_ths = member Thm.eq_thm_prop chained_ths
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   160
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   161
fun scope_of_thm global assms chained_ths th =
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   162
  if is_chained chained_ths th then Chained
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   163
  else if global then Global
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   164
  else if is_assum assms th then Assum
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   165
  else Local
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   166
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   167
fun status_of_thm css_table name th =
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   168
  (* FIXME: use structured name *)
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   169
  if String.isSubstring ".induct" name orelse
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   170
     String.isSubstring ".inducts" name then
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   171
    Induct
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   172
  else case Termtab.lookup css_table (prop_of th) of
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   173
    SOME status => status
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   174
  | NONE => General
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   175
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   176
fun stature_of_thm global assms chained_ths css_table name th =
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   177
  (scope_of_thm global assms chained_ths th, status_of_thm css_table name th)
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   178
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   179
fun fact_from_ref ctxt reserved chained_ths css_table (xthm as (xref, args)) =
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   180
  let
38996
6905ba37376c generalize theorem argument parsing syntax
blanchet
parents: 38994
diff changeset
   181
    val ths = Attrib.eval_thms ctxt [xthm]
6905ba37376c generalize theorem argument parsing syntax
blanchet
parents: 38994
diff changeset
   182
    val bracket =
41999
3c029ef9e0f2 added "simp:", "intro:", and "elim:" to "try" command
blanchet
parents: 41989
diff changeset
   183
      map (enclose "[" "]" o Pretty.str_of o Args.pretty_src ctxt) args
3c029ef9e0f2 added "simp:", "intro:", and "elim:" to "try" command
blanchet
parents: 41989
diff changeset
   184
      |> implode
40375
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   185
    fun nth_name j =
38996
6905ba37376c generalize theorem argument parsing syntax
blanchet
parents: 38994
diff changeset
   186
      case xref of
41279
e0400b05a62c escape backticks in altstrings
blanchet
parents: 41273
diff changeset
   187
        Facts.Fact s => backquote s ^ bracket
38996
6905ba37376c generalize theorem argument parsing syntax
blanchet
parents: 38994
diff changeset
   188
      | Facts.Named (("", _), _) => "[" ^ bracket ^ "]"
40375
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   189
      | Facts.Named ((name, _), NONE) =>
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   190
        make_name reserved (length ths > 1) (j + 1) name ^ bracket
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   191
      | Facts.Named ((name, _), SOME intervals) =>
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   192
        make_name reserved true
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   193
                 (nth (maps (explode_interval (length ths)) intervals) j) name ^
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   194
        bracket
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   195
  in
40375
db690d38e4b9 fixed handling of theorem references such as "foo bar" (with quotes), "foo bar(2)", and "foo bar(2)"(2)
blanchet
parents: 40373
diff changeset
   196
    (ths, (0, []))
38752
6628adcae4a7 consider "locality" when assigning weights to facts
blanchet
parents: 38751
diff changeset
   197
    |-> fold (fn th => fn (j, rest) =>
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   198
                 let val name = nth_name j in
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   199
                   (j + 1, ((name, stature_of_thm false [] chained_ths
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   200
                                             css_table name th), th) :: rest)
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   201
                 end)
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   202
    |> snd
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   203
  end
37616
c8d2d84d6011 always perform relevance filtering on original formulas
blanchet
parents: 37580
diff changeset
   204
45034
b0f61dec677a tuned comment
blanchet
parents: 44934
diff changeset
   205
(* This is a terrible hack. Free variables are sometimes coded as "M__" when
b0f61dec677a tuned comment
blanchet
parents: 44934
diff changeset
   206
   they are displayed as "M" and we want to avoid clashes with these. But
b0f61dec677a tuned comment
blanchet
parents: 44934
diff changeset
   207
   sometimes it's even worse: "Ma__" encodes "M". So we simply reserve all
b0f61dec677a tuned comment
blanchet
parents: 44934
diff changeset
   208
   prefixes of all free variables. In the worse case scenario, where the fact
b0f61dec677a tuned comment
blanchet
parents: 44934
diff changeset
   209
   won't be resolved correctly, the user can fix it manually, e.g., by naming
b0f61dec677a tuned comment
blanchet
parents: 44934
diff changeset
   210
   the fact in question. Ideally we would need nothing of it, but backticks
b0f61dec677a tuned comment
blanchet
parents: 44934
diff changeset
   211
   simply don't work with schematic variables. *)
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   212
fun all_prefixes_of s =
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   213
  map (fn i => String.extract (s, 0, SOME i)) (1 upto size s - 1)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   214
fun close_form t =
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   215
  (t, [] |> Term.add_free_names t |> maps all_prefixes_of)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   216
  |> fold (fn ((s, i), T) => fn (t', taken) =>
43324
2b47822868e4 discontinued Name.variant to emphasize that this is old-style / indirect;
wenzelm
parents: 43245
diff changeset
   217
              let val s' = singleton (Name.variant_list taken) s in
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   218
                ((if fastype_of t' = HOLogic.boolT then HOLogic.all_const
46217
7b19666f0e3d renamed Term.all to Logic.all_const, in accordance to HOLogic.all_const;
wenzelm
parents: 46073
diff changeset
   219
                  else Logic.all_const) T
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   220
                 $ Abs (s', T, abstract_over (Var ((s, i), T), t')),
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   221
                 s' :: taken)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   222
              end)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   223
          (Term.add_vars t [] |> sort_wrt (fst o fst))
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   224
  |> fst
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   225
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   226
fun string_for_term ctxt t =
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   227
  Print_Mode.setmp (filter (curry (op =) Symbol.xsymbolsN)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   228
                   (print_mode_value ())) (Syntax.string_of_term ctxt) t
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   229
  |> String.translate (fn c => if Char.isPrint c then str c else "")
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   230
  |> simplify_spaces
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   231
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   232
(** Structural induction rules **)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   233
41200
6cc9b6fd7f6f add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents: 41199
diff changeset
   234
fun struct_induct_rule_on th =
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   235
  case Logic.strip_horn (prop_of th) of
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   236
    (prems, @{const Trueprop}
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   237
            $ ((p as Var ((p_name, 0), _)) $ (a as Var (_, ind_T)))) =>
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   238
    if not (is_TVar ind_T) andalso length prems > 1 andalso
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   239
       exists (exists_subterm (curry (op aconv) p)) prems andalso
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   240
       not (exists (exists_subterm (curry (op aconv) a)) prems) then
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   241
      SOME (p_name, ind_T)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   242
    else
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   243
      NONE
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   244
  | _ => NONE
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   245
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   246
fun instantiate_induct_rule ctxt concl_prop p_name ((name, stature), th) ind_x =
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   247
  let
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   248
    fun varify_noninducts (t as Free (s, T)) =
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   249
        if (s, T) = ind_x orelse can dest_funT T then t else Var ((s, 0), T)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   250
      | varify_noninducts t = t
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   251
    val p_inst =
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   252
      concl_prop |> map_aterms varify_noninducts |> close_form
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   253
                 |> lambda (Free ind_x)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   254
                 |> string_for_term ctxt
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   255
  in
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   256
    ((fn () => name () ^ "[where " ^ p_name ^ " = " ^ quote p_inst ^ "]",
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   257
      stature), th |> read_instantiate ctxt [((p_name, 0), p_inst)])
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   258
  end
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   259
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   260
fun type_match thy (T1, T2) =
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   261
  (Sign.typ_match thy (T2, T1) Vartab.empty; true)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   262
  handle Type.TYPE_MATCH => false
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   263
43245
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   264
fun instantiate_if_induct_rule ctxt stmt stmt_xs (ax as (_, th)) =
41200
6cc9b6fd7f6f add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents: 41199
diff changeset
   265
  case struct_induct_rule_on th of
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   266
    SOME (p_name, ind_T) =>
42361
23f352990944 modernized structure Proof_Context;
wenzelm
parents: 42358
diff changeset
   267
    let val thy = Proof_Context.theory_of ctxt in
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   268
      stmt_xs |> filter (fn (_, T) => type_match thy (T, ind_T))
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   269
              |> map_filter (try (instantiate_induct_rule ctxt stmt p_name ax))
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   270
    end
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   271
  | NONE => [ax]
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   272
28477
9339d4dcec8b version of sledgehammer using threads instead of processes, misc cleanup;
wenzelm
parents: 28065
diff changeset
   273
(***************************************************************)
9339d4dcec8b version of sledgehammer using threads instead of processes, misc cleanup;
wenzelm
parents: 28065
diff changeset
   274
(* Relevance Filtering                                         *)
9339d4dcec8b version of sledgehammer using threads instead of processes, misc cleanup;
wenzelm
parents: 28065
diff changeset
   275
(***************************************************************)
19194
7681c04d8bff Merged res_atp_setup.ML into res_atp.ML.
mengj
parents: 18986
diff changeset
   276
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   277
(*** constants with types ***)
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   278
46073
b2594cc862d7 removed special handling for set constants in relevance filter
blanchet
parents: 45982
diff changeset
   279
fun order_of_type (Type (@{type_name fun}, [T1, T2])) =
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   280
    Int.max (order_of_type T1 + 1, order_of_type T2)
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   281
  | order_of_type (Type (_, Ts)) = fold (Integer.max o order_of_type) Ts 0
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   282
  | order_of_type _ = 0
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   283
38823
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   284
(* An abstraction of Isabelle types and first-order terms *)
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   285
datatype pattern = PVar | PApp of string * pattern list
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   286
datatype ptype = PType of int * pattern list
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   287
38823
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   288
fun string_for_pattern PVar = "_"
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   289
  | string_for_pattern (PApp (s, ps)) =
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   290
    if null ps then s else s ^ string_for_patterns ps
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   291
and string_for_patterns ps = "(" ^ commas (map string_for_pattern ps) ^ ")"
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   292
fun string_for_ptype (PType (_, ps)) = string_for_patterns ps
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   293
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   294
(*Is the second type an instance of the first one?*)
38824
f74513bbe627 cosmetics
blanchet
parents: 38823
diff changeset
   295
fun match_pattern (PVar, _) = true
f74513bbe627 cosmetics
blanchet
parents: 38823
diff changeset
   296
  | match_pattern (PApp _, PVar) = false
f74513bbe627 cosmetics
blanchet
parents: 38823
diff changeset
   297
  | match_pattern (PApp (s, ps), PApp (t, qs)) =
f74513bbe627 cosmetics
blanchet
parents: 38823
diff changeset
   298
    s = t andalso match_patterns (ps, qs)
f74513bbe627 cosmetics
blanchet
parents: 38823
diff changeset
   299
and match_patterns (_, []) = true
f74513bbe627 cosmetics
blanchet
parents: 38823
diff changeset
   300
  | match_patterns ([], _) = false
f74513bbe627 cosmetics
blanchet
parents: 38823
diff changeset
   301
  | match_patterns (p :: ps, q :: qs) =
f74513bbe627 cosmetics
blanchet
parents: 38823
diff changeset
   302
    match_pattern (p, q) andalso match_patterns (ps, qs)
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   303
fun match_ptype (PType (_, ps), PType (_, qs)) = match_patterns (ps, qs)
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   304
38823
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   305
(* Is there a unifiable constant? *)
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   306
fun pconst_mem f consts (s, ps) =
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   307
  exists (curry (match_ptype o f) ps)
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   308
         (map snd (filter (curry (op =) s o fst) consts))
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   309
fun pconst_hyper_mem f const_tab (s, ps) =
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   310
  exists (curry (match_ptype o f) ps) (these (Symtab.lookup const_tab s))
37505
d9af5c01dc4a added code to optionally perform fact filtering on the original (non-CNF) formulas
blanchet
parents: 37504
diff changeset
   311
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   312
fun pattern_for_type (Type (s, Ts)) = PApp (s, map pattern_for_type Ts)
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   313
  | pattern_for_type (TFree (s, _)) = PApp (s, [])
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   314
  | pattern_for_type (TVar _) = PVar
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   315
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   316
(* Pairs a constant with the list of its type instantiations. *)
41204
bd57cf5944cb get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents: 41202
diff changeset
   317
fun ptype thy const x =
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   318
  (if const then map pattern_for_type (these (try (Sign.const_typargs thy) x))
41204
bd57cf5944cb get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents: 41202
diff changeset
   319
   else [])
bd57cf5944cb get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents: 41202
diff changeset
   320
fun rich_ptype thy const (s, T) =
bd57cf5944cb get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents: 41202
diff changeset
   321
  PType (order_of_type T, ptype thy const (s, T))
bd57cf5944cb get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents: 41202
diff changeset
   322
fun rich_pconst thy const (s, T) = (s, rich_ptype thy const (s, T))
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   323
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   324
fun string_for_hyper_pconst (s, ps) =
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   325
  s ^ "{" ^ commas (map string_for_ptype ps) ^ "}"
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   326
38823
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   327
(* Add a pconstant to the table, but a [] entry means a standard
38819
71c9f61516cd if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents: 38818
diff changeset
   328
   connective, which we ignore.*)
41066
3890ef4e02f9 pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
blanchet
parents: 40418
diff changeset
   329
fun add_pconst_to_table also_skolem (s, p) =
3890ef4e02f9 pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
blanchet
parents: 40418
diff changeset
   330
  if (not also_skolem andalso String.isPrefix skolem_prefix s) then I
3890ef4e02f9 pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
blanchet
parents: 40418
diff changeset
   331
  else Symtab.map_default (s, [p]) (insert (op =) p)
38819
71c9f61516cd if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents: 38818
diff changeset
   332
42732
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   333
fun add_pconsts_in_term thy is_built_in_const also_skolems pos =
37505
d9af5c01dc4a added code to optionally perform fact filtering on the original (non-CNF) formulas
blanchet
parents: 37504
diff changeset
   334
  let
38819
71c9f61516cd if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents: 38818
diff changeset
   335
    val flip = Option.map not
38587
1317657d6aa9 fix the relevance filter so that it ignores If, Ex1, Ball, Bex
blanchet
parents: 38395
diff changeset
   336
    (* We include free variables, as well as constants, to handle locales. For
41205
209546e0af2c comment tuning
blanchet
parents: 41204
diff changeset
   337
       each quantifiers that must necessarily be skolemized by the automatic
209546e0af2c comment tuning
blanchet
parents: 41204
diff changeset
   338
       prover, we introduce a fresh constant to simulate the effect of
209546e0af2c comment tuning
blanchet
parents: 41204
diff changeset
   339
       Skolemization. *)
46073
b2594cc862d7 removed special handling for set constants in relevance filter
blanchet
parents: 45982
diff changeset
   340
    fun do_const const x ts =
41336
0ea5b9c7d233 proper handling of the arguments of SMT builtins -- for numerals, ignore the arguments (Pls, Bit0, Bit1, ..), for functions, consider them;
blanchet
parents: 41279
diff changeset
   341
      let val (built_in, ts) = is_built_in_const x ts in
46073
b2594cc862d7 removed special handling for set constants in relevance filter
blanchet
parents: 45982
diff changeset
   342
        (not built_in
b2594cc862d7 removed special handling for set constants in relevance filter
blanchet
parents: 45982
diff changeset
   343
         ? add_pconst_to_table also_skolems (rich_pconst thy const x))
b2594cc862d7 removed special handling for set constants in relevance filter
blanchet
parents: 45982
diff changeset
   344
        #> fold (do_term false) ts
41336
0ea5b9c7d233 proper handling of the arguments of SMT builtins -- for numerals, ignore the arguments (Pls, Bit0, Bit1, ..), for functions, consider them;
blanchet
parents: 41279
diff changeset
   345
      end
42741
546b0bda3cb8 do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents: 42738
diff changeset
   346
    and do_term ext_arg t =
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   347
      case strip_comb t of
46073
b2594cc862d7 removed special handling for set constants in relevance filter
blanchet
parents: 45982
diff changeset
   348
        (Const x, ts) => do_const true x ts
b2594cc862d7 removed special handling for set constants in relevance filter
blanchet
parents: 45982
diff changeset
   349
      | (Free x, ts) => do_const false x ts
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   350
      | (Abs (_, T, t'), ts) =>
42741
546b0bda3cb8 do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents: 42738
diff changeset
   351
        ((null ts andalso not ext_arg)
546b0bda3cb8 do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents: 42738
diff changeset
   352
         (* Since lambdas on the right-hand side of equalities are usually
546b0bda3cb8 do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents: 42738
diff changeset
   353
            extensionalized later by "extensionalize_term", we don't penalize
546b0bda3cb8 do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents: 42738
diff changeset
   354
            them here. *)
41066
3890ef4e02f9 pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
blanchet
parents: 40418
diff changeset
   355
         ? add_pconst_to_table true (abs_name, PType (order_of_type T + 1, [])))
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   356
        #> fold (do_term false) (t' :: ts)
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   357
      | (_, ts) => fold (do_term false) ts
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   358
    fun do_quantifier will_surely_be_skolemized abs_T body_t =
37537
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   359
      do_formula pos body_t
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   360
      #> (if also_skolems andalso will_surely_be_skolemized then
41066
3890ef4e02f9 pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
blanchet
parents: 40418
diff changeset
   361
            add_pconst_to_table true
43559
c1966f322105 old gensym is now legacy -- global state is out of fashion, and its result is not guaranteed to be fresh;
wenzelm
parents: 43492
diff changeset
   362
                (legacy_gensym skolem_prefix, PType (order_of_type abs_T, []))
38587
1317657d6aa9 fix the relevance filter so that it ignores If, Ex1, Ball, Bex
blanchet
parents: 38395
diff changeset
   363
          else
1317657d6aa9 fix the relevance filter so that it ignores If, Ex1, Ball, Bex
blanchet
parents: 38395
diff changeset
   364
            I)
42741
546b0bda3cb8 do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents: 42738
diff changeset
   365
    and do_term_or_formula ext_arg T =
546b0bda3cb8 do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents: 42738
diff changeset
   366
      if T = HOLogic.boolT then do_formula NONE else do_term ext_arg
37537
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   367
    and do_formula pos t =
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   368
      case t of
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   369
        Const (@{const_name all}, _) $ Abs (_, T, t') =>
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   370
        do_quantifier (pos = SOME false) T t'
37537
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   371
      | @{const "==>"} $ t1 $ t2 =>
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   372
        do_formula (flip pos) t1 #> do_formula pos t2
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   373
      | Const (@{const_name "=="}, Type (_, [T, _])) $ t1 $ t2 =>
42741
546b0bda3cb8 do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents: 42738
diff changeset
   374
        do_term_or_formula false T t1 #> do_term_or_formula true T t2
37537
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   375
      | @{const Trueprop} $ t1 => do_formula pos t1
41140
9c68004b8c9d added Sledgehammer support for higher-order propositional reasoning
blanchet
parents: 41138
diff changeset
   376
      | @{const False} => I
9c68004b8c9d added Sledgehammer support for higher-order propositional reasoning
blanchet
parents: 41138
diff changeset
   377
      | @{const True} => I
37537
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   378
      | @{const Not} $ t1 => do_formula (flip pos) t1
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   379
      | Const (@{const_name All}, _) $ Abs (_, T, t') =>
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   380
        do_quantifier (pos = SOME false) T t'
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   381
      | Const (@{const_name Ex}, _) $ Abs (_, T, t') =>
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   382
        do_quantifier (pos = SOME true) T t'
38795
848be46708dc formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents: 38786
diff changeset
   383
      | @{const HOL.conj} $ t1 $ t2 => fold (do_formula pos) [t1, t2]
848be46708dc formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents: 38786
diff changeset
   384
      | @{const HOL.disj} $ t1 $ t2 => fold (do_formula pos) [t1, t2]
38786
e46e7a9cb622 formerly unnamed infix impliciation now named HOL.implies
haftmann
parents: 38752
diff changeset
   385
      | @{const HOL.implies} $ t1 $ t2 =>
37537
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   386
        do_formula (flip pos) t1 #> do_formula pos t2
38864
4abe644fcea5 formerly unnamed infix equality now named HOL.eq
haftmann
parents: 38829
diff changeset
   387
      | Const (@{const_name HOL.eq}, Type (_, [T, _])) $ t1 $ t2 =>
42741
546b0bda3cb8 do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents: 42738
diff changeset
   388
        do_term_or_formula false T t1 #> do_term_or_formula true T t2
38587
1317657d6aa9 fix the relevance filter so that it ignores If, Ex1, Ball, Bex
blanchet
parents: 38395
diff changeset
   389
      | Const (@{const_name If}, Type (_, [_, Type (_, [T, _])]))
1317657d6aa9 fix the relevance filter so that it ignores If, Ex1, Ball, Bex
blanchet
parents: 38395
diff changeset
   390
        $ t1 $ t2 $ t3 =>
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   391
        do_formula NONE t1 #> fold (do_term_or_formula false T) [t2, t3]
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   392
      | Const (@{const_name Ex1}, _) $ Abs (_, T, t') =>
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   393
        do_quantifier (is_some pos) T t'
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   394
      | Const (@{const_name Ball}, _) $ t1 $ Abs (_, T, t') =>
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   395
        do_quantifier (pos = SOME false) T
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   396
                      (HOLogic.mk_imp (incr_boundvars 1 t1 $ Bound 0, t'))
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   397
      | Const (@{const_name Bex}, _) $ t1 $ Abs (_, T, t') =>
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   398
        do_quantifier (pos = SOME true) T
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   399
                      (HOLogic.mk_conj (incr_boundvars 1 t1 $ Bound 0, t'))
37537
8e56d1ccf189 improve the new "natural formula" fact filter
blanchet
parents: 37515
diff changeset
   400
      | (t0 as Const (_, @{typ bool})) $ t1 =>
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   401
        do_term false t0 #> do_formula pos t1  (* theory constant *)
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   402
      | _ => do_term false t
42732
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   403
  in do_formula pos end
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   404
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   405
(*Inserts a dummy "constant" referring to the theory name, so that relevance
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   406
  takes the given theory into account.*)
41200
6cc9b6fd7f6f add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents: 41199
diff changeset
   407
fun theory_constify ({theory_const_rel_weight, theory_const_irrel_weight, ...}
6cc9b6fd7f6f add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents: 41199
diff changeset
   408
                     : relevance_fudge) thy_name t =
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   409
  if exists (curry (op <) 0.0) [theory_const_rel_weight,
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   410
                                theory_const_irrel_weight] then
41200
6cc9b6fd7f6f add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents: 41199
diff changeset
   411
    Const (thy_name ^ theory_const_suffix, @{typ bool}) $ t
37505
d9af5c01dc4a added code to optionally perform fact filtering on the original (non-CNF) formulas
blanchet
parents: 37504
diff changeset
   412
  else
41200
6cc9b6fd7f6f add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents: 41199
diff changeset
   413
    t
6cc9b6fd7f6f add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents: 41199
diff changeset
   414
6cc9b6fd7f6f add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents: 41199
diff changeset
   415
fun theory_const_prop_of fudge th =
6cc9b6fd7f6f add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents: 41199
diff changeset
   416
  theory_constify fudge (Context.theory_name (theory_of_thm th)) (prop_of th)
37505
d9af5c01dc4a added code to optionally perform fact filtering on the original (non-CNF) formulas
blanchet
parents: 37504
diff changeset
   417
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   418
(**** Constant / Type Frequencies ****)
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   419
38743
69fa75354c58 simplify more code
blanchet
parents: 38742
diff changeset
   420
(* A two-dimensional symbol table counts frequencies of constants. It's keyed
69fa75354c58 simplify more code
blanchet
parents: 38742
diff changeset
   421
   first by constant name and second by its list of type instantiations. For the
38823
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   422
   latter, we need a linear ordering on "pattern list". *)
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   423
38823
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   424
fun pattern_ord p =
38743
69fa75354c58 simplify more code
blanchet
parents: 38742
diff changeset
   425
  case p of
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   426
    (PVar, PVar) => EQUAL
38823
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   427
  | (PVar, PApp _) => LESS
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   428
  | (PApp _, PVar) => GREATER
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   429
  | (PApp q1, PApp q2) =>
828e68441a2f renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents: 38822
diff changeset
   430
    prod_ord fast_string_ord (dict_ord pattern_ord) (q1, q2)
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   431
fun ptype_ord (PType p, PType q) =
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   432
  prod_ord (dict_ord pattern_ord) int_ord (swap p, swap q)
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   433
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   434
structure PType_Tab = Table(type key = ptype val ord = ptype_ord)
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   435
40204
da97d75e20e6 standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents: 40191
diff changeset
   436
fun count_fact_consts thy fudge =
37503
c2dfa26b9da6 cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents: 37502
diff changeset
   437
  let
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   438
    fun do_const const (s, T) ts =
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   439
      (* Two-dimensional table update. Constant maps to types maps to count. *)
41204
bd57cf5944cb get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents: 41202
diff changeset
   440
      PType_Tab.map_default (rich_ptype thy const (s, T), 0) (Integer.add 1)
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   441
      |> Symtab.map_default (s, PType_Tab.empty)
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   442
      #> fold do_term ts
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   443
    and do_term t =
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   444
      case strip_comb t of
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   445
        (Const x, ts) => do_const true x ts
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   446
      | (Free x, ts) => do_const false x ts
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   447
      | (Abs (_, _, t'), ts) => fold do_term (t' :: ts)
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   448
      | (_, ts) => fold do_term ts
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   449
  in do_term o theory_const_prop_of fudge o snd end
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   450
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   451
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   452
(**** Actual Filtering Code ****)
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   453
39367
blanchet
parents: 39366
diff changeset
   454
fun pow_int _ 0 = 1.0
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   455
  | pow_int x 1 = x
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   456
  | pow_int x n = if n > 0 then x * pow_int x (n - 1) else pow_int x (n + 1) / x
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   457
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   458
(*The frequency of a constant is the sum of those of all instances of its type.*)
38824
f74513bbe627 cosmetics
blanchet
parents: 38823
diff changeset
   459
fun pconst_freq match const_tab (c, ps) =
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   460
  PType_Tab.fold (fn (qs, m) => match (ps, qs) ? Integer.add m)
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   461
                 (the (Symtab.lookup const_tab c)) 0
38686
45eeee8d6b12 modified relevance filter
blanchet
parents: 38684
diff changeset
   462
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   463
38085
cc44e887246c avoid "clause" and "cnf" terminology where it no longer makes sense
blanchet
parents: 38027
diff changeset
   464
(* A surprising number of theorems contain only a few significant constants.
cc44e887246c avoid "clause" and "cnf" terminology where it no longer makes sense
blanchet
parents: 38027
diff changeset
   465
   These include all induction rules, and other general theorems. *)
37503
c2dfa26b9da6 cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents: 37502
diff changeset
   466
c2dfa26b9da6 cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents: 37502
diff changeset
   467
(* "log" seems best in practice. A constant function of one ignores the constant
38938
2b93dbc07778 improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents: 38937
diff changeset
   468
   frequencies. Rare constants give more points if they are relevant than less
2b93dbc07778 improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents: 38937
diff changeset
   469
   rare ones. *)
39367
blanchet
parents: 39366
diff changeset
   470
fun rel_weight_for _ freq = 1.0 + 2.0 / Math.ln (Real.fromInt freq + 1.0)
38938
2b93dbc07778 improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents: 38937
diff changeset
   471
2b93dbc07778 improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents: 38937
diff changeset
   472
(* Irrelevant constants are treated differently. We associate lower penalties to
2b93dbc07778 improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents: 38937
diff changeset
   473
   very rare constants and very common ones -- the former because they can't
2b93dbc07778 improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents: 38937
diff changeset
   474
   lead to the inclusion of too many new facts, and the latter because they are
2b93dbc07778 improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents: 38937
diff changeset
   475
   so common as to be of little interest. *)
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   476
fun irrel_weight_for ({worse_irrel_freq, higher_order_irrel_weight, ...}
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   477
                      : relevance_fudge) order freq =
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   478
  let val (k, x) = worse_irrel_freq |> `Real.ceil in
38939
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   479
    (if freq < k then Math.ln (Real.fromInt (freq + 1)) / Math.ln x
f0aa0c49fdbf add a penalty for being higher-order
blanchet
parents: 38938
diff changeset
   480
     else rel_weight_for order freq / rel_weight_for order k)
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   481
    * pow_int higher_order_irrel_weight (order - 1)
38938
2b93dbc07778 improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents: 38937
diff changeset
   482
  end
37503
c2dfa26b9da6 cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents: 37502
diff changeset
   483
41790
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   484
fun multiplier_for_const_name local_const_multiplier s =
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   485
  if String.isSubstring "." s then 1.0 else local_const_multiplier
38821
d0275b6c4e9d avoid needless "that" fact
blanchet
parents: 38820
diff changeset
   486
41790
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   487
(* Computes a constant's weight, as determined by its frequency. *)
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   488
fun generic_pconst_weight local_const_multiplier abs_weight skolem_weight
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   489
                          theory_const_weight chained_const_weight weight_for f
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   490
                          const_tab chained_const_tab (c as (s, PType (m, _))) =
41790
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   491
  if s = abs_name then
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   492
    abs_weight
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   493
  else if String.isPrefix skolem_prefix s then
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   494
    skolem_weight
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   495
  else if String.isSuffix theory_const_suffix s then
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   496
    theory_const_weight
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   497
  else
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   498
    multiplier_for_const_name local_const_multiplier s
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   499
    * weight_for m (pconst_freq (match_ptype o f) const_tab c)
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   500
    |> (if chained_const_weight < 1.0 andalso
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   501
           pconst_hyper_mem I chained_const_tab c then
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   502
          curry (op *) chained_const_weight
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   503
        else
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   504
          I)
41790
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   505
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   506
fun rel_pconst_weight ({local_const_multiplier, abs_rel_weight,
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   507
                        theory_const_rel_weight, ...} : relevance_fudge)
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   508
                      const_tab =
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   509
  generic_pconst_weight local_const_multiplier abs_rel_weight 0.0
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   510
                        theory_const_rel_weight 0.0 rel_weight_for I const_tab
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   511
                        Symtab.empty
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   512
41790
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   513
fun irrel_pconst_weight (fudge as {local_const_multiplier, abs_irrel_weight,
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   514
                                   skolem_irrel_weight,
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   515
                                   theory_const_irrel_weight,
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   516
                                   chained_const_irrel_weight, ...})
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   517
                        const_tab chained_const_tab =
41790
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   518
  generic_pconst_weight local_const_multiplier abs_irrel_weight
56dcd46ddf7a give more weight to Frees than to Consts in relevance filter
blanchet
parents: 41768
diff changeset
   519
                        skolem_irrel_weight theory_const_irrel_weight
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   520
                        chained_const_irrel_weight (irrel_weight_for fudge) swap
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   521
                        const_tab chained_const_tab
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   522
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   523
fun stature_bonus ({intro_bonus, ...} : relevance_fudge) (_, Intro) =
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   524
    intro_bonus
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   525
  | stature_bonus {elim_bonus, ...} (_, Elim) = elim_bonus
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   526
  | stature_bonus {simp_bonus, ...} (_, Simp) = simp_bonus
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   527
  | stature_bonus {local_bonus, ...} (Local, _) = local_bonus
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   528
  | stature_bonus {assum_bonus, ...} (Assum, _) = assum_bonus
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   529
  | stature_bonus {chained_bonus, ...} (Chained, _) = chained_bonus
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   530
  | stature_bonus _ _ = 0.0
38751
01c4d14b2a61 add a bonus for chained facts, since they are likely to be relevant;
blanchet
parents: 38749
diff changeset
   531
40418
8b73059e97a1 better detection of completely irrelevant facts
blanchet
parents: 40408
diff changeset
   532
fun is_odd_const_name s =
8b73059e97a1 better detection of completely irrelevant facts
blanchet
parents: 40408
diff changeset
   533
  s = abs_name orelse String.isPrefix skolem_prefix s orelse
8b73059e97a1 better detection of completely irrelevant facts
blanchet
parents: 40408
diff changeset
   534
  String.isSuffix theory_const_suffix s
8b73059e97a1 better detection of completely irrelevant facts
blanchet
parents: 40408
diff changeset
   535
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   536
fun fact_weight fudge stature const_tab relevant_consts chained_consts
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   537
                fact_consts =
40204
da97d75e20e6 standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents: 40191
diff changeset
   538
  case fact_consts |> List.partition (pconst_hyper_mem I relevant_consts)
da97d75e20e6 standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents: 40191
diff changeset
   539
                   ||> filter_out (pconst_hyper_mem swap relevant_consts) of
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   540
    ([], _) => 0.0
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   541
  | (rel, irrel) =>
40418
8b73059e97a1 better detection of completely irrelevant facts
blanchet
parents: 40408
diff changeset
   542
    if forall (forall (is_odd_const_name o fst)) [rel, irrel] then
40371
8fe3c26c49af ignore facts with only theory constants in them
blanchet
parents: 40369
diff changeset
   543
      0.0
8fe3c26c49af ignore facts with only theory constants in them
blanchet
parents: 40369
diff changeset
   544
    else
8fe3c26c49af ignore facts with only theory constants in them
blanchet
parents: 40369
diff changeset
   545
      let
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   546
        val irrel = irrel |> filter_out (pconst_mem swap rel)
40371
8fe3c26c49af ignore facts with only theory constants in them
blanchet
parents: 40369
diff changeset
   547
        val rel_weight =
8fe3c26c49af ignore facts with only theory constants in them
blanchet
parents: 40369
diff changeset
   548
          0.0 |> fold (curry (op +) o rel_pconst_weight fudge const_tab) rel
8fe3c26c49af ignore facts with only theory constants in them
blanchet
parents: 40369
diff changeset
   549
        val irrel_weight =
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   550
          ~ (stature_bonus fudge stature)
42735
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   551
          |> fold (curry (op +)
1d375de437e9 fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents: 42732
diff changeset
   552
                   o irrel_pconst_weight fudge const_tab chained_consts) irrel
40371
8fe3c26c49af ignore facts with only theory constants in them
blanchet
parents: 40369
diff changeset
   553
        val res = rel_weight / (rel_weight + irrel_weight)
8fe3c26c49af ignore facts with only theory constants in them
blanchet
parents: 40369
diff changeset
   554
      in if Real.isFinite res then res else 0.0 end
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   555
40369
53dca3bd4250 use the SMT integration's official list of built-ins
blanchet
parents: 40251
diff changeset
   556
fun pconsts_in_fact thy is_built_in_const t =
38825
4ec3cbd95f25 rename and simplify
blanchet
parents: 38824
diff changeset
   557
  Symtab.fold (fn (s, pss) => fold (cons o pair s) pss)
42732
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   558
              (Symtab.empty |> add_pconsts_in_term thy is_built_in_const true
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   559
                                                   (SOME true) t) []
42729
e011f632227c tune whitespace
blanchet
parents: 42728
diff changeset
   560
40369
53dca3bd4250 use the SMT integration's official list of built-ins
blanchet
parents: 40251
diff changeset
   561
fun pair_consts_fact thy is_built_in_const fudge fact =
40204
da97d75e20e6 standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents: 40191
diff changeset
   562
  case fact |> snd |> theory_const_prop_of fudge
40369
53dca3bd4250 use the SMT integration's official list of built-ins
blanchet
parents: 40251
diff changeset
   563
            |> pconsts_in_fact thy is_built_in_const of
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   564
    [] => NONE
40204
da97d75e20e6 standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents: 40191
diff changeset
   565
  | consts => SOME ((fact, consts), NONE)
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   566
41768
dd2125fb75f9 export more functionality of Sledgehammer to applications (for experiments)
blanchet
parents: 41767
diff changeset
   567
val const_names_in_fact = map fst ooo pconsts_in_fact
dd2125fb75f9 export more functionality of Sledgehammer to applications (for experiments)
blanchet
parents: 41767
diff changeset
   568
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   569
type annotated_thm =
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   570
  (((unit -> string) * stature) * thm) * (string * ptype) list
37505
d9af5c01dc4a added code to optionally perform fact filtering on the original (non-CNF) formulas
blanchet
parents: 37504
diff changeset
   571
42646
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
   572
fun take_most_relevant ctxt max_relevant remaining_max
42728
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
   573
        ({max_imperfect, max_imperfect_exp, ...} : relevance_fudge)
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   574
        (candidates : (annotated_thm * real) list) =
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   575
  let
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   576
    val max_imperfect =
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   577
      Real.ceil (Math.pow (max_imperfect,
38904
5e760c0f81a6 rule out low-level class facts
blanchet
parents: 38901
diff changeset
   578
                    Math.pow (Real.fromInt remaining_max
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   579
                              / Real.fromInt max_relevant, max_imperfect_exp)))
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   580
    val (perfect, imperfect) =
38889
d0e3f68dde63 fiddle with the relevance filter
blanchet
parents: 38829
diff changeset
   581
      candidates |> sort (Real.compare o swap o pairself snd)
d0e3f68dde63 fiddle with the relevance filter
blanchet
parents: 38829
diff changeset
   582
                 |> take_prefix (fn (_, w) => w > 0.99999)
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   583
    val ((accepts, more_rejects), rejects) =
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   584
      chop max_imperfect imperfect |>> append perfect |>> chop remaining_max
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   585
  in
42646
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
   586
    trace_msg ctxt (fn () =>
41491
a2ad5b824051 eliminated Int.toString;
wenzelm
parents: 41336
diff changeset
   587
        "Actually passed (" ^ string_of_int (length accepts) ^ " of " ^
a2ad5b824051 eliminated Int.toString;
wenzelm
parents: 41336
diff changeset
   588
        string_of_int (length candidates) ^ "): " ^
38889
d0e3f68dde63 fiddle with the relevance filter
blanchet
parents: 38829
diff changeset
   589
        (accepts |> map (fn ((((name, _), _), _), weight) =>
38752
6628adcae4a7 consider "locality" when assigning weights to facts
blanchet
parents: 38751
diff changeset
   590
                            name () ^ " [" ^ Real.toString weight ^ "]")
38745
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   591
                 |> commas));
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   592
    (accepts, more_rejects @ rejects)
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   593
  end
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   594
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   595
fun if_empty_replace_with_scope thy is_built_in_const facts sc tab =
38819
71c9f61516cd if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents: 38818
diff changeset
   596
  if Symtab.is_empty tab then
42732
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   597
    Symtab.empty
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   598
    |> fold (add_pconsts_in_term thy is_built_in_const false (SOME false))
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   599
            (map_filter (fn ((_, (sc', _)), th) =>
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   600
                            if sc' = sc then SOME (prop_of th) else NONE) facts)
38819
71c9f61516cd if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents: 38818
diff changeset
   601
  else
71c9f61516cd if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents: 38818
diff changeset
   602
    tab
71c9f61516cd if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents: 38818
diff changeset
   603
42702
blanchet
parents: 42680
diff changeset
   604
fun consider_arities is_built_in_const th =
41158
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   605
  let
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   606
    fun aux _ _ NONE = NONE
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   607
      | aux t args (SOME tab) =
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   608
        case t of
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   609
          t1 $ t2 => SOME tab |> aux t1 (t2 :: args) |> aux t2 []
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   610
        | Const (x as (s, _)) =>
41336
0ea5b9c7d233 proper handling of the arguments of SMT builtins -- for numerals, ignore the arguments (Pls, Bit0, Bit1, ..), for functions, consider them;
blanchet
parents: 41279
diff changeset
   611
          (if is_built_in_const x args |> fst then
41158
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   612
             SOME tab
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   613
           else case Symtab.lookup tab s of
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   614
             NONE => SOME (Symtab.update (s, length args) tab)
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   615
           | SOME n => if n = length args then SOME tab else NONE)
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   616
        | _ => SOME tab
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   617
  in aux (prop_of th) [] end
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   618
44785
f4975fa4a2f8 parse new experimental '@' encodings
blanchet
parents: 44783
diff changeset
   619
(* FIXME: This is currently only useful for polymorphic type encodings. *)
42702
blanchet
parents: 42680
diff changeset
   620
fun could_benefit_from_ext is_built_in_const facts =
blanchet
parents: 42680
diff changeset
   621
  fold (consider_arities is_built_in_const o snd) facts (SOME Symtab.empty)
41158
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   622
  |> is_none
8c9c31a757f5 make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents: 41140
diff changeset
   623
43492
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   624
(* High enough so that it isn't wrongly considered as very relevant (e.g., for E
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   625
   weights), but low enough so that it is unlikely to be truncated away if few
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   626
   facts are included. *)
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   627
val special_fact_index = 75
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   628
44625
4a1132815a70 more tuning
blanchet
parents: 44586
diff changeset
   629
fun relevance_filter ctxt threshold0 decay max_relevant is_built_in_const
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   630
        (fudge as {threshold_divisor, ridiculous_threshold, ...})
42732
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   631
        ({add, del, ...} : relevance_override) facts chained_ts hyp_ts concl_t =
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   632
  let
42361
23f352990944 modernized structure Proof_Context;
wenzelm
parents: 42358
diff changeset
   633
    val thy = Proof_Context.theory_of ctxt
40204
da97d75e20e6 standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents: 40191
diff changeset
   634
    val const_tab = fold (count_fact_consts thy fudge) facts Symtab.empty
42732
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   635
    val add_pconsts = add_pconsts_in_term thy is_built_in_const false o SOME
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   636
    val chained_const_tab = Symtab.empty |> fold (add_pconsts true) chained_ts
38819
71c9f61516cd if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents: 38818
diff changeset
   637
    val goal_const_tab =
42732
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   638
      Symtab.empty |> fold (add_pconsts true) hyp_ts
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   639
                   |> add_pconsts false concl_t
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   640
      |> (fn tab => if Symtab.is_empty tab then chained_const_tab else tab)
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   641
      |> fold (if_empty_replace_with_scope thy is_built_in_const facts)
38993
504b9e1efd33 give priority to assumptions in structured proofs
blanchet
parents: 38992
diff changeset
   642
              [Chained, Assum, Local]
39012
96d97d1c676f cosmetics
blanchet
parents: 38997
diff changeset
   643
    val add_ths = Attrib.eval_thms ctxt add
96d97d1c676f cosmetics
blanchet
parents: 38997
diff changeset
   644
    val del_ths = Attrib.eval_thms ctxt del
42957
c693f9b7674a use "eq_thm_prop" for slacker comparison -- ensures that backtick-quoted chained facts are recognized in the minimizer, among other things
blanchet
parents: 42952
diff changeset
   645
    val facts = facts |> filter_out (member Thm.eq_thm_prop del_ths o snd)
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   646
    fun iter j remaining_max threshold rel_const_tab hopeless hopeful =
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   647
      let
40191
257d2e06bfb8 put theorems added using "add:" at the beginning of the list returned by the relevance filter, so that they don't get truncated away
blanchet
parents: 40071
diff changeset
   648
        fun relevant [] _ [] =
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   649
            (* Nothing has been added this iteration. *)
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   650
            if j = 0 andalso threshold >= ridiculous_threshold then
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   651
              (* First iteration? Try again. *)
40070
bdb890782d4a replaced references with proper record that's threaded through
blanchet
parents: 39958
diff changeset
   652
              iter 0 max_relevant (threshold / threshold_divisor) rel_const_tab
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   653
                   hopeless hopeful
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   654
            else
40191
257d2e06bfb8 put theorems added using "add:" at the beginning of the list returned by the relevance filter, so that they don't get truncated away
blanchet
parents: 40071
diff changeset
   655
              []
38889
d0e3f68dde63 fiddle with the relevance filter
blanchet
parents: 38829
diff changeset
   656
          | relevant candidates rejects [] =
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   657
            let
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   658
              val (accepts, more_rejects) =
42646
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
   659
                take_most_relevant ctxt max_relevant remaining_max fudge
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
   660
                                   candidates
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   661
              val rel_const_tab' =
38745
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   662
                rel_const_tab
41066
3890ef4e02f9 pass constant arguments to the built-in check function, cf. d2b1fc1b8e19
blanchet
parents: 40418
diff changeset
   663
                |> fold (add_pconst_to_table false) (maps (snd o fst) accepts)
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   664
              fun is_dirty (c, _) =
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   665
                Symtab.lookup rel_const_tab' c <> Symtab.lookup rel_const_tab c
38745
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   666
              val (hopeful_rejects, hopeless_rejects) =
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   667
                 (rejects @ hopeless, ([], []))
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   668
                 |-> fold (fn (ax as (_, consts), old_weight) =>
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   669
                              if exists is_dirty consts then
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   670
                                apfst (cons (ax, NONE))
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   671
                              else
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   672
                                apsnd (cons (ax, old_weight)))
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   673
                 |>> append (more_rejects
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   674
                             |> map (fn (ax as (_, consts), old_weight) =>
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   675
                                        (ax, if exists is_dirty consts then NONE
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   676
                                             else SOME old_weight)))
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   677
              val threshold =
38822
aa0101e618e2 fix threshold computation + remove "op =" from relevant constants
blanchet
parents: 38821
diff changeset
   678
                1.0 - (1.0 - threshold)
aa0101e618e2 fix threshold computation + remove "op =" from relevant constants
blanchet
parents: 38821
diff changeset
   679
                      * Math.pow (decay, Real.fromInt (length accepts))
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   680
              val remaining_max = remaining_max - length accepts
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   681
            in
42646
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
   682
              trace_msg ctxt (fn () => "New or updated constants: " ^
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   683
                  commas (rel_const_tab' |> Symtab.dest
38822
aa0101e618e2 fix threshold computation + remove "op =" from relevant constants
blanchet
parents: 38821
diff changeset
   684
                          |> subtract (op =) (rel_const_tab |> Symtab.dest)
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   685
                          |> map string_for_hyper_pconst));
38745
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   686
              map (fst o fst) accepts @
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   687
              (if remaining_max = 0 then
40191
257d2e06bfb8 put theorems added using "add:" at the beginning of the list returned by the relevance filter, so that they don't get truncated away
blanchet
parents: 40071
diff changeset
   688
                 []
38745
ad577fd62ee4 reorganize options regarding to the relevance threshold and decay
blanchet
parents: 38744
diff changeset
   689
               else
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   690
                 iter (j + 1) remaining_max threshold rel_const_tab'
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   691
                      hopeless_rejects hopeful_rejects)
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   692
            end
38889
d0e3f68dde63 fiddle with the relevance filter
blanchet
parents: 38829
diff changeset
   693
          | relevant candidates rejects
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   694
                     (((ax as (((_, stature), _), fact_consts)), cached_weight)
38747
b264ae66cede fiddle with relevance filter
blanchet
parents: 38745
diff changeset
   695
                      :: hopeful) =
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   696
            let
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   697
              val weight =
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   698
                case cached_weight of
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   699
                  SOME w => w
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   700
                | NONE => fact_weight fudge stature const_tab rel_const_tab
42732
86683865278d no penality for constants that appear in chained facts
blanchet
parents: 42730
diff changeset
   701
                                      chained_const_tab fact_consts
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   702
            in
38741
7635bf8918a1 get rid of "defs_relevant" feature;
blanchet
parents: 38739
diff changeset
   703
              if weight >= threshold then
38889
d0e3f68dde63 fiddle with the relevance filter
blanchet
parents: 38829
diff changeset
   704
                relevant ((ax, weight) :: candidates) rejects hopeful
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   705
              else
38889
d0e3f68dde63 fiddle with the relevance filter
blanchet
parents: 38829
diff changeset
   706
                relevant candidates ((ax, weight) :: rejects) hopeful
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   707
            end
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   708
        in
42646
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
   709
          trace_msg ctxt (fn () =>
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   710
              "ITERATION " ^ string_of_int j ^ ": current threshold: " ^
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   711
              Real.toString threshold ^ ", constants: " ^
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   712
              commas (rel_const_tab |> Symtab.dest
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   713
                      |> filter (curry (op <>) [] o snd)
38827
cf01645cbbce extended relevance filter with first-order term matching
blanchet
parents: 38825
diff changeset
   714
                      |> map string_for_hyper_pconst));
38889
d0e3f68dde63 fiddle with the relevance filter
blanchet
parents: 38829
diff changeset
   715
          relevant [] [] hopeful
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   716
        end
42826
be0e66ccebfa append special boring facts rather than prepend them, to avoid confusing E's weighting mechanism
blanchet
parents: 42812
diff changeset
   717
    fun prepend_facts ths accepts =
42957
c693f9b7674a use "eq_thm_prop" for slacker comparison -- ensures that backtick-quoted chained facts are recognized in the minimizer, among other things
blanchet
parents: 42952
diff changeset
   718
      ((facts |> filter (member Thm.eq_thm_prop ths o snd)) @
c693f9b7674a use "eq_thm_prop" for slacker comparison -- ensures that backtick-quoted chained facts are recognized in the minimizer, among other things
blanchet
parents: 42952
diff changeset
   719
       (accepts |> filter_out (member Thm.eq_thm_prop ths o snd)))
40408
0d0acdf068b8 always honor the max relevant constraint
blanchet
parents: 40375
diff changeset
   720
      |> take max_relevant
43492
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   721
    fun insert_into_facts accepts [] = accepts
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   722
      | insert_into_facts accepts ths =
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   723
        let
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   724
          val add = facts |> filter (member Thm.eq_thm_prop ths o snd)
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   725
          val (bef, after) =
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   726
            accepts |> filter_out (member Thm.eq_thm_prop ths o snd)
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   727
                    |> take (max_relevant - length add)
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   728
                    |> chop special_fact_index
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   729
        in bef @ add @ after end
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   730
    fun insert_special_facts accepts =
43066
e0d4841c5b4a fixed bug in appending special facts introduced in be0e66ccebfa -- if several special facts were added, they overwrote each other
blanchet
parents: 42957
diff changeset
   731
       [] |> could_benefit_from_ext is_built_in_const accepts ? cons @{thm ext}
43492
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   732
          |> insert_into_facts accepts
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   733
  in
40369
53dca3bd4250 use the SMT integration's official list of built-ins
blanchet
parents: 40251
diff changeset
   734
    facts |> map_filter (pair_consts_fact thy is_built_in_const fudge)
40204
da97d75e20e6 standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents: 40191
diff changeset
   735
          |> iter 0 max_relevant threshold0 goal_const_tab []
42826
be0e66ccebfa append special boring facts rather than prepend them, to avoid confusing E's weighting mechanism
blanchet
parents: 42812
diff changeset
   736
          |> not (null add_ths) ? prepend_facts add_ths
43492
43326cadc31a insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents: 43477
diff changeset
   737
          |> insert_special_facts
42646
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
   738
          |> tap (fn accepts => trace_msg ctxt (fn () =>
41491
a2ad5b824051 eliminated Int.toString;
wenzelm
parents: 41336
diff changeset
   739
                      "Total relevant: " ^ string_of_int (length accepts)))
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   740
  end
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   741
38744
2b6333f78a9e make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents: 38743
diff changeset
   742
24287
c857dac06da6 combining the relevance filter with res_atp
paulson
parents: 24286
diff changeset
   743
(***************************************************************)
19768
9afd9b9c47d0 ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents: 19746
diff changeset
   744
(* Retrieving and filtering lemmas                             *)
9afd9b9c47d0 ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents: 19746
diff changeset
   745
(***************************************************************)
9afd9b9c47d0 ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents: 19746
diff changeset
   746
33022
c95102496490 Removal of the unused atpset concept, the atp attribute and some related code.
paulson
parents: 32994
diff changeset
   747
(*** retrieve lemmas and filter them ***)
19768
9afd9b9c47d0 ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents: 19746
diff changeset
   748
20757
fe84fe0dfd30 Definitions produced by packages are now blacklisted.
paulson
parents: 20661
diff changeset
   749
(*Reject theorems with names like "List.filter.filter_list_def" or
21690
552d20ff9a95 Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents: 21588
diff changeset
   750
  "Accessible_Part.acc.defs", as these are definitions arising from packages.*)
20757
fe84fe0dfd30 Definitions produced by packages are now blacklisted.
paulson
parents: 20661
diff changeset
   751
fun is_package_def a =
40205
277508b07418 if "debug" is on, print list of relevant facts (poweruser request);
blanchet
parents: 40204
diff changeset
   752
  let val names = Long_Name.explode a in
277508b07418 if "debug" is on, print list of relevant facts (poweruser request);
blanchet
parents: 40204
diff changeset
   753
    (length names > 2 andalso not (hd names = "local") andalso
277508b07418 if "debug" is on, print list of relevant facts (poweruser request);
blanchet
parents: 40204
diff changeset
   754
     String.isSuffix "_def" a) orelse String.isSuffix "_defs" a
277508b07418 if "debug" is on, print list of relevant facts (poweruser request);
blanchet
parents: 40204
diff changeset
   755
  end
20757
fe84fe0dfd30 Definitions produced by packages are now blacklisted.
paulson
parents: 20661
diff changeset
   756
43245
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   757
fun uniquify xs =
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   758
  Termtab.fold (cons o snd)
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   759
               (fold (Termtab.update o `(prop_of o snd)) xs Termtab.empty) []
19768
9afd9b9c47d0 ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents: 19746
diff changeset
   760
37626
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   761
(* FIXME: put other record thms here, or declare as "no_atp" *)
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   762
fun multi_base_blacklist ctxt ho_atp =
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   763
  ["defs", "select_defs", "update_defs", "split", "splits", "split_asm",
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   764
   "cases", "ext_cases", "eq.simps", "eq.refl", "nchotomy", "case_cong",
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   765
   "weak_case_cong"]
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   766
  |> not (ho_atp orelse (Config.get ctxt instantiate_inducts)) ?
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   767
        append ["induct", "inducts"]
38682
3a203da3f89b weed out junk in relevance filter
blanchet
parents: 38681
diff changeset
   768
  |> map (prefix ".")
37626
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   769
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   770
val max_lambda_nesting = 3 (*only applies if not ho_atp*)
37626
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   771
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   772
fun term_has_too_many_lambdas max (t1 $ t2) =
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   773
    exists (term_has_too_many_lambdas max) [t1, t2]
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   774
  | term_has_too_many_lambdas max (Abs (_, _, t)) =
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   775
    max = 0 orelse term_has_too_many_lambdas (max - 1) t
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   776
  | term_has_too_many_lambdas _ _ = false
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   777
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   778
(* Don't count nested lambdas at the level of formulas, since they are
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   779
   quantifiers. *)
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   780
fun formula_has_too_many_lambdas true _ _ = false (*i.e. ho_atp*)
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   781
  | formula_has_too_many_lambdas _ Ts (Abs (_, T, t)) =
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   782
      formula_has_too_many_lambdas false (T :: Ts) t
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   783
  | formula_has_too_many_lambdas _ Ts t =
41273
35ce17cd7967 made the relevance filter treat unatomizable facts like "atomize_all" properly (these result in problems that get E spinning seemingly forever);
blanchet
parents: 41211
diff changeset
   784
    if member (op =) [HOLogic.boolT, propT] (fastype_of1 (Ts, t)) then
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   785
      exists (formula_has_too_many_lambdas false Ts) (#2 (strip_comb t))
37626
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   786
    else
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   787
      term_has_too_many_lambdas max_lambda_nesting t
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   788
38692
89d3550d8e16 cosmetics
blanchet
parents: 38689
diff changeset
   789
(* The max apply depth of any "metis" call in "Metis_Examples" (on 2007-10-31)
37626
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   790
   was 11. *)
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   791
val max_apply_depth = 15
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   792
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   793
fun apply_depth (f $ t) = Int.max (apply_depth f, apply_depth t + 1)
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   794
  | apply_depth (Abs (_, _, t)) = apply_depth t
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   795
  | apply_depth _ = 0
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   796
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   797
fun is_formula_too_complex ho_atp t =
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   798
  apply_depth t > max_apply_depth orelse formula_has_too_many_lambdas ho_atp [] t
37626
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   799
39946
78faa9b31202 move Metis into Plain
blanchet
parents: 39896
diff changeset
   800
(* FIXME: Extend to "Meson" and "Metis" *)
37543
2e733b0a963c a76ace919f1c wasn't quite right; second try
blanchet
parents: 37538
diff changeset
   801
val exists_sledgehammer_const =
37626
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   802
  exists_Const (fn (s, _) => String.isPrefix sledgehammer_prefix s)
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   803
38904
5e760c0f81a6 rule out low-level class facts
blanchet
parents: 38901
diff changeset
   804
(* FIXME: make more reliable *)
5e760c0f81a6 rule out low-level class facts
blanchet
parents: 38901
diff changeset
   805
val exists_low_level_class_const =
5e760c0f81a6 rule out low-level class facts
blanchet
parents: 38901
diff changeset
   806
  exists_Const (fn (s, _) =>
5e760c0f81a6 rule out low-level class facts
blanchet
parents: 38901
diff changeset
   807
     String.isSubstring (Long_Name.separator ^ "class" ^ Long_Name.separator) s)
5e760c0f81a6 rule out low-level class facts
blanchet
parents: 38901
diff changeset
   808
38821
d0275b6c4e9d avoid needless "that" fact
blanchet
parents: 38820
diff changeset
   809
fun is_metastrange_theorem th =
37626
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   810
  case head_of (concl_of th) of
43576
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   811
    Const (s, _) => (s <> @{const_name Trueprop} andalso
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   812
                     s <> @{const_name "=="})
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   813
  | _ => false
37626
1146291fe718 move blacklisting completely out of the clausifier;
blanchet
parents: 37616
diff changeset
   814
38821
d0275b6c4e9d avoid needless "that" fact
blanchet
parents: 38820
diff changeset
   815
fun is_that_fact th =
d0275b6c4e9d avoid needless "that" fact
blanchet
parents: 38820
diff changeset
   816
  String.isSuffix (Long_Name.separator ^ Obtain.thatN) (Thm.get_name_hint th)
d0275b6c4e9d avoid needless "that" fact
blanchet
parents: 38820
diff changeset
   817
  andalso exists_subterm (fn Free (s, _) => s = Name.skolem Auto_Bind.thesisN
d0275b6c4e9d avoid needless "that" fact
blanchet
parents: 38820
diff changeset
   818
                           | _ => false) (prop_of th)
d0275b6c4e9d avoid needless "that" fact
blanchet
parents: 38820
diff changeset
   819
38085
cc44e887246c avoid "clause" and "cnf" terminology where it no longer makes sense
blanchet
parents: 38027
diff changeset
   820
(**** Predicates to detect unwanted facts (prolific or likely to cause
37347
635425a442e8 show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents: 37345
diff changeset
   821
      unsoundness) ****)
21470
7c1b59ddcd56 Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents: 21431
diff changeset
   822
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   823
fun is_theorem_bad_for_atps ho_atp exporter thm =
43576
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   824
  is_metastrange_theorem thm orelse
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   825
  (not exporter andalso
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   826
   let val t = prop_of thm in
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   827
     is_formula_too_complex ho_atp t orelse exists_type type_has_top_sort t orelse
43576
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   828
     exists_sledgehammer_const t orelse exists_low_level_class_const t orelse
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   829
     is_that_fact thm
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   830
   end)
38627
760a2d5cc671 make sure minimizer facts go through "transform_elim_theorems"
blanchet
parents: 38617
diff changeset
   831
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   832
fun all_facts ctxt ho_atp reserved exporter add_ths chained_ths =
38627
760a2d5cc671 make sure minimizer facts go through "transform_elim_theorems"
blanchet
parents: 38617
diff changeset
   833
  let
42361
23f352990944 modernized structure Proof_Context;
wenzelm
parents: 42358
diff changeset
   834
    val thy = Proof_Context.theory_of ctxt
39557
fe5722fce758 renamed structure PureThy to Pure_Thy and moved most content to Global_Theory, to emphasize that this is global-only;
wenzelm
parents: 39367
diff changeset
   835
    val global_facts = Global_Theory.facts_of thy
42361
23f352990944 modernized structure Proof_Context;
wenzelm
parents: 42358
diff changeset
   836
    val local_facts = Proof_Context.facts_of ctxt
38644
25bbbaf7ce65 don't penalize abstractions in relevance filter + support nameless `foo`-style facts
blanchet
parents: 38629
diff changeset
   837
    val named_locals = local_facts |> Facts.dest_static []
38993
504b9e1efd33 give priority to assumptions in structured proofs
blanchet
parents: 38992
diff changeset
   838
    val assms = Assumption.all_assms_of ctxt
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   839
    val css_table = clasimpset_rule_table_of ctxt
38738
0ce517c1970f make sure that "undo_ascii_of" is the inverse of "ascii_of", also for non-printable characters -- and avoid those in ``-style facts
blanchet
parents: 38699
diff changeset
   840
    fun is_good_unnamed_local th =
38820
d0f98bd81a85 add nameless chained facts to the pool of things known to Sledgehammer
blanchet
parents: 38819
diff changeset
   841
      not (Thm.has_name_hint th) andalso
42957
c693f9b7674a use "eq_thm_prop" for slacker comparison -- ensures that backtick-quoted chained facts are recognized in the minimizer, among other things
blanchet
parents: 42952
diff changeset
   842
      forall (fn (_, ths) => not (member Thm.eq_thm_prop ths th)) named_locals
38644
25bbbaf7ce65 don't penalize abstractions in relevance filter + support nameless `foo`-style facts
blanchet
parents: 38629
diff changeset
   843
    val unnamed_locals =
42957
c693f9b7674a use "eq_thm_prop" for slacker comparison -- ensures that backtick-quoted chained facts are recognized in the minimizer, among other things
blanchet
parents: 42952
diff changeset
   844
      union Thm.eq_thm_prop (Facts.props local_facts) chained_ths
38820
d0f98bd81a85 add nameless chained facts to the pool of things known to Sledgehammer
blanchet
parents: 38819
diff changeset
   845
      |> filter is_good_unnamed_local |> map (pair "" o single)
38627
760a2d5cc671 make sure minimizer facts go through "transform_elim_theorems"
blanchet
parents: 38617
diff changeset
   846
    val full_space =
38738
0ce517c1970f make sure that "undo_ascii_of" is the inverse of "ascii_of", also for non-printable characters -- and avoid those in ``-style facts
blanchet
parents: 38699
diff changeset
   847
      Name_Space.merge (Facts.space_of global_facts, Facts.space_of local_facts)
38752
6628adcae4a7 consider "locality" when assigning weights to facts
blanchet
parents: 38751
diff changeset
   848
    fun add_facts global foldx facts =
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   849
      foldx (fn (name0, ths) =>
43576
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   850
        if not exporter andalso name0 <> "" andalso
42957
c693f9b7674a use "eq_thm_prop" for slacker comparison -- ensures that backtick-quoted chained facts are recognized in the minimizer, among other things
blanchet
parents: 42952
diff changeset
   851
           forall (not o member Thm.eq_thm_prop add_ths) ths andalso
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   852
           (Facts.is_concealed facts name0 orelse
42728
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
   853
            (not (Config.get ctxt ignore_no_atp) andalso
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
   854
             is_package_def name0) orelse
44cd74a419ce added configuration options for experimental features
blanchet
parents: 42702
diff changeset
   855
            exists (fn s => String.isSuffix s name0)
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   856
                   (multi_base_blacklist ctxt ho_atp) orelse
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   857
            String.isSuffix "_def_raw" (* FIXME: crude hack *) name0) then
38627
760a2d5cc671 make sure minimizer facts go through "transform_elim_theorems"
blanchet
parents: 38617
diff changeset
   858
          I
760a2d5cc671 make sure minimizer facts go through "transform_elim_theorems"
blanchet
parents: 38617
diff changeset
   859
        else
760a2d5cc671 make sure minimizer facts go through "transform_elim_theorems"
blanchet
parents: 38617
diff changeset
   860
          let
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   861
            val multi = length ths > 1
41279
e0400b05a62c escape backticks in altstrings
blanchet
parents: 41273
diff changeset
   862
            val backquote_thm =
e0400b05a62c escape backticks in altstrings
blanchet
parents: 41273
diff changeset
   863
              backquote o string_for_term ctxt o close_form o prop_of
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   864
            fun check_thms a =
42361
23f352990944 modernized structure Proof_Context;
wenzelm
parents: 42358
diff changeset
   865
              case try (Proof_Context.get_thms ctxt) a of
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   866
                NONE => false
42957
c693f9b7674a use "eq_thm_prop" for slacker comparison -- ensures that backtick-quoted chained facts are recognized in the minimizer, among other things
blanchet
parents: 42952
diff changeset
   867
              | SOME ths' => eq_list Thm.eq_thm_prop (ths, ths')
38627
760a2d5cc671 make sure minimizer facts go through "transform_elim_theorems"
blanchet
parents: 38617
diff changeset
   868
          in
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   869
            pair 1
43245
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   870
            #> fold (fn th => fn (j, (multis, unis)) =>
42641
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   871
                        (j + 1,
43576
ebeda6275027 don't export any metastrange or other nonatomizable formulas, since these don't help proving normal things, they are somewhat broken in the ATP output, and they are atypical
blanchet
parents: 43492
diff changeset
   872
                         if not (member Thm.eq_thm_prop add_ths th) andalso
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   873
                            is_theorem_bad_for_atps ho_atp exporter th then
43245
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   874
                           (multis, unis)
42641
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   875
                         else
43245
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   876
                           let
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   877
                             val new =
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   878
                               (((fn () =>
42641
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   879
                                 if name0 = "" then
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   880
                                   th |> backquote_thm
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   881
                                 else
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   882
                                   [Facts.extern ctxt facts name0,
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   883
                                    Name_Space.extern ctxt full_space name0,
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   884
                                    name0]
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   885
                                   |> find_first check_thms
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   886
                                   |> (fn SOME name =>
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   887
                                          make_name reserved multi j name
2cd4e6463842 recognize simplification rules even if they look a bit different from the theorems in the theories (meta equality, variable numbers)
blanchet
parents: 42638
diff changeset
   888
                                        | NONE => "")),
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   889
                                stature_of_thm global assms chained_ths
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   890
                                               css_table name0 th), th)
43245
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   891
                           in
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   892
                             if multi then (new :: multis, unis)
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   893
                             else (multis, new :: unis)
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   894
                           end)) ths
38699
27378b4a776b compute names lazily;
blanchet
parents: 38698
diff changeset
   895
            #> snd
38627
760a2d5cc671 make sure minimizer facts go through "transform_elim_theorems"
blanchet
parents: 38617
diff changeset
   896
          end)
38644
25bbbaf7ce65 don't penalize abstractions in relevance filter + support nameless `foo`-style facts
blanchet
parents: 38629
diff changeset
   897
  in
43245
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   898
    (* The single-name theorems go after the multiple-name ones, so that single
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   899
       names are preferred when both are available. *)
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   900
    ([], []) |> add_facts false fold local_facts (unnamed_locals @ named_locals)
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   901
             |> add_facts true Facts.fold_static global_facts global_facts
cef69d31bfa4 optimized the relevance filter a little bit
blanchet
parents: 43085
diff changeset
   902
             |> op @
38644
25bbbaf7ce65 don't penalize abstractions in relevance filter + support nameless `foo`-style facts
blanchet
parents: 38629
diff changeset
   903
  end
38627
760a2d5cc671 make sure minimizer facts go through "transform_elim_theorems"
blanchet
parents: 38617
diff changeset
   904
41199
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   905
fun external_frees t =
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   906
  [] |> Term.add_frees t |> filter_out (can Name.dest_internal o fst)
4698d12dd860 instantiate induction rules automatically
blanchet
parents: 41167
diff changeset
   907
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   908
fun nearly_all_facts ctxt ho_atp ({add, only, ...} : relevance_override)
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   909
                     chained_ths hyp_ts concl_t =
43351
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   910
  let
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   911
    val thy = Proof_Context.theory_of ctxt
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   912
    val reserved = reserved_isar_keyword_table ()
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   913
    val add_ths = Attrib.eval_thms ctxt add
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   914
    val ind_stmt =
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   915
      Logic.list_implies (hyp_ts |> filter_out (null o external_frees), concl_t)
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   916
      |> Object_Logic.atomize_term thy
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   917
    val ind_stmt_xs = external_frees ind_stmt
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   918
    val css_table = clasimpset_rule_table_of ctxt
43351
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   919
  in
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   920
    (if only then
46340
cac402c486b0 separate orthogonal components
blanchet
parents: 46320
diff changeset
   921
       maps (map (fn ((name, stature), th) => ((K name, stature), th))
46388
e7445478d90b proper statuses for "fact_from_ref"
blanchet
parents: 46379
diff changeset
   922
             o fact_from_ref ctxt reserved chained_ths css_table) add
43351
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   923
     else
44585
cfe7f4a68e51 added generation of induction rules
nik
parents: 44462
diff changeset
   924
       all_facts ctxt ho_atp reserved false add_ths chained_ths)
43351
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   925
    |> Config.get ctxt instantiate_inducts
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   926
       ? maps (instantiate_if_induct_rule ctxt ind_stmt ind_stmt_xs)
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   927
    |> (not (Config.get ctxt ignore_no_atp) andalso not only)
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   928
       ? filter_out (No_ATPs.member ctxt o snd)
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   929
    |> uniquify
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   930
  end
b19d95b4d736 compute the set of base facts only once (instead of three times in parallel) -- this saves about .5 s of CPU time, albeit much less clock wall time
blanchet
parents: 43324
diff changeset
   931
44625
4a1132815a70 more tuning
blanchet
parents: 44586
diff changeset
   932
fun relevant_facts ctxt (threshold0, threshold1) max_relevant is_built_in_const
4a1132815a70 more tuning
blanchet
parents: 44586
diff changeset
   933
                   fudge (override as {only, ...}) chained_ths hyp_ts concl_t
4a1132815a70 more tuning
blanchet
parents: 44586
diff changeset
   934
                   facts =
37538
97ab019d5ac8 make sure that theorems passed using "add:" to Sledgehammer are not eliminated on heuristic grounds
blanchet
parents: 37537
diff changeset
   935
  let
42361
23f352990944 modernized structure Proof_Context;
wenzelm
parents: 42358
diff changeset
   936
    val thy = Proof_Context.theory_of ctxt
38822
aa0101e618e2 fix threshold computation + remove "op =" from relevant constants
blanchet
parents: 38821
diff changeset
   937
    val decay = Math.pow ((1.0 - threshold1) / (1.0 - threshold0),
aa0101e618e2 fix threshold computation + remove "op =" from relevant constants
blanchet
parents: 38821
diff changeset
   938
                          1.0 / Real.fromInt (max_relevant + 1))
37538
97ab019d5ac8 make sure that theorems passed using "add:" to Sledgehammer are not eliminated on heuristic grounds
blanchet
parents: 37537
diff changeset
   939
  in
42646
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
   940
    trace_msg ctxt (fn () => "Considering " ^ string_of_int (length facts) ^
4781fcd53572 replaced some Unsynchronized.refs with Config.Ts
blanchet
parents: 42641
diff changeset
   941
                             " facts");
39366
f58fbb959826 handle relevance filter corner cases more gracefully;
blanchet
parents: 39265
diff changeset
   942
    (if only orelse threshold1 < 0.0 then
40204
da97d75e20e6 standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents: 40191
diff changeset
   943
       facts
39366
f58fbb959826 handle relevance filter corner cases more gracefully;
blanchet
parents: 39265
diff changeset
   944
     else if threshold0 > 1.0 orelse threshold0 > threshold1 orelse
f58fbb959826 handle relevance filter corner cases more gracefully;
blanchet
parents: 39265
diff changeset
   945
             max_relevant = 0 then
38739
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   946
       []
8b8ed80b5699 renamed "relevance_convergence" to "relevance_decay"
blanchet
parents: 38738
diff changeset
   947
     else
44625
4a1132815a70 more tuning
blanchet
parents: 44586
diff changeset
   948
       relevance_filter ctxt threshold0 decay max_relevant is_built_in_const
4a1132815a70 more tuning
blanchet
parents: 44586
diff changeset
   949
           fudge override facts (chained_ths |> map prop_of) hyp_ts
4a1132815a70 more tuning
blanchet
parents: 44586
diff changeset
   950
           (concl_t |> theory_constify fudge (Context.theory_name thy)))
38822
aa0101e618e2 fix threshold computation + remove "op =" from relevant constants
blanchet
parents: 38821
diff changeset
   951
    |> map (apfst (apfst (fn f => f ())))
37538
97ab019d5ac8 make sure that theorems passed using "add:" to Sledgehammer are not eliminated on heuristic grounds
blanchet
parents: 37537
diff changeset
   952
  end
30536
07b4f050e4df split relevance-filter and writing of problem-files;
immler@in.tum.de
parents: 30364
diff changeset
   953
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   954
end;