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 =
+ (* 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
- (fst(Terms.get_from_bag 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) =
+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:";
prerr_endline "Goal:";
prerr_endline (" " ^ pp g_passives);
prerr_endline "Order:";
- prerr_endline " ...fixme...";
- prerr_endline "Strategy:";
- prerr_endline " ...fixme...";
+ prerr_endline (" " ^ oname);
;;
let report_error s = prerr_endline (string_of_int (Unix.getpid())^": "^s);;
-module Main(C:LeafComparer) = struct
- let main goal hypotheses =
- let module B = MakeBlob(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;
+module Main(P : Paramod.Paramod with type t = leaf) = struct
+
+ let run bag g_passives 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.pp_unit_clause; 0
+ success_msg bag l pp_unit_clause name; 0
| P.Unsatisfiable ([]) ->
report_error "Unsatisfiable but no solution output"; 3
| P.GaveUp -> 2
;;
end
+let worker order 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 (* just for processing the clauses *)
+ let module P = Paramod.Paramod(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
+ (* TODO: do stats analysys there and generate a new
+ * C and then B
+ * TODO: rebuild clauses, since the ordering has to
+ * change after the stats are computed *)
+ let module C = C in
+ let module B = MakeBlob(C) in
+ match order with
+ | `NRKBO ->
+ let module O = Orderings.NRKBO(B) in
+ let module Main = Main(Paramod.Paramod(O)) in
+ start_msg passives g_passives Pp.pp_unit_clause O.name;
+ Main.run bag g_passives passives Pp.pp_unit_clause O.name
+ | `KBO ->
+ let module O = Orderings.KBO(B) in
+ let module Main = Main(Paramod.Paramod(O)) in
+ start_msg passives g_passives Pp.pp_unit_clause O.name;
+ Main.run bag g_passives passives Pp.pp_unit_clause O.name
+ | `LPO ->
+ let module O = Orderings.LPO(B) in
+ let module Main = Main(Paramod.Paramod(O)) in
+ start_msg passives g_passives Pp.pp_unit_clause O.name;
+ Main.run bag g_passives passives Pp.pp_unit_clause O.name
+;;
+
let print_status p =
let print_endline s = prerr_endline (string_of_int p ^ ": " ^ s) in
function
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)
let pid = Unix.fork () in
if pid = 0 then (exit (f ())) else pid)
[
- (fun () ->
- let module M = Main(struct let cmp (a,_) (b,_) = compare a b end) in
- M.main goal hypotheses)
+ (fun () -> worker `NRKBO goal hypotheses)
+ ;
+ (fun () -> worker `KBO goal hypotheses)
;
- (fun () ->
- let module M = Main(struct let cmp (a,_) (b,_) = compare b a end) in
- M.main goal hypotheses)
+ (fun () -> worker `LPO goal hypotheses)
];
let rec aux () =
if List.length !childs = 0 then
projects / helm.git / blobdiff