src/HOL/Tools/ATP/res_clasimpset.ML
author paulson
Wed Sep 07 09:54:31 2005 +0200 (2005-09-07)
changeset 17305 6cef3aedd661
parent 17261 193b84a70ca4
child 17412 e26cb20ef0cc
permissions -rw-r--r--
axioms now included in tptp files, no /bin/cat and various tidying
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
paulson@16741
    26
fun thm_consts_rm ncs thm = term_consts_rm ncs (prop_of thm);
paulson@16741
    27
paulson@16741
    28
paulson@16741
    29
fun consts_of_thm (n,thm) = thm_consts_rm ["Trueprop","==>","all","Ex","op &", "op |", "Not", "All", "op -->", "op =", "==", "True", "False"] thm;
paulson@16741
    30
paulson@16741
    31
fun consts_of_term term = term_consts_rm ["Trueprop","==>","all","Ex","op &", "op |", "Not", "All", "op -->", "op =", "==", "True", "False"] term;
paulson@16741
    32
paulson@16741
    33
fun make_pairs [] _ = []
paulson@16741
    34
  | make_pairs (x::xs) y = (x,y)::(make_pairs xs y);
paulson@16741
    35
paulson@16741
    36
paulson@16741
    37
paulson@16741
    38
fun const_thm_list_aux [] cthms = cthms
paulson@16741
    39
  | const_thm_list_aux (thm::thms) cthms =
paulson@16741
    40
    let val consts = consts_of_thm thm
paulson@16741
    41
	val cthms' = make_pairs consts thm 
paulson@16741
    42
    in
paulson@16741
    43
	const_thm_list_aux thms (cthms' @ cthms)
paulson@16741
    44
    end;
paulson@16741
    45
paulson@16741
    46
paulson@16741
    47
fun const_thm_list thms = const_thm_list_aux thms [];
paulson@16741
    48
paulson@16741
    49
fun make_thm_table thms  = 
paulson@16741
    50
    let val consts_thms = const_thm_list thms
paulson@16741
    51
    in
paulson@16741
    52
	Symtab.make_multi consts_thms
paulson@16741
    53
    end;
paulson@16741
    54
paulson@16741
    55
paulson@16741
    56
fun consts_in_goal goal = consts_of_term goal;
paulson@16741
    57
paulson@16741
    58
fun axioms_having_consts_aux [] tab thms = thms
paulson@16741
    59
  | axioms_having_consts_aux (c::cs) tab thms =
wenzelm@17261
    60
    let val thms1 = Symtab.curried_lookup tab c
wenzelm@17261
    61
      val thms2 = 
wenzelm@17261
    62
          case thms1 of (SOME x) => x
wenzelm@17261
    63
                      | NONE => []
paulson@16741
    64
    in
wenzelm@17261
    65
      axioms_having_consts_aux cs tab (thms2 union thms)
paulson@16741
    66
    end;
paulson@16741
    67
paulson@16741
    68
fun axioms_having_consts cs tab = axioms_having_consts_aux cs tab [];
paulson@16741
    69
paulson@16741
    70
paulson@16741
    71
fun relevant_axioms goal thmTab n =  
paulson@16741
    72
    let val consts = consts_in_goal goal
paulson@16741
    73
	fun relevant_axioms_aux1 cs k =
paulson@16741
    74
	    let val thms1 = axioms_having_consts cs thmTab
paulson@16741
    75
		val cs1 = ResLib.flat_noDup (map consts_of_thm thms1)
paulson@16741
    76
	    in
paulson@16795
    77
		if ((cs1 subset cs) orelse n <= k) then (k,thms1) 
paulson@16741
    78
		else (relevant_axioms_aux1 (cs1 union cs) (k+1))
paulson@16741
    79
	    end
paulson@16741
    80
paulson@16795
    81
    in  relevant_axioms_aux1 consts 1  end;
paulson@16741
    82
paulson@16741
    83
paulson@16795
    84
fun relevant_filter n goal thms = 
paulson@16795
    85
    if n<=0 then thms 
paulson@16795
    86
    else #2 (relevant_axioms goal (make_thm_table thms) n);
paulson@16741
    87
paulson@16741
    88
paulson@16741
    89
(* find the thms from thy that contain relevant constants, n is the iteration number *)
paulson@16741
    90
fun find_axioms_n thy goal n =
paulson@16741
    91
    let val clasetR = ResAxioms.claset_rules_of_thy thy
paulson@16741
    92
	val simpsetR = ResAxioms.simpset_rules_of_thy thy	  
paulson@16741
    93
	val table = make_thm_table (clasetR @ simpsetR)	
paulson@16741
    94
    in
paulson@16741
    95
	relevant_axioms goal table n
paulson@16741
    96
    end;
paulson@16741
    97
paulson@16741
    98
paulson@16741
    99
fun find_axioms_n_c thy goal n =
paulson@16741
   100
    let val current_thms = PureThy.thms_of thy
paulson@16741
   101
	val table = make_thm_table current_thms
paulson@16741
   102
    in
paulson@16741
   103
	relevant_axioms goal table n
paulson@16741
   104
    end;
paulson@16741
   105
paulson@16741
   106
end;
paulson@16741
   107
paulson@16741
   108
quigley@16156
   109
signature RES_CLASIMP = 
quigley@15919
   110
  sig
paulson@16795
   111
  val relevant : int ref
quigley@16950
   112
  val use_simpset: bool ref
paulson@16957
   113
  val use_nameless: bool ref
paulson@17305
   114
  val get_clasimp_lemmas : 
paulson@17305
   115
         theory -> term -> 
paulson@17305
   116
         (ResClause.clause * thm) Array.array * int * ResClause.clause list 
quigley@15919
   117
  end;
quigley@15919
   118
quigley@15919
   119
structure ResClasimp : RES_CLASIMP =
quigley@15919
   120
struct
paulson@17305
   121
val use_simpset = ref false;   (*Performance is much better without simprules*)
paulson@16957
   122
val use_nameless = ref false;  (*Because most are useless [iff] rules*)
paulson@16957
   123
paulson@16957
   124
val relevant = ref 0;  (*Relevance filtering is off by default*)
paulson@16795
   125
paulson@16956
   126
(*The "name" of a theorem is its statement, if nothing else is available.*)
paulson@16956
   127
val plain_string_of_thm =
paulson@16956
   128
    setmp show_question_marks false 
paulson@16956
   129
      (setmp print_mode [] 
paulson@16956
   130
	(Pretty.setmp_margin 999 string_of_thm));
paulson@16957
   131
	
paulson@16957
   132
fun fake_thm_name th = 
paulson@16957
   133
    Context.theory_name (theory_of_thm th) ^ "." ^ 
paulson@16957
   134
    ResLib.trim_ends (plain_string_of_thm th);
paulson@16061
   135
paulson@16957
   136
fun put_name_pair ("",th) = if !use_nameless then (fake_thm_name th, th)
paulson@16957
   137
                            else ("HOL.TrueI",TrueI)
paulson@16956
   138
  | put_name_pair (a,th)  = (a,th);
quigley@16039
   139
quigley@15919
   140
(* changed, now it also finds out the name of the theorem. *)
quigley@15919
   141
(* convert a theorem into CNF and then into Clause.clause format. *)
quigley@16039
   142
quigley@16039
   143
(* outputs a list of (thm,clause) pairs *)
quigley@15643
   144
paulson@17305
   145
fun multi x 0 xlist = xlist
paulson@17305
   146
   |multi x n xlist = multi x (n-1) (x::xlist);
quigley@16156
   147
paulson@17305
   148
fun clause_numbering ((clause, theorem), num_of_cls) = 
paulson@17305
   149
    let val numbers = 0 upto (num_of_cls - 1)
paulson@16172
   150
    in 
paulson@17305
   151
	multi (clause, theorem) num_of_cls []
paulson@16172
   152
    end;
paulson@17234
   153
    
quigley@16950
   154
paulson@16741
   155
(*Write out the claset and simpset rules of the supplied theory.
paulson@16906
   156
  FIXME: argument "goal" is a hack to allow relevance filtering.
paulson@16906
   157
  To reduce the number of clauses produced, set ResClasimp.relevant:=1*)
paulson@17305
   158
fun get_clasimp_lemmas thy goal = 
paulson@16795
   159
    let val claset_rules = 
paulson@16956
   160
              map put_name_pair
paulson@16956
   161
	        (ReduceAxiomsN.relevant_filter (!relevant) goal 
paulson@16956
   162
		  (ResAxioms.claset_rules_of_thy thy));
paulson@16956
   163
	val claset_cls_thms = #1 (ResAxioms.clausify_rules_pairs claset_rules []);
quigley@15643
   164
paulson@16795
   165
	val simpset_rules =
paulson@16795
   166
	      ReduceAxiomsN.relevant_filter (!relevant) goal 
paulson@16795
   167
                (ResAxioms.simpset_rules_of_thy thy);
paulson@17234
   168
	val named_simpset = map put_name_pair simpset_rules
paulson@16061
   169
	val simpset_cls_thms = #1 (ResAxioms.clausify_rules_pairs named_simpset []);
quigley@15643
   170
paulson@17234
   171
	val cls_thms = if !use_simpset then (claset_cls_thms@simpset_cls_thms) 
paulson@17234
   172
	               else claset_cls_thms;
paulson@16061
   173
	val cls_thms_list = List.concat cls_thms;
paulson@16061
   174
	(*************************************************)
paulson@17305
   175
	(* Identify the set of clauses to be written out *)
paulson@16061
   176
	(*************************************************)
paulson@16061
   177
	val clauses = map #1(cls_thms_list);
paulson@17305
   178
	val cls_nums = map ResClause.num_of_clauses clauses;
paulson@17305
   179
        val whole_list = List.concat 
paulson@17305
   180
              (map clause_numbering (ListPair.zip (cls_thms_list, cls_nums)));
quigley@16156
   181
 
quigley@16156
   182
        (*********************************************************)
quigley@16156
   183
	(* create array and put clausename, number pairs into it *)
quigley@16156
   184
	(*********************************************************)
quigley@16156
   185
	val clause_arr = Array.fromList whole_list;
paulson@16061
   186
  in
paulson@17305
   187
	(clause_arr, List.length whole_list, clauses)
paulson@16061
   188
  end;
quigley@15643
   189
quigley@16950
   190
quigley@15919
   191
end;
quigley@16039
   192
quigley@16156
   193
quigley@16156
   194