2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
12 (* $Id: orderings.ml 9869 2009-06-11 22:52:38Z denes $ *)
14 module OT = struct type t = string let compare = Pervasives.compare end
15 module HC = Map.Make(OT)
17 type leaf = int * string
19 let cache = ref HC.empty
25 cache := HC.add s (!num,s) !cache;
33 let problem_file = ref "no-file-given";;
34 let tptppath = ref "/";;
35 let seconds = ref 300;;
38 print_endline ("% SZS status Timeout for " ^
39 Filename.basename !problem_file)
42 module type LeafComparer =
44 val cmp : leaf -> leaf -> int
48 module MakeBlob(C:LeafComparer) : Terms.Blob
49 with type t = leaf and type input = Ast.term = struct
52 let compare a b = C.cmp a b
56 let rec embed m = function
57 | Ast.Variable name ->
58 (try m, List.assoc name m
60 let t = Terms.Var ~-(List.length m) in
62 | Ast.Constant name -> m, Terms.Leaf (hash name)
63 | Ast.Function (name,args) ->
66 (fun x _ m -> embed m x) m args
68 m, Terms.Node (Terms.Leaf (hash name):: args)
71 let vars, ty = embed [] ty in
72 let _, bo = embed vars bo in
73 let bo = Terms.Node (bo :: List.map snd (List.rev vars)) in
76 let embed t = snd(embed [] t);;
81 let success_msg bag l (pp : ?margin:int -> leaf Terms.unit_clause -> string) ord =
82 (* TODO: do some sort of poor man lock (open + OEXCL) so that
83 * just one thread at a time prints the proof *)
84 print_endline ("% SZS status Unsatisfiable for " ^
85 Filename.basename !problem_file);
86 print_endline ("% SZS output start CNFRefutation for " ^
87 Filename.basename !problem_file);
90 let (cl,_,_) = Terms.get_from_bag x bag in
91 print_endline (pp ~margin:max_int
93 print_endline ("% SZS output end CNFRefutation for " ^
94 Filename.basename !problem_file);
95 let prefix = string_of_int (Unix.getpid ()) in
96 let prerr_endline s = prerr_endline (prefix ^ ": " ^ s) in
97 let times = Unix.times () in
98 prerr_endline ("solved " ^ !problem_file ^ " in " ^ string_of_float
99 (times.Unix.tms_utime +. times.Unix.tms_stime) ^ " using " ^ ord);
102 let start_msg passives g_passives (pp : leaf Terms.unit_clause -> string) oname =
103 let prefix = string_of_int (Unix.getpid ()) in
104 let prerr_endline s = prerr_endline (prefix ^ ": " ^ s) in
105 prerr_endline "Facts:";
106 List.iter (fun x -> prerr_endline (" " ^ pp x)) passives;
107 prerr_endline "Goal:";
108 prerr_endline (" " ^ pp g_passives);
109 prerr_endline "Order:";
110 prerr_endline (" " ^ oname);
113 let report_error s = prerr_endline (string_of_int (Unix.getpid())^": "^s);;
115 module Main(P : Paramod.Paramod with type t = leaf) = struct
117 let run bag g_passives passives pp_unit_clause name =
120 ~max_steps:max_int bag ~g_passives:[g_passives] ~passives
122 | P.Error s -> report_error s; 3
123 | P.Unsatisfiable ((bag,_,l)::_) ->
124 success_msg bag l pp_unit_clause name; 0
125 | P.Unsatisfiable ([]) ->
126 report_error "Unsatisfiable but no solution output"; 3
132 let worker order goal hypotheses =
134 struct type t = leaf let cmp (a,_) (b,_) = Pervasives.compare a b end
136 let module B = MakeBlob(C) in
137 let module Pp = Pp.Pp(B) in
138 let module O = Orderings.NRKBO(B) in (* just for processing the clauses *)
139 let module P = Paramod.Paramod(O) in
140 let bag = Terms.empty_bag, 0 in
141 let bag, g_passives = P.mk_goal bag goal in
143 HExtlib.list_mapi_acc (fun x _ b -> P.mk_passive b x) bag hypotheses
145 (* TODO: do stats analysys there and generate a new
147 * TODO: rebuild clauses, since the ordering has to
148 * change after the stats are computed *)
150 let module B = MakeBlob(C) in
153 let module O = Orderings.NRKBO(B) in
154 let module Main = Main(Paramod.Paramod(O)) in
155 start_msg passives g_passives Pp.pp_unit_clause O.name;
156 Main.run bag g_passives passives Pp.pp_unit_clause O.name
158 let module O = Orderings.KBO(B) in
159 let module Main = Main(Paramod.Paramod(O)) in
160 start_msg passives g_passives Pp.pp_unit_clause O.name;
161 Main.run bag g_passives passives Pp.pp_unit_clause O.name
163 let module O = Orderings.LPO(B) in
164 let module Main = Main(Paramod.Paramod(O)) in
165 start_msg passives g_passives Pp.pp_unit_clause O.name;
166 Main.run bag g_passives passives Pp.pp_unit_clause O.name
170 let print_endline s = prerr_endline (string_of_int p ^ ": " ^ s) in
173 print_endline ("status Unsatisfiable for " ^
174 Filename.basename !problem_file);
176 print_endline ("status Timeout for " ^
177 Filename.basename !problem_file);
179 print_endline ("status GaveUp for " ^
180 Filename.basename !problem_file);
182 print_endline ("status Error for " ^
183 Filename.basename !problem_file);
184 | Unix.WEXITED _ -> assert false
185 | Unix.WSIGNALED s -> print_endline ("killed by signal " ^ string_of_int s)
186 | Unix.WSTOPPED _ -> print_endline "stopped"
190 List.iter (fun pid -> try Unix.kill pid 9 with _ -> ()) l
194 let childs = ref [] in
196 Sys.signal 24 (Sys.Signal_handle
197 (fun _ -> fail_msg (); killall !childs; exit 1))
200 Sys.signal Sys.sigalrm
201 (Sys.Signal_handle (fun _ -> fail_msg (); killall !childs; exit 1))
204 "--tptppath", Arg.String (fun p -> tptppath := p),
205 ("[path] TPTP lib root, default " ^ !tptppath);
206 "--timeout", Arg.Int (fun p -> seconds := p),
207 ("[seconds] timeout, default " ^ string_of_int !seconds);
208 ] (fun x -> problem_file := x) "
209 Matitaprover is the first order automatic prover that equips the
210 Matita interactive theorem prover (http://matita.cs.unibo.it).
212 Developed by A.Asperti, M.Denes and E.Tassi, released under GPL version 2
213 or at your option any later version.
215 If --tptppath is given, instead of the problem file you can just give the
216 problem name with the .p suffix (e.g. BOO001-1.p)
218 If --tptppath is not given, included files (i.e. axiom sets) are searched
219 in the current directory only.
221 usage: matitaprover [options] problemfile";
222 let hypotheses, goals = Tptp_cnf.parse ~tptppath:!tptppath !problem_file in
223 let goal = match goals with [x] -> x | _ -> assert false in
224 let _ = Unix.alarm !seconds in
228 let pid = Unix.fork () in
229 if pid = 0 then (exit (f ())) else pid)
231 (fun () -> worker `NRKBO goal hypotheses)
233 (fun () -> worker `KBO goal hypotheses)
235 (fun () -> worker `LPO goal hypotheses)
238 if List.length !childs = 0 then
239 (fail_msg (); exit 1)
241 match Unix.wait () with
242 | p, (Unix.WEXITED 0 as s) ->
244 killall !childs; exit 0;
247 childs := List.filter ((<>)p) !childs; aux ()