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