paulson@15789
|
1 |
(* ID: $Id$
|
wenzelm@16259
|
2 |
Author: Claire Quigley
|
wenzelm@16259
|
3 |
Copyright 2004 University of Cambridge
|
paulson@15789
|
4 |
*)
|
paulson@15789
|
5 |
|
paulson@15684
|
6 |
structure Recon_Transfer =
|
paulson@15684
|
7 |
struct
|
wenzelm@16803
|
8 |
|
paulson@15684
|
9 |
open Recon_Parse
|
wenzelm@16803
|
10 |
|
paulson@15684
|
11 |
infixr 8 ++; infixr 7 >>; infixr 6 ||;
|
paulson@15684
|
12 |
|
quigley@15642
|
13 |
|
quigley@15642
|
14 |
(* Versions that include type information *)
|
quigley@15642
|
15 |
|
wenzelm@16803
|
16 |
(* FIXME rename to str_of_thm *)
|
paulson@16157
|
17 |
fun string_of_thm thm =
|
wenzelm@16803
|
18 |
setmp show_sorts true (Pretty.str_of o Display.pretty_thm) thm;
|
quigley@15642
|
19 |
|
quigley@15642
|
20 |
|
quigley@15642
|
21 |
(* check separate args in the watcher program for separating strings with a * or ; or something *)
|
quigley@15642
|
22 |
|
quigley@15642
|
23 |
fun clause_strs_to_string [] str = str
|
quigley@15642
|
24 |
| clause_strs_to_string (x::xs) str = clause_strs_to_string xs (str^x^"%")
|
quigley@15642
|
25 |
|
quigley@15642
|
26 |
fun thmvars_to_string [] str = str
|
quigley@15642
|
27 |
| thmvars_to_string (x::xs) str = thmvars_to_string xs (str^x^"%")
|
quigley@15642
|
28 |
|
quigley@15642
|
29 |
|
quigley@15642
|
30 |
fun proofstep_to_string Axiom = "Axiom()"
|
paulson@16091
|
31 |
| proofstep_to_string (Binary ((a,b), (c,d)))=
|
paulson@16091
|
32 |
"Binary(("^(string_of_int a)^","^(string_of_int b)^"),("^(string_of_int c)^","^(string_of_int d)^"))"
|
paulson@16091
|
33 |
| proofstep_to_string (Factor (a,b,c)) =
|
paulson@16091
|
34 |
"Factor("^(string_of_int a)^","^(string_of_int b)^","^(string_of_int c)^")"
|
paulson@16091
|
35 |
| proofstep_to_string (Para ((a,b), (c,d)))=
|
paulson@16091
|
36 |
"Para(("^(string_of_int a)^","^(string_of_int b)^"),("^(string_of_int c)^","^(string_of_int d)^"))"
|
paulson@16091
|
37 |
| proofstep_to_string (MRR ((a,b), (c,d))) =
|
paulson@16091
|
38 |
"MRR(("^(string_of_int a)^","^(string_of_int b)^"),("^(string_of_int c)^","^(string_of_int d)^"))"
|
quigley@16548
|
39 |
(*| proofstep_to_string (Rewrite((a,b),(c,d))) =
|
quigley@16548
|
40 |
"Rewrite(("^(string_of_int a)^","^(string_of_int b)^"),("^(string_of_int c)^","^(string_of_int d)^"))"*)
|
quigley@15642
|
41 |
|
quigley@15642
|
42 |
fun list_to_string [] liststr = liststr
|
quigley@15642
|
43 |
| list_to_string (x::[]) liststr = liststr^(string_of_int x)
|
quigley@15642
|
44 |
| list_to_string (x::xs) liststr = list_to_string xs (liststr^(string_of_int x)^",")
|
quigley@15642
|
45 |
|
quigley@15642
|
46 |
|
paulson@16091
|
47 |
fun proof_to_string (num,(step,clause_strs, thmvars)) = (string_of_int num)^(proofstep_to_string step)^"["^(clause_strs_to_string clause_strs "")^"]["^(thmvars_to_string thmvars "")^"]"
|
quigley@15642
|
48 |
|
quigley@15642
|
49 |
|
quigley@15642
|
50 |
fun proofs_to_string [] str = str
|
quigley@15642
|
51 |
| proofs_to_string (x::xs) str = let val newstr = proof_to_string x
|
quigley@15642
|
52 |
in
|
quigley@15642
|
53 |
proofs_to_string xs (str^newstr)
|
quigley@15642
|
54 |
end
|
quigley@15642
|
55 |
|
quigley@15642
|
56 |
|
quigley@15642
|
57 |
|
quigley@15642
|
58 |
fun init_proofstep_to_string (num, step, clause_strs) = (string_of_int num)^" "^(proofstep_to_string step)^" "^(clause_strs_to_string clause_strs "")^" "
|
quigley@15642
|
59 |
|
quigley@15642
|
60 |
fun init_proofsteps_to_string [] str = str
|
quigley@15642
|
61 |
| init_proofsteps_to_string (x::xs) str = let val newstr = init_proofstep_to_string x
|
quigley@15642
|
62 |
in
|
quigley@15642
|
63 |
init_proofsteps_to_string xs (str^newstr)
|
quigley@15642
|
64 |
end
|
quigley@15642
|
65 |
|
quigley@15642
|
66 |
|
quigley@15642
|
67 |
|
quigley@15642
|
68 |
(*** get a string representing the Isabelle ordered axioms ***)
|
quigley@15642
|
69 |
|
paulson@16061
|
70 |
fun origAx_to_string (num,(meta,thmvars)) =
|
paulson@16061
|
71 |
let val clause_strs = ReconOrderClauses.get_meta_lits_bracket meta
|
paulson@16061
|
72 |
in
|
paulson@16091
|
73 |
(string_of_int num)^"OrigAxiom()["^
|
paulson@16091
|
74 |
(clause_strs_to_string clause_strs "")^"]["^
|
paulson@16061
|
75 |
(thmvars_to_string thmvars "")^"]"
|
paulson@16061
|
76 |
end
|
quigley@15642
|
77 |
|
quigley@15642
|
78 |
|
quigley@15642
|
79 |
fun origAxs_to_string [] str = str
|
quigley@15642
|
80 |
| origAxs_to_string (x::xs) str = let val newstr = origAx_to_string x
|
quigley@15642
|
81 |
in
|
quigley@15642
|
82 |
origAxs_to_string xs (str^newstr)
|
quigley@15642
|
83 |
end
|
quigley@15642
|
84 |
|
quigley@15642
|
85 |
|
quigley@15642
|
86 |
(*** get a string representing the Isabelle ordered axioms not used in the spass proof***)
|
quigley@15642
|
87 |
|
paulson@16061
|
88 |
fun extraAx_to_string (num, (meta,thmvars)) =
|
paulson@16061
|
89 |
let val clause_strs = ReconOrderClauses.get_meta_lits_bracket meta
|
paulson@16061
|
90 |
in
|
paulson@16091
|
91 |
(string_of_int num)^"ExtraAxiom()["^
|
paulson@16061
|
92 |
(clause_strs_to_string clause_strs "")^"]"^
|
paulson@16061
|
93 |
"["^(thmvars_to_string thmvars "")^"]"
|
paulson@16061
|
94 |
end;
|
quigley@15642
|
95 |
|
paulson@16061
|
96 |
fun extraAxs_to_string [] str = str
|
paulson@16061
|
97 |
| extraAxs_to_string (x::xs) str =
|
paulson@16061
|
98 |
let val newstr = extraAx_to_string x
|
paulson@16061
|
99 |
in
|
paulson@16061
|
100 |
extraAxs_to_string xs (str^newstr)
|
paulson@16061
|
101 |
end;
|
quigley@15642
|
102 |
|
paulson@17312
|
103 |
fun is_axiom (_,Axiom,str) = true
|
paulson@17312
|
104 |
| is_axiom (_,_,_) = false
|
quigley@15642
|
105 |
|
quigley@15642
|
106 |
fun get_step_nums [] nums = nums
|
quigley@15642
|
107 |
| get_step_nums (( num:int,Axiom, str)::xs) nums = get_step_nums xs (nums@[num])
|
quigley@15642
|
108 |
|
paulson@15774
|
109 |
exception Noassoc;
|
paulson@15774
|
110 |
|
paulson@15774
|
111 |
fun assoc_snd a [] = raise Noassoc
|
quigley@15642
|
112 |
| assoc_snd a ((x, y)::t) = if a = y then x else assoc_snd a t;
|
quigley@15642
|
113 |
|
quigley@15642
|
114 |
(* change to be something using check_order instead of a = y --> returns true if ASSERTION not raised in checkorder, false otherwise *)
|
quigley@15642
|
115 |
|
quigley@15642
|
116 |
(*fun get_assoc_snds [] xs assocs= assocs
|
quigley@15642
|
117 |
| get_assoc_snds (x::xs) ys assocs = get_assoc_snds xs ys (assocs@[((assoc_snd x ys))])
|
quigley@15642
|
118 |
*)
|
quigley@15642
|
119 |
(*FIX - should this have vars in it? *)
|
paulson@16061
|
120 |
fun there_out_of_order xs ys = (ReconOrderClauses.checkorder xs ys [] ([],[],[]); true)
|
paulson@15774
|
121 |
handle _ => false
|
quigley@15642
|
122 |
|
paulson@15774
|
123 |
fun assoc_out_of_order a [] = raise Noassoc
|
quigley@15642
|
124 |
| assoc_out_of_order a ((b,c)::t) = if there_out_of_order a c then b else assoc_out_of_order a t;
|
quigley@15642
|
125 |
|
quigley@15642
|
126 |
fun get_assoc_snds [] xs assocs= assocs
|
quigley@15642
|
127 |
| get_assoc_snds (x::xs) ys assocs = get_assoc_snds xs ys (assocs@[((assoc_out_of_order x ys))])
|
quigley@15642
|
128 |
|
quigley@15642
|
129 |
fun add_if_not_inlist [] xs newlist = newlist
|
paulson@16157
|
130 |
| add_if_not_inlist (y::ys) xs newlist = if (not (y mem xs)) then
|
quigley@15642
|
131 |
add_if_not_inlist ys xs (y::newlist)
|
quigley@15642
|
132 |
else add_if_not_inlist ys xs (newlist)
|
quigley@15642
|
133 |
|
paulson@15700
|
134 |
(*Flattens a list of list of strings to one string*)
|
paulson@15700
|
135 |
fun onestr ls = String.concat (map String.concat ls);
|
quigley@15642
|
136 |
|
quigley@15642
|
137 |
fun thmstrings [] str = str
|
quigley@15642
|
138 |
| thmstrings (x::xs) str = thmstrings xs (str^(string_of_thm x))
|
quigley@15642
|
139 |
|
paulson@17315
|
140 |
fun is_clasimp_ax clasimp_num n = n <= clasimp_num
|
quigley@15919
|
141 |
|
quigley@16156
|
142 |
fun subone x = x - 1
|
quigley@16156
|
143 |
|
quigley@16156
|
144 |
fun numstr [] = ""
|
quigley@16156
|
145 |
| numstr (x::xs) = (string_of_int x)^"%"^(numstr xs)
|
quigley@16156
|
146 |
|
quigley@15919
|
147 |
|
quigley@15919
|
148 |
(* retrieve the axioms that were obtained from the clasimpset *)
|
quigley@15919
|
149 |
|
paulson@17312
|
150 |
fun get_clasimp_cls (clause_arr: (ResClause.clause * thm) array) clasimp_num step_nums =
|
paulson@16157
|
151 |
let val realnums = map subone step_nums
|
paulson@16157
|
152 |
val clasimp_nums = List.filter (is_clasimp_ax (clasimp_num - 1)) realnums
|
quigley@16478
|
153 |
(* val axnums = TextIO.openOut(File.platform_path(File.tmp_path (Path.basic "axnums")))
|
paulson@16157
|
154 |
val _ = TextIO.output(axnums,(numstr clasimp_nums))
|
quigley@16478
|
155 |
val _ = TextIO.closeOut(axnums)*)
|
paulson@16157
|
156 |
in
|
paulson@17315
|
157 |
map (fn x => Array.sub(clause_arr, x)) clasimp_nums
|
paulson@16157
|
158 |
end
|
quigley@15919
|
159 |
|
quigley@16156
|
160 |
|
quigley@16357
|
161 |
(*****************************************************)
|
quigley@16357
|
162 |
(* get names of clasimp axioms used *)
|
quigley@16357
|
163 |
(*****************************************************)
|
quigley@16156
|
164 |
|
paulson@17312
|
165 |
fun get_axiom_names step_nums thms clause_arr num_of_clauses =
|
paulson@16157
|
166 |
let
|
paulson@16157
|
167 |
(* not sure why this is necessary again, but seems to be *)
|
paulson@16157
|
168 |
val _ = (print_mode := (Library.gen_rems (op =) (! print_mode, ["xsymbols", "symbols"])))
|
paulson@16157
|
169 |
|
paulson@16157
|
170 |
(***********************************************)
|
paulson@16157
|
171 |
(* here need to add the clauses from clause_arr*)
|
paulson@16157
|
172 |
(***********************************************)
|
paulson@16157
|
173 |
|
paulson@17312
|
174 |
val clasimp_names_cls = get_clasimp_cls clause_arr num_of_clauses step_nums
|
paulson@16157
|
175 |
val clasimp_names = map (#1 o ResClause.clause_info o #1) clasimp_names_cls
|
paulson@16157
|
176 |
|
paulson@16157
|
177 |
val _ = File.write (File.tmp_path (Path.basic "clasimp_names"))
|
paulson@16157
|
178 |
(concat clasimp_names)
|
paulson@16157
|
179 |
val _ = (print_mode := (["xsymbols", "symbols"] @ ! print_mode))
|
paulson@16157
|
180 |
in
|
paulson@16157
|
181 |
clasimp_names
|
paulson@16157
|
182 |
end
|
paulson@17306
|
183 |
|
paulson@17315
|
184 |
|
paulson@17315
|
185 |
fun get_axiom_names_spass proofstr thms clause_arr num_of_clauses =
|
paulson@17315
|
186 |
let (* parse spass proof into datatype *)
|
paulson@17315
|
187 |
val tokens = #1(lex proofstr)
|
paulson@17315
|
188 |
val proof_steps = parse tokens
|
paulson@17315
|
189 |
val _ = File.write (File.tmp_path (Path.basic "parsing_done"))
|
paulson@17315
|
190 |
("Did parsing on "^proofstr)
|
paulson@17315
|
191 |
(* get axioms as correctly numbered clauses w.r.t. the Spass proof *)
|
paulson@17315
|
192 |
in
|
paulson@17315
|
193 |
get_axiom_names (get_step_nums (List.filter is_axiom proof_steps) [])
|
paulson@17315
|
194 |
thms clause_arr num_of_clauses
|
paulson@17315
|
195 |
end;
|
quigley@16357
|
196 |
|
paulson@17306
|
197 |
fun get_axiom_names_vamp_E proofstr thms clause_arr num_of_clauses =
|
paulson@17306
|
198 |
get_axiom_names (get_linenums proofstr) thms clause_arr num_of_clauses;
|
paulson@17306
|
199 |
|
quigley@17235
|
200 |
|
quigley@16357
|
201 |
(***********************************************)
|
quigley@16357
|
202 |
(* get axioms for reconstruction *)
|
quigley@16357
|
203 |
(***********************************************)
|
quigley@16156
|
204 |
fun numclstr (vars, []) str = str
|
paulson@16157
|
205 |
| numclstr ( vars, ((num, thm)::rest)) str =
|
paulson@16157
|
206 |
let val newstr = str^(string_of_int num)^" "^(string_of_thm thm)^" "
|
paulson@16157
|
207 |
in
|
paulson@16157
|
208 |
numclstr (vars,rest) newstr
|
paulson@16157
|
209 |
end
|
quigley@15919
|
210 |
|
paulson@16157
|
211 |
fun addvars c (a,b) = (a,b,c)
|
quigley@15919
|
212 |
|
paulson@17315
|
213 |
fun get_axioms_used proof_steps thms clause_arr num_of_clauses =
|
paulson@17315
|
214 |
let
|
paulson@17315
|
215 |
val _= (print_mode := (Library.gen_rems (op =) (! print_mode, ["xsymbols", "symbols"])))
|
paulson@17315
|
216 |
val axioms = (List.filter is_axiom) proof_steps
|
paulson@17315
|
217 |
val step_nums = get_step_nums axioms []
|
quigley@15919
|
218 |
|
paulson@17315
|
219 |
val clauses =(*(clasimp_cls)@*)( make_clauses thms)
|
paulson@17315
|
220 |
|
paulson@17315
|
221 |
val vars = map thm_vars clauses
|
paulson@17315
|
222 |
|
paulson@17315
|
223 |
val distvars = distinct (fold append vars [])
|
paulson@17315
|
224 |
val clause_terms = map prop_of clauses
|
paulson@17315
|
225 |
val clause_frees = List.concat (map term_frees clause_terms)
|
quigley@15642
|
226 |
|
paulson@17315
|
227 |
val frees = map lit_string_with_nums clause_frees;
|
quigley@15642
|
228 |
|
paulson@17315
|
229 |
val distfrees = distinct frees
|
quigley@15642
|
230 |
|
paulson@17315
|
231 |
val metas = map Meson.make_meta_clause clauses
|
paulson@17315
|
232 |
val ax_strs = map #3 axioms
|
quigley@15642
|
233 |
|
paulson@17315
|
234 |
(* literals of -all- axioms, not just those used by spass *)
|
paulson@17315
|
235 |
val meta_strs = map ReconOrderClauses.get_meta_lits metas
|
paulson@17315
|
236 |
|
paulson@17315
|
237 |
val metas_and_strs = ListPair.zip (metas,meta_strs)
|
paulson@17315
|
238 |
val _ = File.write(File.tmp_path (Path.basic "foo_clauses")) (onestr ax_strs)
|
paulson@17315
|
239 |
val _ = File.write(File.tmp_path (Path.basic "foo_metastrs")) (onestr meta_strs)
|
quigley@15642
|
240 |
|
paulson@17315
|
241 |
(* get list of axioms as thms with their variables *)
|
quigley@15642
|
242 |
|
paulson@17315
|
243 |
val ax_metas = get_assoc_snds ax_strs metas_and_strs []
|
paulson@17315
|
244 |
val ax_vars = map thm_vars ax_metas
|
paulson@17315
|
245 |
val ax_with_vars = ListPair.zip (ax_metas,ax_vars)
|
quigley@15642
|
246 |
|
paulson@17315
|
247 |
(* get list of extra axioms as thms with their variables *)
|
paulson@17315
|
248 |
val extra_metas = add_if_not_inlist metas ax_metas []
|
paulson@17315
|
249 |
val extra_vars = map thm_vars extra_metas
|
paulson@17315
|
250 |
val extra_with_vars = if (not (extra_metas = []) )
|
paulson@17315
|
251 |
then ListPair.zip (extra_metas,extra_vars)
|
paulson@17315
|
252 |
else []
|
paulson@17315
|
253 |
in
|
paulson@17315
|
254 |
(distfrees,distvars, extra_with_vars,ax_with_vars, ListPair.zip (step_nums,ax_metas))
|
paulson@17315
|
255 |
end;
|
paulson@16905
|
256 |
|
quigley@15642
|
257 |
|
quigley@15642
|
258 |
(*********************************************************************)
|
quigley@15642
|
259 |
(* Pass in spass string of proof and string version of isabelle goal *)
|
quigley@15642
|
260 |
(* Get out reconstruction steps as a string to be sent to Isabelle *)
|
quigley@15642
|
261 |
(*********************************************************************)
|
quigley@15642
|
262 |
|
paulson@17122
|
263 |
fun rules_to_string [] = "NONE"
|
paulson@17122
|
264 |
| rules_to_string xs = "[" ^ space_implode ", " xs ^ "]"
|
quigley@16357
|
265 |
|
paulson@16905
|
266 |
fun subst_for a b = String.translate (fn c => str (if c=a then b else c));
|
quigley@16357
|
267 |
|
paulson@16905
|
268 |
val remove_linebreaks = subst_for #"\n" #"\t";
|
paulson@16905
|
269 |
val restore_linebreaks = subst_for #"\t" #"\n";
|
quigley@16357
|
270 |
|
quigley@16478
|
271 |
|
paulson@17315
|
272 |
fun proverString_to_lemmaString_aux proofstr thmstring goalstring toParent ppid thms clause_arr num_of_clauses getax =
|
paulson@16905
|
273 |
let val _ = File.append(File.tmp_path (Path.basic "thmstringfile"))
|
paulson@17315
|
274 |
("thmstring is " ^ thmstring ^
|
paulson@17315
|
275 |
"\nproofstr is " ^ proofstr ^
|
paulson@17315
|
276 |
"\ngoalstr is " ^ goalstring ^
|
paulson@17315
|
277 |
"\nnum of clauses is " ^ string_of_int num_of_clauses)
|
quigley@16478
|
278 |
|
paulson@17315
|
279 |
val axiom_names = getax proofstr thms clause_arr num_of_clauses
|
paulson@17315
|
280 |
val ax_str = "Rules from clasimpset used in automatic proof: " ^
|
quigley@17235
|
281 |
rules_to_string axiom_names
|
quigley@17235
|
282 |
in
|
paulson@17312
|
283 |
File.append(File.tmp_path (Path.basic "reconstrfile"))
|
paulson@17312
|
284 |
("reconstring is: "^ax_str^" "^goalstring);
|
quigley@17235
|
285 |
TextIO.output (toParent, ax_str^"\n");
|
paulson@17312
|
286 |
TextIO.output (toParent, "goalstring: "^goalstring^"\n");
|
quigley@17235
|
287 |
TextIO.output (toParent, "thmstring: "^thmstring^"\n");
|
quigley@17235
|
288 |
TextIO.flushOut toParent;
|
quigley@17235
|
289 |
|
quigley@17235
|
290 |
Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
|
quigley@17235
|
291 |
(* Attempt to prevent several signals from turning up simultaneously *)
|
paulson@17306
|
292 |
Posix.Process.sleep(Time.fromSeconds 1) ; all_tac
|
quigley@17235
|
293 |
end
|
paulson@17315
|
294 |
handle _ => (*FIXME: exn handler is too general!*)
|
paulson@17315
|
295 |
(File.write(File.tmp_path (Path.basic "proverString_handler")) "In exception handler";
|
paulson@17315
|
296 |
TextIO.output (toParent, "Proof found but translation failed : " ^
|
paulson@17315
|
297 |
remove_linebreaks proofstr ^ "\n");
|
paulson@17315
|
298 |
TextIO.output (toParent, remove_linebreaks thmstring ^ "\n");
|
paulson@17315
|
299 |
TextIO.output (toParent, remove_linebreaks goalstring ^ "\n");
|
paulson@17315
|
300 |
TextIO.flushOut toParent;
|
paulson@17315
|
301 |
Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
|
paulson@17315
|
302 |
(* Attempt to prevent several signals from turning up simultaneously *)
|
paulson@17315
|
303 |
Posix.Process.sleep(Time.fromSeconds 1); all_tac);
|
quigley@17235
|
304 |
|
paulson@17315
|
305 |
fun proverString_to_lemmaString proofstr thmstring goalstring toParent ppid thms
|
paulson@17315
|
306 |
clause_arr num_of_clauses =
|
paulson@17315
|
307 |
proverString_to_lemmaString_aux proofstr thmstring goalstring toParent ppid thms
|
paulson@17315
|
308 |
clause_arr num_of_clauses get_axiom_names_vamp_E;
|
paulson@17315
|
309 |
|
paulson@17315
|
310 |
fun spassString_to_lemmaString proofstr thmstring goalstring toParent ppid thms
|
paulson@17315
|
311 |
clause_arr num_of_clauses =
|
paulson@17315
|
312 |
proverString_to_lemmaString_aux proofstr thmstring goalstring toParent ppid thms
|
paulson@17315
|
313 |
clause_arr num_of_clauses get_axiom_names_spass;
|
paulson@17315
|
314 |
|
paulson@17315
|
315 |
|
paulson@17315
|
316 |
(**** Full proof reconstruction for SPASS (not really working) ****)
|
quigley@15642
|
317 |
|
quigley@15919
|
318 |
fun spassString_to_reconString proofstr thmstring goalstring toParent ppid thms clause_arr num_of_clauses =
|
paulson@16905
|
319 |
let val _ = File.write(File.tmp_path (Path.basic "thmstringfile"))
|
paulson@16905
|
320 |
(" thmstring is: "^thmstring^"proofstr is: "^proofstr)
|
paulson@16905
|
321 |
val tokens = #1(lex proofstr)
|
quigley@15782
|
322 |
|
paulson@16905
|
323 |
(***********************************)
|
paulson@16905
|
324 |
(* parse spass proof into datatype *)
|
paulson@16905
|
325 |
(***********************************)
|
paulson@17306
|
326 |
val proof_steps = parse tokens
|
quigley@15919
|
327 |
|
paulson@16905
|
328 |
val _ = File.write (File.tmp_path (Path.basic "foo_parse"))
|
paulson@16905
|
329 |
("Did parsing on "^proofstr)
|
paulson@16905
|
330 |
|
paulson@16905
|
331 |
val _ = File.write (File.tmp_path (Path.basic "foo_thmstring_at_parse"))
|
paulson@16905
|
332 |
("Parsing for thmstring: "^thmstring)
|
paulson@16905
|
333 |
(************************************)
|
paulson@16905
|
334 |
(* recreate original subgoal as thm *)
|
paulson@16905
|
335 |
(************************************)
|
paulson@16905
|
336 |
(* get axioms as correctly numbered clauses w.r.t. the Spass proof *)
|
paulson@16905
|
337 |
(* need to get prems_of thm, then get right one of the prems, relating to whichever*)
|
paulson@16905
|
338 |
(* subgoal this is, and turn it into meta_clauses *)
|
paulson@16905
|
339 |
(* should prob add array and table here, so that we can get axioms*)
|
paulson@16905
|
340 |
(* produced from the clasimpset rather than the problem *)
|
paulson@16905
|
341 |
val (frees,vars,extra_with_vars ,ax_with_vars,numcls) = get_axioms_used proof_steps thms clause_arr num_of_clauses
|
paulson@16905
|
342 |
|
paulson@16905
|
343 |
(*val numcls_string = numclstr ( vars, numcls) ""*)
|
paulson@16905
|
344 |
val _ = File.write (File.tmp_path (Path.basic "foo_axiom")) "got axioms"
|
paulson@16061
|
345 |
|
paulson@16905
|
346 |
(************************************)
|
paulson@16905
|
347 |
(* translate proof *)
|
paulson@16905
|
348 |
(************************************)
|
paulson@16905
|
349 |
val _ = File.write (File.tmp_path (Path.basic "foo_steps"))
|
paulson@16905
|
350 |
("about to translate proof, steps: "
|
paulson@16905
|
351 |
^(init_proofsteps_to_string proof_steps ""))
|
paulson@16905
|
352 |
val (newthm,proof) = translate_proof numcls proof_steps vars
|
paulson@16905
|
353 |
val _ = File.write (File.tmp_path (Path.basic "foo_steps2"))
|
paulson@16905
|
354 |
("translated proof, steps: "^(init_proofsteps_to_string proof_steps ""))
|
paulson@16905
|
355 |
(***************************************************)
|
paulson@16905
|
356 |
(* transfer necessary steps as strings to Isabelle *)
|
paulson@16905
|
357 |
(***************************************************)
|
paulson@16905
|
358 |
(* turn the proof into a string *)
|
paulson@16905
|
359 |
val reconProofStr = proofs_to_string proof ""
|
paulson@16905
|
360 |
(* do the bit for the Isabelle ordered axioms at the top *)
|
paulson@16905
|
361 |
val ax_nums = map #1 numcls
|
paulson@16905
|
362 |
val ax_strs = map ReconOrderClauses.get_meta_lits_bracket (map #2 numcls)
|
paulson@16905
|
363 |
val numcls_strs = ListPair.zip (ax_nums,ax_strs)
|
paulson@16905
|
364 |
val num_cls_vars = map (addvars vars) numcls_strs;
|
paulson@16905
|
365 |
val reconIsaAxStr = origAxs_to_string (ListPair.zip (ax_nums,ax_with_vars)) ""
|
paulson@16905
|
366 |
|
paulson@16905
|
367 |
val extra_nums = if (not (extra_with_vars = [])) then (1 upto (length extra_with_vars))
|
paulson@16905
|
368 |
else []
|
paulson@16905
|
369 |
val reconExtraAxStr = extraAxs_to_string ( ListPair.zip (extra_nums,extra_with_vars)) ""
|
paulson@16905
|
370 |
val frees_str = "["^(thmvars_to_string frees "")^"]"
|
paulson@16905
|
371 |
val _ = File.write (File.tmp_path (Path.basic "reconstringfile"))
|
paulson@16905
|
372 |
(frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr)
|
paulson@16905
|
373 |
val reconstr = (frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr)
|
paulson@16905
|
374 |
in
|
paulson@16905
|
375 |
TextIO.output (toParent, reconstr^"\n");
|
paulson@16905
|
376 |
TextIO.flushOut toParent;
|
paulson@16905
|
377 |
TextIO.output (toParent, thmstring^"\n");
|
paulson@16905
|
378 |
TextIO.flushOut toParent;
|
paulson@16905
|
379 |
TextIO.output (toParent, goalstring^"\n");
|
paulson@16905
|
380 |
TextIO.flushOut toParent;
|
quigley@15642
|
381 |
|
paulson@16905
|
382 |
Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
|
paulson@16905
|
383 |
(* Attempt to prevent several signals from turning up simultaneously *)
|
paulson@17306
|
384 |
Posix.Process.sleep(Time.fromSeconds 1) ; all_tac
|
paulson@16905
|
385 |
end
|
paulson@16905
|
386 |
handle _ =>
|
paulson@16905
|
387 |
let val _ = File.write(File.tmp_path (Path.basic "foo_handler")) "In exception handler"
|
paulson@16905
|
388 |
in
|
paulson@16905
|
389 |
TextIO.output (toParent,"Proof found but translation failed for resolution proof:"^(remove_linebreaks proofstr) ^"\n");
|
paulson@16905
|
390 |
TextIO.flushOut toParent;
|
paulson@16905
|
391 |
TextIO.output (toParent, thmstring^"\n");
|
paulson@16905
|
392 |
TextIO.flushOut toParent;
|
paulson@16905
|
393 |
TextIO.output (toParent, goalstring^"\n");
|
paulson@16905
|
394 |
TextIO.flushOut toParent;
|
paulson@16905
|
395 |
Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
|
paulson@16905
|
396 |
(* Attempt to prevent several signals from turning up simultaneously *)
|
paulson@17306
|
397 |
Posix.Process.sleep(Time.fromSeconds 1); all_tac
|
paulson@16905
|
398 |
end
|
quigley@15642
|
399 |
|
quigley@15642
|
400 |
|
quigley@15642
|
401 |
(**********************************************************************************)
|
quigley@15642
|
402 |
(* At other end, want to turn back into datatype so can apply reconstruct_proof. *)
|
quigley@15642
|
403 |
(* This will be done by the signal handler *)
|
quigley@15642
|
404 |
(**********************************************************************************)
|
quigley@15642
|
405 |
|
quigley@15642
|
406 |
(* Parse in the string version of the proof steps for reconstruction *)
|
quigley@15642
|
407 |
(* Isar format: cl1 [BINARY 0 cl2 0];cl1 [PARAMOD 0 cl2 0]; cl1 [DEMOD 0 cl2];cl1 [FACTOR 1 2];*)
|
quigley@15642
|
408 |
|
quigley@15642
|
409 |
|
quigley@15642
|
410 |
val term_numstep =
|
quigley@15642
|
411 |
(number ++ (a (Other ",")) ++ number) >> (fn (a, (_, c)) => (a, c))
|
quigley@15642
|
412 |
|
quigley@15642
|
413 |
val extraaxiomstep = (a (Word "ExtraAxiom"))++ (a (Other "(")) ++(a (Other ")"))
|
quigley@15642
|
414 |
>> (fn (_) => ExtraAxiom)
|
quigley@15642
|
415 |
|
quigley@15642
|
416 |
|
quigley@15642
|
417 |
|
quigley@15642
|
418 |
val origaxiomstep = (a (Word "OrigAxiom"))++ (a (Other "(")) ++(a (Other ")"))
|
quigley@15642
|
419 |
>> (fn (_) => OrigAxiom)
|
quigley@15642
|
420 |
|
quigley@15642
|
421 |
|
quigley@15642
|
422 |
val axiomstep = (a (Word "Axiom"))++ (a (Other "(")) ++(a (Other ")"))
|
quigley@15642
|
423 |
>> (fn (_) => Axiom)
|
quigley@15642
|
424 |
|
quigley@15642
|
425 |
|
quigley@15642
|
426 |
|
quigley@15642
|
427 |
|
quigley@15642
|
428 |
val binarystep = (a (Word "Binary")) ++ (a (Other "(")) ++ (a (Other "("))
|
quigley@15642
|
429 |
++ term_numstep ++ (a (Other ")")) ++ (a (Other ","))
|
quigley@15642
|
430 |
++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
|
quigley@15642
|
431 |
>> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Binary (c,e))
|
quigley@15642
|
432 |
|
quigley@15642
|
433 |
|
quigley@15642
|
434 |
val parastep = (a (Word "Para")) ++ (a (Other "(")) ++ (a (Other "("))
|
quigley@15642
|
435 |
++ term_numstep ++ (a (Other ")")) ++ (a (Other ","))
|
quigley@15642
|
436 |
++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
|
quigley@15642
|
437 |
>> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Para(c, e))
|
quigley@15642
|
438 |
|
quigley@15642
|
439 |
val mrrstep = (a (Word "MRR")) ++ (a (Other "(")) ++ (a (Other "("))
|
quigley@15642
|
440 |
++ term_numstep ++ (a (Other ")")) ++ (a (Other ","))
|
quigley@15642
|
441 |
++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
|
quigley@15642
|
442 |
>> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => MRR(c, e))
|
quigley@15642
|
443 |
|
quigley@15642
|
444 |
|
quigley@15642
|
445 |
val factorstep = (a (Word "Factor")) ++ (a (Other "("))
|
quigley@15642
|
446 |
++ number ++ (a (Other ","))
|
quigley@15642
|
447 |
++ number ++ (a (Other ","))
|
quigley@15642
|
448 |
++ number ++ (a (Other ")"))
|
quigley@15642
|
449 |
|
quigley@15642
|
450 |
>> (fn (_, (_, (c, (_, (e,(_,(f,_))))))) => Factor (c,e,f))
|
quigley@15642
|
451 |
|
quigley@15642
|
452 |
|
quigley@16548
|
453 |
(*val rewritestep = (a (Word "Rewrite")) ++ (a (Other "(")) ++ (a (Other "("))
|
quigley@15642
|
454 |
++ term_numstep ++ (a (Other ")")) ++ (a (Other ","))
|
quigley@15642
|
455 |
++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
|
quigley@16548
|
456 |
>> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Rewrite (c,e))*)
|
quigley@15642
|
457 |
|
quigley@15642
|
458 |
val obviousstep = (a (Word "Obvious")) ++ (a (Other "("))
|
quigley@15642
|
459 |
++ term_numstep ++ (a (Other ")"))
|
quigley@15642
|
460 |
>> (fn (_, (_, (c,_))) => Obvious (c))
|
quigley@15642
|
461 |
|
quigley@16548
|
462 |
val methodstep = extraaxiomstep || origaxiomstep || axiomstep ||binarystep || factorstep|| parastep || mrrstep || (*rewritestep ||*) obviousstep
|
quigley@15642
|
463 |
|
quigley@15642
|
464 |
|
quigley@15642
|
465 |
val number_list_step =
|
paulson@15739
|
466 |
( number ++ many ((a (Other ",") ++ number)>> #2))
|
quigley@15642
|
467 |
>> (fn (a,b) => (a::b))
|
quigley@15642
|
468 |
|
quigley@15642
|
469 |
val numberlist_step = a (Other "[") ++ a (Other "]")
|
quigley@15642
|
470 |
>>(fn (_,_) => ([]:int list))
|
quigley@15642
|
471 |
|| a (Other "[") ++ number_list_step ++ a (Other "]")
|
quigley@15642
|
472 |
>>(fn (_,(a,_)) => a)
|
quigley@15642
|
473 |
|
quigley@15642
|
474 |
|
quigley@15642
|
475 |
|
quigley@15642
|
476 |
(** change this to allow P (x U) *)
|
paulson@17306
|
477 |
fun arglist_step input =
|
paulson@17306
|
478 |
( word ++ many word >> (fn (a, b) => (a^" "^(space_implode " " b)))
|
paulson@17306
|
479 |
||word >> (fn (a) => (a)))input
|
quigley@15642
|
480 |
|
quigley@15642
|
481 |
|
quigley@15642
|
482 |
fun literal_step input = (word ++ a (Other "(") ++ arglist_step ++ a (Other ")")
|
quigley@15642
|
483 |
>>(fn (a, (b, (c,d))) => (a^" ("^(c)^")"))
|
quigley@15642
|
484 |
|| arglist_step >> (fn (a) => (a)))input
|
quigley@15642
|
485 |
|
quigley@15642
|
486 |
|
quigley@15642
|
487 |
|
quigley@15642
|
488 |
(* fun term_step input = (a (Other "~") ++ arglist_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
|
quigley@15642
|
489 |
|| arglist_step ++ a (Other "%")>> (fn (a,b) => a ))input
|
quigley@15642
|
490 |
*)
|
quigley@15642
|
491 |
|
quigley@15642
|
492 |
|
quigley@15642
|
493 |
fun term_step input = (a (Other "~") ++ literal_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
|
quigley@15642
|
494 |
|| literal_step ++ a (Other "%")>> (fn (a,b) => a ))input
|
quigley@15642
|
495 |
|
quigley@15642
|
496 |
|
quigley@15642
|
497 |
|
quigley@15642
|
498 |
|
quigley@15642
|
499 |
val term_list_step =
|
quigley@15642
|
500 |
( term_step ++ many ( term_step))
|
quigley@15642
|
501 |
>> (fn (a,b) => (a::b))
|
quigley@15642
|
502 |
|
quigley@15642
|
503 |
|
quigley@15642
|
504 |
val term_lists_step = a (Other "[") ++ a (Other "]")
|
quigley@15642
|
505 |
>>(fn (_,_) => ([]:string list))
|
quigley@15642
|
506 |
|| a (Other "[") ++ term_list_step ++ a (Other "]")
|
quigley@15642
|
507 |
>>(fn (_,(a,_)) => a)
|
quigley@15642
|
508 |
|
quigley@15642
|
509 |
|
quigley@15642
|
510 |
|
quigley@15642
|
511 |
|
quigley@15642
|
512 |
fun anytoken_step input = (word>> (fn (a) => a) ) input
|
quigley@15642
|
513 |
handle NOPARSE_WORD => (number>> (fn (a) => string_of_int a) ) input
|
quigley@15642
|
514 |
handle NOPARSE_NUMBER => (other_char >> (fn(a) => a)) input
|
quigley@15642
|
515 |
|
quigley@15642
|
516 |
|
quigley@15642
|
517 |
|
quigley@15642
|
518 |
fun goalstring_step input= (anytoken_step ++ many (anytoken_step )
|
quigley@15642
|
519 |
>> (fn (a,b) => (a^" "^(implode b)))) input
|
quigley@15642
|
520 |
|
quigley@15642
|
521 |
|
quigley@15642
|
522 |
|
quigley@15642
|
523 |
val linestep = number ++ methodstep ++ term_lists_step ++ term_lists_step
|
quigley@15642
|
524 |
>> (fn (a, (b, (c,d))) => (a,(b,c,d)))
|
quigley@15642
|
525 |
|
quigley@15642
|
526 |
val lines_step = many linestep
|
quigley@15642
|
527 |
|
paulson@15739
|
528 |
val alllines_step = (term_lists_step ++ lines_step ) ++ finished >> #1
|
quigley@15642
|
529 |
|
paulson@15739
|
530 |
val parse_step = #1 o alllines_step
|
quigley@15642
|
531 |
|
quigley@15642
|
532 |
|
quigley@15642
|
533 |
(*
|
quigley@15642
|
534 |
val reconstr ="[P%x%xa%xb%]1OrigAxiom()[P x%~ P U%][U%]3OrigAxiom()[P U%~ P x%][U%]5OrigAxiom()[~ P xa%~ P U%][U%]7OrigAxiom()[P U%P xb%][U%]1Axiom()[P x%~ P U%][U%]3Axiom()[P U%~ P x%][U%]5Axiom()[~ P U%~ P xa%][U%]7Axiom()[P U%P xb%][U%]9Factor(5,0,1)[~ P xa%][]10Binary((9,0),(3,0))[~ P x%][]11Binary((10,0),(1,0))[~ P U%][U%]12Factor(7,0,1)[P xb%][]14Binary((11,0),(12,0))[][]%(EX x::'a::type. ALL y::'a::type. (P::'a::type => bool) x = P y) -->(EX x::'a::type. P x) = (ALL y::'a::type. P y)"
|
quigley@15642
|
535 |
*)
|
quigley@15642
|
536 |
|
quigley@15642
|
537 |
(************************************************************)
|
quigley@15642
|
538 |
(* Construct an Isar style proof from a list of proof steps *)
|
quigley@15642
|
539 |
(************************************************************)
|
quigley@15642
|
540 |
(* want to assume all axioms, then do haves for the other clauses*)
|
quigley@15642
|
541 |
(* then show for the last step *)
|
quigley@15642
|
542 |
|
quigley@15642
|
543 |
(* replace ~ by not here *)
|
quigley@15642
|
544 |
fun change_nots [] = []
|
quigley@15642
|
545 |
| change_nots (x::xs) = if x = "~"
|
quigley@15642
|
546 |
then
|
quigley@15642
|
547 |
["\\", "<", "n", "o", "t", ">"]@(change_nots xs)
|
quigley@15642
|
548 |
else (x::(change_nots xs))
|
quigley@15642
|
549 |
|
quigley@15642
|
550 |
(*
|
quigley@15642
|
551 |
fun clstrs_to_string [] str = str
|
quigley@15642
|
552 |
| clstrs_to_string (x::[]) str = str^x
|
quigley@15642
|
553 |
| clstrs_to_string (x::xs) str = clstrs_to_string xs (str^(x^"; "))
|
quigley@15642
|
554 |
*)
|
quigley@15642
|
555 |
fun clstrs_to_string [] str = implode (change_nots (explode str))
|
quigley@15642
|
556 |
| clstrs_to_string (x::[]) str = implode (change_nots (explode (str^x)))
|
quigley@15642
|
557 |
| clstrs_to_string (x::xs) str = implode (change_nots (explode (clstrs_to_string xs (str^(x^"; ")))))
|
quigley@15642
|
558 |
|
quigley@15642
|
559 |
|
quigley@15642
|
560 |
|
quigley@15642
|
561 |
fun thmvars_to_quantstring [] str = str
|
quigley@15642
|
562 |
| thmvars_to_quantstring (x::[]) str =str^x^". "
|
quigley@15642
|
563 |
| thmvars_to_quantstring (x::xs) str = thmvars_to_quantstring xs (str^(x^" "))
|
quigley@15642
|
564 |
|
quigley@15642
|
565 |
|
paulson@16091
|
566 |
fun clause_strs_to_isar clstrs [] = "\"\\<lbrakk>"^(clstrs_to_string clstrs "")^"\\<rbrakk> \\<Longrightarrow> False\""
|
paulson@16091
|
567 |
| clause_strs_to_isar clstrs thmvars = "\"\\<And>"^(thmvars_to_quantstring thmvars "")^"\\<lbrakk>"^(clstrs_to_string clstrs "")^"\\<rbrakk> \\<Longrightarrow> False\""
|
quigley@15642
|
568 |
|
quigley@15642
|
569 |
fun frees_to_string [] str = implode (change_nots (explode str))
|
quigley@15642
|
570 |
| frees_to_string (x::[]) str = implode (change_nots (explode (str^x)))
|
quigley@15642
|
571 |
| frees_to_string (x::xs) str = implode (change_nots (explode (frees_to_string xs (str^(x^" ")))))
|
quigley@15642
|
572 |
|
quigley@15642
|
573 |
fun frees_to_isar_str [] = ""
|
quigley@15642
|
574 |
| frees_to_isar_str clstrs = (frees_to_string clstrs "")
|
quigley@15642
|
575 |
|
quigley@15642
|
576 |
|
quigley@15642
|
577 |
(***********************************************************************)
|
quigley@15642
|
578 |
(* functions for producing assumptions for the Isabelle ordered axioms *)
|
quigley@15642
|
579 |
(***********************************************************************)
|
quigley@15642
|
580 |
(*val str = "[P%x%xa%xb%]1OrigAxiom()[P x%~ P U%][U%]3OrigAxiom()[P U%~ P x%][U%]5OrigAxiom()[~ P xa%~ P U%][U%]7OrigAxiom()[P U%P xb%][U%]1Axiom()[P x%~ P U%][U%]3Axiom()[P U%~ P x%][U%]5Axiom()[~ P U%~ P xa%][U%]7Axiom()[P U%P xb%][U%]9Factor(5,0,1)[~ P xa%][]10Binary((9,0),(3,0))[~ P x%][]11Binary((10,0),(1,0))[~ P U%][U%]12Factor(7,0,1)[P xb%][]14Binary((11,0),(12,0))[][]";
|
quigley@15642
|
581 |
num, rule, clausestrs, vars*)
|
quigley@15642
|
582 |
|
quigley@15642
|
583 |
|
quigley@15642
|
584 |
(* assume the extra clauses - not used in Spass proof *)
|
quigley@15642
|
585 |
|
quigley@15642
|
586 |
fun is_extraaxiom_step ( num:int,(ExtraAxiom, str, tstr)) = true
|
quigley@15642
|
587 |
| is_extraaxiom_step (num, _) = false
|
quigley@15642
|
588 |
|
quigley@15642
|
589 |
fun get_extraaxioms xs = List.filter (is_extraaxiom_step) ( xs)
|
quigley@15642
|
590 |
|
quigley@15642
|
591 |
fun assume_isar_extraaxiom [] str = str
|
quigley@15642
|
592 |
| assume_isar_extraaxiom ((numb,(step, clstr, thmvars))::xs) str = assume_isar_extraaxiom xs (str^"and cl"^(string_of_int numb)^"': "^(clause_strs_to_isar clstr thmvars)^"\n " )
|
quigley@15642
|
593 |
|
quigley@15642
|
594 |
|
quigley@15642
|
595 |
|
quigley@15642
|
596 |
fun assume_isar_extraaxioms [] = ""
|
quigley@15642
|
597 |
|assume_isar_extraaxioms ((numb,(step, clstrs, thmstrs))::xs) = let val str = "assume cl"^(string_of_int numb)^"': "^(clause_strs_to_isar clstrs thmstrs)^"\n"
|
quigley@15642
|
598 |
in
|
quigley@15642
|
599 |
assume_isar_extraaxiom xs str
|
quigley@15642
|
600 |
end
|
quigley@15642
|
601 |
|
quigley@15642
|
602 |
(* assume the Isabelle ordered clauses *)
|
quigley@15642
|
603 |
|
quigley@15642
|
604 |
fun is_origaxiom_step ( num:int,(OrigAxiom, str, tstr)) = true
|
quigley@15642
|
605 |
| is_origaxiom_step (num, _) = false
|
quigley@15642
|
606 |
|
quigley@15642
|
607 |
fun get_origaxioms xs = List.filter (is_origaxiom_step) ( xs)
|
quigley@15642
|
608 |
|
quigley@15642
|
609 |
fun assume_isar_origaxiom [] str = str
|
quigley@15642
|
610 |
| assume_isar_origaxiom ((numb,(step, clstr, thmvars))::xs) str = assume_isar_origaxiom xs (str^"and cl"^(string_of_int numb)^"': "^(clause_strs_to_isar clstr thmvars)^"\n " )
|
quigley@15642
|
611 |
|
quigley@15642
|
612 |
|
quigley@15642
|
613 |
|
quigley@15642
|
614 |
fun assume_isar_origaxioms ((numb,(step, clstrs, thmstrs))::xs) = let val str = "assume cl"^(string_of_int numb)^"': "^(clause_strs_to_isar clstrs thmstrs)^"\n"
|
quigley@15642
|
615 |
in
|
quigley@15642
|
616 |
assume_isar_origaxiom xs str
|
quigley@15642
|
617 |
end
|
quigley@15642
|
618 |
|
quigley@15642
|
619 |
|
quigley@15642
|
620 |
|
quigley@15642
|
621 |
fun is_axiom_step ( num:int,(Axiom, str, tstr)) = true
|
quigley@15642
|
622 |
| is_axiom_step (num, _) = false
|
quigley@15642
|
623 |
|
quigley@15642
|
624 |
fun get_axioms xs = List.filter (is_axiom_step) ( xs)
|
quigley@15642
|
625 |
|
quigley@15642
|
626 |
fun have_isar_axiomline (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
|
quigley@15642
|
627 |
|
quigley@15642
|
628 |
fun by_isar_axiomline (numb,(step, clstrs, thmstrs))="by (rule cl"^ (string_of_int numb)^"') \n"
|
quigley@15642
|
629 |
|
quigley@15642
|
630 |
|
quigley@15642
|
631 |
fun isar_axiomline (numb, (step, clstrs, thmstrs)) = (have_isar_axiomline (numb,(step,clstrs, thmstrs )))^( by_isar_axiomline(numb,(step,clstrs, thmstrs )) )
|
quigley@15642
|
632 |
|
quigley@15642
|
633 |
|
quigley@15642
|
634 |
fun isar_axiomlines [] str = str
|
quigley@15642
|
635 |
| isar_axiomlines (x::xs) str = isar_axiomlines xs (str^(isar_axiomline x))
|
quigley@15642
|
636 |
|
quigley@15642
|
637 |
|
quigley@15642
|
638 |
fun have_isar_line (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
|
quigley@16357
|
639 |
(*FIX: ask Larry to add and mrr attribute *)
|
quigley@15642
|
640 |
|
paulson@16091
|
641 |
fun by_isar_line ((Binary ((a,b), (c,d)))) =
|
paulson@16091
|
642 |
"by(rule cl"^
|
paulson@16091
|
643 |
(string_of_int a)^" [binary "^(string_of_int b)^" cl"^
|
paulson@16091
|
644 |
(string_of_int c)^" "^(string_of_int d)^"])\n"
|
quigley@16357
|
645 |
|by_isar_line ((MRR ((a,b), (c,d)))) =
|
quigley@16357
|
646 |
"by(rule cl"^
|
quigley@16357
|
647 |
(string_of_int a)^" [binary "^(string_of_int b)^" cl"^
|
quigley@16357
|
648 |
(string_of_int c)^" "^(string_of_int d)^"])\n"
|
paulson@16091
|
649 |
| by_isar_line ( (Para ((a,b), (c,d)))) =
|
paulson@16091
|
650 |
"by (rule cl"^
|
paulson@16091
|
651 |
(string_of_int a)^" [paramod "^(string_of_int b)^" cl"^
|
paulson@16091
|
652 |
(string_of_int c)^" "^(string_of_int d)^"])\n"
|
paulson@16091
|
653 |
| by_isar_line ((Factor ((a,b,c)))) =
|
paulson@16091
|
654 |
"by (rule cl"^(string_of_int a)^" [factor "^(string_of_int b)^" "^
|
paulson@16091
|
655 |
(string_of_int c)^" ])\n"
|
quigley@16548
|
656 |
(*| by_isar_line ( (Rewrite ((a,b),(c,d)))) =
|
paulson@16091
|
657 |
"by (rule cl"^(string_of_int a)^" [demod "^(string_of_int b)^" "^
|
quigley@16548
|
658 |
(string_of_int c)^" "^(string_of_int d)^" ])\n"*)
|
paulson@16091
|
659 |
| by_isar_line ( (Obvious ((a,b)))) =
|
paulson@16091
|
660 |
"by (rule cl"^(string_of_int a)^" [obvious "^(string_of_int b)^" ])\n"
|
quigley@15642
|
661 |
|
quigley@15642
|
662 |
fun isar_line (numb, (step, clstrs, thmstrs)) = (have_isar_line (numb,(step,clstrs, thmstrs )))^( by_isar_line step)
|
quigley@15642
|
663 |
|
quigley@15642
|
664 |
|
quigley@15642
|
665 |
fun isar_lines [] str = str
|
quigley@15642
|
666 |
| isar_lines (x::xs) str = isar_lines xs (str^(isar_line x))
|
quigley@15642
|
667 |
|
quigley@15642
|
668 |
fun last_isar_line (numb,( step, clstrs,thmstrs)) = "show \"False\"\n"^(by_isar_line step)
|
quigley@15642
|
669 |
|
quigley@15642
|
670 |
|
paulson@16091
|
671 |
fun to_isar_proof (frees, xs, goalstring) =
|
paulson@16091
|
672 |
let val extraaxioms = get_extraaxioms xs
|
paulson@16091
|
673 |
val extraax_num = length extraaxioms
|
paulson@16091
|
674 |
val origaxioms_and_steps = Library.drop (extraax_num, xs)
|
paulson@16091
|
675 |
|
paulson@16091
|
676 |
val origaxioms = get_origaxioms origaxioms_and_steps
|
paulson@16091
|
677 |
val origax_num = length origaxioms
|
paulson@16091
|
678 |
val axioms_and_steps = Library.drop (origax_num + extraax_num, xs)
|
paulson@16091
|
679 |
val axioms = get_axioms axioms_and_steps
|
paulson@16091
|
680 |
|
paulson@16091
|
681 |
val steps = Library.drop (origax_num, axioms_and_steps)
|
paulson@16091
|
682 |
val firststeps = ReconOrderClauses.butlast steps
|
paulson@17312
|
683 |
val laststep = List.last steps
|
paulson@16091
|
684 |
val goalstring = implode(ReconOrderClauses.butlast(explode goalstring))
|
paulson@16091
|
685 |
|
paulson@16091
|
686 |
val isar_proof =
|
paulson@16091
|
687 |
("show \""^goalstring^"\"\n")^
|
paulson@16091
|
688 |
("proof (rule ccontr,skolemize, make_clauses) \n")^
|
paulson@16091
|
689 |
("fix "^(frees_to_isar_str frees)^"\n")^
|
paulson@16091
|
690 |
(assume_isar_extraaxioms extraaxioms)^
|
paulson@16091
|
691 |
(assume_isar_origaxioms origaxioms)^
|
paulson@16091
|
692 |
(isar_axiomlines axioms "")^
|
paulson@16091
|
693 |
(isar_lines firststeps "")^
|
paulson@16091
|
694 |
(last_isar_line laststep)^
|
paulson@16091
|
695 |
("qed")
|
paulson@16905
|
696 |
val _ = File.write (File.tmp_path (Path.basic "isar_proof_file")) isar_proof
|
paulson@16091
|
697 |
in
|
paulson@16091
|
698 |
isar_proof
|
paulson@16091
|
699 |
end;
|
quigley@15642
|
700 |
|
quigley@15642
|
701 |
(* get fix vars from axioms - all Frees *)
|
quigley@15642
|
702 |
(* check each clause for meta-vars and /\ over them at each step*)
|
quigley@15642
|
703 |
|
quigley@15642
|
704 |
(*******************************************************)
|
quigley@15642
|
705 |
(* This assumes the thm list "numcls" is still there *)
|
quigley@15642
|
706 |
(* In reality, should probably label it with an *)
|
quigley@15642
|
707 |
(* ID number identifying the subgoal. This could *)
|
quigley@15642
|
708 |
(* be passed over to the watcher, e.g. numcls25 *)
|
quigley@15642
|
709 |
(*******************************************************)
|
quigley@15642
|
710 |
|
paulson@17315
|
711 |
fun apply_res_thm str goalstring =
|
paulson@17315
|
712 |
let val tokens = #1 (lex str);
|
paulson@17315
|
713 |
val _ = File.append (File.tmp_path (Path.basic "apply_res_1"))
|
paulson@17315
|
714 |
("str is: "^str^" goalstr is: "^goalstring^"\n")
|
paulson@17315
|
715 |
val (frees,recon_steps) = parse_step tokens
|
paulson@17315
|
716 |
val isar_str = to_isar_proof (frees, recon_steps, goalstring)
|
paulson@17315
|
717 |
val foo = File.write (File.tmp_path (Path.basic "apply_res_2")) isar_str
|
paulson@17315
|
718 |
in
|
paulson@17315
|
719 |
Pretty.writeln(Pretty.str isar_str)
|
paulson@17315
|
720 |
end
|
quigley@15642
|
721 |
|
paulson@15684
|
722 |
end;
|