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