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