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
     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     end
   306     handle exn => (*FIXME: exn handler is too general!*)
   307      (File.write(File.tmp_path (Path.basic "proverString_handler")) 
   308          ("In exception handler: " ^ Toplevel.exn_message exn);
   309       TextIO.output (toParent, "Translation failed for the proof: " ^ 
   310                      remove_linebreaks proofstr ^ "\n");
   311       TextIO.output (toParent, remove_linebreaks goalstring ^ "\n");
   312       TextIO.flushOut toParent;
   313       Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2));
   314 
   315 val e_lemma_list = prover_lemma_list_aux get_axiom_names_e;
   316 
   317 val vamp_lemma_list = prover_lemma_list_aux get_axiom_names_vamp;
   318 
   319 val spass_lemma_list = prover_lemma_list_aux get_axiom_names_spass;
   320 
   321 
   322 (**** Full proof reconstruction for SPASS (not really working) ****)
   323 
   324 fun spass_reconstruct proofstr goalstring toParent ppid thms clause_arr = 
   325   let val _ = File.write(File.tmp_path (Path.basic "prover_reconstruction")) 
   326                  ("proofstr is: "^proofstr)
   327       val tokens = #1(lex proofstr)
   328 
   329   (***********************************)
   330   (* parse spass proof into datatype *)
   331   (***********************************)
   332       val proof_steps = parse tokens
   333 
   334       val _ = File.append (File.tmp_path (Path.basic "prover_reconstruction"))
   335                       ("Did parsing on "^proofstr)
   336     
   337   (************************************)
   338   (* recreate original subgoal as thm *)
   339   (************************************)
   340       (* get axioms as correctly numbered clauses w.r.t. the Spass proof *)
   341       (* need to get prems_of thm, then get right one of the prems, relating to whichever*)
   342       (* subgoal this is, and turn it into meta_clauses *)
   343       (* should prob add array and table here, so that we can get axioms*)
   344       (* produced from the clasimpset rather than the problem *)
   345       val (frees,vars,extra_with_vars ,ax_with_vars,numcls) = get_axioms_used proof_steps  thms clause_arr
   346       
   347       (*val numcls_string = numclstr ( vars, numcls) ""*)
   348       val _ = File.append (File.tmp_path (Path.basic "prover_reconstruction")) "got axioms"
   349 	
   350   (************************************)
   351   (* translate proof                  *)
   352   (************************************)
   353       val _ = File.append (File.tmp_path (Path.basic "prover_reconstruction"))                                                                           
   354                        ("about to translate proof, steps: "
   355                        ^(init_proofsteps_to_string proof_steps ""))
   356       val (newthm,proof) = translate_proof numcls  proof_steps vars
   357       val _ = File.append (File.tmp_path (Path.basic "prover_reconstruction"))                                                                       
   358                        ("translated proof, steps: "^(init_proofsteps_to_string proof_steps ""))
   359   (***************************************************)
   360   (* transfer necessary steps as strings to Isabelle *)
   361   (***************************************************)
   362       (* turn the proof into a string *)
   363       val reconProofStr = proofs_to_string proof ""
   364       (* do the bit for the Isabelle ordered axioms at the top *)
   365       val ax_nums = map #1 numcls
   366       val ax_strs = map ReconOrderClauses.get_meta_lits_bracket (map #2 numcls)
   367       val numcls_strs = ListPair.zip (ax_nums,ax_strs)
   368       val num_cls_vars =  map (addvars vars) numcls_strs;
   369       val reconIsaAxStr = origAxs_to_string (ListPair.zip (ax_nums,ax_with_vars)) ""
   370       
   371       val extra_nums = if (not (extra_with_vars = [])) then (1 upto (length extra_with_vars))
   372                        else []
   373       val reconExtraAxStr = extraAxs_to_string ( ListPair.zip (extra_nums,extra_with_vars)) ""
   374       val frees_str = "["^(thmvars_to_string frees "")^"]"
   375       val _ = File.write (File.tmp_path (Path.basic "reconstringfile"))
   376                           (frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr)
   377       val reconstr = (frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr)
   378   in 
   379        TextIO.output (toParent, reconstr^"\n");
   380        TextIO.output (toParent, goalstring^"\n");
   381        TextIO.flushOut toParent;
   382        Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
   383        all_tac
   384   end
   385   handle exn => (*FIXME: exn handler is too general!*)
   386    (File.append(File.tmp_path (Path.basic "prover_reconstruction"))
   387        ("In exception handler: " ^ Toplevel.exn_message exn);
   388     TextIO.output (toParent,"Translation failed for the proof:"^
   389          (remove_linebreaks proofstr) ^"\n");
   390     TextIO.output (toParent, goalstring^"\n");
   391     TextIO.flushOut toParent;
   392     Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2); all_tac)
   393 
   394 (**********************************************************************************)
   395 (* At other end, want to turn back into datatype so can apply reconstruct_proof.  *)
   396 (* This will be done by the signal handler                                        *)
   397 (**********************************************************************************)
   398 
   399 (* Parse in the string version of the proof steps for reconstruction *)
   400 (* Isar format: cl1 [BINARY 0 cl2 0];cl1 [PARAMOD 0 cl2 0]; cl1 [DEMOD 0 cl2];cl1 [FACTOR 1 2];*)
   401 
   402 
   403  val term_numstep =
   404         (number ++ (a (Other ",")) ++ number) >> (fn (a, (_, c)) => (a, c))
   405 
   406 val extraaxiomstep = (a (Word "ExtraAxiom"))++ (a (Other "(")) ++(a (Other ")"))
   407             >> (fn (_) => ExtraAxiom)
   408 
   409 
   410 
   411 val origaxiomstep = (a (Word "OrigAxiom"))++ (a (Other "(")) ++(a (Other ")"))
   412             >> (fn (_) => OrigAxiom)
   413 
   414 
   415  val axiomstep = (a (Word "Axiom"))++ (a (Other "(")) ++(a (Other ")"))
   416             >> (fn (_) => Axiom)
   417      
   418 
   419 
   420       
   421  val binarystep = (a (Word "Binary")) ++ (a (Other "(")) ++ (a (Other "(")) 
   422                    ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
   423                    ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
   424             >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Binary (c,e))
   425       
   426 
   427  val parastep = (a (Word "Para")) ++ (a (Other "(")) ++ (a (Other "(")) 
   428                    ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
   429                    ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
   430             >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Para(c, e))
   431       
   432  val mrrstep = (a (Word "MRR")) ++ (a (Other "(")) ++ (a (Other "(")) 
   433                    ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
   434                    ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
   435             >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => MRR(c, e))
   436       
   437 
   438  val factorstep = (a (Word "Factor")) ++ (a (Other "("))
   439                     ++ number ++ (a (Other ","))
   440                        ++ number ++ (a (Other ","))
   441                        ++ number ++  (a (Other ")"))
   442                    
   443             >> (fn (_, (_, (c, (_, (e,(_,(f,_))))))) =>  Factor (c,e,f))
   444 
   445 
   446 (*val rewritestep = (a (Word "Rewrite"))  ++ (a (Other "(")) ++ (a (Other "(")) 
   447                    ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
   448                    ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
   449             >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Rewrite (c,e))*)
   450 
   451 val obviousstep = (a (Word "Obvious")) ++ (a (Other "(")) 
   452                    ++ term_numstep  ++ (a (Other ")")) 
   453             >> (fn (_, (_, (c,_))) => Obvious (c))
   454 
   455  val methodstep = extraaxiomstep || origaxiomstep || axiomstep ||binarystep || factorstep|| parastep || mrrstep || (*rewritestep ||*) obviousstep
   456 
   457 
   458  val number_list_step =
   459         ( number ++ many ((a (Other ",") ++ number)>> #2))
   460         >> (fn (a,b) => (a::b))
   461         
   462  val numberlist_step = a (Other "[")  ++ a (Other "]")
   463                         >>(fn (_,_) => ([]:int list))
   464                        || a (Other "[") ++ number_list_step ++ a (Other "]")
   465                         >>(fn (_,(a,_)) => a)
   466                     
   467 
   468 
   469 (** change this to allow P (x U) *)
   470  fun arglist_step input = 
   471    ( word ++ many word >> (fn (a, b) => (a^" "^(space_implode " " b)))
   472     ||word >> (fn (a) => (a)))input
   473                 
   474 
   475 fun literal_step input = (word ++ a (Other "(") ++ arglist_step ++  a (Other ")")
   476                                           >>(fn (a, (b, (c,d))) => (a^" ("^(c)^")"))
   477                         || arglist_step >> (fn (a) => (a)))input
   478                            
   479 
   480 
   481 (* fun term_step input = (a (Other "~") ++ arglist_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
   482                      ||  arglist_step ++ a (Other "%")>> (fn (a,b) => a ))input
   483 *)
   484 
   485 
   486  fun term_step input = (a (Other "~") ++ literal_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
   487                      ||  literal_step ++ a (Other "%")>> (fn (a,b) => a ))input
   488 
   489 
   490          
   491 
   492  val term_list_step =
   493         (  term_step ++ many ( term_step))
   494         >> (fn (a,b) => (a::b))
   495         
   496  
   497 val term_lists_step = a (Other "[")  ++ a (Other "]")
   498                         >>(fn (_,_) => ([]:string list))
   499                        || a (Other "[") ++ term_list_step ++ a (Other "]")
   500                         >>(fn (_,(a,_)) => a)
   501                      
   502 
   503 
   504 
   505 fun anytoken_step input  = (word>> (fn (a) => a)  ) input
   506                        handle NOPARSE_WORD => (number>> (fn (a) => string_of_int a)  ) input
   507                       handle NOPARSE_NUMBER => (other_char >> (fn(a) => a)) input
   508 
   509 
   510 
   511 fun goalstring_step input= (anytoken_step ++ many (anytoken_step )
   512                   >> (fn (a,b) =>  (a^" "^(implode b)))) input
   513 
   514 
   515 
   516  val linestep = number ++ methodstep ++ term_lists_step ++ term_lists_step
   517                 >> (fn (a, (b, (c,d))) => (a,(b,c,d)))
   518     
   519  val lines_step = many linestep
   520 
   521  val alllines_step = (term_lists_step ++ lines_step ) ++ finished >> #1
   522     
   523  val parse_step = #1 o alllines_step
   524 
   525 
   526  (*
   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)"
   528 *)
   529 
   530 (************************************************************)
   531 (* Construct an Isar style proof from a list of proof steps *)
   532 (************************************************************)
   533 (* want to assume all axioms, then do haves for the other clauses*)
   534 (* then show for the last step *)
   535 
   536 (* replace ~ by not here *)
   537 val change_nots = String.translate (fn c => if c = #"~" then "\\<not>" else str c);
   538 
   539 fun clstrs_to_string xs = space_implode "; " (map change_nots xs);
   540 
   541 fun thmvars_to_quantstring [] str = str
   542 |   thmvars_to_quantstring (x::[]) str =str^x^". "
   543 |   thmvars_to_quantstring (x::xs) str = thmvars_to_quantstring xs (str^(x^" "))
   544 
   545 
   546 fun clause_strs_to_isar clstrs [] =
   547       "\"\\<lbrakk>"^(clstrs_to_string clstrs)^"\\<rbrakk> \\<Longrightarrow> False\""
   548 |   clause_strs_to_isar clstrs thmvars =
   549       "\"\\<And>"^(thmvars_to_quantstring thmvars "")^
   550       "\\<lbrakk>"^(clstrs_to_string clstrs)^"\\<rbrakk> \\<Longrightarrow> False\""
   551 
   552 fun frees_to_isar_str clstrs = space_implode " " (map change_nots clstrs)
   553 
   554 
   555 (***********************************************************************)
   556 (* functions for producing assumptions for the Isabelle ordered axioms *)
   557 (***********************************************************************)
   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))[][]";       
   559 num, rule, clausestrs, vars*)
   560 
   561 
   562 (* assume the extra clauses - not used in Spass proof *)
   563 
   564 fun is_extraaxiom_step ( num:int,(ExtraAxiom, str, tstr)) = true
   565 |   is_extraaxiom_step (num, _) = false
   566 
   567 fun get_extraaxioms xs = List.filter (is_extraaxiom_step) ( xs)
   568 
   569 fun assume_isar_extraaxiom [] str  = str
   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 " )
   571 
   572 
   573 
   574 fun assume_isar_extraaxioms  [] = ""
   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" 
   576                                          in
   577                                              assume_isar_extraaxiom xs str
   578                                          end
   579 
   580 (* assume the Isabelle ordered clauses *)
   581 
   582 fun is_origaxiom_step ( num:int,(OrigAxiom, str, tstr)) = true
   583 |   is_origaxiom_step (num, _) = false
   584 
   585 fun get_origaxioms xs = List.filter (is_origaxiom_step) ( xs)
   586 
   587 fun assume_isar_origaxiom [] str  = str
   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 " )
   589 
   590 
   591 
   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" 
   593                                          in
   594                                              assume_isar_origaxiom xs str
   595                                          end
   596 
   597 
   598 
   599 fun is_axiom_step ( num:int,(Axiom, str, tstr)) = true
   600 |   is_axiom_step (num, _) = false
   601 
   602 fun get_axioms xs = List.filter  (is_axiom_step) ( xs)
   603 
   604 fun have_isar_axiomline (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
   605 
   606 fun  by_isar_axiomline (numb,(step, clstrs, thmstrs))="by (rule cl"^ (string_of_int numb)^"') \n"
   607 
   608 
   609 fun isar_axiomline (numb, (step, clstrs, thmstrs))  = (have_isar_axiomline (numb,(step,clstrs, thmstrs )))^( by_isar_axiomline(numb,(step,clstrs, thmstrs )) )
   610 
   611 
   612 fun isar_axiomlines [] str = str
   613 |   isar_axiomlines (x::xs) str = isar_axiomlines xs (str^(isar_axiomline x))
   614 
   615 
   616 fun have_isar_line (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
   617 (*FIX: ask Larry to add and mrr attribute *)
   618 
   619 fun by_isar_line ((Binary ((a,b), (c,d)))) = 
   620     "by(rule cl"^
   621 		(string_of_int a)^" [binary "^(string_of_int b)^" cl"^
   622 		(string_of_int c)^" "^(string_of_int d)^"])\n"
   623 |by_isar_line ((MRR ((a,b), (c,d)))) = 
   624     "by(rule cl"^
   625 		(string_of_int a)^" [binary "^(string_of_int b)^" cl"^
   626 		(string_of_int c)^" "^(string_of_int d)^"])\n"
   627 |   by_isar_line ( (Para ((a,b), (c,d)))) =
   628     "by (rule cl"^
   629 		(string_of_int a)^" [paramod "^(string_of_int b)^" cl"^
   630 		(string_of_int c)^" "^(string_of_int d)^"])\n"
   631 |   by_isar_line ((Factor ((a,b,c)))) = 
   632     "by (rule cl"^(string_of_int a)^" [factor "^(string_of_int b)^" "^
   633 		(string_of_int c)^" ])\n"
   634 (*|   by_isar_line ( (Rewrite ((a,b),(c,d)))) =
   635     "by (rule cl"^(string_of_int a)^" [demod "^(string_of_int b)^" "^
   636 		(string_of_int c)^" "^(string_of_int d)^" ])\n"*)
   637 |   by_isar_line ( (Obvious ((a,b)))) =
   638     "by (rule cl"^(string_of_int a)^" [obvious "^(string_of_int b)^" ])\n"
   639 
   640 fun isar_line (numb, (step, clstrs, thmstrs))  = (have_isar_line (numb,(step,clstrs, thmstrs )))^( by_isar_line step)
   641 
   642 
   643 fun isar_lines [] str = str
   644 |   isar_lines (x::xs) str = isar_lines xs (str^(isar_line x))
   645 
   646 fun last_isar_line (numb,( step, clstrs,thmstrs)) = "show \"False\"\n"^(by_isar_line step)
   647 
   648 
   649 fun to_isar_proof (frees, xs, goalstring) =
   650     let val extraaxioms = get_extraaxioms xs
   651 	val extraax_num = length extraaxioms
   652 	val origaxioms_and_steps = Library.drop (extraax_num, xs)  
   653 	
   654 	val origaxioms = get_origaxioms origaxioms_and_steps
   655 	val origax_num = length origaxioms
   656 	val axioms_and_steps = Library.drop (origax_num + extraax_num, xs)  
   657 	val axioms = get_axioms axioms_and_steps
   658 	
   659 	val steps = Library.drop (origax_num, axioms_and_steps)
   660 	val firststeps = ReconOrderClauses.butlast steps
   661 	val laststep = List.last steps
   662 	val goalstring = implode(ReconOrderClauses.butlast(explode goalstring))
   663 	
   664 	val isar_proof = 
   665 		("show \""^goalstring^"\"\n")^
   666 		("proof (rule ccontr,skolemize, make_clauses) \n")^
   667 		("fix "^(frees_to_isar_str frees)^"\n")^
   668 		(assume_isar_extraaxioms extraaxioms)^
   669 		(assume_isar_origaxioms origaxioms)^
   670 		(isar_axiomlines axioms "")^
   671 		(isar_lines firststeps "")^
   672 		(last_isar_line laststep)^
   673 		("qed")
   674 	val _ = File.write (File.tmp_path (Path.basic "isar_proof_file")) isar_proof
   675     in
   676 	isar_proof
   677     end;
   678 
   679 (* get fix vars from axioms - all Frees *)
   680 (* check each clause for meta-vars and /\ over them at each step*)
   681 
   682 (*******************************************************)
   683 (* This assumes the thm list  "numcls" is still there  *)
   684 (* In reality, should probably label it with an        *)
   685 (* ID number identifying the subgoal.  This could      *)
   686 (* be passed over to the watcher, e.g.  numcls25       *)
   687 (*******************************************************)
   688 
   689 fun apply_res_thm str goalstring  = 
   690   let val tokens = #1 (lex str);
   691       val _ = File.append (File.tmp_path (Path.basic "apply_res_1")) 
   692 	 ("str is: "^str^" goalstr is: "^goalstring^"\n")	
   693       val (frees,recon_steps) = parse_step tokens 
   694   in 
   695       to_isar_proof (frees, recon_steps, goalstring)
   696   end 
   697 
   698 end;