src/Provers/classical.ML
author wenzelm
Sat Mar 30 13:40:19 2013 +0100 (2013-03-30)
changeset 51584 98029ceda8ce
parent 51580 64ef8260dc60
child 51658 21c10672633b
permissions -rw-r--r--
more item markup;
tuned signature;
wenzelm@9938
     1
(*  Title:      Provers/classical.ML
wenzelm@9938
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
clasohm@0
     3
clasohm@0
     4
Theorem prover for classical reasoning, including predicate calculus, set
clasohm@0
     5
theory, etc.
clasohm@0
     6
wenzelm@9563
     7
Rules must be classified as intro, elim, safe, hazardous (unsafe).
clasohm@0
     8
clasohm@0
     9
A rule is unsafe unless it can be applied blindly without harmful results.
clasohm@0
    10
For a rule to be safe, its premises and conclusion should be logically
clasohm@0
    11
equivalent.  There should be no variables in the premises that are not in
clasohm@0
    12
the conclusion.
clasohm@0
    13
*)
clasohm@0
    14
wenzelm@4079
    15
(*higher precedence than := facilitates use of references*)
wenzelm@12376
    16
infix 4 addSIs addSEs addSDs addIs addEs addDs delrules
oheimb@4651
    17
  addSWrapper delSWrapper addWrapper delWrapper
oheimb@11181
    18
  addSbefore addSafter addbefore addafter
oheimb@5523
    19
  addD2 addE2 addSD2 addSE2;
wenzelm@4079
    20
clasohm@0
    21
signature CLASSICAL_DATA =
wenzelm@4079
    22
sig
wenzelm@42790
    23
  val imp_elim: thm  (* P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R *)
wenzelm@42790
    24
  val not_elim: thm  (* ~P ==> P ==> R *)
wenzelm@42790
    25
  val swap: thm  (* ~ P ==> (~ R ==> P) ==> R *)
wenzelm@42790
    26
  val classical: thm  (* (~ P ==> P) ==> P *)
wenzelm@50062
    27
  val sizef: thm -> int  (* size function for BEST_FIRST, typically size_of_thm *)
wenzelm@50062
    28
  val hyp_subst_tacs: (int -> tactic) list (* optional tactics for substitution in
wenzelm@50062
    29
    the hypotheses; assumed to be safe! *)
wenzelm@4079
    30
end;
clasohm@0
    31
wenzelm@5841
    32
signature BASIC_CLASSICAL =
wenzelm@4079
    33
sig
wenzelm@42812
    34
  type wrapper = (int -> tactic) -> int -> tactic
clasohm@0
    35
  type claset
wenzelm@42793
    36
  val print_claset: Proof.context -> unit
wenzelm@42793
    37
  val addDs: Proof.context * thm list -> Proof.context
wenzelm@42793
    38
  val addEs: Proof.context * thm list -> Proof.context
wenzelm@42793
    39
  val addIs: Proof.context * thm list -> Proof.context
wenzelm@42793
    40
  val addSDs: Proof.context * thm list -> Proof.context
wenzelm@42793
    41
  val addSEs: Proof.context * thm list -> Proof.context
wenzelm@42793
    42
  val addSIs: Proof.context * thm list -> Proof.context
wenzelm@42793
    43
  val delrules: Proof.context * thm list -> Proof.context
wenzelm@42793
    44
  val addSWrapper: claset * (string * (Proof.context -> wrapper)) -> claset
wenzelm@42790
    45
  val delSWrapper: claset *  string -> claset
wenzelm@42793
    46
  val addWrapper: claset * (string * (Proof.context -> wrapper)) -> claset
wenzelm@42790
    47
  val delWrapper: claset *  string -> claset
wenzelm@42790
    48
  val addSbefore: claset * (string * (int -> tactic)) -> claset
wenzelm@42790
    49
  val addSafter: claset * (string * (int -> tactic)) -> claset
wenzelm@42790
    50
  val addbefore: claset * (string * (int -> tactic)) -> claset
wenzelm@42790
    51
  val addafter: claset * (string * (int -> tactic)) -> claset
wenzelm@42790
    52
  val addD2: claset * (string * thm) -> claset
wenzelm@42790
    53
  val addE2: claset * (string * thm) -> claset
wenzelm@42790
    54
  val addSD2: claset * (string * thm) -> claset
wenzelm@42790
    55
  val addSE2: claset * (string * thm) -> claset
wenzelm@42793
    56
  val appSWrappers: Proof.context -> wrapper
wenzelm@42793
    57
  val appWrappers: Proof.context -> wrapper
lcp@982
    58
wenzelm@42790
    59
  val global_claset_of: theory -> claset
wenzelm@42790
    60
  val claset_of: Proof.context -> claset
wenzelm@42793
    61
  val map_claset: (claset -> claset) -> Proof.context -> Proof.context
wenzelm@42793
    62
  val put_claset: claset -> Proof.context -> Proof.context
wenzelm@4079
    63
wenzelm@42793
    64
  val fast_tac: Proof.context -> int -> tactic
wenzelm@42793
    65
  val slow_tac: Proof.context -> int -> tactic
wenzelm@42793
    66
  val astar_tac: Proof.context -> int -> tactic
wenzelm@42793
    67
  val slow_astar_tac: Proof.context -> int -> tactic
wenzelm@42793
    68
  val best_tac: Proof.context -> int -> tactic
wenzelm@42793
    69
  val first_best_tac: Proof.context -> int -> tactic
wenzelm@42793
    70
  val slow_best_tac: Proof.context -> int -> tactic
wenzelm@42793
    71
  val depth_tac: Proof.context -> int -> int -> tactic
wenzelm@42793
    72
  val deepen_tac: Proof.context -> int -> int -> tactic
paulson@1587
    73
wenzelm@42790
    74
  val contr_tac: int -> tactic
wenzelm@42790
    75
  val dup_elim: thm -> thm
wenzelm@42790
    76
  val dup_intr: thm -> thm
wenzelm@42793
    77
  val dup_step_tac: Proof.context -> int -> tactic
wenzelm@42790
    78
  val eq_mp_tac: int -> tactic
wenzelm@42793
    79
  val haz_step_tac: Proof.context -> int -> tactic
wenzelm@42790
    80
  val joinrules: thm list * thm list -> (bool * thm) list
wenzelm@42790
    81
  val mp_tac: int -> tactic
wenzelm@42793
    82
  val safe_tac: Proof.context -> tactic
wenzelm@42793
    83
  val safe_steps_tac: Proof.context -> int -> tactic
wenzelm@42793
    84
  val safe_step_tac: Proof.context -> int -> tactic
wenzelm@42793
    85
  val clarify_tac: Proof.context -> int -> tactic
wenzelm@42793
    86
  val clarify_step_tac: Proof.context -> int -> tactic
wenzelm@42793
    87
  val step_tac: Proof.context -> int -> tactic
wenzelm@42793
    88
  val slow_step_tac: Proof.context -> int -> tactic
wenzelm@42790
    89
  val swapify: thm list -> thm list
wenzelm@42790
    90
  val swap_res_tac: thm list -> int -> tactic
wenzelm@42793
    91
  val inst_step_tac: Proof.context -> int -> tactic
wenzelm@42793
    92
  val inst0_step_tac: Proof.context -> int -> tactic
wenzelm@42793
    93
  val instp_step_tac: Proof.context -> int -> tactic
wenzelm@4079
    94
end;
berghofe@1724
    95
wenzelm@5841
    96
signature CLASSICAL =
wenzelm@5841
    97
sig
wenzelm@5841
    98
  include BASIC_CLASSICAL
wenzelm@18534
    99
  val classical_rule: thm -> thm
wenzelm@42812
   100
  type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net
wenzelm@42812
   101
  val rep_cs: claset ->
wenzelm@42812
   102
   {safeIs: thm Item_Net.T,
wenzelm@42812
   103
    safeEs: thm Item_Net.T,
wenzelm@42812
   104
    hazIs: thm Item_Net.T,
wenzelm@42812
   105
    hazEs: thm Item_Net.T,
wenzelm@42812
   106
    swrappers: (string * (Proof.context -> wrapper)) list,
wenzelm@42812
   107
    uwrappers: (string * (Proof.context -> wrapper)) list,
wenzelm@42812
   108
    safe0_netpair: netpair,
wenzelm@42812
   109
    safep_netpair: netpair,
wenzelm@42812
   110
    haz_netpair: netpair,
wenzelm@42812
   111
    dup_netpair: netpair,
wenzelm@42812
   112
    xtra_netpair: Context_Rules.netpair}
wenzelm@24021
   113
  val get_cs: Context.generic -> claset
wenzelm@24021
   114
  val map_cs: (claset -> claset) -> Context.generic -> Context.generic
wenzelm@18728
   115
  val safe_dest: int option -> attribute
wenzelm@18728
   116
  val safe_elim: int option -> attribute
wenzelm@18728
   117
  val safe_intro: int option -> attribute
wenzelm@18728
   118
  val haz_dest: int option -> attribute
wenzelm@18728
   119
  val haz_elim: int option -> attribute
wenzelm@18728
   120
  val haz_intro: int option -> attribute
wenzelm@18728
   121
  val rule_del: attribute
wenzelm@30513
   122
  val cla_modifiers: Method.modifier parser list
wenzelm@42793
   123
  val cla_method:
wenzelm@42793
   124
    (Proof.context -> tactic) -> (Proof.context -> Proof.method) context_parser
wenzelm@42793
   125
  val cla_method':
wenzelm@42793
   126
    (Proof.context -> int -> tactic) -> (Proof.context -> Proof.method) context_parser
wenzelm@18708
   127
  val setup: theory -> theory
wenzelm@5841
   128
end;
wenzelm@5841
   129
clasohm@0
   130
wenzelm@42799
   131
functor Classical(Data: CLASSICAL_DATA): CLASSICAL =
clasohm@0
   132
struct
clasohm@0
   133
wenzelm@18534
   134
(** classical elimination rules **)
wenzelm@18534
   135
wenzelm@18534
   136
(*
wenzelm@18534
   137
Classical reasoning requires stronger elimination rules.  For
wenzelm@18534
   138
instance, make_elim of Pure transforms the HOL rule injD into
wenzelm@18534
   139
wenzelm@18534
   140
    [| inj f; f x = f y; x = y ==> PROP W |] ==> PROP W
wenzelm@18534
   141
wenzelm@26938
   142
Such rules can cause fast_tac to fail and blast_tac to report "PROOF
wenzelm@18534
   143
FAILED"; classical_rule will strenthen this to
wenzelm@18534
   144
wenzelm@18534
   145
    [| inj f; ~ W ==> f x = f y; x = y ==> W |] ==> W
wenzelm@18534
   146
*)
wenzelm@18534
   147
wenzelm@18534
   148
fun classical_rule rule =
wenzelm@41581
   149
  if is_some (Object_Logic.elim_concl rule) then
wenzelm@18534
   150
    let
wenzelm@42792
   151
      val rule' = rule RS Data.classical;
wenzelm@18534
   152
      val concl' = Thm.concl_of rule';
wenzelm@18534
   153
      fun redundant_hyp goal =
wenzelm@19257
   154
        concl' aconv Logic.strip_assums_concl goal orelse
wenzelm@18534
   155
          (case Logic.strip_assums_hyp goal of
wenzelm@18534
   156
            hyp :: hyps => exists (fn t => t aconv hyp) hyps
wenzelm@18534
   157
          | _ => false);
wenzelm@18534
   158
      val rule'' =
wenzelm@18534
   159
        rule' |> ALLGOALS (SUBGOAL (fn (goal, i) =>
wenzelm@18534
   160
          if i = 1 orelse redundant_hyp goal
wenzelm@18534
   161
          then Tactic.etac thin_rl i
wenzelm@18534
   162
          else all_tac))
wenzelm@18534
   163
        |> Seq.hd
wenzelm@21963
   164
        |> Drule.zero_var_indexes;
wenzelm@22360
   165
    in if Thm.equiv_thm (rule, rule'') then rule else rule'' end
wenzelm@18534
   166
  else rule;
wenzelm@18534
   167
wenzelm@23594
   168
(*flatten nested meta connectives in prems*)
wenzelm@35625
   169
val flat_rule = Conv.fconv_rule (Conv.prems_conv ~1 Object_Logic.atomize_prems);
wenzelm@18534
   170
wenzelm@18534
   171
paulson@1800
   172
(*** Useful tactics for classical reasoning ***)
clasohm@0
   173
wenzelm@10736
   174
(*Prove goal that assumes both P and ~P.
paulson@4392
   175
  No backtracking if it finds an equal assumption.  Perhaps should call
paulson@4392
   176
  ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*)
wenzelm@42792
   177
val contr_tac =
wenzelm@42792
   178
  eresolve_tac [Data.not_elim] THEN' (eq_assume_tac ORELSE' assume_tac);
clasohm@0
   179
lcp@681
   180
(*Finds P-->Q and P in the assumptions, replaces implication by Q.
lcp@681
   181
  Could do the same thing for P<->Q and P... *)
wenzelm@42792
   182
fun mp_tac i = eresolve_tac [Data.not_elim, Data.imp_elim] i THEN assume_tac i;
clasohm@0
   183
clasohm@0
   184
(*Like mp_tac but instantiates no variables*)
wenzelm@42792
   185
fun eq_mp_tac i = ematch_tac [Data.not_elim, Data.imp_elim] i THEN eq_assume_tac i;
clasohm@0
   186
clasohm@0
   187
(*Creates rules to eliminate ~A, from rules to introduce A*)
wenzelm@26412
   188
fun swapify intrs = intrs RLN (2, [Data.swap]);
wenzelm@30528
   189
val swapped = Thm.rule_attribute (fn _ => fn th => th RSN (2, Data.swap));
clasohm@0
   190
clasohm@0
   191
(*Uses introduction rules in the normal way, or on negated assumptions,
clasohm@0
   192
  trying rules in order. *)
wenzelm@10736
   193
fun swap_res_tac rls =
wenzelm@42792
   194
  let fun addrl rl brls = (false, rl) :: (true, rl RSN (2, Data.swap)) :: brls in
wenzelm@42792
   195
    assume_tac ORELSE'
wenzelm@42792
   196
    contr_tac ORELSE'
wenzelm@42792
   197
    biresolve_tac (fold_rev addrl rls [])
wenzelm@42792
   198
  end;
clasohm@0
   199
lcp@681
   200
(*Duplication of hazardous rules, for complete provers*)
wenzelm@42792
   201
fun dup_intr th = zero_var_indexes (th RS Data.classical);
lcp@681
   202
wenzelm@42793
   203
fun dup_elim th =  (* FIXME proper context!? *)
wenzelm@36546
   204
  let
wenzelm@36546
   205
    val rl = (th RSN (2, revcut_rl)) |> Thm.assumption 2 |> Seq.hd;
wenzelm@42361
   206
    val ctxt = Proof_Context.init_global (Thm.theory_of_thm rl);
wenzelm@36546
   207
  in rule_by_tactic ctxt (TRYALL (etac revcut_rl)) rl end;
wenzelm@36546
   208
lcp@1073
   209
paulson@1800
   210
(**** Classical rule sets ****)
clasohm@0
   211
wenzelm@42812
   212
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net;
wenzelm@42812
   213
type wrapper = (int -> tactic) -> int -> tactic;
wenzelm@42812
   214
clasohm@0
   215
datatype claset =
wenzelm@42793
   216
  CS of
wenzelm@42810
   217
   {safeIs         : thm Item_Net.T,          (*safe introduction rules*)
wenzelm@42810
   218
    safeEs         : thm Item_Net.T,          (*safe elimination rules*)
wenzelm@42810
   219
    hazIs          : thm Item_Net.T,          (*unsafe introduction rules*)
wenzelm@42810
   220
    hazEs          : thm Item_Net.T,          (*unsafe elimination rules*)
wenzelm@42793
   221
    swrappers      : (string * (Proof.context -> wrapper)) list, (*for transforming safe_step_tac*)
wenzelm@42793
   222
    uwrappers      : (string * (Proof.context -> wrapper)) list, (*for transforming step_tac*)
wenzelm@42793
   223
    safe0_netpair  : netpair,                 (*nets for trivial cases*)
wenzelm@42793
   224
    safep_netpair  : netpair,                 (*nets for >0 subgoals*)
wenzelm@42793
   225
    haz_netpair    : netpair,                 (*nets for unsafe rules*)
wenzelm@42793
   226
    dup_netpair    : netpair,                 (*nets for duplication*)
wenzelm@42793
   227
    xtra_netpair   : Context_Rules.netpair};  (*nets for extra rules*)
clasohm@0
   228
lcp@1073
   229
(*Desired invariants are
wenzelm@9938
   230
        safe0_netpair = build safe0_brls,
wenzelm@9938
   231
        safep_netpair = build safep_brls,
wenzelm@9938
   232
        haz_netpair = build (joinrules(hazIs, hazEs)),
wenzelm@10736
   233
        dup_netpair = build (joinrules(map dup_intr hazIs,
wenzelm@12376
   234
                                       map dup_elim hazEs))
lcp@1073
   235
wenzelm@10736
   236
where build = build_netpair(Net.empty,Net.empty),
lcp@1073
   237
      safe0_brls contains all brules that solve the subgoal, and
lcp@1073
   238
      safep_brls contains all brules that generate 1 or more new subgoals.
wenzelm@4079
   239
The theorem lists are largely comments, though they are used in merge_cs and print_cs.
lcp@1073
   240
Nets must be built incrementally, to save space and time.
lcp@1073
   241
*)
clasohm@0
   242
wenzelm@6502
   243
val empty_netpair = (Net.empty, Net.empty);
wenzelm@6502
   244
wenzelm@10736
   245
val empty_cs =
wenzelm@42793
   246
  CS
wenzelm@42810
   247
   {safeIs = Thm.full_rules,
wenzelm@42810
   248
    safeEs = Thm.full_rules,
wenzelm@42810
   249
    hazIs = Thm.full_rules,
wenzelm@42810
   250
    hazEs = Thm.full_rules,
wenzelm@42793
   251
    swrappers = [],
wenzelm@42793
   252
    uwrappers = [],
wenzelm@42793
   253
    safe0_netpair = empty_netpair,
wenzelm@42793
   254
    safep_netpair = empty_netpair,
wenzelm@42793
   255
    haz_netpair = empty_netpair,
wenzelm@42793
   256
    dup_netpair = empty_netpair,
wenzelm@42793
   257
    xtra_netpair = empty_netpair};
clasohm@0
   258
oheimb@4653
   259
fun rep_cs (CS args) = args;
lcp@1073
   260
wenzelm@4079
   261
paulson@1800
   262
(*** Adding (un)safe introduction or elimination rules.
lcp@1073
   263
lcp@1073
   264
    In case of overlap, new rules are tried BEFORE old ones!!
paulson@1800
   265
***)
clasohm@0
   266
wenzelm@12376
   267
(*For use with biresolve_tac.  Combines intro rules with swap to handle negated
lcp@1073
   268
  assumptions.  Pairs elim rules with true. *)
wenzelm@12376
   269
fun joinrules (intrs, elims) =
paulson@18557
   270
  (map (pair true) (elims @ swapify intrs)) @ map (pair false) intrs;
wenzelm@12376
   271
wenzelm@12401
   272
fun joinrules' (intrs, elims) =
paulson@18557
   273
  map (pair true) elims @ map (pair false) intrs;
lcp@1073
   274
wenzelm@10736
   275
(*Priority: prefer rules with fewest subgoals,
paulson@1231
   276
  then rules added most recently (preferring the head of the list).*)
lcp@1073
   277
fun tag_brls k [] = []
lcp@1073
   278
  | tag_brls k (brl::brls) =
wenzelm@10736
   279
      (1000000*subgoals_of_brl brl + k, brl) ::
lcp@1073
   280
      tag_brls (k+1) brls;
lcp@1073
   281
wenzelm@12401
   282
fun tag_brls' _ _ [] = []
wenzelm@12401
   283
  | tag_brls' w k (brl::brls) = ((w, k), brl) :: tag_brls' w (k + 1) brls;
wenzelm@10736
   284
wenzelm@23178
   285
fun insert_tagged_list rls = fold_rev Tactic.insert_tagged_brl rls;
lcp@1073
   286
lcp@1073
   287
(*Insert into netpair that already has nI intr rules and nE elim rules.
lcp@1073
   288
  Count the intr rules double (to account for swapify).  Negate to give the
lcp@1073
   289
  new insertions the lowest priority.*)
wenzelm@12376
   290
fun insert (nI, nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules;
wenzelm@12401
   291
fun insert' w (nI, nE) = insert_tagged_list o tag_brls' w (~(nI + nE)) o joinrules';
lcp@1073
   292
wenzelm@23178
   293
fun delete_tagged_list rls = fold_rev Tactic.delete_tagged_brl rls;
wenzelm@12362
   294
fun delete x = delete_tagged_list (joinrules x);
wenzelm@12401
   295
fun delete' x = delete_tagged_list (joinrules' x);
paulson@1800
   296
wenzelm@42793
   297
fun string_of_thm NONE = Display.string_of_thm_without_context
wenzelm@42817
   298
  | string_of_thm (SOME context) = Display.string_of_thm (Context.proof_of context);
wenzelm@42793
   299
wenzelm@42793
   300
fun make_elim context th =
wenzelm@42793
   301
  if has_fewer_prems 1 th then
wenzelm@42793
   302
    error ("Ill-formed destruction rule\n" ^ string_of_thm context th)
wenzelm@42793
   303
  else Tactic.make_elim th;
wenzelm@42790
   304
wenzelm@46874
   305
fun warn_thm opt_context msg th =
wenzelm@46874
   306
  if (case opt_context of SOME context => Context_Position.is_visible_proof context | NONE => false)
wenzelm@46874
   307
  then warning (msg ^ string_of_thm opt_context th)
wenzelm@42807
   308
  else ();
wenzelm@42793
   309
wenzelm@42807
   310
fun warn_rules context msg rules th =
wenzelm@42810
   311
  Item_Net.member rules th andalso (warn_thm context msg th; true);
wenzelm@42807
   312
wenzelm@42807
   313
fun warn_claset context th (CS {safeIs, safeEs, hazIs, hazEs, ...}) =
wenzelm@42807
   314
  warn_rules context "Rule already declared as safe introduction (intro!)\n" safeIs th orelse
wenzelm@42807
   315
  warn_rules context "Rule already declared as safe elimination (elim!)\n" safeEs th orelse
wenzelm@42807
   316
  warn_rules context "Rule already declared as introduction (intro)\n" hazIs th orelse
wenzelm@42807
   317
  warn_rules context "Rule already declared as elimination (elim)\n" hazEs th;
paulson@1927
   318
wenzelm@12376
   319
paulson@1800
   320
(*** Safe rules ***)
lcp@982
   321
wenzelm@42793
   322
fun addSI w context th
wenzelm@42790
   323
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@42790
   324
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@42807
   325
  if warn_rules context "Ignoring duplicate safe introduction (intro!)\n" safeIs th then cs
paulson@1927
   326
  else
wenzelm@42790
   327
    let
wenzelm@42790
   328
      val th' = flat_rule th;
wenzelm@23594
   329
      val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
wenzelm@42790
   330
        List.partition Thm.no_prems [th'];
wenzelm@42810
   331
      val nI = Item_Net.length safeIs + 1;
wenzelm@42810
   332
      val nE = Item_Net.length safeEs;
wenzelm@42807
   333
      val _ = warn_claset context th cs;
wenzelm@42790
   334
    in
wenzelm@42790
   335
      CS
wenzelm@42810
   336
       {safeIs = Item_Net.update th safeIs,
lcp@1073
   337
        safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair,
wenzelm@9938
   338
        safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair,
wenzelm@42790
   339
        safeEs = safeEs,
wenzelm@42790
   340
        hazIs = hazIs,
wenzelm@42790
   341
        hazEs = hazEs,
wenzelm@42790
   342
        swrappers = swrappers,
wenzelm@42790
   343
        uwrappers = uwrappers,
wenzelm@42790
   344
        haz_netpair = haz_netpair,
wenzelm@42790
   345
        dup_netpair = dup_netpair,
wenzelm@18691
   346
        xtra_netpair = insert' (the_default 0 w) (nI,nE) ([th], []) xtra_netpair}
wenzelm@42790
   347
    end;
lcp@1073
   348
wenzelm@42793
   349
fun addSE w context th
wenzelm@42790
   350
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@42790
   351
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@42807
   352
  if warn_rules context "Ignoring duplicate safe elimination (elim!)\n" safeEs th then cs
paulson@18557
   353
  else if has_fewer_prems 1 th then
wenzelm@42793
   354
    error ("Ill-formed elimination rule\n" ^ string_of_thm context th)
paulson@1927
   355
  else
wenzelm@42790
   356
    let
wenzelm@42790
   357
      val th' = classical_rule (flat_rule th);
wenzelm@18534
   358
      val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*)
wenzelm@42790
   359
        List.partition (fn rl => nprems_of rl=1) [th'];
wenzelm@42810
   360
      val nI = Item_Net.length safeIs;
wenzelm@42810
   361
      val nE = Item_Net.length safeEs + 1;
wenzelm@42807
   362
      val _ = warn_claset context th cs;
wenzelm@42790
   363
    in
wenzelm@42790
   364
      CS
wenzelm@42810
   365
       {safeEs = Item_Net.update th safeEs,
lcp@1073
   366
        safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair,
wenzelm@9938
   367
        safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair,
wenzelm@42790
   368
        safeIs = safeIs,
wenzelm@42790
   369
        hazIs = hazIs,
wenzelm@42790
   370
        hazEs = hazEs,
wenzelm@42790
   371
        swrappers = swrappers,
wenzelm@42790
   372
        uwrappers = uwrappers,
wenzelm@42790
   373
        haz_netpair = haz_netpair,
wenzelm@42790
   374
        dup_netpair = dup_netpair,
wenzelm@18691
   375
        xtra_netpair = insert' (the_default 0 w) (nI,nE) ([], [th]) xtra_netpair}
wenzelm@42790
   376
    end;
clasohm@0
   377
wenzelm@42793
   378
fun addSD w context th = addSE w context (make_elim context th);
wenzelm@42793
   379
lcp@1073
   380
paulson@1800
   381
(*** Hazardous (unsafe) rules ***)
clasohm@0
   382
wenzelm@42793
   383
fun addI w context th
wenzelm@42790
   384
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@42790
   385
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@42807
   386
  if warn_rules context "Ignoring duplicate introduction (intro)\n" hazIs th then cs
paulson@1927
   387
  else
wenzelm@42790
   388
    let
wenzelm@42790
   389
      val th' = flat_rule th;
wenzelm@42810
   390
      val nI = Item_Net.length hazIs + 1;
wenzelm@42810
   391
      val nE = Item_Net.length hazEs;
wenzelm@42807
   392
      val _ = warn_claset context th cs;
wenzelm@42790
   393
    in
wenzelm@42790
   394
      CS
wenzelm@42810
   395
       {hazIs = Item_Net.update th hazIs,
wenzelm@42790
   396
        haz_netpair = insert (nI, nE) ([th'], []) haz_netpair,
wenzelm@42790
   397
        dup_netpair = insert (nI, nE) ([dup_intr th'], []) dup_netpair,
wenzelm@42790
   398
        safeIs = safeIs,
wenzelm@42790
   399
        safeEs = safeEs,
wenzelm@42790
   400
        hazEs = hazEs,
wenzelm@42790
   401
        swrappers = swrappers,
wenzelm@42790
   402
        uwrappers = uwrappers,
wenzelm@9938
   403
        safe0_netpair = safe0_netpair,
wenzelm@9938
   404
        safep_netpair = safep_netpair,
wenzelm@42790
   405
        xtra_netpair = insert' (the_default 1 w) (nI, nE) ([th], []) xtra_netpair}
wenzelm@42790
   406
    end
wenzelm@42790
   407
    handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*)  (* FIXME !? *)
wenzelm@42793
   408
      error ("Ill-formed introduction rule\n" ^ string_of_thm context th);
lcp@1073
   409
wenzelm@42793
   410
fun addE w context th
wenzelm@42790
   411
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@42790
   412
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@42807
   413
  if warn_rules context "Ignoring duplicate elimination (elim)\n" hazEs th then cs
paulson@18557
   414
  else if has_fewer_prems 1 th then
wenzelm@42793
   415
    error ("Ill-formed elimination rule\n" ^ string_of_thm context th)
paulson@1927
   416
  else
wenzelm@42790
   417
    let
wenzelm@42790
   418
      val th' = classical_rule (flat_rule th);
wenzelm@42810
   419
      val nI = Item_Net.length hazIs;
wenzelm@42810
   420
      val nE = Item_Net.length hazEs + 1;
wenzelm@42807
   421
      val _ = warn_claset context th cs;
wenzelm@42790
   422
    in
wenzelm@42790
   423
      CS
wenzelm@42810
   424
       {hazEs = Item_Net.update th hazEs,
wenzelm@42790
   425
        haz_netpair = insert (nI, nE) ([], [th']) haz_netpair,
wenzelm@42790
   426
        dup_netpair = insert (nI, nE) ([], [dup_elim th']) dup_netpair,
wenzelm@42790
   427
        safeIs = safeIs,
wenzelm@42790
   428
        safeEs = safeEs,
wenzelm@42790
   429
        hazIs = hazIs,
wenzelm@42790
   430
        swrappers = swrappers,
wenzelm@42790
   431
        uwrappers = uwrappers,
wenzelm@9938
   432
        safe0_netpair = safe0_netpair,
wenzelm@9938
   433
        safep_netpair = safep_netpair,
wenzelm@42790
   434
        xtra_netpair = insert' (the_default 1 w) (nI, nE) ([], [th]) xtra_netpair}
wenzelm@42790
   435
    end;
clasohm@0
   436
wenzelm@42793
   437
fun addD w context th = addE w context (make_elim context th);
wenzelm@42793
   438
clasohm@0
   439
lcp@1073
   440
wenzelm@10736
   441
(*** Deletion of rules
paulson@1800
   442
     Working out what to delete, requires repeating much of the code used
wenzelm@9938
   443
        to insert.
paulson@1800
   444
***)
paulson@1800
   445
wenzelm@10736
   446
fun delSI th
wenzelm@42790
   447
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@42790
   448
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@42810
   449
  if Item_Net.member safeIs th then
wenzelm@18534
   450
    let
wenzelm@42790
   451
      val th' = flat_rule th;
wenzelm@42790
   452
      val (safe0_rls, safep_rls) = List.partition Thm.no_prems [th'];
wenzelm@42790
   453
    in
wenzelm@42790
   454
      CS
wenzelm@42790
   455
       {safe0_netpair = delete (safe0_rls, []) safe0_netpair,
wenzelm@42790
   456
        safep_netpair = delete (safep_rls, []) safep_netpair,
wenzelm@42810
   457
        safeIs = Item_Net.remove th safeIs,
wenzelm@42790
   458
        safeEs = safeEs,
wenzelm@42790
   459
        hazIs = hazIs,
wenzelm@42790
   460
        hazEs = hazEs,
wenzelm@42790
   461
        swrappers = swrappers,
wenzelm@42790
   462
        uwrappers = uwrappers,
wenzelm@42790
   463
        haz_netpair = haz_netpair,
wenzelm@42790
   464
        dup_netpair = dup_netpair,
wenzelm@42790
   465
        xtra_netpair = delete' ([th], []) xtra_netpair}
wenzelm@18534
   466
    end
wenzelm@18534
   467
  else cs;
paulson@1800
   468
wenzelm@42790
   469
fun delSE th
wenzelm@42790
   470
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@42790
   471
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@42810
   472
  if Item_Net.member safeEs th then
wenzelm@42790
   473
    let
wenzelm@42790
   474
      val th' = classical_rule (flat_rule th);
wenzelm@42790
   475
      val (safe0_rls, safep_rls) = List.partition (fn rl => nprems_of rl = 1) [th'];
wenzelm@42790
   476
    in
wenzelm@42790
   477
      CS
wenzelm@42790
   478
       {safe0_netpair = delete ([], safe0_rls) safe0_netpair,
wenzelm@42790
   479
        safep_netpair = delete ([], safep_rls) safep_netpair,
wenzelm@42790
   480
        safeIs = safeIs,
wenzelm@42810
   481
        safeEs = Item_Net.remove th safeEs,
wenzelm@42790
   482
        hazIs = hazIs,
wenzelm@42790
   483
        hazEs = hazEs,
wenzelm@42790
   484
        swrappers = swrappers,
wenzelm@42790
   485
        uwrappers = uwrappers,
wenzelm@42790
   486
        haz_netpair = haz_netpair,
wenzelm@42790
   487
        dup_netpair = dup_netpair,
wenzelm@42790
   488
        xtra_netpair = delete' ([], [th]) xtra_netpair}
wenzelm@42790
   489
    end
wenzelm@42790
   490
  else cs;
paulson@1800
   491
wenzelm@42793
   492
fun delI context th
wenzelm@42790
   493
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@42790
   494
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@42810
   495
  if Item_Net.member hazIs th then
wenzelm@42790
   496
    let val th' = flat_rule th in
wenzelm@42790
   497
      CS
wenzelm@42790
   498
       {haz_netpair = delete ([th'], []) haz_netpair,
wenzelm@23594
   499
        dup_netpair = delete ([dup_intr th'], []) dup_netpair,
wenzelm@42790
   500
        safeIs = safeIs,
wenzelm@42790
   501
        safeEs = safeEs,
wenzelm@42810
   502
        hazIs = Item_Net.remove th hazIs,
wenzelm@42790
   503
        hazEs = hazEs,
wenzelm@42790
   504
        swrappers = swrappers,
wenzelm@42790
   505
        uwrappers = uwrappers,
wenzelm@9938
   506
        safe0_netpair = safe0_netpair,
wenzelm@9938
   507
        safep_netpair = safep_netpair,
wenzelm@12401
   508
        xtra_netpair = delete' ([th], []) xtra_netpair}
wenzelm@23594
   509
    end
wenzelm@42790
   510
  else cs
wenzelm@42790
   511
  handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*)  (* FIXME !? *)
wenzelm@42793
   512
    error ("Ill-formed introduction rule\n" ^ string_of_thm context th);
paulson@1800
   513
paulson@2813
   514
fun delE th
wenzelm@42790
   515
    (cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
wenzelm@42790
   516
      safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
wenzelm@42810
   517
  if Item_Net.member hazEs th then
wenzelm@42790
   518
    let val th' = classical_rule (flat_rule th) in
wenzelm@42790
   519
      CS
wenzelm@42790
   520
       {haz_netpair = delete ([], [th']) haz_netpair,
wenzelm@18534
   521
        dup_netpair = delete ([], [dup_elim th']) dup_netpair,
wenzelm@42790
   522
        safeIs = safeIs,
wenzelm@42790
   523
        safeEs = safeEs,
wenzelm@42790
   524
        hazIs = hazIs,
wenzelm@42810
   525
        hazEs = Item_Net.remove th hazEs,
wenzelm@42790
   526
        swrappers = swrappers,
wenzelm@42790
   527
        uwrappers = uwrappers,
wenzelm@9938
   528
        safe0_netpair = safe0_netpair,
wenzelm@9938
   529
        safep_netpair = safep_netpair,
wenzelm@12401
   530
        xtra_netpair = delete' ([], [th]) xtra_netpair}
wenzelm@42790
   531
    end
wenzelm@42790
   532
  else cs;
paulson@1800
   533
paulson@2813
   534
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*)
wenzelm@42793
   535
fun delrule context th (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}) =
wenzelm@42793
   536
  let val th' = Tactic.make_elim th in
wenzelm@42810
   537
    if Item_Net.member safeIs th orelse Item_Net.member safeEs th orelse
wenzelm@42810
   538
      Item_Net.member hazIs th orelse Item_Net.member hazEs th orelse
wenzelm@42810
   539
      Item_Net.member safeEs th' orelse Item_Net.member hazEs th'
wenzelm@42793
   540
    then delSI th (delSE th (delI context th (delE th (delSE th' (delE th' cs)))))
wenzelm@42807
   541
    else (warn_thm context "Undeclared classical rule\n" th; cs)
wenzelm@9938
   542
  end;
paulson@1800
   543
paulson@1800
   544
wenzelm@42793
   545
wenzelm@42793
   546
(** claset data **)
wenzelm@42790
   547
wenzelm@42793
   548
(* wrappers *)
wenzelm@42790
   549
haftmann@22674
   550
fun map_swrappers f
haftmann@22674
   551
  (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
haftmann@22674
   552
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
haftmann@22674
   553
  CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
oheimb@4767
   554
    swrappers = f swrappers, uwrappers = uwrappers,
oheimb@4767
   555
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
wenzelm@6955
   556
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
oheimb@4767
   557
haftmann@22674
   558
fun map_uwrappers f
wenzelm@42793
   559
  (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers,
haftmann@22674
   560
    safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) =
haftmann@22674
   561
  CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs,
oheimb@4767
   562
    swrappers = swrappers, uwrappers = f uwrappers,
oheimb@4767
   563
    safe0_netpair = safe0_netpair, safep_netpair = safep_netpair,
wenzelm@6955
   564
    haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair};
oheimb@4767
   565
haftmann@22674
   566
wenzelm@42793
   567
(* merge_cs *)
lcp@982
   568
wenzelm@42810
   569
(*Merge works by adding all new rules of the 2nd claset into the 1st claset,
wenzelm@42810
   570
  in order to preserve priorities reliably.*)
wenzelm@42810
   571
wenzelm@42810
   572
fun merge_thms add thms1 thms2 =
wenzelm@42810
   573
  fold_rev (fn thm => if Item_Net.member thms1 thm then I else add thm) (Item_Net.content thms2);
wenzelm@42810
   574
haftmann@22674
   575
fun merge_cs (cs as CS {safeIs, safeEs, hazIs, hazEs, ...},
wenzelm@24358
   576
    cs' as CS {safeIs = safeIs2, safeEs = safeEs2, hazIs = hazIs2, hazEs = hazEs2,
haftmann@22674
   577
      swrappers, uwrappers, ...}) =
wenzelm@24358
   578
  if pointer_eq (cs, cs') then cs
wenzelm@24358
   579
  else
wenzelm@42810
   580
    cs
wenzelm@42810
   581
    |> merge_thms (addSI NONE NONE) safeIs safeIs2
wenzelm@42810
   582
    |> merge_thms (addSE NONE NONE) safeEs safeEs2
wenzelm@42810
   583
    |> merge_thms (addI NONE NONE) hazIs hazIs2
wenzelm@42810
   584
    |> merge_thms (addE NONE NONE) hazEs hazEs2
wenzelm@42810
   585
    |> map_swrappers (fn ws => AList.merge (op =) (K true) (ws, swrappers))
wenzelm@42810
   586
    |> map_uwrappers (fn ws => AList.merge (op =) (K true) (ws, uwrappers));
wenzelm@42793
   587
wenzelm@42793
   588
wenzelm@42793
   589
(* data *)
wenzelm@42793
   590
wenzelm@42793
   591
structure Claset = Generic_Data
wenzelm@42793
   592
(
wenzelm@42793
   593
  type T = claset;
wenzelm@42793
   594
  val empty = empty_cs;
wenzelm@42793
   595
  val extend = I;
wenzelm@42793
   596
  val merge = merge_cs;
wenzelm@42793
   597
);
wenzelm@42793
   598
wenzelm@42793
   599
val global_claset_of = Claset.get o Context.Theory;
wenzelm@42793
   600
val claset_of = Claset.get o Context.Proof;
wenzelm@42793
   601
val rep_claset_of = rep_cs o claset_of;
wenzelm@42793
   602
wenzelm@42793
   603
val get_cs = Claset.get;
wenzelm@42793
   604
val map_cs = Claset.map;
wenzelm@42793
   605
wenzelm@42793
   606
fun map_claset f = Context.proof_map (map_cs f);
wenzelm@42793
   607
fun put_claset cs = map_claset (K cs);
wenzelm@42793
   608
wenzelm@42793
   609
fun print_claset ctxt =
wenzelm@42793
   610
  let
wenzelm@42793
   611
    val {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, ...} = rep_claset_of ctxt;
wenzelm@51584
   612
    val pretty_thms = map (Display.pretty_thm_item ctxt) o Item_Net.content;
wenzelm@42793
   613
  in
wenzelm@42793
   614
    [Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs),
wenzelm@42793
   615
      Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs),
wenzelm@42793
   616
      Pretty.big_list "safe elimination rules (elim!):" (pretty_thms safeEs),
wenzelm@42793
   617
      Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs),
wenzelm@42793
   618
      Pretty.strs ("safe wrappers:" :: map #1 swrappers),
wenzelm@42793
   619
      Pretty.strs ("unsafe wrappers:" :: map #1 uwrappers)]
wenzelm@42793
   620
    |> Pretty.chunks |> Pretty.writeln
wenzelm@42793
   621
  end;
wenzelm@42793
   622
wenzelm@42793
   623
wenzelm@42793
   624
(* old-style declarations *)
wenzelm@42793
   625
wenzelm@42793
   626
fun decl f (ctxt, ths) = map_claset (fold_rev (f (SOME (Context.Proof ctxt))) ths) ctxt;
wenzelm@42793
   627
wenzelm@42793
   628
val op addSIs = decl (addSI NONE);
wenzelm@42793
   629
val op addSEs = decl (addSE NONE);
wenzelm@42793
   630
val op addSDs = decl (addSD NONE);
wenzelm@42793
   631
val op addIs = decl (addI NONE);
wenzelm@42793
   632
val op addEs = decl (addE NONE);
wenzelm@42793
   633
val op addDs = decl (addD NONE);
wenzelm@42793
   634
val op delrules = decl delrule;
wenzelm@42793
   635
wenzelm@42793
   636
wenzelm@42793
   637
wenzelm@42793
   638
(*** Modifying the wrapper tacticals ***)
wenzelm@42793
   639
wenzelm@42793
   640
fun appSWrappers ctxt = fold (fn (_, w) => w ctxt) (#swrappers (rep_claset_of ctxt));
wenzelm@42793
   641
fun appWrappers ctxt = fold (fn (_, w) => w ctxt) (#uwrappers (rep_claset_of ctxt));
wenzelm@42793
   642
wenzelm@42793
   643
fun update_warn msg (p as (key : string, _)) xs =
wenzelm@42793
   644
  (if AList.defined (op =) xs key then warning msg else (); AList.update (op =) p xs);
wenzelm@42793
   645
wenzelm@42793
   646
fun delete_warn msg (key : string) xs =
wenzelm@42793
   647
  if AList.defined (op =) xs key then AList.delete (op =) key xs
wenzelm@42793
   648
  else (warning msg; xs);
wenzelm@42793
   649
wenzelm@42793
   650
(*Add/replace a safe wrapper*)
wenzelm@42793
   651
fun cs addSWrapper new_swrapper =
wenzelm@42793
   652
  map_swrappers (update_warn ("Overwriting safe wrapper " ^ fst new_swrapper) new_swrapper) cs;
wenzelm@42793
   653
wenzelm@42793
   654
(*Add/replace an unsafe wrapper*)
wenzelm@42793
   655
fun cs addWrapper new_uwrapper =
wenzelm@42793
   656
  map_uwrappers (update_warn ("Overwriting unsafe wrapper " ^ fst new_uwrapper) new_uwrapper) cs;
wenzelm@42793
   657
wenzelm@42793
   658
(*Remove a safe wrapper*)
wenzelm@42793
   659
fun cs delSWrapper name =
wenzelm@42793
   660
  map_swrappers (delete_warn ("No such safe wrapper in claset: " ^ name) name) cs;
wenzelm@42793
   661
wenzelm@42793
   662
(*Remove an unsafe wrapper*)
wenzelm@42793
   663
fun cs delWrapper name =
wenzelm@42793
   664
  map_uwrappers (delete_warn ("No such unsafe wrapper in claset: " ^ name) name) cs;
wenzelm@42793
   665
wenzelm@42793
   666
(* compose a safe tactic alternatively before/after safe_step_tac *)
wenzelm@42793
   667
fun cs addSbefore (name, tac1) = cs addSWrapper (name, fn _ => fn tac2 => tac1 ORELSE' tac2);
wenzelm@42793
   668
fun cs addSafter (name, tac2) = cs addSWrapper (name, fn _ => fn tac1 => tac1 ORELSE' tac2);
wenzelm@42793
   669
wenzelm@42793
   670
(*compose a tactic alternatively before/after the step tactic *)
wenzelm@42793
   671
fun cs addbefore (name, tac1) = cs addWrapper (name, fn _ => fn tac2 => tac1 APPEND' tac2);
wenzelm@42793
   672
fun cs addafter (name, tac2) = cs addWrapper (name, fn _ => fn tac1 => tac1 APPEND' tac2);
wenzelm@42793
   673
wenzelm@46459
   674
fun cs addD2 (name, thm) = cs addafter (name, dtac thm THEN' assume_tac);
wenzelm@46459
   675
fun cs addE2 (name, thm) = cs addafter (name, etac thm THEN' assume_tac);
wenzelm@42793
   676
fun cs addSD2 (name, thm) = cs addSafter (name, dmatch_tac [thm] THEN' eq_assume_tac);
wenzelm@42793
   677
fun cs addSE2 (name, thm) = cs addSafter (name, ematch_tac [thm] THEN' eq_assume_tac);
wenzelm@42793
   678
paulson@1711
   679
lcp@982
   680
paulson@1800
   681
(**** Simple tactics for theorem proving ****)
clasohm@0
   682
clasohm@0
   683
(*Attack subgoals using safe inferences -- matching, not resolution*)
wenzelm@42793
   684
fun safe_step_tac ctxt =
wenzelm@42793
   685
  let val {safe0_netpair, safep_netpair, ...} = rep_claset_of ctxt in
wenzelm@42793
   686
    appSWrappers ctxt
wenzelm@42793
   687
      (FIRST'
wenzelm@42793
   688
       [eq_assume_tac,
wenzelm@9938
   689
        eq_mp_tac,
wenzelm@9938
   690
        bimatch_from_nets_tac safe0_netpair,
wenzelm@42792
   691
        FIRST' Data.hyp_subst_tacs,
wenzelm@42793
   692
        bimatch_from_nets_tac safep_netpair])
wenzelm@42793
   693
  end;
clasohm@0
   694
oheimb@5757
   695
(*Repeatedly attack a subgoal using safe inferences -- it's deterministic!*)
wenzelm@42793
   696
fun safe_steps_tac ctxt =
wenzelm@42793
   697
  REPEAT_DETERM1 o (fn i => COND (has_fewer_prems i) no_tac (safe_step_tac ctxt i));
oheimb@5757
   698
clasohm@0
   699
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*)
wenzelm@42793
   700
fun safe_tac ctxt = REPEAT_DETERM1 (FIRSTGOAL (safe_steps_tac ctxt));
lcp@747
   701
paulson@3705
   702
paulson@3705
   703
(*** Clarify_tac: do safe steps without causing branching ***)
paulson@3705
   704
wenzelm@42790
   705
fun nsubgoalsP n (k, brl) = (subgoals_of_brl brl = n);
paulson@3705
   706
paulson@3705
   707
(*version of bimatch_from_nets_tac that only applies rules that
paulson@3705
   708
  create precisely n subgoals.*)
wenzelm@10736
   709
fun n_bimatch_from_nets_tac n =
wenzelm@42790
   710
  biresolution_from_nets_tac (order_list o filter (nsubgoalsP n)) true;
paulson@3705
   711
wenzelm@42792
   712
fun eq_contr_tac i = ematch_tac [Data.not_elim] i THEN eq_assume_tac i;
paulson@3705
   713
val eq_assume_contr_tac = eq_assume_tac ORELSE' eq_contr_tac;
paulson@3705
   714
paulson@3705
   715
(*Two-way branching is allowed only if one of the branches immediately closes*)
paulson@3705
   716
fun bimatch2_tac netpair i =
wenzelm@42790
   717
  n_bimatch_from_nets_tac 2 netpair i THEN
wenzelm@42790
   718
  (eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i + 1));
paulson@3705
   719
paulson@3705
   720
(*Attack subgoals using safe inferences -- matching, not resolution*)
wenzelm@42793
   721
fun clarify_step_tac ctxt =
wenzelm@42793
   722
  let val {safe0_netpair, safep_netpair, ...} = rep_claset_of ctxt in
wenzelm@42793
   723
    appSWrappers ctxt
wenzelm@42793
   724
     (FIRST'
wenzelm@42793
   725
       [eq_assume_contr_tac,
wenzelm@9938
   726
        bimatch_from_nets_tac safe0_netpair,
wenzelm@42792
   727
        FIRST' Data.hyp_subst_tacs,
wenzelm@9938
   728
        n_bimatch_from_nets_tac 1 safep_netpair,
wenzelm@42793
   729
        bimatch2_tac safep_netpair])
wenzelm@42793
   730
  end;
paulson@3705
   731
wenzelm@42793
   732
fun clarify_tac ctxt = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac ctxt 1));
paulson@3705
   733
paulson@3705
   734
paulson@3705
   735
(*** Unsafe steps instantiate variables or lose information ***)
paulson@3705
   736
paulson@4066
   737
(*Backtracking is allowed among the various these unsafe ways of
paulson@4066
   738
  proving a subgoal.  *)
wenzelm@42793
   739
fun inst0_step_tac ctxt =
wenzelm@32862
   740
  assume_tac APPEND'
wenzelm@32862
   741
  contr_tac APPEND'
wenzelm@42793
   742
  biresolve_from_nets_tac (#safe0_netpair (rep_claset_of ctxt));
lcp@747
   743
paulson@4066
   744
(*These unsafe steps could generate more subgoals.*)
wenzelm@42793
   745
fun instp_step_tac ctxt =
wenzelm@42793
   746
  biresolve_from_nets_tac (#safep_netpair (rep_claset_of ctxt));
clasohm@0
   747
clasohm@0
   748
(*These steps could instantiate variables and are therefore unsafe.*)
wenzelm@42793
   749
fun inst_step_tac ctxt = inst0_step_tac ctxt APPEND' instp_step_tac ctxt;
clasohm@0
   750
wenzelm@42793
   751
fun haz_step_tac ctxt =
wenzelm@42793
   752
  biresolve_from_nets_tac (#haz_netpair (rep_claset_of ctxt));
lcp@681
   753
clasohm@0
   754
(*Single step for the prover.  FAILS unless it makes progress. *)
wenzelm@42793
   755
fun step_tac ctxt i =
wenzelm@42793
   756
  safe_tac ctxt ORELSE appWrappers ctxt (inst_step_tac ctxt ORELSE' haz_step_tac ctxt) i;
clasohm@0
   757
clasohm@0
   758
(*Using a "safe" rule to instantiate variables is unsafe.  This tactic
clasohm@0
   759
  allows backtracking from "safe" rules to "unsafe" rules here.*)
wenzelm@42793
   760
fun slow_step_tac ctxt i =
wenzelm@42793
   761
  safe_tac ctxt ORELSE appWrappers ctxt (inst_step_tac ctxt APPEND' haz_step_tac ctxt) i;
clasohm@0
   762
wenzelm@42791
   763
paulson@1800
   764
(**** The following tactics all fail unless they solve one goal ****)
clasohm@0
   765
clasohm@0
   766
(*Dumb but fast*)
wenzelm@42793
   767
fun fast_tac ctxt =
wenzelm@42793
   768
  Object_Logic.atomize_prems_tac THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac ctxt 1));
clasohm@0
   769
clasohm@0
   770
(*Slower but smarter than fast_tac*)
wenzelm@42793
   771
fun best_tac ctxt =
wenzelm@35625
   772
  Object_Logic.atomize_prems_tac THEN'
wenzelm@42793
   773
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (step_tac ctxt 1));
clasohm@0
   774
oheimb@9402
   775
(*even a bit smarter than best_tac*)
wenzelm@42793
   776
fun first_best_tac ctxt =
wenzelm@35625
   777
  Object_Logic.atomize_prems_tac THEN'
wenzelm@42793
   778
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (FIRSTGOAL (step_tac ctxt)));
oheimb@9402
   779
wenzelm@42793
   780
fun slow_tac ctxt =
wenzelm@35625
   781
  Object_Logic.atomize_prems_tac THEN'
wenzelm@42793
   782
  SELECT_GOAL (DEPTH_SOLVE (slow_step_tac ctxt 1));
clasohm@0
   783
wenzelm@42793
   784
fun slow_best_tac ctxt =
wenzelm@35625
   785
  Object_Logic.atomize_prems_tac THEN'
wenzelm@42793
   786
  SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, Data.sizef) (slow_step_tac ctxt 1));
clasohm@0
   787
lcp@681
   788
wenzelm@10736
   789
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*)
wenzelm@42791
   790
wenzelm@42791
   791
val weight_ASTAR = 5;
paulson@1587
   792
wenzelm@42793
   793
fun astar_tac ctxt =
wenzelm@35625
   794
  Object_Logic.atomize_prems_tac THEN'
wenzelm@10382
   795
  SELECT_GOAL
wenzelm@42791
   796
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + weight_ASTAR * lev)
wenzelm@42793
   797
      (step_tac ctxt 1));
paulson@1587
   798
wenzelm@42793
   799
fun slow_astar_tac ctxt =
wenzelm@35625
   800
  Object_Logic.atomize_prems_tac THEN'
wenzelm@10382
   801
  SELECT_GOAL
wenzelm@42791
   802
    (ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + weight_ASTAR * lev)
wenzelm@42793
   803
      (slow_step_tac ctxt 1));
paulson@1587
   804
wenzelm@42790
   805
paulson@1800
   806
(**** Complete tactic, loosely based upon LeanTaP.  This tactic is the outcome
lcp@747
   807
  of much experimentation!  Changing APPEND to ORELSE below would prove
lcp@747
   808
  easy theorems faster, but loses completeness -- and many of the harder
paulson@1800
   809
  theorems such as 43. ****)
lcp@681
   810
lcp@747
   811
(*Non-deterministic!  Could always expand the first unsafe connective.
lcp@747
   812
  That's hard to implement and did not perform better in experiments, due to
lcp@747
   813
  greater search depth required.*)
wenzelm@42793
   814
fun dup_step_tac ctxt =
wenzelm@42793
   815
  biresolve_from_nets_tac (#dup_netpair (rep_claset_of ctxt));
lcp@681
   816
oheimb@5523
   817
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*)
oheimb@5757
   818
local
wenzelm@42793
   819
  fun slow_step_tac' ctxt = appWrappers ctxt (instp_step_tac ctxt APPEND' dup_step_tac ctxt);
wenzelm@42790
   820
in
wenzelm@42793
   821
  fun depth_tac ctxt m i state = SELECT_GOAL
wenzelm@42793
   822
    (safe_steps_tac ctxt 1 THEN_ELSE
wenzelm@42793
   823
      (DEPTH_SOLVE (depth_tac ctxt m 1),
wenzelm@42793
   824
        inst0_step_tac ctxt 1 APPEND COND (K (m = 0)) no_tac
wenzelm@42793
   825
          (slow_step_tac' ctxt 1 THEN DEPTH_SOLVE (depth_tac ctxt (m - 1) 1)))) i state;
oheimb@5757
   826
end;
lcp@747
   827
wenzelm@10736
   828
(*Search, with depth bound m.
paulson@2173
   829
  This is the "entry point", which does safe inferences first.*)
wenzelm@42793
   830
fun safe_depth_tac ctxt m = SUBGOAL (fn (prem, i) =>
wenzelm@42793
   831
  let
wenzelm@42793
   832
    val deti = (*No Vars in the goal?  No need to backtrack between goals.*)
wenzelm@42793
   833
      if exists_subterm (fn Var _ => true | _ => false) prem then DETERM else I;
wenzelm@42790
   834
  in
wenzelm@42793
   835
    SELECT_GOAL (TRY (safe_tac ctxt) THEN DEPTH_SOLVE (deti (depth_tac ctxt m 1))) i
wenzelm@42790
   836
  end);
lcp@681
   837
wenzelm@42793
   838
fun deepen_tac ctxt = DEEPEN (2, 10) (safe_depth_tac ctxt);
wenzelm@24021
   839
wenzelm@24021
   840
wenzelm@5885
   841
(* attributes *)
wenzelm@5885
   842
wenzelm@42793
   843
fun attrib f =
wenzelm@42793
   844
  Thm.declaration_attribute (fn th => fn context => map_cs (f (SOME context) th) context);
wenzelm@5885
   845
wenzelm@18691
   846
val safe_elim = attrib o addSE;
wenzelm@18691
   847
val safe_intro = attrib o addSI;
wenzelm@42793
   848
val safe_dest = attrib o addSD;
wenzelm@18691
   849
val haz_elim = attrib o addE;
wenzelm@18691
   850
val haz_intro = attrib o addI;
wenzelm@42793
   851
val haz_dest = attrib o addD;
wenzelm@45375
   852
wenzelm@45375
   853
val rule_del =
wenzelm@45375
   854
  Thm.declaration_attribute (fn th => fn context =>
wenzelm@45375
   855
    context |> map_cs (delrule (SOME context) th) |>
wenzelm@45375
   856
    Thm.attribute_declaration Context_Rules.rule_del th);
wenzelm@5885
   857
wenzelm@5885
   858
wenzelm@5841
   859
wenzelm@5885
   860
(** concrete syntax of attributes **)
wenzelm@5841
   861
wenzelm@5841
   862
val introN = "intro";
wenzelm@5841
   863
val elimN = "elim";
wenzelm@5841
   864
val destN = "dest";
wenzelm@5841
   865
wenzelm@30528
   866
val setup_attrs =
wenzelm@30528
   867
  Attrib.setup @{binding swapped} (Scan.succeed swapped)
wenzelm@30528
   868
    "classical swap of introduction rule" #>
wenzelm@33369
   869
  Attrib.setup @{binding dest} (Context_Rules.add safe_dest haz_dest Context_Rules.dest_query)
wenzelm@30528
   870
    "declaration of Classical destruction rule" #>
wenzelm@33369
   871
  Attrib.setup @{binding elim} (Context_Rules.add safe_elim haz_elim Context_Rules.elim_query)
wenzelm@30528
   872
    "declaration of Classical elimination rule" #>
wenzelm@33369
   873
  Attrib.setup @{binding intro} (Context_Rules.add safe_intro haz_intro Context_Rules.intro_query)
wenzelm@30528
   874
    "declaration of Classical introduction rule" #>
wenzelm@30528
   875
  Attrib.setup @{binding rule} (Scan.lift Args.del >> K rule_del)
wenzelm@30528
   876
    "remove declaration of intro/elim/dest rule";
wenzelm@5841
   877
wenzelm@5841
   878
wenzelm@5841
   879
wenzelm@7230
   880
(** proof methods **)
wenzelm@7230
   881
wenzelm@7230
   882
local
wenzelm@7230
   883
wenzelm@30609
   884
fun some_rule_tac ctxt facts = SUBGOAL (fn (goal, i) =>
wenzelm@5841
   885
  let
wenzelm@33369
   886
    val [rules1, rules2, rules4] = Context_Rules.find_rules false facts goal ctxt;
wenzelm@42793
   887
    val {xtra_netpair, ...} = rep_claset_of ctxt;
wenzelm@33369
   888
    val rules3 = Context_Rules.find_rules_netpair true facts goal xtra_netpair;
wenzelm@12376
   889
    val rules = rules1 @ rules2 @ rules3 @ rules4;
wenzelm@18223
   890
    val ruleq = Drule.multi_resolves facts rules;
wenzelm@12376
   891
  in
wenzelm@12376
   892
    Method.trace ctxt rules;
wenzelm@32952
   893
    fn st => Seq.maps (fn rule => Tactic.rtac rule i st) ruleq
wenzelm@18834
   894
  end)
wenzelm@21687
   895
  THEN_ALL_NEW Goal.norm_hhf_tac;
wenzelm@5841
   896
wenzelm@30609
   897
in
wenzelm@7281
   898
wenzelm@30609
   899
fun rule_tac ctxt [] facts = some_rule_tac ctxt facts
wenzelm@30609
   900
  | rule_tac _ rules facts = Method.rule_tac rules facts;
wenzelm@30609
   901
wenzelm@30609
   902
fun default_tac ctxt rules facts =
wenzelm@30609
   903
  HEADGOAL (rule_tac ctxt rules facts) ORELSE
haftmann@26470
   904
  Class.default_intro_tac ctxt facts;
wenzelm@10309
   905
wenzelm@7230
   906
end;
wenzelm@5841
   907
wenzelm@5841
   908
wenzelm@6502
   909
(* automatic methods *)
wenzelm@5841
   910
wenzelm@5927
   911
val cla_modifiers =
wenzelm@18728
   912
 [Args.$$$ destN -- Args.bang_colon >> K ((I, safe_dest NONE): Method.modifier),
wenzelm@18728
   913
  Args.$$$ destN -- Args.colon >> K (I, haz_dest NONE),
wenzelm@18728
   914
  Args.$$$ elimN -- Args.bang_colon >> K (I, safe_elim NONE),
wenzelm@18728
   915
  Args.$$$ elimN -- Args.colon >> K (I, haz_elim NONE),
wenzelm@18728
   916
  Args.$$$ introN -- Args.bang_colon >> K (I, safe_intro NONE),
wenzelm@18728
   917
  Args.$$$ introN -- Args.colon >> K (I, haz_intro NONE),
wenzelm@18728
   918
  Args.del -- Args.colon >> K (I, rule_del)];
wenzelm@5927
   919
wenzelm@42793
   920
fun cla_method tac = Method.sections cla_modifiers >> K (SIMPLE_METHOD o tac);
wenzelm@42793
   921
fun cla_method' tac = Method.sections cla_modifiers >> K (SIMPLE_METHOD' o tac);
wenzelm@5841
   922
wenzelm@5841
   923
wenzelm@5841
   924
wenzelm@5841
   925
(** setup_methods **)
wenzelm@5841
   926
wenzelm@30541
   927
val setup_methods =
wenzelm@30609
   928
  Method.setup @{binding default}
wenzelm@30609
   929
   (Attrib.thms >> (fn rules => fn ctxt => METHOD (default_tac ctxt rules)))
wenzelm@30541
   930
    "apply some intro/elim rule (potentially classical)" #>
wenzelm@30609
   931
  Method.setup @{binding rule}
wenzelm@30609
   932
    (Attrib.thms >> (fn rules => fn ctxt => METHOD (HEADGOAL o rule_tac ctxt rules)))
wenzelm@30541
   933
    "apply some intro/elim rule (potentially classical)" #>
wenzelm@50112
   934
  Method.setup @{binding contradiction}
wenzelm@50112
   935
    (Scan.succeed (K (Method.rule [Data.not_elim, Drule.rotate_prems 1 Data.not_elim])))
wenzelm@30541
   936
    "proof by contradiction" #>
wenzelm@30541
   937
  Method.setup @{binding clarify} (cla_method' (CHANGED_PROP oo clarify_tac))
wenzelm@30541
   938
    "repeatedly apply safe steps" #>
wenzelm@30541
   939
  Method.setup @{binding fast} (cla_method' fast_tac) "classical prover (depth-first)" #>
wenzelm@30541
   940
  Method.setup @{binding slow} (cla_method' slow_tac) "classical prover (slow depth-first)" #>
wenzelm@30541
   941
  Method.setup @{binding best} (cla_method' best_tac) "classical prover (best-first)" #>
wenzelm@42798
   942
  Method.setup @{binding deepen}
wenzelm@42798
   943
    (Scan.lift (Scan.optional Parse.nat 4) --| Method.sections cla_modifiers
wenzelm@42798
   944
      >> (fn n => fn ctxt => SIMPLE_METHOD' (deepen_tac ctxt n)))
wenzelm@30541
   945
    "classical prover (iterative deepening)" #>
wenzelm@30541
   946
  Method.setup @{binding safe} (cla_method (CHANGED_PROP o safe_tac))
wenzelm@50108
   947
    "classical prover (apply safe rules)" #>
wenzelm@50108
   948
  Method.setup @{binding safe_step} (cla_method' safe_step_tac)
wenzelm@50108
   949
    "single classical step (safe rules)" #>
wenzelm@50108
   950
  Method.setup @{binding inst_step} (cla_method' inst_step_tac)
wenzelm@50108
   951
    "single classical step (safe rules, allow instantiations)" #>
wenzelm@50108
   952
  Method.setup @{binding step} (cla_method' step_tac)
wenzelm@50108
   953
    "single classical step (safe and unsafe rules)" #>
wenzelm@50108
   954
  Method.setup @{binding slow_step} (cla_method' slow_step_tac)
wenzelm@50108
   955
    "single classical step (safe and unsafe rules, allow backtracking)" #>
wenzelm@50108
   956
  Method.setup @{binding clarify_step} (cla_method' clarify_step_tac)
wenzelm@50108
   957
    "single classical step (safe rules, without splitting)";
wenzelm@5841
   958
wenzelm@5841
   959
wenzelm@5841
   960
wenzelm@5841
   961
(** theory setup **)
wenzelm@5841
   962
wenzelm@26497
   963
val setup = setup_attrs #> setup_methods;
wenzelm@5841
   964
wenzelm@5841
   965
wenzelm@8667
   966
wenzelm@8667
   967
(** outer syntax **)
wenzelm@8667
   968
wenzelm@24867
   969
val _ =
wenzelm@46961
   970
  Outer_Syntax.improper_command @{command_spec "print_claset"} "print context of Classical Reasoner"
wenzelm@26497
   971
    (Scan.succeed (Toplevel.no_timing o Toplevel.unknown_context o
wenzelm@42439
   972
      Toplevel.keep (fn state =>
wenzelm@42439
   973
        let val ctxt = Toplevel.context_of state
wenzelm@42793
   974
        in print_claset ctxt end)));
wenzelm@8667
   975
wenzelm@5841
   976
end;