src/Provers/classical.ML
author wenzelm
Sat Jul 28 20:40:26 2007 +0200 (2007-07-28)
changeset 24021 491c68f40bc4
parent 23594 e65e466dda01
child 24218 fbf1646b267c
permissions -rw-r--r--
added get_cs/map_cs;
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@12376
    18
infix 4 addSIs addSEs addSDs addIs addEs addDs 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
wenzelm@9938
    30
  val mp        : thm           (* [| P-->Q;  P |] ==> Q *)
wenzelm@9938
    31
  val not_elim  : thm           (* [| ~P;  P |] ==> R *)
wenzelm@9938
    32
  val classical : thm           (* (~P ==> P) ==> P *)
wenzelm@9938
    33
  val sizef     : thm -> int    (* size function for BEST_FIRST *)
clasohm@0
    34
  val hyp_subst_tacs: (int -> tactic) list
wenzelm@4079
    35
end;
clasohm@0
    36
wenzelm@5841
    37
signature BASIC_CLASSICAL =
wenzelm@4079
    38
sig
clasohm@0
    39
  type claset
wenzelm@4079
    40
  val empty_cs: claset
wenzelm@4079
    41
  val print_cs: claset -> unit
wenzelm@4380
    42
  val print_claset: theory -> unit
wenzelm@18534
    43
  val rep_cs:
wenzelm@4079
    44
    claset -> {safeIs: thm list, safeEs: thm list,
wenzelm@9938
    45
                 hazIs: thm list, hazEs: thm list,
wenzelm@10736
    46
                 swrappers: (string * wrapper) list,
wenzelm@9938
    47
                 uwrappers: (string * wrapper) list,
wenzelm@9938
    48
                 safe0_netpair: netpair, safep_netpair: netpair,
wenzelm@12401
    49
                 haz_netpair: netpair, dup_netpair: netpair,
wenzelm@12401
    50
                 xtra_netpair: ContextRules.netpair}
wenzelm@9938
    51
  val merge_cs          : claset * claset -> claset
wenzelm@9938
    52
  val addDs             : claset * thm list -> claset
wenzelm@9938
    53
  val addEs             : claset * thm list -> claset
wenzelm@9938
    54
  val addIs             : claset * thm list -> claset
wenzelm@9938
    55
  val addSDs            : claset * thm list -> claset
wenzelm@9938
    56
  val addSEs            : claset * thm list -> claset
wenzelm@9938
    57
  val addSIs            : claset * thm list -> claset
wenzelm@9938
    58
  val delrules          : claset * thm list -> claset
wenzelm@9938
    59
  val addSWrapper       : claset * (string * wrapper) -> claset
wenzelm@9938
    60
  val delSWrapper       : claset *  string            -> claset
wenzelm@9938
    61
  val addWrapper        : claset * (string * wrapper) -> claset
wenzelm@9938
    62
  val delWrapper        : claset *  string            -> claset
wenzelm@9938
    63
  val addSbefore        : claset * (string * (int -> tactic)) -> claset
oheimb@11181
    64
  val addSafter         : claset * (string * (int -> tactic)) -> claset
wenzelm@9938
    65
  val addbefore         : claset * (string * (int -> tactic)) -> claset
oheimb@11181
    66
  val addafter          : claset * (string * (int -> tactic)) -> claset
oheimb@5523
    67
  val addD2             : claset * (string * thm) -> claset
oheimb@5523
    68
  val addE2             : claset * (string * thm) -> claset
oheimb@5523
    69
  val addSD2            : claset * (string * thm) -> claset
oheimb@5523
    70
  val addSE2            : claset * (string * thm) -> claset
wenzelm@9938
    71
  val appSWrappers      : claset -> wrapper
wenzelm@9938
    72
  val appWrappers       : claset -> wrapper
lcp@982
    73
wenzelm@17880
    74
  val change_claset_of: theory -> (claset -> claset) -> unit
wenzelm@17880
    75
  val change_claset: (claset -> claset) -> unit
wenzelm@4079
    76
  val claset_of: theory -> claset
wenzelm@17880
    77
  val claset: unit -> claset
wenzelm@4079
    78
  val CLASET: (claset -> tactic) -> tactic
wenzelm@4079
    79
  val CLASET': (claset -> 'a -> tactic) -> 'a -> tactic
wenzelm@15036
    80
  val local_claset_of   : Proof.context -> claset
wenzelm@4079
    81
wenzelm@9938
    82
  val fast_tac          : claset -> int -> tactic
wenzelm@9938
    83
  val slow_tac          : claset -> int -> tactic
wenzelm@9938
    84
  val weight_ASTAR      : int ref
wenzelm@9938
    85
  val astar_tac         : claset -> int -> tactic
wenzelm@9938
    86
  val slow_astar_tac    : claset -> int -> tactic
wenzelm@9938
    87
  val best_tac          : claset -> int -> tactic
wenzelm@9938
    88
  val first_best_tac    : claset -> int -> tactic
wenzelm@9938
    89
  val slow_best_tac     : claset -> int -> tactic
wenzelm@9938
    90
  val depth_tac         : claset -> int -> int -> tactic
wenzelm@9938
    91
  val deepen_tac        : claset -> int -> int -> tactic
paulson@1587
    92
wenzelm@9938
    93
  val contr_tac         : int -> tactic
wenzelm@9938
    94
  val dup_elim          : thm -> thm
wenzelm@9938
    95
  val dup_intr          : thm -> thm
wenzelm@9938
    96
  val dup_step_tac      : claset -> int -> tactic
wenzelm@9938
    97
  val eq_mp_tac         : int -> tactic
wenzelm@9938
    98
  val haz_step_tac      : claset -> int -> tactic
wenzelm@9938
    99
  val joinrules         : thm list * thm list -> (bool * thm) list
wenzelm@9938
   100
  val mp_tac            : int -> tactic
wenzelm@9938
   101
  val safe_tac          : claset -> tactic
wenzelm@9938
   102
  val safe_steps_tac    : claset -> int -> tactic
wenzelm@9938
   103
  val safe_step_tac     : claset -> int -> tactic
wenzelm@9938
   104
  val clarify_tac       : claset -> int -> tactic
wenzelm@9938
   105
  val clarify_step_tac  : claset -> int -> tactic
wenzelm@9938
   106
  val step_tac          : claset -> int -> tactic
wenzelm@9938
   107
  val slow_step_tac     : claset -> int -> tactic
wenzelm@9938
   108
  val swapify           : thm list -> thm list
wenzelm@9938
   109
  val swap_res_tac      : thm list -> int -> tactic
wenzelm@9938
   110
  val inst_step_tac     : claset -> int -> tactic
wenzelm@9938
   111
  val inst0_step_tac    : claset -> int -> tactic
wenzelm@9938
   112
  val instp_step_tac    : claset -> int -> tactic
berghofe@1724
   113
wenzelm@9938
   114
  val AddDs             : thm list -> unit
wenzelm@9938
   115
  val AddEs             : thm list -> unit
wenzelm@9938
   116
  val AddIs             : thm list -> unit
wenzelm@9938
   117
  val AddSDs            : thm list -> unit
wenzelm@9938
   118
  val AddSEs            : thm list -> unit
wenzelm@9938
   119
  val AddSIs            : thm list -> unit
wenzelm@9938
   120
  val Delrules          : thm list -> unit
wenzelm@9938
   121
  val Safe_tac          : tactic
wenzelm@9938
   122
  val Safe_step_tac     : int -> tactic
wenzelm@9938
   123
  val Clarify_tac       : int -> tactic
wenzelm@9938
   124
  val Clarify_step_tac  : int -> tactic
wenzelm@9938
   125
  val Step_tac          : int -> tactic
wenzelm@9938
   126
  val Fast_tac          : int -> tactic
wenzelm@9938
   127
  val Best_tac          : int -> tactic
wenzelm@9938
   128
  val Slow_tac          : int -> tactic
paulson@2066
   129
  val Slow_best_tac     : int -> tactic
wenzelm@9938
   130
  val Deepen_tac        : int -> int -> tactic
wenzelm@4079
   131
end;
berghofe@1724
   132
wenzelm@5841
   133
signature CLASSICAL =
wenzelm@5841
   134
sig
wenzelm@5841
   135
  include BASIC_CLASSICAL
wenzelm@18374
   136
  val swap: thm  (* ~P ==> (~Q ==> P) ==> Q *)
wenzelm@18534
   137
  val classical_rule: thm -> thm
wenzelm@15036
   138
  val add_context_safe_wrapper: string * (Proof.context -> wrapper) -> theory -> theory
wenzelm@15036
   139
  val del_context_safe_wrapper: string -> theory -> theory
wenzelm@15036
   140
  val add_context_unsafe_wrapper: string * (Proof.context -> wrapper) -> theory -> theory
wenzelm@15036
   141
  val del_context_unsafe_wrapper: string -> theory -> theory
wenzelm@17880
   142
  val get_claset: theory -> claset
wenzelm@5841
   143
  val get_local_claset: Proof.context -> claset
wenzelm@5841
   144
  val put_local_claset: claset -> Proof.context -> Proof.context
wenzelm@22846
   145
  val print_local_claset: Proof.context -> unit
wenzelm@24021
   146
  val get_cs: Context.generic -> claset
wenzelm@24021
   147
  val map_cs: (claset -> claset) -> Context.generic -> Context.generic
wenzelm@18728
   148
  val safe_dest: int option -> attribute
wenzelm@18728
   149
  val safe_elim: int option -> attribute
wenzelm@18728
   150
  val safe_intro: int option -> attribute
wenzelm@18728
   151
  val haz_dest: int option -> attribute
wenzelm@18728
   152
  val haz_elim: int option -> attribute
wenzelm@18728
   153
  val haz_intro: int option -> attribute
wenzelm@18728
   154
  val rule_del: attribute
wenzelm@7272
   155
  val cla_modifiers: (Args.T list -> (Method.modifier * Args.T list)) list
wenzelm@7559
   156
  val cla_meth: (claset -> tactic) -> thm list -> Proof.context -> Proof.method
wenzelm@7559
   157
  val cla_meth': (claset -> int -> tactic) -> thm list -> Proof.context -> Proof.method
wenzelm@15703
   158
  val cla_method: (claset -> tactic) -> Method.src -> Proof.context -> Proof.method
wenzelm@15703
   159
  val cla_method': (claset -> int -> tactic) -> Method.src -> Proof.context -> Proof.method
wenzelm@18708
   160
  val setup: theory -> theory
wenzelm@5841
   161
end;
wenzelm@5841
   162
clasohm@0
   163
wenzelm@5927
   164
functor ClassicalFun(Data: CLASSICAL_DATA): CLASSICAL =
clasohm@0
   165
struct
clasohm@0
   166
wenzelm@7354
   167
local open Data in
clasohm@0
   168
wenzelm@18534
   169
(** classical elimination rules **)
wenzelm@18534
   170
wenzelm@18534
   171
(*
wenzelm@18534
   172
Classical reasoning requires stronger elimination rules.  For
wenzelm@18534
   173
instance, make_elim of Pure transforms the HOL rule injD into
wenzelm@18534
   174
wenzelm@18534
   175
    [| inj f; f x = f y; x = y ==> PROP W |] ==> PROP W
wenzelm@18534
   176
wenzelm@18534
   177
Such rules can cause Fast_tac to fail and Blast_tac to report "PROOF
wenzelm@18534
   178
FAILED"; classical_rule will strenthen this to
wenzelm@18534
   179
wenzelm@18534
   180
    [| inj f; ~ W ==> f x = f y; x = y ==> W |] ==> W
wenzelm@18534
   181
*)
wenzelm@18534
   182
wenzelm@18534
   183
fun classical_rule rule =
wenzelm@19257
   184
  if ObjectLogic.is_elim rule then
wenzelm@18534
   185
    let
wenzelm@18534
   186
      val rule' = rule RS classical;
wenzelm@18534
   187
      val concl' = Thm.concl_of rule';
wenzelm@18534
   188
      fun redundant_hyp goal =
wenzelm@19257
   189
        concl' aconv Logic.strip_assums_concl goal orelse
wenzelm@18534
   190
          (case Logic.strip_assums_hyp goal of
wenzelm@18534
   191
            hyp :: hyps => exists (fn t => t aconv hyp) hyps
wenzelm@18534
   192
          | _ => false);
wenzelm@18534
   193
      val rule'' =
wenzelm@18534
   194
        rule' |> ALLGOALS (SUBGOAL (fn (goal, i) =>
wenzelm@18534
   195
          if i = 1 orelse redundant_hyp goal
wenzelm@18534
   196
          then Tactic.etac thin_rl i
wenzelm@18534
   197
          else all_tac))
wenzelm@18534
   198
        |> Seq.hd
wenzelm@21963
   199
        |> Drule.zero_var_indexes;
wenzelm@22360
   200
    in if Thm.equiv_thm (rule, rule'') then rule else rule'' end
wenzelm@18534
   201
  else rule;
wenzelm@18534
   202
wenzelm@23594
   203
(*flatten nested meta connectives in prems*)
wenzelm@23594
   204
val flat_rule = Conv.fconv_rule (Conv.prems_conv ~1 ObjectLogic.atomize_prems);
wenzelm@18534
   205
wenzelm@18534
   206
paulson@1800
   207
(*** Useful tactics for classical reasoning ***)
clasohm@0
   208
paulson@1524
   209
val imp_elim = (*cannot use bind_thm within a structure!*)
wenzelm@18586
   210
  store_thm ("imp_elim", Thm.transfer (the_context ()) (classical_rule (Tactic.make_elim mp)));
clasohm@0
   211
wenzelm@10736
   212
(*Prove goal that assumes both P and ~P.
paulson@4392
   213
  No backtracking if it finds an equal assumption.  Perhaps should call
paulson@4392
   214
  ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*)
wenzelm@10736
   215
val contr_tac = eresolve_tac [not_elim]  THEN'
paulson@4392
   216
                (eq_assume_tac ORELSE' assume_tac);
clasohm@0
   217
lcp@681
   218
(*Finds P-->Q and P in the assumptions, replaces implication by Q.
lcp@681
   219
  Could do the same thing for P<->Q and P... *)
lcp@681
   220
fun mp_tac i = eresolve_tac [not_elim, imp_elim] i  THEN  assume_tac i;
clasohm@0
   221
clasohm@0
   222
(*Like mp_tac but instantiates no variables*)
lcp@681
   223
fun eq_mp_tac i = ematch_tac [not_elim, imp_elim] i  THEN  eq_assume_tac i;
lcp@681
   224
paulson@1524
   225
val swap =
wenzelm@18586
   226
  store_thm ("swap", Thm.transfer (the_context ())
wenzelm@18586
   227
    (rule_by_tactic (etac thin_rl 1) (not_elim RS classical)));
clasohm@0
   228
clasohm@0
   229
(*Creates rules to eliminate ~A, from rules to introduce A*)
clasohm@0
   230
fun swapify intrs = intrs RLN (2, [swap]);
wenzelm@12401
   231
fun swapped x = Attrib.no_args (fn (x, th) => (x, th RSN (2, swap))) x;
clasohm@0
   232
clasohm@0
   233
(*Uses introduction rules in the normal way, or on negated assumptions,
clasohm@0
   234
  trying rules in order. *)
wenzelm@10736
   235
fun swap_res_tac rls =
lcp@54
   236
    let fun addrl (rl,brls) = (false, rl) :: (true, rl RSN (2,swap)) :: brls
wenzelm@10736
   237
    in  assume_tac      ORELSE'
wenzelm@10736
   238
        contr_tac       ORELSE'
skalberg@15574
   239
        biresolve_tac (foldr addrl [] rls)
clasohm@0
   240
    end;
clasohm@0
   241
lcp@681
   242
(*Duplication of hazardous rules, for complete provers*)
paulson@2689
   243
fun dup_intr th = zero_var_indexes (th RS classical);
lcp@681
   244
wenzelm@6967
   245
fun dup_elim th =
wenzelm@13525
   246
    rule_by_tactic (TRYALL (etac revcut_rl))
paulson@18557
   247
      ((th RSN (2, revcut_rl)) |> assumption 2 |> Seq.hd);
lcp@1073
   248
paulson@1800
   249
(**** Classical rule sets ****)
clasohm@0
   250
clasohm@0
   251
datatype claset =
wenzelm@12401
   252
  CS of {safeIs         : thm list,                (*safe introduction rules*)
wenzelm@12401
   253
         safeEs         : thm list,                (*safe elimination rules*)
wenzelm@12401
   254
         hazIs          : thm list,                (*unsafe introduction rules*)
wenzelm@12401
   255
         hazEs          : thm list,                (*unsafe elimination rules*)
wenzelm@12401
   256
         swrappers      : (string * wrapper) list, (*for transforming safe_step_tac*)
wenzelm@9938
   257
         uwrappers      : (string * wrapper) list, (*for transforming step_tac*)
wenzelm@12401
   258
         safe0_netpair  : netpair,                 (*nets for trivial cases*)
wenzelm@12401
   259
         safep_netpair  : netpair,                 (*nets for >0 subgoals*)
wenzelm@12401
   260
         haz_netpair    : netpair,                 (*nets for unsafe rules*)
wenzelm@12401
   261
         dup_netpair    : netpair,                 (*nets for duplication*)
wenzelm@12401
   262
         xtra_netpair   : ContextRules.netpair};   (*nets for extra rules*)
clasohm@0
   263
lcp@1073
   264
(*Desired invariants are
wenzelm@9938
   265
        safe0_netpair = build safe0_brls,
wenzelm@9938
   266
        safep_netpair = build safep_brls,
wenzelm@9938
   267
        haz_netpair = build (joinrules(hazIs, hazEs)),
wenzelm@10736
   268
        dup_netpair = build (joinrules(map dup_intr hazIs,
wenzelm@12376
   269
                                       map dup_elim hazEs))
lcp@1073
   270
wenzelm@10736
   271
where build = build_netpair(Net.empty,Net.empty),
lcp@1073
   272
      safe0_brls contains all brules that solve the subgoal, and
lcp@1073
   273
      safep_brls contains all brules that generate 1 or more new subgoals.
wenzelm@4079
   274
The theorem lists are largely comments, though they are used in merge_cs and print_cs.
lcp@1073
   275
Nets must be built incrementally, to save space and time.
lcp@1073
   276
*)
clasohm@0
   277
wenzelm@6502
   278
val empty_netpair = (Net.empty, Net.empty);
wenzelm@6502
   279
wenzelm@10736
   280
val empty_cs =
wenzelm@9938
   281
  CS{safeIs     = [],
wenzelm@9938
   282
     safeEs     = [],
wenzelm@9938
   283
     hazIs      = [],
wenzelm@9938
   284
     hazEs      = [],
oheimb@4651
   285
     swrappers  = [],
oheimb@4651
   286
     uwrappers  = [],
wenzelm@6502
   287
     safe0_netpair = empty_netpair,
wenzelm@6502
   288
     safep_netpair = empty_netpair,
wenzelm@6502
   289
     haz_netpair   = empty_netpair,
wenzelm@6955
   290
     dup_netpair   = empty_netpair,
wenzelm@6955
   291
     xtra_netpair  = empty_netpair};
clasohm@0
   292
wenzelm@15036
   293
fun print_cs (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, ...}) =
wenzelm@3546
   294
  let val pretty_thms = map Display.pretty_thm in
wenzelm@9760
   295
    [Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs),
wenzelm@9760
   296
      Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs),
wenzelm@9760
   297
      Pretty.big_list "safe elimination rules (elim!):" (pretty_thms safeEs),
wenzelm@15036
   298
      Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs),
wenzelm@15036
   299
      Pretty.strs ("safe wrappers:" :: map #1 swrappers),
wenzelm@15036
   300
      Pretty.strs ("unsafe wrappers:" :: map #1 uwrappers)]
wenzelm@8727
   301
    |> Pretty.chunks |> Pretty.writeln
wenzelm@3546
   302
  end;
clasohm@0
   303
oheimb@4653
   304
fun rep_cs (CS args) = args;
lcp@1073
   305
haftmann@22674
   306
fun appSWrappers (CS {swrappers, ...}) = fold snd swrappers;
haftmann@22674
   307
fun appWrappers  (CS {uwrappers, ...}) = fold snd uwrappers;
lcp@1073
   308
wenzelm@4079
   309
paulson@1800
   310
(*** Adding (un)safe introduction or elimination rules.
lcp@1073
   311
lcp@1073
   312
    In case of overlap, new rules are tried BEFORE old ones!!
paulson@1800
   313
***)
clasohm@0
   314
wenzelm@12376
   315
(*For use with biresolve_tac.  Combines intro rules with swap to handle negated
lcp@1073
   316
  assumptions.  Pairs elim rules with true. *)
wenzelm@12376
   317
fun joinrules (intrs, elims) =
paulson@18557
   318
  (map (pair true) (elims @ swapify intrs)) @ map (pair false) intrs;
wenzelm@12376
   319
wenzelm@12401
   320
fun joinrules' (intrs, elims) =
paulson@18557
   321
  map (pair true) elims @ map (pair false) intrs;
lcp@1073
   322
wenzelm@10736
   323
(*Priority: prefer rules with fewest subgoals,
paulson@1231
   324
  then rules added most recently (preferring the head of the list).*)
lcp@1073
   325
fun tag_brls k [] = []
lcp@1073
   326
  | tag_brls k (brl::brls) =
wenzelm@10736
   327
      (1000000*subgoals_of_brl brl + k, brl) ::
lcp@1073
   328
      tag_brls (k+1) brls;
lcp@1073
   329
wenzelm@12401
   330
fun tag_brls' _ _ [] = []
wenzelm@12401
   331
  | tag_brls' w k (brl::brls) = ((w, k), brl) :: tag_brls' w (k + 1) brls;
wenzelm@10736
   332
wenzelm@23178
   333
fun insert_tagged_list rls = fold_rev Tactic.insert_tagged_brl rls;
lcp@1073
   334
lcp@1073
   335
(*Insert into netpair that already has nI intr rules and nE elim rules.
lcp@1073
   336
  Count the intr rules double (to account for swapify).  Negate to give the
lcp@1073
   337
  new insertions the lowest priority.*)
wenzelm@12376
   338
fun insert (nI, nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules;
wenzelm@12401
   339
fun insert' w (nI, nE) = insert_tagged_list o tag_brls' w (~(nI + nE)) o joinrules';
lcp@1073
   340
wenzelm@23178
   341
fun delete_tagged_list rls = fold_rev Tactic.delete_tagged_brl rls;
wenzelm@12362
   342
fun delete x = delete_tagged_list (joinrules x);
wenzelm@12401
   343
fun delete' x = delete_tagged_list (joinrules' x);
paulson@1800
   344
wenzelm@22360
   345
val mem_thm = member Thm.eq_thm_prop
wenzelm@22360
   346
and rem_thm = remove Thm.eq_thm_prop;
paulson@2813
   347
paulson@1927
   348
(*Warn if the rule is already present ELSEWHERE in the claset.  The addition
paulson@1927
   349
  is still allowed.*)
wenzelm@12376
   350
fun warn_dup th (CS{safeIs, safeEs, hazIs, hazEs, ...}) =
wenzelm@18691
   351
       if mem_thm safeIs th then
wenzelm@9938
   352
         warning ("Rule already declared as safe introduction (intro!)\n" ^ string_of_thm th)
wenzelm@18691
   353
  else if mem_thm safeEs th then
wenzelm@9408
   354
         warning ("Rule already declared as safe elimination (elim!)\n" ^ string_of_thm th)
wenzelm@18691
   355
  else if mem_thm hazIs th then
wenzelm@9760
   356
         warning ("Rule already declared as introduction (intro)\n" ^ string_of_thm th)
wenzelm@18691
   357
  else if mem_thm hazEs th then
wenzelm@9760
   358
         warning ("Rule already declared as elimination (elim)\n" ^ string_of_thm th)
paulson@1927
   359
  else ();
paulson@1927
   360
wenzelm@12376
   361
paulson@1800
   362
(*** Safe rules ***)
lcp@982
   363
wenzelm@18691
   364
fun addSI w th
wenzelm@18534
   365
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@18534
   366
             safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@18691
   367
  if mem_thm safeIs th then
wenzelm@9938
   368
         (warning ("Ignoring duplicate safe introduction (intro!)\n" ^ string_of_thm th);
wenzelm@9938
   369
          cs)
paulson@1927
   370
  else
wenzelm@23594
   371
  let val th' = flat_rule th
wenzelm@23594
   372
      val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
wenzelm@23594
   373
          List.partition Thm.no_prems [th']
paulson@1927
   374
      val nI = length safeIs + 1
lcp@1073
   375
      and nE = length safeEs
paulson@1927
   376
  in warn_dup th cs;
wenzelm@9938
   377
     CS{safeIs  = th::safeIs,
lcp@1073
   378
        safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair,
wenzelm@9938
   379
        safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair,
wenzelm@9938
   380
        safeEs  = safeEs,
wenzelm@9938
   381
        hazIs   = hazIs,
wenzelm@9938
   382
        hazEs   = hazEs,
wenzelm@9938
   383
        swrappers    = swrappers,
wenzelm@9938
   384
        uwrappers    = uwrappers,
wenzelm@9938
   385
        haz_netpair  = haz_netpair,
wenzelm@9938
   386
        dup_netpair  = dup_netpair,
wenzelm@18691
   387
        xtra_netpair = insert' (the_default 0 w) (nI,nE) ([th], []) xtra_netpair}
lcp@1073
   388
  end;
lcp@1073
   389
wenzelm@18691
   390
fun addSE w th
wenzelm@18534
   391
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@18534
   392
             safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@18691
   393
  if mem_thm safeEs th then
wenzelm@9938
   394
         (warning ("Ignoring duplicate safe elimination (elim!)\n" ^ string_of_thm th);
wenzelm@9938
   395
          cs)
paulson@18557
   396
  else if has_fewer_prems 1 th then
paulson@18557
   397
    	error("Ill-formed elimination rule\n" ^ string_of_thm th)
paulson@1927
   398
  else
wenzelm@18534
   399
  let
wenzelm@23594
   400
      val th' = classical_rule (flat_rule th)
wenzelm@18534
   401
      val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
wenzelm@18534
   402
          List.partition (fn rl => nprems_of rl=1) [th']
lcp@1073
   403
      val nI = length safeIs
paulson@1927
   404
      and nE = length safeEs + 1
paulson@1927
   405
  in warn_dup th cs;
wenzelm@9938
   406
     CS{safeEs  = th::safeEs,
lcp@1073
   407
        safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair,
wenzelm@9938
   408
        safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair,
wenzelm@9938
   409
        safeIs  = safeIs,
wenzelm@9938
   410
        hazIs   = hazIs,
wenzelm@9938
   411
        hazEs   = hazEs,
wenzelm@9938
   412
        swrappers    = swrappers,
wenzelm@9938
   413
        uwrappers    = uwrappers,
wenzelm@9938
   414
        haz_netpair  = haz_netpair,
wenzelm@9938
   415
        dup_netpair  = dup_netpair,
wenzelm@18691
   416
        xtra_netpair = insert' (the_default 0 w) (nI,nE) ([], [th]) xtra_netpair}
lcp@1073
   417
  end;
clasohm@0
   418
wenzelm@18691
   419
fun cs addSIs ths = fold_rev (addSI NONE) ths cs;
wenzelm@18691
   420
fun cs addSEs ths = fold_rev (addSE NONE) ths cs;
paulson@1927
   421
paulson@21689
   422
fun make_elim th =
paulson@18557
   423
    if has_fewer_prems 1 th then
paulson@18557
   424
    	error("Ill-formed destruction rule\n" ^ string_of_thm th)
paulson@21689
   425
    else Tactic.make_elim th;
paulson@17084
   426
paulson@21689
   427
fun cs addSDs ths = cs addSEs (map make_elim ths);
clasohm@0
   428
lcp@1073
   429
paulson@1800
   430
(*** Hazardous (unsafe) rules ***)
clasohm@0
   431
wenzelm@18691
   432
fun addI w th
wenzelm@18534
   433
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@18534
   434
             safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@18691
   435
  if mem_thm hazIs th then
wenzelm@9938
   436
         (warning ("Ignoring duplicate introduction (intro)\n" ^ string_of_thm th);
wenzelm@9938
   437
          cs)
paulson@1927
   438
  else
wenzelm@23594
   439
  let val th' = flat_rule th
wenzelm@23594
   440
      val nI = length hazIs + 1
lcp@1073
   441
      and nE = length hazEs
paulson@1927
   442
  in warn_dup th cs;
wenzelm@9938
   443
     CS{hazIs   = th::hazIs,
wenzelm@23594
   444
        haz_netpair = insert (nI,nE) ([th'], []) haz_netpair,
wenzelm@23594
   445
        dup_netpair = insert (nI,nE) (map dup_intr [th'], []) dup_netpair,
wenzelm@10736
   446
        safeIs  = safeIs,
wenzelm@9938
   447
        safeEs  = safeEs,
wenzelm@9938
   448
        hazEs   = hazEs,
wenzelm@9938
   449
        swrappers     = swrappers,
wenzelm@9938
   450
        uwrappers     = uwrappers,
wenzelm@9938
   451
        safe0_netpair = safe0_netpair,
wenzelm@9938
   452
        safep_netpair = safep_netpair,
wenzelm@18691
   453
        xtra_netpair = insert' (the_default 1 w) (nI,nE) ([th], []) xtra_netpair}
paulson@18557
   454
  end
paulson@18557
   455
  handle THM("RSN: no unifiers",_,_) => (*from dup_intr*)
paulson@18557
   456
         error ("Ill-formed introduction rule\n" ^ string_of_thm th);
lcp@1073
   457
wenzelm@18691
   458
fun addE w th
wenzelm@18534
   459
  (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@18534
   460
            safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@18691
   461
  if mem_thm hazEs th then
wenzelm@9938
   462
         (warning ("Ignoring duplicate elimination (elim)\n" ^ string_of_thm th);
wenzelm@9938
   463
          cs)
paulson@18557
   464
  else if has_fewer_prems 1 th then
paulson@18557
   465
    	error("Ill-formed elimination rule\n" ^ string_of_thm th)
paulson@1927
   466
  else
wenzelm@18534
   467
  let
wenzelm@23594
   468
      val th' = classical_rule (flat_rule th)
wenzelm@18534
   469
      val nI = length hazIs
paulson@1927
   470
      and nE = length hazEs + 1
paulson@1927
   471
  in warn_dup th cs;
wenzelm@9938
   472
     CS{hazEs   = th::hazEs,
wenzelm@18534
   473
        haz_netpair = insert (nI,nE) ([], [th']) haz_netpair,
wenzelm@18534
   474
        dup_netpair = insert (nI,nE) ([], map dup_elim [th']) dup_netpair,
wenzelm@10736
   475
        safeIs  = safeIs,
wenzelm@9938
   476
        safeEs  = safeEs,
wenzelm@9938
   477
        hazIs   = hazIs,
wenzelm@9938
   478
        swrappers     = swrappers,
wenzelm@9938
   479
        uwrappers     = uwrappers,
wenzelm@9938
   480
        safe0_netpair = safe0_netpair,
wenzelm@9938
   481
        safep_netpair = safep_netpair,
wenzelm@18691
   482
        xtra_netpair = insert' (the_default 1 w) (nI,nE) ([], [th]) xtra_netpair}
lcp@1073
   483
  end;
clasohm@0
   484
wenzelm@18691
   485
fun cs addIs ths = fold_rev (addI NONE) ths cs;
wenzelm@18691
   486
fun cs addEs ths = fold_rev (addE NONE) ths cs;
paulson@1927
   487
paulson@21689
   488
fun cs addDs ths = cs addEs (map make_elim ths);
clasohm@0
   489
lcp@1073
   490
wenzelm@10736
   491
(*** Deletion of rules
paulson@1800
   492
     Working out what to delete, requires repeating much of the code used
wenzelm@9938
   493
        to insert.
paulson@1800
   494
***)
paulson@1800
   495
wenzelm@10736
   496
fun delSI th
wenzelm@12376
   497
          (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@9938
   498
                    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@18691
   499
 if mem_thm safeIs th then
wenzelm@23594
   500
   let val th' = flat_rule th
wenzelm@23594
   501
       val (safe0_rls, safep_rls) = List.partition Thm.no_prems [th']
paulson@2813
   502
   in CS{safe0_netpair = delete (safe0_rls, []) safe0_netpair,
wenzelm@9938
   503
         safep_netpair = delete (safep_rls, []) safep_netpair,
wenzelm@18691
   504
         safeIs = rem_thm th safeIs,
wenzelm@9938
   505
         safeEs = safeEs,
wenzelm@9938
   506
         hazIs  = hazIs,
wenzelm@9938
   507
         hazEs  = hazEs,
wenzelm@9938
   508
         swrappers    = swrappers,
wenzelm@9938
   509
         uwrappers    = uwrappers,
wenzelm@9938
   510
         haz_netpair  = haz_netpair,
wenzelm@9938
   511
         dup_netpair  = dup_netpair,
wenzelm@12401
   512
         xtra_netpair = delete' ([th], []) xtra_netpair}
paulson@2813
   513
   end
paulson@2813
   514
 else cs;
paulson@1800
   515
paulson@2813
   516
fun delSE th
wenzelm@12376
   517
          (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@9938
   518
                    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@18691
   519
  if mem_thm safeEs th then
wenzelm@18534
   520
    let
wenzelm@23594
   521
      val th' = classical_rule (flat_rule th)
wenzelm@18534
   522
      val (safe0_rls, safep_rls) = List.partition (fn rl => nprems_of rl=1) [th']
wenzelm@18534
   523
    in CS{safe0_netpair = delete ([], safe0_rls) safe0_netpair,
wenzelm@9938
   524
         safep_netpair = delete ([], safep_rls) safep_netpair,
wenzelm@9938
   525
         safeIs = safeIs,
wenzelm@18691
   526
         safeEs = rem_thm th safeEs,
wenzelm@9938
   527
         hazIs  = hazIs,
wenzelm@9938
   528
         hazEs  = hazEs,
wenzelm@9938
   529
         swrappers    = swrappers,
wenzelm@9938
   530
         uwrappers    = uwrappers,
wenzelm@9938
   531
         haz_netpair  = haz_netpair,
wenzelm@9938
   532
         dup_netpair  = dup_netpair,
wenzelm@12401
   533
         xtra_netpair = delete' ([], [th]) xtra_netpair}
wenzelm@18534
   534
    end
wenzelm@18534
   535
  else cs;
paulson@1800
   536
paulson@1800
   537
paulson@2813
   538
fun delI th
wenzelm@12376
   539
         (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@9938
   540
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@18691
   541
 if mem_thm hazIs th then
wenzelm@23594
   542
    let val th' = flat_rule th
wenzelm@23594
   543
    in CS{haz_netpair = delete ([th'], []) haz_netpair,
wenzelm@23594
   544
        dup_netpair = delete ([dup_intr th'], []) dup_netpair,
wenzelm@10736
   545
        safeIs  = safeIs,
wenzelm@9938
   546
        safeEs  = safeEs,
wenzelm@18691
   547
        hazIs   = rem_thm th hazIs,
wenzelm@9938
   548
        hazEs   = hazEs,
wenzelm@9938
   549
        swrappers     = swrappers,
wenzelm@9938
   550
        uwrappers     = uwrappers,
wenzelm@9938
   551
        safe0_netpair = safe0_netpair,
wenzelm@9938
   552
        safep_netpair = safep_netpair,
wenzelm@12401
   553
        xtra_netpair = delete' ([th], []) xtra_netpair}
wenzelm@23594
   554
    end
paulson@18557
   555
 else cs
paulson@18557
   556
 handle THM("RSN: no unifiers",_,_) => (*from dup_intr*)
paulson@18557
   557
        error ("Ill-formed introduction rule\n" ^ string_of_thm th);
paulson@18557
   558
paulson@1800
   559
paulson@2813
   560
fun delE th
wenzelm@12376
   561
         (cs as CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@9938
   562
                   safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@23594
   563
 if mem_thm hazEs th then
wenzelm@23594
   564
   let val th' = classical_rule (flat_rule th)
wenzelm@23594
   565
   in CS{haz_netpair = delete ([], [th']) haz_netpair,
wenzelm@18534
   566
        dup_netpair = delete ([], [dup_elim th']) dup_netpair,
wenzelm@10736
   567
        safeIs  = safeIs,
wenzelm@9938
   568
        safeEs  = safeEs,
wenzelm@9938
   569
        hazIs   = hazIs,
wenzelm@18691
   570
        hazEs   = rem_thm th hazEs,
wenzelm@9938
   571
        swrappers     = swrappers,
wenzelm@9938
   572
        uwrappers     = uwrappers,
wenzelm@9938
   573
        safe0_netpair = safe0_netpair,
wenzelm@9938
   574
        safep_netpair = safep_netpair,
wenzelm@12401
   575
        xtra_netpair = delete' ([], [th]) xtra_netpair}
wenzelm@23594
   576
   end
wenzelm@23594
   577
 else cs;
paulson@1800
   578
paulson@2813
   579
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*)
wenzelm@18534
   580
fun delrule th (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}) =
wenzelm@18534
   581
  let val th' = Tactic.make_elim th in
wenzelm@18691
   582
    if mem_thm safeIs th orelse mem_thm safeEs th orelse
wenzelm@18691
   583
      mem_thm hazIs th orelse mem_thm hazEs th orelse
wenzelm@18691
   584
      mem_thm safeEs th' orelse mem_thm hazEs th'
wenzelm@12376
   585
    then delSI th (delSE th (delI th (delE th (delSE th' (delE th' cs)))))
wenzelm@18534
   586
    else (warning ("Undeclared classical rule\n" ^ string_of_thm th); cs)
wenzelm@9938
   587
  end;
paulson@1800
   588
wenzelm@18534
   589
fun cs delrules ths = fold delrule ths cs;
paulson@1800
   590
paulson@1800
   591
oheimb@4767
   592
(*** Modifying the wrapper tacticals ***)
haftmann@22674
   593
fun map_swrappers f
haftmann@22674
   594
  (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
haftmann@22674
   595
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
haftmann@22674
   596
  CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
oheimb@4767
   597
    swrappers = f swrappers, uwrappers = uwrappers,
oheimb@4767
   598
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
wenzelm@6955
   599
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
oheimb@4767
   600
haftmann@22674
   601
fun map_uwrappers f
haftmann@22674
   602
  (CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
haftmann@22674
   603
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
haftmann@22674
   604
  CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
oheimb@4767
   605
    swrappers = swrappers, uwrappers = f uwrappers,
oheimb@4767
   606
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
wenzelm@6955
   607
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
oheimb@4767
   608
haftmann@22674
   609
fun update_warn msg (p as (key : string, _)) xs =
haftmann@22674
   610
  (if AList.defined (op =) xs key then warning msg else ();
haftmann@22674
   611
    AList.update (op =) p xs);
haftmann@22674
   612
haftmann@22674
   613
fun delete_warn msg (key : string) xs =
haftmann@22674
   614
  if AList.defined (op =) xs key then AList.delete (op =) key xs
haftmann@22674
   615
    else (warning msg; xs);
lcp@982
   616
oheimb@4651
   617
(*Add/replace a safe wrapper*)
haftmann@22674
   618
fun cs addSWrapper new_swrapper = map_swrappers
haftmann@22674
   619
  (update_warn ("Overwriting safe wrapper " ^ fst new_swrapper) new_swrapper) cs;
oheimb@4651
   620
oheimb@4651
   621
(*Add/replace an unsafe wrapper*)
haftmann@22674
   622
fun cs addWrapper new_uwrapper = map_uwrappers
haftmann@22674
   623
  (update_warn ("Overwriting unsafe wrapper " ^ fst new_uwrapper) new_uwrapper) cs;
lcp@982
   624
oheimb@4651
   625
(*Remove a safe wrapper*)
haftmann@22674
   626
fun cs delSWrapper name = map_swrappers
haftmann@22674
   627
  (delete_warn ("No such safe wrapper in claset: " ^ name) name) cs;
lcp@982
   628
oheimb@4651
   629
(*Remove an unsafe wrapper*)
haftmann@22674
   630
fun cs delWrapper name = map_uwrappers
haftmann@22674
   631
  (delete_warn ("No such unsafe wrapper in claset: " ^ name) name) cs;
lcp@982
   632
oheimb@11168
   633
(* compose a safe tactic alternatively before/after safe_step_tac *)
wenzelm@10736
   634
fun cs addSbefore  (name,    tac1) =
oheimb@5523
   635
    cs addSWrapper (name, fn tac2 => tac1 ORELSE' tac2);
oheimb@11181
   636
fun cs addSafter   (name,    tac2) =
oheimb@5523
   637
    cs addSWrapper (name, fn tac1 => tac1 ORELSE' tac2);
lcp@982
   638
oheimb@11168
   639
(*compose a tactic alternatively before/after the step tactic *)
wenzelm@10736
   640
fun cs addbefore   (name,    tac1) =
oheimb@5523
   641
    cs addWrapper  (name, fn tac2 => tac1 APPEND' tac2);
oheimb@11181
   642
fun cs addafter    (name,    tac2) =
oheimb@5523
   643
    cs addWrapper  (name, fn tac1 => tac1 APPEND' tac2);
oheimb@4767
   644
wenzelm@10736
   645
fun cs addD2     (name, thm) =
oheimb@11181
   646
    cs addafter  (name, datac thm 1);
wenzelm@10736
   647
fun cs addE2     (name, thm) =
oheimb@11181
   648
    cs addafter  (name, eatac thm 1);
oheimb@11181
   649
fun cs addSD2    (name, thm) =
oheimb@11181
   650
    cs addSafter (name, dmatch_tac [thm] THEN' eq_assume_tac);
oheimb@11181
   651
fun cs addSE2    (name, thm) =
oheimb@11181
   652
    cs addSafter (name, ematch_tac [thm] THEN' eq_assume_tac);
lcp@982
   653
paulson@1711
   654
(*Merge works by adding all new rules of the 2nd claset into the 1st claset.
paulson@1711
   655
  Merging the term nets may look more efficient, but the rather delicate
paulson@1711
   656
  treatment of priority might get muddled up.*)
haftmann@22674
   657
fun merge_cs (cs as CS {safeIs, safeEs, hazIs, hazEs, ...},
haftmann@22674
   658
    CS {safeIs = safeIs2, safeEs = safeEs2, hazIs = hazIs2, hazEs = hazEs2,
haftmann@22674
   659
      swrappers, uwrappers, ...}) =
haftmann@22674
   660
  let
haftmann@22674
   661
    val safeIs' = fold rem_thm safeIs safeIs2;
haftmann@22674
   662
    val safeEs' = fold rem_thm safeEs safeEs2;
haftmann@22674
   663
    val hazIs' = fold rem_thm hazIs hazIs2;
haftmann@22674
   664
    val hazEs' = fold rem_thm hazEs hazEs2;
haftmann@22674
   665
    val cs1   = cs addSIs safeIs'
haftmann@22674
   666
                   addSEs safeEs'
haftmann@22674
   667
                   addIs  hazIs'
haftmann@22674
   668
                   addEs  hazEs';
haftmann@22674
   669
    val cs2 = map_swrappers
haftmann@22674
   670
      (fn ws => AList.merge (op =) (K true) (ws, swrappers)) cs1;
haftmann@22674
   671
    val cs3 = map_uwrappers
haftmann@22674
   672
      (fn ws => AList.merge (op =) (K true) (ws, uwrappers)) cs2;
haftmann@22674
   673
  in cs3 end;
paulson@1711
   674
lcp@982
   675
paulson@1800
   676
(**** Simple tactics for theorem proving ****)
clasohm@0
   677
clasohm@0
   678
(*Attack subgoals using safe inferences -- matching, not resolution*)
wenzelm@10736
   679
fun safe_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) =
oheimb@4651
   680
  appSWrappers cs (FIRST' [
wenzelm@9938
   681
        eq_assume_tac,
wenzelm@9938
   682
        eq_mp_tac,
wenzelm@9938
   683
        bimatch_from_nets_tac safe0_netpair,
wenzelm@9938
   684
        FIRST' hyp_subst_tacs,
wenzelm@9938
   685
        bimatch_from_nets_tac safep_netpair]);
clasohm@0
   686
oheimb@5757
   687
(*Repeatedly attack a subgoal using safe inferences -- it's deterministic!*)
wenzelm@10736
   688
fun safe_steps_tac cs = REPEAT_DETERM1 o
wenzelm@9938
   689
        (fn i => COND (has_fewer_prems i) no_tac (safe_step_tac cs i));
oheimb@5757
   690
clasohm@0
   691
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*)
oheimb@5757
   692
fun safe_tac cs = REPEAT_DETERM1 (FIRSTGOAL (safe_steps_tac cs));
lcp@747
   693
paulson@3705
   694
paulson@3705
   695
(*** Clarify_tac: do safe steps without causing branching ***)
paulson@3705
   696
paulson@3705
   697
fun nsubgoalsP n (k,brl) = (subgoals_of_brl brl = n);
paulson@3705
   698
paulson@3705
   699
(*version of bimatch_from_nets_tac that only applies rules that
paulson@3705
   700
  create precisely n subgoals.*)
wenzelm@10736
   701
fun n_bimatch_from_nets_tac n =
skalberg@15570
   702
    biresolution_from_nets_tac (Tactic.orderlist o List.filter (nsubgoalsP n)) true;
paulson@3705
   703
paulson@3705
   704
fun eq_contr_tac i = ematch_tac [not_elim] i  THEN  eq_assume_tac i;
paulson@3705
   705
val eq_assume_contr_tac = eq_assume_tac ORELSE' eq_contr_tac;
paulson@3705
   706
paulson@3705
   707
(*Two-way branching is allowed only if one of the branches immediately closes*)
paulson@3705
   708
fun bimatch2_tac netpair i =
paulson@3705
   709
    n_bimatch_from_nets_tac 2 netpair i THEN
paulson@3705
   710
    (eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i+1));
paulson@3705
   711
paulson@3705
   712
(*Attack subgoals using safe inferences -- matching, not resolution*)
wenzelm@10736
   713
fun clarify_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) =
oheimb@4651
   714
  appSWrappers cs (FIRST' [
wenzelm@9938
   715
        eq_assume_contr_tac,
wenzelm@9938
   716
        bimatch_from_nets_tac safe0_netpair,
wenzelm@9938
   717
        FIRST' hyp_subst_tacs,
wenzelm@9938
   718
        n_bimatch_from_nets_tac 1 safep_netpair,
paulson@3705
   719
        bimatch2_tac safep_netpair]);
paulson@3705
   720
paulson@3705
   721
fun clarify_tac cs = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac cs 1));
paulson@3705
   722
paulson@3705
   723
paulson@3705
   724
(*** Unsafe steps instantiate variables or lose information ***)
paulson@3705
   725
paulson@4066
   726
(*Backtracking is allowed among the various these unsafe ways of
paulson@4066
   727
  proving a subgoal.  *)
lcp@747
   728
fun inst0_step_tac (CS{safe0_netpair,safep_netpair,...}) =
wenzelm@10736
   729
  assume_tac                      APPEND'
wenzelm@10736
   730
  contr_tac                       APPEND'
lcp@747
   731
  biresolve_from_nets_tac safe0_netpair;
lcp@747
   732
paulson@4066
   733
(*These unsafe steps could generate more subgoals.*)
lcp@747
   734
fun instp_step_tac (CS{safep_netpair,...}) =
lcp@747
   735
  biresolve_from_nets_tac safep_netpair;
clasohm@0
   736
clasohm@0
   737
(*These steps could instantiate variables and are therefore unsafe.*)
lcp@747
   738
fun inst_step_tac cs = inst0_step_tac cs APPEND' instp_step_tac cs;
clasohm@0
   739
wenzelm@10736
   740
fun haz_step_tac (CS{haz_netpair,...}) =
lcp@681
   741
  biresolve_from_nets_tac haz_netpair;
lcp@681
   742
clasohm@0
   743
(*Single step for the prover.  FAILS unless it makes progress. *)
wenzelm@10736
   744
fun step_tac cs i = safe_tac cs ORELSE appWrappers cs
wenzelm@9938
   745
        (inst_step_tac cs ORELSE' haz_step_tac cs) i;
clasohm@0
   746
clasohm@0
   747
(*Using a "safe" rule to instantiate variables is unsafe.  This tactic
clasohm@0
   748
  allows backtracking from "safe" rules to "unsafe" rules here.*)
wenzelm@10736
   749
fun slow_step_tac cs i = safe_tac cs ORELSE appWrappers cs
wenzelm@9938
   750
        (inst_step_tac cs APPEND' haz_step_tac cs) i;
clasohm@0
   751
paulson@1800
   752
(**** The following tactics all fail unless they solve one goal ****)
clasohm@0
   753
clasohm@0
   754
(*Dumb but fast*)
wenzelm@10382
   755
fun fast_tac cs =
wenzelm@23594
   756
  ObjectLogic.atomize_prems_tac THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac cs 1));
clasohm@0
   757
clasohm@0
   758
(*Slower but smarter than fast_tac*)
wenzelm@10382
   759
fun best_tac cs =
wenzelm@23594
   760
  ObjectLogic.atomize_prems_tac THEN'
clasohm@0
   761
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (step_tac cs 1));
clasohm@0
   762
oheimb@9402
   763
(*even a bit smarter than best_tac*)
wenzelm@10382
   764
fun first_best_tac cs =
wenzelm@23594
   765
  ObjectLogic.atomize_prems_tac THEN'
oheimb@9402
   766
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (FIRSTGOAL (step_tac cs)));
oheimb@9402
   767
wenzelm@10382
   768
fun slow_tac cs =
wenzelm@23594
   769
  ObjectLogic.atomize_prems_tac THEN'
wenzelm@10382
   770
  SELECT_GOAL (DEPTH_SOLVE (slow_step_tac cs 1));
clasohm@0
   771
wenzelm@10382
   772
fun slow_best_tac cs =
wenzelm@23594
   773
  ObjectLogic.atomize_prems_tac THEN'
clasohm@0
   774
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (slow_step_tac cs 1));
clasohm@0
   775
lcp@681
   776
wenzelm@10736
   777
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*)
wenzelm@10736
   778
val weight_ASTAR = ref 5;
paulson@1587
   779
wenzelm@10382
   780
fun astar_tac cs =
wenzelm@23594
   781
  ObjectLogic.atomize_prems_tac THEN'
wenzelm@10382
   782
  SELECT_GOAL
wenzelm@10382
   783
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev)
wenzelm@10382
   784
      (step_tac cs 1));
paulson@1587
   785
wenzelm@10736
   786
fun slow_astar_tac cs =
wenzelm@23594
   787
  ObjectLogic.atomize_prems_tac THEN'
wenzelm@10382
   788
  SELECT_GOAL
wenzelm@10382
   789
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + !weight_ASTAR * lev)
wenzelm@10382
   790
      (slow_step_tac cs 1));
paulson@1587
   791
paulson@1800
   792
(**** Complete tactic, loosely based upon LeanTaP.  This tactic is the outcome
lcp@747
   793
  of much experimentation!  Changing APPEND to ORELSE below would prove
lcp@747
   794
  easy theorems faster, but loses completeness -- and many of the harder
paulson@1800
   795
  theorems such as 43. ****)
lcp@681
   796
lcp@747
   797
(*Non-deterministic!  Could always expand the first unsafe connective.
lcp@747
   798
  That's hard to implement and did not perform better in experiments, due to
lcp@747
   799
  greater search depth required.*)
wenzelm@10736
   800
fun dup_step_tac (cs as (CS{dup_netpair,...})) =
lcp@681
   801
  biresolve_from_nets_tac dup_netpair;
lcp@681
   802
oheimb@5523
   803
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*)
oheimb@5757
   804
local
wenzelm@10736
   805
fun slow_step_tac' cs = appWrappers cs
wenzelm@9938
   806
        (instp_step_tac cs APPEND' dup_step_tac cs);
wenzelm@10736
   807
in fun depth_tac cs m i state = SELECT_GOAL
wenzelm@10736
   808
   (safe_steps_tac cs 1 THEN_ELSE
wenzelm@9938
   809
        (DEPTH_SOLVE (depth_tac cs m 1),
wenzelm@9938
   810
         inst0_step_tac cs 1 APPEND COND (K (m=0)) no_tac
wenzelm@9938
   811
                (slow_step_tac' cs 1 THEN DEPTH_SOLVE (depth_tac cs (m-1) 1))
oheimb@5757
   812
        )) i state;
oheimb@5757
   813
end;
lcp@747
   814
wenzelm@10736
   815
(*Search, with depth bound m.
paulson@2173
   816
  This is the "entry point", which does safe inferences first.*)
wenzelm@10736
   817
fun safe_depth_tac cs m =
wenzelm@10736
   818
  SUBGOAL
lcp@681
   819
    (fn (prem,i) =>
lcp@681
   820
      let val deti =
wenzelm@9938
   821
          (*No Vars in the goal?  No need to backtrack between goals.*)
wenzelm@9938
   822
          case term_vars prem of
wenzelm@10736
   823
              []        => DETERM
wenzelm@9938
   824
            | _::_      => I
wenzelm@10736
   825
      in  SELECT_GOAL (TRY (safe_tac cs) THEN
wenzelm@9938
   826
                       DEPTH_SOLVE (deti (depth_tac cs m 1))) i
lcp@747
   827
      end);
lcp@681
   828
paulson@2868
   829
fun deepen_tac cs = DEEPEN (2,10) (safe_depth_tac cs);
lcp@681
   830
wenzelm@4079
   831
berghofe@1724
   832
wenzelm@15036
   833
(** context dependent claset components **)
wenzelm@15036
   834
wenzelm@15036
   835
datatype context_cs = ContextCS of
wenzelm@15036
   836
 {swrappers: (string * (Proof.context -> wrapper)) list,
wenzelm@15036
   837
  uwrappers: (string * (Proof.context -> wrapper)) list};
wenzelm@15036
   838
wenzelm@15036
   839
fun context_cs ctxt cs (ContextCS {swrappers, uwrappers}) =
wenzelm@15036
   840
  let
wenzelm@15036
   841
    fun add_wrapper add (name, f) claset = add (claset, (name, f ctxt));
wenzelm@15036
   842
  in
haftmann@22674
   843
    cs
haftmann@22674
   844
    |> fold_rev (add_wrapper (op addSWrapper)) swrappers
wenzelm@15036
   845
    |> fold_rev (add_wrapper (op addWrapper)) uwrappers
wenzelm@15036
   846
  end;
wenzelm@15036
   847
wenzelm@15036
   848
fun make_context_cs (swrappers, uwrappers) =
wenzelm@15036
   849
  ContextCS {swrappers = swrappers, uwrappers = uwrappers};
wenzelm@15036
   850
wenzelm@15036
   851
val empty_context_cs = make_context_cs ([], []);
wenzelm@15036
   852
wenzelm@15036
   853
fun merge_context_cs (ctxt_cs1, ctxt_cs2) =
wenzelm@15036
   854
  let
wenzelm@15036
   855
    val ContextCS {swrappers = swrappers1, uwrappers = uwrappers1} = ctxt_cs1;
wenzelm@15036
   856
    val ContextCS {swrappers = swrappers2, uwrappers = uwrappers2} = ctxt_cs2;
haftmann@22674
   857
    val swrappers' = AList.merge (op =) (K true) (swrappers1, swrappers2);
haftmann@22674
   858
    val uwrappers' = AList.merge (op =) (K true) (uwrappers1, uwrappers2);
wenzelm@15036
   859
  in make_context_cs (swrappers', uwrappers') end;
wenzelm@15036
   860
wenzelm@15036
   861
wenzelm@15036
   862
wenzelm@17880
   863
(** claset data **)
wenzelm@4079
   864
wenzelm@24021
   865
(* global clasets *)
berghofe@1724
   866
wenzelm@16424
   867
structure GlobalClaset = TheoryDataFun
wenzelm@22846
   868
(
wenzelm@15036
   869
  type T = claset ref * context_cs;
wenzelm@15036
   870
  val empty = (ref empty_cs, empty_context_cs);
wenzelm@16424
   871
  fun copy (ref cs, ctxt_cs) = (ref cs, ctxt_cs): T;
wenzelm@16424
   872
  val extend = copy;
wenzelm@16424
   873
  fun merge _ ((ref cs1, ctxt_cs1), (ref cs2, ctxt_cs2)) =
wenzelm@15036
   874
    (ref (merge_cs (cs1, cs2)), merge_context_cs (ctxt_cs1, ctxt_cs2));
wenzelm@22846
   875
);
berghofe@1724
   876
wenzelm@22846
   877
val print_claset = print_cs o ! o #1 o GlobalClaset.get;
wenzelm@17880
   878
val get_claset = ! o #1 o GlobalClaset.get;
wenzelm@17880
   879
wenzelm@15036
   880
val get_context_cs = #2 o GlobalClaset.get o ProofContext.theory_of;
wenzelm@15036
   881
fun map_context_cs f = GlobalClaset.map (apsnd
wenzelm@15036
   882
  (fn ContextCS {swrappers, uwrappers} => make_context_cs (f (swrappers, uwrappers))));
wenzelm@4079
   883
wenzelm@17880
   884
val change_claset_of = change o #1 o GlobalClaset.get;
wenzelm@22095
   885
fun change_claset f = change_claset_of (ML_Context.the_context ()) f;
paulson@1800
   886
wenzelm@18534
   887
fun claset_of thy =
wenzelm@17880
   888
  let val (cs_ref, ctxt_cs) = GlobalClaset.get thy
wenzelm@21516
   889
  in context_cs (ProofContext.init thy) (! cs_ref) (ctxt_cs) end;
wenzelm@22095
   890
val claset = claset_of o ML_Context.the_context;
wenzelm@4079
   891
wenzelm@17880
   892
fun CLASET tacf st = tacf (claset_of (Thm.theory_of_thm st)) st;
wenzelm@17880
   893
fun CLASET' tacf i st = tacf (claset_of (Thm.theory_of_thm st)) i st;
berghofe@1724
   894
wenzelm@17880
   895
fun AddDs args = change_claset (fn cs => cs addDs args);
wenzelm@17880
   896
fun AddEs args = change_claset (fn cs => cs addEs args);
wenzelm@17880
   897
fun AddIs args = change_claset (fn cs => cs addIs args);
wenzelm@17880
   898
fun AddSDs args = change_claset (fn cs => cs addSDs args);
wenzelm@17880
   899
fun AddSEs args = change_claset (fn cs => cs addSEs args);
wenzelm@17880
   900
fun AddSIs args = change_claset (fn cs => cs addSIs args);
wenzelm@17880
   901
fun Delrules args = change_claset (fn cs => cs delrules args);
paulson@3727
   902
wenzelm@4079
   903
wenzelm@15036
   904
(* context dependent components *)
wenzelm@15036
   905
haftmann@22674
   906
fun add_context_safe_wrapper wrapper = (map_context_cs o apfst)
haftmann@22674
   907
  (AList.update (op =) wrapper);
haftmann@22674
   908
fun del_context_safe_wrapper name = (map_context_cs o apfst)
haftmann@22674
   909
  (AList.delete (op =) name);
wenzelm@15036
   910
haftmann@22674
   911
fun add_context_unsafe_wrapper wrapper = (map_context_cs o apsnd)
haftmann@22674
   912
  (AList.update (op =) wrapper);
haftmann@22674
   913
fun del_context_unsafe_wrapper name = (map_context_cs o apsnd)
haftmann@22674
   914
  (AList.delete (op =) name);
wenzelm@15036
   915
wenzelm@15036
   916
wenzelm@24021
   917
(* local clasets *)
wenzelm@5841
   918
wenzelm@16424
   919
structure LocalClaset = ProofDataFun
wenzelm@22846
   920
(
wenzelm@5841
   921
  type T = claset;
wenzelm@17880
   922
  val init = get_claset;
wenzelm@22846
   923
);
wenzelm@5841
   924
wenzelm@5841
   925
val get_local_claset = LocalClaset.get;
wenzelm@5841
   926
val put_local_claset = LocalClaset.put;
wenzelm@5841
   927
wenzelm@15036
   928
fun local_claset_of ctxt =
wenzelm@15036
   929
  context_cs ctxt (get_local_claset ctxt) (get_context_cs ctxt);
wenzelm@15036
   930
wenzelm@22846
   931
val print_local_claset = print_cs o local_claset_of;
wenzelm@22846
   932
wenzelm@5841
   933
wenzelm@24021
   934
(* generic clasets *)
wenzelm@24021
   935
wenzelm@24021
   936
fun get_cs (Context.Theory thy) = claset_of thy
wenzelm@24021
   937
  | get_cs (Context.Proof ctxt) = local_claset_of ctxt;
wenzelm@24021
   938
wenzelm@24021
   939
fun map_cs f (Context.Theory thy) = (change_claset_of thy f; Context.Theory thy)
wenzelm@24021
   940
  | map_cs f (Context.Proof ctxt) = Context.Proof (LocalClaset.map f ctxt);
wenzelm@24021
   941
wenzelm@24021
   942
wenzelm@5885
   943
(* attributes *)
wenzelm@5885
   944
wenzelm@18728
   945
fun attrib f = Thm.declaration_attribute (fn th =>
wenzelm@18691
   946
   fn Context.Theory thy => (change_claset_of thy (f th); Context.Theory thy)
wenzelm@18691
   947
    | Context.Proof ctxt => Context.Proof (LocalClaset.map (f th) ctxt));
wenzelm@5885
   948
paulson@21689
   949
fun safe_dest w = attrib (addSE w o make_elim);
wenzelm@18691
   950
val safe_elim = attrib o addSE;
wenzelm@18691
   951
val safe_intro = attrib o addSI;
paulson@21689
   952
fun haz_dest w = attrib (addE w o make_elim);
wenzelm@18691
   953
val haz_elim = attrib o addE;
wenzelm@18691
   954
val haz_intro = attrib o addI;
wenzelm@18691
   955
val rule_del = attrib delrule o ContextRules.rule_del;
wenzelm@5885
   956
wenzelm@5885
   957
wenzelm@4079
   958
(* tactics referring to the implicit claset *)
paulson@1800
   959
wenzelm@4079
   960
(*the abstraction over the proof state delays the dereferencing*)
wenzelm@9938
   961
fun Safe_tac st           = safe_tac (claset()) st;
wenzelm@9938
   962
fun Safe_step_tac i st    = safe_step_tac (claset()) i st;
wenzelm@4079
   963
fun Clarify_step_tac i st = clarify_step_tac (claset()) i st;
wenzelm@9938
   964
fun Clarify_tac i st      = clarify_tac (claset()) i st;
wenzelm@9938
   965
fun Step_tac i st         = step_tac (claset()) i st;
wenzelm@9938
   966
fun Fast_tac i st         = fast_tac (claset()) i st;
wenzelm@9938
   967
fun Best_tac i st         = best_tac (claset()) i st;
wenzelm@9938
   968
fun Slow_tac i st         = slow_tac (claset()) i st;
wenzelm@9938
   969
fun Slow_best_tac i st    = slow_best_tac (claset()) i st;
wenzelm@9938
   970
fun Deepen_tac m          = deepen_tac (claset()) m;
paulson@2066
   971
paulson@1800
   972
wenzelm@10736
   973
end;
wenzelm@5841
   974
wenzelm@5841
   975
wenzelm@5841
   976
wenzelm@5885
   977
(** concrete syntax of attributes **)
wenzelm@5841
   978
wenzelm@5841
   979
val introN = "intro";
wenzelm@5841
   980
val elimN = "elim";
wenzelm@5841
   981
val destN = "dest";
wenzelm@9938
   982
val ruleN = "rule";
wenzelm@5841
   983
wenzelm@5841
   984
val setup_attrs = Attrib.add_attributes
wenzelm@18728
   985
 [("swapped", swapped, "classical swap of introduction rule"),
wenzelm@18728
   986
  (destN, ContextRules.add_args safe_dest haz_dest ContextRules.dest_query,
wenzelm@18688
   987
    "declaration of Classical destruction rule"),
wenzelm@18728
   988
  (elimN, ContextRules.add_args safe_elim haz_elim ContextRules.elim_query,
wenzelm@18688
   989
    "declaration of Classical elimination rule"),
wenzelm@18728
   990
  (introN, ContextRules.add_args safe_intro haz_intro ContextRules.intro_query,
wenzelm@18688
   991
    "declaration of Classical introduction rule"),
wenzelm@18728
   992
  (ruleN, Attrib.syntax (Scan.lift Args.del >> K rule_del),
wenzelm@12376
   993
    "remove declaration of intro/elim/dest rule")];
wenzelm@5841
   994
wenzelm@5841
   995
wenzelm@5841
   996
wenzelm@7230
   997
(** proof methods **)
wenzelm@7230
   998
wenzelm@14605
   999
fun METHOD_CLASET tac ctxt =
wenzelm@15036
  1000
  Method.METHOD (tac ctxt (local_claset_of ctxt));
wenzelm@5841
  1001
wenzelm@8098
  1002
fun METHOD_CLASET' tac ctxt =
wenzelm@15036
  1003
  Method.METHOD (HEADGOAL o tac ctxt (local_claset_of ctxt));
wenzelm@7230
  1004
wenzelm@7230
  1005
wenzelm@7230
  1006
local
wenzelm@7230
  1007
wenzelm@12376
  1008
fun some_rule_tac ctxt (CS {xtra_netpair, ...}) facts = SUBGOAL (fn (goal, i) =>
wenzelm@5841
  1009
  let
wenzelm@12401
  1010
    val [rules1, rules2, rules4] = ContextRules.find_rules false facts goal ctxt;
wenzelm@12401
  1011
    val rules3 = ContextRules.find_rules_netpair true facts goal xtra_netpair;
wenzelm@12376
  1012
    val rules = rules1 @ rules2 @ rules3 @ rules4;
wenzelm@18223
  1013
    val ruleq = Drule.multi_resolves facts rules;
wenzelm@12376
  1014
  in
wenzelm@12376
  1015
    Method.trace ctxt rules;
wenzelm@12376
  1016
    fn st => Seq.flat (Seq.map (fn rule => Tactic.rtac rule i st) ruleq)
wenzelm@18834
  1017
  end)
wenzelm@21687
  1018
  THEN_ALL_NEW Goal.norm_hhf_tac;
wenzelm@5841
  1019
wenzelm@12376
  1020
fun rule_tac [] ctxt cs facts = some_rule_tac ctxt cs facts
wenzelm@10394
  1021
  | rule_tac rules _ _ facts = Method.rule_tac rules facts;
wenzelm@7281
  1022
wenzelm@10382
  1023
fun default_tac rules ctxt cs facts =
wenzelm@14605
  1024
  HEADGOAL (rule_tac rules ctxt cs facts) ORELSE
haftmann@19110
  1025
  ClassPackage.default_intro_classes_tac facts;
wenzelm@10309
  1026
wenzelm@7230
  1027
in
wenzelm@7281
  1028
  val rule = METHOD_CLASET' o rule_tac;
wenzelm@14605
  1029
  val default = METHOD_CLASET o default_tac;
wenzelm@7230
  1030
end;
wenzelm@5841
  1031
wenzelm@5841
  1032
wenzelm@7230
  1033
(* contradiction method *)
wenzelm@6502
  1034
wenzelm@7425
  1035
val contradiction = Method.rule [Data.not_elim, Data.not_elim COMP Drule.swap_prems_rl];
wenzelm@6502
  1036
wenzelm@6502
  1037
wenzelm@6502
  1038
(* automatic methods *)
wenzelm@5841
  1039
wenzelm@5927
  1040
val cla_modifiers =
wenzelm@18728
  1041
 [Args.$$$ destN -- Args.bang_colon >> K ((I, safe_dest NONE): Method.modifier),
wenzelm@18728
  1042
  Args.$$$ destN -- Args.colon >> K (I, haz_dest NONE),
wenzelm@18728
  1043
  Args.$$$ elimN -- Args.bang_colon >> K (I, safe_elim NONE),
wenzelm@18728
  1044
  Args.$$$ elimN -- Args.colon >> K (I, haz_elim NONE),
wenzelm@18728
  1045
  Args.$$$ introN -- Args.bang_colon >> K (I, safe_intro NONE),
wenzelm@18728
  1046
  Args.$$$ introN -- Args.colon >> K (I, haz_intro NONE),
wenzelm@18728
  1047
  Args.del -- Args.colon >> K (I, rule_del)];
wenzelm@5927
  1048
wenzelm@7559
  1049
fun cla_meth tac prems ctxt = Method.METHOD (fn facts =>
wenzelm@15036
  1050
  ALLGOALS (Method.insert_tac (prems @ facts)) THEN tac (local_claset_of ctxt));
wenzelm@7132
  1051
wenzelm@7559
  1052
fun cla_meth' tac prems ctxt = Method.METHOD (fn facts =>
wenzelm@15036
  1053
  HEADGOAL (Method.insert_tac (prems @ facts) THEN' tac (local_claset_of ctxt)));
wenzelm@5841
  1054
wenzelm@7559
  1055
val cla_method = Method.bang_sectioned_args cla_modifiers o cla_meth;
wenzelm@7559
  1056
val cla_method' = Method.bang_sectioned_args cla_modifiers o cla_meth';
wenzelm@5841
  1057
wenzelm@5841
  1058
wenzelm@5841
  1059
wenzelm@5841
  1060
(** setup_methods **)
wenzelm@5841
  1061
wenzelm@5841
  1062
val setup_methods = Method.add_methods
wenzelm@12376
  1063
 [("default", Method.thms_ctxt_args default, "apply some intro/elim rule (potentially classical)"),
wenzelm@12376
  1064
  ("rule", Method.thms_ctxt_args rule, "apply some intro/elim rule (potentially classical)"),
wenzelm@6502
  1065
  ("contradiction", Method.no_args contradiction, "proof by contradiction"),
wenzelm@10821
  1066
  ("clarify", cla_method' (CHANGED_PROP oo clarify_tac), "repeatedly apply safe steps"),
wenzelm@7004
  1067
  ("fast", cla_method' fast_tac, "classical prover (depth-first)"),
wenzelm@9806
  1068
  ("slow", cla_method' slow_tac, "classical prover (slow depth-first)"),
wenzelm@9773
  1069
  ("best", cla_method' best_tac, "classical prover (best-first)"),
berghofe@18015
  1070
  ("deepen", cla_method' (fn cs => deepen_tac cs 4), "classical prover (iterative deepening)"),
wenzelm@10821
  1071
  ("safe", cla_method (CHANGED_PROP o safe_tac), "classical prover (apply safe rules)")];
wenzelm@5841
  1072
wenzelm@5841
  1073
wenzelm@5841
  1074
wenzelm@5841
  1075
(** theory setup **)
wenzelm@5841
  1076
wenzelm@22846
  1077
val setup = GlobalClaset.init #> setup_attrs #> setup_methods;
wenzelm@5841
  1078
wenzelm@5841
  1079
wenzelm@8667
  1080
wenzelm@8667
  1081
(** outer syntax **)
wenzelm@8667
  1082
wenzelm@8667
  1083
val print_clasetP =
wenzelm@8667
  1084
  OuterSyntax.improper_command "print_claset" "print context of Classical Reasoner"
wenzelm@17057
  1085
    OuterKeyword.diag
wenzelm@9513
  1086
    (Scan.succeed (Toplevel.no_timing o Toplevel.unknown_context o (Toplevel.keep
wenzelm@20956
  1087
      (Toplevel.node_case
wenzelm@20956
  1088
        (Context.cases print_claset print_local_claset)
wenzelm@20956
  1089
        (print_local_claset o Proof.context_of)))));
wenzelm@8667
  1090
wenzelm@8667
  1091
val _ = OuterSyntax.add_parsers [print_clasetP];
wenzelm@8667
  1092
wenzelm@8667
  1093
wenzelm@5841
  1094
end;