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