src/HOL/Tools/ATP/res_clasimpset.ML
author paulson
Wed Oct 05 11:18:06 2005 +0200 (2005-10-05)
changeset 17764 fde495b9e24b
parent 17596 cd555d5a3254
child 17828 c82fb51ee18d
permissions -rw-r--r--
improved process handling. tidied
paulson@16795
     1
(*  ID:      $Id$
paulson@15789
     2
    Author:     Claire Quigley
paulson@15789
     3
    Copyright   2004  University of Cambridge
paulson@15789
     4
*)
paulson@15789
     5
paulson@16741
     6
paulson@16741
     7
structure ReduceAxiomsN =
paulson@16741
     8
(* Author: Jia Meng, Cambridge University Computer Laboratory
paulson@17234
     9
   Remove irrelevant axioms used for a proof of a goal, with with iteration control
paulson@17234
    10
   
paulson@17234
    11
   Initial version. Needs elaboration. *)
paulson@16741
    12
paulson@16741
    13
struct
paulson@16741
    14
paulson@16741
    15
fun add_term_consts_rm ncs (Const(c, _)) cs = 
paulson@16741
    16
    if (c mem ncs) then cs else (c ins_string cs)
paulson@16795
    17
  | add_term_consts_rm ncs (t $ u) cs =
paulson@16795
    18
      add_term_consts_rm ncs t (add_term_consts_rm ncs u cs)
paulson@16741
    19
  | add_term_consts_rm ncs (Abs(_,_,t)) cs = add_term_consts_rm ncs t cs
paulson@16741
    20
  | add_term_consts_rm ncs _ cs = cs;
paulson@16741
    21
paulson@16741
    22
paulson@16741
    23
fun term_consts_rm ncs t = add_term_consts_rm ncs t [];
paulson@16741
    24
paulson@16741
    25
fun thm_consts_rm ncs thm = term_consts_rm ncs (prop_of thm);
paulson@16741
    26
paulson@16741
    27
fun consts_of_thm (n,thm) = thm_consts_rm ["Trueprop","==>","all","Ex","op &", "op |", "Not", "All", "op -->", "op =", "==", "True", "False"] thm;
paulson@16741
    28
paulson@16741
    29
fun consts_of_term term = term_consts_rm ["Trueprop","==>","all","Ex","op &", "op |", "Not", "All", "op -->", "op =", "==", "True", "False"] term;
paulson@16741
    30
paulson@16741
    31
fun make_pairs [] _ = []
paulson@16741
    32
  | make_pairs (x::xs) y = (x,y)::(make_pairs xs y);
paulson@16741
    33
paulson@16741
    34
fun const_thm_list_aux [] cthms = cthms
paulson@16741
    35
  | const_thm_list_aux (thm::thms) cthms =
paulson@16741
    36
    let val consts = consts_of_thm thm
paulson@16741
    37
	val cthms' = make_pairs consts thm 
paulson@16741
    38
    in
paulson@16741
    39
	const_thm_list_aux thms (cthms' @ cthms)
paulson@16741
    40
    end;
paulson@16741
    41
paulson@16741
    42
paulson@16741
    43
fun const_thm_list thms = const_thm_list_aux thms [];
paulson@16741
    44
paulson@16741
    45
fun make_thm_table thms  = 
paulson@16741
    46
    let val consts_thms = const_thm_list thms
paulson@16741
    47
    in
paulson@16741
    48
	Symtab.make_multi consts_thms
paulson@16741
    49
    end;
paulson@16741
    50
paulson@16741
    51
paulson@16741
    52
fun consts_in_goal goal = consts_of_term goal;
paulson@16741
    53
paulson@16741
    54
fun axioms_having_consts_aux [] tab thms = thms
paulson@16741
    55
  | axioms_having_consts_aux (c::cs) tab thms =
wenzelm@17412
    56
    let val thms1 = Symtab.lookup tab c
wenzelm@17261
    57
      val thms2 = 
wenzelm@17261
    58
          case thms1 of (SOME x) => x
wenzelm@17261
    59
                      | NONE => []
paulson@16741
    60
    in
wenzelm@17261
    61
      axioms_having_consts_aux cs tab (thms2 union thms)
paulson@16741
    62
    end;
paulson@16741
    63
paulson@16741
    64
fun axioms_having_consts cs tab = axioms_having_consts_aux cs tab [];
paulson@16741
    65
paulson@16741
    66
paulson@16741
    67
fun relevant_axioms goal thmTab n =  
paulson@16741
    68
    let val consts = consts_in_goal goal
paulson@16741
    69
	fun relevant_axioms_aux1 cs k =
paulson@16741
    70
	    let val thms1 = axioms_having_consts cs thmTab
paulson@17764
    71
		val cs1 = foldl (op union_string) [] (map consts_of_thm thms1)
paulson@16741
    72
	    in
paulson@16795
    73
		if ((cs1 subset cs) orelse n <= k) then (k,thms1) 
paulson@16741
    74
		else (relevant_axioms_aux1 (cs1 union cs) (k+1))
paulson@16741
    75
	    end
paulson@16741
    76
paulson@16795
    77
    in  relevant_axioms_aux1 consts 1  end;
paulson@16741
    78
paulson@16795
    79
fun relevant_filter n goal thms = 
paulson@16795
    80
    if n<=0 then thms 
paulson@16795
    81
    else #2 (relevant_axioms goal (make_thm_table thms) n);
paulson@16741
    82
paulson@16741
    83
(* find the thms from thy that contain relevant constants, n is the iteration number *)
paulson@16741
    84
fun find_axioms_n thy goal n =
paulson@16741
    85
    let val clasetR = ResAxioms.claset_rules_of_thy thy
paulson@16741
    86
	val simpsetR = ResAxioms.simpset_rules_of_thy thy	  
paulson@16741
    87
	val table = make_thm_table (clasetR @ simpsetR)	
paulson@16741
    88
    in
paulson@16741
    89
	relevant_axioms goal table n
paulson@16741
    90
    end;
paulson@16741
    91
paulson@16741
    92
fun find_axioms_n_c thy goal n =
paulson@16741
    93
    let val current_thms = PureThy.thms_of thy
paulson@16741
    94
	val table = make_thm_table current_thms
paulson@16741
    95
    in
paulson@16741
    96
	relevant_axioms goal table n
paulson@16741
    97
    end;
paulson@16741
    98
paulson@16741
    99
end;
paulson@16741
   100
paulson@16741
   101
quigley@16156
   102
signature RES_CLASIMP = 
quigley@15919
   103
  sig
paulson@16795
   104
  val relevant : int ref
quigley@16950
   105
  val use_simpset: bool ref
paulson@16957
   106
  val use_nameless: bool ref
paulson@17305
   107
  val get_clasimp_lemmas : 
paulson@17484
   108
         Proof.context -> term -> 
paulson@17484
   109
         (ResClause.clause * thm) Array.array * ResClause.clause list 
quigley@15919
   110
  end;
quigley@15919
   111
quigley@15919
   112
structure ResClasimp : RES_CLASIMP =
quigley@15919
   113
struct
paulson@17305
   114
val use_simpset = ref false;   (*Performance is much better without simprules*)
paulson@17596
   115
val use_nameless = ref true;
paulson@16957
   116
paulson@16957
   117
val relevant = ref 0;  (*Relevance filtering is off by default*)
paulson@16795
   118
paulson@16956
   119
(*The "name" of a theorem is its statement, if nothing else is available.*)
paulson@16956
   120
val plain_string_of_thm =
paulson@16956
   121
    setmp show_question_marks false 
paulson@16956
   122
      (setmp print_mode [] 
paulson@16956
   123
	(Pretty.setmp_margin 999 string_of_thm));
paulson@16957
   124
	
paulson@16957
   125
fun fake_thm_name th = 
paulson@17525
   126
    Context.theory_name (theory_of_thm th) ^ "." ^ unenclose (plain_string_of_thm th);
paulson@16061
   127
paulson@16957
   128
fun put_name_pair ("",th) = if !use_nameless then (fake_thm_name th, th)
paulson@16957
   129
                            else ("HOL.TrueI",TrueI)
paulson@16956
   130
  | put_name_pair (a,th)  = (a,th);
quigley@16039
   131
quigley@16039
   132
(* outputs a list of (thm,clause) pairs *)
quigley@15643
   133
paulson@17305
   134
fun multi x 0 xlist = xlist
paulson@17305
   135
   |multi x n xlist = multi x (n-1) (x::xlist);
quigley@16156
   136
paulson@17305
   137
fun clause_numbering ((clause, theorem), num_of_cls) = 
paulson@17305
   138
    let val numbers = 0 upto (num_of_cls - 1)
paulson@16172
   139
    in 
paulson@17305
   140
	multi (clause, theorem) num_of_cls []
paulson@16172
   141
    end;
paulson@17234
   142
    
quigley@16950
   143
paulson@16741
   144
(*Write out the claset and simpset rules of the supplied theory.
paulson@16906
   145
  FIXME: argument "goal" is a hack to allow relevance filtering.
paulson@16906
   146
  To reduce the number of clauses produced, set ResClasimp.relevant:=1*)
paulson@17484
   147
fun get_clasimp_lemmas ctxt goal = 
paulson@16795
   148
    let val claset_rules = 
paulson@16956
   149
              map put_name_pair
paulson@16956
   150
	        (ReduceAxiomsN.relevant_filter (!relevant) goal 
paulson@17484
   151
		  (ResAxioms.claset_rules_of_ctxt ctxt));
paulson@16956
   152
	val claset_cls_thms = #1 (ResAxioms.clausify_rules_pairs claset_rules []);
quigley@15643
   153
paulson@16795
   154
	val simpset_rules =
paulson@16795
   155
	      ReduceAxiomsN.relevant_filter (!relevant) goal 
paulson@17484
   156
                (ResAxioms.simpset_rules_of_ctxt ctxt);
paulson@17234
   157
	val named_simpset = map put_name_pair simpset_rules
paulson@16061
   158
	val simpset_cls_thms = #1 (ResAxioms.clausify_rules_pairs named_simpset []);
quigley@15643
   159
paulson@17234
   160
	val cls_thms = if !use_simpset then (claset_cls_thms@simpset_cls_thms) 
paulson@17234
   161
	               else claset_cls_thms;
paulson@16061
   162
	val cls_thms_list = List.concat cls_thms;
paulson@16061
   163
	(*************************************************)
paulson@17305
   164
	(* Identify the set of clauses to be written out *)
paulson@16061
   165
	(*************************************************)
paulson@16061
   166
	val clauses = map #1(cls_thms_list);
paulson@17305
   167
	val cls_nums = map ResClause.num_of_clauses clauses;
paulson@17305
   168
        val whole_list = List.concat 
paulson@17305
   169
              (map clause_numbering (ListPair.zip (cls_thms_list, cls_nums)));
quigley@16156
   170
 
quigley@16156
   171
        (*********************************************************)
quigley@16156
   172
	(* create array and put clausename, number pairs into it *)
quigley@16156
   173
	(*********************************************************)
quigley@16156
   174
	val clause_arr = Array.fromList whole_list;
paulson@16061
   175
  in
paulson@17484
   176
	(clause_arr, clauses)
paulson@16061
   177
  end;
quigley@15643
   178
quigley@16950
   179
quigley@15919
   180
end;
quigley@16039
   181
quigley@16156
   182
quigley@16156
   183