src/HOL/Tools/ATP/recon_transfer_proof.ML
author paulson
Mon Sep 19 15:12:13 2005 +0200 (2005-09-19)
changeset 17484 f6a225f97f0a
parent 17422 3b237822985d
child 17488 67376a311a2b
permissions -rw-r--r--
simplification of the Isabelle-ATP code; hooks for batch generation of problems
     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 thms 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 thms 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) []) 
   190                     thms clause_arr
   191   end;
   192     
   193  (*String contains multiple lines, terminated with newline characters.
   194   A list consisting of the first number in each line is returned. *)
   195 fun get_linenums proofstr = 
   196   let val numerics = String.tokens (not o Char.isDigit)
   197       fun firstno [] = NONE
   198         | firstno (x::xs) = Int.fromString x
   199       val lines = String.tokens (fn c => c = #"\n") proofstr
   200   in  List.mapPartial (firstno o numerics) lines  end
   201 
   202 fun get_axiom_names_vamp_E proofstr thms clause_arr  =
   203    get_axiom_names (get_linenums proofstr) thms clause_arr;
   204     
   205 
   206 (***********************************************)
   207 (* get axioms for reconstruction               *)
   208 (***********************************************)
   209 fun numclstr (vars, []) str = str
   210 |   numclstr ( vars, ((num, thm)::rest)) str =
   211       let val newstr = str^(string_of_int num)^" "^(string_of_thm thm)^" "
   212       in
   213         numclstr  (vars,rest) newstr
   214       end
   215 
   216 fun addvars c (a,b)  = (a,b,c)
   217 
   218 fun get_axioms_used proof_steps thms clause_arr  =
   219   let 
   220      val _=  (print_mode := (Library.gen_rems (op =) (! print_mode, ["xsymbols", "symbols"])))
   221      val axioms = (List.filter is_axiom) proof_steps
   222      val step_nums = get_step_nums axioms []
   223 
   224      val clauses = make_clauses thms    (*FIXME: must this be repeated??*)
   225      
   226      val vars = map thm_vars clauses
   227     
   228      val distvars = distinct (fold append vars [])
   229      val clause_terms = map prop_of clauses  
   230      val clause_frees = List.concat (map term_frees clause_terms)
   231 
   232      val frees = map lit_string_with_nums clause_frees;
   233 
   234      val distfrees = distinct frees
   235 
   236      val metas = map Meson.make_meta_clause clauses
   237      val ax_strs = map #3 axioms
   238 
   239      (* literals of -all- axioms, not just those used by spass *)
   240      val meta_strs = map ReconOrderClauses.get_meta_lits metas
   241     
   242      val metas_and_strs = ListPair.zip (metas,meta_strs)
   243      val _ = File.write(File.tmp_path (Path.basic "foo_clauses")) (onestr ax_strs)
   244      val _ = File.write(File.tmp_path (Path.basic "foo_metastrs")) (onestr meta_strs)
   245 
   246      (* get list of axioms as thms with their variables *)
   247 
   248      val ax_metas = get_assoc_snds ax_strs metas_and_strs []
   249      val ax_vars = map thm_vars ax_metas
   250      val ax_with_vars = ListPair.zip (ax_metas,ax_vars)
   251 
   252      (* get list of extra axioms as thms with their variables *)
   253      val extra_metas = add_if_not_inlist metas ax_metas []
   254      val extra_vars = map thm_vars extra_metas
   255      val extra_with_vars = if (not (extra_metas = []) ) 
   256 			   then ListPair.zip (extra_metas,extra_vars)
   257 			   else []
   258   in
   259      (distfrees,distvars, extra_with_vars,ax_with_vars, ListPair.zip (step_nums,ax_metas))
   260   end;
   261                                             
   262 
   263 (*********************************************************************)
   264 (* Pass in spass string of proof and string version of isabelle goal *)
   265 (* Get out reconstruction steps as a string to be sent to Isabelle   *)
   266 (*********************************************************************)
   267 
   268 fun rules_to_string [] = "NONE"
   269   | rules_to_string xs = "[" ^ space_implode ", " xs ^ "]"
   270 
   271 fun subst_for a b = String.translate (fn c => str (if c=a then b else c));
   272 
   273 val remove_linebreaks = subst_for #"\n" #"\t";
   274 val restore_linebreaks = subst_for #"\t" #"\n";
   275 
   276 
   277 fun prover_lemma_list_aux proofstr goalstring toParent ppid thms clause_arr getax = 
   278  let val _ = File.append(File.tmp_path (Path.basic "prover_lemmastring"))
   279                ("proofstr is " ^ proofstr ^
   280                 "\ngoalstr is " ^ goalstring ^
   281                 "\nnum of clauses is " ^ string_of_int (Array.length clause_arr))
   282 
   283      val axiom_names = getax proofstr thms clause_arr
   284      val ax_str = rules_to_string axiom_names
   285     in 
   286 	 File.append(File.tmp_path (Path.basic "prover_lemmastring"))
   287 	            ("\nlemma list is: " ^ ax_str);
   288          TextIO.output (toParent, "Success. Lemmas used in automatic proof: " ^
   289                   ax_str ^ "\n");
   290 	 TextIO.output (toParent, "goalstring: "^goalstring^"\n");
   291 	 TextIO.flushOut toParent;
   292 
   293 	 Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
   294 	(* Attempt to prevent several signals from turning up simultaneously *)
   295 	 Posix.Process.sleep(Time.fromSeconds 1) ; all_tac
   296     end
   297     handle exn => (*FIXME: exn handler is too general!*)
   298      (File.write(File.tmp_path (Path.basic "proverString_handler")) 
   299          ("In exception handler: " ^ Toplevel.exn_message exn);
   300       TextIO.output (toParent, "Translation failed for the proof: " ^ 
   301                      remove_linebreaks proofstr ^ "\n");
   302       TextIO.output (toParent, remove_linebreaks goalstring ^ "\n");
   303       TextIO.flushOut toParent;
   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); all_tac);
   307 
   308 fun prover_lemma_list proofstr goalstring toParent ppid thms clause_arr  = 
   309   prover_lemma_list_aux proofstr goalstring toParent ppid thms        
   310        clause_arr get_axiom_names_vamp_E;
   311 
   312 fun spass_lemma_list proofstr goalstring toParent ppid thms clause_arr = 
   313   prover_lemma_list_aux proofstr goalstring toParent ppid thms        
   314        clause_arr get_axiom_names_spass;
   315 
   316 
   317 (**** Full proof reconstruction for SPASS (not really working) ****)
   318 
   319 fun spass_reconstruct proofstr goalstring toParent ppid thms clause_arr = 
   320   let val _ = File.write(File.tmp_path (Path.basic "prover_reconstruction")) 
   321                  ("proofstr is: "^proofstr)
   322       val tokens = #1(lex proofstr)
   323 
   324   (***********************************)
   325   (* parse spass proof into datatype *)
   326   (***********************************)
   327       val proof_steps = parse tokens
   328 
   329       val _ = File.append (File.tmp_path (Path.basic "prover_reconstruction"))
   330                       ("Did parsing on "^proofstr)
   331     
   332   (************************************)
   333   (* recreate original subgoal as thm *)
   334   (************************************)
   335       (* get axioms as correctly numbered clauses w.r.t. the Spass proof *)
   336       (* need to get prems_of thm, then get right one of the prems, relating to whichever*)
   337       (* subgoal this is, and turn it into meta_clauses *)
   338       (* should prob add array and table here, so that we can get axioms*)
   339       (* produced from the clasimpset rather than the problem *)
   340       val (frees,vars,extra_with_vars ,ax_with_vars,numcls) = get_axioms_used proof_steps  thms clause_arr
   341       
   342       (*val numcls_string = numclstr ( vars, numcls) ""*)
   343       val _ = File.append (File.tmp_path (Path.basic "prover_reconstruction")) "got axioms"
   344 	
   345   (************************************)
   346   (* translate proof                  *)
   347   (************************************)
   348       val _ = File.append (File.tmp_path (Path.basic "prover_reconstruction"))                                                                           
   349                        ("about to translate proof, steps: "
   350                        ^(init_proofsteps_to_string proof_steps ""))
   351       val (newthm,proof) = translate_proof numcls  proof_steps vars
   352       val _ = File.append (File.tmp_path (Path.basic "prover_reconstruction"))                                                                       
   353                        ("translated proof, steps: "^(init_proofsteps_to_string proof_steps ""))
   354   (***************************************************)
   355   (* transfer necessary steps as strings to Isabelle *)
   356   (***************************************************)
   357       (* turn the proof into a string *)
   358       val reconProofStr = proofs_to_string proof ""
   359       (* do the bit for the Isabelle ordered axioms at the top *)
   360       val ax_nums = map #1 numcls
   361       val ax_strs = map ReconOrderClauses.get_meta_lits_bracket (map #2 numcls)
   362       val numcls_strs = ListPair.zip (ax_nums,ax_strs)
   363       val num_cls_vars =  map (addvars vars) numcls_strs;
   364       val reconIsaAxStr = origAxs_to_string (ListPair.zip (ax_nums,ax_with_vars)) ""
   365       
   366       val extra_nums = if (not (extra_with_vars = [])) then (1 upto (length extra_with_vars))
   367                        else []
   368       val reconExtraAxStr = extraAxs_to_string ( ListPair.zip (extra_nums,extra_with_vars)) ""
   369       val frees_str = "["^(thmvars_to_string frees "")^"]"
   370       val _ = File.write (File.tmp_path (Path.basic "reconstringfile"))
   371                           (frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr)
   372       val reconstr = (frees_str^reconExtraAxStr^reconIsaAxStr^reconProofStr)
   373   in 
   374        TextIO.output (toParent, reconstr^"\n");
   375        TextIO.output (toParent, goalstring^"\n");
   376        TextIO.flushOut toParent;
   377 
   378        Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
   379       (* Attempt to prevent several signals from turning up simultaneously *)
   380        Posix.Process.sleep(Time.fromSeconds 1) ; all_tac
   381   end
   382   handle exn => (*FIXME: exn handler is too general!*)
   383    (File.append(File.tmp_path (Path.basic "prover_reconstruction"))
   384        ("In exception handler: " ^ Toplevel.exn_message exn);
   385     TextIO.output (toParent,"Translation failed for the proof:"^
   386          (remove_linebreaks proofstr) ^"\n");
   387     TextIO.output (toParent, goalstring^"\n");
   388     TextIO.flushOut toParent;
   389     Posix.Process.kill(Posix.Process.K_PROC ppid, Posix.Signal.usr2);
   390     (* Attempt to prevent several signals from turning up simultaneously *)
   391     Posix.Process.sleep(Time.fromSeconds 1); all_tac)
   392 
   393 (**********************************************************************************)
   394 (* At other end, want to turn back into datatype so can apply reconstruct_proof.  *)
   395 (* This will be done by the signal handler                                        *)
   396 (**********************************************************************************)
   397 
   398 (* Parse in the string version of the proof steps for reconstruction *)
   399 (* Isar format: cl1 [BINARY 0 cl2 0];cl1 [PARAMOD 0 cl2 0]; cl1 [DEMOD 0 cl2];cl1 [FACTOR 1 2];*)
   400 
   401 
   402  val term_numstep =
   403         (number ++ (a (Other ",")) ++ number) >> (fn (a, (_, c)) => (a, c))
   404 
   405 val extraaxiomstep = (a (Word "ExtraAxiom"))++ (a (Other "(")) ++(a (Other ")"))
   406             >> (fn (_) => ExtraAxiom)
   407 
   408 
   409 
   410 val origaxiomstep = (a (Word "OrigAxiom"))++ (a (Other "(")) ++(a (Other ")"))
   411             >> (fn (_) => OrigAxiom)
   412 
   413 
   414  val axiomstep = (a (Word "Axiom"))++ (a (Other "(")) ++(a (Other ")"))
   415             >> (fn (_) => Axiom)
   416      
   417 
   418 
   419       
   420  val binarystep = (a (Word "Binary")) ++ (a (Other "(")) ++ (a (Other "(")) 
   421                    ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
   422                    ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
   423             >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Binary (c,e))
   424       
   425 
   426  val parastep = (a (Word "Para")) ++ (a (Other "(")) ++ (a (Other "(")) 
   427                    ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
   428                    ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
   429             >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Para(c, e))
   430       
   431  val mrrstep = (a (Word "MRR")) ++ (a (Other "(")) ++ (a (Other "(")) 
   432                    ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
   433                    ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
   434             >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => MRR(c, e))
   435       
   436 
   437  val factorstep = (a (Word "Factor")) ++ (a (Other "("))
   438                     ++ number ++ (a (Other ","))
   439                        ++ number ++ (a (Other ","))
   440                        ++ number ++  (a (Other ")"))
   441                    
   442             >> (fn (_, (_, (c, (_, (e,(_,(f,_))))))) =>  Factor (c,e,f))
   443 
   444 
   445 (*val rewritestep = (a (Word "Rewrite"))  ++ (a (Other "(")) ++ (a (Other "(")) 
   446                    ++ term_numstep  ++ (a (Other ")")) ++ (a (Other ","))
   447                    ++ (a (Other "(")) ++ term_numstep ++ (a (Other ")")) ++ (a (Other ")"))
   448             >> (fn (_, (_, (_, (c, (_,(_,(_, (e,(_,_))))))))) => Rewrite (c,e))*)
   449 
   450 val obviousstep = (a (Word "Obvious")) ++ (a (Other "(")) 
   451                    ++ term_numstep  ++ (a (Other ")")) 
   452             >> (fn (_, (_, (c,_))) => Obvious (c))
   453 
   454  val methodstep = extraaxiomstep || origaxiomstep || axiomstep ||binarystep || factorstep|| parastep || mrrstep || (*rewritestep ||*) obviousstep
   455 
   456 
   457  val number_list_step =
   458         ( number ++ many ((a (Other ",") ++ number)>> #2))
   459         >> (fn (a,b) => (a::b))
   460         
   461  val numberlist_step = a (Other "[")  ++ a (Other "]")
   462                         >>(fn (_,_) => ([]:int list))
   463                        || a (Other "[") ++ number_list_step ++ a (Other "]")
   464                         >>(fn (_,(a,_)) => a)
   465                     
   466 
   467 
   468 (** change this to allow P (x U) *)
   469  fun arglist_step input = 
   470    ( word ++ many word >> (fn (a, b) => (a^" "^(space_implode " " b)))
   471     ||word >> (fn (a) => (a)))input
   472                 
   473 
   474 fun literal_step input = (word ++ a (Other "(") ++ arglist_step ++  a (Other ")")
   475                                           >>(fn (a, (b, (c,d))) => (a^" ("^(c)^")"))
   476                         || arglist_step >> (fn (a) => (a)))input
   477                            
   478 
   479 
   480 (* fun term_step input = (a (Other "~") ++ arglist_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
   481                      ||  arglist_step ++ a (Other "%")>> (fn (a,b) => a ))input
   482 *)
   483 
   484 
   485  fun term_step input = (a (Other "~") ++ literal_step ++ a (Other "%")>> (fn (a,(b,c)) => ("~ "^b))
   486                      ||  literal_step ++ a (Other "%")>> (fn (a,b) => a ))input
   487 
   488 
   489          
   490 
   491  val term_list_step =
   492         (  term_step ++ many ( term_step))
   493         >> (fn (a,b) => (a::b))
   494         
   495  
   496 val term_lists_step = a (Other "[")  ++ a (Other "]")
   497                         >>(fn (_,_) => ([]:string list))
   498                        || a (Other "[") ++ term_list_step ++ a (Other "]")
   499                         >>(fn (_,(a,_)) => a)
   500                      
   501 
   502 
   503 
   504 fun anytoken_step input  = (word>> (fn (a) => a)  ) input
   505                        handle NOPARSE_WORD => (number>> (fn (a) => string_of_int a)  ) input
   506                       handle NOPARSE_NUMBER => (other_char >> (fn(a) => a)) input
   507 
   508 
   509 
   510 fun goalstring_step input= (anytoken_step ++ many (anytoken_step )
   511                   >> (fn (a,b) =>  (a^" "^(implode b)))) input
   512 
   513 
   514 
   515  val linestep = number ++ methodstep ++ term_lists_step ++ term_lists_step
   516                 >> (fn (a, (b, (c,d))) => (a,(b,c,d)))
   517     
   518  val lines_step = many linestep
   519 
   520  val alllines_step = (term_lists_step ++ lines_step ) ++ finished >> #1
   521     
   522  val parse_step = #1 o alllines_step
   523 
   524 
   525  (*
   526 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)"
   527 *)
   528 
   529 (************************************************************)
   530 (* Construct an Isar style proof from a list of proof steps *)
   531 (************************************************************)
   532 (* want to assume all axioms, then do haves for the other clauses*)
   533 (* then show for the last step *)
   534 
   535 (* replace ~ by not here *)
   536 val change_nots = String.translate (fn c => if c = #"~" then "\\<not>" else str c);
   537 
   538 fun clstrs_to_string xs = space_implode "; " (map change_nots xs);
   539 
   540 fun thmvars_to_quantstring [] str = str
   541 |   thmvars_to_quantstring (x::[]) str =str^x^". "
   542 |   thmvars_to_quantstring (x::xs) str = thmvars_to_quantstring xs (str^(x^" "))
   543 
   544 
   545 fun clause_strs_to_isar clstrs [] =
   546       "\"\\<lbrakk>"^(clstrs_to_string clstrs)^"\\<rbrakk> \\<Longrightarrow> False\""
   547 |   clause_strs_to_isar clstrs thmvars =
   548       "\"\\<And>"^(thmvars_to_quantstring thmvars "")^
   549       "\\<lbrakk>"^(clstrs_to_string clstrs)^"\\<rbrakk> \\<Longrightarrow> False\""
   550 
   551 fun frees_to_isar_str clstrs = space_implode " " (map change_nots clstrs)
   552 
   553 
   554 (***********************************************************************)
   555 (* functions for producing assumptions for the Isabelle ordered axioms *)
   556 (***********************************************************************)
   557 (*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))[][]";       
   558 num, rule, clausestrs, vars*)
   559 
   560 
   561 (* assume the extra clauses - not used in Spass proof *)
   562 
   563 fun is_extraaxiom_step ( num:int,(ExtraAxiom, str, tstr)) = true
   564 |   is_extraaxiom_step (num, _) = false
   565 
   566 fun get_extraaxioms xs = List.filter (is_extraaxiom_step) ( xs)
   567 
   568 fun assume_isar_extraaxiom [] str  = str
   569 |   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 " )
   570 
   571 
   572 
   573 fun assume_isar_extraaxioms  [] = ""
   574 |assume_isar_extraaxioms ((numb,(step, clstrs, thmstrs))::xs) = let val str = "assume cl"^(string_of_int numb)^"': "^(clause_strs_to_isar clstrs thmstrs)^"\n" 
   575                                          in
   576                                              assume_isar_extraaxiom xs str
   577                                          end
   578 
   579 (* assume the Isabelle ordered clauses *)
   580 
   581 fun is_origaxiom_step ( num:int,(OrigAxiom, str, tstr)) = true
   582 |   is_origaxiom_step (num, _) = false
   583 
   584 fun get_origaxioms xs = List.filter (is_origaxiom_step) ( xs)
   585 
   586 fun assume_isar_origaxiom [] str  = str
   587 |   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 " )
   588 
   589 
   590 
   591 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" 
   592                                          in
   593                                              assume_isar_origaxiom xs str
   594                                          end
   595 
   596 
   597 
   598 fun is_axiom_step ( num:int,(Axiom, str, tstr)) = true
   599 |   is_axiom_step (num, _) = false
   600 
   601 fun get_axioms xs = List.filter  (is_axiom_step) ( xs)
   602 
   603 fun have_isar_axiomline (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
   604 
   605 fun  by_isar_axiomline (numb,(step, clstrs, thmstrs))="by (rule cl"^ (string_of_int numb)^"') \n"
   606 
   607 
   608 fun isar_axiomline (numb, (step, clstrs, thmstrs))  = (have_isar_axiomline (numb,(step,clstrs, thmstrs )))^( by_isar_axiomline(numb,(step,clstrs, thmstrs )) )
   609 
   610 
   611 fun isar_axiomlines [] str = str
   612 |   isar_axiomlines (x::xs) str = isar_axiomlines xs (str^(isar_axiomline x))
   613 
   614 
   615 fun have_isar_line (numb,(step, clstrs, thmstrs))="have cl"^(string_of_int numb)^": "^(clause_strs_to_isar clstrs thmstrs)^"\n"
   616 (*FIX: ask Larry to add and mrr attribute *)
   617 
   618 fun by_isar_line ((Binary ((a,b), (c,d)))) = 
   619     "by(rule cl"^
   620 		(string_of_int a)^" [binary "^(string_of_int b)^" cl"^
   621 		(string_of_int c)^" "^(string_of_int d)^"])\n"
   622 |by_isar_line ((MRR ((a,b), (c,d)))) = 
   623     "by(rule cl"^
   624 		(string_of_int a)^" [binary "^(string_of_int b)^" cl"^
   625 		(string_of_int c)^" "^(string_of_int d)^"])\n"
   626 |   by_isar_line ( (Para ((a,b), (c,d)))) =
   627     "by (rule cl"^
   628 		(string_of_int a)^" [paramod "^(string_of_int b)^" cl"^
   629 		(string_of_int c)^" "^(string_of_int d)^"])\n"
   630 |   by_isar_line ((Factor ((a,b,c)))) = 
   631     "by (rule cl"^(string_of_int a)^" [factor "^(string_of_int b)^" "^
   632 		(string_of_int c)^" ])\n"
   633 (*|   by_isar_line ( (Rewrite ((a,b),(c,d)))) =
   634     "by (rule cl"^(string_of_int a)^" [demod "^(string_of_int b)^" "^
   635 		(string_of_int c)^" "^(string_of_int d)^" ])\n"*)
   636 |   by_isar_line ( (Obvious ((a,b)))) =
   637     "by (rule cl"^(string_of_int a)^" [obvious "^(string_of_int b)^" ])\n"
   638 
   639 fun isar_line (numb, (step, clstrs, thmstrs))  = (have_isar_line (numb,(step,clstrs, thmstrs )))^( by_isar_line step)
   640 
   641 
   642 fun isar_lines [] str = str
   643 |   isar_lines (x::xs) str = isar_lines xs (str^(isar_line x))
   644 
   645 fun last_isar_line (numb,( step, clstrs,thmstrs)) = "show \"False\"\n"^(by_isar_line step)
   646 
   647 
   648 fun to_isar_proof (frees, xs, goalstring) =
   649     let val extraaxioms = get_extraaxioms xs
   650 	val extraax_num = length extraaxioms
   651 	val origaxioms_and_steps = Library.drop (extraax_num, xs)  
   652 	
   653 	val origaxioms = get_origaxioms origaxioms_and_steps
   654 	val origax_num = length origaxioms
   655 	val axioms_and_steps = Library.drop (origax_num + extraax_num, xs)  
   656 	val axioms = get_axioms axioms_and_steps
   657 	
   658 	val steps = Library.drop (origax_num, axioms_and_steps)
   659 	val firststeps = ReconOrderClauses.butlast steps
   660 	val laststep = List.last steps
   661 	val goalstring = implode(ReconOrderClauses.butlast(explode goalstring))
   662 	
   663 	val isar_proof = 
   664 		("show \""^goalstring^"\"\n")^
   665 		("proof (rule ccontr,skolemize, make_clauses) \n")^
   666 		("fix "^(frees_to_isar_str frees)^"\n")^
   667 		(assume_isar_extraaxioms extraaxioms)^
   668 		(assume_isar_origaxioms origaxioms)^
   669 		(isar_axiomlines axioms "")^
   670 		(isar_lines firststeps "")^
   671 		(last_isar_line laststep)^
   672 		("qed")
   673 	val _ = File.write (File.tmp_path (Path.basic "isar_proof_file")) isar_proof
   674     in
   675 	isar_proof
   676     end;
   677 
   678 (* get fix vars from axioms - all Frees *)
   679 (* check each clause for meta-vars and /\ over them at each step*)
   680 
   681 (*******************************************************)
   682 (* This assumes the thm list  "numcls" is still there  *)
   683 (* In reality, should probably label it with an        *)
   684 (* ID number identifying the subgoal.  This could      *)
   685 (* be passed over to the watcher, e.g.  numcls25       *)
   686 (*******************************************************)
   687 
   688 fun apply_res_thm str goalstring  = 
   689   let val tokens = #1 (lex str);
   690       val _ = File.append (File.tmp_path (Path.basic "apply_res_1")) 
   691 	 ("str is: "^str^" goalstr is: "^goalstring^"\n")	
   692       val (frees,recon_steps) = parse_step tokens 
   693       val isar_str = to_isar_proof (frees, recon_steps, goalstring)
   694       val foo = File.write (File.tmp_path (Path.basic "apply_res_2")) isar_str
   695   in 
   696      Pretty.writeln(Pretty.str isar_str)
   697   end 
   698 
   699 end;