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