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