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