src/HOL/Tools/Sledgehammer/clausifier.ML
author blanchet
Tue Jul 27 19:41:19 2010 +0200 (2010-07-27)
changeset 38028 22dcaec5fa77
parent 38027 505657ddb047
child 38278 aee5862973e0
permissions -rw-r--r--
minor refactoring
blanchet@37574
     1
(*  Title:      HOL/Tools/Sledgehammer/clausifier.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@37574
     8
signature CLAUSIFIER =
wenzelm@21505
     9
sig
blanchet@38001
    10
  val introduce_combinators_in_cterm : cterm -> thm
blanchet@38028
    11
  val introduce_combinators_in_theorem : thm -> thm
blanchet@38016
    12
  val cnf_axiom: theory -> thm -> thm list
wenzelm@21505
    13
end;
mengj@19196
    14
blanchet@37574
    15
structure Clausifier : CLAUSIFIER =
paulson@15997
    16
struct
paulson@15347
    17
paulson@15997
    18
(**** Transformation of Elimination Rules into First-Order Formulas****)
paulson@15347
    19
wenzelm@29064
    20
val cfalse = cterm_of @{theory HOL} HOLogic.false_const;
wenzelm@29064
    21
val ctp_false = cterm_of @{theory HOL} (HOLogic.mk_Trueprop HOLogic.false_const);
wenzelm@20461
    22
blanchet@38001
    23
(* Converts an elim-rule into an equivalent theorem that does not have the
blanchet@38001
    24
   predicate variable. Leaves other theorems unchanged. We simply instantiate
blanchet@38001
    25
   the conclusion variable to False. (Cf. "transform_elim_term" in
blanchet@38001
    26
   "ATP_Systems".) *)
blanchet@38001
    27
fun transform_elim_theorem th =
paulson@21430
    28
  case concl_of th of    (*conclusion variable*)
blanchet@35963
    29
       @{const Trueprop} $ (v as Var (_, @{typ bool})) =>
wenzelm@29064
    30
           Thm.instantiate ([], [(cterm_of @{theory HOL} v, cfalse)]) th
blanchet@35963
    31
    | v as Var(_, @{typ prop}) =>
wenzelm@29064
    32
           Thm.instantiate ([], [(cterm_of @{theory HOL} v, ctp_false)]) th
blanchet@38001
    33
    | _ => th
paulson@15997
    34
paulson@24742
    35
(*To enforce single-threading*)
paulson@24742
    36
exception Clausify_failure of theory;
wenzelm@20461
    37
wenzelm@28544
    38
paulson@16009
    39
(**** SKOLEMIZATION BY INFERENCE (lcp) ****)
paulson@16009
    40
blanchet@37410
    41
fun mk_skolem_id t =
blanchet@37436
    42
  let val T = fastype_of t in
blanchet@37496
    43
    Const (@{const_name skolem_id}, T --> T) $ t
blanchet@37436
    44
  end
blanchet@37410
    45
blanchet@37617
    46
fun beta_eta_under_lambdas (Abs (s, T, t')) =
blanchet@37617
    47
    Abs (s, T, beta_eta_under_lambdas t')
blanchet@37617
    48
  | beta_eta_under_lambdas t = Envir.beta_eta_contract t
blanchet@37512
    49
paulson@18141
    50
(*Traverse a theorem, accumulating Skolem function definitions.*)
blanchet@37617
    51
fun assume_skolem_funs th =
blanchet@37399
    52
  let
blanchet@37617
    53
    fun dec_sko (Const (@{const_name Ex}, _) $ (body as Abs (s', T, p))) rhss =
blanchet@37399
    54
        (*Existential: declare a Skolem function, then insert into body and continue*)
blanchet@37399
    55
        let
blanchet@37617
    56
          val args = OldTerm.term_frees body
blanchet@37399
    57
          val Ts = map type_of args
blanchet@37399
    58
          val cT = Ts ---> T (* FIXME: use "skolem_type_and_args" *)
blanchet@37500
    59
          (* Forms a lambda-abstraction over the formal parameters *)
blanchet@37500
    60
          val rhs =
blanchet@37500
    61
            list_abs_free (map dest_Free args,
blanchet@37617
    62
                           HOLogic.choice_const T $ beta_eta_under_lambdas body)
blanchet@37518
    63
            |> mk_skolem_id
blanchet@37518
    64
          val comb = list_comb (rhs, args)
blanchet@37617
    65
        in dec_sko (subst_bound (comb, p)) (rhs :: rhss) end
blanchet@37617
    66
      | dec_sko (Const (@{const_name All},_) $ Abs (a, T, p)) rhss =
blanchet@37399
    67
        (*Universal quant: insert a free variable into body and continue*)
blanchet@37399
    68
        let val fname = Name.variant (OldTerm.add_term_names (p,[])) a
blanchet@37617
    69
        in dec_sko (subst_bound (Free(fname,T), p)) rhss end
blanchet@37617
    70
      | dec_sko (@{const "op &"} $ p $ q) rhss = rhss |> dec_sko p |> dec_sko q
blanchet@37617
    71
      | dec_sko (@{const "op |"} $ p $ q) rhss = rhss |> dec_sko p |> dec_sko q
blanchet@37617
    72
      | dec_sko (@{const Trueprop} $ p) rhss = dec_sko p rhss
blanchet@37617
    73
      | dec_sko _ rhss = rhss
paulson@20419
    74
  in  dec_sko (prop_of th) []  end;
paulson@20419
    75
paulson@20419
    76
paulson@24827
    77
(**** REPLACING ABSTRACTIONS BY COMBINATORS ****)
paulson@20419
    78
paulson@20419
    79
(*Returns the vars of a theorem*)
paulson@20419
    80
fun vars_of_thm th =
wenzelm@22691
    81
  map (Thm.cterm_of (theory_of_thm th) o Var) (Thm.fold_terms Term.add_vars th []);
paulson@20419
    82
blanchet@37540
    83
val fun_cong_all = @{thm expand_fun_eq [THEN iffD1]}
paulson@20419
    84
blanchet@38000
    85
(* ### FIXME: removes only one lambda? *)
blanchet@38001
    86
(* Removes the lambdas from an equation of the form "t = (%x. u)".
blanchet@38001
    87
   (Cf. "extensionalize_term" in "ATP_Systems".) *)
blanchet@38000
    88
fun extensionalize_theorem th =
blanchet@37540
    89
  case prop_of th of
blanchet@37540
    90
    _ $ (Const (@{const_name "op ="}, Type (_, [Type (@{type_name fun}, _), _]))
blanchet@38000
    91
         $ _ $ Abs (s, _, _)) => extensionalize_theorem (th RS fun_cong_all)
blanchet@37540
    92
  | _ => th
paulson@20419
    93
blanchet@37416
    94
fun is_quasi_lambda_free (Const (@{const_name skolem_id}, _) $ _) = true
blanchet@37416
    95
  | is_quasi_lambda_free (t1 $ t2) =
blanchet@37416
    96
    is_quasi_lambda_free t1 andalso is_quasi_lambda_free t2
blanchet@37416
    97
  | is_quasi_lambda_free (Abs _) = false
blanchet@37416
    98
  | is_quasi_lambda_free _ = true
wenzelm@20461
    99
wenzelm@32010
   100
val [f_B,g_B] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_B}));
wenzelm@32010
   101
val [g_C,f_C] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_C}));
wenzelm@32010
   102
val [f_S,g_S] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_S}));
paulson@20863
   103
paulson@24827
   104
(*FIXME: requires more use of cterm constructors*)
paulson@24827
   105
fun abstract ct =
wenzelm@28544
   106
  let
wenzelm@28544
   107
      val thy = theory_of_cterm ct
paulson@25256
   108
      val Abs(x,_,body) = term_of ct
blanchet@35963
   109
      val Type(@{type_name fun}, [xT,bodyT]) = typ_of (ctyp_of_term ct)
blanchet@38005
   110
      val cxT = ctyp_of thy xT
blanchet@38005
   111
      val cbodyT = ctyp_of thy bodyT
blanchet@38005
   112
      fun makeK () =
blanchet@38005
   113
        instantiate' [SOME cxT, SOME cbodyT] [SOME (cterm_of thy body)]
blanchet@38005
   114
                     @{thm abs_K}
paulson@24827
   115
  in
paulson@24827
   116
      case body of
paulson@24827
   117
          Const _ => makeK()
paulson@24827
   118
        | Free _ => makeK()
paulson@24827
   119
        | Var _ => makeK()  (*though Var isn't expected*)
wenzelm@27184
   120
        | Bound 0 => instantiate' [SOME cxT] [] @{thm abs_I} (*identity: I*)
paulson@24827
   121
        | rator$rand =>
wenzelm@27184
   122
            if loose_bvar1 (rator,0) then (*C or S*)
wenzelm@27179
   123
               if loose_bvar1 (rand,0) then (*S*)
wenzelm@27179
   124
                 let val crator = cterm_of thy (Abs(x,xT,rator))
wenzelm@27179
   125
                     val crand = cterm_of thy (Abs(x,xT,rand))
wenzelm@27184
   126
                     val abs_S' = cterm_instantiate [(f_S,crator),(g_S,crand)] @{thm abs_S}
wenzelm@27184
   127
                     val (_,rhs) = Thm.dest_equals (cprop_of abs_S')
wenzelm@27179
   128
                 in
wenzelm@27179
   129
                   Thm.transitive abs_S' (Conv.binop_conv abstract rhs)
wenzelm@27179
   130
                 end
wenzelm@27179
   131
               else (*C*)
wenzelm@27179
   132
                 let val crator = cterm_of thy (Abs(x,xT,rator))
wenzelm@27184
   133
                     val abs_C' = cterm_instantiate [(f_C,crator),(g_C,cterm_of thy rand)] @{thm abs_C}
wenzelm@27184
   134
                     val (_,rhs) = Thm.dest_equals (cprop_of abs_C')
wenzelm@27179
   135
                 in
wenzelm@27179
   136
                   Thm.transitive abs_C' (Conv.fun_conv (Conv.arg_conv abstract) rhs)
wenzelm@27179
   137
                 end
wenzelm@27184
   138
            else if loose_bvar1 (rand,0) then (*B or eta*)
wenzelm@36945
   139
               if rand = Bound 0 then Thm.eta_conversion ct
wenzelm@27179
   140
               else (*B*)
wenzelm@27179
   141
                 let val crand = cterm_of thy (Abs(x,xT,rand))
wenzelm@27179
   142
                     val crator = cterm_of thy rator
wenzelm@27184
   143
                     val abs_B' = cterm_instantiate [(f_B,crator),(g_B,crand)] @{thm abs_B}
wenzelm@27184
   144
                     val (_,rhs) = Thm.dest_equals (cprop_of abs_B')
blanchet@37349
   145
                 in Thm.transitive abs_B' (Conv.arg_conv abstract rhs) end
wenzelm@27179
   146
            else makeK()
blanchet@37349
   147
        | _ => raise Fail "abstract: Bad term"
paulson@24827
   148
  end;
paulson@20863
   149
blanchet@37349
   150
(* Traverse a theorem, remplacing lambda-abstractions with combinators. *)
blanchet@38001
   151
fun introduce_combinators_in_cterm ct =
blanchet@37416
   152
  if is_quasi_lambda_free (term_of ct) then
blanchet@37349
   153
    Thm.reflexive ct
blanchet@37349
   154
  else case term_of ct of
blanchet@37349
   155
    Abs _ =>
blanchet@37349
   156
    let
blanchet@37349
   157
      val (cv, cta) = Thm.dest_abs NONE ct
blanchet@37349
   158
      val (v, _) = dest_Free (term_of cv)
blanchet@38001
   159
      val u_th = introduce_combinators_in_cterm cta
blanchet@37349
   160
      val cu = Thm.rhs_of u_th
blanchet@37349
   161
      val comb_eq = abstract (Thm.cabs cv cu)
blanchet@37349
   162
    in Thm.transitive (Thm.abstract_rule v cv u_th) comb_eq end
blanchet@37349
   163
  | _ $ _ =>
blanchet@37349
   164
    let val (ct1, ct2) = Thm.dest_comb ct in
blanchet@38001
   165
        Thm.combination (introduce_combinators_in_cterm ct1)
blanchet@38001
   166
                        (introduce_combinators_in_cterm ct2)
blanchet@37349
   167
    end
blanchet@37349
   168
blanchet@38001
   169
fun introduce_combinators_in_theorem th =
blanchet@37416
   170
  if is_quasi_lambda_free (prop_of th) then
blanchet@37349
   171
    th
paulson@24827
   172
  else
blanchet@37349
   173
    let
blanchet@37349
   174
      val th = Drule.eta_contraction_rule th
blanchet@38001
   175
      val eqth = introduce_combinators_in_cterm (cprop_of th)
blanchet@37349
   176
    in Thm.equal_elim eqth th end
blanchet@37349
   177
    handle THM (msg, _, _) =>
blanchet@37349
   178
           (warning ("Error in the combinator translation of " ^
blanchet@37349
   179
                     Display.string_of_thm_without_context th ^
blanchet@37349
   180
                     "\nException message: " ^ msg ^ ".");
blanchet@37349
   181
            (* A type variable of sort "{}" will make abstraction fail. *)
blanchet@37349
   182
            TrueI)
paulson@16009
   183
paulson@16009
   184
(*cterms are used throughout for efficiency*)
wenzelm@29064
   185
val cTrueprop = Thm.cterm_of @{theory HOL} HOLogic.Trueprop;
paulson@16009
   186
paulson@16009
   187
(*Given an abstraction over n variables, replace the bound variables by free
paulson@16009
   188
  ones. Return the body, along with the list of free variables.*)
wenzelm@20461
   189
fun c_variant_abs_multi (ct0, vars) =
paulson@16009
   190
      let val (cv,ct) = Thm.dest_abs NONE ct0
paulson@16009
   191
      in  c_variant_abs_multi (ct, cv::vars)  end
paulson@16009
   192
      handle CTERM _ => (ct0, rev vars);
paulson@16009
   193
blanchet@37617
   194
val skolem_id_def_raw = @{thms skolem_id_def_raw}
blanchet@37617
   195
blanchet@37617
   196
(* Given the definition of a Skolem function, return a theorem to replace
blanchet@37617
   197
   an existential formula by a use of that function.
paulson@18141
   198
   Example: "EX x. x : A & x ~: B ==> sko A B : A & sko A B ~: B"  [.] *)
blanchet@38016
   199
fun skolem_theorem_of_def thy rhs0 =
blanchet@37399
   200
  let
blanchet@37617
   201
    val rhs = rhs0 |> Type.legacy_freeze_thaw |> #1 |> Thm.cterm_of thy
blanchet@37617
   202
    val rhs' = rhs |> Thm.dest_comb |> snd
blanchet@37617
   203
    val (ch, frees) = c_variant_abs_multi (rhs', [])
blanchet@37617
   204
    val (hilbert, cabs) = ch |> Thm.dest_comb |>> term_of
blanchet@37617
   205
    val T =
blanchet@37617
   206
      case hilbert of
blanchet@37617
   207
        Const (@{const_name Eps}, Type (@{type_name fun}, [_, T])) => T
blanchet@37617
   208
      | _ => raise TERM ("skolem_theorem_of_def: expected \"Eps\"", [hilbert])
blanchet@37617
   209
    val cex = Thm.cterm_of thy (HOLogic.exists_const T)
blanchet@37617
   210
    val ex_tm = Thm.capply cTrueprop (Thm.capply cex cabs)
blanchet@37629
   211
    val conc =
blanchet@37617
   212
      Drule.list_comb (rhs, frees)
blanchet@37617
   213
      |> Drule.beta_conv cabs |> Thm.capply cTrueprop
blanchet@37617
   214
    fun tacf [prem] =
blanchet@38016
   215
      rewrite_goals_tac skolem_id_def_raw
blanchet@38016
   216
      THEN rtac ((prem |> rewrite_rule skolem_id_def_raw) RS @{thm someI_ex}) 1
blanchet@37617
   217
  in
blanchet@37629
   218
    Goal.prove_internal [ex_tm] conc tacf
blanchet@37629
   219
    |> forall_intr_list frees
blanchet@37629
   220
    |> Thm.forall_elim_vars 0  (*Introduce Vars, but don't discharge defs.*)
blanchet@37629
   221
    |> Thm.varifyT_global
blanchet@37617
   222
  end
paulson@24742
   223
blanchet@37995
   224
(* Converts an Isabelle theorem (intro, elim or simp format, even higher-order)
blanchet@37995
   225
   into NNF. *)
paulson@24937
   226
fun to_nnf th ctxt0 =
blanchet@38001
   227
  let val th1 = th |> transform_elim_theorem |> zero_var_indexes
wenzelm@32262
   228
      val ((_, [th2]), ctxt) = Variable.import true [th1] ctxt0
blanchet@37540
   229
      val th3 = th2 |> Conv.fconv_rule Object_Logic.atomize
blanchet@38000
   230
                    |> extensionalize_theorem
blanchet@37540
   231
                    |> Meson.make_nnf ctxt
paulson@24937
   232
  in  (th3, ctxt)  end;
paulson@16009
   233
blanchet@37995
   234
(* Skolemize a named theorem, with Skolem functions as additional premises. *)
blanchet@38016
   235
fun skolemize_theorem thy th =
blanchet@37626
   236
  let
blanchet@37626
   237
    val ctxt0 = Variable.global_thm_context th
blanchet@37626
   238
    val (nnfth, ctxt) = to_nnf th ctxt0
blanchet@38016
   239
    val sko_ths = map (skolem_theorem_of_def thy)
blanchet@37628
   240
                      (assume_skolem_funs nnfth)
blanchet@37626
   241
    val (cnfs, ctxt) = Meson.make_cnf sko_ths nnfth ctxt
blanchet@37626
   242
  in
blanchet@38001
   243
    cnfs |> map introduce_combinators_in_theorem
blanchet@37626
   244
         |> Variable.export ctxt ctxt0
blanchet@37626
   245
         |> Meson.finish_cnf
blanchet@37626
   246
         |> map Thm.close_derivation
blanchet@37626
   247
  end
blanchet@37626
   248
  handle THM _ => []
wenzelm@27184
   249
blanchet@36228
   250
(* Convert Isabelle theorems into axiom clauses. *)
blanchet@37618
   251
(* FIXME: is transfer necessary? *)
blanchet@38016
   252
fun cnf_axiom thy = skolemize_theorem thy o Thm.transfer thy
mengj@19353
   253
wenzelm@20461
   254
end;