src/HOL/Tools/Sledgehammer/meson_clausify.ML
author blanchet
Thu Sep 30 18:59:37 2010 +0200 (2010-09-30)
changeset 39894 35ae5cf8c96a
parent 39891 8e12f1956fcd
child 39896 13b3a2ba9ea7
permissions -rw-r--r--
encode number of skolem assumptions in them, for more efficient retrieval later
blanchet@39890
     1
(*  Title:      HOL/Tools/Sledgehammer/meson_clausify.ML
blanchet@38027
     2
    Author:     Jia Meng, Cambridge University Computer Laboratory and NICTA
blanchet@36393
     3
    Author:     Jasmin Blanchette, TU Muenchen
paulson@15347
     4
wenzelm@20461
     5
Transformation of axiom rules (elim/intro/etc) into CNF forms.
paulson@15347
     6
*)
paulson@15347
     7
blanchet@39890
     8
signature MESON_CLAUSIFY =
wenzelm@21505
     9
sig
blanchet@39887
    10
  val new_skolem_var_prefix : string
blanchet@38632
    11
  val extensionalize_theorem : thm -> thm
blanchet@38001
    12
  val introduce_combinators_in_cterm : cterm -> thm
blanchet@38028
    13
  val introduce_combinators_in_theorem : thm -> thm
blanchet@39037
    14
  val to_definitional_cnf_with_quantifiers : theory -> thm -> thm
blanchet@39894
    15
  val cnf_axiom : theory -> bool -> int -> thm -> thm option * thm list
blanchet@39720
    16
  val meson_general_tac : Proof.context -> thm list -> int -> tactic
blanchet@39720
    17
  val setup: theory -> theory
wenzelm@21505
    18
end;
mengj@19196
    19
blanchet@39890
    20
structure Meson_Clausify : MESON_CLAUSIFY =
paulson@15997
    21
struct
paulson@15347
    22
blanchet@39887
    23
val new_skolem_var_prefix = "SK?" (* purposedly won't parse *)
blanchet@39887
    24
paulson@15997
    25
(**** Transformation of Elimination Rules into First-Order Formulas****)
paulson@15347
    26
wenzelm@29064
    27
val cfalse = cterm_of @{theory HOL} HOLogic.false_const;
wenzelm@29064
    28
val ctp_false = cterm_of @{theory HOL} (HOLogic.mk_Trueprop HOLogic.false_const);
wenzelm@20461
    29
blanchet@38001
    30
(* Converts an elim-rule into an equivalent theorem that does not have the
blanchet@38001
    31
   predicate variable. Leaves other theorems unchanged. We simply instantiate
blanchet@38001
    32
   the conclusion variable to False. (Cf. "transform_elim_term" in
blanchet@38652
    33
   "Sledgehammer_Util".) *)
blanchet@38001
    34
fun transform_elim_theorem th =
paulson@21430
    35
  case concl_of th of    (*conclusion variable*)
blanchet@35963
    36
       @{const Trueprop} $ (v as Var (_, @{typ bool})) =>
wenzelm@29064
    37
           Thm.instantiate ([], [(cterm_of @{theory HOL} v, cfalse)]) th
blanchet@35963
    38
    | v as Var(_, @{typ prop}) =>
wenzelm@29064
    39
           Thm.instantiate ([], [(cterm_of @{theory HOL} v, ctp_false)]) th
blanchet@38001
    40
    | _ => th
paulson@15997
    41
wenzelm@28544
    42
paulson@16009
    43
(**** SKOLEMIZATION BY INFERENCE (lcp) ****)
paulson@16009
    44
blanchet@39886
    45
fun mk_old_skolem_term_wrapper t =
blanchet@37436
    46
  let val T = fastype_of t in
blanchet@39355
    47
    Const (@{const_name skolem}, T --> T) $ t
blanchet@37436
    48
  end
blanchet@37410
    49
blanchet@37617
    50
fun beta_eta_under_lambdas (Abs (s, T, t')) =
blanchet@37617
    51
    Abs (s, T, beta_eta_under_lambdas t')
blanchet@37617
    52
  | beta_eta_under_lambdas t = Envir.beta_eta_contract t
blanchet@37512
    53
paulson@18141
    54
(*Traverse a theorem, accumulating Skolem function definitions.*)
blanchet@39886
    55
fun old_skolem_defs th =
blanchet@37399
    56
  let
blanchet@39376
    57
    fun dec_sko (Const (@{const_name Ex}, _) $ (body as Abs (_, T, p))) rhss =
blanchet@37399
    58
        (*Existential: declare a Skolem function, then insert into body and continue*)
blanchet@37399
    59
        let
blanchet@37617
    60
          val args = OldTerm.term_frees body
blanchet@37500
    61
          (* Forms a lambda-abstraction over the formal parameters *)
blanchet@37500
    62
          val rhs =
blanchet@37500
    63
            list_abs_free (map dest_Free args,
blanchet@37617
    64
                           HOLogic.choice_const T $ beta_eta_under_lambdas body)
blanchet@39886
    65
            |> mk_old_skolem_term_wrapper
blanchet@37518
    66
          val comb = list_comb (rhs, args)
blanchet@37617
    67
        in dec_sko (subst_bound (comb, p)) (rhs :: rhss) end
blanchet@37617
    68
      | dec_sko (Const (@{const_name All},_) $ Abs (a, T, p)) rhss =
blanchet@37399
    69
        (*Universal quant: insert a free variable into body and continue*)
blanchet@37399
    70
        let val fname = Name.variant (OldTerm.add_term_names (p,[])) a
blanchet@37617
    71
        in dec_sko (subst_bound (Free(fname,T), p)) rhss end
haftmann@38795
    72
      | dec_sko (@{const HOL.conj} $ p $ q) rhss = rhss |> dec_sko p |> dec_sko q
haftmann@38795
    73
      | dec_sko (@{const HOL.disj} $ p $ q) rhss = rhss |> dec_sko p |> dec_sko q
blanchet@37617
    74
      | dec_sko (@{const Trueprop} $ p) rhss = dec_sko p rhss
blanchet@37617
    75
      | dec_sko _ rhss = rhss
paulson@20419
    76
  in  dec_sko (prop_of th) []  end;
paulson@20419
    77
paulson@20419
    78
paulson@24827
    79
(**** REPLACING ABSTRACTIONS BY COMBINATORS ****)
paulson@20419
    80
nipkow@39302
    81
val fun_cong_all = @{thm fun_eq_iff [THEN iffD1]}
paulson@20419
    82
blanchet@38001
    83
(* Removes the lambdas from an equation of the form "t = (%x. u)".
blanchet@38608
    84
   (Cf. "extensionalize_term" in "Sledgehammer_Translate".) *)
blanchet@38000
    85
fun extensionalize_theorem th =
blanchet@37540
    86
  case prop_of th of
haftmann@38864
    87
    _ $ (Const (@{const_name HOL.eq}, Type (_, [Type (@{type_name fun}, _), _]))
blanchet@39376
    88
         $ _ $ Abs _) => extensionalize_theorem (th RS fun_cong_all)
blanchet@37540
    89
  | _ => th
paulson@20419
    90
blanchet@39355
    91
fun is_quasi_lambda_free (Const (@{const_name skolem}, _) $ _) = true
blanchet@37416
    92
  | is_quasi_lambda_free (t1 $ t2) =
blanchet@37416
    93
    is_quasi_lambda_free t1 andalso is_quasi_lambda_free t2
blanchet@37416
    94
  | is_quasi_lambda_free (Abs _) = false
blanchet@37416
    95
  | is_quasi_lambda_free _ = true
wenzelm@20461
    96
wenzelm@32010
    97
val [f_B,g_B] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_B}));
wenzelm@32010
    98
val [g_C,f_C] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_C}));
wenzelm@32010
    99
val [f_S,g_S] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_S}));
paulson@20863
   100
blanchet@38282
   101
(* FIXME: Requires more use of cterm constructors. *)
paulson@24827
   102
fun abstract ct =
wenzelm@28544
   103
  let
wenzelm@28544
   104
      val thy = theory_of_cterm ct
paulson@25256
   105
      val Abs(x,_,body) = term_of ct
blanchet@35963
   106
      val Type(@{type_name fun}, [xT,bodyT]) = typ_of (ctyp_of_term ct)
blanchet@38005
   107
      val cxT = ctyp_of thy xT
blanchet@38005
   108
      val cbodyT = ctyp_of thy bodyT
blanchet@38005
   109
      fun makeK () =
blanchet@38005
   110
        instantiate' [SOME cxT, SOME cbodyT] [SOME (cterm_of thy body)]
blanchet@38005
   111
                     @{thm abs_K}
paulson@24827
   112
  in
paulson@24827
   113
      case body of
paulson@24827
   114
          Const _ => makeK()
paulson@24827
   115
        | Free _ => makeK()
paulson@24827
   116
        | Var _ => makeK()  (*though Var isn't expected*)
wenzelm@27184
   117
        | Bound 0 => instantiate' [SOME cxT] [] @{thm abs_I} (*identity: I*)
paulson@24827
   118
        | rator$rand =>
wenzelm@27184
   119
            if loose_bvar1 (rator,0) then (*C or S*)
wenzelm@27179
   120
               if loose_bvar1 (rand,0) then (*S*)
wenzelm@27179
   121
                 let val crator = cterm_of thy (Abs(x,xT,rator))
wenzelm@27179
   122
                     val crand = cterm_of thy (Abs(x,xT,rand))
wenzelm@27184
   123
                     val abs_S' = cterm_instantiate [(f_S,crator),(g_S,crand)] @{thm abs_S}
wenzelm@27184
   124
                     val (_,rhs) = Thm.dest_equals (cprop_of abs_S')
wenzelm@27179
   125
                 in
wenzelm@27179
   126
                   Thm.transitive abs_S' (Conv.binop_conv abstract rhs)
wenzelm@27179
   127
                 end
wenzelm@27179
   128
               else (*C*)
wenzelm@27179
   129
                 let val crator = cterm_of thy (Abs(x,xT,rator))
wenzelm@27184
   130
                     val abs_C' = cterm_instantiate [(f_C,crator),(g_C,cterm_of thy rand)] @{thm abs_C}
wenzelm@27184
   131
                     val (_,rhs) = Thm.dest_equals (cprop_of abs_C')
wenzelm@27179
   132
                 in
wenzelm@27179
   133
                   Thm.transitive abs_C' (Conv.fun_conv (Conv.arg_conv abstract) rhs)
wenzelm@27179
   134
                 end
wenzelm@27184
   135
            else if loose_bvar1 (rand,0) then (*B or eta*)
wenzelm@36945
   136
               if rand = Bound 0 then Thm.eta_conversion ct
wenzelm@27179
   137
               else (*B*)
wenzelm@27179
   138
                 let val crand = cterm_of thy (Abs(x,xT,rand))
wenzelm@27179
   139
                     val crator = cterm_of thy rator
wenzelm@27184
   140
                     val abs_B' = cterm_instantiate [(f_B,crator),(g_B,crand)] @{thm abs_B}
wenzelm@27184
   141
                     val (_,rhs) = Thm.dest_equals (cprop_of abs_B')
blanchet@37349
   142
                 in Thm.transitive abs_B' (Conv.arg_conv abstract rhs) end
wenzelm@27179
   143
            else makeK()
blanchet@37349
   144
        | _ => raise Fail "abstract: Bad term"
paulson@24827
   145
  end;
paulson@20863
   146
blanchet@37349
   147
(* Traverse a theorem, remplacing lambda-abstractions with combinators. *)
blanchet@38001
   148
fun introduce_combinators_in_cterm ct =
blanchet@37416
   149
  if is_quasi_lambda_free (term_of ct) then
blanchet@37349
   150
    Thm.reflexive ct
blanchet@37349
   151
  else case term_of ct of
blanchet@37349
   152
    Abs _ =>
blanchet@37349
   153
    let
blanchet@37349
   154
      val (cv, cta) = Thm.dest_abs NONE ct
blanchet@37349
   155
      val (v, _) = dest_Free (term_of cv)
blanchet@38001
   156
      val u_th = introduce_combinators_in_cterm cta
blanchet@37349
   157
      val cu = Thm.rhs_of u_th
blanchet@37349
   158
      val comb_eq = abstract (Thm.cabs cv cu)
blanchet@37349
   159
    in Thm.transitive (Thm.abstract_rule v cv u_th) comb_eq end
blanchet@37349
   160
  | _ $ _ =>
blanchet@37349
   161
    let val (ct1, ct2) = Thm.dest_comb ct in
blanchet@38001
   162
        Thm.combination (introduce_combinators_in_cterm ct1)
blanchet@38001
   163
                        (introduce_combinators_in_cterm ct2)
blanchet@37349
   164
    end
blanchet@37349
   165
blanchet@38001
   166
fun introduce_combinators_in_theorem th =
blanchet@37416
   167
  if is_quasi_lambda_free (prop_of th) then
blanchet@37349
   168
    th
paulson@24827
   169
  else
blanchet@37349
   170
    let
blanchet@37349
   171
      val th = Drule.eta_contraction_rule th
blanchet@38001
   172
      val eqth = introduce_combinators_in_cterm (cprop_of th)
blanchet@37349
   173
    in Thm.equal_elim eqth th end
blanchet@37349
   174
    handle THM (msg, _, _) =>
blanchet@37349
   175
           (warning ("Error in the combinator translation of " ^
blanchet@37349
   176
                     Display.string_of_thm_without_context th ^
blanchet@37349
   177
                     "\nException message: " ^ msg ^ ".");
blanchet@37349
   178
            (* A type variable of sort "{}" will make abstraction fail. *)
blanchet@37349
   179
            TrueI)
paulson@16009
   180
paulson@16009
   181
(*cterms are used throughout for efficiency*)
blanchet@38280
   182
val cTrueprop = cterm_of @{theory HOL} HOLogic.Trueprop;
paulson@16009
   183
paulson@16009
   184
(*Given an abstraction over n variables, replace the bound variables by free
paulson@16009
   185
  ones. Return the body, along with the list of free variables.*)
wenzelm@20461
   186
fun c_variant_abs_multi (ct0, vars) =
paulson@16009
   187
      let val (cv,ct) = Thm.dest_abs NONE ct0
paulson@16009
   188
      in  c_variant_abs_multi (ct, cv::vars)  end
paulson@16009
   189
      handle CTERM _ => (ct0, rev vars);
paulson@16009
   190
blanchet@39355
   191
val skolem_def_raw = @{thms skolem_def_raw}
blanchet@37617
   192
blanchet@37617
   193
(* Given the definition of a Skolem function, return a theorem to replace
blanchet@37617
   194
   an existential formula by a use of that function.
paulson@18141
   195
   Example: "EX x. x : A & x ~: B ==> sko A B : A & sko A B ~: B"  [.] *)
blanchet@39886
   196
fun old_skolem_theorem_from_def thy rhs0 =
blanchet@37399
   197
  let
blanchet@38280
   198
    val rhs = rhs0 |> Type.legacy_freeze_thaw |> #1 |> cterm_of thy
blanchet@37617
   199
    val rhs' = rhs |> Thm.dest_comb |> snd
blanchet@37617
   200
    val (ch, frees) = c_variant_abs_multi (rhs', [])
blanchet@37617
   201
    val (hilbert, cabs) = ch |> Thm.dest_comb |>> term_of
blanchet@37617
   202
    val T =
blanchet@37617
   203
      case hilbert of
blanchet@37617
   204
        Const (@{const_name Eps}, Type (@{type_name fun}, [_, T])) => T
blanchet@39886
   205
      | _ => raise TERM ("old_skolem_theorem_from_def: expected \"Eps\"",
blanchet@39886
   206
                         [hilbert])
blanchet@38280
   207
    val cex = cterm_of thy (HOLogic.exists_const T)
blanchet@37617
   208
    val ex_tm = Thm.capply cTrueprop (Thm.capply cex cabs)
blanchet@37629
   209
    val conc =
blanchet@37617
   210
      Drule.list_comb (rhs, frees)
blanchet@37617
   211
      |> Drule.beta_conv cabs |> Thm.capply cTrueprop
blanchet@37617
   212
    fun tacf [prem] =
blanchet@39355
   213
      rewrite_goals_tac skolem_def_raw
blanchet@39355
   214
      THEN rtac ((prem |> rewrite_rule skolem_def_raw) RS @{thm someI_ex}) 1
blanchet@37617
   215
  in
blanchet@37629
   216
    Goal.prove_internal [ex_tm] conc tacf
blanchet@37629
   217
    |> forall_intr_list frees
blanchet@37629
   218
    |> Thm.forall_elim_vars 0  (*Introduce Vars, but don't discharge defs.*)
blanchet@37629
   219
    |> Thm.varifyT_global
blanchet@37617
   220
  end
paulson@24742
   221
blanchet@39036
   222
fun to_definitional_cnf_with_quantifiers thy th =
blanchet@39036
   223
  let
blanchet@39036
   224
    val eqth = cnf.make_cnfx_thm thy (HOLogic.dest_Trueprop (prop_of th))
blanchet@39036
   225
    val eqth = eqth RS @{thm eq_reflection}
blanchet@39036
   226
    val eqth = eqth RS @{thm TruepropI}
blanchet@39036
   227
  in Thm.equal_elim eqth th end
blanchet@39036
   228
blanchet@39887
   229
val kill_quantifiers =
blanchet@39887
   230
  let
blanchet@39887
   231
    fun conv pos ct =
blanchet@39887
   232
      ct |> (case term_of ct of
blanchet@39887
   233
               Const (s, _) $ Abs (s', _, _) =>
blanchet@39887
   234
               if s = @{const_name all} orelse s = @{const_name All} orelse
blanchet@39887
   235
                  s = @{const_name Ex} then
blanchet@39887
   236
                 Thm.dest_comb #> snd
blanchet@39887
   237
                 #> Thm.dest_abs (SOME (s' |> pos = (s = @{const_name Ex})
blanchet@39887
   238
                                            ? prefix new_skolem_var_prefix))
blanchet@39887
   239
                 #> snd #> conv pos
blanchet@39887
   240
               else
blanchet@39887
   241
                 Conv.all_conv
blanchet@39887
   242
             | Const (s, _) $ _ $ _ =>
blanchet@39887
   243
               if s = @{const_name "==>"} orelse
blanchet@39887
   244
                  s = @{const_name HOL.implies} then
blanchet@39887
   245
                 Conv.combination_conv (Conv.arg_conv (conv (not pos)))
blanchet@39887
   246
                                       (conv pos)
blanchet@39887
   247
               else if s = @{const_name HOL.conj} orelse
blanchet@39887
   248
                       s = @{const_name HOL.disj} then
blanchet@39887
   249
                 Conv.combination_conv (Conv.arg_conv (conv pos)) (conv pos)
blanchet@39887
   250
               else
blanchet@39887
   251
                 Conv.all_conv
blanchet@39887
   252
             | Const (s, _) $ _ =>
blanchet@39887
   253
               if s = @{const_name Trueprop} then
blanchet@39887
   254
                 Conv.arg_conv (conv pos)
blanchet@39887
   255
               else if s = @{const_name Not} then
blanchet@39887
   256
                 Conv.arg_conv (conv (not pos))
blanchet@39887
   257
               else
blanchet@39887
   258
                 Conv.all_conv
blanchet@39887
   259
             | _ => Conv.all_conv)
blanchet@39887
   260
  in
blanchet@39887
   261
    conv true #> Drule.export_without_context
blanchet@39887
   262
    #> cprop_of #> Thm.dest_equals #> snd
blanchet@39887
   263
  end
blanchet@39887
   264
blanchet@39887
   265
val pull_out_quant_ss =
blanchet@39887
   266
  MetaSimplifier.clear_ss HOL_basic_ss
blanchet@39887
   267
      addsimps @{thms all_simps[symmetric]}
blanchet@39887
   268
blanchet@39887
   269
(* Converts an Isabelle theorem into NNF. *)
blanchet@39887
   270
fun nnf_axiom new_skolemizer th ctxt =
blanchet@39887
   271
  let
blanchet@39887
   272
    val thy = ProofContext.theory_of ctxt
blanchet@39887
   273
    val th =
blanchet@39887
   274
      th |> transform_elim_theorem
blanchet@39887
   275
         |> zero_var_indexes
blanchet@39887
   276
         |> new_skolemizer ? forall_intr_vars
blanchet@39887
   277
    val (th, ctxt) = Variable.import true [th] ctxt |>> snd |>> the_single
blanchet@39887
   278
    val th = th |> Conv.fconv_rule Object_Logic.atomize
blanchet@39887
   279
                |> extensionalize_theorem
blanchet@39887
   280
                |> Meson.make_nnf ctxt
blanchet@39887
   281
  in
blanchet@39887
   282
    if new_skolemizer then
blanchet@39887
   283
      let
blanchet@39887
   284
        val th' = th |> Meson.skolemize ctxt
blanchet@39887
   285
                     |> simplify pull_out_quant_ss
blanchet@39887
   286
                     |> Drule.eta_contraction_rule
blanchet@39887
   287
        val t = th' |> cprop_of |> kill_quantifiers |> term_of
blanchet@39887
   288
      in
blanchet@39887
   289
        if exists_subterm (fn Var ((s, _), _) =>
blanchet@39887
   290
                              String.isPrefix new_skolem_var_prefix s
blanchet@39887
   291
                            | _ => false) t then
blanchet@39887
   292
          let
blanchet@39887
   293
            val (ct, ctxt) =
blanchet@39887
   294
              Variable.import_terms true [t] ctxt
blanchet@39887
   295
              |>> the_single |>> cterm_of thy
blanchet@39894
   296
          in (SOME (th', ct), Thm.assume ct, ctxt) end
blanchet@39887
   297
       else
blanchet@39887
   298
          (NONE, th, ctxt)
blanchet@39887
   299
      end
blanchet@39887
   300
    else
blanchet@39887
   301
      (NONE, th, ctxt)
blanchet@39887
   302
  end
blanchet@39887
   303
blanchet@39887
   304
(* Convert a theorem to CNF, with additional premises due to skolemization. *)
blanchet@39894
   305
fun cnf_axiom thy new_skolemizer ax_no th =
blanchet@37626
   306
  let
blanchet@37626
   307
    val ctxt0 = Variable.global_thm_context th
blanchet@39887
   308
    val (opt, nnf_th, ctxt) = nnf_axiom new_skolemizer th ctxt0
blanchet@39894
   309
    fun clausify th =
blanchet@39887
   310
      Meson.make_cnf (if new_skolemizer then
blanchet@39887
   311
                        []
blanchet@39887
   312
                      else
blanchet@39887
   313
                        map (old_skolem_theorem_from_def thy)
blanchet@39887
   314
                            (old_skolem_defs th)) th ctxt
blanchet@39261
   315
    val (cnf_ths, ctxt) =
blanchet@39894
   316
      clausify nnf_th
blanchet@39894
   317
      |> (fn ([], _) =>
blanchet@39894
   318
             clausify (to_definitional_cnf_with_quantifiers thy nnf_th)
blanchet@39268
   319
           | p => p)
blanchet@39887
   320
    val export = Variable.export ctxt ctxt0
blanchet@39894
   321
    fun intr_imp ct th =
blanchet@39894
   322
      Thm.instantiate ([], map (pairself (cterm_of @{theory}))
blanchet@39894
   323
                               [(Var (("i", 1), @{typ nat}),
blanchet@39894
   324
                                 HOLogic.mk_number @{typ nat} ax_no)])
blanchet@39894
   325
                      @{thm skolem_COMBK_D}
blanchet@39894
   326
      RS Thm.implies_intr ct th
blanchet@37626
   327
  in
blanchet@39887
   328
    (opt |> Option.map (singleton export o fst),
blanchet@39887
   329
     cnf_ths |> map (introduce_combinators_in_theorem
blanchet@39894
   330
                     #> (case opt of SOME (_, ct) => intr_imp ct | NONE => I))
blanchet@39887
   331
             |> export
blanchet@39887
   332
             |> Meson.finish_cnf
blanchet@39887
   333
             |> map Thm.close_derivation)
blanchet@37626
   334
  end
blanchet@39887
   335
  handle THM _ => (NONE, [])
wenzelm@27184
   336
blanchet@39720
   337
fun meson_general_tac ctxt ths =
blanchet@39720
   338
  let
blanchet@39720
   339
    val thy = ProofContext.theory_of ctxt
blanchet@39720
   340
    val ctxt0 = Classical.put_claset HOL_cs ctxt
blanchet@39894
   341
  in Meson.meson_tac ctxt0 (maps (snd o cnf_axiom thy false 0) ths) end
blanchet@39720
   342
blanchet@39720
   343
val setup =
blanchet@39891
   344
  Method.setup @{binding meson} (Attrib.thms >> (fn ths => fn ctxt =>
blanchet@39891
   345
     SIMPLE_METHOD' (CHANGED_PROP o meson_general_tac ctxt ths)))
blanchet@39891
   346
     "MESON resolution proof procedure"
blanchet@39720
   347
wenzelm@20461
   348
end;