X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Fbinaries%2Fmatitaprover%2Fmatitaprover.ml;h=1c837f18dc464830f06ad65caee4a0568d1c2118;hb=2bcf927f58bac034b8758173cdbd16cb7475de36;hp=5a438c7b6fa700d9a139669b32765db58530bb60;hpb=d4d8691cd71651c778eacd6cc8d7ecc6f51d41df;p=helm.git diff --git a/helm/software/components/binaries/matitaprover/matitaprover.ml b/helm/software/components/binaries/matitaprover/matitaprover.ml index 5a438c7b6..1c837f18d 100644 --- a/helm/software/components/binaries/matitaprover/matitaprover.ml +++ b/helm/software/components/binaries/matitaprover/matitaprover.ml @@ -1,61 +1,227 @@ -let main () = - let problem_file = ref "no-file-given" in - let tptppath = ref "./" in - Arg.parse [ - "--tptppath", Arg.String (fun p -> tptppath := p), "[path] TPTP lib root" - ] (fun x -> problem_file := x) "matitaprover [problemfile]"; - let hypotheses, goals = Tptp_cnf.parse ~tptppath:!tptppath !problem_file in - let goal = match goals with [x] -> x | _ -> assert false in - let module B : Terms.Blob with type t = Ast.term = struct - type t = Ast.term - let eq a b = a = b - let compare = Pervasives.compare - let eqP = Ast.Constant "==" - let pp = function - | Ast.Constant x -> x - | Ast.Variable _ -> assert false - | Ast.Function _ -> assert false - ;; - let embed x = - let rec aux m = function +(* + ||M|| This file is part of HELM, an Hypertextual, Electronic + ||A|| Library of Mathematics, developed at the Computer Science + ||T|| Department, University of Bologna, Italy. + ||I|| + ||T|| HELM is free software; you can redistribute it and/or + ||A|| modify it under the terms of the GNU General Public License + \ / version 2 or (at your option) any later version. + \ / This software is distributed as is, NO WARRANTY. + V_______________________________________________________________ *) + +(* $Id: orderings.ml 9869 2009-06-11 22:52:38Z denes $ *) + +module OT = struct type t = string let compare = Pervasives.compare end +module HC = Map.Make(OT) + +type leaf = int * string + +let cache = ref HC.empty +let num = ref 100 + +let hash s = + try HC.find s !cache + with Not_found -> + cache := HC.add s (!num,s) !cache; + decr num; + HC.find s !cache +;; + +hash "==";; +hash "_";; + +let problem_file = ref "no-file-given";; +let tptppath = ref "/";; +let seconds = ref 300;; + +let fail_msg () = + print_endline ("% SZS status Timeout for " ^ + Filename.basename !problem_file) +;; + +module type LeafComparer = + sig + val cmp : leaf -> leaf -> int + end +;; + +module MakeBlob(C:LeafComparer) : Terms.Blob + with type t = leaf and type input = Ast.term = struct + type t = leaf + let eq a b = a == b + let compare a b = C.cmp a b + let eqP = hash "==" + let pp (_,a) = a + type input = Ast.term + let rec embed m = function | Ast.Variable name -> (try m, List.assoc name m with Not_found -> - let t = Terms.Var (List.length m) in + let t = Terms.Var ~-(List.length m) in (name,t)::m, t) - | Ast.Constant _ as t -> m, Terms.Leaf t + | Ast.Constant name -> m, Terms.Leaf (hash name) | Ast.Function (name,args) -> let m, args = HExtlib.list_mapi_acc - (fun x _ m -> aux m x) m args + (fun x _ m -> embed m x) m args in - m, Terms.Node (Terms.Leaf (Ast.Constant name):: args) - in - aux [] x + m, Terms.Node (Terms.Leaf (hash name):: args) ;; let saturate bo ty = - let vars, ty = embed ty in - let _, bo = embed bo in + let vars, ty = embed [] ty in + let _, bo = embed vars bo in let bo = Terms.Node (bo :: List.map snd (List.rev vars)) in bo, ty ;; - let embed t = snd(embed t);; + let embed t = snd(embed [] t);; end +;; + +let success_msg bag l (pp : ?margin:int -> leaf Terms.unit_clause -> string) ord = + print_endline ("% SZS status Unsatisfiable for " ^ + Filename.basename !problem_file); + print_endline ("% SZS output start CNFRefutation for " ^ + Filename.basename !problem_file); + flush stdout; + List.iter (fun x -> + let (cl,_,_) = Terms.get_from_bag x bag in + print_endline (pp ~margin:max_int + cl)) l; + print_endline ("% SZS output end CNFRefutation for " ^ + Filename.basename !problem_file); + let prefix = string_of_int (Unix.getpid ()) in + let prerr_endline s = prerr_endline (prefix ^ ": " ^ s) in + let times = Unix.times () in + prerr_endline ("solved " ^ !problem_file ^ " in " ^ string_of_float + (times.Unix.tms_utime +. times.Unix.tms_stime) ^ " using " ^ ord); +;; + +let start_msg passives g_passives (pp : leaf Terms.unit_clause -> string) oname = + let prefix = string_of_int (Unix.getpid ()) in + let prerr_endline s = prerr_endline (prefix ^ ": " ^ s) in + prerr_endline "Facts:"; + List.iter (fun x -> prerr_endline (" " ^ pp x)) passives; + prerr_endline "Goal:"; + prerr_endline (" " ^ pp g_passives); + prerr_endline "Order:"; + prerr_endline (" " ^ oname); +;; + +let report_error s = prerr_endline (string_of_int (Unix.getpid())^": "^s);; + +module Main(C:Orderings.Blob with type t = leaf) = struct + let main goal hypotheses = + let module B = C in + let module Pp = Pp.Pp(B) in + let module P = Paramod.Paramod(B) in + let bag = Terms.empty_bag, 0 in + let bag, g_passives = P.mk_goal bag goal in + let bag, passives = + HExtlib.list_mapi_acc (fun x _ b -> P.mk_passive b x) bag hypotheses + in + start_msg passives g_passives Pp.pp_unit_clause C.name; + match + P.paramod + ~max_steps:max_int bag ~g_passives:[g_passives] ~passives + with + | P.Error s -> report_error s; 3 + | P.Unsatisfiable ((bag,_,l)::_) -> + success_msg bag l Pp.pp_unit_clause C.name; 0 + | P.Unsatisfiable ([]) -> + report_error "Unsatisfiable but no solution output"; 3 + | P.GaveUp -> 2 + | P.Timeout _ -> 1 + ;; +end + +let print_status p = + let print_endline s = prerr_endline (string_of_int p ^ ": " ^ s) in + function + | Unix.WEXITED 0 -> + print_endline ("status Unsatisfiable for " ^ + Filename.basename !problem_file); + | Unix.WEXITED 1 -> + print_endline ("status Timeout for " ^ + Filename.basename !problem_file); + | Unix.WEXITED 2 -> + print_endline ("status GaveUp for " ^ + Filename.basename !problem_file); + | Unix.WEXITED 3 -> + print_endline ("status Error for " ^ + Filename.basename !problem_file); + | Unix.WEXITED _ -> assert false + | Unix.WSIGNALED s -> print_endline ("killed by signal " ^ string_of_int s) + | Unix.WSTOPPED _ -> print_endline "stopped" + ;; + +let killall l = + List.iter (fun pid -> try Unix.kill pid 9 with _ -> ()) l +;; + +let main () = + let childs = ref [] in + let _ = + Sys.signal 24 (Sys.Signal_handle + (fun _ -> fail_msg (); killall !childs; exit 1)) + in + let _ = + Sys.signal Sys.sigalrm + (Sys.Signal_handle (fun _ -> fail_msg (); killall !childs; exit 1)) in - let module P = Paramod.Paramod(B) in - let module Pp = Pp.Pp(B) in - let bag = Terms.M.empty, 0 in - let bag, g_passives = P.mk_goal bag goal in - let bag, passives = - HExtlib.list_mapi_acc (fun x _ b -> P.mk_passive b x) bag hypotheses + Arg.parse [ + "--tptppath", Arg.String (fun p -> tptppath := p), + ("[path] TPTP lib root, default " ^ !tptppath); + "--timeout", Arg.Int (fun p -> seconds := p), + ("[seconds] timeout, default " ^ string_of_int !seconds); + ] (fun x -> problem_file := x) " +Matitaprover is the first order automatic prover that equips the +Matita interactive theorem prover (http://matita.cs.unibo.it). + +Developed by A.Asperti, M.Denes and E.Tassi, released under GPL version 2 +or at your option any later version. + +If --tptppath is given, instead of the problem file you can just give the +problem name with the .p suffix (e.g. BOO001-1.p) + +If --tptppath is not given, included files (i.e. axiom sets) are searched +in the current directory only. + +usage: matitaprover [options] problemfile"; + let hypotheses, goals = Tptp_cnf.parse ~tptppath:!tptppath !problem_file in + let goal = match goals with [x] -> x | _ -> assert false in + let _ = Unix.alarm !seconds in + childs := + List.map + (fun f -> + let pid = Unix.fork () in + if pid = 0 then (exit (f ())) else pid) + [ + (fun () -> + let module M = Main(Orderings.NRKBO(MakeBlob(struct let cmp (a,_) (b,_) = compare a b end))) in + M.main goal hypotheses) + ; + (fun () -> + let module M = Main(Orderings.KBO(MakeBlob(struct let cmp (a,_) (b,_) = compare a b end))) in + M.main goal hypotheses) + ; + (fun () -> + let module M = Main(Orderings.LPO(MakeBlob(struct let cmp (a,_) (b,_) = compare a b end))) in + M.main goal hypotheses) + ]; + let rec aux () = + if List.length !childs = 0 then + (fail_msg (); exit 1) + else + match Unix.wait () with + | p, (Unix.WEXITED 0 as s) -> + print_status p s; + killall !childs; exit 0; + | p, s -> + print_status p s; + childs := List.filter ((<>)p) !childs; aux () in - prerr_endline "Facts"; - prerr_endline (String.concat "\n" (List.map Pp.pp_unit_clause passives)); - prerr_endline "Goal"; - prerr_endline (Pp.pp_unit_clause g_passives); - ignore(P.paramod bag ~g_passives:[g_passives] ~passives); - () + aux () ;; main ()