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