src/HOL/Tools/res_atp.ML
author paulson
Thu Sep 15 17:46:00 2005 +0200 (2005-09-15)
changeset 17422 3b237822985d
parent 17404 d16c3a62c396
child 17435 0eed5a1c00c1
permissions -rw-r--r--
massive tidy-up and simplification
     1 (*  Author: Jia Meng, Cambridge University Computer Laboratory
     2     ID: $Id$
     3     Copyright 2004 University of Cambridge
     4 
     5 ATPs with TPTP format input.
     6 *)
     7 
     8 signature RES_ATP =
     9 sig
    10   val prover: string ref
    11   val custom_spass: string list ref
    12   val hook_count: int ref
    13 end;
    14 
    15 structure ResAtp: RES_ATP =
    16 struct
    17 
    18 
    19 val call_atp = ref false;
    20 val hook_count = ref 0;
    21 
    22 fun debug_tac tac = (debug "testing"; tac);
    23 
    24 val prover = ref "E";   (* use E as the default prover *)
    25 val custom_spass =   (*specialized options for SPASS*)
    26       ref ["Auto=0","-FullRed=0","-IORe","-IOFc","-RTaut","-RFSub","-RBSub",
    27            "-DocProof","-TimeLimit=60"];
    28 
    29 val prob_file = File.tmp_path (Path.basic "prob");
    30 
    31 
    32 (**** for Isabelle/ML interface  ****)
    33 
    34 (*Remove unwanted characters such as ? and newline from the textural 
    35   representation of a theorem (surely they don't need to be produced in 
    36   the first place?) *)
    37 
    38 fun is_proof_char ch = (#" " <= ch andalso ch <= #"~" andalso ch <> #"?");
    39 
    40 val proofstring =
    41     String.translate (fn c => if is_proof_char c then str c else "");
    42 
    43 
    44 (**** For running in Isar ****)
    45 
    46 (* same function as that in res_axioms.ML *)
    47 fun repeat_RS thm1 thm2 =
    48     let val thm1' =  thm1 RS thm2 handle THM _ => thm1
    49     in
    50         if eq_thm(thm1,thm1') then thm1' else (repeat_RS thm1' thm2)
    51     end;
    52 
    53 (* a special version of repeat_RS *)
    54 fun repeat_someI_ex thm = repeat_RS thm someI_ex;
    55 
    56 
    57 (*********************************************************************)
    58 (* write out a subgoal as tptp clauses to the file "probN"           *)
    59 (* where N is the number of this subgoal                             *)
    60 (*********************************************************************)
    61 
    62 fun tptp_inputs_tfrees thms n axclauses =
    63     let
    64       val _ = debug ("in tptp_inputs_tfrees 0")
    65       val clss = map (ResClause.make_conjecture_clause_thm) thms
    66       val _ = debug ("in tptp_inputs_tfrees 1")
    67       val (tptp_clss,tfree_litss) = ListPair.unzip (map ResClause.clause2tptp clss)
    68       val _ = debug ("in tptp_inputs_tfrees 2")
    69       val tfree_clss = map ResClause.tfree_clause (ResLib.flat_noDup tfree_litss)
    70       val _ = debug ("in tptp_inputs_tfrees 3")
    71       val probfile = File.platform_path prob_file ^ "_" ^ string_of_int n
    72       val out = TextIO.openOut(probfile)
    73     in
    74       ResLib.writeln_strs out (List.concat (map ResClause.tptp_clause axclauses));
    75       ResLib.writeln_strs out (tfree_clss @ tptp_clss);
    76       TextIO.closeOut out;
    77       debug probfile
    78     end;
    79 
    80 
    81 (*********************************************************************)
    82 (* write out a subgoal as DFG clauses to the file "probN"           *)
    83 (* where N is the number of this subgoal                             *)
    84 (*********************************************************************)
    85 
    86 fun dfg_inputs_tfrees thms n axclauses = 
    87     let val clss = map (ResClause.make_conjecture_clause_thm) thms
    88         val probfile = (File.platform_path prob_file) ^ "_" ^ (string_of_int n)
    89         val _ = debug ("about to write out dfg prob file " ^ probfile)
    90         val probN = ResClause.clauses2dfg clss ("prob" ^ (string_of_int n)) 
    91                         axclauses [] [] []    
    92 	val out = TextIO.openOut(probfile)
    93     in
    94 	(ResLib.writeln_strs out [probN]; TextIO.closeOut out; debug probfile )
    95 (* (ResLib.writeln_strs out (tfree_clss @ dfg_clss); *)
    96     end;
    97 
    98 
    99 (*********************************************************************)
   100 (* call prover with settings and problem file for the current subgoal *)
   101 (*********************************************************************)
   102 (* now passing in list of skolemized thms and list of sgterms to go with them *)
   103 fun watcher_call_provers sign sg_terms (childin, childout,pid) =
   104   let
   105     fun make_atp_list [] n = []
   106       | make_atp_list ((sg_term)::xs) n =
   107           let
   108             val goalstring = proofstring (Sign.string_of_term sign sg_term)
   109             val _ = debug ("goalstring in make_atp_lists is " ^ goalstring)
   110 
   111             val probfile = File.platform_path prob_file ^ "_" ^ (string_of_int n)
   112             val _ = debug ("prob file in watcher_call_provers is " ^ probfile)
   113           in
   114             (*Avoid command arguments containing spaces: Poly/ML and SML/NJ
   115               versions of Unix.execute treat them differently!*)
   116             if !prover = "spass"
   117             then
   118               let val optionline = 
   119 		      if !SpassComm.reconstruct 
   120 		          (*Proof reconstruction works for only a limited set of 
   121 		            inference rules*)
   122                       then "-" ^ space_implode "%-" (!custom_spass)
   123                       else "-DocProof%-TimeLimit=60%-SOS%-FullRed=0" (*Auto mode*)
   124                   val _ = debug ("SPASS option string is " ^ optionline)
   125                   val _ = ResLib.helper_path "SPASS_HOME" "SPASS"
   126                     (*We've checked that SPASS is there for ATP/spassshell to run.*)
   127               in 
   128                   ([("spass", goalstring,
   129                      getenv "ISABELLE_HOME" ^ "/src/HOL/Tools/ATP/spassshell",
   130                      optionline, probfile)] @ 
   131                   (make_atp_list xs (n+1)))
   132               end
   133             else if !prover = "vampire"
   134 	    then 
   135               let val vampire = ResLib.helper_path "VAMPIRE_HOME" "vkernel"
   136               in
   137                 ([("vampire", goalstring, vampire, "-t60%-m100000",
   138                    probfile)] @
   139                  (make_atp_list xs (n+1)))
   140               end
   141       	     else if !prover = "E"
   142       	     then
   143 	       let val Eprover = ResLib.helper_path "E_HOME" "eproof"
   144 	       in
   145 		  ([("E", goalstring, Eprover, 
   146 		     "--tptp-in%-l5%-xAuto%-tAuto%--soft-cpu-limit=60",
   147 		     probfile)] @
   148 		   (make_atp_list xs (n+1)))
   149 	       end
   150 	     else error ("Invalid prover name: " ^ !prover)
   151           end
   152 
   153     val atp_list = make_atp_list sg_terms 1
   154   in
   155     Watcher.callResProvers(childout,atp_list);
   156     debug "Sent commands to watcher!"
   157   end
   158 
   159 (*We write out problem files for each subgoal, but work is repeated (skolemize)*)
   160 fun write_problem_files axclauses thm n =
   161     if n=0 then ()
   162      else
   163        (SELECT_GOAL
   164         (EVERY1 [rtac ccontr, ResLib.atomize_tac, skolemize_tac, 
   165           METAHYPS(fn negs => 
   166             (if !prover = "spass" 
   167              then dfg_inputs_tfrees (make_clauses negs) n axclauses
   168              else tptp_inputs_tfrees (make_clauses negs) n axclauses;
   169              write_problem_files axclauses thm (n-1); 
   170              all_tac))]) n thm;
   171         ());
   172 
   173 
   174 (******************************************************************)
   175 (* called in Isar automatically                                   *)
   176 (* writes out the current clasimpset to a tptp file               *)
   177 (* turns off xsymbol at start of function, restoring it at end    *)
   178 (******************************************************************)
   179 (*FIX changed to clasimp_file *)
   180 val isar_atp' = setmp print_mode [] 
   181  (fn (ctxt, thms, thm) =>
   182   if Thm.no_prems thm then ()
   183   else
   184     let
   185       val _= debug ("in isar_atp'")
   186       val thy = ProofContext.theory_of ctxt
   187       val prems = Thm.prems_of thm
   188       val thms_string = Meson.concat_with_and (map string_of_thm thms)
   189       val prems_string = Meson.concat_with_and (map (Sign.string_of_term thy) prems)
   190 
   191       (*set up variables for writing out the clasimps to a tptp file*)
   192       val (clause_arr, num_of_clauses, axclauses) =
   193         ResClasimp.get_clasimp_lemmas thy (hd prems) (*FIXME: hack!! need to do all prems*)
   194       val _ = debug ("claset and simprules total " ^ (string_of_int num_of_clauses)^
   195                   " clauses")
   196       val (childin, childout, pid) = 
   197           Watcher.createWatcher (thm, clause_arr, num_of_clauses)
   198       val pid_string =
   199         string_of_int (Word.toInt (Word.fromLargeWord (Posix.Process.pidToWord pid)))
   200     in
   201       debug ("initial thms: " ^ thms_string);
   202       debug ("subgoals: " ^ prems_string);
   203       debug ("pid: "^ pid_string);
   204       write_problem_files axclauses thm (length prems);
   205       watcher_call_provers (sign_of_thm thm) (Thm.prems_of thm) (childin, childout, pid)
   206     end);
   207 
   208 val isar_atp_writeonly = setmp print_mode [] 
   209  (fn (ctxt, thms, thm) =>
   210   if Thm.no_prems thm then ()
   211   else
   212     let
   213       val thy = ProofContext.theory_of ctxt
   214       val prems = Thm.prems_of thm
   215 
   216       (*set up variables for writing out the clasimps to a tptp file*)
   217       val (clause_arr, num_of_clauses, axclauses) =
   218         ResClasimp.get_clasimp_lemmas thy (hd prems) (*FIXME: hack!! need to do all prems*)
   219     in
   220       write_problem_files axclauses thm (length prems)
   221     end);
   222 
   223 fun get_thms_cs claset =
   224   let val {safeEs, safeIs, hazEs, hazIs, ...} = rep_cs claset
   225   in safeEs @ safeIs @ hazEs @ hazIs end;
   226 
   227 fun append_name name [] _ = []
   228   | append_name name (thm :: thms) k =
   229       Thm.name_thm ((name ^ "_" ^ string_of_int k), thm) :: append_name name thms (k + 1);
   230 
   231 fun append_names (name :: names) (thms :: thmss) =
   232   append_name name thms 0 :: append_names names thmss;
   233 
   234 fun get_thms_ss [] = []
   235   | get_thms_ss thms =
   236       let
   237         val names = map Thm.name_of_thm thms
   238         val thms' = map (mksimps mksimps_pairs) thms
   239         val thms'' = append_names names thms'
   240       in
   241         ResLib.flat_noDup thms''
   242       end;
   243 
   244 
   245 (* convert locally declared rules to axiom clauses *)
   246 
   247 fun subtract_simpset thy ctxt =
   248   let
   249     val rules1 = #rules (#1 (rep_ss (simpset_of thy)));
   250     val rules2 = #rules (#1 (rep_ss (local_simpset_of ctxt)));
   251   in map #thm (Net.subtract MetaSimplifier.eq_rrule rules1 rules2) end;
   252 
   253 fun subtract_claset thy ctxt =
   254   let
   255     val (netI1, netE1) = #xtra_netpair (rep_cs (claset_of thy));
   256     val (netI2, netE2) = #xtra_netpair (rep_cs (local_claset_of ctxt));
   257     val subtract = map (#2 o #2) oo Net.subtract Tactic.eq_kbrl;
   258   in subtract netI1 netI2 @ subtract netE1 netE2 end;
   259 
   260 
   261 
   262 (** the Isar toplevel hook **)
   263 
   264 val invoke_atp = Toplevel.unknown_proof o Toplevel.keep (fn state =>
   265   let
   266     val proof = Toplevel.proof_of state
   267     val (ctxt, (_, goal)) = Proof.get_goal proof
   268         handle Proof.STATE _ => error "No goal present";
   269 
   270     val thy = ProofContext.theory_of ctxt;
   271 
   272     (* FIXME presently unused *)
   273     val ss_thms = subtract_simpset thy ctxt;
   274     val cs_thms = subtract_claset thy ctxt;
   275   in
   276     debug ("initial thm in isar_atp: " ^ 
   277            Pretty.string_of (ProofContext.pretty_thm ctxt goal));
   278     debug ("subgoals in isar_atp: " ^ 
   279            Pretty.string_of (ProofContext.pretty_term ctxt
   280              (Logic.mk_conjunction_list (Thm.prems_of goal))));
   281     debug ("number of subgoals in isar_atp: " ^ string_of_int (Thm.nprems_of goal));
   282     hook_count := !hook_count +1;
   283     debug ("in hook for time: " ^(string_of_int (!hook_count)) );
   284     ResClause.init thy;
   285     isar_atp' (ctxt, ProofContext.prems_of ctxt, goal)
   286   end);
   287 
   288 val call_atpP =
   289   OuterSyntax.improper_command 
   290     "ProofGeneral.call_atp" 
   291     "call automatic theorem provers" 
   292     OuterKeyword.diag
   293     (Scan.succeed (Toplevel.no_timing o invoke_atp));
   294 
   295 val _ = OuterSyntax.add_parsers [call_atpP];
   296 
   297 end;