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