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