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