src/HOL/Tools/meson.ML
author wenzelm
Tue Jul 21 01:03:18 2009 +0200 (2009-07-21)
changeset 32091 30e2ffbba718
parent 32032 a6a6e8031c14
child 32231 95b8afcbb0ed
permissions -rw-r--r--
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm@9869
     1
(*  Title:      HOL/Tools/meson.ML
paulson@9840
     2
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
paulson@9840
     3
wenzelm@9869
     4
The MESON resolution proof procedure for HOL.
wenzelm@29267
     5
When making clauses, avoids using the rewriter -- instead uses RS recursively.
paulson@9840
     6
*)
paulson@9840
     7
wenzelm@24300
     8
signature MESON =
paulson@15579
     9
sig
wenzelm@24300
    10
  val term_pair_of: indexname * (typ * 'a) -> term * 'a
wenzelm@24300
    11
  val first_order_resolve: thm -> thm -> thm
wenzelm@24300
    12
  val flexflex_first_order: thm -> thm
wenzelm@24300
    13
  val size_of_subgoals: thm -> int
paulson@26562
    14
  val too_many_clauses: Proof.context option -> term -> bool
paulson@24937
    15
  val make_cnf: thm list -> thm -> Proof.context -> thm list * Proof.context
wenzelm@24300
    16
  val finish_cnf: thm list -> thm list
wenzelm@24300
    17
  val make_nnf: thm -> thm
wenzelm@24300
    18
  val skolemize: thm -> thm
wenzelm@24300
    19
  val is_fol_term: theory -> term -> bool
wenzelm@24300
    20
  val make_clauses: thm list -> thm list
wenzelm@24300
    21
  val make_horns: thm list -> thm list
wenzelm@24300
    22
  val best_prolog_tac: (thm -> int) -> thm list -> tactic
wenzelm@24300
    23
  val depth_prolog_tac: thm list -> tactic
wenzelm@24300
    24
  val gocls: thm list -> thm list
wenzelm@24300
    25
  val skolemize_prems_tac: thm list -> int -> tactic
wenzelm@24300
    26
  val MESON: (thm list -> thm list) -> (thm list -> tactic) -> int -> tactic
wenzelm@24300
    27
  val best_meson_tac: (thm -> int) -> int -> tactic
wenzelm@30607
    28
  val safe_best_meson_tac: claset -> int -> tactic
wenzelm@24300
    29
  val depth_meson_tac: int -> tactic
wenzelm@24300
    30
  val prolog_step_tac': thm list -> int -> tactic
wenzelm@24300
    31
  val iter_deepen_prolog_tac: thm list -> tactic
wenzelm@24300
    32
  val iter_deepen_meson_tac: thm list -> int -> tactic
wenzelm@24300
    33
  val make_meta_clause: thm -> thm
wenzelm@24300
    34
  val make_meta_clauses: thm list -> thm list
wenzelm@24300
    35
  val meson_claset_tac: thm list -> claset -> int -> tactic
wenzelm@30607
    36
  val meson_tac: claset -> int -> tactic
wenzelm@24300
    37
  val negate_head: thm -> thm
wenzelm@24300
    38
  val select_literal: int -> thm -> thm
wenzelm@24300
    39
  val skolemize_tac: int -> tactic
paulson@26562
    40
  val setup: Context.theory -> Context.theory
paulson@15579
    41
end
paulson@9840
    42
wenzelm@24300
    43
structure Meson: MESON =
paulson@15579
    44
struct
paulson@9840
    45
paulson@26562
    46
val max_clauses_default = 60;
paulson@26562
    47
val (max_clauses, setup) = Attrib.config_int "max_clauses" max_clauses_default;
paulson@26562
    48
haftmann@31454
    49
val disj_forward = @{thm disj_forward};
haftmann@31454
    50
val disj_forward2 = @{thm disj_forward2};
haftmann@31454
    51
val make_pos_rule = @{thm make_pos_rule};
haftmann@31454
    52
val make_pos_rule' = @{thm make_pos_rule'};
haftmann@31454
    53
val make_pos_goal = @{thm make_pos_goal};
haftmann@31454
    54
val make_neg_rule = @{thm make_neg_rule};
haftmann@31454
    55
val make_neg_rule' = @{thm make_neg_rule'};
haftmann@31454
    56
val make_neg_goal = @{thm make_neg_goal};
haftmann@31454
    57
val conj_forward = @{thm conj_forward};
haftmann@31454
    58
val all_forward = @{thm all_forward};
haftmann@31454
    59
val ex_forward = @{thm ex_forward};
haftmann@31454
    60
val choice = @{thm choice};
haftmann@31454
    61
paulson@15579
    62
val not_conjD = thm "meson_not_conjD";
paulson@15579
    63
val not_disjD = thm "meson_not_disjD";
paulson@15579
    64
val not_notD = thm "meson_not_notD";
paulson@15579
    65
val not_allD = thm "meson_not_allD";
paulson@15579
    66
val not_exD = thm "meson_not_exD";
paulson@15579
    67
val imp_to_disjD = thm "meson_imp_to_disjD";
paulson@15579
    68
val not_impD = thm "meson_not_impD";
paulson@15579
    69
val iff_to_disjD = thm "meson_iff_to_disjD";
paulson@15579
    70
val not_iffD = thm "meson_not_iffD";
paulson@15579
    71
val conj_exD1 = thm "meson_conj_exD1";
paulson@15579
    72
val conj_exD2 = thm "meson_conj_exD2";
paulson@15579
    73
val disj_exD = thm "meson_disj_exD";
paulson@15579
    74
val disj_exD1 = thm "meson_disj_exD1";
paulson@15579
    75
val disj_exD2 = thm "meson_disj_exD2";
paulson@15579
    76
val disj_assoc = thm "meson_disj_assoc";
paulson@15579
    77
val disj_comm = thm "meson_disj_comm";
paulson@15579
    78
val disj_FalseD1 = thm "meson_disj_FalseD1";
paulson@15579
    79
val disj_FalseD2 = thm "meson_disj_FalseD2";
paulson@9840
    80
paulson@9840
    81
paulson@15579
    82
(**** Operators for forward proof ****)
paulson@15579
    83
paulson@20417
    84
paulson@20417
    85
(** First-order Resolution **)
paulson@20417
    86
paulson@20417
    87
fun typ_pair_of (ix, (sort,ty)) = (TVar (ix,sort), ty);
paulson@20417
    88
fun term_pair_of (ix, (ty,t)) = (Var (ix,ty), t);
paulson@20417
    89
paulson@20417
    90
(*FIXME: currently does not "rename variables apart"*)
paulson@20417
    91
fun first_order_resolve thA thB =
paulson@20417
    92
  let val thy = theory_of_thm thA
paulson@20417
    93
      val tmA = concl_of thA
paulson@20417
    94
      val Const("==>",_) $ tmB $ _ = prop_of thB
wenzelm@32032
    95
      val (tyenv, tenv) = Pattern.first_order_match thy (tmB, tmA) (Vartab.empty, Vartab.empty)
paulson@20417
    96
      val ct_pairs = map (pairself (cterm_of thy) o term_pair_of) (Vartab.dest tenv)
paulson@20417
    97
  in  thA RS (cterm_instantiate ct_pairs thB)  end
wenzelm@28397
    98
  handle _ => raise THM ("first_order_resolve", 0, [thA,thB]);  (* FIXME avoid handle _ *)
paulson@18175
    99
wenzelm@24300
   100
fun flexflex_first_order th =
paulson@23440
   101
  case (tpairs_of th) of
paulson@23440
   102
      [] => th
paulson@23440
   103
    | pairs =>
wenzelm@24300
   104
        let val thy = theory_of_thm th
wenzelm@32032
   105
            val (tyenv, tenv) =
wenzelm@32032
   106
              fold (Pattern.first_order_match thy) pairs (Vartab.empty, Vartab.empty)
wenzelm@24300
   107
            val t_pairs = map term_pair_of (Vartab.dest tenv)
wenzelm@24300
   108
            val th' = Thm.instantiate ([], map (pairself (cterm_of thy)) t_pairs) th
wenzelm@24300
   109
        in  th'  end
wenzelm@24300
   110
        handle THM _ => th;
paulson@23440
   111
paulson@24937
   112
(*Forward proof while preserving bound variables names*)
paulson@24937
   113
fun rename_bvs_RS th rl =
paulson@24937
   114
  let val th' = th RS rl
paulson@24937
   115
  in  Thm.rename_boundvars (concl_of th') (concl_of th) th' end;
paulson@24937
   116
paulson@24937
   117
(*raises exception if no rules apply*)
wenzelm@24300
   118
fun tryres (th, rls) =
paulson@18141
   119
  let fun tryall [] = raise THM("tryres", 0, th::rls)
paulson@24937
   120
        | tryall (rl::rls) = (rename_bvs_RS th rl handle THM _ => tryall rls)
paulson@18141
   121
  in  tryall rls  end;
wenzelm@24300
   122
paulson@21050
   123
(*Permits forward proof from rules that discharge assumptions. The supplied proof state st,
paulson@21050
   124
  e.g. from conj_forward, should have the form
paulson@21050
   125
    "[| P' ==> ?P; Q' ==> ?Q |] ==> ?P & ?Q"
paulson@21050
   126
  and the effect should be to instantiate ?P and ?Q with normalized versions of P' and Q'.*)
paulson@15579
   127
fun forward_res nf st =
paulson@21050
   128
  let fun forward_tacf [prem] = rtac (nf prem) 1
wenzelm@24300
   129
        | forward_tacf prems =
wenzelm@32091
   130
            error (cat_lines
wenzelm@32091
   131
              ("Bad proof state in forward_res, please inform lcp@cl.cam.ac.uk:" ::
wenzelm@32091
   132
                Display.string_of_thm_without_context st ::
wenzelm@32091
   133
                "Premises:" :: map Display.string_of_thm_without_context prems))
paulson@21050
   134
  in
paulson@21050
   135
    case Seq.pull (ALLGOALS (METAHYPS forward_tacf) st)
paulson@21050
   136
    of SOME(th,_) => th
paulson@21050
   137
     | NONE => raise THM("forward_res", 0, [st])
paulson@21050
   138
  end;
paulson@15579
   139
paulson@20134
   140
(*Are any of the logical connectives in "bs" present in the term?*)
paulson@20134
   141
fun has_conns bs =
paulson@20134
   142
  let fun has (Const(a,_)) = false
paulson@20134
   143
        | has (Const("Trueprop",_) $ p) = has p
paulson@20134
   144
        | has (Const("Not",_) $ p) = has p
paulson@20134
   145
        | has (Const("op |",_) $ p $ q) = member (op =) bs "op |" orelse has p orelse has q
paulson@20134
   146
        | has (Const("op &",_) $ p $ q) = member (op =) bs "op &" orelse has p orelse has q
paulson@20134
   147
        | has (Const("All",_) $ Abs(_,_,p)) = member (op =) bs "All" orelse has p
paulson@20134
   148
        | has (Const("Ex",_) $ Abs(_,_,p)) = member (op =) bs "Ex" orelse has p
wenzelm@24300
   149
        | has _ = false
paulson@15579
   150
  in  has  end;
wenzelm@24300
   151
paulson@9840
   152
paulson@15579
   153
(**** Clause handling ****)
paulson@9840
   154
paulson@15579
   155
fun literals (Const("Trueprop",_) $ P) = literals P
paulson@15579
   156
  | literals (Const("op |",_) $ P $ Q) = literals P @ literals Q
paulson@15579
   157
  | literals (Const("Not",_) $ P) = [(false,P)]
paulson@15579
   158
  | literals P = [(true,P)];
paulson@9840
   159
paulson@15579
   160
(*number of literals in a term*)
paulson@15579
   161
val nliterals = length o literals;
paulson@9840
   162
paulson@18389
   163
paulson@18389
   164
(*** Tautology Checking ***)
paulson@18389
   165
wenzelm@24300
   166
fun signed_lits_aux (Const ("op |", _) $ P $ Q) (poslits, neglits) =
paulson@18389
   167
      signed_lits_aux Q (signed_lits_aux P (poslits, neglits))
paulson@18389
   168
  | signed_lits_aux (Const("Not",_) $ P) (poslits, neglits) = (poslits, P::neglits)
paulson@18389
   169
  | signed_lits_aux P (poslits, neglits) = (P::poslits, neglits);
wenzelm@24300
   170
paulson@18389
   171
fun signed_lits th = signed_lits_aux (HOLogic.dest_Trueprop (concl_of th)) ([],[]);
paulson@18389
   172
paulson@18389
   173
(*Literals like X=X are tautologous*)
paulson@18389
   174
fun taut_poslit (Const("op =",_) $ t $ u) = t aconv u
paulson@18389
   175
  | taut_poslit (Const("True",_)) = true
paulson@18389
   176
  | taut_poslit _ = false;
paulson@18389
   177
paulson@18389
   178
fun is_taut th =
paulson@18389
   179
  let val (poslits,neglits) = signed_lits th
paulson@18389
   180
  in  exists taut_poslit poslits
paulson@18389
   181
      orelse
wenzelm@20073
   182
      exists (member (op aconv) neglits) (HOLogic.false_const :: poslits)
paulson@19894
   183
  end
wenzelm@24300
   184
  handle TERM _ => false;       (*probably dest_Trueprop on a weird theorem*)
paulson@18389
   185
paulson@18389
   186
paulson@18389
   187
(*** To remove trivial negated equality literals from clauses ***)
paulson@18389
   188
paulson@18389
   189
(*They are typically functional reflexivity axioms and are the converses of
paulson@18389
   190
  injectivity equivalences*)
wenzelm@24300
   191
paulson@18389
   192
val not_refl_disj_D = thm"meson_not_refl_disj_D";
paulson@18389
   193
paulson@20119
   194
(*Is either term a Var that does not properly occur in the other term?*)
paulson@20119
   195
fun eliminable (t as Var _, u) = t aconv u orelse not (Logic.occs(t,u))
paulson@20119
   196
  | eliminable (u, t as Var _) = t aconv u orelse not (Logic.occs(t,u))
paulson@20119
   197
  | eliminable _ = false;
paulson@20119
   198
paulson@18389
   199
fun refl_clause_aux 0 th = th
paulson@18389
   200
  | refl_clause_aux n th =
paulson@18389
   201
       case HOLogic.dest_Trueprop (concl_of th) of
wenzelm@24300
   202
          (Const ("op |", _) $ (Const ("op |", _) $ _ $ _) $ _) =>
paulson@18389
   203
            refl_clause_aux n (th RS disj_assoc)    (*isolate an atom as first disjunct*)
wenzelm@24300
   204
        | (Const ("op |", _) $ (Const("Not",_) $ (Const("op =",_) $ t $ u)) $ _) =>
wenzelm@24300
   205
            if eliminable(t,u)
wenzelm@24300
   206
            then refl_clause_aux (n-1) (th RS not_refl_disj_D)  (*Var inequation: delete*)
wenzelm@24300
   207
            else refl_clause_aux (n-1) (th RS disj_comm)  (*not between Vars: ignore*)
wenzelm@24300
   208
        | (Const ("op |", _) $ _ $ _) => refl_clause_aux n (th RS disj_comm)
wenzelm@24300
   209
        | _ => (*not a disjunction*) th;
paulson@18389
   210
wenzelm@24300
   211
fun notequal_lits_count (Const ("op |", _) $ P $ Q) =
paulson@18389
   212
      notequal_lits_count P + notequal_lits_count Q
paulson@18389
   213
  | notequal_lits_count (Const("Not",_) $ (Const("op =",_) $ _ $ _)) = 1
paulson@18389
   214
  | notequal_lits_count _ = 0;
paulson@18389
   215
paulson@18389
   216
(*Simplify a clause by applying reflexivity to its negated equality literals*)
wenzelm@24300
   217
fun refl_clause th =
paulson@18389
   218
  let val neqs = notequal_lits_count (HOLogic.dest_Trueprop (concl_of th))
paulson@19894
   219
  in  zero_var_indexes (refl_clause_aux neqs th)  end
wenzelm@24300
   220
  handle TERM _ => th;  (*probably dest_Trueprop on a weird theorem*)
paulson@18389
   221
paulson@18389
   222
paulson@24937
   223
(*** Removal of duplicate literals ***)
paulson@24937
   224
paulson@24937
   225
(*Forward proof, passing extra assumptions as theorems to the tactic*)
paulson@24937
   226
fun forward_res2 nf hyps st =
paulson@24937
   227
  case Seq.pull
paulson@24937
   228
        (REPEAT
paulson@24937
   229
         (METAHYPS (fn major::minors => rtac (nf (minors@hyps) major) 1) 1)
paulson@24937
   230
         st)
paulson@24937
   231
  of SOME(th,_) => th
paulson@24937
   232
   | NONE => raise THM("forward_res2", 0, [st]);
paulson@24937
   233
paulson@24937
   234
(*Remove duplicates in P|Q by assuming ~P in Q
paulson@24937
   235
  rls (initially []) accumulates assumptions of the form P==>False*)
paulson@24937
   236
fun nodups_aux rls th = nodups_aux rls (th RS disj_assoc)
paulson@24937
   237
    handle THM _ => tryres(th,rls)
paulson@24937
   238
    handle THM _ => tryres(forward_res2 nodups_aux rls (th RS disj_forward2),
paulson@24937
   239
                           [disj_FalseD1, disj_FalseD2, asm_rl])
paulson@24937
   240
    handle THM _ => th;
paulson@24937
   241
paulson@24937
   242
(*Remove duplicate literals, if there are any*)
paulson@24937
   243
fun nodups th =
paulson@24937
   244
  if has_duplicates (op =) (literals (prop_of th))
paulson@24937
   245
    then nodups_aux [] th
paulson@24937
   246
    else th;
paulson@24937
   247
paulson@24937
   248
paulson@18389
   249
(*** The basic CNF transformation ***)
paulson@18389
   250
paulson@26562
   251
fun too_many_clauses ctxto t = 
paulson@26562
   252
 let
paulson@26562
   253
  val max_cl = case ctxto of SOME ctxt => Config.get ctxt max_clauses
paulson@26562
   254
                           | NONE => max_clauses_default
paulson@26562
   255
  
paulson@26562
   256
  fun sum x y = if x < max_cl andalso y < max_cl then x+y else max_cl;
paulson@26562
   257
  fun prod x y = if x < max_cl andalso y < max_cl then x*y else max_cl;
paulson@26562
   258
  
paulson@26562
   259
  (*Estimate the number of clauses in order to detect infeasible theorems*)
paulson@26562
   260
  fun signed_nclauses b (Const("Trueprop",_) $ t) = signed_nclauses b t
paulson@26562
   261
    | signed_nclauses b (Const("Not",_) $ t) = signed_nclauses (not b) t
paulson@26562
   262
    | signed_nclauses b (Const("op &",_) $ t $ u) =
paulson@26562
   263
	if b then sum (signed_nclauses b t) (signed_nclauses b u)
paulson@26562
   264
	     else prod (signed_nclauses b t) (signed_nclauses b u)
paulson@26562
   265
    | signed_nclauses b (Const("op |",_) $ t $ u) =
paulson@26562
   266
	if b then prod (signed_nclauses b t) (signed_nclauses b u)
paulson@26562
   267
	     else sum (signed_nclauses b t) (signed_nclauses b u)
paulson@26562
   268
    | signed_nclauses b (Const("op -->",_) $ t $ u) =
paulson@26562
   269
	if b then prod (signed_nclauses (not b) t) (signed_nclauses b u)
paulson@26562
   270
	     else sum (signed_nclauses (not b) t) (signed_nclauses b u)
paulson@26562
   271
    | signed_nclauses b (Const("op =", Type ("fun", [T, _])) $ t $ u) =
paulson@26562
   272
	if T = HOLogic.boolT then (*Boolean equality is if-and-only-if*)
paulson@26562
   273
	    if b then sum (prod (signed_nclauses (not b) t) (signed_nclauses b u))
paulson@26562
   274
			  (prod (signed_nclauses (not b) u) (signed_nclauses b t))
paulson@26562
   275
		 else sum (prod (signed_nclauses b t) (signed_nclauses b u))
paulson@26562
   276
			  (prod (signed_nclauses (not b) t) (signed_nclauses (not b) u))
paulson@26562
   277
	else 1
paulson@26562
   278
    | signed_nclauses b (Const("Ex", _) $ Abs (_,_,t)) = signed_nclauses b t
paulson@26562
   279
    | signed_nclauses b (Const("All",_) $ Abs (_,_,t)) = signed_nclauses b t
paulson@26562
   280
    | signed_nclauses _ _ = 1; (* literal *)
paulson@26562
   281
 in 
paulson@26562
   282
  signed_nclauses true t >= max_cl
paulson@26562
   283
 end;
paulson@19894
   284
paulson@15579
   285
(*Replaces universally quantified variables by FREE variables -- because
paulson@24937
   286
  assumptions may not contain scheme variables.  Later, generalize using Variable.export. *)
paulson@24937
   287
local  
paulson@24937
   288
  val spec_var = Thm.dest_arg (Thm.dest_arg (#2 (Thm.dest_implies (Thm.cprop_of spec))));
paulson@24937
   289
  val spec_varT = #T (Thm.rep_cterm spec_var);
paulson@24937
   290
  fun name_of (Const ("All", _) $ Abs(x,_,_)) = x | name_of _ = Name.uu;
paulson@24937
   291
in  
paulson@24937
   292
  fun freeze_spec th ctxt =
paulson@24937
   293
    let
paulson@24937
   294
      val cert = Thm.cterm_of (ProofContext.theory_of ctxt);
paulson@24937
   295
      val ([x], ctxt') = Variable.variant_fixes [name_of (HOLogic.dest_Trueprop (concl_of th))] ctxt;
paulson@24937
   296
      val spec' = Thm.instantiate ([], [(spec_var, cert (Free (x, spec_varT)))]) spec;
paulson@24937
   297
    in (th RS spec', ctxt') end
paulson@24937
   298
end;
paulson@9840
   299
paulson@15998
   300
(*Used with METAHYPS below. There is one assumption, which gets bound to prem
paulson@15998
   301
  and then normalized via function nf. The normal form is given to resolve_tac,
paulson@22515
   302
  instantiate a Boolean variable created by resolution with disj_forward. Since
paulson@22515
   303
  (nf prem) returns a LIST of theorems, we can backtrack to get all combinations.*)
paulson@15579
   304
fun resop nf [prem] = resolve_tac (nf prem) 1;
paulson@9840
   305
wenzelm@24300
   306
(*Any need to extend this list with
wenzelm@26424
   307
  "HOL.type_class","HOL.eq_class","Pure.term"?*)
wenzelm@24300
   308
val has_meta_conn =
paulson@29684
   309
    exists_Const (member (op =) ["==", "==>", "=simp=>", "all", "prop"] o #1);
paulson@20417
   310
wenzelm@24300
   311
fun apply_skolem_ths (th, rls) =
paulson@20417
   312
  let fun tryall [] = raise THM("apply_skolem_ths", 0, th::rls)
paulson@20417
   313
        | tryall (rl::rls) = (first_order_resolve th rl handle THM _ => tryall rls)
paulson@20417
   314
  in  tryall rls  end;
paulson@22515
   315
paulson@15998
   316
(*Conjunctive normal form, adding clauses from th in front of ths (for foldr).
paulson@15998
   317
  Strips universal quantifiers and breaks up conjunctions.
paulson@15998
   318
  Eliminates existential quantifiers using skoths: Skolemization theorems.*)
paulson@24937
   319
fun cnf skoths ctxt (th,ths) =
paulson@24937
   320
  let val ctxtr = ref ctxt
paulson@24937
   321
      fun cnf_aux (th,ths) =
wenzelm@24300
   322
        if not (can HOLogic.dest_Trueprop (prop_of th)) then ths (*meta-level: ignore*)
wenzelm@24300
   323
        else if not (has_conns ["All","Ex","op &"] (prop_of th))
paulson@24937
   324
        then nodups th :: ths (*no work to do, terminate*)
wenzelm@24300
   325
        else case head_of (HOLogic.dest_Trueprop (concl_of th)) of
wenzelm@24300
   326
            Const ("op &", _) => (*conjunction*)
wenzelm@24300
   327
                cnf_aux (th RS conjunct1, cnf_aux (th RS conjunct2, ths))
wenzelm@24300
   328
          | Const ("All", _) => (*universal quantifier*)
paulson@24937
   329
                let val (th',ctxt') = freeze_spec th (!ctxtr)
paulson@24937
   330
                in  ctxtr := ctxt'; cnf_aux (th', ths) end
wenzelm@24300
   331
          | Const ("Ex", _) =>
wenzelm@24300
   332
              (*existential quantifier: Insert Skolem functions*)
wenzelm@24300
   333
              cnf_aux (apply_skolem_ths (th,skoths), ths)
wenzelm@24300
   334
          | Const ("op |", _) =>
wenzelm@24300
   335
              (*Disjunction of P, Q: Create new goal of proving ?P | ?Q and solve it using
wenzelm@24300
   336
                all combinations of converting P, Q to CNF.*)
wenzelm@24300
   337
              let val tac =
wenzelm@24300
   338
                  (METAHYPS (resop cnf_nil) 1) THEN
wenzelm@24300
   339
                   (fn st' => st' |> METAHYPS (resop cnf_nil) 1)
wenzelm@24300
   340
              in  Seq.list_of (tac (th RS disj_forward)) @ ths  end
paulson@24937
   341
          | _ => nodups th :: ths  (*no work to do*)
paulson@19154
   342
      and cnf_nil th = cnf_aux (th,[])
paulson@24937
   343
      val cls = 
paulson@26562
   344
	    if too_many_clauses (SOME ctxt) (concl_of th)
wenzelm@32091
   345
	    then (warning ("cnf is ignoring: " ^ Display.string_of_thm ctxt th); ths)
paulson@24937
   346
	    else cnf_aux (th,ths)
paulson@24937
   347
  in  (cls, !ctxtr)  end;
paulson@22515
   348
paulson@24937
   349
fun make_cnf skoths th ctxt = cnf skoths ctxt (th, []);
paulson@20417
   350
paulson@20417
   351
(*Generalization, removal of redundant equalities, removal of tautologies.*)
paulson@24937
   352
fun finish_cnf ths = filter (not o is_taut) (map refl_clause ths);
paulson@9840
   353
paulson@9840
   354
paulson@15579
   355
(**** Generation of contrapositives ****)
paulson@9840
   356
wenzelm@24300
   357
fun is_left (Const ("Trueprop", _) $
paulson@21102
   358
               (Const ("op |", _) $ (Const ("op |", _) $ _ $ _) $ _)) = true
paulson@21102
   359
  | is_left _ = false;
wenzelm@24300
   360
paulson@15579
   361
(*Associate disjuctions to right -- make leftmost disjunct a LITERAL*)
wenzelm@24300
   362
fun assoc_right th =
paulson@21102
   363
  if is_left (prop_of th) then assoc_right (th RS disj_assoc)
paulson@21102
   364
  else th;
paulson@9840
   365
paulson@15579
   366
(*Must check for negative literal first!*)
paulson@15579
   367
val clause_rules = [disj_assoc, make_neg_rule, make_pos_rule];
paulson@9840
   368
paulson@15579
   369
(*For ordinary resolution. *)
paulson@15579
   370
val resolution_clause_rules = [disj_assoc, make_neg_rule', make_pos_rule'];
paulson@9840
   371
paulson@15579
   372
(*Create a goal or support clause, conclusing False*)
paulson@15579
   373
fun make_goal th =   (*Must check for negative literal first!*)
paulson@15579
   374
    make_goal (tryres(th, clause_rules))
paulson@15579
   375
  handle THM _ => tryres(th, [make_neg_goal, make_pos_goal]);
paulson@9840
   376
paulson@15579
   377
(*Sort clauses by number of literals*)
paulson@15579
   378
fun fewerlits(th1,th2) = nliterals(prop_of th1) < nliterals(prop_of th2);
paulson@9840
   379
paulson@18389
   380
fun sort_clauses ths = sort (make_ord fewerlits) ths;
paulson@9840
   381
paulson@15581
   382
(*True if the given type contains bool anywhere*)
paulson@15581
   383
fun has_bool (Type("bool",_)) = true
paulson@15581
   384
  | has_bool (Type(_, Ts)) = exists has_bool Ts
paulson@15581
   385
  | has_bool _ = false;
wenzelm@24300
   386
wenzelm@24300
   387
(*Is the string the name of a connective? Really only | and Not can remain,
wenzelm@24300
   388
  since this code expects to be called on a clause form.*)
wenzelm@19875
   389
val is_conn = member (op =)
wenzelm@24300
   390
    ["Trueprop", "op &", "op |", "op -->", "Not",
paulson@15613
   391
     "All", "Ex", "Ball", "Bex"];
paulson@15613
   392
wenzelm@24300
   393
(*True if the term contains a function--not a logical connective--where the type
paulson@20524
   394
  of any argument contains bool.*)
wenzelm@24300
   395
val has_bool_arg_const =
paulson@15613
   396
    exists_Const
paulson@15613
   397
      (fn (c,T) => not(is_conn c) andalso exists (has_bool) (binder_types T));
paulson@22381
   398
wenzelm@24300
   399
(*A higher-order instance of a first-order constant? Example is the definition of
paulson@22381
   400
  HOL.one, 1, at a function type in theory SetsAndFunctions.*)
wenzelm@24300
   401
fun higher_inst_const thy (c,T) =
paulson@22381
   402
  case binder_types T of
paulson@22381
   403
      [] => false (*not a function type, OK*)
paulson@22381
   404
    | Ts => length (binder_types (Sign.the_const_type thy c)) <> length Ts;
paulson@22381
   405
paulson@24742
   406
(*Returns false if any Vars in the theorem mention type bool.
paulson@21102
   407
  Also rejects functions whose arguments are Booleans or other functions.*)
paulson@22381
   408
fun is_fol_term thy t =
paulson@22381
   409
    Term.is_first_order ["all","All","Ex"] t andalso
wenzelm@29267
   410
    not (exists_subterm (fn Var (_, T) => has_bool T | _ => false) t  orelse
wenzelm@24300
   411
         has_bool_arg_const t  orelse
wenzelm@24300
   412
         exists_Const (higher_inst_const thy) t orelse
wenzelm@24300
   413
         has_meta_conn t);
paulson@19204
   414
paulson@21102
   415
fun rigid t = not (is_Var (head_of t));
paulson@21102
   416
paulson@21102
   417
fun ok4horn (Const ("Trueprop",_) $ (Const ("op |", _) $ t $ _)) = rigid t
paulson@21102
   418
  | ok4horn (Const ("Trueprop",_) $ t) = rigid t
paulson@21102
   419
  | ok4horn _ = false;
paulson@21102
   420
paulson@15579
   421
(*Create a meta-level Horn clause*)
wenzelm@24300
   422
fun make_horn crules th =
wenzelm@24300
   423
  if ok4horn (concl_of th)
paulson@21102
   424
  then make_horn crules (tryres(th,crules)) handle THM _ => th
paulson@21102
   425
  else th;
paulson@9840
   426
paulson@16563
   427
(*Generate Horn clauses for all contrapositives of a clause. The input, th,
paulson@16563
   428
  is a HOL disjunction.*)
paulson@15579
   429
fun add_contras crules (th,hcs) =
paulson@15579
   430
  let fun rots (0,th) = hcs
wenzelm@24300
   431
        | rots (k,th) = zero_var_indexes (make_horn crules th) ::
wenzelm@24300
   432
                        rots(k-1, assoc_right (th RS disj_comm))
paulson@15862
   433
  in case nliterals(prop_of th) of
wenzelm@24300
   434
        1 => th::hcs
paulson@15579
   435
      | n => rots(n, assoc_right th)
paulson@15579
   436
  end;
paulson@9840
   437
paulson@15579
   438
(*Use "theorem naming" to label the clauses*)
paulson@15579
   439
fun name_thms label =
paulson@15579
   440
    let fun name1 (th, (k,ths)) =
wenzelm@27865
   441
          (k-1, Thm.put_name_hint (label ^ string_of_int k) th :: ths)
wenzelm@30190
   442
    in  fn ths => #2 (List.foldr name1 (length ths, []) ths)  end;
paulson@9840
   443
paulson@16563
   444
(*Is the given disjunction an all-negative support clause?*)
paulson@15579
   445
fun is_negative th = forall (not o #1) (literals (prop_of th));
paulson@9840
   446
paulson@15579
   447
val neg_clauses = List.filter is_negative;
paulson@9840
   448
paulson@9840
   449
paulson@15579
   450
(***** MESON PROOF PROCEDURE *****)
paulson@9840
   451
paulson@15579
   452
fun rhyps (Const("==>",_) $ (Const("Trueprop",_) $ A) $ phi,
wenzelm@24300
   453
           As) = rhyps(phi, A::As)
paulson@15579
   454
  | rhyps (_, As) = As;
paulson@9840
   455
paulson@15579
   456
(** Detecting repeated assumptions in a subgoal **)
paulson@9840
   457
paulson@15579
   458
(*The stringtree detects repeated assumptions.*)
wenzelm@16801
   459
fun ins_term (net,t) = Net.insert_term (op aconv) (t,t) net;
paulson@9840
   460
paulson@15579
   461
(*detects repetitions in a list of terms*)
paulson@15579
   462
fun has_reps [] = false
paulson@15579
   463
  | has_reps [_] = false
paulson@15579
   464
  | has_reps [t,u] = (t aconv u)
paulson@15579
   465
  | has_reps ts = (Library.foldl ins_term (Net.empty, ts);  false)
wenzelm@24300
   466
                  handle Net.INSERT => true;
paulson@9840
   467
paulson@15579
   468
(*Like TRYALL eq_assume_tac, but avoids expensive THEN calls*)
paulson@18508
   469
fun TRYING_eq_assume_tac 0 st = Seq.single st
paulson@18508
   470
  | TRYING_eq_assume_tac i st =
wenzelm@31945
   471
       TRYING_eq_assume_tac (i-1) (Thm.eq_assumption i st)
paulson@18508
   472
       handle THM _ => TRYING_eq_assume_tac (i-1) st;
paulson@18508
   473
paulson@18508
   474
fun TRYALL_eq_assume_tac st = TRYING_eq_assume_tac (nprems_of st) st;
paulson@9840
   475
paulson@15579
   476
(*Loop checking: FAIL if trying to prove the same thing twice
paulson@15579
   477
  -- if *ANY* subgoal has repeated literals*)
paulson@15579
   478
fun check_tac st =
paulson@15579
   479
  if exists (fn prem => has_reps (rhyps(prem,[]))) (prems_of st)
paulson@15579
   480
  then  Seq.empty  else  Seq.single st;
paulson@9840
   481
paulson@9840
   482
paulson@15579
   483
(* net_resolve_tac actually made it slower... *)
paulson@15579
   484
fun prolog_step_tac horns i =
paulson@15579
   485
    (assume_tac i APPEND resolve_tac horns i) THEN check_tac THEN
paulson@18508
   486
    TRYALL_eq_assume_tac;
paulson@9840
   487
paulson@9840
   488
(*Sums the sizes of the subgoals, ignoring hypotheses (ancestors)*)
paulson@15579
   489
fun addconcl(prem,sz) = size_of_term(Logic.strip_assums_concl prem) + sz
paulson@15579
   490
wenzelm@30190
   491
fun size_of_subgoals st = List.foldr addconcl 0 (prems_of st);
paulson@15579
   492
paulson@9840
   493
paulson@9840
   494
(*Negation Normal Form*)
paulson@9840
   495
val nnf_rls = [imp_to_disjD, iff_to_disjD, not_conjD, not_disjD,
wenzelm@9869
   496
               not_impD, not_iffD, not_allD, not_exD, not_notD];
paulson@15581
   497
paulson@21102
   498
fun ok4nnf (Const ("Trueprop",_) $ (Const ("Not", _) $ t)) = rigid t
paulson@21102
   499
  | ok4nnf (Const ("Trueprop",_) $ t) = rigid t
paulson@21102
   500
  | ok4nnf _ = false;
paulson@21102
   501
wenzelm@24300
   502
fun make_nnf1 th =
wenzelm@24300
   503
  if ok4nnf (concl_of th)
paulson@21102
   504
  then make_nnf1 (tryres(th, nnf_rls))
paulson@28174
   505
    handle THM ("tryres", _, _) =>
paulson@15581
   506
        forward_res make_nnf1
wenzelm@9869
   507
           (tryres(th, [conj_forward,disj_forward,all_forward,ex_forward]))
paulson@28174
   508
    handle THM ("tryres", _, _) => th
paulson@21102
   509
  else th;
paulson@9840
   510
wenzelm@24300
   511
(*The simplification removes defined quantifiers and occurrences of True and False.
paulson@20018
   512
  nnf_ss also includes the one-point simprocs,
paulson@18405
   513
  which are needed to avoid the various one-point theorems from generating junk clauses.*)
paulson@19894
   514
val nnf_simps =
wenzelm@24300
   515
     [simp_implies_def, Ex1_def, Ball_def, Bex_def, if_True,
paulson@19894
   516
      if_False, if_cancel, if_eq_cancel, cases_simp];
paulson@19894
   517
val nnf_extra_simps =
paulson@19894
   518
      thms"split_ifs" @ ex_simps @ all_simps @ simp_thms;
paulson@18405
   519
paulson@18405
   520
val nnf_ss =
wenzelm@24300
   521
  HOL_basic_ss addsimps nnf_extra_simps
wenzelm@24040
   522
    addsimprocs [defALL_regroup,defEX_regroup, @{simproc neq}, @{simproc let_simp}];
paulson@15872
   523
paulson@21050
   524
fun make_nnf th = case prems_of th of
paulson@21050
   525
    [] => th |> rewrite_rule (map safe_mk_meta_eq nnf_simps)
wenzelm@24300
   526
             |> simplify nnf_ss
wenzelm@24300
   527
             |> make_nnf1
paulson@21050
   528
  | _ => raise THM ("make_nnf: premises in argument", 0, [th]);
paulson@15581
   529
paulson@15965
   530
(*Pull existential quantifiers to front. This accomplishes Skolemization for
paulson@15965
   531
  clauses that arise from a subgoal.*)
paulson@29684
   532
fun skolemize1 th =
paulson@20134
   533
  if not (has_conns ["Ex"] (prop_of th)) then th
paulson@29684
   534
  else (skolemize1 (tryres(th, [choice, conj_exD1, conj_exD2,
quigley@15679
   535
                              disj_exD, disj_exD1, disj_exD2])))
paulson@28174
   536
    handle THM ("tryres", _, _) =>
paulson@29684
   537
        skolemize1 (forward_res skolemize1
wenzelm@9869
   538
                   (tryres (th, [conj_forward, disj_forward, all_forward])))
paulson@28174
   539
    handle THM ("tryres", _, _) => 
paulson@29684
   540
        forward_res skolemize1 (rename_bvs_RS th ex_forward);
paulson@29684
   541
paulson@29684
   542
fun skolemize th = skolemize1 (make_nnf th);
paulson@9840
   543
paulson@25694
   544
fun skolemize_nnf_list [] = []
paulson@25694
   545
  | skolemize_nnf_list (th::ths) = 
paulson@29684
   546
      skolemize th :: skolemize_nnf_list ths
paulson@25710
   547
      handle THM _ => (*RS can fail if Unify.search_bound is too small*)
wenzelm@32091
   548
       (warning ("Failed to Skolemize " ^ Display.string_of_thm_without_context th);
paulson@25694
   549
        skolemize_nnf_list ths);
paulson@25694
   550
paulson@24937
   551
fun add_clauses (th,cls) =
paulson@24937
   552
  let val ctxt0 = Variable.thm_context th
paulson@24937
   553
      val (cnfs,ctxt) = make_cnf [] th ctxt0
paulson@24937
   554
  in Variable.export ctxt ctxt0 cnfs @ cls end;
paulson@9840
   555
paulson@9840
   556
(*Make clauses from a list of theorems, previously Skolemized and put into nnf.
paulson@9840
   557
  The resulting clauses are HOL disjunctions.*)
wenzelm@30190
   558
fun make_clauses ths = sort_clauses (List.foldr add_clauses [] ths);
quigley@15773
   559
paulson@16563
   560
(*Convert a list of clauses (disjunctions) to Horn clauses (contrapositives)*)
wenzelm@9869
   561
fun make_horns ths =
paulson@9840
   562
    name_thms "Horn#"
wenzelm@30190
   563
      (distinct Thm.eq_thm_prop (List.foldr (add_contras clause_rules) [] ths));
paulson@9840
   564
paulson@9840
   565
(*Could simply use nprems_of, which would count remaining subgoals -- no
paulson@9840
   566
  discrimination as to their size!  With BEST_FIRST, fails for problem 41.*)
paulson@9840
   567
wenzelm@9869
   568
fun best_prolog_tac sizef horns =
paulson@9840
   569
    BEST_FIRST (has_fewer_prems 1, sizef) (prolog_step_tac horns 1);
paulson@9840
   570
wenzelm@9869
   571
fun depth_prolog_tac horns =
paulson@9840
   572
    DEPTH_FIRST (has_fewer_prems 1) (prolog_step_tac horns 1);
paulson@9840
   573
paulson@9840
   574
(*Return all negative clauses, as possible goal clauses*)
paulson@9840
   575
fun gocls cls = name_thms "Goal#" (map make_goal (neg_clauses cls));
paulson@9840
   576
paulson@15008
   577
fun skolemize_prems_tac prems =
paulson@25694
   578
    cut_facts_tac (skolemize_nnf_list prems) THEN'
paulson@9840
   579
    REPEAT o (etac exE);
paulson@9840
   580
paulson@22546
   581
(*Basis of all meson-tactics.  Supplies cltac with clauses: HOL disjunctions.
paulson@22546
   582
  Function mkcl converts theorems to clauses.*)
wenzelm@24300
   583
fun MESON mkcl cltac i st =
paulson@16588
   584
  SELECT_GOAL
wenzelm@23590
   585
    (EVERY [ObjectLogic.atomize_prems_tac 1,
paulson@23552
   586
            rtac ccontr 1,
wenzelm@24300
   587
            METAHYPS (fn negs =>
wenzelm@24300
   588
                      EVERY1 [skolemize_prems_tac negs,
wenzelm@24300
   589
                              METAHYPS (cltac o mkcl)]) 1]) i st
wenzelm@24300
   590
  handle THM _ => no_tac st;    (*probably from make_meta_clause, not first-order*)
paulson@9840
   591
paulson@9840
   592
(** Best-first search versions **)
paulson@9840
   593
paulson@16563
   594
(*ths is a list of additional clauses (HOL disjunctions) to use.*)
wenzelm@9869
   595
fun best_meson_tac sizef =
wenzelm@24300
   596
  MESON make_clauses
paulson@22546
   597
    (fn cls =>
paulson@9840
   598
         THEN_BEST_FIRST (resolve_tac (gocls cls) 1)
paulson@9840
   599
                         (has_fewer_prems 1, sizef)
paulson@9840
   600
                         (prolog_step_tac (make_horns cls) 1));
paulson@9840
   601
paulson@9840
   602
(*First, breaks the goal into independent units*)
wenzelm@30607
   603
fun safe_best_meson_tac cs =
wenzelm@30607
   604
     SELECT_GOAL (TRY (safe_tac cs) THEN
paulson@9840
   605
                  TRYALL (best_meson_tac size_of_subgoals));
paulson@9840
   606
paulson@9840
   607
(** Depth-first search version **)
paulson@9840
   608
paulson@9840
   609
val depth_meson_tac =
paulson@22546
   610
  MESON make_clauses
paulson@22546
   611
    (fn cls => EVERY [resolve_tac (gocls cls) 1, depth_prolog_tac (make_horns cls)]);
paulson@9840
   612
paulson@9840
   613
paulson@9840
   614
(** Iterative deepening version **)
paulson@9840
   615
paulson@9840
   616
(*This version does only one inference per call;
paulson@9840
   617
  having only one eq_assume_tac speeds it up!*)
wenzelm@9869
   618
fun prolog_step_tac' horns =
paulson@9840
   619
    let val (horn0s, hornps) = (*0 subgoals vs 1 or more*)
paulson@9840
   620
            take_prefix Thm.no_prems horns
paulson@9840
   621
        val nrtac = net_resolve_tac horns
paulson@9840
   622
    in  fn i => eq_assume_tac i ORELSE
paulson@9840
   623
                match_tac horn0s i ORELSE  (*no backtracking if unit MATCHES*)
paulson@9840
   624
                ((assume_tac i APPEND nrtac i) THEN check_tac)
paulson@9840
   625
    end;
paulson@9840
   626
wenzelm@9869
   627
fun iter_deepen_prolog_tac horns =
paulson@9840
   628
    ITER_DEEPEN (has_fewer_prems 1) (prolog_step_tac' horns);
paulson@9840
   629
wenzelm@24300
   630
fun iter_deepen_meson_tac ths = MESON make_clauses
wenzelm@32091
   631
  (fn cls =>
wenzelm@32091
   632
    (case (gocls (cls @ ths)) of
wenzelm@32091
   633
      [] => no_tac  (*no goal clauses*)
wenzelm@32091
   634
    | goes =>
wenzelm@32091
   635
        let
wenzelm@32091
   636
          val horns = make_horns (cls @ ths)
wenzelm@32091
   637
          val _ = Output.debug (fn () =>
wenzelm@32091
   638
            cat_lines ("meson method called:" ::
wenzelm@32091
   639
              map Display.string_of_thm_without_context (cls @ ths) @
wenzelm@32091
   640
              ["clauses:"] @ map Display.string_of_thm_without_context horns))
wenzelm@32091
   641
        in THEN_ITER_DEEPEN (resolve_tac goes 1) (has_fewer_prems 1) (prolog_step_tac' horns) end));
paulson@9840
   642
paulson@16563
   643
fun meson_claset_tac ths cs =
paulson@16563
   644
  SELECT_GOAL (TRY (safe_tac cs) THEN TRYALL (iter_deepen_meson_tac ths));
wenzelm@9869
   645
wenzelm@30607
   646
val meson_tac = meson_claset_tac [];
wenzelm@9869
   647
wenzelm@9869
   648
paulson@14813
   649
(**** Code to support ordinary resolution, rather than Model Elimination ****)
paulson@14744
   650
wenzelm@24300
   651
(*Convert a list of clauses (disjunctions) to meta-level clauses (==>),
paulson@15008
   652
  with no contrapositives, for ordinary resolution.*)
paulson@14744
   653
paulson@14744
   654
(*Rules to convert the head literal into a negated assumption. If the head
paulson@14744
   655
  literal is already negated, then using notEfalse instead of notEfalse'
paulson@14744
   656
  prevents a double negation.*)
wenzelm@27239
   657
val notEfalse = read_instantiate @{context} [(("R", 0), "False")] notE;
paulson@14744
   658
val notEfalse' = rotate_prems 1 notEfalse;
paulson@14744
   659
wenzelm@24300
   660
fun negated_asm_of_head th =
paulson@14744
   661
    th RS notEfalse handle THM _ => th RS notEfalse';
paulson@14744
   662
paulson@26066
   663
(*Converting one theorem from a disjunction to a meta-level clause*)
paulson@26066
   664
fun make_meta_clause th =
paulson@26066
   665
  let val (fth,thaw) = Drule.freeze_thaw_robust th
paulson@26066
   666
  in  
paulson@26066
   667
      (zero_var_indexes o Thm.varifyT o thaw 0 o 
paulson@26066
   668
       negated_asm_of_head o make_horn resolution_clause_rules) fth
paulson@26066
   669
  end;
wenzelm@24300
   670
paulson@14744
   671
fun make_meta_clauses ths =
paulson@14744
   672
    name_thms "MClause#"
wenzelm@22360
   673
      (distinct Thm.eq_thm_prop (map make_meta_clause ths));
paulson@14744
   674
paulson@14744
   675
(*Permute a rule's premises to move the i-th premise to the last position.*)
paulson@14744
   676
fun make_last i th =
wenzelm@24300
   677
  let val n = nprems_of th
wenzelm@24300
   678
  in  if 1 <= i andalso i <= n
paulson@14744
   679
      then Thm.permute_prems (i-1) 1 th
paulson@15118
   680
      else raise THM("select_literal", i, [th])
paulson@14744
   681
  end;
paulson@14744
   682
paulson@14744
   683
(*Maps a rule that ends "... ==> P ==> False" to "... ==> ~P" while suppressing
paulson@14744
   684
  double-negations.*)
paulson@14744
   685
val negate_head = rewrite_rule [atomize_not, not_not RS eq_reflection];
paulson@14744
   686
paulson@14744
   687
(*Maps the clause  [P1,...Pn]==>False to [P1,...,P(i-1),P(i+1),...Pn] ==> ~P*)
paulson@14744
   688
fun select_literal i cl = negate_head (make_last i cl);
paulson@14744
   689
paulson@18508
   690
paulson@14813
   691
(*Top-level Skolemization. Allows part of the conversion to clauses to be
wenzelm@24300
   692
  expressed as a tactic (or Isar method).  Each assumption of the selected
paulson@14813
   693
  goal is converted to NNF and then its existential quantifiers are pulled
wenzelm@24300
   694
  to the front. Finally, all existential quantifiers are eliminated,
paulson@14813
   695
  leaving !!-quantified variables. Perhaps Safe_tac should follow, but it
paulson@14813
   696
  might generate many subgoals.*)
mengj@18194
   697
wenzelm@24300
   698
fun skolemize_tac i st =
paulson@19204
   699
  let val ts = Logic.strip_assums_hyp (List.nth (prems_of st, i-1))
wenzelm@24300
   700
  in
paulson@19204
   701
     EVERY' [METAHYPS
paulson@25694
   702
            (fn hyps => (cut_facts_tac (skolemize_nnf_list hyps) 1
paulson@14813
   703
                         THEN REPEAT (etac exE 1))),
paulson@19204
   704
            REPEAT_DETERM_N (length ts) o (etac thin_rl)] i st
paulson@19204
   705
  end
paulson@19204
   706
  handle Subscript => Seq.empty;
mengj@18194
   707
paulson@9840
   708
end;