src/Provers/classical.ML
author wenzelm
Sun, 07 Mar 2010 12:19:47 +0100
changeset 35625 9c818cab0dd0
parent 35613 9d3ff36ad4e1
child 36546 a9873318fe30
permissions -rw-r--r--
modernized structure Object_Logic;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
     1
(*  Title:      Provers/classical.ML
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     3
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
Theorem prover for classical reasoning, including predicate calculus, set
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
theory, etc.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     6
9563
216d053992a5 fixed classification of rules in atts and modifiers (final!?);
wenzelm
parents: 9513
diff changeset
     7
Rules must be classified as intro, elim, safe, hazardous (unsafe).
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     8
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
A rule is unsafe unless it can be applied blindly without harmful results.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    10
For a rule to be safe, its premises and conclusion should be logically
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    11
equivalent.  There should be no variables in the premises that are not in
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    12
the conclusion.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    13
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    14
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    15
(*higher precedence than := facilitates use of references*)
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
    16
infix 4 addSIs addSEs addSDs addIs addEs addDs delrules
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    17
  addSWrapper delSWrapper addWrapper delWrapper
11181
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
    18
  addSbefore addSafter addbefore addafter
5523
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
    19
  addD2 addE2 addSD2 addSE2;
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    20
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    21
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    22
(*should be a type abbreviation in signature CLASSICAL*)
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    23
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net;
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
    24
type wrapper = (int -> tactic) -> (int -> tactic);
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    25
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    26
signature CLASSICAL_DATA =
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    27
sig
26412
0918f5c0bbca pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents: 24867
diff changeset
    28
  val imp_elim  : thm           (* P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R *)
0918f5c0bbca pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents: 24867
diff changeset
    29
  val not_elim  : thm           (* ~P ==> P ==> R *)
0918f5c0bbca pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents: 24867
diff changeset
    30
  val swap      : thm           (* ~ P ==> (~ R ==> P) ==> R *)
0918f5c0bbca pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents: 24867
diff changeset
    31
  val classical : thm           (* (~ P ==> P) ==> P *)
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    32
  val sizef     : thm -> int    (* size function for BEST_FIRST *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    33
  val hyp_subst_tacs: (int -> tactic) list
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    34
end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    35
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
    36
signature BASIC_CLASSICAL =
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    37
sig
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    38
  type claset
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    39
  val empty_cs: claset
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    40
  val print_cs: claset -> unit
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
    41
  val rep_cs:
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    42
    claset -> {safeIs: thm list, safeEs: thm list,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    43
                 hazIs: thm list, hazEs: thm list,
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
    44
                 swrappers: (string * wrapper) list,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    45
                 uwrappers: (string * wrapper) list,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    46
                 safe0_netpair: netpair, safep_netpair: netpair,
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
    47
                 haz_netpair: netpair, dup_netpair: netpair,
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
    48
                 xtra_netpair: Context_Rules.netpair}
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    49
  val merge_cs          : claset * claset -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    50
  val addDs             : claset * thm list -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    51
  val addEs             : claset * thm list -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    52
  val addIs             : claset * thm list -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    53
  val addSDs            : claset * thm list -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    54
  val addSEs            : claset * thm list -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    55
  val addSIs            : claset * thm list -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    56
  val delrules          : claset * thm list -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    57
  val addSWrapper       : claset * (string * wrapper) -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    58
  val delSWrapper       : claset *  string            -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    59
  val addWrapper        : claset * (string * wrapper) -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    60
  val delWrapper        : claset *  string            -> claset
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    61
  val addSbefore        : claset * (string * (int -> tactic)) -> claset
11181
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
    62
  val addSafter         : claset * (string * (int -> tactic)) -> claset
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    63
  val addbefore         : claset * (string * (int -> tactic)) -> claset
11181
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
    64
  val addafter          : claset * (string * (int -> tactic)) -> claset
5523
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
    65
  val addD2             : claset * (string * thm) -> claset
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
    66
  val addE2             : claset * (string * thm) -> claset
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
    67
  val addSD2            : claset * (string * thm) -> claset
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
    68
  val addSE2            : claset * (string * thm) -> claset
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    69
  val appSWrappers      : claset -> wrapper
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    70
  val appWrappers       : claset -> wrapper
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
    71
32148
253f6808dabe renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents: 32091
diff changeset
    72
  val global_claset_of  : theory -> claset
253f6808dabe renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents: 32091
diff changeset
    73
  val claset_of         : Proof.context -> claset
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
    74
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    75
  val fast_tac          : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    76
  val slow_tac          : claset -> int -> tactic
32740
9dd0a2f83429 explicit indication of Unsynchronized.ref;
wenzelm
parents: 32261
diff changeset
    77
  val weight_ASTAR      : int Unsynchronized.ref
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    78
  val astar_tac         : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    79
  val slow_astar_tac    : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    80
  val best_tac          : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    81
  val first_best_tac    : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    82
  val slow_best_tac     : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    83
  val depth_tac         : claset -> int -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    84
  val deepen_tac        : claset -> int -> int -> tactic
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
    85
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    86
  val contr_tac         : int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    87
  val dup_elim          : thm -> thm
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    88
  val dup_intr          : thm -> thm
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    89
  val dup_step_tac      : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    90
  val eq_mp_tac         : int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    91
  val haz_step_tac      : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    92
  val joinrules         : thm list * thm list -> (bool * thm) list
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    93
  val mp_tac            : int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    94
  val safe_tac          : claset -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    95
  val safe_steps_tac    : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    96
  val safe_step_tac     : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    97
  val clarify_tac       : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    98
  val clarify_step_tac  : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
    99
  val step_tac          : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   100
  val slow_step_tac     : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   101
  val swapify           : thm list -> thm list
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   102
  val swap_res_tac      : thm list -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   103
  val inst_step_tac     : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   104
  val inst0_step_tac    : claset -> int -> tactic
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   105
  val instp_step_tac    : claset -> int -> tactic
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   106
end;
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   107
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   108
signature CLASSICAL =
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   109
sig
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   110
  include BASIC_CLASSICAL
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   111
  val classical_rule: thm -> thm
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   112
  val add_context_safe_wrapper: string * (Proof.context -> wrapper) -> theory -> theory
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   113
  val del_context_safe_wrapper: string -> theory -> theory
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   114
  val add_context_unsafe_wrapper: string * (Proof.context -> wrapper) -> theory -> theory
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   115
  val del_context_unsafe_wrapper: string -> theory -> theory
32261
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   116
  val get_claset: Proof.context -> claset
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   117
  val put_claset: claset -> Proof.context -> Proof.context
24021
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   118
  val get_cs: Context.generic -> claset
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   119
  val map_cs: (claset -> claset) -> Context.generic -> Context.generic
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   120
  val safe_dest: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   121
  val safe_elim: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   122
  val safe_intro: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   123
  val haz_dest: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   124
  val haz_elim: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   125
  val haz_intro: int option -> attribute
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   126
  val rule_del: attribute
30513
1796b8ea88aa eliminated type Args.T;
wenzelm
parents: 30510
diff changeset
   127
  val cla_modifiers: Method.modifier parser list
35613
9d3ff36ad4e1 eliminated Args.bang_facts (legacy feature);
wenzelm
parents: 33522
diff changeset
   128
  val cla_meth: (claset -> tactic) -> Proof.context -> Proof.method
9d3ff36ad4e1 eliminated Args.bang_facts (legacy feature);
wenzelm
parents: 33522
diff changeset
   129
  val cla_meth': (claset -> int -> tactic) -> Proof.context -> Proof.method
30541
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   130
  val cla_method: (claset -> tactic) -> (Proof.context -> Proof.method) context_parser
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   131
  val cla_method': (claset -> int -> tactic) -> (Proof.context -> Proof.method) context_parser
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18691
diff changeset
   132
  val setup: theory -> theory
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   133
end;
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   134
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   135
5927
991483daa1a4 expoer cla_method('), cla_modifiers;
wenzelm
parents: 5885
diff changeset
   136
functor ClassicalFun(Data: CLASSICAL_DATA): CLASSICAL =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   137
struct
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   138
7354
358b1c5391f0 proper setup of GlobalClaset data;
wenzelm
parents: 7329
diff changeset
   139
local open Data in
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   140
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   141
(** classical elimination rules **)
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   142
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   143
(*
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   144
Classical reasoning requires stronger elimination rules.  For
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   145
instance, make_elim of Pure transforms the HOL rule injD into
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   146
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   147
    [| inj f; f x = f y; x = y ==> PROP W |] ==> PROP W
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   148
26938
64e850c3da9e tuned comments;
wenzelm
parents: 26928
diff changeset
   149
Such rules can cause fast_tac to fail and blast_tac to report "PROOF
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   150
FAILED"; classical_rule will strenthen this to
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   151
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   152
    [| inj f; ~ W ==> f x = f y; x = y ==> W |] ==> W
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   153
*)
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   154
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   155
fun classical_rule rule =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   156
  if Object_Logic.is_elim rule then
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   157
    let
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   158
      val rule' = rule RS classical;
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   159
      val concl' = Thm.concl_of rule';
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   160
      fun redundant_hyp goal =
19257
4463aee061bc ObjectLogic.is_elim;
wenzelm
parents: 19110
diff changeset
   161
        concl' aconv Logic.strip_assums_concl goal orelse
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   162
          (case Logic.strip_assums_hyp goal of
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   163
            hyp :: hyps => exists (fn t => t aconv hyp) hyps
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   164
          | _ => false);
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   165
      val rule'' =
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   166
        rule' |> ALLGOALS (SUBGOAL (fn (goal, i) =>
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   167
          if i = 1 orelse redundant_hyp goal
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   168
          then Tactic.etac thin_rl i
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   169
          else all_tac))
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   170
        |> Seq.hd
21963
416a5338d2bb removed obsolete name_hint handling;
wenzelm
parents: 21689
diff changeset
   171
        |> Drule.zero_var_indexes;
22360
26ead7ed4f4b moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents: 22095
diff changeset
   172
    in if Thm.equiv_thm (rule, rule'') then rule else rule'' end
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   173
  else rule;
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   174
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   175
(*flatten nested meta connectives in prems*)
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   176
val flat_rule = Conv.fconv_rule (Conv.prems_conv ~1 Object_Logic.atomize_prems);
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   177
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   178
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   179
(*** Useful tactics for classical reasoning ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   180
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   181
(*Prove goal that assumes both P and ~P.
4392
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   182
  No backtracking if it finds an equal assumption.  Perhaps should call
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   183
  ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   184
val contr_tac = eresolve_tac [not_elim]  THEN'
4392
ea41d9c1b0ef More deterministic (?) contr_tac
paulson
parents: 4380
diff changeset
   185
                (eq_assume_tac ORELSE' assume_tac);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   186
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   187
(*Finds P-->Q and P in the assumptions, replaces implication by Q.
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   188
  Could do the same thing for P<->Q and P... *)
26412
0918f5c0bbca pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents: 24867
diff changeset
   189
fun mp_tac i = eresolve_tac [not_elim, Data.imp_elim] i  THEN  assume_tac i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   190
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   191
(*Like mp_tac but instantiates no variables*)
26412
0918f5c0bbca pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents: 24867
diff changeset
   192
fun eq_mp_tac i = ematch_tac [not_elim, Data.imp_elim] i  THEN  eq_assume_tac i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   193
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   194
(*Creates rules to eliminate ~A, from rules to introduce A*)
26412
0918f5c0bbca pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents: 24867
diff changeset
   195
fun swapify intrs = intrs RLN (2, [Data.swap]);
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   196
val swapped = Thm.rule_attribute (fn _ => fn th => th RSN (2, Data.swap));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   197
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   198
(*Uses introduction rules in the normal way, or on negated assumptions,
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   199
  trying rules in order. *)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   200
fun swap_res_tac rls =
33339
d41f77196338 eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   201
    let fun addrl rl brls = (false, rl) :: (true, rl RSN (2, Data.swap)) :: brls
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   202
    in  assume_tac      ORELSE'
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   203
        contr_tac       ORELSE'
33339
d41f77196338 eliminated some old folds;
wenzelm
parents: 33317
diff changeset
   204
        biresolve_tac (fold_rev addrl rls [])
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   205
    end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   206
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   207
(*Duplication of hazardous rules, for complete provers*)
2689
6d3d893453de dup_intr & dup_elim no longer call standard -- this
paulson
parents: 2630
diff changeset
   208
fun dup_intr th = zero_var_indexes (th RS classical);
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   209
6967
a3c163ed1e04 dup_elim: use try to handle general exn;
wenzelm
parents: 6955
diff changeset
   210
fun dup_elim th =
13525
cafd1f98d658 dup_elim: improved error reporting;
wenzelm
parents: 13105
diff changeset
   211
    rule_by_tactic (TRYALL (etac revcut_rl))
31945
d5f186aa0bed structure Thm: less pervasive names;
wenzelm
parents: 30609
diff changeset
   212
      ((th RSN (2, revcut_rl)) |> Thm.assumption 2 |> Seq.hd);
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   213
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   214
(**** Classical rule sets ****)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   215
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   216
datatype claset =
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   217
  CS of {safeIs         : thm list,                (*safe introduction rules*)
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   218
         safeEs         : thm list,                (*safe elimination rules*)
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   219
         hazIs          : thm list,                (*unsafe introduction rules*)
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   220
         hazEs          : thm list,                (*unsafe elimination rules*)
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   221
         swrappers      : (string * wrapper) list, (*for transforming safe_step_tac*)
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   222
         uwrappers      : (string * wrapper) list, (*for transforming step_tac*)
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   223
         safe0_netpair  : netpair,                 (*nets for trivial cases*)
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   224
         safep_netpair  : netpair,                 (*nets for >0 subgoals*)
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   225
         haz_netpair    : netpair,                 (*nets for unsafe rules*)
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   226
         dup_netpair    : netpair,                 (*nets for duplication*)
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   227
         xtra_netpair   : Context_Rules.netpair};  (*nets for extra rules*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   228
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   229
(*Desired invariants are
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   230
        safe0_netpair = build safe0_brls,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   231
        safep_netpair = build safep_brls,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   232
        haz_netpair = build (joinrules(hazIs, hazEs)),
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   233
        dup_netpair = build (joinrules(map dup_intr hazIs,
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   234
                                       map dup_elim hazEs))
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   235
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   236
where build = build_netpair(Net.empty,Net.empty),
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   237
      safe0_brls contains all brules that solve the subgoal, and
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   238
      safep_brls contains all brules that generate 1 or more new subgoals.
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   239
The theorem lists are largely comments, though they are used in merge_cs and print_cs.
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   240
Nets must be built incrementally, to save space and time.
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   241
*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   242
6502
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   243
val empty_netpair = (Net.empty, Net.empty);
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   244
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   245
val empty_cs =
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   246
  CS{safeIs     = [],
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   247
     safeEs     = [],
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   248
     hazIs      = [],
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   249
     hazEs      = [],
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   250
     swrappers  = [],
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   251
     uwrappers  = [],
6502
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   252
     safe0_netpair = empty_netpair,
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   253
     safep_netpair = empty_netpair,
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   254
     haz_netpair   = empty_netpair,
6955
9e2d97ef55d2 type claset: added extra I/E rules;
wenzelm
parents: 6556
diff changeset
   255
     dup_netpair   = empty_netpair,
9e2d97ef55d2 type claset: added extra I/E rules;
wenzelm
parents: 6556
diff changeset
   256
     xtra_netpair  = empty_netpair};
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   257
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   258
fun print_cs (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, ...}) =
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   259
  let val pretty_thms = map Display.pretty_thm_without_context in
9760
72c0a12ae3bf improved messages;
wenzelm
parents: 9721
diff changeset
   260
    [Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs),
72c0a12ae3bf improved messages;
wenzelm
parents: 9721
diff changeset
   261
      Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs),
72c0a12ae3bf improved messages;
wenzelm
parents: 9721
diff changeset
   262
      Pretty.big_list "safe elimination rules (elim!):" (pretty_thms safeEs),
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   263
      Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs),
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   264
      Pretty.strs ("safe wrappers:" :: map #1 swrappers),
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   265
      Pretty.strs ("unsafe wrappers:" :: map #1 uwrappers)]
8727
71acc2d8991a Pretty.chunks;
wenzelm
parents: 8699
diff changeset
   266
    |> Pretty.chunks |> Pretty.writeln
3546
de164676a202 improved print_cs;
wenzelm
parents: 3537
diff changeset
   267
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   268
4653
d60f76680bf4 renamed rep_claset to rep_cs
oheimb
parents: 4651
diff changeset
   269
fun rep_cs (CS args) = args;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   270
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   271
fun appSWrappers (CS {swrappers, ...}) = fold snd swrappers;
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   272
fun appWrappers  (CS {uwrappers, ...}) = fold snd uwrappers;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   273
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   274
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   275
(*** Adding (un)safe introduction or elimination rules.
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   276
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   277
    In case of overlap, new rules are tried BEFORE old ones!!
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   278
***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   279
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   280
(*For use with biresolve_tac.  Combines intro rules with swap to handle negated
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   281
  assumptions.  Pairs elim rules with true. *)
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   282
fun joinrules (intrs, elims) =
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   283
  (map (pair true) (elims @ swapify intrs)) @ map (pair false) intrs;
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   284
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   285
fun joinrules' (intrs, elims) =
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   286
  map (pair true) elims @ map (pair false) intrs;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   287
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   288
(*Priority: prefer rules with fewest subgoals,
1231
91d2c1bb5803 clarified comment
paulson
parents: 1073
diff changeset
   289
  then rules added most recently (preferring the head of the list).*)
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   290
fun tag_brls k [] = []
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   291
  | tag_brls k (brl::brls) =
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   292
      (1000000*subgoals_of_brl brl + k, brl) ::
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   293
      tag_brls (k+1) brls;
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   294
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   295
fun tag_brls' _ _ [] = []
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   296
  | tag_brls' w k (brl::brls) = ((w, k), brl) :: tag_brls' w (k + 1) brls;
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   297
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   298
fun insert_tagged_list rls = fold_rev Tactic.insert_tagged_brl rls;
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   299
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   300
(*Insert into netpair that already has nI intr rules and nE elim rules.
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   301
  Count the intr rules double (to account for swapify).  Negate to give the
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   302
  new insertions the lowest priority.*)
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   303
fun insert (nI, nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules;
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   304
fun insert' w (nI, nE) = insert_tagged_list o tag_brls' w (~(nI + nE)) o joinrules';
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   305
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   306
fun delete_tagged_list rls = fold_rev Tactic.delete_tagged_brl rls;
12362
57cd572103c4 made SML/NJ happy;
wenzelm
parents: 12311
diff changeset
   307
fun delete x = delete_tagged_list (joinrules x);
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   308
fun delete' x = delete_tagged_list (joinrules' x);
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   309
22360
26ead7ed4f4b moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents: 22095
diff changeset
   310
val mem_thm = member Thm.eq_thm_prop
26ead7ed4f4b moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents: 22095
diff changeset
   311
and rem_thm = remove Thm.eq_thm_prop;
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   312
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   313
(*Warn if the rule is already present ELSEWHERE in the claset.  The addition
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   314
  is still allowed.*)
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   315
fun warn_dup th (CS{safeIs, safeEs, hazIs, hazEs, ...}) =
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   316
  if mem_thm safeIs th then
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   317
    warning ("Rule already declared as safe introduction (intro!)\n" ^
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   318
      Display.string_of_thm_without_context th)
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   319
  else if mem_thm safeEs th then
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   320
    warning ("Rule already declared as safe elimination (elim!)\n" ^
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   321
      Display.string_of_thm_without_context th)
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   322
  else if mem_thm hazIs th then
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   323
    warning ("Rule already declared as introduction (intro)\n" ^
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   324
      Display.string_of_thm_without_context th)
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   325
  else if mem_thm hazEs th then
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   326
    warning ("Rule already declared as elimination (elim)\n" ^
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   327
      Display.string_of_thm_without_context th)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   328
  else ();
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   329
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   330
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   331
(*** Safe rules ***)
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   332
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   333
fun addSI w th
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   334
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   335
             safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   336
  if mem_thm safeIs th then
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   337
    (warning ("Ignoring duplicate safe introduction (intro!)\n" ^
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   338
      Display.string_of_thm_without_context th); cs)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   339
  else
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   340
  let val th' = flat_rule th
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   341
      val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   342
          List.partition Thm.no_prems [th']
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   343
      val nI = length safeIs + 1
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   344
      and nE = length safeEs
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   345
  in warn_dup th cs;
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   346
     CS{safeIs  = th::safeIs,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   347
        safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   348
        safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   349
        safeEs  = safeEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   350
        hazIs   = hazIs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   351
        hazEs   = hazEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   352
        swrappers    = swrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   353
        uwrappers    = uwrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   354
        haz_netpair  = haz_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   355
        dup_netpair  = dup_netpair,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   356
        xtra_netpair = insert' (the_default 0 w) (nI,nE) ([th], []) xtra_netpair}
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   357
  end;
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   358
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   359
fun addSE w th
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   360
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   361
             safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   362
  if mem_thm safeEs th then
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   363
    (warning ("Ignoring duplicate safe elimination (elim!)\n" ^
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   364
        Display.string_of_thm_without_context th); cs)
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   365
  else if has_fewer_prems 1 th then
32960
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32952
diff changeset
   366
        error ("Ill-formed elimination rule\n" ^ Display.string_of_thm_without_context th)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   367
  else
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   368
  let
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   369
      val th' = classical_rule (flat_rule th)
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   370
      val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   371
          List.partition (fn rl => nprems_of rl=1) [th']
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   372
      val nI = length safeIs
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   373
      and nE = length safeEs + 1
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   374
  in warn_dup th cs;
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   375
     CS{safeEs  = th::safeEs,
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   376
        safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   377
        safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   378
        safeIs  = safeIs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   379
        hazIs   = hazIs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   380
        hazEs   = hazEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   381
        swrappers    = swrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   382
        uwrappers    = uwrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   383
        haz_netpair  = haz_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   384
        dup_netpair  = dup_netpair,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   385
        xtra_netpair = insert' (the_default 0 w) (nI,nE) ([], [th]) xtra_netpair}
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   386
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   387
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   388
fun cs addSIs ths = fold_rev (addSI NONE) ths cs;
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   389
fun cs addSEs ths = fold_rev (addSE NONE) ths cs;
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   390
21689
58abd6d8abd1 Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents: 21687
diff changeset
   391
fun make_elim th =
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   392
    if has_fewer_prems 1 th then
32960
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32952
diff changeset
   393
          error ("Ill-formed destruction rule\n" ^ Display.string_of_thm_without_context th)
21689
58abd6d8abd1 Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents: 21687
diff changeset
   394
    else Tactic.make_elim th;
17084
fb0a80aef0be classical rules must have names for ATP integration
paulson
parents: 17057
diff changeset
   395
21689
58abd6d8abd1 Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents: 21687
diff changeset
   396
fun cs addSDs ths = cs addSEs (map make_elim ths);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   397
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   398
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   399
(*** Hazardous (unsafe) rules ***)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   400
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   401
fun addI w th
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   402
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   403
             safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   404
  if mem_thm hazIs th then
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   405
    (warning ("Ignoring duplicate introduction (intro)\n" ^
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   406
        Display.string_of_thm_without_context th); cs)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   407
  else
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   408
  let val th' = flat_rule th
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   409
      val nI = length hazIs + 1
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   410
      and nE = length hazEs
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   411
  in warn_dup th cs;
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   412
     CS{hazIs   = th::hazIs,
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   413
        haz_netpair = insert (nI,nE) ([th'], []) haz_netpair,
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   414
        dup_netpair = insert (nI,nE) (map dup_intr [th'], []) dup_netpair,
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   415
        safeIs  = safeIs,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   416
        safeEs  = safeEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   417
        hazEs   = hazEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   418
        swrappers     = swrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   419
        uwrappers     = uwrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   420
        safe0_netpair = safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   421
        safep_netpair = safep_netpair,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   422
        xtra_netpair = insert' (the_default 1 w) (nI,nE) ([th], []) xtra_netpair}
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   423
  end
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   424
  handle THM("RSN: no unifiers",_,_) => (*from dup_intr*)
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   425
    error ("Ill-formed introduction rule\n" ^ Display.string_of_thm_without_context th);
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   426
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   427
fun addE w th
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   428
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   429
            safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   430
  if mem_thm hazEs th then
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   431
    (warning ("Ignoring duplicate elimination (elim)\n" ^
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   432
        Display.string_of_thm_without_context th); cs)
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   433
  else if has_fewer_prems 1 th then
32960
69916a850301 eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents: 32952
diff changeset
   434
        error("Ill-formed elimination rule\n" ^ Display.string_of_thm_without_context th)
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   435
  else
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   436
  let
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   437
      val th' = classical_rule (flat_rule th)
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   438
      val nI = length hazIs
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   439
      and nE = length hazEs + 1
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   440
  in warn_dup th cs;
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   441
     CS{hazEs   = th::hazEs,
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   442
        haz_netpair = insert (nI,nE) ([], [th']) haz_netpair,
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   443
        dup_netpair = insert (nI,nE) ([], map dup_elim [th']) dup_netpair,
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   444
        safeIs  = safeIs,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   445
        safeEs  = safeEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   446
        hazIs   = hazIs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   447
        swrappers     = swrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   448
        uwrappers     = uwrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   449
        safe0_netpair = safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   450
        safep_netpair = safep_netpair,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   451
        xtra_netpair = insert' (the_default 1 w) (nI,nE) ([], [th]) xtra_netpair}
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   452
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   453
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   454
fun cs addIs ths = fold_rev (addI NONE) ths cs;
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   455
fun cs addEs ths = fold_rev (addE NONE) ths cs;
1927
6f97cb16e453 New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents: 1814
diff changeset
   456
21689
58abd6d8abd1 Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents: 21687
diff changeset
   457
fun cs addDs ths = cs addEs (map make_elim ths);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   458
1073
b3f190995bc9 Recoded addSIs, etc., so that nets are built incrementally
lcp
parents: 1010
diff changeset
   459
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   460
(*** Deletion of rules
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   461
     Working out what to delete, requires repeating much of the code used
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   462
        to insert.
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   463
***)
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   464
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   465
fun delSI th
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   466
          (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   467
                    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   468
 if mem_thm safeIs th then
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   469
   let val th' = flat_rule th
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   470
       val (safe0_rls, safep_rls) = List.partition Thm.no_prems [th']
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   471
   in CS{safe0_netpair = delete (safe0_rls, []) safe0_netpair,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   472
         safep_netpair = delete (safep_rls, []) safep_netpair,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   473
         safeIs = rem_thm th safeIs,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   474
         safeEs = safeEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   475
         hazIs  = hazIs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   476
         hazEs  = hazEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   477
         swrappers    = swrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   478
         uwrappers    = uwrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   479
         haz_netpair  = haz_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   480
         dup_netpair  = dup_netpair,
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   481
         xtra_netpair = delete' ([th], []) xtra_netpair}
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   482
   end
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   483
 else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   484
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   485
fun delSE th
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   486
          (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   487
                    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   488
  if mem_thm safeEs th then
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   489
    let
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   490
      val th' = classical_rule (flat_rule th)
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   491
      val (safe0_rls, safep_rls) = List.partition (fn rl => nprems_of rl=1) [th']
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   492
    in CS{safe0_netpair = delete ([], safe0_rls) safe0_netpair,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   493
         safep_netpair = delete ([], safep_rls) safep_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   494
         safeIs = safeIs,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   495
         safeEs = rem_thm th safeEs,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   496
         hazIs  = hazIs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   497
         hazEs  = hazEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   498
         swrappers    = swrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   499
         uwrappers    = uwrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   500
         haz_netpair  = haz_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   501
         dup_netpair  = dup_netpair,
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   502
         xtra_netpair = delete' ([], [th]) xtra_netpair}
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   503
    end
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   504
  else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   505
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   506
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   507
fun delI th
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   508
         (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   509
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   510
 if mem_thm hazIs th then
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   511
    let val th' = flat_rule th
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   512
    in CS{haz_netpair = delete ([th'], []) haz_netpair,
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   513
        dup_netpair = delete ([dup_intr th'], []) dup_netpair,
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   514
        safeIs  = safeIs,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   515
        safeEs  = safeEs,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   516
        hazIs   = rem_thm th hazIs,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   517
        hazEs   = hazEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   518
        swrappers     = swrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   519
        uwrappers     = uwrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   520
        safe0_netpair = safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   521
        safep_netpair = safep_netpair,
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   522
        xtra_netpair = delete' ([th], []) xtra_netpair}
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   523
    end
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   524
 else cs
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   525
 handle THM("RSN: no unifiers",_,_) => (*from dup_intr*)
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   526
   error ("Ill-formed introduction rule\n" ^ Display.string_of_thm_without_context th);
18557
60a0f9caa0a2 Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents: 18534
diff changeset
   527
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   528
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   529
fun delE th
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   530
         (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   531
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   532
 if mem_thm hazEs th then
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   533
   let val th' = classical_rule (flat_rule th)
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   534
   in CS{haz_netpair = delete ([], [th']) haz_netpair,
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   535
        dup_netpair = delete ([], [dup_elim th']) dup_netpair,
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   536
        safeIs  = safeIs,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   537
        safeEs  = safeEs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   538
        hazIs   = hazIs,
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   539
        hazEs   = rem_thm th hazEs,
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   540
        swrappers     = swrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   541
        uwrappers     = uwrappers,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   542
        safe0_netpair = safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   543
        safep_netpair = safep_netpair,
12401
4363432ef0cd added 'swapped' attribute;
wenzelm
parents: 12376
diff changeset
   544
        xtra_netpair = delete' ([], [th]) xtra_netpair}
23594
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   545
   end
e65e466dda01 renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23178
diff changeset
   546
 else cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   547
2813
cc4c816dafdc delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents: 2689
diff changeset
   548
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*)
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   549
fun delrule th (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}) =
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   550
  let val th' = Tactic.make_elim th in
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   551
    if mem_thm safeIs th orelse mem_thm safeEs th orelse
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   552
      mem_thm hazIs th orelse mem_thm hazEs th orelse
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   553
      mem_thm safeEs th' orelse mem_thm hazEs th'
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   554
    then delSI th (delSE th (delI th (delE th (delSE th' (delE th' cs)))))
32091
30e2ffbba718 proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents: 31945
diff changeset
   555
    else (warning ("Undeclared classical rule\n" ^ Display.string_of_thm_without_context th); cs)
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   556
  end;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   557
18534
6799b38ed872 added classical_rule, which replaces Data.make_elim;
wenzelm
parents: 18374
diff changeset
   558
fun cs delrules ths = fold delrule ths cs;
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   559
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   560
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   561
(*** Modifying the wrapper tacticals ***)
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   562
fun map_swrappers f
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   563
  (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   564
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   565
  CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   566
    swrappers = f swrappers, uwrappers = uwrappers,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   567
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
6955
9e2d97ef55d2 type claset: added extra I/E rules;
wenzelm
parents: 6556
diff changeset
   568
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   569
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   570
fun map_uwrappers f
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   571
  (CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   572
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   573
  CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   574
    swrappers = swrappers, uwrappers = f uwrappers,
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   575
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
6955
9e2d97ef55d2 type claset: added extra I/E rules;
wenzelm
parents: 6556
diff changeset
   576
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   577
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   578
fun update_warn msg (p as (key : string, _)) xs =
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   579
  (if AList.defined (op =) xs key then warning msg else ();
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   580
    AList.update (op =) p xs);
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   581
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   582
fun delete_warn msg (key : string) xs =
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   583
  if AList.defined (op =) xs key then AList.delete (op =) key xs
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   584
    else (warning msg; xs);
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   585
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   586
(*Add/replace a safe wrapper*)
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   587
fun cs addSWrapper new_swrapper = map_swrappers
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   588
  (update_warn ("Overwriting safe wrapper " ^ fst new_swrapper) new_swrapper) cs;
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   589
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   590
(*Add/replace an unsafe wrapper*)
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   591
fun cs addWrapper new_uwrapper = map_uwrappers
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   592
  (update_warn ("Overwriting unsafe wrapper " ^ fst new_uwrapper) new_uwrapper) cs;
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   593
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   594
(*Remove a safe wrapper*)
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   595
fun cs delSWrapper name = map_swrappers
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   596
  (delete_warn ("No such safe wrapper in claset: " ^ name) name) cs;
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   597
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   598
(*Remove an unsafe wrapper*)
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   599
fun cs delWrapper name = map_uwrappers
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   600
  (delete_warn ("No such unsafe wrapper in claset: " ^ name) name) cs;
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   601
11168
b964accc9307 corrected comments on addbefore and addSbefore
oheimb
parents: 10821
diff changeset
   602
(* compose a safe tactic alternatively before/after safe_step_tac *)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   603
fun cs addSbefore  (name,    tac1) =
5523
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
   604
    cs addSWrapper (name, fn tac2 => tac1 ORELSE' tac2);
11181
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
   605
fun cs addSafter   (name,    tac2) =
5523
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
   606
    cs addSWrapper (name, fn tac1 => tac1 ORELSE' tac2);
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   607
11168
b964accc9307 corrected comments on addbefore and addSbefore
oheimb
parents: 10821
diff changeset
   608
(*compose a tactic alternatively before/after the step tactic *)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   609
fun cs addbefore   (name,    tac1) =
5523
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
   610
    cs addWrapper  (name, fn tac2 => tac1 APPEND' tac2);
11181
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
   611
fun cs addafter    (name,    tac2) =
5523
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
   612
    cs addWrapper  (name, fn tac1 => tac1 APPEND' tac2);
4767
b9f3468c6ee2 introduced functions for updating the wrapper lists
oheimb
parents: 4765
diff changeset
   613
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   614
fun cs addD2     (name, thm) =
11181
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
   615
    cs addafter  (name, datac thm 1);
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   616
fun cs addE2     (name, thm) =
11181
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
   617
    cs addafter  (name, eatac thm 1);
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
   618
fun cs addSD2    (name, thm) =
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
   619
    cs addSafter (name, dmatch_tac [thm] THEN' eq_assume_tac);
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
   620
fun cs addSE2    (name, thm) =
d04f57b91166 renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents: 11168
diff changeset
   621
    cs addSafter (name, ematch_tac [thm] THEN' eq_assume_tac);
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   622
1711
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   623
(*Merge works by adding all new rules of the 2nd claset into the 1st claset.
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   624
  Merging the term nets may look more efficient, but the rather delicate
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   625
  treatment of priority might get muddled up.*)
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   626
fun merge_cs (cs as CS {safeIs, safeEs, hazIs, hazEs, ...},
24358
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   627
    cs' as CS {safeIs = safeIs2, safeEs = safeEs2, hazIs = hazIs2, hazEs = hazEs2,
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   628
      swrappers, uwrappers, ...}) =
24358
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   629
  if pointer_eq (cs, cs') then cs
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   630
  else
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   631
    let
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   632
      val safeIs' = fold rem_thm safeIs safeIs2;
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   633
      val safeEs' = fold rem_thm safeEs safeEs2;
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   634
      val hazIs' = fold rem_thm hazIs hazIs2;
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   635
      val hazEs' = fold rem_thm hazEs hazEs2;
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   636
      val cs1   = cs addSIs safeIs'
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   637
                     addSEs safeEs'
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   638
                     addIs  hazIs'
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   639
                     addEs  hazEs';
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   640
      val cs2 = map_swrappers
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   641
        (fn ws => AList.merge (op =) (K true) (ws, swrappers)) cs1;
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   642
      val cs3 = map_uwrappers
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   643
        (fn ws => AList.merge (op =) (K true) (ws, uwrappers)) cs2;
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   644
    in cs3 end;
1711
c06d01f75764 Provides merge_cs to support default clasets
paulson
parents: 1587
diff changeset
   645
982
4fe0b642b7d5 Addition of wrappers for integration with the simplifier.
lcp
parents: 747
diff changeset
   646
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   647
(**** Simple tactics for theorem proving ****)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   648
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   649
(*Attack subgoals using safe inferences -- matching, not resolution*)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   650
fun safe_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) =
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   651
  appSWrappers cs (FIRST' [
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   652
        eq_assume_tac,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   653
        eq_mp_tac,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   654
        bimatch_from_nets_tac safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   655
        FIRST' hyp_subst_tacs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   656
        bimatch_from_nets_tac safep_netpair]);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   657
5757
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   658
(*Repeatedly attack a subgoal using safe inferences -- it's deterministic!*)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   659
fun safe_steps_tac cs = REPEAT_DETERM1 o
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   660
        (fn i => COND (has_fewer_prems i) no_tac (safe_step_tac cs i));
5757
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   661
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   662
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*)
5757
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   663
fun safe_tac cs = REPEAT_DETERM1 (FIRSTGOAL (safe_steps_tac cs));
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   664
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   665
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   666
(*** Clarify_tac: do safe steps without causing branching ***)
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   667
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   668
fun nsubgoalsP n (k,brl) = (subgoals_of_brl brl = n);
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   669
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   670
(*version of bimatch_from_nets_tac that only applies rules that
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   671
  create precisely n subgoals.*)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   672
fun n_bimatch_from_nets_tac n =
33317
b4534348b8fd standardized filter/filter_out;
wenzelm
parents: 32960
diff changeset
   673
    biresolution_from_nets_tac (order_list o filter (nsubgoalsP n)) true;
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   674
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   675
fun eq_contr_tac i = ematch_tac [not_elim] i  THEN  eq_assume_tac i;
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   676
val eq_assume_contr_tac = eq_assume_tac ORELSE' eq_contr_tac;
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   677
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   678
(*Two-way branching is allowed only if one of the branches immediately closes*)
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   679
fun bimatch2_tac netpair i =
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   680
    n_bimatch_from_nets_tac 2 netpair i THEN
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   681
    (eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i+1));
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   682
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   683
(*Attack subgoals using safe inferences -- matching, not resolution*)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   684
fun clarify_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) =
4651
70dd492a1698 changed wrapper mechanism of classical reasoner
oheimb
parents: 4646
diff changeset
   685
  appSWrappers cs (FIRST' [
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   686
        eq_assume_contr_tac,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   687
        bimatch_from_nets_tac safe0_netpair,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   688
        FIRST' hyp_subst_tacs,
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   689
        n_bimatch_from_nets_tac 1 safep_netpair,
3705
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   690
        bimatch2_tac safep_netpair]);
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   691
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   692
fun clarify_tac cs = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac cs 1));
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   693
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   694
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   695
(*** Unsafe steps instantiate variables or lose information ***)
76f3b2803982 Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents: 3546
diff changeset
   696
4066
7b508ac609f7 Fixed comments
paulson
parents: 3727
diff changeset
   697
(*Backtracking is allowed among the various these unsafe ways of
7b508ac609f7 Fixed comments
paulson
parents: 3727
diff changeset
   698
  proving a subgoal.  *)
32862
1fc86cec3bdf eliminated dead code and redundant parameters;
wenzelm
parents: 32740
diff changeset
   699
fun inst0_step_tac (CS {safe0_netpair, ...}) =
1fc86cec3bdf eliminated dead code and redundant parameters;
wenzelm
parents: 32740
diff changeset
   700
  assume_tac APPEND'
1fc86cec3bdf eliminated dead code and redundant parameters;
wenzelm
parents: 32740
diff changeset
   701
  contr_tac APPEND'
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   702
  biresolve_from_nets_tac safe0_netpair;
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   703
4066
7b508ac609f7 Fixed comments
paulson
parents: 3727
diff changeset
   704
(*These unsafe steps could generate more subgoals.*)
32862
1fc86cec3bdf eliminated dead code and redundant parameters;
wenzelm
parents: 32740
diff changeset
   705
fun instp_step_tac (CS {safep_netpair, ...}) =
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   706
  biresolve_from_nets_tac safep_netpair;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   707
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   708
(*These steps could instantiate variables and are therefore unsafe.*)
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   709
fun inst_step_tac cs = inst0_step_tac cs APPEND' instp_step_tac cs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   710
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   711
fun haz_step_tac (CS{haz_netpair,...}) =
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   712
  biresolve_from_nets_tac haz_netpair;
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   713
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   714
(*Single step for the prover.  FAILS unless it makes progress. *)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   715
fun step_tac cs i = safe_tac cs ORELSE appWrappers cs
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   716
        (inst_step_tac cs ORELSE' haz_step_tac cs) i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   717
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   718
(*Using a "safe" rule to instantiate variables is unsafe.  This tactic
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   719
  allows backtracking from "safe" rules to "unsafe" rules here.*)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   720
fun slow_step_tac cs i = safe_tac cs ORELSE appWrappers cs
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   721
        (inst_step_tac cs APPEND' haz_step_tac cs) i;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   722
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   723
(**** The following tactics all fail unless they solve one goal ****)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   724
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   725
(*Dumb but fast*)
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   726
fun fast_tac cs =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   727
  Object_Logic.atomize_prems_tac THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac cs 1));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   728
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   729
(*Slower but smarter than fast_tac*)
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   730
fun best_tac cs =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   731
  Object_Logic.atomize_prems_tac THEN'
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   732
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (step_tac cs 1));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   733
9402
480a1b40fdd6 strengthened force_tac by using new first_best_tac
oheimb
parents: 9184
diff changeset
   734
(*even a bit smarter than best_tac*)
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   735
fun first_best_tac cs =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   736
  Object_Logic.atomize_prems_tac THEN'
9402
480a1b40fdd6 strengthened force_tac by using new first_best_tac
oheimb
parents: 9184
diff changeset
   737
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (FIRSTGOAL (step_tac cs)));
480a1b40fdd6 strengthened force_tac by using new first_best_tac
oheimb
parents: 9184
diff changeset
   738
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   739
fun slow_tac cs =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   740
  Object_Logic.atomize_prems_tac THEN'
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   741
  SELECT_GOAL (DEPTH_SOLVE (slow_step_tac cs 1));
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   742
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   743
fun slow_best_tac cs =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   744
  Object_Logic.atomize_prems_tac THEN'
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   745
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (slow_step_tac cs 1));
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   746
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   747
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   748
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*)
32740
9dd0a2f83429 explicit indication of Unsynchronized.ref;
wenzelm
parents: 32261
diff changeset
   749
val weight_ASTAR = Unsynchronized.ref 5;
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   750
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   751
fun astar_tac cs =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   752
  Object_Logic.atomize_prems_tac THEN'
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   753
  SELECT_GOAL
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   754
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev)
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   755
      (step_tac cs 1));
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   756
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   757
fun slow_astar_tac cs =
35625
9c818cab0dd0 modernized structure Object_Logic;
wenzelm
parents: 35613
diff changeset
   758
  Object_Logic.atomize_prems_tac THEN'
10382
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   759
  SELECT_GOAL
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   760
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev)
1fb807260ff1 atomize: all automated tactics that "solve" goals;
wenzelm
parents: 10309
diff changeset
   761
      (slow_step_tac cs 1));
1587
e7d8a4957bac Now provides astar versions (thanks to Norbert Voelker)
paulson
parents: 1524
diff changeset
   762
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   763
(**** Complete tactic, loosely based upon LeanTaP.  This tactic is the outcome
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   764
  of much experimentation!  Changing APPEND to ORELSE below would prove
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   765
  easy theorems faster, but loses completeness -- and many of the harder
1800
3d9d2ef0cd3b Now implements delrules
paulson
parents: 1724
diff changeset
   766
  theorems such as 43. ****)
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   767
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   768
(*Non-deterministic!  Could always expand the first unsafe connective.
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   769
  That's hard to implement and did not perform better in experiments, due to
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   770
  greater search depth required.*)
32863
5e8cef567042 eliminated dead code;
wenzelm
parents: 32862
diff changeset
   771
fun dup_step_tac (CS {dup_netpair, ...}) =
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   772
  biresolve_from_nets_tac dup_netpair;
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   773
5523
dc8cdc192cd0 added addD2, addE2, addSD2, and addSE2
oheimb
parents: 5028
diff changeset
   774
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*)
5757
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   775
local
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   776
fun slow_step_tac' cs = appWrappers cs
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   777
        (instp_step_tac cs APPEND' dup_step_tac cs);
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   778
in fun depth_tac cs m i state = SELECT_GOAL
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   779
   (safe_steps_tac cs 1 THEN_ELSE
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   780
        (DEPTH_SOLVE (depth_tac cs m 1),
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   781
         inst0_step_tac cs 1 APPEND COND (K (m=0)) no_tac
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   782
                (slow_step_tac' cs 1 THEN DEPTH_SOLVE (depth_tac cs (m-1) 1))
5757
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   783
        )) i state;
0ad476dabbc6 corrected (and simplified) depth_tac
oheimb
parents: 5523
diff changeset
   784
end;
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   785
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   786
(*Search, with depth bound m.
2173
08c68550460b Added a comment
paulson
parents: 2066
diff changeset
   787
  This is the "entry point", which does safe inferences first.*)
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   788
fun safe_depth_tac cs m =
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   789
  SUBGOAL
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   790
    (fn (prem,i) =>
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   791
      let val deti =
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   792
          (*No Vars in the goal?  No need to backtrack between goals.*)
29267
8615b4f54047 use exists_subterm directly;
wenzelm
parents: 26938
diff changeset
   793
          if exists_subterm (fn Var _ => true | _ => false) prem then DETERM else I
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   794
      in  SELECT_GOAL (TRY (safe_tac cs) THEN
9938
cb6a7572d0a1 delrule: handle dest rules as well;
wenzelm
parents: 9899
diff changeset
   795
                       DEPTH_SOLVE (deti (depth_tac cs m 1))) i
747
bdc066781063 deepen_tac: modified due to outcome of experiments. Its
lcp
parents: 681
diff changeset
   796
      end);
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   797
2868
17a23a62f82a New DEEPEN allows giving an upper bound for deepen_tac
paulson
parents: 2813
diff changeset
   798
fun deepen_tac cs = DEEPEN (2,10) (safe_depth_tac cs);
681
9b02474744ca Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents: 469
diff changeset
   799
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   800
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   801
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   802
(** context dependent claset components **)
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   803
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   804
datatype context_cs = ContextCS of
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   805
 {swrappers: (string * (Proof.context -> wrapper)) list,
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   806
  uwrappers: (string * (Proof.context -> wrapper)) list};
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   807
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   808
fun context_cs ctxt cs (ContextCS {swrappers, uwrappers}) =
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   809
  let
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   810
    fun add_wrapper add (name, f) claset = add (claset, (name, f ctxt));
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   811
  in
22674
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   812
    cs
1a610904bbca canonical merge operations
haftmann
parents: 22474
diff changeset
   813
    |> fold_rev (add_wrapper (op addSWrapper)) swrappers
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   814
    |> fold_rev (add_wrapper (op addWrapper)) uwrappers
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   815
  end;
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   816
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   817
fun make_context_cs (swrappers, uwrappers) =
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   818
  ContextCS {swrappers = swrappers, uwrappers = uwrappers};
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   819
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   820
val empty_context_cs = make_context_cs ([], []);
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   821
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   822
fun merge_context_cs (ctxt_cs1, ctxt_cs2) =
24358
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   823
  if pointer_eq (ctxt_cs1, ctxt_cs2) then ctxt_cs1
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   824
  else
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   825
    let
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   826
      val ContextCS {swrappers = swrappers1, uwrappers = uwrappers1} = ctxt_cs1;
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   827
      val ContextCS {swrappers = swrappers2, uwrappers = uwrappers2} = ctxt_cs2;
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   828
      val swrappers' = AList.merge (op =) (K true) (swrappers1, swrappers2);
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   829
      val uwrappers' = AList.merge (op =) (K true) (uwrappers1, uwrappers2);
d75af3e90e82 tuned merge operations via pointer_eq;
wenzelm
parents: 24218
diff changeset
   830
    in make_context_cs (swrappers', uwrappers') end;
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   831
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   832
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   833
17880
4494c023bf2a change_claset(_of): more abtract interface;
wenzelm
parents: 17795
diff changeset
   834
(** claset data **)
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   835
24021
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   836
(* global clasets *)
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   837
33522
737589bb9bb8 adapted Theory_Data;
wenzelm
parents: 33519
diff changeset
   838
structure GlobalClaset = Theory_Data
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22674
diff changeset
   839
(
26497
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   840
  type T = claset * context_cs;
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   841
  val empty = (empty_cs, empty_context_cs);
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   842
  val extend = I;
33522
737589bb9bb8 adapted Theory_Data;
wenzelm
parents: 33519
diff changeset
   843
  fun merge ((cs1, ctxt_cs1), (cs2, ctxt_cs2)) =
26497
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   844
    (merge_cs (cs1, cs2), merge_context_cs (ctxt_cs1, ctxt_cs2));
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22674
diff changeset
   845
);
1724
bb02e6976258 Added functions for default claset.
berghofe
parents: 1711
diff changeset
   846
32261
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   847
val get_global_claset = #1 o GlobalClaset.get;
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   848
val map_global_claset = GlobalClaset.map o apfst;
17880
4494c023bf2a change_claset(_of): more abtract interface;
wenzelm
parents: 17795
diff changeset
   849
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   850
val get_context_cs = #2 o GlobalClaset.get o ProofContext.theory_of;
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   851
fun map_context_cs f = GlobalClaset.map (apsnd
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   852
  (fn ContextCS {swrappers, uwrappers} => make_context_cs (f (swrappers, uwrappers))));
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   853
32148
253f6808dabe renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents: 32091
diff changeset
   854
fun global_claset_of thy =
26497
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   855
  let val (cs, ctxt_cs) = GlobalClaset.get thy
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   856
  in context_cs (ProofContext.init thy) cs (ctxt_cs) end;
3727
ed63c05d7992 Added Safe_tac; all other default claset tactics now dereference "claset"
paulson
parents: 3705
diff changeset
   857
4079
9df5e4f22d96 new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents: 4066
diff changeset
   858
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   859
(* context dependent components *)
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   860
26497
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   861
fun add_context_safe_wrapper wrapper = map_context_cs (apfst ((AList.update (op =) wrapper)));
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   862
fun del_context_safe_wrapper name = map_context_cs (apfst ((AList.delete (op =) name)));
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   863
26497
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   864
fun add_context_unsafe_wrapper wrapper = map_context_cs (apsnd ((AList.update (op =) wrapper)));
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   865
fun del_context_unsafe_wrapper name = map_context_cs (apsnd ((AList.delete (op =) name)));
15036
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   866
cab1c1fc1851 context dependent components;
wenzelm
parents: 14605
diff changeset
   867
24021
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   868
(* local clasets *)
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   869
33519
e31a85f92ce9 adapted Generic_Data, Proof_Data;
wenzelm
parents: 33369
diff changeset
   870
structure LocalClaset = Proof_Data
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22674
diff changeset
   871
(
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   872
  type T = claset;
32261
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   873
  val init = get_global_claset;
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22674
diff changeset
   874
);
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   875
32261
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   876
val get_claset = LocalClaset.get;
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   877
val put_claset = LocalClaset.put;
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   878
32148
253f6808dabe renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents: 32091
diff changeset
   879
fun claset_of ctxt =
26497
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
   880
  context_cs ctxt (LocalClaset.get ctxt) (get_context_cs ctxt);
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22674
diff changeset
   881
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   882
24021
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   883
(* generic clasets *)
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   884
32148
253f6808dabe renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents: 32091
diff changeset
   885
val get_cs = Context.cases global_claset_of claset_of;
32261
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   886
fun map_cs f = Context.mapping (map_global_claset f) (LocalClaset.map f);
24021
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   887
491c68f40bc4 added get_cs/map_cs;
wenzelm
parents: 23594
diff changeset
   888
5885
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   889
(* attributes *)
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   890
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   891
fun attrib f = Thm.declaration_attribute (fn th =>
32261
05e687ddbcee removed old global get_claset/map_claset;
wenzelm
parents: 32148
diff changeset
   892
  Context.mapping (map_global_claset (f th)) (LocalClaset.map (f th)));
5885
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   893
21689
58abd6d8abd1 Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents: 21687
diff changeset
   894
fun safe_dest w = attrib (addSE w o make_elim);
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   895
val safe_elim = attrib o addSE;
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   896
val safe_intro = attrib o addSI;
21689
58abd6d8abd1 Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents: 21687
diff changeset
   897
fun haz_dest w = attrib (addE w o make_elim);
18691
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   898
val haz_elim = attrib o addE;
a2dc15d9d6c8 attributes: optional weight;
wenzelm
parents: 18688
diff changeset
   899
val haz_intro = attrib o addI;
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   900
val rule_del = attrib delrule o Context_Rules.rule_del;
5885
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   901
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   902
10736
7f94cb4517fa recover_order for single step tules;
wenzelm
parents: 10394
diff changeset
   903
end;
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   904
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   905
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   906
5885
6c920d876098 tuned attribute names;
wenzelm
parents: 5841
diff changeset
   907
(** concrete syntax of attributes **)
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   908
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   909
val introN = "intro";
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   910
val elimN = "elim";
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   911
val destN = "dest";
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   912
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   913
val setup_attrs =
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   914
  Attrib.setup @{binding swapped} (Scan.succeed swapped)
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   915
    "classical swap of introduction rule" #>
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   916
  Attrib.setup @{binding dest} (Context_Rules.add safe_dest haz_dest Context_Rules.dest_query)
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   917
    "declaration of Classical destruction rule" #>
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   918
  Attrib.setup @{binding elim} (Context_Rules.add safe_elim haz_elim Context_Rules.elim_query)
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   919
    "declaration of Classical elimination rule" #>
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   920
  Attrib.setup @{binding intro} (Context_Rules.add safe_intro haz_intro Context_Rules.intro_query)
30528
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   921
    "declaration of Classical introduction rule" #>
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   922
  Attrib.setup @{binding rule} (Scan.lift Args.del >> K rule_del)
7173bf123335 simplified attribute setup;
wenzelm
parents: 30513
diff changeset
   923
    "remove declaration of intro/elim/dest rule";
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   924
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   925
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   926
7230
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   927
(** proof methods **)
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   928
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   929
local
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   930
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   931
fun some_rule_tac ctxt facts = SUBGOAL (fn (goal, i) =>
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   932
  let
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   933
    val [rules1, rules2, rules4] = Context_Rules.find_rules false facts goal ctxt;
32148
253f6808dabe renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents: 32091
diff changeset
   934
    val CS {xtra_netpair, ...} = claset_of ctxt;
33369
470a7b233ee5 modernized structure Context_Rules;
wenzelm
parents: 33339
diff changeset
   935
    val rules3 = Context_Rules.find_rules_netpair true facts goal xtra_netpair;
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   936
    val rules = rules1 @ rules2 @ rules3 @ rules4;
18223
20830cb4428c Drule.multi_resolves;
wenzelm
parents: 18015
diff changeset
   937
    val ruleq = Drule.multi_resolves facts rules;
12376
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   938
  in
480303e3fa08 simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents: 12362
diff changeset
   939
    Method.trace ctxt rules;
32952
aeb1e44fbc19 replaced String.concat by implode;
wenzelm
parents: 32863
diff changeset
   940
    fn st => Seq.maps (fn rule => Tactic.rtac rule i st) ruleq
18834
7e94af77cfce default rule step: norm_hhf_tac;
wenzelm
parents: 18728
diff changeset
   941
  end)
21687
f689f729afab reorganized structure Goal vs. Tactic;
wenzelm
parents: 21646
diff changeset
   942
  THEN_ALL_NEW Goal.norm_hhf_tac;
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   943
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   944
in
7281
2f454e1fd372 renamed 'some_rule' to 'rule';
wenzelm
parents: 7272
diff changeset
   945
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   946
fun rule_tac ctxt [] facts = some_rule_tac ctxt facts
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   947
  | rule_tac _ rules facts = Method.rule_tac rules facts;
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   948
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   949
fun default_tac ctxt rules facts =
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   950
  HEADGOAL (rule_tac ctxt rules facts) ORELSE
26470
e44d24620515 unfold_locales now part of default tactic
haftmann
parents: 26425
diff changeset
   951
  Class.default_intro_tac ctxt facts;
10309
a7f961fb62c6 intro_classes by default;
wenzelm
parents: 10185
diff changeset
   952
7230
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   953
end;
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   954
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   955
7230
4ca0d7839ff1 renamed 'single' to 'some_rule';
wenzelm
parents: 7154
diff changeset
   956
(* contradiction method *)
6502
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   957
7425
2089c70f2c6d Method.insert_tac;
wenzelm
parents: 7354
diff changeset
   958
val contradiction = Method.rule [Data.not_elim, Data.not_elim COMP Drule.swap_prems_rl];
6502
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   959
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   960
bc30e13b36a8 improved 'single' method;
wenzelm
parents: 6492
diff changeset
   961
(* automatic methods *)
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   962
5927
991483daa1a4 expoer cla_method('), cla_modifiers;
wenzelm
parents: 5885
diff changeset
   963
val cla_modifiers =
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   964
 [Args.$$$ destN -- Args.bang_colon >> K ((I, safe_dest NONE): Method.modifier),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   965
  Args.$$$ destN -- Args.colon >> K (I, haz_dest NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   966
  Args.$$$ elimN -- Args.bang_colon >> K (I, safe_elim NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   967
  Args.$$$ elimN -- Args.colon >> K (I, haz_elim NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   968
  Args.$$$ introN -- Args.bang_colon >> K (I, safe_intro NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   969
  Args.$$$ introN -- Args.colon >> K (I, haz_intro NONE),
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   970
  Args.del -- Args.colon >> K (I, rule_del)];
5927
991483daa1a4 expoer cla_method('), cla_modifiers;
wenzelm
parents: 5885
diff changeset
   971
35613
9d3ff36ad4e1 eliminated Args.bang_facts (legacy feature);
wenzelm
parents: 33522
diff changeset
   972
fun cla_meth tac ctxt = METHOD (fn facts =>
9d3ff36ad4e1 eliminated Args.bang_facts (legacy feature);
wenzelm
parents: 33522
diff changeset
   973
  ALLGOALS (Method.insert_tac facts) THEN tac (claset_of ctxt));
7132
5c31d06ead04 eliminated METHOD0 in favour of same_tac;
wenzelm
parents: 7106
diff changeset
   974
35613
9d3ff36ad4e1 eliminated Args.bang_facts (legacy feature);
wenzelm
parents: 33522
diff changeset
   975
fun cla_meth' tac ctxt = METHOD (fn facts =>
9d3ff36ad4e1 eliminated Args.bang_facts (legacy feature);
wenzelm
parents: 33522
diff changeset
   976
  HEADGOAL (Method.insert_tac facts THEN' tac (claset_of ctxt)));
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   977
35613
9d3ff36ad4e1 eliminated Args.bang_facts (legacy feature);
wenzelm
parents: 33522
diff changeset
   978
fun cla_method tac = Method.sections cla_modifiers >> K (cla_meth tac);
9d3ff36ad4e1 eliminated Args.bang_facts (legacy feature);
wenzelm
parents: 33522
diff changeset
   979
fun cla_method' tac = Method.sections cla_modifiers >> K (cla_meth' tac);
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   980
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   981
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   982
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   983
(** setup_methods **)
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
   984
30541
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   985
val setup_methods =
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   986
  Method.setup @{binding default}
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   987
   (Attrib.thms >> (fn rules => fn ctxt => METHOD (default_tac ctxt rules)))
30541
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   988
    "apply some intro/elim rule (potentially classical)" #>
30609
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   989
  Method.setup @{binding rule}
983e8b6e4e69 Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents: 30558
diff changeset
   990
    (Attrib.thms >> (fn rules => fn ctxt => METHOD (HEADGOAL o rule_tac ctxt rules)))
30541
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   991
    "apply some intro/elim rule (potentially classical)" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   992
  Method.setup @{binding contradiction} (Scan.succeed (K contradiction))
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   993
    "proof by contradiction" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   994
  Method.setup @{binding clarify} (cla_method' (CHANGED_PROP oo clarify_tac))
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   995
    "repeatedly apply safe steps" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   996
  Method.setup @{binding fast} (cla_method' fast_tac) "classical prover (depth-first)" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   997
  Method.setup @{binding slow} (cla_method' slow_tac) "classical prover (slow depth-first)" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   998
  Method.setup @{binding best} (cla_method' best_tac) "classical prover (best-first)" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
   999
  Method.setup @{binding deepen} (cla_method' (fn cs => deepen_tac cs 4))
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
  1000
    "classical prover (iterative deepening)" #>
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
  1001
  Method.setup @{binding safe} (cla_method (CHANGED_PROP o safe_tac))
9f168bdc468a simplified method setup;
wenzelm
parents: 30528
diff changeset
  1002
    "classical prover (apply safe rules)";
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
  1003
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
  1004
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
  1005
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
  1006
(** theory setup **)
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
  1007
26497
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
  1008
val setup = setup_attrs #> setup_methods;
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
  1009
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
  1010
8667
4230d17073ea print_simpset / print_claset command;
wenzelm
parents: 8519
diff changeset
  1011
4230d17073ea print_simpset / print_claset command;
wenzelm
parents: 8519
diff changeset
  1012
(** outer syntax **)
4230d17073ea print_simpset / print_claset command;
wenzelm
parents: 8519
diff changeset
  1013
24867
e5b55d7be9bb simplified interfaces for outer syntax;
wenzelm
parents: 24358
diff changeset
  1014
val _ =
8667
4230d17073ea print_simpset / print_claset command;
wenzelm
parents: 8519
diff changeset
  1015
  OuterSyntax.improper_command "print_claset" "print context of Classical Reasoner"
17057
0934ac31985f OuterKeyword;
wenzelm
parents: 16806
diff changeset
  1016
    OuterKeyword.diag
26497
1873915c64a9 purely functional setup of claset/simpset/clasimpset;
wenzelm
parents: 26470
diff changeset
  1017
    (Scan.succeed (Toplevel.no_timing o Toplevel.unknown_context o
32148
253f6808dabe renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents: 32091
diff changeset
  1018
      Toplevel.keep (print_cs o claset_of o Toplevel.context_of)));
8667
4230d17073ea print_simpset / print_claset command;
wenzelm
parents: 8519
diff changeset
  1019
5841
d05df8752a8a local claset theory data;
wenzelm
parents: 5757
diff changeset
  1020
end;