src/Provers/classical.ML
author wenzelm
Fri Oct 12 12:05:02 2001 +0200 (2001-10-12 ago)
changeset 11723 2b4a0d630071
parent 11181 d04f57b91166
child 11754 3928d990c22f
permissions -rw-r--r--
moved trace_rules to Pure/Isar/method.ML;
some_rule_tac: prefer Method.some_rule_tac of Pure, no special
handling of imp_elim;
wenzelm@9938
     1
(*  Title:      Provers/classical.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@9938
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     4
    Copyright   1992  University of Cambridge
clasohm@0
     5
clasohm@0
     6
Theorem prover for classical reasoning, including predicate calculus, set
clasohm@0
     7
theory, etc.
clasohm@0
     8
wenzelm@9563
     9
Rules must be classified as intro, elim, safe, hazardous (unsafe).
clasohm@0
    10
clasohm@0
    11
A rule is unsafe unless it can be applied blindly without harmful results.
clasohm@0
    12
For a rule to be safe, its premises and conclusion should be logically
clasohm@0
    13
equivalent.  There should be no variables in the premises that are not in
clasohm@0
    14
the conclusion.
clasohm@0
    15
*)
clasohm@0
    16
wenzelm@4079
    17
(*higher precedence than := facilitates use of references*)
wenzelm@10034
    18
infix 4 addSIs addSEs addSDs addIs addEs addDs addXIs addXEs addXDs delrules
oheimb@4651
    19
  addSWrapper delSWrapper addWrapper delWrapper
oheimb@11181
    20
  addSbefore addSafter addbefore addafter
oheimb@5523
    21
  addD2 addE2 addSD2 addSE2;
wenzelm@4079
    22
wenzelm@4079
    23
wenzelm@4079
    24
(*should be a type abbreviation in signature CLASSICAL*)
wenzelm@4079
    25
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net;
oheimb@4651
    26
type wrapper = (int -> tactic) -> (int -> tactic);
wenzelm@4079
    27
clasohm@0
    28
signature CLASSICAL_DATA =
wenzelm@4079
    29
sig
paulson@9171
    30
  val make_elim : thm -> thm    (* Tactic.make_elim or a classical version*)
wenzelm@9938
    31
  val mp        : thm           (* [| P-->Q;  P |] ==> Q *)
wenzelm@9938
    32
  val not_elim  : thm           (* [| ~P;  P |] ==> R *)
wenzelm@9938
    33
  val classical : thm           (* (~P ==> P) ==> P *)
wenzelm@9938
    34
  val sizef     : thm -> int    (* size function for BEST_FIRST *)
clasohm@0
    35
  val hyp_subst_tacs: (int -> tactic) list
wenzelm@10382
    36
  val atomize: thm list
wenzelm@4079
    37
end;
clasohm@0
    38
wenzelm@5841
    39
signature BASIC_CLASSICAL =
wenzelm@4079
    40
sig
clasohm@0
    41
  type claset
wenzelm@4079
    42
  val empty_cs: claset
wenzelm@4079
    43
  val print_cs: claset -> unit
wenzelm@4380
    44
  val print_claset: theory -> unit
oheimb@4653
    45
  val rep_cs: (* BLAST_DATA in blast.ML dependent on this *)
wenzelm@4079
    46
    claset -> {safeIs: thm list, safeEs: thm list,
wenzelm@9938
    47
                 hazIs: thm list, hazEs: thm list,
wenzelm@9938
    48
                 xtraIs: thm list, xtraEs: thm list,
wenzelm@10736
    49
                 swrappers: (string * wrapper) list,
wenzelm@9938
    50
                 uwrappers: (string * wrapper) list,
wenzelm@9938
    51
                 safe0_netpair: netpair, safep_netpair: netpair,
wenzelm@9938
    52
                 haz_netpair: netpair, dup_netpair: netpair, xtra_netpair: netpair}
wenzelm@9938
    53
  val merge_cs          : claset * claset -> claset
wenzelm@9938
    54
  val addDs             : claset * thm list -> claset
wenzelm@9938
    55
  val addEs             : claset * thm list -> claset
wenzelm@9938
    56
  val addIs             : claset * thm list -> claset
wenzelm@9938
    57
  val addSDs            : claset * thm list -> claset
wenzelm@9938
    58
  val addSEs            : claset * thm list -> claset
wenzelm@9938
    59
  val addSIs            : claset * thm list -> claset
wenzelm@10034
    60
  val addXDs            : claset * thm list -> claset
wenzelm@10034
    61
  val addXEs            : claset * thm list -> claset
wenzelm@10034
    62
  val addXIs            : claset * thm list -> claset
wenzelm@9938
    63
  val delrules          : claset * thm list -> claset
wenzelm@9938
    64
  val addSWrapper       : claset * (string * wrapper) -> claset
wenzelm@9938
    65
  val delSWrapper       : claset *  string            -> claset
wenzelm@9938
    66
  val addWrapper        : claset * (string * wrapper) -> claset
wenzelm@9938
    67
  val delWrapper        : claset *  string            -> claset
wenzelm@9938
    68
  val addSbefore        : claset * (string * (int -> tactic)) -> claset
oheimb@11181
    69
  val addSafter         : claset * (string * (int -> tactic)) -> claset
wenzelm@9938
    70
  val addbefore         : claset * (string * (int -> tactic)) -> claset
oheimb@11181
    71
  val addafter          : claset * (string * (int -> tactic)) -> claset
oheimb@5523
    72
  val addD2             : claset * (string * thm) -> claset
oheimb@5523
    73
  val addE2             : claset * (string * thm) -> claset
oheimb@5523
    74
  val addSD2            : claset * (string * thm) -> claset
oheimb@5523
    75
  val addSE2            : claset * (string * thm) -> claset
wenzelm@9938
    76
  val appSWrappers      : claset -> wrapper
wenzelm@9938
    77
  val appWrappers       : claset -> wrapper
lcp@982
    78
wenzelm@4079
    79
  val claset_ref_of_sg: Sign.sg -> claset ref
wenzelm@4079
    80
  val claset_ref_of: theory -> claset ref
wenzelm@4079
    81
  val claset_of_sg: Sign.sg -> claset
wenzelm@4079
    82
  val claset_of: theory -> claset
wenzelm@4079
    83
  val CLASET: (claset -> tactic) -> tactic
wenzelm@4079
    84
  val CLASET': (claset -> 'a -> tactic) -> 'a -> tactic
wenzelm@4079
    85
  val claset: unit -> claset
wenzelm@4079
    86
  val claset_ref: unit -> claset ref
wenzelm@4079
    87
wenzelm@9938
    88
  val fast_tac          : claset -> int -> tactic
wenzelm@9938
    89
  val slow_tac          : claset -> int -> tactic
wenzelm@9938
    90
  val weight_ASTAR      : int ref
wenzelm@9938
    91
  val astar_tac         : claset -> int -> tactic
wenzelm@9938
    92
  val slow_astar_tac    : claset -> int -> tactic
wenzelm@9938
    93
  val best_tac          : claset -> int -> tactic
wenzelm@9938
    94
  val first_best_tac    : claset -> int -> tactic
wenzelm@9938
    95
  val slow_best_tac     : claset -> int -> tactic
wenzelm@9938
    96
  val depth_tac         : claset -> int -> int -> tactic
wenzelm@9938
    97
  val deepen_tac        : claset -> int -> int -> tactic
paulson@1587
    98
wenzelm@9938
    99
  val contr_tac         : int -> tactic
wenzelm@9938
   100
  val dup_elim          : thm -> thm
wenzelm@9938
   101
  val dup_intr          : thm -> thm
wenzelm@9938
   102
  val dup_step_tac      : claset -> int -> tactic
wenzelm@9938
   103
  val eq_mp_tac         : int -> tactic
wenzelm@9938
   104
  val haz_step_tac      : claset -> int -> tactic
wenzelm@9938
   105
  val joinrules         : thm list * thm list -> (bool * thm) list
wenzelm@9938
   106
  val mp_tac            : int -> tactic
wenzelm@9938
   107
  val safe_tac          : claset -> tactic
wenzelm@9938
   108
  val safe_steps_tac    : claset -> int -> tactic
wenzelm@9938
   109
  val safe_step_tac     : claset -> int -> tactic
wenzelm@9938
   110
  val clarify_tac       : claset -> int -> tactic
wenzelm@9938
   111
  val clarify_step_tac  : claset -> int -> tactic
wenzelm@9938
   112
  val step_tac          : claset -> int -> tactic
wenzelm@9938
   113
  val slow_step_tac     : claset -> int -> tactic
wenzelm@9938
   114
  val swap              : thm                 (* ~P ==> (~Q ==> P) ==> Q *)
wenzelm@9938
   115
  val swapify           : thm list -> thm list
wenzelm@9938
   116
  val swap_res_tac      : thm list -> int -> tactic
wenzelm@9938
   117
  val inst_step_tac     : claset -> int -> tactic
wenzelm@9938
   118
  val inst0_step_tac    : claset -> int -> tactic
wenzelm@9938
   119
  val instp_step_tac    : claset -> int -> tactic
berghofe@1724
   120
wenzelm@9938
   121
  val AddDs             : thm list -> unit
wenzelm@9938
   122
  val AddEs             : thm list -> unit
wenzelm@9938
   123
  val AddIs             : thm list -> unit
wenzelm@9938
   124
  val AddSDs            : thm list -> unit
wenzelm@9938
   125
  val AddSEs            : thm list -> unit
wenzelm@9938
   126
  val AddSIs            : thm list -> unit
wenzelm@9938
   127
  val AddXDs            : thm list -> unit
wenzelm@9938
   128
  val AddXEs            : thm list -> unit
wenzelm@9938
   129
  val AddXIs            : thm list -> unit
wenzelm@9938
   130
  val Delrules          : thm list -> unit
wenzelm@9938
   131
  val Safe_tac          : tactic
wenzelm@9938
   132
  val Safe_step_tac     : int -> tactic
wenzelm@9938
   133
  val Clarify_tac       : int -> tactic
wenzelm@9938
   134
  val Clarify_step_tac  : int -> tactic
wenzelm@9938
   135
  val Step_tac          : int -> tactic
wenzelm@9938
   136
  val Fast_tac          : int -> tactic
wenzelm@9938
   137
  val Best_tac          : int -> tactic
wenzelm@9938
   138
  val Slow_tac          : int -> tactic
paulson@2066
   139
  val Slow_best_tac     : int -> tactic
wenzelm@9938
   140
  val Deepen_tac        : int -> int -> tactic
wenzelm@4079
   141
end;
berghofe@1724
   142
wenzelm@5841
   143
signature CLASSICAL =
wenzelm@5841
   144
sig
wenzelm@5841
   145
  include BASIC_CLASSICAL
wenzelm@5841
   146
  val print_local_claset: Proof.context -> unit
wenzelm@5841
   147
  val get_local_claset: Proof.context -> claset
wenzelm@5841
   148
  val put_local_claset: claset -> Proof.context -> Proof.context
wenzelm@5841
   149
  val safe_dest_global: theory attribute
wenzelm@5841
   150
  val safe_elim_global: theory attribute
wenzelm@5841
   151
  val safe_intro_global: theory attribute
wenzelm@6955
   152
  val haz_dest_global: theory attribute
wenzelm@6955
   153
  val haz_elim_global: theory attribute
wenzelm@6955
   154
  val haz_intro_global: theory attribute
wenzelm@6955
   155
  val xtra_dest_global: theory attribute
wenzelm@6955
   156
  val xtra_elim_global: theory attribute
wenzelm@6955
   157
  val xtra_intro_global: theory attribute
wenzelm@9938
   158
  val rule_del_global: theory attribute
wenzelm@6955
   159
  val safe_dest_local: Proof.context attribute
wenzelm@6955
   160
  val safe_elim_local: Proof.context attribute
wenzelm@6955
   161
  val safe_intro_local: Proof.context attribute
wenzelm@5885
   162
  val haz_dest_local: Proof.context attribute
wenzelm@5885
   163
  val haz_elim_local: Proof.context attribute
wenzelm@5885
   164
  val haz_intro_local: Proof.context attribute
wenzelm@6955
   165
  val xtra_dest_local: Proof.context attribute
wenzelm@6955
   166
  val xtra_elim_local: Proof.context attribute
wenzelm@6955
   167
  val xtra_intro_local: Proof.context attribute
wenzelm@9938
   168
  val rule_del_local: Proof.context attribute
wenzelm@7272
   169
  val cla_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list
wenzelm@7559
   170
  val cla_meth: (claset -> tactic) -> thm list -> Proof.context -> Proof.method
wenzelm@7559
   171
  val cla_meth': (claset -> int -> tactic) -> thm list -> Proof.context -> Proof.method
wenzelm@5927
   172
  val cla_method: (claset -> tactic) -> Args.src -> Proof.context -> Proof.method
wenzelm@5927
   173
  val cla_method': (claset -> int -> tactic) -> Args.src -> Proof.context -> Proof.method
wenzelm@5841
   174
  val setup: (theory -> theory) list
wenzelm@5841
   175
end;
wenzelm@5841
   176
clasohm@0
   177
wenzelm@5927
   178
functor ClassicalFun(Data: CLASSICAL_DATA): CLASSICAL =
clasohm@0
   179
struct
clasohm@0
   180
wenzelm@7354
   181
local open Data in
clasohm@0
   182
paulson@1800
   183
(*** Useful tactics for classical reasoning ***)
clasohm@0
   184
wenzelm@10382
   185
val atomize_tac = Method.atomize_tac atomize;
wenzelm@10382
   186
paulson@1524
   187
val imp_elim = (*cannot use bind_thm within a structure!*)
wenzelm@9938
   188
  store_thm ("imp_elim", Data.make_elim mp);
clasohm@0
   189
wenzelm@10736
   190
(*Prove goal that assumes both P and ~P.
paulson@4392
   191
  No backtracking if it finds an equal assumption.  Perhaps should call
paulson@4392
   192
  ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*)
wenzelm@10736
   193
val contr_tac = eresolve_tac [not_elim]  THEN'
paulson@4392
   194
                (eq_assume_tac ORELSE' assume_tac);
clasohm@0
   195
lcp@681
   196
(*Finds P-->Q and P in the assumptions, replaces implication by Q.
lcp@681
   197
  Could do the same thing for P<->Q and P... *)
lcp@681
   198
fun mp_tac i = eresolve_tac [not_elim, imp_elim] i  THEN  assume_tac i;
clasohm@0
   199
clasohm@0
   200
(*Like mp_tac but instantiates no variables*)
lcp@681
   201
fun eq_mp_tac i = ematch_tac [not_elim, imp_elim] i  THEN  eq_assume_tac i;
lcp@681
   202
paulson@1524
   203
val swap =
paulson@1524
   204
  store_thm ("swap", rule_by_tactic (etac thin_rl 1) (not_elim RS classical));
clasohm@0
   205
clasohm@0
   206
(*Creates rules to eliminate ~A, from rules to introduce A*)
clasohm@0
   207
fun swapify intrs = intrs RLN (2, [swap]);
clasohm@0
   208
clasohm@0
   209
(*Uses introduction rules in the normal way, or on negated assumptions,
clasohm@0
   210
  trying rules in order. *)
wenzelm@10736
   211
fun swap_res_tac rls =
lcp@54
   212
    let fun addrl (rl,brls) = (false, rl) :: (true, rl RSN (2,swap)) :: brls
wenzelm@10736
   213
    in  assume_tac      ORELSE'
wenzelm@10736
   214
        contr_tac       ORELSE'
lcp@54
   215
        biresolve_tac (foldr addrl (rls,[]))
clasohm@0
   216
    end;
clasohm@0
   217
lcp@681
   218
(*Duplication of hazardous rules, for complete provers*)
paulson@2689
   219
fun dup_intr th = zero_var_indexes (th RS classical);
lcp@681
   220
wenzelm@6967
   221
fun dup_elim th =
wenzelm@6967
   222
  (case try
wenzelm@6967
   223
      (rule_by_tactic (TRYALL (etac revcut_rl)))
wenzelm@6967
   224
      (th RSN (2, revcut_rl) |> assumption 2 |> Seq.hd) of
wenzelm@6967
   225
    Some th' => th'
wenzelm@6967
   226
  | _ => error ("Bad format for elimination rule\n" ^ string_of_thm th));
clasohm@0
   227
lcp@1073
   228
paulson@1800
   229
(**** Classical rule sets ****)
clasohm@0
   230
clasohm@0
   231
datatype claset =
wenzelm@9938
   232
  CS of {safeIs         : thm list,             (*safe introduction rules*)
wenzelm@9938
   233
         safeEs         : thm list,             (*safe elimination rules*)
wenzelm@9938
   234
         hazIs          : thm list,             (*unsafe introduction rules*)
wenzelm@9938
   235
         hazEs          : thm list,             (*unsafe elimination rules*)
wenzelm@9938
   236
         xtraIs         : thm list,             (*extra introduction rules*)
wenzelm@9938
   237
         xtraEs         : thm list,             (*extra elimination rules*)
wenzelm@9938
   238
         swrappers      : (string * wrapper) list, (*for transf. safe_step_tac*)
wenzelm@9938
   239
         uwrappers      : (string * wrapper) list, (*for transforming step_tac*)
wenzelm@9938
   240
         safe0_netpair  : netpair,              (*nets for trivial cases*)
wenzelm@9938
   241
         safep_netpair  : netpair,              (*nets for >0 subgoals*)
wenzelm@9938
   242
         haz_netpair    : netpair,              (*nets for unsafe rules*)
wenzelm@9938
   243
         dup_netpair    : netpair,              (*nets for duplication*)
wenzelm@9938
   244
         xtra_netpair   : netpair};             (*nets for extra rules*)
clasohm@0
   245
lcp@1073
   246
(*Desired invariants are
wenzelm@9938
   247
        safe0_netpair = build safe0_brls,
wenzelm@9938
   248
        safep_netpair = build safep_brls,
wenzelm@9938
   249
        haz_netpair = build (joinrules(hazIs, hazEs)),
wenzelm@10736
   250
        dup_netpair = build (joinrules(map dup_intr hazIs,
wenzelm@9938
   251
                                       map dup_elim hazEs)),
wenzelm@9938
   252
        xtra_netpair = build (joinrules(xtraIs, xtraEs))}
lcp@1073
   253
wenzelm@10736
   254
where build = build_netpair(Net.empty,Net.empty),
lcp@1073
   255
      safe0_brls contains all brules that solve the subgoal, and
lcp@1073
   256
      safep_brls contains all brules that generate 1 or more new subgoals.
wenzelm@4079
   257
The theorem lists are largely comments, though they are used in merge_cs and print_cs.
lcp@1073
   258
Nets must be built incrementally, to save space and time.
lcp@1073
   259
*)
clasohm@0
   260
wenzelm@6502
   261
val empty_netpair = (Net.empty, Net.empty);
wenzelm@6502
   262
wenzelm@10736
   263
val empty_cs =
wenzelm@9938
   264
  CS{safeIs     = [],
wenzelm@9938
   265
     safeEs     = [],
wenzelm@9938
   266
     hazIs      = [],
wenzelm@9938
   267
     hazEs      = [],
wenzelm@9938
   268
     xtraIs     = [],
wenzelm@9938
   269
     xtraEs     = [],
oheimb@4651
   270
     swrappers  = [],
oheimb@4651
   271
     uwrappers  = [],
wenzelm@6502
   272
     safe0_netpair = empty_netpair,
wenzelm@6502
   273
     safep_netpair = empty_netpair,
wenzelm@6502
   274
     haz_netpair   = empty_netpair,
wenzelm@6955
   275
     dup_netpair   = empty_netpair,
wenzelm@6955
   276
     xtra_netpair  = empty_netpair};
clasohm@0
   277
wenzelm@6955
   278
fun print_cs (CS {safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, ...}) =
wenzelm@3546
   279
  let val pretty_thms = map Display.pretty_thm in
wenzelm@9760
   280
    [Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs),
wenzelm@9760
   281
      Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs),
wenzelm@9760
   282
      Pretty.big_list "extra introduction rules (intro?):" (pretty_thms xtraIs),
wenzelm@9760
   283
      Pretty.big_list "safe elimination rules (elim!):" (pretty_thms safeEs),
wenzelm@9760
   284
      Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs),
wenzelm@9760
   285
      Pretty.big_list "extra elimination rules (elim?):" (pretty_thms xtraEs)]
wenzelm@8727
   286
    |> Pretty.chunks |> Pretty.writeln
wenzelm@3546
   287
  end;
clasohm@0
   288
oheimb@4653
   289
fun rep_cs (CS args) = args;
lcp@1073
   290
wenzelm@10736
   291
local
oheimb@4651
   292
  fun calc_wrap l tac = foldr (fn ((name,tacf),w) => tacf w) (l, tac);
wenzelm@10736
   293
in
oheimb@4651
   294
  fun appSWrappers (CS{swrappers,...}) = calc_wrap swrappers;
oheimb@4651
   295
  fun appWrappers  (CS{uwrappers,...}) = calc_wrap uwrappers;
oheimb@4651
   296
end;
lcp@1073
   297
wenzelm@4079
   298
paulson@1800
   299
(*** Adding (un)safe introduction or elimination rules.
lcp@1073
   300
lcp@1073
   301
    In case of overlap, new rules are tried BEFORE old ones!!
paulson@1800
   302
***)
clasohm@0
   303
lcp@1073
   304
(*For use with biresolve_tac.  Combines intr rules with swap to handle negated
lcp@1073
   305
  assumptions.  Pairs elim rules with true. *)
wenzelm@10736
   306
fun joinrules (intrs,elims) =
lcp@1073
   307
    (map (pair true) (elims @ swapify intrs)  @
lcp@1073
   308
     map (pair false) intrs);
lcp@1073
   309
wenzelm@10736
   310
(*Priority: prefer rules with fewest subgoals,
paulson@1231
   311
  then rules added most recently (preferring the head of the list).*)
lcp@1073
   312
fun tag_brls k [] = []
lcp@1073
   313
  | tag_brls k (brl::brls) =
wenzelm@10736
   314
      (1000000*subgoals_of_brl brl + k, brl) ::
lcp@1073
   315
      tag_brls (k+1) brls;
lcp@1073
   316
wenzelm@10736
   317
fun recover_order k = k mod 1000000;
wenzelm@10736
   318
paulson@1800
   319
fun insert_tagged_list kbrls netpr = foldr insert_tagged_brl (kbrls, netpr);
lcp@1073
   320
lcp@1073
   321
(*Insert into netpair that already has nI intr rules and nE elim rules.
lcp@1073
   322
  Count the intr rules double (to account for swapify).  Negate to give the
lcp@1073
   323
  new insertions the lowest priority.*)
lcp@1073
   324
fun insert (nI,nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules;
lcp@1073
   325
paulson@1800
   326
fun delete_tagged_list brls netpr = foldr delete_tagged_brl (brls, netpr);
lcp@1073
   327
paulson@1800
   328
val delete = delete_tagged_list o joinrules;
paulson@1800
   329
paulson@2813
   330
val mem_thm = gen_mem eq_thm
paulson@2813
   331
and rem_thm = gen_rem eq_thm;
paulson@2813
   332
paulson@1927
   333
(*Warn if the rule is already present ELSEWHERE in the claset.  The addition
paulson@1927
   334
  is still allowed.*)
wenzelm@10736
   335
fun warn_dup th (CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, ...}) =
wenzelm@10736
   336
       if mem_thm (th, safeIs) then
wenzelm@9938
   337
         warning ("Rule already declared as safe introduction (intro!)\n" ^ string_of_thm th)
paulson@2813
   338
  else if mem_thm (th, safeEs) then
wenzelm@9408
   339
         warning ("Rule already declared as safe elimination (elim!)\n" ^ string_of_thm th)
wenzelm@10736
   340
  else if mem_thm (th, hazIs) then
wenzelm@9760
   341
         warning ("Rule already declared as introduction (intro)\n" ^ string_of_thm th)
wenzelm@10736
   342
  else if mem_thm (th, hazEs) then
wenzelm@9760
   343
         warning ("Rule already declared as elimination (elim)\n" ^ string_of_thm th)
wenzelm@10736
   344
  else if mem_thm (th, xtraIs) then
wenzelm@9408
   345
         warning ("Rule already declared as extra introduction (intro?)\n" ^ string_of_thm th)
wenzelm@10736
   346
  else if mem_thm (th, xtraEs) then
wenzelm@9408
   347
         warning ("Rule already declared as extra elimination (elim?)\n" ^ string_of_thm th)
paulson@1927
   348
  else ();
paulson@1927
   349
paulson@1800
   350
(*** Safe rules ***)
lcp@982
   351
wenzelm@10736
   352
fun addSI (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   353
              safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair},
wenzelm@9938
   354
           th)  =
wenzelm@10736
   355
  if mem_thm (th, safeIs) then
wenzelm@9938
   356
         (warning ("Ignoring duplicate safe introduction (intro!)\n" ^ string_of_thm th);
wenzelm@9938
   357
          cs)
paulson@1927
   358
  else
lcp@1073
   359
  let val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
wenzelm@7559
   360
          partition Thm.no_prems [th]
paulson@1927
   361
      val nI = length safeIs + 1
lcp@1073
   362
      and nE = length safeEs
paulson@1927
   363
  in warn_dup th cs;
wenzelm@9938
   364
     CS{safeIs  = th::safeIs,
lcp@1073
   365
        safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair,
wenzelm@9938
   366
        safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair,
wenzelm@9938
   367
        safeEs  = safeEs,
wenzelm@9938
   368
        hazIs   = hazIs,
wenzelm@9938
   369
        hazEs   = hazEs,
wenzelm@9938
   370
        xtraIs  = xtraIs,
wenzelm@9938
   371
        xtraEs  = xtraEs,
wenzelm@9938
   372
        swrappers    = swrappers,
wenzelm@9938
   373
        uwrappers    = uwrappers,
wenzelm@9938
   374
        haz_netpair  = haz_netpair,
wenzelm@9938
   375
        dup_netpair  = dup_netpair,
wenzelm@9938
   376
        xtra_netpair = xtra_netpair}
lcp@1073
   377
  end;
lcp@1073
   378
wenzelm@10736
   379
fun addSE (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   380
                    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair},
wenzelm@9938
   381
           th)  =
wenzelm@10736
   382
  if mem_thm (th, safeEs) then
wenzelm@9938
   383
         (warning ("Ignoring duplicate safe elimination (elim!)\n" ^ string_of_thm th);
wenzelm@9938
   384
          cs)
paulson@1927
   385
  else
lcp@1073
   386
  let val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
paulson@1927
   387
          partition (fn rl => nprems_of rl=1) [th]
lcp@1073
   388
      val nI = length safeIs
paulson@1927
   389
      and nE = length safeEs + 1
paulson@1927
   390
  in warn_dup th cs;
wenzelm@9938
   391
     CS{safeEs  = th::safeEs,
lcp@1073
   392
        safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair,
wenzelm@9938
   393
        safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair,
wenzelm@9938
   394
        safeIs  = safeIs,
wenzelm@9938
   395
        hazIs   = hazIs,
wenzelm@9938
   396
        hazEs   = hazEs,
wenzelm@9938
   397
        xtraIs  = xtraIs,
wenzelm@9938
   398
        xtraEs  = xtraEs,
wenzelm@9938
   399
        swrappers    = swrappers,
wenzelm@9938
   400
        uwrappers    = uwrappers,
wenzelm@9938
   401
        haz_netpair  = haz_netpair,
wenzelm@9938
   402
        dup_netpair  = dup_netpair,
wenzelm@9938
   403
        xtra_netpair = xtra_netpair}
lcp@1073
   404
  end;
clasohm@0
   405
paulson@1927
   406
fun rev_foldl f (e, l) = foldl f (e, rev l);
paulson@1927
   407
paulson@1927
   408
val op addSIs = rev_foldl addSI;
paulson@1927
   409
val op addSEs = rev_foldl addSE;
paulson@1927
   410
wenzelm@9938
   411
fun cs addSDs ths = cs addSEs (map Data.make_elim ths);
clasohm@0
   412
lcp@1073
   413
paulson@1800
   414
(*** Hazardous (unsafe) rules ***)
clasohm@0
   415
wenzelm@10736
   416
fun addI (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   417
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair},
wenzelm@9938
   418
          th)=
wenzelm@10736
   419
  if mem_thm (th, hazIs) then
wenzelm@9938
   420
         (warning ("Ignoring duplicate introduction (intro)\n" ^ string_of_thm th);
wenzelm@9938
   421
          cs)
paulson@1927
   422
  else
paulson@1927
   423
  let val nI = length hazIs + 1
lcp@1073
   424
      and nE = length hazEs
paulson@1927
   425
  in warn_dup th cs;
wenzelm@9938
   426
     CS{hazIs   = th::hazIs,
wenzelm@9938
   427
        haz_netpair = insert (nI,nE) ([th], []) haz_netpair,
wenzelm@9938
   428
        dup_netpair = insert (nI,nE) (map dup_intr [th], []) dup_netpair,
wenzelm@10736
   429
        safeIs  = safeIs,
wenzelm@9938
   430
        safeEs  = safeEs,
wenzelm@9938
   431
        hazEs   = hazEs,
wenzelm@9938
   432
        xtraIs  = xtraIs,
wenzelm@9938
   433
        xtraEs  = xtraEs,
wenzelm@9938
   434
        swrappers     = swrappers,
wenzelm@9938
   435
        uwrappers     = uwrappers,
wenzelm@9938
   436
        safe0_netpair = safe0_netpair,
wenzelm@9938
   437
        safep_netpair = safep_netpair,
wenzelm@9938
   438
        xtra_netpair = xtra_netpair}
lcp@1073
   439
  end;
lcp@1073
   440
wenzelm@10736
   441
fun addE (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   442
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair},
wenzelm@9938
   443
          th) =
wenzelm@10736
   444
  if mem_thm (th, hazEs) then
wenzelm@9938
   445
         (warning ("Ignoring duplicate elimination (elim)\n" ^ string_of_thm th);
wenzelm@9938
   446
          cs)
paulson@1927
   447
  else
wenzelm@10736
   448
  let val nI = length hazIs
paulson@1927
   449
      and nE = length hazEs + 1
paulson@1927
   450
  in warn_dup th cs;
wenzelm@9938
   451
     CS{hazEs   = th::hazEs,
wenzelm@9938
   452
        haz_netpair = insert (nI,nE) ([], [th]) haz_netpair,
wenzelm@9938
   453
        dup_netpair = insert (nI,nE) ([], map dup_elim [th]) dup_netpair,
wenzelm@10736
   454
        safeIs  = safeIs,
wenzelm@9938
   455
        safeEs  = safeEs,
wenzelm@9938
   456
        hazIs   = hazIs,
wenzelm@9938
   457
        xtraIs  = xtraIs,
wenzelm@9938
   458
        xtraEs  = xtraEs,
wenzelm@9938
   459
        swrappers     = swrappers,
wenzelm@9938
   460
        uwrappers     = uwrappers,
wenzelm@9938
   461
        safe0_netpair = safe0_netpair,
wenzelm@9938
   462
        safep_netpair = safep_netpair,
wenzelm@9938
   463
        xtra_netpair = xtra_netpair}
lcp@1073
   464
  end;
clasohm@0
   465
paulson@1927
   466
val op addIs = rev_foldl addI;
paulson@1927
   467
val op addEs = rev_foldl addE;
paulson@1927
   468
wenzelm@9938
   469
fun cs addDs ths = cs addEs (map Data.make_elim ths);
clasohm@0
   470
lcp@1073
   471
wenzelm@6955
   472
(*** Extra (single step) rules ***)
wenzelm@6955
   473
wenzelm@6955
   474
fun addXI (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   475
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair},
wenzelm@9938
   476
          th)=
wenzelm@10736
   477
  if mem_thm (th, xtraIs) then
wenzelm@9938
   478
         (warning ("Ignoring duplicate extra introduction (intro?)\n" ^ string_of_thm th);
wenzelm@9938
   479
          cs)
wenzelm@6955
   480
  else
wenzelm@6955
   481
  let val nI = length xtraIs + 1
wenzelm@6955
   482
      and nE = length xtraEs
wenzelm@6955
   483
  in warn_dup th cs;
wenzelm@9938
   484
     CS{xtraIs  = th::xtraIs,
wenzelm@9938
   485
        xtra_netpair = insert (nI,nE) ([th], []) xtra_netpair,
wenzelm@10736
   486
        safeIs  = safeIs,
wenzelm@9938
   487
        safeEs  = safeEs,
wenzelm@9938
   488
        hazIs   = hazIs,
wenzelm@9938
   489
        hazEs   = hazEs,
wenzelm@9938
   490
        xtraEs  = xtraEs,
wenzelm@9938
   491
        swrappers     = swrappers,
wenzelm@9938
   492
        uwrappers     = uwrappers,
wenzelm@9938
   493
        safe0_netpair = safe0_netpair,
wenzelm@9938
   494
        safep_netpair = safep_netpair,
wenzelm@9938
   495
        haz_netpair  = haz_netpair,
wenzelm@9938
   496
        dup_netpair  = dup_netpair}
wenzelm@6955
   497
  end;
wenzelm@6955
   498
wenzelm@10736
   499
fun addXE (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   500
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair},
wenzelm@9938
   501
          th) =
wenzelm@6955
   502
  if mem_thm (th, xtraEs) then
wenzelm@9938
   503
         (warning ("Ignoring duplicate extra elimination (elim?)\n" ^ string_of_thm th);
wenzelm@9938
   504
          cs)
wenzelm@6955
   505
  else
wenzelm@10736
   506
  let val nI = length xtraIs
wenzelm@6955
   507
      and nE = length xtraEs + 1
wenzelm@6955
   508
  in warn_dup th cs;
wenzelm@9938
   509
     CS{xtraEs  = th::xtraEs,
wenzelm@9938
   510
        xtra_netpair = insert (nI,nE) ([], [th]) xtra_netpair,
wenzelm@10736
   511
        safeIs  = safeIs,
wenzelm@9938
   512
        safeEs  = safeEs,
wenzelm@9938
   513
        hazIs   = hazIs,
wenzelm@9938
   514
        hazEs   = hazEs,
wenzelm@9938
   515
        xtraIs  = xtraIs,
wenzelm@9938
   516
        swrappers     = swrappers,
wenzelm@9938
   517
        uwrappers     = uwrappers,
wenzelm@9938
   518
        safe0_netpair = safe0_netpair,
wenzelm@9938
   519
        safep_netpair = safep_netpair,
wenzelm@9938
   520
        haz_netpair  = haz_netpair,
wenzelm@9938
   521
        dup_netpair  = dup_netpair}
wenzelm@6955
   522
  end;
wenzelm@6955
   523
wenzelm@6955
   524
val op addXIs = rev_foldl addXI;
wenzelm@6955
   525
val op addXEs = rev_foldl addXE;
wenzelm@6955
   526
wenzelm@9938
   527
fun cs addXDs ths = cs addXEs (map Data.make_elim ths);
wenzelm@6955
   528
wenzelm@6955
   529
wenzelm@10736
   530
(*** Deletion of rules
paulson@1800
   531
     Working out what to delete, requires repeating much of the code used
wenzelm@9938
   532
        to insert.
paulson@1927
   533
     Separate functions delSI, etc., are not exported; instead delrules
paulson@2813
   534
        searches in all the lists and chooses the relevant delXX functions.
paulson@1800
   535
***)
paulson@1800
   536
wenzelm@10736
   537
fun delSI th
wenzelm@6955
   538
          (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   539
                    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
paulson@2813
   540
 if mem_thm (th, safeIs) then
wenzelm@7559
   541
   let val (safe0_rls, safep_rls) = partition Thm.no_prems [th]
paulson@2813
   542
   in CS{safe0_netpair = delete (safe0_rls, []) safe0_netpair,
wenzelm@9938
   543
         safep_netpair = delete (safep_rls, []) safep_netpair,
wenzelm@9938
   544
         safeIs = rem_thm (safeIs,th),
wenzelm@9938
   545
         safeEs = safeEs,
wenzelm@9938
   546
         hazIs  = hazIs,
wenzelm@9938
   547
         hazEs  = hazEs,
wenzelm@9938
   548
         xtraIs = xtraIs,
wenzelm@9938
   549
         xtraEs = xtraEs,
wenzelm@9938
   550
         swrappers    = swrappers,
wenzelm@9938
   551
         uwrappers    = uwrappers,
wenzelm@9938
   552
         haz_netpair  = haz_netpair,
wenzelm@9938
   553
         dup_netpair  = dup_netpair,
wenzelm@9938
   554
         xtra_netpair = xtra_netpair}
paulson@2813
   555
   end
paulson@2813
   556
 else cs;
paulson@1800
   557
paulson@2813
   558
fun delSE th
wenzelm@10736
   559
          (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   560
                    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
paulson@2813
   561
 if mem_thm (th, safeEs) then
paulson@2813
   562
   let val (safe0_rls, safep_rls) = partition (fn rl => nprems_of rl=1) [th]
paulson@2813
   563
   in CS{safe0_netpair = delete ([], safe0_rls) safe0_netpair,
wenzelm@9938
   564
         safep_netpair = delete ([], safep_rls) safep_netpair,
wenzelm@9938
   565
         safeIs = safeIs,
wenzelm@9938
   566
         safeEs = rem_thm (safeEs,th),
wenzelm@9938
   567
         hazIs  = hazIs,
wenzelm@9938
   568
         hazEs  = hazEs,
wenzelm@9938
   569
         xtraIs = xtraIs,
wenzelm@9938
   570
         xtraEs = xtraEs,
wenzelm@9938
   571
         swrappers    = swrappers,
wenzelm@9938
   572
         uwrappers    = uwrappers,
wenzelm@9938
   573
         haz_netpair  = haz_netpair,
wenzelm@9938
   574
         dup_netpair  = dup_netpair,
wenzelm@9938
   575
         xtra_netpair = xtra_netpair}
paulson@2813
   576
   end
paulson@2813
   577
 else cs;
paulson@1800
   578
paulson@1800
   579
paulson@2813
   580
fun delI th
wenzelm@10736
   581
         (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   582
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
paulson@2813
   583
 if mem_thm (th, hazIs) then
paulson@2813
   584
     CS{haz_netpair = delete ([th], []) haz_netpair,
wenzelm@9938
   585
        dup_netpair = delete ([dup_intr th], []) dup_netpair,
wenzelm@10736
   586
        safeIs  = safeIs,
wenzelm@9938
   587
        safeEs  = safeEs,
wenzelm@9938
   588
        hazIs   = rem_thm (hazIs,th),
wenzelm@9938
   589
        hazEs   = hazEs,
wenzelm@9938
   590
        xtraIs  = xtraIs,
wenzelm@9938
   591
        xtraEs  = xtraEs,
wenzelm@9938
   592
        swrappers     = swrappers,
wenzelm@9938
   593
        uwrappers     = uwrappers,
wenzelm@9938
   594
        safe0_netpair = safe0_netpair,
wenzelm@9938
   595
        safep_netpair = safep_netpair,
wenzelm@9938
   596
        xtra_netpair = xtra_netpair}
paulson@2813
   597
 else cs;
paulson@1800
   598
paulson@2813
   599
fun delE th
wenzelm@10736
   600
         (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   601
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
paulson@2813
   602
 if mem_thm (th, hazEs) then
paulson@2813
   603
     CS{haz_netpair = delete ([], [th]) haz_netpair,
wenzelm@9938
   604
        dup_netpair = delete ([], [dup_elim th]) dup_netpair,
wenzelm@10736
   605
        safeIs  = safeIs,
wenzelm@9938
   606
        safeEs  = safeEs,
wenzelm@9938
   607
        hazIs   = hazIs,
wenzelm@9938
   608
        hazEs   = rem_thm (hazEs,th),
wenzelm@9938
   609
        xtraIs  = xtraIs,
wenzelm@9938
   610
        xtraEs  = xtraEs,
wenzelm@9938
   611
        swrappers     = swrappers,
wenzelm@9938
   612
        uwrappers     = uwrappers,
wenzelm@9938
   613
        safe0_netpair = safe0_netpair,
wenzelm@9938
   614
        safep_netpair = safep_netpair,
wenzelm@9938
   615
        xtra_netpair = xtra_netpair}
wenzelm@6955
   616
 else cs;
wenzelm@6955
   617
wenzelm@6955
   618
wenzelm@6955
   619
fun delXI th
wenzelm@10736
   620
         (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   621
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@6955
   622
 if mem_thm (th, xtraIs) then
wenzelm@6955
   623
     CS{xtra_netpair = delete ([th], []) xtra_netpair,
wenzelm@10736
   624
        safeIs  = safeIs,
wenzelm@9938
   625
        safeEs  = safeEs,
wenzelm@9938
   626
        hazIs   = hazIs,
wenzelm@9938
   627
        hazEs   = hazEs,
wenzelm@9938
   628
        xtraIs  = rem_thm (xtraIs,th),
wenzelm@9938
   629
        xtraEs  = xtraEs,
wenzelm@9938
   630
        swrappers     = swrappers,
wenzelm@9938
   631
        uwrappers     = uwrappers,
wenzelm@9938
   632
        safe0_netpair = safe0_netpair,
wenzelm@9938
   633
        safep_netpair = safep_netpair,
wenzelm@9938
   634
        haz_netpair  = haz_netpair,
wenzelm@9938
   635
        dup_netpair  = dup_netpair}
wenzelm@6955
   636
 else cs;
wenzelm@6955
   637
wenzelm@6955
   638
fun delXE th
wenzelm@10736
   639
         (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@9938
   640
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@6955
   641
 if mem_thm (th, xtraEs) then
wenzelm@6955
   642
     CS{xtra_netpair = delete ([], [th]) xtra_netpair,
wenzelm@10736
   643
        safeIs  = safeIs,
wenzelm@9938
   644
        safeEs  = safeEs,
wenzelm@9938
   645
        hazIs   = hazIs,
wenzelm@9938
   646
        hazEs   = hazEs,
wenzelm@9938
   647
        xtraIs  = xtraIs,
wenzelm@9938
   648
        xtraEs  = rem_thm (xtraEs,th),
wenzelm@9938
   649
        swrappers     = swrappers,
wenzelm@9938
   650
        uwrappers     = uwrappers,
wenzelm@9938
   651
        safe0_netpair = safe0_netpair,
wenzelm@9938
   652
        safep_netpair = safep_netpair,
wenzelm@9938
   653
        haz_netpair  = haz_netpair,
wenzelm@9938
   654
        dup_netpair  = dup_netpair}
paulson@2813
   655
 else cs;
paulson@1800
   656
paulson@2813
   657
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*)
wenzelm@6955
   658
fun delrule (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, ...}, th) =
wenzelm@9938
   659
  let val th' = Data.make_elim th in
wenzelm@9938
   660
    if mem_thm (th, safeIs) orelse mem_thm (th, safeEs) orelse
wenzelm@9938
   661
      mem_thm (th, hazIs)  orelse mem_thm (th, hazEs) orelse
wenzelm@9938
   662
      mem_thm (th, xtraIs)  orelse mem_thm (th, xtraEs) orelse
wenzelm@9938
   663
      mem_thm (th', safeEs) orelse mem_thm (th', hazEs) orelse mem_thm (th', xtraEs)
wenzelm@9938
   664
    then delSI th (delSE th (delI th (delE th (delXI th (delXE th
wenzelm@9938
   665
      (delSE th' (delE th' (delXE th' cs))))))))
wenzelm@9938
   666
    else (warning ("Undeclared classical rule\n" ^ (string_of_thm th)); cs)
wenzelm@9938
   667
  end;
paulson@1800
   668
paulson@1800
   669
val op delrules = foldl delrule;
paulson@1800
   670
paulson@1800
   671
oheimb@4767
   672
(*** Modifying the wrapper tacticals ***)
wenzelm@10736
   673
fun update_swrappers
wenzelm@10736
   674
(CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@6955
   675
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) f =
oheimb@4767
   676
 CS{safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
wenzelm@6955
   677
    xtraIs = xtraIs, xtraEs = xtraEs,
oheimb@4767
   678
    swrappers = f swrappers, uwrappers = uwrappers,
oheimb@4767
   679
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
wenzelm@6955
   680
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
oheimb@4767
   681
wenzelm@10736
   682
fun update_uwrappers
wenzelm@10736
   683
(CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, swrappers, uwrappers,
wenzelm@6955
   684
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) f =
oheimb@4767
   685
 CS{safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
wenzelm@6955
   686
    xtraIs = xtraIs, xtraEs = xtraEs,
oheimb@4767
   687
    swrappers = swrappers, uwrappers = f uwrappers,
oheimb@4767
   688
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
wenzelm@6955
   689
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
oheimb@4767
   690
lcp@982
   691
oheimb@4651
   692
(*Add/replace a safe wrapper*)
oheimb@4767
   693
fun cs addSWrapper new_swrapper = update_swrappers cs (fn swrappers =>
nipkow@9721
   694
    overwrite_warn (swrappers, new_swrapper)
nipkow@9721
   695
       ("Overwriting safe wrapper " ^ fst new_swrapper));
oheimb@4651
   696
oheimb@4651
   697
(*Add/replace an unsafe wrapper*)
oheimb@4767
   698
fun cs addWrapper new_uwrapper = update_uwrappers cs (fn uwrappers =>
nipkow@9721
   699
    overwrite_warn (uwrappers, new_uwrapper)
wenzelm@9938
   700
        ("Overwriting unsafe wrapper "^fst new_uwrapper));
lcp@982
   701
oheimb@4651
   702
(*Remove a safe wrapper*)
oheimb@4767
   703
fun cs delSWrapper name = update_swrappers cs (fn swrappers =>
oheimb@4767
   704
    let val (del,rest) = partition (fn (n,_) => n=name) swrappers
wenzelm@10736
   705
    in if null del then (warning ("No such safe wrapper in claset: "^ name);
wenzelm@9938
   706
                         swrappers) else rest end);
lcp@982
   707
oheimb@4651
   708
(*Remove an unsafe wrapper*)
oheimb@4767
   709
fun cs delWrapper name = update_uwrappers cs (fn uwrappers =>
oheimb@4767
   710
    let val (del,rest) = partition (fn (n,_) => n=name) uwrappers
oheimb@4767
   711
    in if null del then (warning ("No such unsafe wrapper in claset: " ^ name);
oheimb@4767
   712
                         uwrappers) else rest end);
lcp@982
   713
oheimb@11168
   714
(* compose a safe tactic alternatively before/after safe_step_tac *)
wenzelm@10736
   715
fun cs addSbefore  (name,    tac1) =
oheimb@5523
   716
    cs addSWrapper (name, fn tac2 => tac1 ORELSE' tac2);
oheimb@11181
   717
fun cs addSafter   (name,    tac2) =
oheimb@5523
   718
    cs addSWrapper (name, fn tac1 => tac1 ORELSE' tac2);
lcp@982
   719
oheimb@11168
   720
(*compose a tactic alternatively before/after the step tactic *)
wenzelm@10736
   721
fun cs addbefore   (name,    tac1) =
oheimb@5523
   722
    cs addWrapper  (name, fn tac2 => tac1 APPEND' tac2);
oheimb@11181
   723
fun cs addafter    (name,    tac2) =
oheimb@5523
   724
    cs addWrapper  (name, fn tac1 => tac1 APPEND' tac2);
oheimb@4767
   725
wenzelm@10736
   726
fun cs addD2     (name, thm) =
oheimb@11181
   727
    cs addafter  (name, datac thm 1);
wenzelm@10736
   728
fun cs addE2     (name, thm) =
oheimb@11181
   729
    cs addafter  (name, eatac thm 1);
oheimb@11181
   730
fun cs addSD2    (name, thm) =
oheimb@11181
   731
    cs addSafter (name, dmatch_tac [thm] THEN' eq_assume_tac);
oheimb@11181
   732
fun cs addSE2    (name, thm) =
oheimb@11181
   733
    cs addSafter (name, ematch_tac [thm] THEN' eq_assume_tac);
lcp@982
   734
paulson@1711
   735
(*Merge works by adding all new rules of the 2nd claset into the 1st claset.
paulson@1711
   736
  Merging the term nets may look more efficient, but the rather delicate
paulson@1711
   737
  treatment of priority might get muddled up.*)
paulson@1711
   738
fun merge_cs
wenzelm@6955
   739
    (cs as CS{safeIs, safeEs, hazIs, hazEs, xtraIs, xtraEs, ...},
oheimb@4765
   740
     CS{safeIs=safeIs2, safeEs=safeEs2, hazIs=hazIs2, hazEs=hazEs2,
wenzelm@9938
   741
        xtraIs=xtraIs2, xtraEs=xtraEs2, swrappers, uwrappers, ...}) =
paulson@1711
   742
  let val safeIs' = gen_rems eq_thm (safeIs2,safeIs)
paulson@1711
   743
      val safeEs' = gen_rems eq_thm (safeEs2,safeEs)
oheimb@2630
   744
      val  hazIs' = gen_rems eq_thm ( hazIs2, hazIs)
oheimb@2630
   745
      val  hazEs' = gen_rems eq_thm ( hazEs2, hazEs)
wenzelm@6955
   746
      val xtraIs' = gen_rems eq_thm (xtraIs2, xtraIs)
wenzelm@6955
   747
      val xtraEs' = gen_rems eq_thm (xtraEs2, xtraEs)
oheimb@4767
   748
      val cs1   = cs addSIs safeIs'
wenzelm@9938
   749
                     addSEs safeEs'
wenzelm@9938
   750
                     addIs  hazIs'
wenzelm@9938
   751
                     addEs  hazEs'
wenzelm@9938
   752
                     addXIs xtraIs'
wenzelm@9938
   753
                     addXEs xtraEs'
oheimb@4767
   754
      val cs2 = update_swrappers cs1 (fn ws => merge_alists ws swrappers);
oheimb@4767
   755
      val cs3 = update_uwrappers cs2 (fn ws => merge_alists ws uwrappers);
wenzelm@10736
   756
  in cs3
paulson@1711
   757
  end;
paulson@1711
   758
lcp@982
   759
paulson@1800
   760
(**** Simple tactics for theorem proving ****)
clasohm@0
   761
clasohm@0
   762
(*Attack subgoals using safe inferences -- matching, not resolution*)
wenzelm@10736
   763
fun safe_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) =
oheimb@4651
   764
  appSWrappers cs (FIRST' [
wenzelm@9938
   765
        eq_assume_tac,
wenzelm@9938
   766
        eq_mp_tac,
wenzelm@9938
   767
        bimatch_from_nets_tac safe0_netpair,
wenzelm@9938
   768
        FIRST' hyp_subst_tacs,
wenzelm@9938
   769
        bimatch_from_nets_tac safep_netpair]);
clasohm@0
   770
oheimb@5757
   771
(*Repeatedly attack a subgoal using safe inferences -- it's deterministic!*)
wenzelm@10736
   772
fun safe_steps_tac cs = REPEAT_DETERM1 o
wenzelm@9938
   773
        (fn i => COND (has_fewer_prems i) no_tac (safe_step_tac cs i));
oheimb@5757
   774
clasohm@0
   775
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*)
oheimb@5757
   776
fun safe_tac cs = REPEAT_DETERM1 (FIRSTGOAL (safe_steps_tac cs));
lcp@747
   777
paulson@3705
   778
paulson@3705
   779
(*** Clarify_tac: do safe steps without causing branching ***)
paulson@3705
   780
paulson@3705
   781
fun nsubgoalsP n (k,brl) = (subgoals_of_brl brl = n);
paulson@3705
   782
paulson@3705
   783
(*version of bimatch_from_nets_tac that only applies rules that
paulson@3705
   784
  create precisely n subgoals.*)
wenzelm@10736
   785
fun n_bimatch_from_nets_tac n =
paulson@3705
   786
    biresolution_from_nets_tac (orderlist o filter (nsubgoalsP n)) true;
paulson@3705
   787
paulson@3705
   788
fun eq_contr_tac i = ematch_tac [not_elim] i  THEN  eq_assume_tac i;
paulson@3705
   789
val eq_assume_contr_tac = eq_assume_tac ORELSE' eq_contr_tac;
paulson@3705
   790
paulson@3705
   791
(*Two-way branching is allowed only if one of the branches immediately closes*)
paulson@3705
   792
fun bimatch2_tac netpair i =
paulson@3705
   793
    n_bimatch_from_nets_tac 2 netpair i THEN
paulson@3705
   794
    (eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i+1));
paulson@3705
   795
paulson@3705
   796
(*Attack subgoals using safe inferences -- matching, not resolution*)
wenzelm@10736
   797
fun clarify_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) =
oheimb@4651
   798
  appSWrappers cs (FIRST' [
wenzelm@9938
   799
        eq_assume_contr_tac,
wenzelm@9938
   800
        bimatch_from_nets_tac safe0_netpair,
wenzelm@9938
   801
        FIRST' hyp_subst_tacs,
wenzelm@9938
   802
        n_bimatch_from_nets_tac 1 safep_netpair,
paulson@3705
   803
        bimatch2_tac safep_netpair]);
paulson@3705
   804
paulson@3705
   805
fun clarify_tac cs = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac cs 1));
paulson@3705
   806
paulson@3705
   807
paulson@3705
   808
(*** Unsafe steps instantiate variables or lose information ***)
paulson@3705
   809
paulson@4066
   810
(*Backtracking is allowed among the various these unsafe ways of
paulson@4066
   811
  proving a subgoal.  *)
lcp@747
   812
fun inst0_step_tac (CS{safe0_netpair,safep_netpair,...}) =
wenzelm@10736
   813
  assume_tac                      APPEND'
wenzelm@10736
   814
  contr_tac                       APPEND'
lcp@747
   815
  biresolve_from_nets_tac safe0_netpair;
lcp@747
   816
paulson@4066
   817
(*These unsafe steps could generate more subgoals.*)
lcp@747
   818
fun instp_step_tac (CS{safep_netpair,...}) =
lcp@747
   819
  biresolve_from_nets_tac safep_netpair;
clasohm@0
   820
clasohm@0
   821
(*These steps could instantiate variables and are therefore unsafe.*)
lcp@747
   822
fun inst_step_tac cs = inst0_step_tac cs APPEND' instp_step_tac cs;
clasohm@0
   823
wenzelm@10736
   824
fun haz_step_tac (CS{haz_netpair,...}) =
lcp@681
   825
  biresolve_from_nets_tac haz_netpair;
lcp@681
   826
clasohm@0
   827
(*Single step for the prover.  FAILS unless it makes progress. *)
wenzelm@10736
   828
fun step_tac cs i = safe_tac cs ORELSE appWrappers cs
wenzelm@9938
   829
        (inst_step_tac cs ORELSE' haz_step_tac cs) i;
clasohm@0
   830
clasohm@0
   831
(*Using a "safe" rule to instantiate variables is unsafe.  This tactic
clasohm@0
   832
  allows backtracking from "safe" rules to "unsafe" rules here.*)
wenzelm@10736
   833
fun slow_step_tac cs i = safe_tac cs ORELSE appWrappers cs
wenzelm@9938
   834
        (inst_step_tac cs APPEND' haz_step_tac cs) i;
clasohm@0
   835
paulson@1800
   836
(**** The following tactics all fail unless they solve one goal ****)
clasohm@0
   837
clasohm@0
   838
(*Dumb but fast*)
wenzelm@10382
   839
fun fast_tac cs =
wenzelm@10382
   840
  atomize_tac THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac cs 1));
clasohm@0
   841
clasohm@0
   842
(*Slower but smarter than fast_tac*)
wenzelm@10382
   843
fun best_tac cs =
wenzelm@10382
   844
  atomize_tac THEN'
clasohm@0
   845
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (step_tac cs 1));
clasohm@0
   846
oheimb@9402
   847
(*even a bit smarter than best_tac*)
wenzelm@10382
   848
fun first_best_tac cs =
wenzelm@10382
   849
  atomize_tac THEN'
oheimb@9402
   850
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (FIRSTGOAL (step_tac cs)));
oheimb@9402
   851
wenzelm@10382
   852
fun slow_tac cs =
wenzelm@10382
   853
  atomize_tac THEN'
wenzelm@10382
   854
  SELECT_GOAL (DEPTH_SOLVE (slow_step_tac cs 1));
clasohm@0
   855
wenzelm@10382
   856
fun slow_best_tac cs =
wenzelm@10382
   857
  atomize_tac THEN'
clasohm@0
   858
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (slow_step_tac cs 1));
clasohm@0
   859
lcp@681
   860
wenzelm@10736
   861
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*)
wenzelm@10736
   862
val weight_ASTAR = ref 5;
paulson@1587
   863
wenzelm@10382
   864
fun astar_tac cs =
wenzelm@10736
   865
  atomize_tac THEN'
wenzelm@10382
   866
  SELECT_GOAL
wenzelm@10382
   867
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev)
wenzelm@10382
   868
      (step_tac cs 1));
paulson@1587
   869
wenzelm@10736
   870
fun slow_astar_tac cs =
wenzelm@10736
   871
  atomize_tac THEN'
wenzelm@10382
   872
  SELECT_GOAL
wenzelm@10382
   873
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev)
wenzelm@10382
   874
      (slow_step_tac cs 1));
paulson@1587
   875
paulson@1800
   876
(**** Complete tactic, loosely based upon LeanTaP.  This tactic is the outcome
lcp@747
   877
  of much experimentation!  Changing APPEND to ORELSE below would prove
lcp@747
   878
  easy theorems faster, but loses completeness -- and many of the harder
paulson@1800
   879
  theorems such as 43. ****)
lcp@681
   880
lcp@747
   881
(*Non-deterministic!  Could always expand the first unsafe connective.
lcp@747
   882
  That's hard to implement and did not perform better in experiments, due to
lcp@747
   883
  greater search depth required.*)
wenzelm@10736
   884
fun dup_step_tac (cs as (CS{dup_netpair,...})) =
lcp@681
   885
  biresolve_from_nets_tac dup_netpair;
lcp@681
   886
oheimb@5523
   887
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*)
oheimb@5757
   888
local
wenzelm@10736
   889
fun slow_step_tac' cs = appWrappers cs
wenzelm@9938
   890
        (instp_step_tac cs APPEND' dup_step_tac cs);
wenzelm@10736
   891
in fun depth_tac cs m i state = SELECT_GOAL
wenzelm@10736
   892
   (safe_steps_tac cs 1 THEN_ELSE
wenzelm@9938
   893
        (DEPTH_SOLVE (depth_tac cs m 1),
wenzelm@9938
   894
         inst0_step_tac cs 1 APPEND COND (K (m=0)) no_tac
wenzelm@9938
   895
                (slow_step_tac' cs 1 THEN DEPTH_SOLVE (depth_tac cs (m-1) 1))
oheimb@5757
   896
        )) i state;
oheimb@5757
   897
end;
lcp@747
   898
wenzelm@10736
   899
(*Search, with depth bound m.
paulson@2173
   900
  This is the "entry point", which does safe inferences first.*)
wenzelm@10736
   901
fun safe_depth_tac cs m =
wenzelm@10736
   902
  SUBGOAL
lcp@681
   903
    (fn (prem,i) =>
lcp@681
   904
      let val deti =
wenzelm@9938
   905
          (*No Vars in the goal?  No need to backtrack between goals.*)
wenzelm@9938
   906
          case term_vars prem of
wenzelm@10736
   907
              []        => DETERM
wenzelm@9938
   908
            | _::_      => I
wenzelm@10736
   909
      in  SELECT_GOAL (TRY (safe_tac cs) THEN
wenzelm@9938
   910
                       DEPTH_SOLVE (deti (depth_tac cs m 1))) i
lcp@747
   911
      end);
lcp@681
   912
paulson@2868
   913
fun deepen_tac cs = DEEPEN (2,10) (safe_depth_tac cs);
lcp@681
   914
wenzelm@4079
   915
berghofe@1724
   916
wenzelm@4079
   917
(** claset theory data **)
wenzelm@4079
   918
wenzelm@7354
   919
(* theory data kind 'Provers/claset' *)
berghofe@1724
   920
wenzelm@7354
   921
structure GlobalClasetArgs =
wenzelm@7354
   922
struct
wenzelm@7354
   923
  val name = "Provers/claset";
wenzelm@7354
   924
  type T = claset ref;
wenzelm@4079
   925
wenzelm@7354
   926
  val empty = ref empty_cs;
wenzelm@7354
   927
  fun copy (ref cs) = (ref cs): T;            (*create new reference!*)
wenzelm@6556
   928
  val prep_ext = copy;
wenzelm@7354
   929
  fun merge (ref cs1, ref cs2) = ref (merge_cs (cs1, cs2));
wenzelm@7354
   930
  fun print _ (ref cs) = print_cs cs;
wenzelm@7354
   931
end;
berghofe@1724
   932
wenzelm@7354
   933
structure GlobalClaset = TheoryDataFun(GlobalClasetArgs);
wenzelm@7354
   934
val print_claset = GlobalClaset.print;
wenzelm@7354
   935
val claset_ref_of_sg = GlobalClaset.get_sg;
wenzelm@7354
   936
val claset_ref_of = GlobalClaset.get;
wenzelm@4079
   937
berghofe@1724
   938
wenzelm@4079
   939
(* access claset *)
berghofe@1724
   940
wenzelm@4079
   941
val claset_of_sg = ! o claset_ref_of_sg;
wenzelm@6391
   942
val claset_of = claset_of_sg o Theory.sign_of;
paulson@1800
   943
wenzelm@6391
   944
fun CLASET tacf state = tacf (claset_of_sg (Thm.sign_of_thm state)) state;
wenzelm@6391
   945
fun CLASET' tacf i state = tacf (claset_of_sg (Thm.sign_of_thm state)) i state;
paulson@3705
   946
wenzelm@5028
   947
val claset = claset_of o Context.the_context;
wenzelm@6391
   948
val claset_ref = claset_ref_of_sg o Theory.sign_of o Context.the_context;
wenzelm@4079
   949
paulson@3705
   950
wenzelm@4079
   951
(* change claset *)
paulson@1800
   952
wenzelm@4079
   953
fun change_claset f x = claset_ref () := (f (claset (), x));
berghofe@1724
   954
wenzelm@4079
   955
val AddDs = change_claset (op addDs);
wenzelm@4079
   956
val AddEs = change_claset (op addEs);
wenzelm@4079
   957
val AddIs = change_claset (op addIs);
wenzelm@4079
   958
val AddSDs = change_claset (op addSDs);
wenzelm@4079
   959
val AddSEs = change_claset (op addSEs);
wenzelm@4079
   960
val AddSIs = change_claset (op addSIs);
wenzelm@6955
   961
val AddXDs = change_claset (op addXDs);
wenzelm@6955
   962
val AddXEs = change_claset (op addXEs);
wenzelm@6955
   963
val AddXIs = change_claset (op addXIs);
wenzelm@4079
   964
val Delrules = change_claset (op delrules);
paulson@3727
   965
wenzelm@4079
   966
wenzelm@5841
   967
(* proof data kind 'Provers/claset' *)
wenzelm@5841
   968
wenzelm@5841
   969
structure LocalClasetArgs =
wenzelm@5841
   970
struct
wenzelm@5841
   971
  val name = "Provers/claset";
wenzelm@5841
   972
  type T = claset;
wenzelm@5841
   973
  val init = claset_of;
wenzelm@5841
   974
  fun print _ cs = print_cs cs;
wenzelm@5841
   975
end;
wenzelm@5841
   976
wenzelm@5841
   977
structure LocalClaset = ProofDataFun(LocalClasetArgs);
wenzelm@5841
   978
val print_local_claset = LocalClaset.print;
wenzelm@5841
   979
val get_local_claset = LocalClaset.get;
wenzelm@5841
   980
val put_local_claset = LocalClaset.put;
wenzelm@5841
   981
wenzelm@5841
   982
wenzelm@5885
   983
(* attributes *)
wenzelm@5885
   984
wenzelm@5885
   985
fun change_global_cs f (thy, th) =
wenzelm@5885
   986
  let val r = claset_ref_of thy
wenzelm@6096
   987
  in r := f (! r, [th]); (thy, th) end;
wenzelm@5885
   988
wenzelm@5885
   989
fun change_local_cs f (ctxt, th) =
wenzelm@6096
   990
  let val cs = f (get_local_claset ctxt, [th])
wenzelm@5885
   991
  in (put_local_claset cs ctxt, th) end;
wenzelm@5885
   992
wenzelm@5885
   993
val safe_dest_global = change_global_cs (op addSDs);
wenzelm@5885
   994
val safe_elim_global = change_global_cs (op addSEs);
wenzelm@5885
   995
val safe_intro_global = change_global_cs (op addSIs);
wenzelm@6955
   996
val haz_dest_global = change_global_cs (op addDs);
wenzelm@6955
   997
val haz_elim_global = change_global_cs (op addEs);
wenzelm@6955
   998
val haz_intro_global = change_global_cs (op addIs);
wenzelm@6955
   999
val xtra_dest_global = change_global_cs (op addXDs);
wenzelm@6955
  1000
val xtra_elim_global = change_global_cs (op addXEs);
wenzelm@6955
  1001
val xtra_intro_global = change_global_cs (op addXIs);
wenzelm@9938
  1002
val rule_del_global = change_global_cs (op delrules);
wenzelm@5885
  1003
wenzelm@6955
  1004
val safe_dest_local = change_local_cs (op addSDs);
wenzelm@6955
  1005
val safe_elim_local = change_local_cs (op addSEs);
wenzelm@6955
  1006
val safe_intro_local = change_local_cs (op addSIs);
wenzelm@5885
  1007
val haz_dest_local = change_local_cs (op addDs);
wenzelm@5885
  1008
val haz_elim_local = change_local_cs (op addEs);
wenzelm@5885
  1009
val haz_intro_local = change_local_cs (op addIs);
wenzelm@6955
  1010
val xtra_dest_local = change_local_cs (op addXDs);
wenzelm@6955
  1011
val xtra_elim_local = change_local_cs (op addXEs);
wenzelm@6955
  1012
val xtra_intro_local = change_local_cs (op addXIs);
wenzelm@9938
  1013
val rule_del_local = change_local_cs (op delrules);
wenzelm@5885
  1014
wenzelm@5885
  1015
wenzelm@4079
  1016
(* tactics referring to the implicit claset *)
paulson@1800
  1017
wenzelm@4079
  1018
(*the abstraction over the proof state delays the dereferencing*)
wenzelm@9938
  1019
fun Safe_tac st           = safe_tac (claset()) st;
wenzelm@9938
  1020
fun Safe_step_tac i st    = safe_step_tac (claset()) i st;
wenzelm@4079
  1021
fun Clarify_step_tac i st = clarify_step_tac (claset()) i st;
wenzelm@9938
  1022
fun Clarify_tac i st      = clarify_tac (claset()) i st;
wenzelm@9938
  1023
fun Step_tac i st         = step_tac (claset()) i st;
wenzelm@9938
  1024
fun Fast_tac i st         = fast_tac (claset()) i st;
wenzelm@9938
  1025
fun Best_tac i st         = best_tac (claset()) i st;
wenzelm@9938
  1026
fun Slow_tac i st         = slow_tac (claset()) i st;
wenzelm@9938
  1027
fun Slow_best_tac i st    = slow_best_tac (claset()) i st;
wenzelm@9938
  1028
fun Deepen_tac m          = deepen_tac (claset()) m;
paulson@2066
  1029
paulson@1800
  1030
wenzelm@10736
  1031
end;
wenzelm@5841
  1032
wenzelm@5841
  1033
wenzelm@5841
  1034
wenzelm@5885
  1035
(** concrete syntax of attributes **)
wenzelm@5841
  1036
wenzelm@5841
  1037
(* add / del rules *)
wenzelm@5841
  1038
wenzelm@5841
  1039
val introN = "intro";
wenzelm@5841
  1040
val elimN = "elim";
wenzelm@5841
  1041
val destN = "dest";
wenzelm@9938
  1042
val ruleN = "rule";
wenzelm@5841
  1043
wenzelm@6955
  1044
fun cla_att change xtra haz safe = Attrib.syntax
wenzelm@10034
  1045
  (Scan.lift ((Args.query >> K xtra || Args.bang >> K safe || Scan.succeed haz) >> change));
wenzelm@5841
  1046
wenzelm@6955
  1047
fun cla_attr f g h = (cla_att change_global_cs f g h, cla_att change_local_cs f g h);
wenzelm@9938
  1048
wenzelm@10034
  1049
fun del_args att = Attrib.syntax (Scan.lift Args.del >> K att);
wenzelm@9938
  1050
val rule_del_attr = (del_args rule_del_global, del_args rule_del_local);
wenzelm@5841
  1051
wenzelm@5841
  1052
wenzelm@5841
  1053
(* setup_attrs *)
wenzelm@5841
  1054
wenzelm@9941
  1055
fun elim_format x = Attrib.no_args (Drule.rule_attribute (K Data.make_elim)) x;
wenzelm@9184
  1056
wenzelm@5841
  1057
val setup_attrs = Attrib.add_attributes
wenzelm@9941
  1058
 [("elim_format", (elim_format, elim_format),
wenzelm@9941
  1059
    "destruct rule turned into elimination rule format (classical)"),
wenzelm@9899
  1060
  (destN, cla_attr (op addXDs) (op addDs) (op addSDs), "declaration of destruction rule"),
wenzelm@9899
  1061
  (elimN, cla_attr (op addXEs) (op addEs) (op addSEs), "declaration of elimination rule"),
wenzelm@9899
  1062
  (introN, cla_attr (op addXIs) (op addIs) (op addSIs), "declaration of introduction rule"),
wenzelm@9938
  1063
  (ruleN, rule_del_attr, "remove declaration of intro/elim/dest rule")];
wenzelm@5841
  1064
wenzelm@5841
  1065
wenzelm@5841
  1066
wenzelm@7230
  1067
(** proof methods **)
wenzelm@7230
  1068
wenzelm@7230
  1069
(* get nets (appropriate order for semi-automatic methods) *)
wenzelm@7230
  1070
wenzelm@7230
  1071
local
wenzelm@7230
  1072
  val not_elim_netpair = insert (0, 0) ([], [Data.not_elim]) empty_netpair;
wenzelm@7230
  1073
in
wenzelm@7230
  1074
  fun get_nets (CS {safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair, ...}) =
wenzelm@11723
  1075
    [safe0_netpair, safep_netpair, not_elim_netpair, haz_netpair, dup_netpair, xtra_netpair];
wenzelm@7230
  1076
end;
wenzelm@7230
  1077
wenzelm@7230
  1078
wenzelm@7230
  1079
(* METHOD_CLASET' *)
wenzelm@5841
  1080
wenzelm@8098
  1081
fun METHOD_CLASET' tac ctxt =
wenzelm@10394
  1082
  Method.METHOD (HEADGOAL o tac ctxt (get_local_claset ctxt));
wenzelm@7230
  1083
wenzelm@7230
  1084
wenzelm@7230
  1085
local
wenzelm@7230
  1086
wenzelm@10736
  1087
fun order_rules xs = map snd (Tactic.orderlist (map (apfst recover_order) xs));
wenzelm@5841
  1088
wenzelm@5841
  1089
fun find_erules [] _ = []
wenzelm@6955
  1090
  | find_erules (fact :: _) nets =
wenzelm@5841
  1091
      let
wenzelm@6502
  1092
        fun may_unify net = Net.unify_term net o Logic.strip_assums_concl o #prop o Thm.rep_thm;
wenzelm@6955
  1093
        fun erules_of (_, enet) = order_rules (may_unify enet fact);
wenzelm@6502
  1094
      in flat (map erules_of nets) end;
wenzelm@5841
  1095
wenzelm@11723
  1096
fun find_rules concl nets =
wenzelm@11723
  1097
  let fun rules_of (inet, _) = order_rules (Net.unify_term inet concl)
wenzelm@11723
  1098
  in flat (map rules_of nets) end;
wenzelm@11723
  1099
wenzelm@7230
  1100
fun some_rule_tac cs facts =
wenzelm@5841
  1101
  let
wenzelm@7230
  1102
    val nets = get_nets cs;
wenzelm@6492
  1103
    val erules = find_erules facts nets;
wenzelm@5841
  1104
wenzelm@5841
  1105
    val tac = SUBGOAL (fn (goal, i) =>
wenzelm@5841
  1106
      let
wenzelm@5841
  1107
        val irules = find_rules (Logic.strip_assums_concl goal) nets;
wenzelm@5841
  1108
        val rules = erules @ irules;
wenzelm@7425
  1109
        val ruleq = Method.multi_resolves facts rules;
wenzelm@11723
  1110
      in Method.trace rules; fn st => Seq.flat (Seq.map (fn rule => Tactic.rtac rule i st) ruleq) end);
wenzelm@5841
  1111
  in tac end;
wenzelm@5841
  1112
wenzelm@10394
  1113
fun rule_tac [] ctxt cs facts =
wenzelm@11723
  1114
    Method.some_rule_tac [] ctxt facts APPEND' some_rule_tac cs facts
wenzelm@10394
  1115
  | rule_tac rules _ _ facts = Method.rule_tac rules facts;
wenzelm@7281
  1116
wenzelm@10382
  1117
fun default_tac rules ctxt cs facts =
wenzelm@10394
  1118
  rule_tac rules ctxt cs facts ORELSE'
wenzelm@10382
  1119
  AxClass.default_intro_classes_tac facts;
wenzelm@10309
  1120
wenzelm@7230
  1121
in
wenzelm@7281
  1122
  val rule = METHOD_CLASET' o rule_tac;
wenzelm@10394
  1123
  val default = METHOD_CLASET' o default_tac;
wenzelm@7230
  1124
end;
wenzelm@5841
  1125
wenzelm@5841
  1126
wenzelm@7230
  1127
(* intro / elim methods *)
wenzelm@7230
  1128
wenzelm@7230
  1129
local
wenzelm@7230
  1130
wenzelm@10394
  1131
fun intro_elim_tac netpair_of res_tac rules _ cs facts =
wenzelm@7329
  1132
  let
wenzelm@8342
  1133
    val tac =
wenzelm@9449
  1134
      if null rules then FIRST' (map (bimatch_from_nets_tac o netpair_of) (get_nets cs))
wenzelm@7329
  1135
      else res_tac rules;
wenzelm@8342
  1136
  in Method.insert_tac facts THEN' REPEAT_ALL_NEW tac end;
wenzelm@6502
  1137
wenzelm@8699
  1138
val intro_tac = intro_elim_tac (fn (inet, _) => (inet, Net.empty)) Tactic.match_tac;
wenzelm@8699
  1139
val elim_tac = intro_elim_tac (fn (_, enet) => (Net.empty, enet)) Tactic.ematch_tac;
wenzelm@7230
  1140
wenzelm@7230
  1141
in
wenzelm@7230
  1142
  val intro = METHOD_CLASET' o intro_tac;
wenzelm@7230
  1143
  val elim = METHOD_CLASET' o elim_tac;
wenzelm@7230
  1144
end;
wenzelm@7230
  1145
wenzelm@7230
  1146
wenzelm@7230
  1147
(* contradiction method *)
wenzelm@6502
  1148
wenzelm@7425
  1149
val contradiction = Method.rule [Data.not_elim, Data.not_elim COMP Drule.swap_prems_rl];
wenzelm@6502
  1150
wenzelm@6502
  1151
wenzelm@6502
  1152
(* automatic methods *)
wenzelm@5841
  1153
wenzelm@5927
  1154
val cla_modifiers =
wenzelm@10034
  1155
 [Args.$$$ destN -- Args.query_colon >> K ((I, xtra_dest_local):Method.modifier),
wenzelm@10034
  1156
  Args.$$$ destN -- Args.bang_colon >> K (I, safe_dest_local),
wenzelm@10034
  1157
  Args.$$$ destN -- Args.colon >> K (I, haz_dest_local),
wenzelm@10034
  1158
  Args.$$$ elimN -- Args.query_colon >> K (I, xtra_elim_local),
wenzelm@10034
  1159
  Args.$$$ elimN -- Args.bang_colon >> K (I, safe_elim_local),
wenzelm@10034
  1160
  Args.$$$ elimN -- Args.colon >> K (I, haz_elim_local),
wenzelm@10034
  1161
  Args.$$$ introN -- Args.query_colon >> K (I, xtra_intro_local),
wenzelm@10034
  1162
  Args.$$$ introN -- Args.bang_colon >> K (I, safe_intro_local),
wenzelm@10034
  1163
  Args.$$$ introN -- Args.colon >> K (I, haz_intro_local),
wenzelm@10034
  1164
  Args.del -- Args.colon >> K (I, rule_del_local)];
wenzelm@5927
  1165
wenzelm@7559
  1166
fun cla_meth tac prems ctxt = Method.METHOD (fn facts =>
wenzelm@7559
  1167
  ALLGOALS (Method.insert_tac (prems @ facts)) THEN tac (get_local_claset ctxt));
wenzelm@7132
  1168
wenzelm@7559
  1169
fun cla_meth' tac prems ctxt = Method.METHOD (fn facts =>
wenzelm@8168
  1170
  HEADGOAL (Method.insert_tac (prems @ facts) THEN' tac (get_local_claset ctxt)));
wenzelm@5841
  1171
wenzelm@7559
  1172
val cla_method = Method.bang_sectioned_args cla_modifiers o cla_meth;
wenzelm@7559
  1173
val cla_method' = Method.bang_sectioned_args cla_modifiers o cla_meth';
wenzelm@5841
  1174
wenzelm@5841
  1175
wenzelm@5841
  1176
wenzelm@5841
  1177
(** setup_methods **)
wenzelm@5841
  1178
wenzelm@5841
  1179
val setup_methods = Method.add_methods
wenzelm@10309
  1180
 [("default", Method.thms_ctxt_args default, "apply some rule (classical)"),
wenzelm@9441
  1181
  ("rule", Method.thms_ctxt_args rule, "apply some rule (classical)"),
wenzelm@6502
  1182
  ("contradiction", Method.no_args contradiction, "proof by contradiction"),
wenzelm@8098
  1183
  ("intro", Method.thms_ctxt_args intro, "repeatedly apply introduction rules"),
wenzelm@8098
  1184
  ("elim", Method.thms_ctxt_args elim, "repeatedly apply elimination rules"),
wenzelm@10821
  1185
  ("clarify", cla_method' (CHANGED_PROP oo clarify_tac), "repeatedly apply safe steps"),
wenzelm@7004
  1186
  ("fast", cla_method' fast_tac, "classical prover (depth-first)"),
wenzelm@9806
  1187
  ("slow", cla_method' slow_tac, "classical prover (slow depth-first)"),
wenzelm@9773
  1188
  ("best", cla_method' best_tac, "classical prover (best-first)"),
wenzelm@10821
  1189
  ("safe", cla_method (CHANGED_PROP o safe_tac), "classical prover (apply safe rules)")];
wenzelm@5841
  1190
wenzelm@5841
  1191
wenzelm@5841
  1192
wenzelm@5841
  1193
(** theory setup **)
wenzelm@5841
  1194
wenzelm@7354
  1195
val setup = [GlobalClaset.init, LocalClaset.init, setup_attrs, setup_methods];
wenzelm@5841
  1196
wenzelm@5841
  1197
wenzelm@8667
  1198
wenzelm@8667
  1199
(** outer syntax **)
wenzelm@8667
  1200
wenzelm@8667
  1201
val print_clasetP =
wenzelm@8667
  1202
  OuterSyntax.improper_command "print_claset" "print context of Classical Reasoner"
wenzelm@8667
  1203
    OuterSyntax.Keyword.diag
wenzelm@9513
  1204
    (Scan.succeed (Toplevel.no_timing o Toplevel.unknown_context o (Toplevel.keep
wenzelm@9010
  1205
      (Toplevel.node_case print_claset (print_local_claset o Proof.context_of)))));
wenzelm@8667
  1206
wenzelm@8667
  1207
val _ = OuterSyntax.add_parsers [print_clasetP];
wenzelm@8667
  1208
wenzelm@8667
  1209
wenzelm@5841
  1210
end;