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