end
;;
-let success_msg bag l (pp : ?margin:int -> leaf Terms.unit_clause -> string) =
+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
- (fst(Terms.M.find x bag)))) l;
+ cl)) l;
print_endline ("% SZS output end CNFRefutation for " ^
- Filename.basename !problem_file)
+ 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) =
- prerr_endline (string_of_int (Unix.getpid ()));
-(*
- prerr_endline "Facts";
+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 "Goal:";
+ prerr_endline (" " ^ pp g_passives);
+ prerr_endline "Order:";
+ prerr_endline (" " ^ oname);
;;
-module Main(C:LeafComparer) = struct
+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 = MakeBlob(C) in
+ let module B = C in
let module Pp = Pp.Pp(B) in
let module P = Paramod.Paramod(B) in
- let bag = Terms.M.empty, 0 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;
+ 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
- | [] -> ()
- | (bag,_,l)::_ -> success_msg bag l Pp.pp_unit_clause
+ | 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
;;
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
+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)
List.map
(fun f ->
let pid = Unix.fork () in
- if pid = 0 then (f ();exit 0) else pid)
+ if pid = 0 then (exit (f ())) else pid)
[
(fun () ->
- let module M = Main(struct let cmp (a,_) (b,_) = compare a b end) in
+ 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(struct let cmp (a,_) (b,_) = compare b a end) in
+ 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 _ = Unix.wait () in
- killall !childs;
- exit 0;
+ 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
+ aux ()
;;
main ()