src/HOL/Tools/ATP/recon_transfer_proof.ML
author quigley
Fri Sep 02 21:29:33 2005 +0200 (2005-09-02)
changeset 17235 8e55ad29b690
parent 17122 278eb6251dc0
child 17306 5cde710a8a23
permissions -rw-r--r--
Added ECommunication.ML and modified res_atp.ML, Reconstruction.thy, and
recon_transfer_proof.ML to deal with the E theorem prover.
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@17235
   220
fun get_axiom_names_E proofstr thms (clause_arr:(ResClause.clause * thm) Array.array) num_of_clauses  =
quigley@17235
   221
   let 
quigley@17235
   222
     (* not sure why this is necessary again, but seems to be *)
quigley@17235
   223
      val _ = (print_mode := (Library.gen_rems (op =) (! print_mode, ["xsymbols", "symbols"])))
quigley@17235
   224
      val step_nums =get_linenums proofstr
quigley@17235
   225
  
quigley@17235
   226
     (***********************************************)
quigley@17235
   227
     (* here need to add the clauses from clause_arr*)
quigley@17235
   228
     (***********************************************)
quigley@17235
   229
  
quigley@17235
   230
      val (clasimp_names_cls) = get_clasimp_cls clause_arr num_of_clauses step_nums 
quigley@17235
   231
      val clasimp_names = map (#1 o ResClause.clause_info o #1) clasimp_names_cls
quigley@17235
   232
  
quigley@17235
   233
      val _ = File.write (File.tmp_path (Path.basic "clasimp_names"))                                                               
quigley@17235
   234
                         (concat clasimp_names)
quigley@17235
   235
      val _ = (print_mode := (["xsymbols", "symbols"] @ ! print_mode))
quigley@17235
   236
   in
quigley@17235
   237
      clasimp_names
quigley@17235
   238
   end
quigley@17235
   239
quigley@16357
   240
(***********************************************)
quigley@16357
   241
(* get axioms for reconstruction               *)
quigley@16357
   242
(***********************************************)
quigley@16156
   243
fun numclstr (vars, []) str = str
paulson@16157
   244
|   numclstr ( vars, ((num, thm)::rest)) str =
paulson@16157
   245
      let val newstr = str^(string_of_int num)^" "^(string_of_thm thm)^" "
paulson@16157
   246
      in
paulson@16157
   247
        numclstr  (vars,rest) newstr
paulson@16157
   248
      end
quigley@15919
   249
paulson@16157
   250
fun addvars c (a,b)  = (a,b,c)
quigley@15919
   251
quigley@15919
   252
 fun get_axioms_used proof_steps thms clause_arr num_of_clauses  =
paulson@16061
   253
     let 
paulson@16061
   254
	val _=  (print_mode := (Library.gen_rems (op =) (! print_mode, ["xsymbols", "symbols"])))
paulson@16061
   255
	val axioms = get_init_axioms proof_steps
paulson@16061
   256
	val step_nums = get_step_nums axioms []
quigley@15919
   257
paulson@16061
   258
       (***********************************************)
paulson@16061
   259
       (* here need to add the clauses from clause_arr*)
paulson@16061
   260
       (***********************************************)
quigley@15919
   261
paulson@16061
   262
       (* val clasimp_names_cls = get_clasimp_cls clause_arr   num_of_clauses step_nums   
paulson@16061
   263
	val clasimp_names = map #1 clasimp_names_cls
paulson@16061
   264
	val clasimp_cls = map #2 clasimp_names_cls
paulson@16905
   265
	val _ = TextIO.openAppend(File.platform_path(File.tmp_path (Path.basic "clasimp_names")))                                                            val clasimp_namestr = concat clasimp_names                            
paulson@16061
   266
	 val _ = TextIO.output (outfile,clasimp_namestr)
paulson@16061
   267
	 
paulson@16061
   268
	 val _ =  TextIO.closeOut outfile
quigley@15919
   269
*)
quigley@15919
   270
paulson@16061
   271
	val clauses =(*(clasimp_cls)@*)( make_clauses thms)
paulson@16061
   272
	
paulson@16061
   273
	val vars = map thm_vars clauses
paulson@16061
   274
       
paulson@16061
   275
	val distvars = distinct (fold append vars [])
paulson@16061
   276
	val clause_terms = map prop_of clauses  
paulson@16061
   277
	val clause_frees = List.concat (map term_frees clause_terms)
quigley@15642
   278
paulson@16061
   279
	val frees = map lit_string_with_nums clause_frees;
quigley@15642
   280
paulson@16061
   281
	val distfrees = distinct frees
quigley@15642
   282
paulson@16061
   283
	val metas = map Meson.make_meta_clause clauses
paulson@16061
   284
	val ax_strs = map #3 axioms
quigley@15642
   285
paulson@16061
   286
	(* literals of -all- axioms, not just those used by spass *)
paulson@16061
   287
	val meta_strs = map ReconOrderClauses.get_meta_lits metas
paulson@16061
   288
       
paulson@16061
   289
	val metas_and_strs = ListPair.zip (metas,meta_strs)
paulson@16905
   290
	val _ = File.write(File.tmp_path (Path.basic "foo_clauses")) (onestr ax_strs)
paulson@16905
   291
	val _ = File.write(File.tmp_path (Path.basic "foo_metastrs")) (onestr meta_strs)
quigley@15642
   292
paulson@16061
   293
	(* get list of axioms as thms with their variables *)
quigley@15642
   294
paulson@16061
   295
	val ax_metas = get_assoc_snds ax_strs metas_and_strs []
paulson@16061
   296
	val ax_vars = map thm_vars ax_metas
paulson@16061
   297
	val ax_with_vars = ListPair.zip (ax_metas,ax_vars)
quigley@15642
   298
paulson@16061
   299
	(* get list of extra axioms as thms with their variables *)
paulson@16061
   300
	val extra_metas = add_if_not_inlist metas ax_metas []
paulson@16061
   301
	val extra_vars = map thm_vars extra_metas
paulson@16061
   302
	val extra_with_vars = if (not (extra_metas = []) ) 
paulson@16905
   303
			      then ListPair.zip (extra_metas,extra_vars)
paulson@16905
   304
			      else []
paulson@16061
   305
       (* val _=  (print_mode := (Library.gen_rems (op =) (! print_mode, ["xsymbols", "symbols"])))
paulson@16905
   306
       val _ = TextIO.openOut(File.platform_path(File.tmp_path (Path.basic "foo_metas")))
quigley@15642
   307
paulson@16061
   308
       val _ = TextIO.output (outfile, ((thmstrings ax_metas "")))
paulson@16061
   309
       val _ =  TextIO.closeOut outfile
wenzelm@16259
   310
      val foo_metas =  File.platform_path(File.tmp_path (Path.basic "foo_metas"))
wenzelm@16259
   311
      val foo_metas2 =   File.platform_path(File.tmp_path (Path.basic "foo_metas2"))
paulson@16061
   312
	val execperl = Unix.execute("/usr/bin/perl", ["remchars.pl", "  <", foo_metas, "  >", foo_metas2])
wenzelm@16259
   313
     val infile = TextIO.openIn(File.platform_path(File.tmp_path (Path.basic "foo_metas2")))
paulson@16061
   314
    val ax_metas_str = TextIO.inputLine (infile)
paulson@16061
   315
    val _ = TextIO.closeIn infile
paulson@16061
   316
       val _= (print_mode := (["xsymbols", "symbols"] @ ! print_mode))*)
paulson@16061
   317
     in
paulson@16061
   318
	(distfrees,distvars, extra_with_vars,ax_with_vars, (*clasimp_names*)(ListPair.zip (step_nums,ax_metas)))
paulson@16905
   319
     end;
paulson@16905
   320
                                            
quigley@15642
   321
quigley@15642
   322
(*********************************************************************)
quigley@15642
   323
(* Pass in spass string of proof and string version of isabelle goal *)
quigley@15642
   324
(* Get out reconstruction steps as a string to be sent to Isabelle   *)
quigley@15642
   325
(*********************************************************************)
quigley@15642
   326
quigley@15642
   327
paulson@17122
   328
fun rules_to_string [] = "NONE"
paulson@17122
   329
  | rules_to_string xs = "[" ^ space_implode ", " xs ^ "]"
quigley@16156
   330
                                  
quigley@15642
   331
quigley@16156
   332
val dummy_tac = PRIMITIVE(fn thm => thm );
quigley@15642
   333
quigley@15642
   334
quigley@16357
   335
(*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
   336
\1279[0:Inp] ||  -> equal(const_Nat_Osize(tconst_fun(tconst_List_Olist(U),tconst_nat),const_List_Olist_ONil),const_0)**.\
quigley@16357
   337
\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
   338
\1453[0:Rew:1279.0,1430.0,1242.0,1430.0,1279.0,1430.0] || equal(const_0,const_0)* -> .\
quigley@16357
   339
\1454[0:Obv:1453.0] ||  -> .";*)
quigley@16357
   340
paulson@16905
   341
fun subst_for a b = String.translate (fn c => str (if c=a then b else c));
quigley@16357
   342
paulson@16905
   343
val remove_linebreaks = subst_for #"\n" #"\t";
paulson@16905
   344
val restore_linebreaks = subst_for #"\t" #"\n";
quigley@16357
   345
quigley@16357
   346
fun spassString_to_lemmaString proofstr thmstring goalstring toParent ppid thms clause_arr  num_of_clauses  = 
paulson@16905
   347
  let val _ = File.append(File.tmp_path (Path.basic"thmstringfile"))
paulson@16905
   348
                  ("thmstring is: "^thmstring^"\n proofstr is: "^proofstr^"\n goalstr is: "^goalstring^" \n  num of clauses is: "^(string_of_int num_of_clauses))
quigley@16357
   349
paulson@16905
   350
     (***********************************)
paulson@16905
   351
     (* parse spass proof into datatype *)
paulson@16905
   352
     (***********************************)
paulson@16905
   353
      val tokens = #1(lex proofstr)
paulson@16905
   354
      val proof_steps1 = parse tokens
paulson@16905
   355
      val proof_steps = just_change_space proof_steps1
paulson@16905
   356
      val _ = File.write (File.tmp_path (Path.basic "foo_parse")) ("Did parsing on "^proofstr)
paulson@16905
   357
      val _ = File.write(File.tmp_path (Path.basic "foo_thmstring_at_parse"))
paulson@16905
   358
                        ("Parsing for thmstring: "^thmstring)
paulson@16905
   359
      (************************************)
paulson@16905
   360
      (* recreate original subgoal as thm *)
paulson@16905
   361
      (************************************)
paulson@16905
   362
    
paulson@16905
   363
      (* get axioms as correctly numbered clauses w.r.t. the Spass proof *)
paulson@16905
   364
      (* need to get prems_of thm, then get right one of the prems, relating to whichever*)
paulson@16905
   365
      (* subgoal this is, and turn it into meta_clauses *)
paulson@16905
   366
      (* should prob add array and table here, so that we can get axioms*)
paulson@16905
   367
      (* produced from the clasimpset rather than the problem *)
quigley@16156
   368
paulson@16905
   369
      val (axiom_names) = get_axiom_names proof_steps  thms clause_arr  num_of_clauses
paulson@17122
   370
      val ax_str = "Rules from clasimpset used in proof found by SPASS: " ^ 
paulson@17122
   371
                   rules_to_string axiom_names 
paulson@16905
   372
      val _ = File.append(File.tmp_path (Path.basic "reconstrfile"))
paulson@16905
   373
                         ("reconstring is: "^ax_str^"  "^goalstring)       
paulson@16905
   374
  in 
paulson@16905
   375
       TextIO.output (toParent, ax_str^"\n");
paulson@16905
   376
       TextIO.flushOut toParent;
paulson@16905
   377
       TextIO.output (toParent, "goalstring: "^goalstring^"\n");
paulson@16905
   378
       TextIO.flushOut toParent;
paulson@16905
   379
       TextIO.output (toParent, "thmstring: "^thmstring^"\n");
paulson@16905
   380
       TextIO.flushOut toParent;
quigley@16156
   381
paulson@16905
   382
       Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
paulson@16905
   383
      (* Attempt to prevent several signals from turning up simultaneously *)
paulson@16905
   384
       Posix.Process.sleep(Time.fromSeconds 1) ; dummy_tac
paulson@16905
   385
  end
paulson@16905
   386
  handle _ => 
paulson@16905
   387
  let val _ = File.write(File.tmp_path (Path.basic "foo_handler")) "In exception handler"
paulson@16905
   388
  in 
paulson@16905
   389
     TextIO.output (toParent,"Proof found but parsing failed for resolution proof: "^(remove_linebreaks proofstr)^"\n" );
paulson@16905
   390
      TextIO.flushOut toParent;
paulson@16905
   391
       TextIO.output (toParent, (remove_linebreaks thmstring)^"\n");
paulson@16905
   392
       TextIO.flushOut toParent;
paulson@16905
   393
       TextIO.output (toParent, ( (remove_linebreaks goalstring)^"\n"));
paulson@16905
   394
       TextIO.flushOut toParent;
paulson@16905
   395
      Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
paulson@16905
   396
      (* Attempt to prevent several signals from turning up simultaneously *)
paulson@16905
   397
      Posix.Process.sleep(Time.fromSeconds 1) ;dummy_tac
paulson@16905
   398
  end
quigley@16478
   399
quigley@16478
   400
quigley@16478
   401
fun vampString_to_lemmaString proofstr thmstring goalstring toParent ppid thms clause_arr  num_of_clauses  = 
paulson@16905
   402
 let val _ = File.append(File.tmp_path (Path.basic "thmstringfile"))
paulson@16905
   403
               (" thmstring is: "^thmstring^"proofstr is: "^proofstr^
paulson@16905
   404
                "goalstr is: "^goalstring^" num of clauses is: "^
paulson@16905
   405
                (string_of_int num_of_clauses))
paulson@16905
   406
paulson@16905
   407
    (***********************************)
paulson@16905
   408
    (* get vampire axiom names         *)
paulson@16905
   409
    (***********************************)
quigley@16478
   410
paulson@16905
   411
     val (axiom_names) = get_axiom_names_vamp proofstr  thms clause_arr  num_of_clauses
paulson@17122
   412
     val ax_str = "Rules from clasimpset used in proof found by Vampire: " ^
paulson@17122
   413
                  rules_to_string axiom_names
paulson@16905
   414
    in 
paulson@16905
   415
	 File.append(File.tmp_path (Path.basic "reconstrfile")) ("reconstring is: "^ax_str^"  "^goalstring);
paulson@16905
   416
         TextIO.output (toParent, ax_str^"\n");
paulson@16905
   417
	 TextIO.flushOut toParent;
paulson@16905
   418
	 TextIO.output (toParent, "goalstring: "^goalstring^"\n");
paulson@16905
   419
	 TextIO.flushOut toParent;
paulson@16905
   420
	 TextIO.output (toParent, "thmstring: "^thmstring^"\n");
paulson@16905
   421
	 TextIO.flushOut toParent;
quigley@16478
   422
paulson@16905
   423
	 Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
paulson@16905
   424
	(* Attempt to prevent several signals from turning up simultaneously *)
paulson@16905
   425
	 Posix.Process.sleep(Time.fromSeconds 1) ; dummy_tac
paulson@16905
   426
    end
paulson@16905
   427
    handle _ => 
paulson@16905
   428
    let val _ = File.write(File.tmp_path (Path.basic "foo_handler")) "In exception handler"
paulson@16905
   429
    in 
paulson@16905
   430
	TextIO.output (toParent,"Proof found by Vampire but translation failed for resolution proof: "^(remove_linebreaks proofstr) );
paulson@16905
   431
	TextIO.flushOut toParent;
paulson@16905
   432
	 TextIO.output (toParent, thmstring^"\n");
paulson@16905
   433
	 TextIO.flushOut toParent;
paulson@16905
   434
	 TextIO.output (toParent, goalstring^"\n");
paulson@16905
   435
	 TextIO.flushOut toParent;
paulson@16905
   436
	Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
paulson@16905
   437
	(* Attempt to prevent several signals from turning up simultaneously *)
paulson@16905
   438
	Posix.Process.sleep(Time.fromSeconds 1) ;dummy_tac
paulson@16905
   439
    end;
quigley@16357
   440
quigley@16357
   441
quigley@17235
   442
fun EString_to_lemmaString proofstr thmstring goalstring toParent ppid thms clause_arr  num_of_clauses  = 
quigley@17235
   443
 let val _ = File.append(File.tmp_path (Path.basic "thmstringfile"))
quigley@17235
   444
               (" thmstring is: "^thmstring^"proofstr is: "^proofstr^
quigley@17235
   445
                "goalstr is: "^goalstring^" num of clauses is: "^
quigley@17235
   446
                (string_of_int num_of_clauses))
quigley@17235
   447
quigley@17235
   448
    (***********************************)
quigley@17235
   449
    (* get vampire axiom names         *)
quigley@17235
   450
    (***********************************)
quigley@17235
   451
quigley@17235
   452
     val (axiom_names) = get_axiom_names_E proofstr  thms clause_arr  num_of_clauses
quigley@17235
   453
     val ax_str = "Rules from clasimpset used in proof found by E: " ^
quigley@17235
   454
                  rules_to_string axiom_names
quigley@17235
   455
    in 
quigley@17235
   456
	 File.append(File.tmp_path (Path.basic "reconstrfile")) ("reconstring is: "^ax_str^"  "^goalstring);
quigley@17235
   457
         TextIO.output (toParent, ax_str^"\n");
quigley@17235
   458
	 TextIO.flushOut toParent;
quigley@17235
   459
	 TextIO.output (toParent, "goalstring: "^goalstring^"\n");
quigley@17235
   460
	 TextIO.flushOut toParent;
quigley@17235
   461
	 TextIO.output (toParent, "thmstring: "^thmstring^"\n");
quigley@17235
   462
	 TextIO.flushOut toParent;
quigley@17235
   463
quigley@17235
   464
	 Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
quigley@17235
   465
	(* Attempt to prevent several signals from turning up simultaneously *)
quigley@17235
   466
	 Posix.Process.sleep(Time.fromSeconds 1) ; dummy_tac
quigley@17235
   467
    end
quigley@17235
   468
    handle _ => 
quigley@17235
   469
    let val _ = File.write(File.tmp_path (Path.basic "foo_handler")) "In exception handler"
quigley@17235
   470
    in 
quigley@17235
   471
	TextIO.output (toParent,"Proof found by Vampire but translation failed for resolution proof: "^(remove_linebreaks proofstr) );
quigley@17235
   472
	TextIO.flushOut toParent;
quigley@17235
   473
	 TextIO.output (toParent, thmstring^"\n");
quigley@17235
   474
	 TextIO.flushOut toParent;
quigley@17235
   475
	 TextIO.output (toParent, goalstring^"\n");
quigley@17235
   476
	 TextIO.flushOut toParent;
quigley@17235
   477
	Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
quigley@17235
   478
	(* Attempt to prevent several signals from turning up simultaneously *)
quigley@17235
   479
	Posix.Process.sleep(Time.fromSeconds 1) ;dummy_tac
quigley@17235
   480
    end;
quigley@17235
   481
quigley@16357
   482
(* val proofstr = "1582[0:Inp] || -> v_P*.\
quigley@16357
   483
                 \1583[0:Inp] || v_P* -> .\
quigley@16357
   484
		 \1584[0:MRR:1583.0,1582.0] || -> ."; *)
quigley@15642
   485
quigley@15919
   486
fun spassString_to_reconString proofstr thmstring goalstring toParent ppid thms clause_arr  num_of_clauses  = 
paulson@16905
   487
  let val _ = File.write(File.tmp_path (Path.basic "thmstringfile")) 
paulson@16905
   488
                 (" thmstring is: "^thmstring^"proofstr is: "^proofstr)
paulson@16905
   489
      val tokens = #1(lex proofstr)
quigley@15782
   490
paulson@16905
   491
  (***********************************)
paulson@16905
   492
  (* parse spass proof into datatype *)
paulson@16905
   493
  (***********************************)
paulson@16905
   494
      val proof_steps1 = parse tokens
paulson@16905
   495
      val proof_steps = just_change_space proof_steps1
quigley@15919
   496
paulson@16905
   497
      val _ = File.write (File.tmp_path (Path.basic "foo_parse"))
paulson@16905
   498
                      ("Did parsing on "^proofstr)
paulson@16905
   499
    
paulson@16905
   500
      val _ = File.write (File.tmp_path (Path.basic "foo_thmstring_at_parse"))
paulson@16905
   501
                                ("Parsing for thmstring: "^thmstring)
paulson@16905
   502
  (************************************)
paulson@16905
   503
  (* recreate original subgoal as thm *)
paulson@16905
   504
  (************************************)
paulson@16905
   505
      (* get axioms as correctly numbered clauses w.r.t. the Spass proof *)
paulson@16905
   506
      (* need to get prems_of thm, then get right one of the prems, relating to whichever*)
paulson@16905
   507
      (* subgoal this is, and turn it into meta_clauses *)
paulson@16905
   508
      (* should prob add array and table here, so that we can get axioms*)
paulson@16905
   509
      (* produced from the clasimpset rather than the problem *)
paulson@16905
   510
      val (frees,vars,extra_with_vars ,ax_with_vars,numcls) = get_axioms_used proof_steps  thms clause_arr  num_of_clauses
paulson@16905
   511
      
paulson@16905
   512
      (*val numcls_string = numclstr ( vars, numcls) ""*)
paulson@16905
   513
      val _ = File.write (File.tmp_path (Path.basic "foo_axiom")) "got axioms"
paulson@16061
   514
	
paulson@16905
   515
  (************************************)
paulson@16905
   516
  (* translate proof                  *)
paulson@16905
   517
  (************************************)
paulson@16905
   518
      val _ = File.write (File.tmp_path (Path.basic "foo_steps"))                                                                           
paulson@16905
   519
                       ("about to translate proof, steps: "
paulson@16905
   520
                       ^(init_proofsteps_to_string proof_steps ""))
paulson@16905
   521
      val (newthm,proof) = translate_proof numcls  proof_steps vars
paulson@16905
   522
      val _ = File.write (File.tmp_path (Path.basic "foo_steps2"))                                                                       
paulson@16905
   523
                       ("translated proof, steps: "^(init_proofsteps_to_string proof_steps ""))
paulson@16905
   524
  (***************************************************)
paulson@16905
   525
  (* transfer necessary steps as strings to Isabelle *)
paulson@16905
   526
  (***************************************************)
paulson@16905
   527
      (* turn the proof into a string *)
paulson@16905
   528
      val reconProofStr = proofs_to_string proof ""
paulson@16905
   529
      (* do the bit for the Isabelle ordered axioms at the top *)
paulson@16905
   530
      val ax_nums = map #1 numcls
paulson@16905
   531
      val ax_strs = map ReconOrderClauses.get_meta_lits_bracket (map #2 numcls)
paulson@16905
   532
      val numcls_strs = ListPair.zip (ax_nums,ax_strs)
paulson@16905
   533
      val num_cls_vars =  map (addvars vars) numcls_strs;
paulson@16905
   534
      val reconIsaAxStr = origAxs_to_string (ListPair.zip (ax_nums,ax_with_vars)) ""
paulson@16905
   535
      
paulson@16905
   536
      val extra_nums = if (not (extra_with_vars = [])) then (1 upto (length extra_with_vars))
paulson@16905
   537
                       else []
paulson@16905
   538
      val reconExtraAxStr = extraAxs_to_string ( ListPair.zip (extra_nums,extra_with_vars)) ""
paulson@16905
   539
      val frees_str = "["^(thmvars_to_string frees "")^"]"
paulson@16905
   540
      val _ = File.write (File.tmp_path (Path.basic "reconstringfile"))
paulson@16905
   541
                          (frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr)
paulson@16905
   542
      val reconstr = (frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr)
paulson@16905
   543
  in 
paulson@16905
   544
       TextIO.output (toParent, reconstr^"\n");
paulson@16905
   545
       TextIO.flushOut toParent;
paulson@16905
   546
       TextIO.output (toParent, thmstring^"\n");
paulson@16905
   547
       TextIO.flushOut toParent;
paulson@16905
   548
       TextIO.output (toParent, goalstring^"\n");
paulson@16905
   549
       TextIO.flushOut toParent;
quigley@15642
   550
paulson@16905
   551
       Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
paulson@16905
   552
      (* Attempt to prevent several signals from turning up simultaneously *)
paulson@16905
   553
       Posix.Process.sleep(Time.fromSeconds 1) ; dummy_tac
paulson@16905
   554
  end
paulson@16905
   555
  handle _ => 
paulson@16905
   556
  let val _ = File.write(File.tmp_path (Path.basic "foo_handler")) "In exception handler"
paulson@16905
   557
  in 
paulson@16905
   558
       TextIO.output (toParent,"Proof found but translation failed for resolution proof:"^(remove_linebreaks proofstr) ^"\n");
paulson@16905
   559
      TextIO.flushOut toParent;
paulson@16905
   560
    TextIO.output (toParent, thmstring^"\n");
paulson@16905
   561
       TextIO.flushOut toParent;
paulson@16905
   562
       TextIO.output (toParent, goalstring^"\n");
paulson@16905
   563
       TextIO.flushOut toParent;
paulson@16905
   564
      Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
paulson@16905
   565
      (* Attempt to prevent several signals from turning up simultaneously *)
paulson@16905
   566
      Posix.Process.sleep(Time.fromSeconds 1) ;dummy_tac
paulson@16905
   567
  end
quigley@15642
   568
quigley@15642
   569
quigley@15642
   570
(**********************************************************************************)
quigley@15642
   571
(* At other end, want to turn back into datatype so can apply reconstruct_proof.  *)
quigley@15642
   572
(* This will be done by the signal handler                                        *)
quigley@15642
   573
(**********************************************************************************)
quigley@15642
   574
quigley@15642
   575
(* Parse in the string version of the proof steps for reconstruction *)
quigley@15642
   576
(* Isar format: cl1 [BINARY 0 cl2 0];cl1 [PARAMOD 0 cl2 0]; cl1 [DEMOD 0 cl2];cl1 [FACTOR 1 2];*)
quigley@15642
   577
quigley@15642
   578
quigley@15642
   579
 val term_numstep =
quigley@15642
   580
        (number ++ (a (Other ",")) ++ number) >> (fn (a, (_, c)) => (a, c))
quigley@15642
   581
quigley@15642
   582
val extraaxiomstep = (a (Word "ExtraAxiom"))++ (a (Other "(")) ++(a (Other ")"))
quigley@15642
   583
            >> (fn (_) => ExtraAxiom)
quigley@15642
   584
quigley@15642
   585
quigley@15642
   586
quigley@15642
   587
val origaxiomstep = (a (Word "OrigAxiom"))++ (a (Other "(")) ++(a (Other ")"))
quigley@15642
   588
            >> (fn (_) => OrigAxiom)
quigley@15642
   589
quigley@15642
   590
quigley@15642
   591
 val axiomstep = (a (Word "Axiom"))++ (a (Other "(")) ++(a (Other ")"))
quigley@15642
   592
            >> (fn (_) => Axiom)
quigley@15642
   593
     
quigley@15642
   594
quigley@15642
   595
quigley@15642
   596
      
quigley@15642
   597
 val binarystep = (a (Word "Binary")) ++ (a (Other "(")) ++ (a (Other "(")) 
quigley@15642
   598
                   ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
quigley@15642
   599
                   ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
quigley@15642
   600
            >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Binary (c,e))
quigley@15642
   601
      
quigley@15642
   602
quigley@15642
   603
 val parastep = (a (Word "Para")) ++ (a (Other "(")) ++ (a (Other "(")) 
quigley@15642
   604
                   ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
quigley@15642
   605
                   ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
quigley@15642
   606
            >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Para(c, e))
quigley@15642
   607
      
quigley@15642
   608
 val mrrstep = (a (Word "MRR")) ++ (a (Other "(")) ++ (a (Other "(")) 
quigley@15642
   609
                   ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
quigley@15642
   610
                   ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
quigley@15642
   611
            >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => MRR(c, e))
quigley@15642
   612
      
quigley@15642
   613
quigley@15642
   614
 val factorstep = (a (Word "Factor")) ++ (a (Other "("))
quigley@15642
   615
                    ++ number ++ (a (Other ","))
quigley@15642
   616
                       ++ number ++ (a (Other ","))
quigley@15642
   617
                       ++ number ++  (a (Other ")"))
quigley@15642
   618
                   
quigley@15642
   619
            >> (fn (_, (_, (c, (_, (e,(_,(f,_))))))) =>  Factor (c,e,f))
quigley@15642
   620
quigley@15642
   621
quigley@16548
   622
(*val rewritestep = (a (Word "Rewrite"))  ++ (a (Other "(")) ++ (a (Other "(")) 
quigley@15642
   623
                   ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
quigley@15642
   624
                   ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
quigley@16548
   625
            >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Rewrite (c,e))*)
quigley@15642
   626
quigley@15642
   627
val obviousstep = (a (Word "Obvious")) ++ (a (Other "(")) 
quigley@15642
   628
                   ++ term_numstep  ++ (a (Other ")")) 
quigley@15642
   629
            >> (fn (_, (_, (c,_))) => Obvious (c))
quigley@15642
   630
quigley@16548
   631
 val methodstep = extraaxiomstep || origaxiomstep || axiomstep ||binarystep || factorstep|| parastep || mrrstep || (*rewritestep ||*) obviousstep
quigley@15642
   632
quigley@15642
   633
quigley@15642
   634
 val number_list_step =
paulson@15739
   635
        ( number ++ many ((a (Other ",") ++ number)>> #2))
quigley@15642
   636
        >> (fn (a,b) => (a::b))
quigley@15642
   637
        
quigley@15642
   638
 val numberlist_step = a (Other "[")  ++ a (Other "]")
quigley@15642
   639
                        >>(fn (_,_) => ([]:int list))
quigley@15642
   640
                       || a (Other "[") ++ number_list_step ++ a (Other "]")
quigley@15642
   641
                        >>(fn (_,(a,_)) => a)
quigley@15642
   642
                    
quigley@15642
   643
quigley@15642
   644
quigley@15642
   645
(** change this to allow P (x U) *)
quigley@15642
   646
 fun arglist_step input = ( word ++ many  word >> (fn (a, b) => (a^" "^(implode_with_space b)))
quigley@15642
   647
                           ||word >> (fn (a) => (a)))input
quigley@15642
   648
                
quigley@15642
   649
quigley@15642
   650
fun literal_step input = (word ++ a (Other "(") ++ arglist_step ++  a (Other ")")
quigley@15642
   651
                                          >>(fn (a, (b, (c,d))) => (a^" ("^(c)^")"))
quigley@15642
   652
                        || arglist_step >> (fn (a) => (a)))input
quigley@15642
   653
                           
quigley@15642
   654
quigley@15642
   655
quigley@15642
   656
(* fun term_step input = (a (Other "~") ++ arglist_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
quigley@15642
   657
                     ||  arglist_step ++ a (Other "%")>> (fn (a,b) => a ))input
quigley@15642
   658
*)
quigley@15642
   659
quigley@15642
   660
quigley@15642
   661
 fun term_step input = (a (Other "~") ++ literal_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
quigley@15642
   662
                     ||  literal_step ++ a (Other "%")>> (fn (a,b) => a ))input
quigley@15642
   663
quigley@15642
   664
quigley@15642
   665
         
quigley@15642
   666
quigley@15642
   667
 val term_list_step =
quigley@15642
   668
        (  term_step ++ many ( term_step))
quigley@15642
   669
        >> (fn (a,b) => (a::b))
quigley@15642
   670
        
quigley@15642
   671
 
quigley@15642
   672
val term_lists_step = a (Other "[")  ++ a (Other "]")
quigley@15642
   673
                        >>(fn (_,_) => ([]:string list))
quigley@15642
   674
                       || a (Other "[") ++ term_list_step ++ a (Other "]")
quigley@15642
   675
                        >>(fn (_,(a,_)) => a)
quigley@15642
   676
                     
quigley@15642
   677
quigley@15642
   678
quigley@15642
   679
quigley@15642
   680
fun anytoken_step input  = (word>> (fn (a) => a)  ) input
quigley@15642
   681
                       handle NOPARSE_WORD => (number>> (fn (a) => string_of_int a)  ) input
quigley@15642
   682
                      handle NOPARSE_NUMBER => (other_char >> (fn(a) => a)) input
quigley@15642
   683
quigley@15642
   684
quigley@15642
   685
quigley@15642
   686
fun goalstring_step input= (anytoken_step ++ many (anytoken_step )
quigley@15642
   687
                  >> (fn (a,b) =>  (a^" "^(implode b)))) input
quigley@15642
   688
quigley@15642
   689
quigley@15642
   690
quigley@15642
   691
 val linestep = number ++ methodstep ++ term_lists_step ++ term_lists_step
quigley@15642
   692
                >> (fn (a, (b, (c,d))) => (a,(b,c,d)))
quigley@15642
   693
    
quigley@15642
   694
 val lines_step = many linestep
quigley@15642
   695
paulson@15739
   696
 val alllines_step = (term_lists_step ++ lines_step ) ++ finished >> #1
quigley@15642
   697
    
paulson@15739
   698
 val parse_step = #1 o alllines_step
quigley@15642
   699
quigley@15642
   700
quigley@15642
   701
 (*
quigley@15642
   702
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
   703
*)
quigley@15642
   704
quigley@15642
   705
(************************************************************)
quigley@15642
   706
(* Construct an Isar style proof from a list of proof steps *)
quigley@15642
   707
(************************************************************)
quigley@15642
   708
(* want to assume all axioms, then do haves for the other clauses*)
quigley@15642
   709
(* then show for the last step *)
quigley@15642
   710
quigley@15642
   711
(* replace ~ by not here *)
quigley@15642
   712
fun change_nots [] = []
quigley@15642
   713
|   change_nots (x::xs) = if x = "~" 
quigley@15642
   714
                          then 
quigley@15642
   715
                             ["\\", "<", "n", "o", "t", ">"]@(change_nots xs)
quigley@15642
   716
                          else (x::(change_nots xs))
quigley@15642
   717
quigley@15642
   718
(*
quigley@15642
   719
fun clstrs_to_string [] str = str
quigley@15642
   720
|   clstrs_to_string (x::[]) str = str^x
quigley@15642
   721
|   clstrs_to_string (x::xs) str = clstrs_to_string xs (str^(x^"; "))
quigley@15642
   722
*)
quigley@15642
   723
fun clstrs_to_string [] str = implode (change_nots (explode str))
quigley@15642
   724
|   clstrs_to_string (x::[]) str = implode (change_nots (explode (str^x)))
quigley@15642
   725
|   clstrs_to_string (x::xs) str = implode (change_nots (explode (clstrs_to_string xs (str^(x^"; ")))))
quigley@15642
   726
quigley@15642
   727
quigley@15642
   728
quigley@15642
   729
fun thmvars_to_quantstring [] str = str
quigley@15642
   730
|   thmvars_to_quantstring (x::[]) str =str^x^". "
quigley@15642
   731
|   thmvars_to_quantstring (x::xs) str = thmvars_to_quantstring xs (str^(x^" "))
quigley@15642
   732
quigley@15642
   733
paulson@16091
   734
fun clause_strs_to_isar clstrs [] =  "\"\\<lbrakk>"^(clstrs_to_string clstrs "")^"\\<rbrakk> \\<Longrightarrow> False\""
paulson@16091
   735
|   clause_strs_to_isar clstrs thmvars = "\"\\<And>"^(thmvars_to_quantstring thmvars "")^"\\<lbrakk>"^(clstrs_to_string clstrs "")^"\\<rbrakk> \\<Longrightarrow> False\""
quigley@15642
   736
quigley@15642
   737
fun frees_to_string [] str = implode (change_nots (explode str))
quigley@15642
   738
|   frees_to_string (x::[]) str = implode (change_nots (explode (str^x)))
quigley@15642
   739
|   frees_to_string  (x::xs) str = implode (change_nots (explode (frees_to_string xs (str^(x^" ")))))
quigley@15642
   740
quigley@15642
   741
fun frees_to_isar_str [] =  ""
quigley@15642
   742
|   frees_to_isar_str  clstrs = (frees_to_string clstrs "")
quigley@15642
   743
quigley@15642
   744
quigley@15642
   745
(***********************************************************************)
quigley@15642
   746
(* functions for producing assumptions for the Isabelle ordered axioms *)
quigley@15642
   747
(***********************************************************************)
quigley@15642
   748
(*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
   749
num, rule, clausestrs, vars*)
quigley@15642
   750
quigley@15642
   751
quigley@15642
   752
(* assume the extra clauses - not used in Spass proof *)
quigley@15642
   753
quigley@15642
   754
fun is_extraaxiom_step ( num:int,(ExtraAxiom, str, tstr)) = true
quigley@15642
   755
|   is_extraaxiom_step (num, _) = false
quigley@15642
   756
quigley@15642
   757
fun get_extraaxioms xs = List.filter (is_extraaxiom_step) ( xs)
quigley@15642
   758
quigley@15642
   759
fun assume_isar_extraaxiom [] str  = str
quigley@15642
   760
|   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
   761
quigley@15642
   762
quigley@15642
   763
quigley@15642
   764
fun assume_isar_extraaxioms  [] = ""
quigley@15642
   765
|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
   766
                                         in
quigley@15642
   767
                                             assume_isar_extraaxiom xs str
quigley@15642
   768
                                         end
quigley@15642
   769
quigley@15642
   770
(* assume the Isabelle ordered clauses *)
quigley@15642
   771
quigley@15642
   772
fun is_origaxiom_step ( num:int,(OrigAxiom, str, tstr)) = true
quigley@15642
   773
|   is_origaxiom_step (num, _) = false
quigley@15642
   774
quigley@15642
   775
fun get_origaxioms xs = List.filter (is_origaxiom_step) ( xs)
quigley@15642
   776
quigley@15642
   777
fun assume_isar_origaxiom [] str  = str
quigley@15642
   778
|   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
   779
quigley@15642
   780
quigley@15642
   781
quigley@15642
   782
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
   783
                                         in
quigley@15642
   784
                                             assume_isar_origaxiom xs str
quigley@15642
   785
                                         end
quigley@15642
   786
quigley@15642
   787
quigley@15642
   788
quigley@15642
   789
fun is_axiom_step ( num:int,(Axiom, str, tstr)) = true
quigley@15642
   790
|   is_axiom_step (num, _) = false
quigley@15642
   791
quigley@15642
   792
fun get_axioms xs = List.filter  (is_axiom_step) ( xs)
quigley@15642
   793
quigley@15642
   794
fun have_isar_axiomline (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
quigley@15642
   795
quigley@15642
   796
fun  by_isar_axiomline (numb,(step, clstrs, thmstrs))="by (rule cl"^ (string_of_int numb)^"') \n"
quigley@15642
   797
quigley@15642
   798
quigley@15642
   799
fun isar_axiomline (numb, (step, clstrs, thmstrs))  = (have_isar_axiomline (numb,(step,clstrs, thmstrs )))^( by_isar_axiomline(numb,(step,clstrs, thmstrs )) )
quigley@15642
   800
quigley@15642
   801
quigley@15642
   802
fun isar_axiomlines [] str = str
quigley@15642
   803
|   isar_axiomlines (x::xs) str = isar_axiomlines xs (str^(isar_axiomline x))
quigley@15642
   804
quigley@15642
   805
quigley@15642
   806
fun have_isar_line (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
quigley@16357
   807
(*FIX: ask Larry to add and mrr attribute *)
quigley@15642
   808
paulson@16091
   809
fun by_isar_line ((Binary ((a,b), (c,d)))) = 
paulson@16091
   810
    "by(rule cl"^
paulson@16091
   811
		(string_of_int a)^" [binary "^(string_of_int b)^" cl"^
paulson@16091
   812
		(string_of_int c)^" "^(string_of_int d)^"])\n"
quigley@16357
   813
|by_isar_line ((MRR ((a,b), (c,d)))) = 
quigley@16357
   814
    "by(rule cl"^
quigley@16357
   815
		(string_of_int a)^" [binary "^(string_of_int b)^" cl"^
quigley@16357
   816
		(string_of_int c)^" "^(string_of_int d)^"])\n"
paulson@16091
   817
|   by_isar_line ( (Para ((a,b), (c,d)))) =
paulson@16091
   818
    "by (rule cl"^
paulson@16091
   819
		(string_of_int a)^" [paramod "^(string_of_int b)^" cl"^
paulson@16091
   820
		(string_of_int c)^" "^(string_of_int d)^"])\n"
paulson@16091
   821
|   by_isar_line ((Factor ((a,b,c)))) = 
paulson@16091
   822
    "by (rule cl"^(string_of_int a)^" [factor "^(string_of_int b)^" "^
paulson@16091
   823
		(string_of_int c)^" ])\n"
quigley@16548
   824
(*|   by_isar_line ( (Rewrite ((a,b),(c,d)))) =
paulson@16091
   825
    "by (rule cl"^(string_of_int a)^" [demod "^(string_of_int b)^" "^
quigley@16548
   826
		(string_of_int c)^" "^(string_of_int d)^" ])\n"*)
paulson@16091
   827
|   by_isar_line ( (Obvious ((a,b)))) =
paulson@16091
   828
    "by (rule cl"^(string_of_int a)^" [obvious "^(string_of_int b)^" ])\n"
quigley@15642
   829
quigley@15642
   830
fun isar_line (numb, (step, clstrs, thmstrs))  = (have_isar_line (numb,(step,clstrs, thmstrs )))^( by_isar_line step)
quigley@15642
   831
quigley@15642
   832
quigley@15642
   833
fun isar_lines [] str = str
quigley@15642
   834
|   isar_lines (x::xs) str = isar_lines xs (str^(isar_line x))
quigley@15642
   835
quigley@15642
   836
fun last_isar_line (numb,( step, clstrs,thmstrs)) = "show \"False\"\n"^(by_isar_line step)
quigley@15642
   837
quigley@15642
   838
paulson@16091
   839
fun to_isar_proof (frees, xs, goalstring) =
paulson@16091
   840
    let val extraaxioms = get_extraaxioms xs
paulson@16091
   841
	val extraax_num = length extraaxioms
paulson@16091
   842
	val origaxioms_and_steps = Library.drop (extraax_num, xs)  
paulson@16091
   843
	
paulson@16091
   844
	val origaxioms = get_origaxioms origaxioms_and_steps
paulson@16091
   845
	val origax_num = length origaxioms
paulson@16091
   846
	val axioms_and_steps = Library.drop (origax_num + extraax_num, xs)  
paulson@16091
   847
	val axioms = get_axioms axioms_and_steps
paulson@16091
   848
	
paulson@16091
   849
	val steps = Library.drop (origax_num, axioms_and_steps)
paulson@16091
   850
	val firststeps = ReconOrderClauses.butlast steps
paulson@16091
   851
	val laststep = ReconOrderClauses.last steps
paulson@16091
   852
	val goalstring = implode(ReconOrderClauses.butlast(explode goalstring))
paulson@16091
   853
	
paulson@16091
   854
	val isar_proof = 
paulson@16091
   855
		("show \""^goalstring^"\"\n")^
paulson@16091
   856
		("proof (rule ccontr,skolemize, make_clauses) \n")^
paulson@16091
   857
		("fix "^(frees_to_isar_str frees)^"\n")^
paulson@16091
   858
		(assume_isar_extraaxioms extraaxioms)^
paulson@16091
   859
		(assume_isar_origaxioms origaxioms)^
paulson@16091
   860
		(isar_axiomlines axioms "")^
paulson@16091
   861
		(isar_lines firststeps "")^
paulson@16091
   862
		(last_isar_line laststep)^
paulson@16091
   863
		("qed")
paulson@16905
   864
	val _ = File.write (File.tmp_path (Path.basic "isar_proof_file")) isar_proof
paulson@16091
   865
    in
paulson@16091
   866
	isar_proof
paulson@16091
   867
    end;
quigley@15642
   868
quigley@15642
   869
(* get fix vars from axioms - all Frees *)
quigley@15642
   870
(* check each clause for meta-vars and /\ over them at each step*)
quigley@15642
   871
quigley@15642
   872
(*******************************************************)
quigley@15642
   873
(* This assumes the thm list  "numcls" is still there  *)
quigley@15642
   874
(* In reality, should probably label it with an        *)
quigley@15642
   875
(* ID number identifying the subgoal.  This could      *)
quigley@15642
   876
(* be passed over to the watcher, e.g.  numcls25       *)
quigley@15642
   877
(*******************************************************)
quigley@15642
   878
quigley@15642
   879
(* 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
   880
quigley@15642
   881
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
   882
quigley@15642
   883
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
   884
quigley@15642
   885
quigley@15642
   886
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
   887
quigley@15642
   888
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
   889
*)
quigley@15642
   890
paulson@15739
   891
fun apply_res_thm str goalstring  = let val tokens = #1 (lex str);
quigley@16357
   892
				val _ = File.append (File.tmp_path (Path.basic "applyres")) 
quigley@16357
   893
			           ("str is: "^str^" goalstr is: "^goalstring^"\n")	
quigley@15642
   894
                                   val (frees,recon_steps) = parse_step tokens 
quigley@15642
   895
                                   val isar_str = to_isar_proof (frees, recon_steps, goalstring)
wenzelm@16259
   896
                                   val foo =   TextIO.openOut (File.platform_path(File.tmp_path (Path.basic "foobar")));
quigley@15642
   897
                               in 
quigley@15642
   898
                                  TextIO.output(foo,(isar_str));TextIO.closeOut foo;Pretty.writeln(Pretty.str  isar_str); () 
quigley@15642
   899
                               end 
quigley@15642
   900
quigley@15642
   901
quigley@16357
   902
(* val reconstr = reconstr^"[P%]51Axiom()[~P%]52Axiom[P%][]53MRR((52,0),(51,0))[][]";
quigley@16357
   903
*)
paulson@15684
   904
end;