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