print_endline ("% SZS status Timeout for " ^
Filename.basename !problem_file)
;;
+
+module type LeafComparer =
+ sig
+ val cmp : leaf -> leaf -> int
+ end
+;;
-let main () =
- let _ =
- Sys.signal 24 (Sys.Signal_handle (fun _ -> fail_msg (); exit 1)) in
- let _ =
- Sys.signal Sys.sigalrm
- (Sys.Signal_handle (fun _ -> fail_msg (); exit 1)) in
- 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-2.1
-
-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 module B : Terms.Blob
+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,_) = Pervasives.compare a b
+ let compare a b = C.cmp a b
let eqP = hash "=="
let pp (_,a) = a
type input = Ast.term
let embed t = snd(embed [] t);;
end
+;;
+
+let success_msg bag l (pp : ?margin:int -> leaf Terms.unit_clause -> string) ord =
+ (* TODO: do some sort of poor man lock (open + OEXCL) so that
+ * just one thread at a time prints the proof *)
+ 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 stats passives g_passives (pp : ?margin:int -> 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);
+ prerr_endline "Leaf order:";
+ List.iter (fun ((_,name), (a,b,c,gp,l)) ->
+ prerr_endline (" " ^name ^ " " ^ string_of_int a ^ " " ^
+ string_of_int b ^ " " ^
+ string_of_int c ^ " " ^
+ String.concat "," (List.map string_of_int gp) ^
+ String.concat "," (List.map snd l))) stats;
+;;
+
+let report_error s = prerr_endline (string_of_int (Unix.getpid())^": "^s);;
+
+module Main(P : Paramod.Paramod with type t = leaf) = struct
+
+ let run stats goal hypotheses pp_unit_clause name =
+ 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 stats passives g_passives pp_unit_clause 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_unit_clause name; 0
+ | P.Unsatisfiable ([]) ->
+ report_error "Unsatisfiable but no solution output"; 3
+ | P.GaveUp -> 2
+ | P.Timeout _ -> 1
+ ;;
+end
+
+ let compute_stats goal hypotheses =
+ let module C =
+ struct type t = leaf let cmp (a,_) (b,_) = Pervasives.compare a b end
+ in
+ let module B = MakeBlob(C) in
+ let module Pp = Pp.Pp(B) in
+ let module O = Orderings.NRKBO(B) in
+ let module P = Paramod.Paramod(O) in
+ let module Stats = Stats.Stats(O) 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
+ let data = Stats.parse_symbols passives g_passives in
+ let data =
+ List.map
+ (fun (name, n_occ, arity, n_gocc, g_pos) ->
+ name, (n_occ, arity, n_gocc, g_pos, Stats.dependencies name passives))
+ data
+ in
+ List.sort
+ (fun (n1,(o1,a1,go1,p1,d1)) (n2,(o2,a2,go2,p2,d2)) ->
+ Pervasives.compare
+ (a1,o1,go1,p1,d1) (a2,o2,go2,p2,d2))
+ data
+ ;;
+
+let worker order goal hypotheses =
+ let stats = compute_stats goal hypotheses in
+ let module C =
+ struct
+ let cmp =
+ let raw = List.map snd stats in
+ let rec pos x = function
+ | ((y,_)::tl) when y = x -> 0
+ | _::tl -> 1 + pos x tl
+ | [] -> assert false
+ in
+ if List.length raw =
+ List.length (HExtlib.list_uniq raw)
+ then
+ (prerr_endline "NO CLASH, using fixed ground order";
+ fun a b ->
+ Pervasives.compare
+ (pos a stats)
+ (pos b stats))
+ else
+ (prerr_endline "CLASH, statistics insufficient";
+ fun (a,_) (b,_) -> Pervasives.compare a b)
+ ;;
+ end
+ in
+ let module B = MakeBlob(C) in
+ let module Pp = Pp.Pp(B) in
+ match order with
+ | `NRKBO ->
+ let module O = Orderings.NRKBO(B) in
+ let module Main = Main(Paramod.Paramod(O)) in
+ Main.run stats goal hypotheses Pp.pp_unit_clause O.name
+ | `KBO ->
+ let module O = Orderings.KBO(B) in
+ let module Main = Main(Paramod.Paramod(O)) in
+ Main.run stats goal hypotheses Pp.pp_unit_clause O.name
+ | `LPO ->
+ let module O = Orderings.LPO(B) in
+ let module Main = Main(Paramod.Paramod(O)) in
+ Main.run stats goal hypotheses Pp.pp_unit_clause O.name
+;;
+
+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 () -> worker `NRKBO goal hypotheses)
+ ;
+ (fun () -> worker `KBO goal hypotheses)
+ ;
+ (fun () -> worker `LPO 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 "Order";
- HC.iter
- (fun _ (w,x) -> prerr_endline (" " ^ x ^ " is " ^ string_of_int w)) !cache;
- prerr_endline "Facts";
- List.iter (fun x -> prerr_endline (" " ^ Pp.pp_unit_clause x)) passives;
- prerr_endline "Goal";
- prerr_endline (" " ^ Pp.pp_unit_clause g_passives);
- (* let _ = Unix.alarm !seconds in *)
- match P.paramod ~timeout:(Unix.gettimeofday () +. float_of_int !seconds) ~max_steps:max_int bag ~g_passives:[g_passives] ~passives with
- | [] -> fail_msg ()
- | (bag,_,l)::_ ->
- 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 ->
- print_endline (Pp.pp_unit_clause ~margin:max_int
- (fst(Terms.M.find x bag)))) l;
- print_endline ("% SZS output end CNFRefutation for " ^
- Filename.basename !problem_file);
+ aux ()
;;
main ()
projects / helm.git / blobdiff