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