src/HOL/Tools/res_axioms.ML
author paulson
Fri, 10 Aug 2007 15:13:18 +0200
changeset 24215 5458fbf18276
parent 24137 8d7896398147
child 24300 e170cee91c66
permissions -rw-r--r--
removal of some refs
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 cnf_axiom : string * thm -> thm list
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
    11
  val cnf_name : string -> thm list
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    12
  val meta_cnf_axiom : thm -> thm list
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    13
  val pairname : thm -> string * thm
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
    14
  val skolem_thm : thm -> thm list
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    15
  val cnf_rules_pairs : (string * thm) list -> (thm * (string * int)) list
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18680
diff changeset
    16
  val meson_method_setup : theory -> theory
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18680
diff changeset
    17
  val setup : theory -> theory
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
    18
  val assume_abstract_list: string -> thm list -> thm list
21999
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
    19
  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
    20
  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
    21
  val simpset_rules_of: Proof.context -> (string * thm) list  (*FIXME DELETE*)
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    22
  val atpset_rules_of: Proof.context -> (string * thm) list
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
    23
end;
19196
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
    24
21900
f386d7eb17d1 tidying the ATP communications
paulson
parents: 21858
diff changeset
    25
structure ResAxioms =
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    26
struct
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    27
20996
197e6875d637 abstraction is now turned OFF...
paulson
parents: 20969
diff changeset
    28
(*For running the comparison between combinators and abstractions.
197e6875d637 abstraction is now turned OFF...
paulson
parents: 20969
diff changeset
    29
  CANNOT be a ref, as the setting is used while Isabelle is built.
22644
f10465ee7aa2 Fixed the treatment of TVars in conjecture clauses (they are deleted, not frozen)
paulson
parents: 22596
diff changeset
    30
  Currently TRUE: the combinator code cannot be used with proof reconstruction
f10465ee7aa2 Fixed the treatment of TVars in conjecture clauses (they are deleted, not frozen)
paulson
parents: 22596
diff changeset
    31
  because it is not performed by inference!!*)
21900
f386d7eb17d1 tidying the ATP communications
paulson
parents: 21858
diff changeset
    32
val abstract_lambdas = true;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    33
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
    34
(* FIXME legacy *)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    35
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
    36
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
    37
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
    38
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
    39
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    40
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    41
(*Store definitions of abstraction functions, ensuring that identical right-hand
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    42
  sides are denoted by the same functions and thereby reducing the need for
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    43
  extensionality in proofs.
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    44
  FIXME!  Store in theory data!!*)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    45
20867
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
    46
(*Populate the abstraction cache with common combinators.*)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    47
fun seed th net =
22902
ac833b4bb7ee moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents: 22846
diff changeset
    48
  let val (_,ct) = Thm.dest_abs NONE (Thm.rhs_of th)
20867
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
    49
      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
    50
  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
    51
  
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
    52
val abstraction_cache = ref 
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    53
      (seed (thm"ATP_Linkup.I_simp") 
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    54
       (seed (thm"ATP_Linkup.B_simp") 
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    55
	(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
    56
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
    57
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    58
(**** Transformation of Elimination Rules into First-Order Formulas****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    59
21430
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    60
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
    61
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
    62
21430
77651b6d9d6c New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents: 21290
diff changeset
    63
(*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
    64
  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
    65
  conclusion variable to False.*)
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
    66
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
    67
  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
    68
       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
    69
           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
    70
    | 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
    71
           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
    72
    | _ => th;
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    73
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    74
(**** Transformation of Clasets and Simpsets into First-Order Axioms ****)
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    75
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    76
(*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
    77
  inside that theory -- because it's needed for Skolemization *)
8bad1f42fec0 new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents: 15347
diff changeset
    78
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    79
(*This will refer to the final version of theory ATP_Linkup.*)
24137
8d7896398147 replaced Theory.self_ref by Theory.check_thy, which now produces a checked ref;
wenzelm
parents: 24042
diff changeset
    80
val recon_thy_ref = Theory.check_thy @{theory}
15359
8bad1f42fec0 new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents: 15347
diff changeset
    81
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
    82
(*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
    83
  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
    84
fun transfer_to_ATP_Linkup th =
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
    85
    transfer (Theory.deref recon_thy_ref) th handle THM _ => th;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    86
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
    87
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
    88
(**** SKOLEMIZATION BY INFERENCE (lcp) ****)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
    89
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
    90
(*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
    91
  prefix for the Skolem constant. Result is a new theory*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
    92
fun declare_skofuns s th thy =
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
    93
  let val nref = ref 0
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
    94
      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
    95
            (*Existential: declare a Skolem function, then insert into body and continue*)
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
    96
            let val cname = Name.internal ("sko_" ^ s ^ "_" ^ Int.toString (inc nref))
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
    97
                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
    98
                val Ts = map type_of args
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
    99
                val cT = Ts ---> T
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   100
                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
   101
                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
   102
                        (*Forms a lambda-abstraction over the formal parameters*)
20783
17114542d2d4 Sign.add_consts_authentic;
wenzelm
parents: 20774
diff changeset
   103
                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
   104
                           (*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
   105
                val cdef = cname ^ "_def"
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   106
                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
   107
            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
   108
                       (thy'', get_axiom thy'' cdef :: axs)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   109
            end
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   110
        | 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
   111
            (*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
   112
            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
   113
            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
   114
        | 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
   115
        | 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
   116
        | 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
   117
        | dec_sko t thx = thx (*Do nothing otherwise*)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   118
  in  dec_sko (prop_of th) (thy,[])  end;
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   119
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   120
(*Traverse a theorem, accumulating Skolem function definitions.*)
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   121
fun assume_skofuns s th =
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   122
  let val sko_count = ref 0
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   123
      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
   124
            (*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
   125
            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
   126
                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
   127
                val Ts = map type_of args
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   128
                val cT = Ts ---> T
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   129
                val id = "sko_" ^ s ^ "_" ^ Int.toString (inc sko_count)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   130
                val c = Free (id, cT)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   131
                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
   132
                                         HOLogic.choice_const T $ xtp)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   133
                      (*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
   134
                val def = equals cT $ c $ rhs
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   135
            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
   136
                       (def :: defs)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   137
            end
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   138
        | 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
   139
            (*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
   140
            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
   141
            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
   142
        | 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
   143
        | 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
   144
        | 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
   145
        | dec_sko t defs = defs (*Do nothing otherwise*)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   146
  in  dec_sko (prop_of th) []  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   147
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   148
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   149
(**** REPLACING ABSTRACTIONS BY FUNCTION DEFINITIONS ****)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   150
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   151
(*Returns the vars of a theorem*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   152
fun vars_of_thm th =
22691
290454649b8c Thm.fold_terms;
wenzelm
parents: 22644
diff changeset
   153
  map (Thm.cterm_of (theory_of_thm th) o Var) (Thm.fold_terms Term.add_vars th []);
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   154
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   155
(*Make a version of fun_cong with a given variable name*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   156
local
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   157
    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
   158
    val cx = hd (vars_of_thm fun_cong');
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   159
    val ty = typ_of (ctyp_of_term cx);
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   160
    val thy = theory_of_thm fun_cong;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   161
    fun mkvar a = cterm_of thy (Var((a,0),ty));
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   162
in
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   163
fun xfun_cong x = Thm.instantiate ([], [(cx, mkvar x)]) fun_cong'
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   164
end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   165
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   166
(*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
   167
  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
   168
fun strip_lambdas 0 th = th
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   169
  | strip_lambdas n th = 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   170
      case prop_of th of
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   171
	  _ $ (Const ("op =", _) $ _ $ Abs (x,_,_)) =>
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   172
	      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
   173
	| _ => th;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   174
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   175
(*Convert meta- to object-equality. Fails for theorems like split_comp_eq,
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   176
  where some types have the empty sort.*)
22218
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22130
diff changeset
   177
val meta_eq_to_obj_eq = thm "meta_eq_to_obj_eq";
30a8890d2967 dropped lemma duplicates in HOL.thy
haftmann
parents: 22130
diff changeset
   178
fun mk_object_eq th = th RS meta_eq_to_obj_eq
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   179
    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
   180
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   181
(*Apply a function definition to an argument, beta-reducing the result.*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   182
fun beta_comb cf x =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   183
  let val th1 = combination cf (reflexive x)
22902
ac833b4bb7ee moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents: 22846
diff changeset
   184
      val th2 = beta_conversion false (Thm.rhs_of th1)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   185
  in  transitive th1 th2  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   186
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   187
(*Apply a function definition to arguments, beta-reducing along the way.*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   188
fun list_combination cf [] = cf
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   189
  | list_combination cf (x::xs) = list_combination (beta_comb cf x) xs;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   190
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   191
fun list_cabs ([] ,     t) = t
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   192
  | list_cabs (v::vars, t) = Thm.cabs v (list_cabs(vars,t));
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   193
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   194
fun assert_eta_free ct =
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   195
  let val t = term_of ct
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   196
  in if (t aconv Envir.eta_contract t) then ()
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   197
     else error ("Eta redex in term: " ^ string_of_cterm ct)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   198
  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   199
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   200
fun eq_absdef (th1, th2) =
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   201
    Context.joinable (theory_of_thm th1, theory_of_thm th2)  andalso
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   202
    rhs_of th1 aconv rhs_of th2;
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   203
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   204
fun lambda_free (Abs _) = false
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   205
  | lambda_free (t $ u) = lambda_free t andalso lambda_free u
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   206
  | lambda_free _ = true;
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   207
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   208
fun monomorphic t =
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   209
  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
   210
20710
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   211
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
   212
  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
   213
      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
   214
  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
   215
  handle CTERM _ => ([],ct);
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   216
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   217
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
   218
  | 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
   219
384bfce59254 Abstraction now handles equations where the RHS is a lambda-expression; also, strings of lambdas
paulson
parents: 20624
diff changeset
   220
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
   221
  | 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
   222
  | 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
   223
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   224
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   225
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
   226
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   227
(*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
   228
  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
   229
fun match_rhs thy t th =
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   230
  let val _ = Output.debug (fn()=> "match_rhs: " ^ string_of_cterm (cterm_of thy t) ^ 
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   231
                                   " against\n" ^ string_of_thm th);
20867
e7b92a48e22b Refinements to abstraction. Seeding with combinators K, I and B.
paulson
parents: 20863
diff changeset
   232
      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
   233
      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
   234
      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
   235
                        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
   236
                     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
   237
                     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
   238
      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
   239
      val th' = cterm_instantiate ct_pairs th
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   240
  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
   241
  handle _ => NONE;
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   242
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   243
(*Traverse a theorem, declaring abstraction function definitions. String s is the suggested
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   244
  prefix for the constants. Resulting theory is returned in the first theorem. *)
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   245
fun declare_absfuns s th =
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   246
  let val nref = ref 0
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   247
      fun abstract thy ct =
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   248
        if lambda_free (term_of ct) then (transfer thy (reflexive ct), [])
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   249
        else
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   250
        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
   251
          Abs _ =>
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   252
            let val cname = Name.internal ("llabs_" ^ s ^ "_" ^ Int.toString (inc nref))
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   253
                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
   254
                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
   255
                val (vs,Tvs) = ListPair.unzip (map (dest_Free o term_of) cvs)
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   256
                val _ = Output.debug (fn()=>"Nested lambda: " ^ string_of_cterm cta);
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   257
                val (u'_th,defs) = abstract thy cta
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   258
                val _ = Output.debug (fn()=>"Returned " ^ string_of_thm u'_th);
22902
ac833b4bb7ee moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents: 22846
diff changeset
   259
                val cu' = Thm.rhs_of u'_th
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   260
                val u' = term_of cu'
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   261
                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
   262
                (*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
   263
                val args = term_frees abs_v_u
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   264
                val _ = Output.debug (fn()=>Int.toString (length args) ^ " arguments");
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   265
                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
   266
                      (*Forms a lambda-abstraction over the formal parameters*)
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   267
                val _ = Output.debug (fn()=>"Looking up " ^ string_of_cterm cu');
20969
341808e0b7f2 Abstraction re-use code now checks that the abstraction function can be used in the current
paulson
parents: 20902
diff changeset
   268
                val thy = theory_of_thm u'_th
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   269
                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
   270
                 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
   271
                         (Net.match_term (!abstraction_cache) u') of
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   272
                     (ax,ax')::_ => 
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   273
                       (Output.debug (fn()=>"Re-using axiom " ^ string_of_thm ax);
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   274
                        (ax,ax',thy))
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   275
                   | [] =>
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   276
                      let val _ = Output.debug (fn()=>"Lookup was empty");
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   277
                          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
   278
                          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
   279
                          val c = Const (Sign.full_name thy cname, cT)
20783
17114542d2d4 Sign.add_consts_authentic;
wenzelm
parents: 20774
diff changeset
   280
                          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
   281
                                     (*Theory is augmented with the constant,
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   282
                                       then its definition*)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   283
                          val cdef = cname ^ "_def"
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   284
                          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
   285
                                       [(cdef, equals cT $ c $ rhs)] thy
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   286
                          val _ = Output.debug (fn()=> "Definition is " ^ string_of_thm (get_axiom thy cdef));
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   287
                          val ax = get_axiom thy cdef |> freeze_thm
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   288
                                     |> mk_object_eq |> strip_lambdas (length args)
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   289
                                     |> 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
   290
                          val (_,ax') = Option.valOf (match_rhs thy abs_v_u ax)
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   291
                          val _ = Output.debug (fn()=> "Declaring: " ^ string_of_thm ax ^ "\n" ^
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   292
                                                       "Instance: " ^ string_of_thm ax');
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   293
                          val _ = abstraction_cache := Net.insert_term eq_absdef 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   294
                                            ((Logic.varify u'), ax) (!abstraction_cache)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   295
                            handle Net.INSERT =>
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   296
                              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
   297
                       in  (ax,ax',thy)  end
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   298
            in Output.debug (fn()=>"Lookup result: " ^ string_of_thm ax');
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   299
               (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
   300
        | (t1$t2) =>
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   301
            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
   302
                val (th1,defs1) = abstract thy ct1
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   303
                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
   304
            in  (combination th1 th2, defs1@defs2)  end
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   305
      val _ = Output.debug (fn()=>"declare_absfuns, Abstracting: " ^ string_of_thm th);
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   306
      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
   307
      val ths = equal_elim eqth th :: map (strip_lambdas ~1 o mk_object_eq o freeze_thm) defs
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   308
      val _ = Output.debug (fn()=>"declare_absfuns, Result: " ^ string_of_thm (hd ths));
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   309
  in  (theory_of_thm eqth, map Drule.eta_contraction_rule ths)  end;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   310
20902
a0034e545c13 replaced Drule.clhs/crhs_of by Drule.lhs/rhs_of;
wenzelm
parents: 20867
diff changeset
   311
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
   312
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   313
(*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
   314
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
   315
  | valid_name defs _ = false;
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   316
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   317
(*s is the theorem name (hint) or the word "subgoal"*)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   318
fun assume_absfuns s th =
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   319
  let val thy = theory_of_thm th
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   320
      val cterm = cterm_of thy
22724
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   321
      val abs_count = ref 0
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   322
      fun abstract ct =
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   323
        if lambda_free (term_of ct) then (reflexive ct, [])
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   324
        else
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   325
        case term_of ct of
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   326
          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
   327
            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
   328
                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
   329
                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
   330
                val (u'_th,defs) = abstract cta
22902
ac833b4bb7ee moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents: 22846
diff changeset
   331
                val cu' = Thm.rhs_of u'_th
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   332
                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
   333
                (*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
   334
                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
   335
                (*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
   336
                  (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
   337
                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
   338
                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
   339
                      (*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
   340
                val rhs = term_of crhs
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   341
                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
   342
                 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
   343
                        (Net.match_term (!abstraction_cache) u') of
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   344
                     (ax,ax')::_ => 
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   345
                       (Output.debug (fn()=>"Re-using axiom " ^ string_of_thm ax);
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   346
                        (ax,ax'))
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   347
                   | [] =>
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   348
                      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
   349
                          val const_ty = Ts ---> (Tvs ---> typ_of (ctyp_of_term cu'))
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   350
                          val id = "llabs_" ^ s ^ "_" ^ Int.toString (inc abs_count)
22724
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   351
                          val c = Free (id, const_ty)
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   352
                          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
   353
                                     |> mk_object_eq |> strip_lambdas (length args)
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   354
                                     |> 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
   355
                          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
   356
                          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
   357
                                    (!abstraction_cache)
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   358
                            handle Net.INSERT =>
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   359
                              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
   360
                      in (ax,ax') end
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   361
            in Output.debug (fn()=>"Lookup result: " ^ string_of_thm ax');
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   362
               (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
   363
        | (t1$t2) =>
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   364
            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
   365
                val (t1',defs1) = abstract ct1
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   366
                val (t2',defs2) = abstract ct2
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   367
            in  (combination t1' t2', defs1@defs2)  end
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   368
      val _ = Output.debug (fn()=>"assume_absfuns, Abstracting: " ^ string_of_thm th);
20525
4b0fdb18ea9a bug fix to abstractions: free variables in theorem can be abstracted over.
paulson
parents: 20473
diff changeset
   369
      val (eqth,defs) = abstract (cprop_of th)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   370
      val ths = equal_elim eqth th :: map (strip_lambdas ~1 o mk_object_eq o freeze_thm) defs
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   371
      val _ = Output.debug (fn()=>"assume_absfuns, Result: " ^ string_of_thm (hd ths));
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   372
  in  map Drule.eta_contraction_rule ths  end;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   373
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   374
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   375
(*cterms are used throughout for efficiency*)
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   376
val cTrueprop = Thm.cterm_of HOL.thy HOLogic.Trueprop;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   377
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   378
(*cterm version of mk_cTrueprop*)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   379
fun c_mkTrueprop A = Thm.capply cTrueprop A;
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   380
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   381
(*Given an abstraction over n variables, replace the bound variables by free
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   382
  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
   383
fun c_variant_abs_multi (ct0, vars) =
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   384
      let val (cv,ct) = Thm.dest_abs NONE ct0
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   385
      in  c_variant_abs_multi (ct, cv::vars)  end
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   386
      handle CTERM _ => (ct0, rev vars);
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   387
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   388
(*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
   389
  an existential formula by a use of that function.
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   390
   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
   391
fun skolem_of_def def =
22902
ac833b4bb7ee moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents: 22846
diff changeset
   392
  let val (c,rhs) = Thm.dest_equals (cprop_of (freeze_thm def))
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   393
      val (ch, frees) = c_variant_abs_multi (rhs, [])
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   394
      val (chilbert,cabs) = Thm.dest_comb ch
22596
d0d2af4db18f rep_thm/cterm/ctyp: removed obsolete sign field;
wenzelm
parents: 22516
diff changeset
   395
      val {thy,t, ...} = rep_cterm chilbert
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   396
      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
   397
                      | _ => raise THM ("skolem_of_def: expected Eps", 0, [def])
22596
d0d2af4db18f rep_thm/cterm/ctyp: removed obsolete sign field;
wenzelm
parents: 22516
diff changeset
   398
      val cex = Thm.cterm_of thy (HOLogic.exists_const T)
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   399
      val ex_tm = c_mkTrueprop (Thm.capply cex cabs)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   400
      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
   401
      fun tacf [prem] = rewrite_goals_tac [def] THEN rtac (prem RS someI_ex) 1
23352
356edb5eb1c4 renamed Goal.prove_raw to Goal.prove_internal;
wenzelm
parents: 22902
diff changeset
   402
  in  Goal.prove_internal [ex_tm] conc tacf
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   403
       |> forall_intr_list frees
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   404
       |> forall_elim_vars 0  (*Introduce Vars, but don't discharge defs.*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   405
       |> Thm.varifyT
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   406
  end;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   407
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   408
(*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
   409
fun to_nnf th =
21254
d53f76357f41 incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents: 21102
diff changeset
   410
    th |> transfer_to_ATP_Linkup
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   411
       |> transform_elim |> zero_var_indexes |> freeze_thm
23592
ba0912262b2c renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23352
diff changeset
   412
       |> Conv.fconv_rule ObjectLogic.atomize |> make_nnf |> strip_lambdas ~1;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   413
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   414
(*Generate Skolem functions for a theorem supplied in nnf*)
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   415
fun skolem_of_nnf s th =
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   416
  map (skolem_of_def o assume o (cterm_of (theory_of_thm th))) (assume_skofuns s th);
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   417
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   418
fun assert_lambda_free ths msg = 
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   419
  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
   420
      [] => ()
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   421
    | ths' => error (msg ^ "\n" ^ cat_lines (map string_of_thm ths'));
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   422
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   423
fun assume_abstract s th =
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   424
  if lambda_free (prop_of th) then [th]
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   425
  else th |> Drule.eta_contraction_rule |> assume_absfuns s
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   426
          |> tap (fn ths => assert_lambda_free ths "assume_abstract: lambdas")
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   427
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   428
(*Replace lambdas by assumed function definitions in the theorems*)
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   429
fun assume_abstract_list s ths =
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   430
  if abstract_lambdas then List.concat (map (assume_abstract s) ths)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   431
  else map Drule.eta_contraction_rule ths;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   432
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   433
(*Replace lambdas by declared function definitions in the theorems*)
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   434
fun declare_abstract' s (thy, []) = (thy, [])
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   435
  | declare_abstract' s (thy, th::ths) =
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   436
      let val (thy', th_defs) =
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   437
            if lambda_free (prop_of th) then (thy, [th])
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   438
            else
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   439
                th |> zero_var_indexes |> freeze_thm
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   440
                   |> Drule.eta_contraction_rule |> transfer thy |> declare_absfuns s
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   441
          val _ = assert_lambda_free th_defs "declare_abstract: lambdas"
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   442
          val (thy'', ths') = declare_abstract' s (thy', ths)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   443
      in  (thy'', th_defs @ ths')  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   444
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   445
fun declare_abstract s (thy, ths) =
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   446
  if abstract_lambdas then declare_abstract' s (thy, ths)
20863
4ee61dbf192d improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents: 20789
diff changeset
   447
  else (thy, map Drule.eta_contraction_rule ths);
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   448
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   449
(*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
   450
fun flatten_name s = space_implode "_X" (NameSpace.explode s);
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   451
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   452
fun fake_name th =
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   453
  if PureThy.has_name_hint th then flatten_name (PureThy.get_name_hint th) 
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   454
  else gensym "unknown_thm_";
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   455
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   456
(*Skolemize a named theorem, with Skolem functions as additional premises.*)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   457
fun skolem_thm th =
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   458
  let val nnfth = to_nnf th and s = fake_name th
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   459
  in  Meson.make_cnf (skolem_of_nnf s nnfth) nnfth |> assume_abstract_list s |> Meson.finish_cnf
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   460
  end
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   461
  handle THM _ => [];
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   462
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   463
(*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
   464
  It returns a modified theory, unless skolemization fails.*)
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   465
fun skolem thy th =
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   466
     Option.map
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   467
        (fn (nnfth, s) =>
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   468
          let val _ = Output.debug (fn () => "skolemizing " ^ s ^ ": ")
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   469
              val (thy',defs) = declare_skofuns s nnfth thy
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   470
              val cnfs = Meson.make_cnf (map skolem_of_def defs) nnfth
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   471
              val (thy'',cnfs') = declare_abstract s (thy',cnfs)
22345
85f76b341893 Improved handling of situation when theorem in cache disagrees with theorem supplied: new clauses
paulson
parents: 22218
diff changeset
   472
          in (map Goal.close_result (Meson.finish_cnf cnfs'), thy'')
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   473
          end)
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   474
      (SOME (to_nnf th, fake_name th)  handle THM _ => NONE);
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   475
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   476
structure ThmCache = TheoryDataFun
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22731
diff changeset
   477
(
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   478
  type T = (thm list) Thmtab.table ref;
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   479
  val empty : T = ref Thmtab.empty;
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   480
  fun copy (ref tab) : T = ref tab;
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   481
  val extend = copy;
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   482
  fun merge _ (ref tab1, ref tab2) : T = ref (Thmtab.merge (K true) (tab1, tab2));
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22731
diff changeset
   483
);
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   484
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   485
(*The cache prevents repeated clausification of a theorem, and also repeated declaration of 
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   486
  Skolem functions. The global one holds theorems proved prior to this point. Theory data
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   487
  holds the remaining ones.*)
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   488
val global_clause_cache = ref (Thmtab.empty : (thm list) Thmtab.table);
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   489
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   490
(*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
   491
  and modified theory.*)
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   492
fun skolem_cache_thm clause_cache th thy =
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   493
  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
   494
      NONE =>
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   495
        (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
   496
             NONE => ([th],thy)
22345
85f76b341893 Improved handling of situation when theorem in cache disagrees with theorem supplied: new clauses
paulson
parents: 22218
diff changeset
   497
           | SOME (cls,thy') => 
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   498
                 (if null cls 
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   499
                  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
   500
                  else ();
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   501
                  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
   502
                  (cls,thy')))
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   503
    | SOME cls => (cls,thy);
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   504
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   505
(*Exported function to convert Isabelle theorems into axiom clauses*)
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   506
fun cnf_axiom th =
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   507
  let val cache = ThmCache.get (Thm.theory_of_thm th)
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   508
                  handle ERROR _ => global_clause_cache
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   509
      val in_cache = if cache = global_clause_cache then NONE else Thmtab.lookup (!cache) th
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   510
  in
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   511
     case in_cache of
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   512
       NONE => 
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   513
	 (case Thmtab.lookup (!global_clause_cache) th of
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   514
	   NONE => 
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   515
	     let val cls = map Goal.close_result (skolem_thm th)
22724
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   516
	     in Output.debug (fn () => Int.toString (length cls) ^ " clauses inserted into cache: " ^ 
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   517
	                         (if PureThy.has_name_hint th then PureThy.get_name_hint th
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   518
	                          else string_of_thm th));
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   519
		change cache (Thmtab.update (th, cls)); cls 
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   520
	     end
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   521
	 | SOME cls => cls)
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   522
     | SOME cls => cls
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   523
  end;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   524
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 21602
diff changeset
   525
fun pairname th = (PureThy.get_name_hint th, th);
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   526
15872
8336ff711d80 fixed treatment of higher-order simprules
paulson
parents: 15736
diff changeset
   527
(**** Extract and Clausify theorems from a theory's claset and simpset ****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   528
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   529
fun rules_of_claset cs =
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   530
  let val {safeIs,safeEs,hazIs,hazEs,...} = rep_cs cs
19175
c6e4b073f6a5 subset_refl now included using the atp attribute
paulson
parents: 19113
diff changeset
   531
      val intros = safeIs @ hazIs
18532
0347c1bba406 elim rules: Classical.classical_rule;
wenzelm
parents: 18510
diff changeset
   532
      val elims  = map Classical.classical_rule (safeEs @ hazEs)
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   533
  in
22130
0906fd95e0b5 Output.debug: non-strict;
wenzelm
parents: 21999
diff changeset
   534
     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
   535
            " elims: " ^ Int.toString(length elims));
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
   536
     map pairname (intros @ elims)
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   537
  end;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   538
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   539
fun rules_of_simpset ss =
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   540
  let val ({rules,...}, _) = rep_ss ss
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   541
      val simps = Net.entries rules
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   542
  in
22130
0906fd95e0b5 Output.debug: non-strict;
wenzelm
parents: 21999
diff changeset
   543
    Output.debug (fn () => "rules_of_simpset: " ^ Int.toString(length simps));
0906fd95e0b5 Output.debug: non-strict;
wenzelm
parents: 21999
diff changeset
   544
    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
   545
  end;
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   546
21505
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
   547
fun claset_rules_of ctxt = rules_of_claset (local_claset_of ctxt);
13d4dba99337 prefer Proof.context over Context.generic;
wenzelm
parents: 21470
diff changeset
   548
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
   549
24042
968f42fe6836 simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23592
diff changeset
   550
fun atpset_rules_of ctxt = map pairname (ResAtpset.get ctxt);
20774
8f947ffb5eb8 ResAtpset.get_atpset;
wenzelm
parents: 20710
diff changeset
   551
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   552
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   553
(**** Translate a set of theorems into CNF ****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   554
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   555
(* classical rules: works for both FOL and HOL *)
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   556
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
   557
  | cnf_rules ((name,th) :: ths) err_list =
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   558
      let val (ts,es) = cnf_rules ths err_list
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   559
      in  (cnf_axiom th :: ts,es) handle  _ => (ts, (th::es))  end;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   560
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   561
fun pair_name_cls k (n, []) = []
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   562
  | 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
   563
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   564
fun cnf_rules_pairs_aux pairs [] = pairs
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   565
  | cnf_rules_pairs_aux pairs ((name,th)::ths) =
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   566
      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
   567
                       handle THM _ => pairs | ResClause.CLAUSE _ => pairs
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   568
      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
   569
21290
33b6bb5d6ab8 Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents: 21254
diff changeset
   570
(*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
   571
fun cnf_rules_pairs l = cnf_rules_pairs_aux [] (rev l);
19353
36b6b15ee670 added another function for CNF.
mengj
parents: 19232
diff changeset
   572
19196
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
   573
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
   574
(**** 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
   575
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   576
(*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
   577
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   578
fun skolem_cache clause_cache th thy = #2 (skolem_cache_thm clause_cache th thy);
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   579
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   580
(*The cache can be kept smaller by inspecting the prop of each thm. Can ignore all that are
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   581
  lambda_free, but then the individual theory caches become much bigger.*)
21071
8d0245c5ed9e Fixed the "exception Empty" bug in elim2Fol
paulson
parents: 20996
diff changeset
   582
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   583
fun clause_cache_setup thy = 
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   584
  fold (skolem_cache global_clause_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
   585
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   586
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   587
(*** meson proof methods ***)
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   588
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   589
fun cnf_rules_of_ths ths = List.concat (map cnf_axiom ths);
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   590
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   591
(*Expand all new*definitions of abstraction or Skolem functions in a proof state.*)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   592
fun is_absko (Const ("==", _) $ Free (a,_) $ u) = String.isPrefix "llabs_" a orelse String.isPrefix "sko_" a
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   593
  | is_absko _ = false;
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   594
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   595
fun is_okdef xs (Const ("==", _) $ t $ u) =   (*Definition of Free, not in certain terms*)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   596
      is_Free t andalso not (member (op aconv) xs t)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   597
  | is_okdef _ _ = false
22724
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   598
24215
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   599
(*This function tries to cope with open locales, which introduce hypotheses of the form
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   600
  Free == t, conjecture clauses, which introduce various hypotheses, and also definitions
5458fbf18276 removal of some refs
paulson
parents: 24137
diff changeset
   601
  of llabs_ and sko_ functions. *)
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   602
fun expand_defs_tac st0 st =
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   603
  let val hyps0 = #hyps (rep_thm st0)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   604
      val hyps = #hyps (crep_thm st)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   605
      val newhyps = filter_out (member (op aconv) hyps0 o Thm.term_of) hyps
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   606
      val defs = filter (is_absko o Thm.term_of) newhyps
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   607
      val remaining_hyps = filter_out (member (op aconv) (map Thm.term_of defs)) 
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   608
                                      (map Thm.term_of hyps)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   609
      val fixed = term_frees (concl_of st) @
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   610
                  foldl (gen_union (op aconv)) [] (map term_frees remaining_hyps)
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   611
  in  Output.debug (fn _ => "expand_defs_tac: " ^ string_of_thm st);
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   612
      Output.debug (fn _ => "  st0: " ^ string_of_thm st0);
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   613
      Output.debug (fn _ => "  defs: " ^ commas (map string_of_cterm defs));
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   614
      Seq.of_list [LocalDefs.expand (filter (is_okdef fixed o Thm.term_of) defs) st]
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   615
  end;
22724
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   616
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   617
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   618
fun meson_general_tac ths i st0 =
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   619
 let val _ = Output.debug (fn () => "Meson called: " ^ cat_lines (map string_of_thm ths))
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   620
 in  (Meson.meson_claset_tac (cnf_rules_of_ths ths) HOL_cs i THEN expand_defs_tac st0) st0 end;
22724
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   621
21588
cd0dc678a205 simplified method setup;
wenzelm
parents: 21505
diff changeset
   622
val meson_method_setup = Method.add_methods
cd0dc678a205 simplified method setup;
wenzelm
parents: 21505
diff changeset
   623
  [("meson", Method.thms_args (fn ths =>
22724
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   624
      Method.SIMPLE_METHOD' (CHANGED_PROP o meson_general_tac ths)),
21588
cd0dc678a205 simplified method setup;
wenzelm
parents: 21505
diff changeset
   625
    "MESON resolution proof procedure")];
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   626
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   627
(** Attribute for converting a theorem into clauses **)
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   628
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   629
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
   630
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   631
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
   632
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   633
val clausify = Attrib.syntax (Scan.lift Args.nat
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   634
  >> (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
   635
21999
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   636
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   637
(*** Converting a subgoal into negated conjecture clauses. ***)
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   638
23592
ba0912262b2c renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents: 23352
diff changeset
   639
val neg_skolemize_tac = EVERY' [rtac ccontr, ObjectLogic.atomize_prems_tac, skolemize_tac];
22471
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   640
7c51f1a799f3 Removal of axiom names from the theorem cache
paulson
parents: 22360
diff changeset
   641
(*finish_cnf removes tautologies and functional reflexivity axioms, but by calling Thm.varifyT
22644
f10465ee7aa2 Fixed the treatment of TVars in conjecture clauses (they are deleted, not frozen)
paulson
parents: 22596
diff changeset
   642
  it can introduce TVars, which are useless in conjecture clauses.*)
f10465ee7aa2 Fixed the treatment of TVars in conjecture clauses (they are deleted, not frozen)
paulson
parents: 22596
diff changeset
   643
val no_tvars = null o term_tvars o prop_of;
f10465ee7aa2 Fixed the treatment of TVars in conjecture clauses (they are deleted, not frozen)
paulson
parents: 22596
diff changeset
   644
22731
abfdccaed085 trying to make single-step proofs work better, especially if they contain
paulson
parents: 22724
diff changeset
   645
val neg_clausify = filter no_tvars o Meson.finish_cnf o assume_abstract_list "subgoal" o make_clauses;
21999
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   646
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   647
fun neg_conjecture_clauses st0 n =
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   648
  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
   649
      val (params,_,_) = strip_context (Logic.nth_prem (n, Thm.prop_of st))
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   650
  in (neg_clausify (Option.valOf (metahyps_thms n st)), params) end
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   651
  handle Option => raise ERROR "unable to Skolemize subgoal";
21999
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   652
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   653
(*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
   654
  leading !!-bound universal variables, to express generality. *)
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   655
val neg_clausify_tac = 
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   656
  neg_skolemize_tac THEN' 
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   657
  SUBGOAL
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   658
    (fn (prop,_) =>
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   659
     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
   660
     in EVERY1 
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   661
	 [METAHYPS
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   662
	    (fn hyps => 
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   663
              (Method.insert_tac
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   664
                (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
   665
	  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
   666
     end);
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   667
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   668
(** The Skolemization attribute **)
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   669
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   670
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
   671
20457
85414caac94a refinements to conversion into clause form, esp for the HO case
paulson
parents: 20445
diff changeset
   672
(*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
   673
fun conj_rule []  = TrueI
20445
b222d9939e00 improvements to abstraction generation
paulson
parents: 20421
diff changeset
   674
  | conj_rule ths = foldr1 conj2_rule ths;
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   675
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   676
fun skolem_attr (Context.Theory thy, th) =
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   677
      let val (cls, thy') = skolem_cache_thm (ThmCache.get thy) th thy
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   678
      in (Context.Theory thy', conj_rule cls) end
22724
3002683a6e0f Fixes for proof reconstruction, especially involving abstractions and definitions
paulson
parents: 22691
diff changeset
   679
  | skolem_attr (context, th) = (context, th)
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   680
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   681
val setup_attrs = Attrib.add_attributes
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   682
  [("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
   683
   ("clausify", clausify, "conversion of theorem to clauses")];
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   684
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   685
val setup_methods = Method.add_methods
0cf192e489e2 improvements to proof reconstruction. Some files loaded in a different order
paulson
parents: 21900
diff changeset
   686
  [("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
   687
    "conversion of goal to conjecture clauses")];
21102
7f2ebe5c5b72 Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents: 21096
diff changeset
   688
     
22516
c986140356b8 Clause cache is now in theory data.
paulson
parents: 22471
diff changeset
   689
val setup = clause_cache_setup #> ThmCache.init #> setup_attrs #> setup_methods;
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   690
20461
d689ad772b2c skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents: 20457
diff changeset
   691
end;