src/HOL/Tools/res_axioms.ML
author paulson
Mon, 28 Aug 2006 18:15:32 +0200
changeset 20421 d9606c64bc23
parent 20419 df257a9cf0e9
child 20445 b222d9939e00
permissions -rw-r--r--
tidied
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
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
     5
Transformation of axiom rules (elim/intro/etc) into CNF forms.    
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 =
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
     9
  sig
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    10
  val elimRule_tac : thm -> Tactical.tactic
16012
4ae42d8f2fea bug fixes for clause form transformation
paulson
parents: 16009
diff changeset
    11
  val elimR2Fol : thm -> term
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    12
  val transform_elim : thm -> thm
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    13
  val cnf_axiom : (string * thm) -> thm list
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    14
  val meta_cnf_axiom : thm -> thm list
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    15
  val claset_rules_of_thy : theory -> (string * thm) list
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    16
  val simpset_rules_of_thy : theory -> (string * thm) list
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
    17
  val claset_rules_of_ctxt: Proof.context -> (string * thm) list
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
    18
  val simpset_rules_of_ctxt : Proof.context -> (string * thm) list
17905
1574533861b1 Added files in order to use external ATPs as oracles and invoke these ATPs by calling Isabelle methods (currently "vampire" and "eprover").
mengj
parents: 17829
diff changeset
    19
  val pairname : thm -> (string * thm)
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
    20
  val skolem_thm : thm -> thm list
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    21
  val to_nnf : thm -> thm
19353
36b6b15ee670 added another function for CNF.
mengj
parents: 19232
diff changeset
    22
  val cnf_rules_pairs : (string * Thm.thm) list -> (Thm.thm * (string * int)) list list;
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18680
diff changeset
    23
  val meson_method_setup : theory -> theory
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18680
diff changeset
    24
  val setup : theory -> theory
19196
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
    25
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
    26
  val atpset_rules_of_thy : theory -> (string * thm) list
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
    27
  val atpset_rules_of_ctxt : Proof.context -> (string * thm) list
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    28
  end;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    29
 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    30
structure ResAxioms =
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    31
 
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    32
struct
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    33
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    34
(*FIXME DELETE: For running the comparison between combinators and abstractions.
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    35
  CANNOT be a ref, as the setting is used while Isabelle is built.*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    36
val abstract_lambdas = true;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    37
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    38
val trace_abs = ref false;
18000
ac059afd6b86 Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents: 17959
diff changeset
    39
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    40
(**** Transformation of Elimination Rules into First-Order Formulas****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    41
15390
87f78411f7c9 Comments and other tweaks by Jia
paulson
parents: 15371
diff changeset
    42
(* a tactic used to prove an elim-rule. *)
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
    43
fun elimRule_tac th =
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
    44
    (resolve_tac [impI,notI] 1) THEN (etac th 1) THEN REPEAT(fast_tac HOL_cs 1);
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    45
15956
0da64b5a9a00 theorem names for caching
paulson
parents: 15955
diff changeset
    46
fun add_EX tm [] = tm
0da64b5a9a00 theorem names for caching
paulson
parents: 15955
diff changeset
    47
  | add_EX tm ((x,xtp)::xs) = add_EX (HOLogic.exists_const xtp $ Abs(x,xtp,tm)) xs;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    48
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
    49
(*Checks for the premise ~P when the conclusion is P.*)
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
    50
fun is_neg (Const("Trueprop",_) $ (Const("Not",_) $ Free(p,_))) 
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
    51
           (Const("Trueprop",_) $ Free(q,_)) = (p = q)
15371
40f5045c5985 fixes to clause conversion
paulson
parents: 15370
diff changeset
    52
  | is_neg _ _ = false;
40f5045c5985 fixes to clause conversion
paulson
parents: 15370
diff changeset
    53
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    54
exception ELIMR2FOL;
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    55
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    56
(*Handles the case where the dummy "conclusion" variable appears negated in the
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    57
  premises, so the final consequent must be kept.*)
15371
40f5045c5985 fixes to clause conversion
paulson
parents: 15370
diff changeset
    58
fun strip_concl' prems bvs (Const ("==>",_) $ P $ Q) =
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
    59
      strip_concl' (HOLogic.dest_Trueprop P :: prems) bvs  Q
15371
40f5045c5985 fixes to clause conversion
paulson
parents: 15370
diff changeset
    60
  | strip_concl' prems bvs P = 
15956
0da64b5a9a00 theorem names for caching
paulson
parents: 15955
diff changeset
    61
      let val P' = HOLogic.Not $ (HOLogic.dest_Trueprop P)
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
    62
      in add_EX (foldr1 HOLogic.mk_conj (P'::prems)) bvs end;
15371
40f5045c5985 fixes to clause conversion
paulson
parents: 15370
diff changeset
    63
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    64
(*Recurrsion over the minor premise of an elimination rule. Final consequent
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    65
  is ignored, as it is the dummy "conclusion" variable.*)
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
    66
fun strip_concl prems bvs concl (Const ("all", _) $ Abs (x,xtp,body)) = 
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
    67
      strip_concl prems ((x,xtp)::bvs) concl body
15371
40f5045c5985 fixes to clause conversion
paulson
parents: 15370
diff changeset
    68
  | strip_concl prems bvs concl (Const ("==>",_) $ P $ Q) =
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
    69
      if (is_neg P concl) then (strip_concl' prems bvs Q)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
    70
      else strip_concl (HOLogic.dest_Trueprop P::prems) bvs  concl Q
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    71
  | strip_concl prems bvs concl Q = 
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    72
      if concl aconv Q then add_EX (foldr1 HOLogic.mk_conj prems) bvs
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    73
      else raise ELIMR2FOL (*expected conclusion not found!*)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    74
 
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    75
fun trans_elim (major,[],_) = HOLogic.Not $ major
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    76
  | trans_elim (major,minors,concl) =
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    77
      let val disjs = foldr1 HOLogic.mk_disj (map (strip_concl [] [] concl) minors)
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    78
      in  HOLogic.mk_imp (major, disjs)  end;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    79
16012
4ae42d8f2fea bug fixes for clause form transformation
paulson
parents: 16009
diff changeset
    80
(* convert an elim rule into an equivalent formula, of type term. *)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    81
fun elimR2Fol elimR = 
20292
6f2b8ed987ec removed obsolete Drule.freeze_all -- now uses legacy Drule.freeze_thaw;
wenzelm
parents: 20071
diff changeset
    82
  let val elimR' = #1 (Drule.freeze_thaw elimR)
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
    83
      val (prems,concl) = (prems_of elimR', concl_of elimR')
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    84
      val cv = case concl of    (*conclusion variable*)
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    85
		  Const("Trueprop",_) $ (v as Free(_,Type("bool",[]))) => v
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    86
		| v as Free(_, Type("prop",[])) => v
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    87
		| _ => raise ELIMR2FOL
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    88
  in case prems of
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    89
      [] => raise ELIMR2FOL
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    90
    | (Const("Trueprop",_) $ major) :: minors => 
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    91
        if member (op aconv) (term_frees major) cv then raise ELIMR2FOL
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    92
        else (trans_elim (major, minors, concl) handle TERM _ => raise ELIMR2FOL)
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    93
    | _ => raise ELIMR2FOL
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    94
  end;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
    95
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    96
(* convert an elim-rule into an equivalent theorem that does not have the 
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
    97
   predicate variable.  Leave other theorems unchanged.*) 
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
    98
fun transform_elim th =
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
    99
    let val ctm = cterm_of (sign_of_thm th) (HOLogic.mk_Trueprop (elimR2Fol th))
18009
df077e122064 got rid of obsolete prove_goalw_cterm
paulson
parents: 18000
diff changeset
   100
    in Goal.prove_raw [] ctm (fn _ => elimRule_tac th) end
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
   101
    handle ELIMR2FOL => th (*not an elimination rule*)
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
   102
         | exn => (warning ("transform_elim failed: " ^ Toplevel.exn_message exn ^ 
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
   103
                            " for theorem " ^ string_of_thm th); th) 
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
   104
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
   105
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
   106
(**** Transformation of Clasets and Simpsets into First-Order Axioms ****)
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
   107
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   108
(*Transfer a theorem into theory Reconstruction.thy if it is not already
15359
8bad1f42fec0 new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents: 15347
diff changeset
   109
  inside that theory -- because it's needed for Skolemization *)
8bad1f42fec0 new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents: 15347
diff changeset
   110
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   111
(*This will refer to the final version of theory Reconstruction.*)
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   112
val recon_thy_ref = Theory.self_ref (the_context ());  
15359
8bad1f42fec0 new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents: 15347
diff changeset
   113
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   114
(*If called while Reconstruction is being created, it will transfer to the
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   115
  current version. If called afterward, it will transfer to the final version.*)
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   116
fun transfer_to_Reconstruction th =
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   117
    transfer (Theory.deref recon_thy_ref) th handle THM _ => th;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   118
15955
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   119
fun is_taut th =
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   120
      case (prop_of th) of
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   121
           (Const ("Trueprop", _) $ Const ("True", _)) => true
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   122
         | _ => false;
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   123
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   124
(* remove tautologous clauses *)
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   125
val rm_redundant_cls = List.filter (not o is_taut);
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   126
     
15997
c71031d7988c consolidation and simplification
paulson
parents: 15956
diff changeset
   127
       
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   128
(**** SKOLEMIZATION BY INFERENCE (lcp) ****)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   129
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   130
(*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
   131
  prefix for the Skolem constant. Result is a new theory*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   132
fun declare_skofuns s th thy =
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   133
  let fun dec_sko (Const ("Ex",_) $ (xtp as Abs(_,T,p))) (thy, axs) =
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   134
	    (*Existential: declare a Skolem function, then insert into body and continue*)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   135
	    let val cname = gensym ("sko_" ^ s ^ "_")
16012
4ae42d8f2fea bug fixes for clause form transformation
paulson
parents: 16009
diff changeset
   136
		val args = term_frees xtp  (*get the formal parameter list*)
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   137
		val Ts = map type_of args
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   138
		val cT = Ts ---> T
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   139
		val c = Const (Sign.full_name thy cname, cT)
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   140
		val rhs = list_abs_free (map dest_Free args, HOLogic.choice_const T $ xtp)
16012
4ae42d8f2fea bug fixes for clause form transformation
paulson
parents: 16009
diff changeset
   141
		        (*Forms a lambda-abstraction over the formal parameters*)
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   142
		val thy' = Theory.add_consts_i [(cname, cT, NoSyn)] thy
16012
4ae42d8f2fea bug fixes for clause form transformation
paulson
parents: 16009
diff changeset
   143
		           (*Theory is augmented with the constant, then its def*)
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   144
		val cdef = cname ^ "_def"
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   145
		val thy'' = Theory.add_defs_i false false [(cdef, equals cT $ c $ rhs)] thy'
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   146
	    in dec_sko (subst_bound (list_comb(c,args), p)) 
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   147
	               (thy'', get_axiom thy'' cdef :: axs)
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   148
	    end
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   149
	| dec_sko (Const ("All",_) $ (xtp as Abs(a,T,p))) thx =
16012
4ae42d8f2fea bug fixes for clause form transformation
paulson
parents: 16009
diff changeset
   150
	    (*Universal quant: insert a free variable into body and continue*)
20071
8f3e1ddb50e6 replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents: 20017
diff changeset
   151
	    let val fname = Name.variant (add_term_names (p,[])) a
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   152
	    in dec_sko (subst_bound (Free(fname,T), p)) thx end
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   153
	| dec_sko (Const ("op &", _) $ p $ q) thx = dec_sko q (dec_sko p thx)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   154
	| dec_sko (Const ("op |", _) $ p $ q) thx = dec_sko q (dec_sko p thx)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   155
	| dec_sko (Const ("Trueprop", _) $ p) thx = dec_sko p thx
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   156
	| dec_sko t thx = thx (*Do nothing otherwise*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   157
  in  dec_sko (prop_of th) (thy,[])  end;
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   158
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   159
(*Traverse a theorem, accumulating Skolem function definitions.*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   160
fun assume_skofuns th =
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   161
  let fun dec_sko (Const ("Ex",_) $ (xtp as Abs(_,T,p))) defs =
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   162
	    (*Existential: declare a Skolem function, then insert into body and continue*)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   163
	    let val skos = map (#1 o Logic.dest_equals) defs  (*existing sko fns*)
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   164
		val args = term_frees xtp \\ skos  (*the formal parameters*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   165
		val Ts = map type_of args
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   166
		val cT = Ts ---> T
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   167
		val c = Free (gensym "sko_", cT)
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   168
		val rhs = list_abs_free (map dest_Free args,        
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   169
		                         HOLogic.choice_const T $ xtp)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   170
		      (*Forms a lambda-abstraction over the formal parameters*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   171
		val def = equals cT $ c $ rhs
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   172
	    in dec_sko (subst_bound (list_comb(c,args), p)) 
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   173
	               (def :: defs)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   174
	    end
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   175
	| dec_sko (Const ("All",_) $ (xtp as Abs(a,T,p))) defs =
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   176
	    (*Universal quant: insert a free variable into body and continue*)
20071
8f3e1ddb50e6 replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents: 20017
diff changeset
   177
	    let val fname = Name.variant (add_term_names (p,[])) a
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   178
	    in dec_sko (subst_bound (Free(fname,T), p)) defs end
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   179
	| dec_sko (Const ("op &", _) $ p $ q) defs = dec_sko q (dec_sko p defs)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   180
	| dec_sko (Const ("op |", _) $ p $ q) defs = dec_sko q (dec_sko p defs)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   181
	| dec_sko (Const ("Trueprop", _) $ p) defs = dec_sko p defs
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   182
	| dec_sko t defs = defs (*Do nothing otherwise*)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   183
  in  dec_sko (prop_of th) []  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   184
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   185
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   186
(**** REPLACING ABSTRACTIONS BY FUNCTION DEFINITIONS ****)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   187
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   188
(*Returns the vars of a theorem*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   189
fun vars_of_thm th =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   190
  map (Thm.cterm_of (Thm.theory_of_thm th) o Var) (Drule.fold_terms Term.add_vars th []);
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   191
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   192
(*Make a version of fun_cong with a given variable name*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   193
local
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   194
    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
   195
    val cx = hd (vars_of_thm fun_cong');
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   196
    val ty = typ_of (ctyp_of_term cx);
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   197
    val thy = Thm.theory_of_thm fun_cong;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   198
    fun mkvar a = cterm_of thy (Var((a,0),ty));
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   199
in
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   200
fun xfun_cong x = Thm.instantiate ([], [(cx, mkvar x)]) fun_cong'
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   201
end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   202
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   203
(*Removes the lambdas from an equation of the form t = (%x. u)*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   204
fun strip_lambdas th = 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   205
  case prop_of th of
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   206
      _ $ (Const ("op =", _) $ _ $ Abs (x,_,_)) => 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   207
          strip_lambdas (#1 (Drule.freeze_thaw (th RS xfun_cong x)))
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   208
    | _ => th;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   209
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   210
(*Convert meta- to object-equality. Fails for theorems like split_comp_eq, 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   211
  where some types have the empty sort.*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   212
fun object_eq th = th RS def_imp_eq 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   213
    handle THM _ => error ("Theorem contains empty sort: " ^ string_of_thm th);
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   214
  
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   215
fun valid_name vs (Free(x,T)) = x mem_string vs
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   216
  | valid_name vs _ = false;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   217
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   218
(*Contract all eta-redexes in the theorem, lest they give rise to needless abstractions*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   219
fun eta_conversion_rule th =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   220
  equal_elim (eta_conversion (cprop_of th)) th;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   221
  
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   222
fun crhs th =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   223
  case Drule.strip_comb (cprop_of th) of
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   224
      (f, [_, rhs]) => 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   225
          (case term_of f of
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   226
               Const ("==", _) => rhs
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   227
             | _ => raise THM ("crhs", 0, [th]))
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   228
    | _ => raise THM ("crhs", 1, [th]);
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   229
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   230
(*Apply a function definition to an argument, beta-reducing the result.*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   231
fun beta_comb cf x =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   232
  let val th1 = combination cf (reflexive x)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   233
      val th2 = beta_conversion false (crhs th1)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   234
  in  transitive th1 th2  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   235
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   236
(*Apply a function definition to arguments, beta-reducing along the way.*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   237
fun list_combination cf [] = cf
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   238
  | list_combination cf (x::xs) = list_combination (beta_comb cf x) xs;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   239
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   240
fun list_cabs ([] ,     t) = t
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   241
  | list_cabs (v::vars, t) = Thm.cabs v (list_cabs(vars,t));
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   242
20421
paulson
parents: 20419
diff changeset
   243
fun assert_eta_free ct = 
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   244
  let val t = term_of ct 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   245
  in if (t aconv Envir.eta_contract t) then ()  
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   246
     else error ("Eta redex in term: " ^ string_of_cterm ct)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   247
  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   248
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   249
(*Traverse a theorem, declaring abstraction function definitions. String s is the suggested
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   250
  prefix for the constants. Resulting theory is returned in the first theorem. *)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   251
fun declare_absfuns th =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   252
  let fun abstract thy ct = case term_of ct of
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   253
          Abs (_,T,u) =>
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   254
	    let val cname = gensym "abs_"
20421
paulson
parents: 20419
diff changeset
   255
	        val _ = assert_eta_free ct;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   256
		val (cv,cta) = Thm.dest_abs NONE ct
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   257
		val v = (#1 o dest_Free o term_of) cv
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   258
		val (u'_th,defs) = abstract thy cta
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   259
                val cu' = crhs u'_th
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   260
		val abs_v_u = lambda (term_of cv) (term_of cu')
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   261
		(*get the formal parameters: ALL variables free in the term*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   262
		val args = term_frees abs_v_u
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   263
		val Ts = map type_of args
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   264
		val cT = Ts ---> (T --> typ_of (ctyp_of_term cu'))
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   265
		val thy = theory_of_thm u'_th
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   266
		val c = Const (Sign.full_name thy cname, cT)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   267
		val thy = Theory.add_consts_i [(cname, cT, NoSyn)] thy
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   268
		           (*Theory is augmented with the constant, then its def*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   269
		val rhs = list_abs_free (map dest_Free args, abs_v_u)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   270
		      (*Forms a lambda-abstraction over the formal parameters*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   271
		val cdef = cname ^ "_def"
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   272
		val thy = Theory.add_defs_i false false [(cdef, equals cT $ c $ rhs)] thy		      
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   273
		val def = #1 (Drule.freeze_thaw (get_axiom thy cdef))
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   274
		val def_args = list_combination def (map (cterm_of thy) args)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   275
	    in (transitive (abstract_rule v cv u'_th) (symmetric def_args), 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   276
	        def :: defs) end
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   277
	| (t1$t2) =>
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   278
	    let val (ct1,ct2) = Thm.dest_comb ct
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   279
	        val (th1,defs1) = abstract thy ct1
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   280
		val (th2,defs2) = abstract (theory_of_thm th1) ct2
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   281
	    in  (combination th1 th2, defs1@defs2)  end
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   282
	| _ => (transfer thy (reflexive ct), [])
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   283
      val _ = if !trace_abs then warning (string_of_thm th) else ();
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   284
      val (eqth,defs) = abstract (theory_of_thm th) (cprop_of th)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   285
      val ths = equal_elim eqth th ::
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   286
                map (forall_intr_vars o strip_lambdas o object_eq) defs
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   287
  in  (theory_of_thm eqth, ths)  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   288
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   289
fun assume_absfuns th =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   290
  let val cterm = cterm_of (Thm.theory_of_thm th)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   291
      fun abstract vs ct = case term_of ct of
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   292
          Abs (_,T,u) =>
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   293
	    let val (cv,cta) = Thm.dest_abs NONE ct
20421
paulson
parents: 20419
diff changeset
   294
	        val _ = assert_eta_free ct;
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   295
		val v = (#1 o dest_Free o term_of) cv
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   296
		val (u'_th,defs) = abstract (v::vs) cta
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   297
                val cu' = crhs u'_th
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   298
		val abs_v_u = Thm.cabs cv cu'
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   299
		(*get the formal parameters: bound variables also present in the term*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   300
		val args = filter (valid_name vs) (term_frees (term_of abs_v_u))
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   301
		val Ts = map type_of args
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   302
		val const_ty = Ts ---> (T --> typ_of (ctyp_of_term cu'))
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   303
		val c = Free (gensym "abs_", const_ty)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   304
		val rhs = list_cabs (map cterm args, abs_v_u)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   305
		      (*Forms a lambda-abstraction over the formal parameters*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   306
		val def = assume (Thm.capply (cterm (equals const_ty $ c)) rhs)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   307
		val def_args = list_combination def (map cterm args)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   308
	    in (transitive (abstract_rule v cv u'_th) (symmetric def_args), 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   309
	        def :: defs) end
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   310
	| (t1$t2) =>
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   311
	    let val (ct1,ct2) = Thm.dest_comb ct
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   312
	        val (t1',defs1) = abstract vs ct1
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   313
		val (t2',defs2) = abstract vs ct2
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   314
	    in  (combination t1' t2', defs1@defs2)  end
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   315
	| _ => (reflexive ct, [])
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   316
      val (eqth,defs) = abstract [] (cprop_of th)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   317
  in  equal_elim eqth th ::
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   318
      map (forall_intr_vars o strip_lambdas o object_eq) defs
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   319
  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   320
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   321
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   322
(*cterms are used throughout for efficiency*)
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   323
val cTrueprop = Thm.cterm_of HOL.thy HOLogic.Trueprop;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   324
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   325
(*cterm version of mk_cTrueprop*)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   326
fun c_mkTrueprop A = Thm.capply cTrueprop A;
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   327
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   328
(*Given an abstraction over n variables, replace the bound variables by free
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   329
  ones. Return the body, along with the list of free variables.*)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   330
fun c_variant_abs_multi (ct0, vars) = 
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   331
      let val (cv,ct) = Thm.dest_abs NONE ct0
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   332
      in  c_variant_abs_multi (ct, cv::vars)  end
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   333
      handle CTERM _ => (ct0, rev vars);
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   334
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   335
(*Given the definition of a Skolem function, return a theorem to replace 
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   336
  an existential formula by a use of that function. 
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   337
   Example: "EX x. x : A & x ~: B ==> sko A B : A & sko A B ~: B"  [.] *)
16588
8de758143786 stricter first-order check for meson
paulson
parents: 16563
diff changeset
   338
fun skolem_of_def def =  
20292
6f2b8ed987ec removed obsolete Drule.freeze_all -- now uses legacy Drule.freeze_thaw;
wenzelm
parents: 20071
diff changeset
   339
  let val (c,rhs) = Drule.dest_equals (cprop_of (#1 (Drule.freeze_thaw def)))
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   340
      val (ch, frees) = c_variant_abs_multi (rhs, [])
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   341
      val (chilbert,cabs) = Thm.dest_comb ch
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   342
      val {sign,t, ...} = rep_cterm chilbert
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   343
      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
   344
                      | _ => raise THM ("skolem_of_def: expected Eps", 0, [def])
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   345
      val cex = Thm.cterm_of sign (HOLogic.exists_const T)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   346
      val ex_tm = c_mkTrueprop (Thm.capply cex cabs)
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   347
      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
   348
      fun tacf [prem] = rewrite_goals_tac [def] THEN rtac (prem RS someI_ex) 1
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   349
  in  Goal.prove_raw [ex_tm] conc tacf 
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   350
       |> forall_intr_list frees
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   351
       |> forall_elim_vars 0  (*Introduce Vars, but don't discharge defs.*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   352
       |> Thm.varifyT
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   353
  end;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   354
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
   355
(*Converts an Isabelle theorem (intro, elim or simp format) into nnf.*)
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
   356
(*It now works for HOL too. *)
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   357
fun to_nnf th = 
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   358
    th |> transfer_to_Reconstruction
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   359
       |> transform_elim |> zero_var_indexes |> Drule.freeze_thaw |> #1
16588
8de758143786 stricter first-order check for meson
paulson
parents: 16563
diff changeset
   360
       |> ObjectLogic.atomize_thm |> make_nnf;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   361
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   362
(*The cache prevents repeated clausification of a theorem, 
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   363
  and also repeated declaration of Skolem functions*)  
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   364
  (* FIXME better use Termtab!? No, we MUST use theory data!!*)
15955
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   365
val clause_cache = ref (Symtab.empty : (thm * thm list) Symtab.table)
87cf2ce8ede8 memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents: 15872
diff changeset
   366
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   367
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   368
(*Generate Skolem functions for a theorem supplied in nnf*)
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   369
fun skolem_of_nnf th =
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   370
  map (skolem_of_def o assume o (cterm_of (theory_of_thm th))) (assume_skofuns th);
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   371
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   372
(*Replace lambdas by assumed function definitions in the theorems*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   373
fun assume_abstract ths =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   374
  if abstract_lambdas then List.concat (map (assume_absfuns o eta_conversion_rule) ths)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   375
  else map eta_conversion_rule ths;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   376
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   377
(*Replace lambdas by declared function definitions in the theorems*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   378
fun declare_abstract' (thy, []) = (thy, [])
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   379
  | declare_abstract' (thy, th::ths) =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   380
      let val (thy', th_defs) = 
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   381
            th |> zero_var_indexes |> Drule.freeze_thaw |> #1
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   382
               |> eta_conversion_rule |> transfer thy |> declare_absfuns
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   383
	  val (thy'', ths') = declare_abstract' (thy', ths)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   384
      in  (thy'', th_defs @ ths')  end;
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   385
20421
paulson
parents: 20419
diff changeset
   386
(*FIXME DELETE if we decide to switch to abstractions*)
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   387
fun declare_abstract (thy, ths) =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   388
  if abstract_lambdas then declare_abstract' (thy, ths)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   389
  else (thy, map eta_conversion_rule ths);
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   390
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   391
(*Skolemize a named theorem, with Skolem functions as additional premises.*)
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
   392
(*also works for HOL*) 
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   393
fun skolem_thm th = 
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   394
  let val nnfth = to_nnf th
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   395
  in  Meson.make_cnf (skolem_of_nnf nnfth) nnfth
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   396
      |> assume_abstract |> Meson.finish_cnf |> rm_redundant_cls
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   397
  end
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   398
  handle THM _ => [];
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   399
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   400
(*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
   401
  It returns a modified theory, unless skolemization fails.*)
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   402
fun skolem thy (name,th) =
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   403
  let val cname = (case name of "" => gensym "" | s => Sign.base_name s)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   404
      val _ = Output.debug ("skolemizing " ^ name ^ ": ")
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   405
  in Option.map 
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   406
        (fn nnfth => 
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   407
          let val (thy',defs) = declare_skofuns cname nnfth thy
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   408
              val cnfs = Meson.make_cnf (map skolem_of_def defs) nnfth
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   409
              val (thy'',cnfs') = declare_abstract (thy',cnfs)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   410
          in (thy'', rm_redundant_cls (Meson.finish_cnf cnfs'))
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   411
          end)
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
   412
      (SOME (to_nnf th)  handle THM _ => NONE) 
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   413
  end;
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   414
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   415
(*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
   416
  and modified theory.*)
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   417
fun skolem_cache_thm ((name,th), thy) = 
18144
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   418
  case Symtab.lookup (!clause_cache) name of
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   419
      NONE => 
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   420
	(case skolem thy (name, Thm.transfer thy th) of
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   421
	     NONE => ([th],thy)
18144
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   422
	   | SOME (thy',cls) => 
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   423
	       (change clause_cache (Symtab.update (name, (th, cls))); (cls,thy')))
18144
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   424
    | SOME (th',cls) =>
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   425
        if eq_thm(th,th') then (cls,thy)
19232
1f5b5dc3f48a Changed some warnings to debug messages
paulson
parents: 19206
diff changeset
   426
	else (Output.debug ("skolem_cache: Ignoring variant of theorem " ^ name); 
1f5b5dc3f48a Changed some warnings to debug messages
paulson
parents: 19206
diff changeset
   427
	      Output.debug (string_of_thm th);
1f5b5dc3f48a Changed some warnings to debug messages
paulson
parents: 19206
diff changeset
   428
	      Output.debug (string_of_thm th');
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   429
	      ([th],thy));
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   430
	      
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   431
fun skolem_cache ((name,th), thy) = #2 (skolem_cache_thm ((name,th), thy));
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   432
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   433
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   434
(*Exported function to convert Isabelle theorems into axiom clauses*) 
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   435
fun cnf_axiom (name,th) =
18144
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   436
  case name of
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   437
	"" => skolem_thm th (*no name, so can't cache*)
18144
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   438
      | s  => case Symtab.lookup (!clause_cache) s of
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   439
		NONE => 
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   440
		  let val cls = skolem_thm th
18144
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   441
		  in change clause_cache (Symtab.update (s, (th, cls))); cls end
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   442
	      | SOME(th',cls) =>
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   443
		  if eq_thm(th,th') then cls
19232
1f5b5dc3f48a Changed some warnings to debug messages
paulson
parents: 19206
diff changeset
   444
		  else (Output.debug ("cnf_axiom: duplicate or variant of theorem " ^ name); 
1f5b5dc3f48a Changed some warnings to debug messages
paulson
parents: 19206
diff changeset
   445
		        Output.debug (string_of_thm th);
1f5b5dc3f48a Changed some warnings to debug messages
paulson
parents: 19206
diff changeset
   446
		        Output.debug (string_of_thm th');
18144
4edcb5fdc3b0 duplicate axioms in ATP linkup, and general fixes
paulson
parents: 18141
diff changeset
   447
		        cls);
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   448
18141
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   449
fun pairname th = (Thm.name_of_thm th, th);
89e2e8bed08f Skolemization by inference, but not quite finished
paulson
parents: 18009
diff changeset
   450
15956
0da64b5a9a00 theorem names for caching
paulson
parents: 15955
diff changeset
   451
fun meta_cnf_axiom th = 
0da64b5a9a00 theorem names for caching
paulson
parents: 15955
diff changeset
   452
    map Meson.make_meta_clause (cnf_axiom (pairname th));
15499
419dc5ffe8bc clausification and proof reconstruction
paulson
parents: 15495
diff changeset
   453
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   454
15872
8336ff711d80 fixed treatment of higher-order simprules
paulson
parents: 15736
diff changeset
   455
(**** Extract and Clausify theorems from a theory's claset and simpset ****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   456
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   457
(*Preserve the name of "th" after the transformation "f"*)
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   458
fun preserve_name f th = Thm.name_thm (Thm.name_of_thm th, f th);
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   459
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   460
fun rules_of_claset cs =
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   461
  let val {safeIs,safeEs,hazIs,hazEs,...} = rep_cs cs
19175
c6e4b073f6a5 subset_refl now included using the atp attribute
paulson
parents: 19113
diff changeset
   462
      val intros = safeIs @ hazIs
18532
0347c1bba406 elim rules: Classical.classical_rule;
wenzelm
parents: 18510
diff changeset
   463
      val elims  = map Classical.classical_rule (safeEs @ hazEs)
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   464
  in
18680
677e2bdd75f0 Output.debug;
wenzelm
parents: 18629
diff changeset
   465
     Output.debug ("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
   466
            " elims: " ^ Int.toString(length elims));
20017
a2070352371c made the conversion of elimination rules more robust
paulson
parents: 19894
diff changeset
   467
     map pairname (intros @ elims)
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   468
  end;
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   469
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   470
fun rules_of_simpset ss =
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   471
  let val ({rules,...}, _) = rep_ss ss
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   472
      val simps = Net.entries rules
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   473
  in 
18680
677e2bdd75f0 Output.debug;
wenzelm
parents: 18629
diff changeset
   474
      Output.debug ("rules_of_simpset: " ^ Int.toString(length simps));
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   475
      map (fn r => (#name r, #thm r)) simps
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   476
  end;
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   477
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   478
fun claset_rules_of_thy thy = rules_of_claset (claset_of thy);
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   479
fun simpset_rules_of_thy thy = rules_of_simpset (simpset_of thy);
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   480
19196
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
   481
fun atpset_rules_of_thy thy = map pairname (ResAtpSet.atp_rules_of_thy thy);
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
   482
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
   483
17484
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   484
fun claset_rules_of_ctxt ctxt = rules_of_claset (local_claset_of ctxt);
f6a225f97f0a simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents: 17412
diff changeset
   485
fun simpset_rules_of_ctxt ctxt = rules_of_simpset (local_simpset_of ctxt);
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   486
19196
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
   487
fun atpset_rules_of_ctxt ctxt = map pairname (ResAtpSet.atp_rules_of_ctxt ctxt);
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   488
15872
8336ff711d80 fixed treatment of higher-order simprules
paulson
parents: 15736
diff changeset
   489
(**** Translate a set of classical/simplifier rules into CNF (still as type "thm")  ****)
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   490
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   491
(* classical rules: works for both FOL and HOL *)
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   492
fun cnf_rules [] err_list = ([],err_list)
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   493
  | cnf_rules ((name,th) :: ths) err_list = 
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   494
      let val (ts,es) = cnf_rules ths err_list
17404
d16c3a62c396 the experimental tagging system, and the usual tidying
paulson
parents: 17279
diff changeset
   495
      in  (cnf_axiom (name,th) :: ts,es) handle  _ => (ts, (th::es))  end;  
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   496
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   497
fun pair_name_cls k (n, []) = []
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   498
  | pair_name_cls k (n, cls::clss) = (cls, (n,k)) :: pair_name_cls (k+1) (n, clss)
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   499
 	    
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   500
fun cnf_rules_pairs_aux pairs [] = pairs
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   501
  | cnf_rules_pairs_aux pairs ((name,th)::ths) =
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   502
      let val pairs' = (pair_name_cls 0 (name, cnf_axiom(name,th))) :: pairs
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   503
		       handle THM _ => pairs | ResClause.CLAUSE _ => pairs
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   504
			    | ResHolClause.LAM2COMB _ => pairs
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   505
      in  cnf_rules_pairs_aux pairs' ths  end;
19353
36b6b15ee670 added another function for CNF.
mengj
parents: 19232
diff changeset
   506
    
19894
7c7e15b27145 the "all_theorems" option and some fixes
paulson
parents: 19630
diff changeset
   507
val cnf_rules_pairs = cnf_rules_pairs_aux [];
19353
36b6b15ee670 added another function for CNF.
mengj
parents: 19232
diff changeset
   508
19196
62ee8c10d796 Added functions to retrieve local and global atpset rules.
mengj
parents: 19175
diff changeset
   509
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
   510
(**** 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
   511
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   512
(*Setup function: takes a theory and installs ALL known theorems into the clause cache*)
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   513
fun clause_cache_setup thy = List.foldl skolem_cache thy (PureThy.all_thms_of thy);
16009
a6d480e6c5f0 Skolemization of simprules and classical rules
paulson
parents: 15997
diff changeset
   514
  
16563
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   515
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   516
(*** meson proof methods ***)
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   517
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   518
fun cnf_rules_of_ths ths = List.concat (#1 (cnf_rules (map pairname ths) []));
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   519
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   520
fun meson_meth ths ctxt =
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   521
  Method.SIMPLE_METHOD' HEADGOAL
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   522
    (CHANGED_PROP o Meson.meson_claset_tac (cnf_rules_of_ths ths) (local_claset_of ctxt));
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   523
a92f96951355 meson method taking an argument list
paulson
parents: 16173
diff changeset
   524
val meson_method_setup =
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18680
diff changeset
   525
  Method.add_methods
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18680
diff changeset
   526
    [("meson", Method.thms_ctxt_args meson_meth, 
18833
bead1a4e966b tuned comment;
wenzelm
parents: 18728
diff changeset
   527
      "MESON resolution proof procedure")];
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   528
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   529
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   530
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   531
(*** The Skolemization attribute ***)
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   532
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   533
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
   534
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   535
(*Conjoin a list of clauses to recreate a single theorem*)
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   536
val conj_rule = foldr1 conj2_rule;
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   537
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   538
fun skolem_attr (Context.Theory thy, th) =
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   539
      let val name = Thm.name_of_thm th
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   540
          val (cls, thy') = skolem_cache_thm ((name, th), thy)
18728
6790126ab5f6 simplified type attribute;
wenzelm
parents: 18708
diff changeset
   541
      in (Context.Theory thy', conj_rule cls) end
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   542
  | skolem_attr (context, th) = (context, conj_rule (skolem_thm th));
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   543
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   544
val setup_attrs = Attrib.add_attributes
20419
df257a9cf0e9 abstraction of lambda-expressions
paulson
parents: 20373
diff changeset
   545
  [("skolem", Attrib.no_args skolem_attr, "skolemization of a theorem")];
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   546
18708
4b3dadb4fe33 setup: theory -> theory;
wenzelm
parents: 18680
diff changeset
   547
val setup = clause_cache_setup #> setup_attrs;
18510
0a6c24f549c3 the "skolem" attribute and better initialization of the clause database
paulson
parents: 18404
diff changeset
   548
15347
14585bc8fa09 resolution package tools by Jia Meng
paulson
parents:
diff changeset
   549
end;