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