src/HOL/Tools/res_axioms.ML
author paulson
Mon, 19 Mar 2007 15:58:02 +0100
changeset 22471 7c51f1a799f3
parent 22360 26ead7ed4f4b
child 22516 c986140356b8
permissions -rw-r--r--
Removal of axiom names from the theorem cache
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
     1
(*  Author: Jia Meng, Cambridge University Computer Laboratory
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
     2
    ID: $Id$
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
     3
    Copyright 2004 University of Cambridge
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
     4
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
     5
Transformation of axiom rules (elim/intro/etc) into CNF forms.
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
     6
*)
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
     7
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
     8
signature RES_AXIOMS =
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
     9
sig
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    10
  val trace_abs: bool ref
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    11
  val cnf_axiom : string * thm -> thm list
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
    12
  val cnf_name : string -> thm list
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    13
  val meta_cnf_axiom : thm -> thm list
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    14
  val pairname : thm -> string * thm
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
    15
  val skolem_thm : thm -> thm list
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    16
  val to_nnf : thm -> thm
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    17
  val cnf_rules_pairs : (string * thm) list -> (thm * (string * int)) list
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18680
diff changeset
    18
  val meson_method_setup : theory -> theory
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18680
diff changeset
    19
  val setup : theory -> theory
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    20
  val assume_abstract_list: thm list -> thm list
21999
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
    21
  val neg_conjecture_clauses: thm -> int -> thm list * (string * typ) list
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
    22
  val claset_rules_of: Proof.context -> (string * thm) list   (*FIXME DELETE*)
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
    23
  val simpset_rules_of: Proof.context -> (string * thm) list  (*FIXME DELETE*)
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    24
  val atpset_rules_of: Proof.context -> (string * thm) list
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    25
end;
19196
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
    26
21900
f386d7eb17d1 tidying the ATP communications
paulson
parents: 21858
diff changeset
    27
structure ResAxioms =
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    28
struct
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    29
20996
197e6875d637 abstraction is now turned OFF...
paulson
parents: 20969
diff changeset
    30
(*For running the comparison between combinators and abstractions.
197e6875d637 abstraction is now turned OFF...
paulson
parents: 20969
diff changeset
    31
  CANNOT be a ref, as the setting is used while Isabelle is built.
197e6875d637 abstraction is now turned OFF...
paulson
parents: 20969
diff changeset
    32
  Currently FALSE, i.e. all the "abstraction" code below is unused, but so far
197e6875d637 abstraction is now turned OFF...
paulson
parents: 20969
diff changeset
    33
  it seems to be inferior to combinators...*)
21900
f386d7eb17d1 tidying the ATP communications
paulson
parents: 21858
diff changeset
    34
val abstract_lambdas = true;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    35
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    36
val trace_abs = ref false;
18000
ac059afd6b86 Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents: 17959
diff changeset
    37
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
    38
(* FIXME legacy *)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    39
fun freeze_thm th = #1 (Drule.freeze_thaw th);
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    40
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
    41
val lhs_of = #1 o Logic.dest_equals o Thm.prop_of;
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
    42
val rhs_of = #2 o Logic.dest_equals o Thm.prop_of;
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    43
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    44
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    45
(*Store definitions of abstraction functions, ensuring that identical right-hand
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    46
  sides are denoted by the same functions and thereby reducing the need for
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    47
  extensionality in proofs.
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    48
  FIXME!  Store in theory data!!*)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    49
20867
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
    50
(*Populate the abstraction cache with common combinators.*)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    51
fun seed th net =
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
    52
  let val (_,ct) = Thm.dest_abs NONE (Drule.rhs_of th)
20867
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
    53
      val t = Logic.legacy_varify (term_of ct)
22360
26ead7ed4f4b moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents: 22345
diff changeset
    54
  in  Net.insert_term Thm.eq_thm (t, th) net end;
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    55
  
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    56
val abstraction_cache = ref 
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    57
      (seed (thm"ATP_Linkup.I_simp") 
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    58
       (seed (thm"ATP_Linkup.B_simp") 
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    59
	(seed (thm"ATP_Linkup.K_simp") Net.empty)));
20867
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
    60
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    61
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    62
(**** Transformation of Elimination Rules into First-Order Formulas****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    63
21430
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    64
val cfalse = cterm_of HOL.thy HOLogic.false_const;
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    65
val ctp_false = cterm_of HOL.thy (HOLogic.mk_Trueprop HOLogic.false_const);
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
    66
21430
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    67
(*Converts an elim-rule into an equivalent theorem that does not have the
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    68
  predicate variable.  Leaves other theorems unchanged.  We simply instantiate the
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    69
  conclusion variable to False.*)
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
    70
fun transform_elim th =
21430
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    71
  case concl_of th of    (*conclusion variable*)
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    72
       Const("Trueprop",_) $ (v as Var(_,Type("bool",[]))) => 
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    73
           Thm.instantiate ([], [(cterm_of HOL.thy v, cfalse)]) th
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    74
    | v as Var(_, Type("prop",[])) => 
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    75
           Thm.instantiate ([], [(cterm_of HOL.thy v, ctp_false)]) th
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    76
    | _ => th;
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    77
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    78
(**** Transformation of Clasets and Simpsets into First-Order Axioms ****)
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    79
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    80
(*Transfer a theorem into theory ATP_Linkup.thy if it is not already
15359
8bad1f42fec0 new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents: 15347
diff changeset
    81
  inside that theory -- because it's needed for Skolemization *)
8bad1f42fec0 new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents: 15347
diff changeset
    82
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    83
(*This will refer to the final version of theory ATP_Linkup.*)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
    84
val recon_thy_ref = Theory.self_ref (the_context ());
15359
8bad1f42fec0 new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents: 15347
diff changeset
    85
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    86
(*If called while ATP_Linkup is being created, it will transfer to the
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
    87
  current version. If called afterward, it will transfer to the final version.*)
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    88
fun transfer_to_ATP_Linkup th =
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
    89
    transfer (Theory.deref recon_thy_ref) th handle THM _ => th;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    90
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
    91
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
    92
(**** SKOLEMIZATION BY INFERENCE (lcp) ****)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
    93
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
    94
(*Traverse a theorem, declaring Skolem function definitions. String s is the suggested
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
    95
  prefix for the Skolem constant. Result is a new theory*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
    96
fun declare_skofuns s th thy =
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
    97
  let val nref = ref 0
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
    98
      fun dec_sko (Const ("Ex",_) $ (xtp as Abs(_,T,p))) (thy, axs) =
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
    99
            (*Existential: declare a Skolem function, then insert into body and continue*)
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   100
            let val cname = Name.internal (s ^ "_sko" ^ Int.toString (inc nref))
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   101
                val args = term_frees xtp  (*get the formal parameter list*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   102
                val Ts = map type_of args
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   103
                val cT = Ts ---> T
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   104
                val c = Const (Sign.full_name thy cname, cT)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   105
                val rhs = list_abs_free (map dest_Free args, HOLogic.choice_const T $ xtp)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   106
                        (*Forms a lambda-abstraction over the formal parameters*)
20783
17114542d2d4 Sign.add_consts_authentic;
wenzelm
parents: 20774
diff changeset
   107
                val thy' = Sign.add_consts_authentic [(cname, cT, NoSyn)] thy
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   108
                           (*Theory is augmented with the constant, then its def*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   109
                val cdef = cname ^ "_def"
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   110
                val thy'' = Theory.add_defs_i false false [(cdef, equals cT $ c $ rhs)] thy'
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   111
            in dec_sko (subst_bound (list_comb(c,args), p))
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   112
                       (thy'', get_axiom thy'' cdef :: axs)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   113
            end
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   114
        | dec_sko (Const ("All",_) $ (xtp as Abs(a,T,p))) thx =
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   115
            (*Universal quant: insert a free variable into body and continue*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   116
            let val fname = Name.variant (add_term_names (p,[])) a
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   117
            in dec_sko (subst_bound (Free(fname,T), p)) thx end
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   118
        | dec_sko (Const ("op &", _) $ p $ q) thx = dec_sko q (dec_sko p thx)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   119
        | dec_sko (Const ("op |", _) $ p $ q) thx = dec_sko q (dec_sko p thx)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   120
        | dec_sko (Const ("Trueprop", _) $ p) thx = dec_sko p thx
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   121
        | dec_sko t thx = thx (*Do nothing otherwise*)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   122
  in  dec_sko (prop_of th) (thy,[])  end;
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   123
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   124
(*Traverse a theorem, accumulating Skolem function definitions.*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   125
fun assume_skofuns th =
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   126
  let fun dec_sko (Const ("Ex",_) $ (xtp as Abs(_,T,p))) defs =
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   127
            (*Existential: declare a Skolem function, then insert into body and continue*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   128
            let val skos = map (#1 o Logic.dest_equals) defs  (*existing sko fns*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   129
                val args = term_frees xtp \\ skos  (*the formal parameters*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   130
                val Ts = map type_of args
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   131
                val cT = Ts ---> T
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   132
                val c = Free (gensym "sko_", cT)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   133
                val rhs = list_abs_free (map dest_Free args,
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   134
                                         HOLogic.choice_const T $ xtp)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   135
                      (*Forms a lambda-abstraction over the formal parameters*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   136
                val def = equals cT $ c $ rhs
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   137
            in dec_sko (subst_bound (list_comb(c,args), p))
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   138
                       (def :: defs)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   139
            end
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   140
        | dec_sko (Const ("All",_) $ (xtp as Abs(a,T,p))) defs =
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   141
            (*Universal quant: insert a free variable into body and continue*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   142
            let val fname = Name.variant (add_term_names (p,[])) a
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   143
            in dec_sko (subst_bound (Free(fname,T), p)) defs end
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   144
        | dec_sko (Const ("op &", _) $ p $ q) defs = dec_sko q (dec_sko p defs)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   145
        | dec_sko (Const ("op |", _) $ p $ q) defs = dec_sko q (dec_sko p defs)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   146
        | dec_sko (Const ("Trueprop", _) $ p) defs = dec_sko p defs
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   147
        | dec_sko t defs = defs (*Do nothing otherwise*)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   148
  in  dec_sko (prop_of th) []  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   149
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   150
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   151
(**** REPLACING ABSTRACTIONS BY FUNCTION DEFINITIONS ****)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   152
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   153
(*Returns the vars of a theorem*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   154
fun vars_of_thm th =
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   155
  map (Thm.cterm_of (theory_of_thm th) o Var) (Drule.fold_terms Term.add_vars th []);
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   156
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   157
(*Make a version of fun_cong with a given variable name*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   158
local
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   159
    val fun_cong' = fun_cong RS asm_rl; (*renumber f, g to prevent clashes with (a,0)*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   160
    val cx = hd (vars_of_thm fun_cong');
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   161
    val ty = typ_of (ctyp_of_term cx);
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   162
    val thy = theory_of_thm fun_cong;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   163
    fun mkvar a = cterm_of thy (Var((a,0),ty));
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   164
in
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   165
fun xfun_cong x = Thm.instantiate ([], [(cx, mkvar x)]) fun_cong'
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   166
end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   167
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   168
(*Removes the lambdas from an equation of the form t = (%x. u).  A non-negative n,
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   169
  serves as an upper bound on how many to remove.*)
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   170
fun strip_lambdas 0 th = th
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   171
  | strip_lambdas n th = 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   172
      case prop_of th of
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   173
	  _ $ (Const ("op =", _) $ _ $ Abs (x,_,_)) =>
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   174
	      strip_lambdas (n-1) (freeze_thm (th RS xfun_cong x))
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   175
	| _ => th;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   176
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   177
(*Convert meta- to object-equality. Fails for theorems like split_comp_eq,
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   178
  where some types have the empty sort.*)
22218
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22130
diff changeset
   179
val meta_eq_to_obj_eq = thm "meta_eq_to_obj_eq";
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22130
diff changeset
   180
fun mk_object_eq th = th RS meta_eq_to_obj_eq
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   181
    handle THM _ => error ("Theorem contains empty sort: " ^ string_of_thm th);
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   182
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   183
(*Apply a function definition to an argument, beta-reducing the result.*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   184
fun beta_comb cf x =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   185
  let val th1 = combination cf (reflexive x)
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
   186
      val th2 = beta_conversion false (Drule.rhs_of th1)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   187
  in  transitive th1 th2  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   188
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   189
(*Apply a function definition to arguments, beta-reducing along the way.*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   190
fun list_combination cf [] = cf
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   191
  | list_combination cf (x::xs) = list_combination (beta_comb cf x) xs;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   192
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   193
fun list_cabs ([] ,     t) = t
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   194
  | list_cabs (v::vars, t) = Thm.cabs v (list_cabs(vars,t));
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   195
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   196
fun assert_eta_free ct =
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   197
  let val t = term_of ct
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   198
  in if (t aconv Envir.eta_contract t) then ()
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   199
     else error ("Eta redex in term: " ^ string_of_cterm ct)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   200
  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   201
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   202
fun eq_absdef (th1, th2) =
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   203
    Context.joinable (theory_of_thm th1, theory_of_thm th2)  andalso
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   204
    rhs_of th1 aconv rhs_of th2;
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   205
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   206
fun lambda_free (Abs _) = false
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   207
  | lambda_free (t $ u) = lambda_free t andalso lambda_free u
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   208
  | lambda_free _ = true;
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   209
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   210
fun monomorphic t =
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   211
  Term.fold_types (Term.fold_atyps (fn TVar _ => K false | _ => I)) t true;
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   212
20710
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   213
fun dest_abs_list ct =
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   214
  let val (cv,ct') = Thm.dest_abs NONE ct
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   215
      val (cvs,cu) = dest_abs_list ct'
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   216
  in (cv::cvs, cu) end
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   217
  handle CTERM _ => ([],ct);
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   218
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   219
fun lambda_list [] u = u
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   220
  | lambda_list (v::vs) u = lambda v (lambda_list vs u);
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   221
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   222
fun abstract_rule_list [] [] th = th
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   223
  | abstract_rule_list (v::vs) (ct::cts) th = abstract_rule v ct (abstract_rule_list vs cts th)
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   224
  | abstract_rule_list _ _ th = raise THM ("abstract_rule_list", 0, [th]);
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   225
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   226
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   227
val Envir.Envir {asol = tenv0, iTs = tyenv0, ...} = Envir.empty 0
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   228
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   229
(*Does an existing abstraction definition have an RHS that matches the one we need now?
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   230
  thy is the current theory, which must extend that of theorem th.*)
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   231
fun match_rhs thy t th =
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   232
  let val _ = if !trace_abs then warning ("match_rhs: " ^ string_of_cterm (cterm_of thy t) ^ 
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   233
                                          " against\n" ^ string_of_thm th) else ();
20867
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
   234
      val (tyenv,tenv) = Pattern.first_order_match thy (rhs_of th, t) (tyenv0,tenv0)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   235
      val term_insts = map Meson.term_pair_of (Vartab.dest tenv)
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   236
      val ct_pairs = if subthy (theory_of_thm th, thy) andalso 
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   237
                        forall lambda_free (map #2 term_insts) 
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   238
                     then map (pairself (cterm_of thy)) term_insts
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   239
                     else raise Pattern.MATCH (*Cannot allow lambdas in the instantiation*)
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   240
      fun ctyp2 (ixn, (S, T)) = (ctyp_of thy (TVar (ixn, S)), ctyp_of thy T)
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   241
      val th' = cterm_instantiate ct_pairs th
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   242
  in  SOME (th, instantiate (map ctyp2 (Vartab.dest tyenv), []) th')  end
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   243
  handle _ => NONE;
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   244
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   245
(*Traverse a theorem, declaring abstraction function definitions. String s is the suggested
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   246
  prefix for the constants. Resulting theory is returned in the first theorem. *)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   247
fun declare_absfuns th =
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   248
  let fun abstract thy ct =
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   249
        if lambda_free (term_of ct) then (transfer thy (reflexive ct), [])
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   250
        else
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   251
        case term_of ct of
20710
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   252
          Abs _ =>
20624
ba081ac0ed7e sko/abs: Name.internal prevents choking of print_theory;
wenzelm
parents: 20567
diff changeset
   253
            let val cname = Name.internal (gensym "abs_");
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   254
                val _ = assert_eta_free ct;
20710
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   255
                val (cvs,cta) = dest_abs_list ct
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   256
                val (vs,Tvs) = ListPair.unzip (map (dest_Free o term_of) cvs)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   257
                val _ = if !trace_abs then warning ("Nested lambda: " ^ string_of_cterm cta) else ();
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   258
                val (u'_th,defs) = abstract thy cta
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   259
                val _ = if !trace_abs then warning ("Returned " ^ string_of_thm u'_th) else ();
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
   260
                val cu' = Drule.rhs_of u'_th
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   261
                val u' = term_of cu'
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   262
                val abs_v_u = lambda_list (map term_of cvs) u'
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   263
                (*get the formal parameters: ALL variables free in the term*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   264
                val args = term_frees abs_v_u
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   265
                val _ = if !trace_abs then warning (Int.toString (length args) ^ " arguments") else ();
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   266
                val rhs = list_abs_free (map dest_Free args, abs_v_u)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   267
                      (*Forms a lambda-abstraction over the formal parameters*)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   268
                val _ = if !trace_abs then warning ("Looking up " ^ string_of_cterm cu') else ();
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   269
                val thy = theory_of_thm u'_th
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   270
                val (ax,ax',thy) =
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   271
                 case List.mapPartial (match_rhs thy abs_v_u) 
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   272
                         (Net.match_term (!abstraction_cache) u') of
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   273
                     (ax,ax')::_ => 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   274
                       (if !trace_abs then warning ("Re-using axiom " ^ string_of_thm ax) else ();
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   275
                        (ax,ax',thy))
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   276
                   | [] =>
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   277
                      let val _ = if !trace_abs then warning "Lookup was empty" else ();
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   278
                          val Ts = map type_of args
20710
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   279
                          val cT = Ts ---> (Tvs ---> typ_of (ctyp_of_term cu'))
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   280
                          val c = Const (Sign.full_name thy cname, cT)
20783
17114542d2d4 Sign.add_consts_authentic;
wenzelm
parents: 20774
diff changeset
   281
                          val thy = Sign.add_consts_authentic [(cname, cT, NoSyn)] thy
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   282
                                     (*Theory is augmented with the constant,
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   283
                                       then its definition*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   284
                          val cdef = cname ^ "_def"
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   285
                          val thy = Theory.add_defs_i false false
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   286
                                       [(cdef, equals cT $ c $ rhs)] thy
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   287
                          val _ = if !trace_abs then (warning ("Definition is " ^ 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   288
                                                      string_of_thm (get_axiom thy cdef))) 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   289
                                  else ();
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   290
                          val ax = get_axiom thy cdef |> freeze_thm
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   291
                                     |> mk_object_eq |> strip_lambdas (length args)
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   292
                                     |> mk_meta_eq |> Meson.generalize
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   293
                          val (_,ax') = Option.valOf (match_rhs thy abs_v_u ax)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   294
                          val _ = if !trace_abs then 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   295
                                    (warning ("Declaring: " ^ string_of_thm ax);
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   296
                                     warning ("Instance: " ^ string_of_thm ax')) 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   297
                                  else ();
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   298
                          val _ = abstraction_cache := Net.insert_term eq_absdef 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   299
                                            ((Logic.varify u'), ax) (!abstraction_cache)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   300
                            handle Net.INSERT =>
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   301
                              raise THM ("declare_absfuns: INSERT", 0, [th,u'_th,ax])
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   302
                       in  (ax,ax',thy)  end
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   303
            in if !trace_abs then warning ("Lookup result: " ^ string_of_thm ax') else ();
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   304
               (transitive (abstract_rule_list vs cvs u'_th) (symmetric ax'), ax::defs) end
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   305
        | (t1$t2) =>
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   306
            let val (ct1,ct2) = Thm.dest_comb ct
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   307
                val (th1,defs1) = abstract thy ct1
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   308
                val (th2,defs2) = abstract (theory_of_thm th1) ct2
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   309
            in  (combination th1 th2, defs1@defs2)  end
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   310
      val _ = if !trace_abs then warning ("declare_absfuns, Abstracting: " ^ string_of_thm th) else ();
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   311
      val (eqth,defs) = abstract (theory_of_thm th) (cprop_of th)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   312
      val ths = equal_elim eqth th :: map (strip_lambdas ~1 o mk_object_eq o freeze_thm) defs
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   313
      val _ = if !trace_abs then warning ("declare_absfuns, Result: " ^ string_of_thm (hd ths)) else ();
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   314
  in  (theory_of_thm eqth, map Drule.eta_contraction_rule ths)  end;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   315
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
   316
fun name_of def = try (#1 o dest_Free o lhs_of) def;
20567
93ae490fe02c Bug fix to prevent exception dest_Free from escaping
paulson
parents: 20525
diff changeset
   317
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   318
(*A name is valid provided it isn't the name of a defined abstraction.*)
20567
93ae490fe02c Bug fix to prevent exception dest_Free from escaping
paulson
parents: 20525
diff changeset
   319
fun valid_name defs (Free(x,T)) = not (x mem_string (List.mapPartial name_of defs))
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   320
  | valid_name defs _ = false;
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   321
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   322
fun assume_absfuns th =
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   323
  let val thy = theory_of_thm th
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   324
      val cterm = cterm_of thy
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   325
      fun abstract ct =
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   326
        if lambda_free (term_of ct) then (reflexive ct, [])
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   327
        else
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   328
        case term_of ct of
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   329
          Abs (_,T,u) =>
20710
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   330
            let val _ = assert_eta_free ct;
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   331
                val (cvs,cta) = dest_abs_list ct
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   332
                val (vs,Tvs) = ListPair.unzip (map (dest_Free o term_of) cvs)
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   333
                val (u'_th,defs) = abstract cta
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
   334
                val cu' = Drule.rhs_of u'_th
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   335
                val u' = term_of cu'
20710
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   336
                (*Could use Thm.cabs instead of lambda to work at level of cterms*)
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   337
                val abs_v_u = lambda_list (map term_of cvs) (term_of cu')
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   338
                (*get the formal parameters: free variables not present in the defs
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   339
                  (to avoid taking abstraction function names as parameters) *)
20710
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   340
                val args = filter (valid_name defs) (term_frees abs_v_u)
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   341
                val crhs = list_cabs (map cterm args, cterm abs_v_u)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   342
                      (*Forms a lambda-abstraction over the formal parameters*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   343
                val rhs = term_of crhs
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   344
                val (ax,ax') =
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   345
                 case List.mapPartial (match_rhs thy abs_v_u) 
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   346
                        (Net.match_term (!abstraction_cache) u') of
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   347
                     (ax,ax')::_ => 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   348
                       (if !trace_abs then warning ("Re-using axiom " ^ string_of_thm ax) else ();
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   349
                        (ax,ax'))
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   350
                   | [] =>
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   351
                      let val Ts = map type_of args
20710
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   352
                          val const_ty = Ts ---> (Tvs ---> typ_of (ctyp_of_term cu'))
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   353
                          val c = Free (gensym "abs_", const_ty)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   354
                          val ax = assume (Thm.capply (cterm (equals const_ty $ c)) crhs)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   355
                                     |> mk_object_eq |> strip_lambdas (length args)
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   356
                                     |> mk_meta_eq |> Meson.generalize
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   357
                          val (_,ax') = Option.valOf (match_rhs thy abs_v_u ax)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   358
                          val _ = abstraction_cache := Net.insert_term eq_absdef (rhs,ax)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   359
                                    (!abstraction_cache)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   360
                            handle Net.INSERT =>
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   361
                              raise THM ("assume_absfuns: INSERT", 0, [th,u'_th,ax])
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   362
                      in (ax,ax') end
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   363
            in if !trace_abs then warning ("Lookup result: " ^ string_of_thm ax') else ();
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   364
               (transitive (abstract_rule_list vs cvs u'_th) (symmetric ax'), ax::defs) end
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   365
        | (t1$t2) =>
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   366
            let val (ct1,ct2) = Thm.dest_comb ct
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   367
                val (t1',defs1) = abstract ct1
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   368
                val (t2',defs2) = abstract ct2
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   369
            in  (combination t1' t2', defs1@defs2)  end
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   370
      val _ = if !trace_abs then warning ("assume_absfuns, Abstracting: " ^ string_of_thm th) else ();
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   371
      val (eqth,defs) = abstract (cprop_of th)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   372
      val ths = equal_elim eqth th :: map (strip_lambdas ~1 o mk_object_eq o freeze_thm) defs
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   373
      val _ = if !trace_abs then warning ("assume_absfuns, Result: " ^ string_of_thm (hd ths)) else ();
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   374
  in  map Drule.eta_contraction_rule ths  end;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   375
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   376
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   377
(*cterms are used throughout for efficiency*)
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   378
val cTrueprop = Thm.cterm_of HOL.thy HOLogic.Trueprop;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   379
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   380
(*cterm version of mk_cTrueprop*)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   381
fun c_mkTrueprop A = Thm.capply cTrueprop A;
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   382
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   383
(*Given an abstraction over n variables, replace the bound variables by free
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   384
  ones. Return the body, along with the list of free variables.*)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   385
fun c_variant_abs_multi (ct0, vars) =
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   386
      let val (cv,ct) = Thm.dest_abs NONE ct0
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   387
      in  c_variant_abs_multi (ct, cv::vars)  end
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   388
      handle CTERM _ => (ct0, rev vars);
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   389
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   390
(*Given the definition of a Skolem function, return a theorem to replace
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   391
  an existential formula by a use of that function.
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   392
   Example: "EX x. x : A & x ~: B ==> sko A B : A & sko A B ~: B"  [.] *)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   393
fun skolem_of_def def =
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   394
  let val (c,rhs) = Drule.dest_equals (cprop_of (freeze_thm def))
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   395
      val (ch, frees) = c_variant_abs_multi (rhs, [])
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   396
      val (chilbert,cabs) = Thm.dest_comb ch
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   397
      val {sign,t, ...} = rep_cterm chilbert
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   398
      val T = case t of Const ("Hilbert_Choice.Eps", Type("fun",[_,T])) => T
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   399
                      | _ => raise THM ("skolem_of_def: expected Eps", 0, [def])
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   400
      val cex = Thm.cterm_of sign (HOLogic.exists_const T)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   401
      val ex_tm = c_mkTrueprop (Thm.capply cex cabs)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   402
      and conc =  c_mkTrueprop (Drule.beta_conv cabs (Drule.list_comb(c,frees)));
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   403
      fun tacf [prem] = rewrite_goals_tac [def] THEN rtac (prem RS someI_ex) 1
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   404
  in  Goal.prove_raw [ex_tm] conc tacf
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   405
       |> forall_intr_list frees
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   406
       |> forall_elim_vars 0  (*Introduce Vars, but don't discharge defs.*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   407
       |> Thm.varifyT
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   408
  end;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   409
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   410
(*Converts an Isabelle theorem (intro, elim or simp format, even higher-order) into NNF.*)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   411
fun to_nnf th =
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
   412
    th |> transfer_to_ATP_Linkup
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   413
       |> transform_elim |> zero_var_indexes |> freeze_thm
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   414
       |> ObjectLogic.atomize_thm |> make_nnf |> strip_lambdas ~1;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   415
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   416
(*The cache prevents repeated clausification of a theorem,
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   417
  and also repeated declaration of Skolem functions*)
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   418
  (* FIXME  use theory data!!*)
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   419
val clause_cache = ref (Thmtab.empty : thm list Thmtab.table)
15955
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   420
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   421
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   422
(*Generate Skolem functions for a theorem supplied in nnf*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   423
fun skolem_of_nnf th =
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   424
  map (skolem_of_def o assume o (cterm_of (theory_of_thm th))) (assume_skofuns th);
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   425
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   426
fun assert_lambda_free ths msg = 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   427
  case filter (not o lambda_free o prop_of) ths of
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   428
      [] => ()
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   429
     | ths' => error (msg ^ "\n" ^ space_implode "\n" (map string_of_thm ths'));
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   430
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   431
fun assume_abstract th =
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   432
  if lambda_free (prop_of th) then [th]
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   433
  else th |> Drule.eta_contraction_rule |> assume_absfuns
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   434
          |> tap (fn ths => assert_lambda_free ths "assume_abstract: lambdas")
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   435
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   436
(*Replace lambdas by assumed function definitions in the theorems*)
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   437
fun assume_abstract_list ths =
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   438
  if abstract_lambdas then List.concat (map assume_abstract ths)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   439
  else map Drule.eta_contraction_rule ths;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   440
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   441
(*Replace lambdas by declared function definitions in the theorems*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   442
fun declare_abstract' (thy, []) = (thy, [])
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   443
  | declare_abstract' (thy, th::ths) =
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   444
      let val (thy', th_defs) =
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   445
            if lambda_free (prop_of th) then (thy, [th])
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   446
            else
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   447
                th |> zero_var_indexes |> freeze_thm
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   448
                   |> Drule.eta_contraction_rule |> transfer thy |> declare_absfuns
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   449
          val _ = assert_lambda_free th_defs "declare_abstract: lambdas"
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   450
          val (thy'', ths') = declare_abstract' (thy', ths)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   451
      in  (thy'', th_defs @ ths')  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   452
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   453
fun declare_abstract (thy, ths) =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   454
  if abstract_lambdas then declare_abstract' (thy, ths)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   455
  else (thy, map Drule.eta_contraction_rule ths);
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   456
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   457
(*Skolemize a named theorem, with Skolem functions as additional premises.*)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   458
fun skolem_thm th =
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   459
  let val nnfth = to_nnf th
21470
7c1b59ddcd56 Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents: 21430
diff changeset
   460
  in  Meson.make_cnf (skolem_of_nnf nnfth) nnfth |> assume_abstract_list |> Meson.finish_cnf
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   461
  end
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   462
  handle THM _ => [];
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   463
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   464
(*Keep the full complexity of the original name*)
21858
05f57309170c avoid conflict with Alice keywords: renamed pack -> implode, unpack -> explode, any -> many, avoided assert;
wenzelm
parents: 21646
diff changeset
   465
fun flatten_name s = space_implode "_X" (NameSpace.explode s);
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   466
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   467
(*Declare Skolem functions for a theorem, supplied in nnf and with its name.
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   468
  It returns a modified theory, unless skolemization fails.*)
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   469
fun skolem thy th =
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   470
  let val cname = (case PureThy.get_name_hint th of "" => gensym "" | s => flatten_name s)
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   471
      val _ = Output.debug (fn () => "skolemizing " ^ cname ^ ": ")
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   472
  in Option.map
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   473
        (fn nnfth =>
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   474
          let val (thy',defs) = declare_skofuns cname nnfth thy
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   475
              val cnfs = Meson.make_cnf (map skolem_of_def defs) nnfth
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   476
              val (thy'',cnfs') = declare_abstract (thy',cnfs)
22345
85f76b341893 Improved handling of situation when theorem in cache disagrees with theorem supplied: new clauses
paulson
parents: 22218
diff changeset
   477
          in (map Goal.close_result (Meson.finish_cnf cnfs'), thy'')
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   478
          end)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   479
      (SOME (to_nnf th)  handle THM _ => NONE)
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   480
  end;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   481
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   482
(*Populate the clause cache using the supplied theorem. Return the clausal form
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   483
  and modified theory.*)
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   484
fun skolem_cache_thm th thy =
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   485
  case Thmtab.lookup (!clause_cache) th of
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   486
      NONE =>
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   487
        (case skolem thy (Thm.transfer thy th) of
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   488
             NONE => ([th],thy)
22345
85f76b341893 Improved handling of situation when theorem in cache disagrees with theorem supplied: new clauses
paulson
parents: 22218
diff changeset
   489
           | SOME (cls,thy') => 
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   490
                 (if null cls 
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   491
                  then warning ("skolem_cache: empty clause set for " ^ string_of_thm th)
20473
7ef72f030679 Using Drule.local_standard to reduce the space usage
paulson
parents: 20461
diff changeset
   492
                  else ();
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   493
                  change clause_cache (Thmtab.update (th, cls)); 
22345
85f76b341893 Improved handling of situation when theorem in cache disagrees with theorem supplied: new clauses
paulson
parents: 22218
diff changeset
   494
                  (cls,thy')))
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   495
    | SOME cls => (cls,thy);
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   496
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   497
(*Exported function to convert Isabelle theorems into axiom clauses*)
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   498
fun cnf_axiom th =
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   499
  case Thmtab.lookup (!clause_cache) th of
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   500
      NONE => 
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   501
	let val cls = map Goal.close_result (skolem_thm th)
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   502
	in Output.debug (fn () => "inserted into cache");
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   503
	   change clause_cache (Thmtab.update (th, cls)); cls 
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   504
	end
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   505
    | SOME cls => cls;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   506
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21602
diff changeset
   507
fun pairname th = (PureThy.get_name_hint th, th);
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   508
15872
8336ff711d80 fixed treatment of higher-order simprules
paulson
parents: 15736
diff changeset
   509
(**** Extract and Clausify theorems from a theory's claset and simpset ****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   510
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   511
fun rules_of_claset cs =
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   512
  let val {safeIs,safeEs,hazIs,hazEs,...} = rep_cs cs
19175
c6e4b073f6a5 subset_refl now included using the atp attribute
paulson
parents: 19113
diff changeset
   513
      val intros = safeIs @ hazIs
18532
0347c1bba406 elim rules: Classical.classical_rule;
wenzelm
parents: 18510
diff changeset
   514
      val elims  = map Classical.classical_rule (safeEs @ hazEs)
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   515
  in
22130
0906fd95e0b5 Output.debug: non-strict;
wenzelm
parents: 21999
diff changeset
   516
     Output.debug (fn () => "rules_of_claset intros: " ^ Int.toString(length intros) ^
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   517
            " elims: " ^ Int.toString(length elims));
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
   518
     map pairname (intros @ elims)
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   519
  end;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   520
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   521
fun rules_of_simpset ss =
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   522
  let val ({rules,...}, _) = rep_ss ss
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   523
      val simps = Net.entries rules
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   524
  in
22130
0906fd95e0b5 Output.debug: non-strict;
wenzelm
parents: 21999
diff changeset
   525
    Output.debug (fn () => "rules_of_simpset: " ^ Int.toString(length simps));
0906fd95e0b5 Output.debug: non-strict;
wenzelm
parents: 21999
diff changeset
   526
    map (fn r => (#name r, #thm r)) simps
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   527
  end;
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   528
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
   529
fun claset_rules_of ctxt = rules_of_claset (local_claset_of ctxt);
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
   530
fun simpset_rules_of ctxt = rules_of_simpset (local_simpset_of ctxt);
19196
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
   531
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
   532
fun atpset_rules_of ctxt = map pairname (ResAtpset.get_atpset ctxt);
20774
8f947ffb5eb8 ResAtpset.get_atpset;
wenzelm
parents: 20710
diff changeset
   533
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   534
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   535
(**** Translate a set of theorems into CNF ****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   536
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   537
(* classical rules: works for both FOL and HOL *)
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   538
fun cnf_rules [] err_list = ([],err_list)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   539
  | cnf_rules ((name,th) :: ths) err_list =
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   540
      let val (ts,es) = cnf_rules ths err_list
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   541
      in  (cnf_axiom th :: ts,es) handle  _ => (ts, (th::es))  end;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   542
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   543
fun pair_name_cls k (n, []) = []
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   544
  | pair_name_cls k (n, cls::clss) = (cls, (n,k)) :: pair_name_cls (k+1) (n, clss)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   545
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   546
fun cnf_rules_pairs_aux pairs [] = pairs
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   547
  | cnf_rules_pairs_aux pairs ((name,th)::ths) =
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   548
      let val pairs' = (pair_name_cls 0 (name, cnf_axiom th)) @ pairs
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   549
                       handle THM _ => pairs | ResClause.CLAUSE _ => pairs
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   550
      in  cnf_rules_pairs_aux pairs' ths  end;
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   551
21290
33b6bb5d6ab8 Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents: 21254
diff changeset
   552
(*The combination of rev and tail recursion preserves the original order*)
33b6bb5d6ab8 Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents: 21254
diff changeset
   553
fun cnf_rules_pairs l = cnf_rules_pairs_aux [] (rev l);
19353
36b6b15ee670 added another function for CNF.
mengj
parents: 19232
diff changeset
   554
19196
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
   555
18198
95330fc0ea8d -- combined common CNF functions used by HOL and FOL axioms, the difference between conversion of HOL and FOL theorems only comes in when theorems are converted to ResClause.clause or ResHolClause.clause format.
mengj
parents: 18144
diff changeset
   556
(**** Convert all theorems of a claset/simpset into clauses (ResClause.clause, or ResHolClause.clause) ****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   557
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   558
(*Setup function: takes a theory and installs ALL known theorems into the clause cache*)
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   559
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   560
fun skolem_cache th thy =
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   561
  let val prop = Thm.prop_of th
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   562
  in
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   563
      if lambda_free prop 
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   564
         (*Monomorphic theorems can be Skolemized on demand,
20867
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
   565
           but there are problems with re-use of abstraction functions if we don't
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
   566
           do them now, even for monomorphic theorems.*)
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
   567
      then thy  
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   568
      else #2 (skolem_cache_thm th thy)
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   569
  end;
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   570
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   571
(*The cache can be kept smaller by augmenting the condition above with 
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   572
    orelse (not abstract_lambdas andalso monomorphic prop).
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   573
  However, while this step does not reduce the time needed to build HOL, 
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   574
  it doubles the time taken by the first call to the ATP link-up.*)
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   575
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   576
fun clause_cache_setup thy = fold skolem_cache (map #2 (PureThy.all_thms_of thy)) thy;
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   577
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   578
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   579
(*** meson proof methods ***)
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   580
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   581
fun skolem_use_cache_thm th =
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   582
  case Thmtab.lookup (!clause_cache) th of
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   583
      NONE => skolem_thm th
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   584
    | SOME cls => cls;
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   585
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   586
fun cnf_rules_of_ths ths = List.concat (map skolem_use_cache_thm ths);
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   587
21588
cd0dc678a205 simplified method setup;
wenzelm
parents: 21505
diff changeset
   588
val meson_method_setup = Method.add_methods
cd0dc678a205 simplified method setup;
wenzelm
parents: 21505
diff changeset
   589
  [("meson", Method.thms_args (fn ths =>
cd0dc678a205 simplified method setup;
wenzelm
parents: 21505
diff changeset
   590
      Method.SIMPLE_METHOD' (CHANGED_PROP o Meson.meson_claset_tac (cnf_rules_of_ths ths) HOL_cs)),
cd0dc678a205 simplified method setup;
wenzelm
parents: 21505
diff changeset
   591
    "MESON resolution proof procedure")];
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   592
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   593
(** Attribute for converting a theorem into clauses **)
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   594
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   595
fun meta_cnf_axiom th = map Meson.make_meta_clause (cnf_axiom th);
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   596
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   597
fun clausify_rule (th,i) = List.nth (meta_cnf_axiom th, i)
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   598
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   599
val clausify = Attrib.syntax (Scan.lift Args.nat
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   600
  >> (fn i => Thm.rule_attribute (fn _ => fn th => clausify_rule (th, i))));
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   601
21999
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   602
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   603
(*** Converting a subgoal into negated conjecture clauses. ***)
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   604
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   605
val neg_skolemize_tac = EVERY' [rtac ccontr, ObjectLogic.atomize_tac, skolemize_tac];
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   606
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   607
(*finish_cnf removes tautologies and functional reflexivity axioms, but by calling Thm.varifyT
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   608
  it can introduce TVars, which we don't want in conjecture clauses.*)
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   609
val neg_clausify = map Thm.freezeT o Meson.finish_cnf o assume_abstract_list o make_clauses;
21999
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   610
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   611
fun neg_conjecture_clauses st0 n =
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   612
  let val st = Seq.hd (neg_skolemize_tac n st0)
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   613
      val (params,_,_) = strip_context (Logic.nth_prem (n, Thm.prop_of st))
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   614
  in (neg_clausify (Option.valOf (metahyps_thms n st)), params) end;
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   615
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   616
(*Conversion of a subgoal to conjecture clauses. Each clause has  
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   617
  leading !!-bound universal variables, to express generality. *)
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   618
val neg_clausify_tac = 
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   619
  neg_skolemize_tac THEN' 
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   620
  SUBGOAL
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   621
    (fn (prop,_) =>
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   622
     let val ts = Logic.strip_assums_hyp prop
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   623
     in EVERY1 
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   624
	 [METAHYPS
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   625
	    (fn hyps => 
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   626
              (Method.insert_tac
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   627
                (map forall_intr_vars (neg_clausify hyps)) 1)),
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   628
	  REPEAT_DETERM_N (length ts) o (etac thin_rl)]
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   629
     end);
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   630
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   631
(** The Skolemization attribute **)
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   632
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   633
fun conj2_rule (th1,th2) = conjI OF [th1,th2];
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   634
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   635
(*Conjoin a list of theorems to form a single theorem*)
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   636
fun conj_rule []  = TrueI
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   637
  | conj_rule ths = foldr1 conj2_rule ths;
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   638
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   639
fun skolem_attr (Context.Theory thy, th) =
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   640
      let val (cls, thy') = skolem_cache_thm th thy
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   641
      in (Context.Theory thy', conj_rule cls) end
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   642
  | skolem_attr (context, th) = (context, conj_rule (skolem_use_cache_thm th));
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   643
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   644
val setup_attrs = Attrib.add_attributes
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   645
  [("skolem", Attrib.no_args skolem_attr, "skolemization of a theorem"),
21999
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   646
   ("clausify", clausify, "conversion of theorem to clauses")];
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   647
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   648
val setup_methods = Method.add_methods
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   649
  [("neg_clausify", Method.no_args (Method.SIMPLE_METHOD' neg_clausify_tac), 
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   650
    "conversion of goal to conjecture clauses")];
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   651
     
21999
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   652
val setup = clause_cache_setup #> setup_attrs #> setup_methods;
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   653
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   654
end;