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 print_endline ("% SZS status Unsatisfiable for " ^
83 Filename.basename !problem_file);
84 print_endline ("% SZS output start CNFRefutation for " ^
85 Filename.basename !problem_file);
88 let (cl,_,_) = Terms.get_from_bag x bag in
89 print_endline (pp ~margin:max_int
91 print_endline ("% SZS output end CNFRefutation for " ^
92 Filename.basename !problem_file);
93 let prefix = string_of_int (Unix.getpid ()) in
94 let prerr_endline s = prerr_endline (prefix ^ ": " ^ s) in
95 let times = Unix.times () in
96 prerr_endline ("solved " ^ !problem_file ^ " in " ^ string_of_float
97 (times.Unix.tms_utime +. times.Unix.tms_stime) ^ " using " ^ ord);
100 let start_msg passives g_passives (pp : leaf Terms.unit_clause -> string) oname =
101 let prefix = string_of_int (Unix.getpid ()) in
102 let prerr_endline s = prerr_endline (prefix ^ ": " ^ s) in
103 prerr_endline "Facts:";
104 List.iter (fun x -> prerr_endline (" " ^ pp x)) passives;
105 prerr_endline "Goal:";
106 prerr_endline (" " ^ pp g_passives);
107 prerr_endline "Order:";
108 prerr_endline (" " ^ oname);
111 let report_error s = prerr_endline (string_of_int (Unix.getpid())^": "^s);;
113 module Main(C:Orderings.Blob with type t = leaf) = struct
114 let main goal hypotheses =
116 let module Pp = Pp.Pp(B) in
117 let module P = Paramod.Paramod(B) in
118 let bag = Terms.empty_bag, 0 in
119 let bag, g_passives = P.mk_goal bag goal in
121 HExtlib.list_mapi_acc (fun x _ b -> P.mk_passive b x) bag hypotheses
123 start_msg passives g_passives Pp.pp_unit_clause C.name;
126 ~max_steps:max_int bag ~g_passives:[g_passives] ~passives
128 | P.Error s -> report_error s; 3
129 | P.Unsatisfiable ((bag,_,l)::_) ->
130 success_msg bag l Pp.pp_unit_clause C.name; 0
131 | P.Unsatisfiable ([]) ->
132 report_error "Unsatisfiable but no solution output"; 3
139 let print_endline s = prerr_endline (string_of_int p ^ ": " ^ s) in
142 print_endline ("status Unsatisfiable for " ^
143 Filename.basename !problem_file);
145 print_endline ("status Timeout for " ^
146 Filename.basename !problem_file);
148 print_endline ("status GaveUp for " ^
149 Filename.basename !problem_file);
151 print_endline ("status Error for " ^
152 Filename.basename !problem_file);
153 | Unix.WEXITED _ -> assert false
154 | Unix.WSIGNALED s -> print_endline ("killed by signal " ^ string_of_int s)
155 | Unix.WSTOPPED _ -> print_endline "stopped"
159 List.iter (fun pid -> try Unix.kill pid 9 with _ -> ()) l
163 let childs = ref [] in
165 Sys.signal 24 (Sys.Signal_handle
166 (fun _ -> fail_msg (); killall !childs; exit 1))
169 Sys.signal Sys.sigalrm
170 (Sys.Signal_handle (fun _ -> fail_msg (); killall !childs; exit 1))
173 "--tptppath", Arg.String (fun p -> tptppath := p),
174 ("[path] TPTP lib root, default " ^ !tptppath);
175 "--timeout", Arg.Int (fun p -> seconds := p),
176 ("[seconds] timeout, default " ^ string_of_int !seconds);
177 ] (fun x -> problem_file := x) "
178 Matitaprover is the first order automatic prover that equips the
179 Matita interactive theorem prover (http://matita.cs.unibo.it).
181 Developed by A.Asperti, M.Denes and E.Tassi, released under GPL version 2
182 or at your option any later version.
184 If --tptppath is given, instead of the problem file you can just give the
185 problem name with the .p suffix (e.g. BOO001-1.p)
187 If --tptppath is not given, included files (i.e. axiom sets) are searched
188 in the current directory only.
190 usage: matitaprover [options] problemfile";
191 let hypotheses, goals = Tptp_cnf.parse ~tptppath:!tptppath !problem_file in
192 let goal = match goals with [x] -> x | _ -> assert false in
193 let _ = Unix.alarm !seconds in
197 let pid = Unix.fork () in
198 if pid = 0 then (exit (f ())) else pid)
201 let module M = Main(Orderings.NRKBO(MakeBlob(struct let cmp (a,_) (b,_) = compare a b end))) in
202 M.main goal hypotheses)
205 let module M = Main(Orderings.KBO(MakeBlob(struct let cmp (a,_) (b,_) = compare a b end))) in
206 M.main goal hypotheses)
209 let module M = Main(Orderings.LPO(MakeBlob(struct let cmp (a,_) (b,_) = compare a b end))) in
210 M.main goal hypotheses)
213 if List.length !childs = 0 then
214 (fail_msg (); exit 1)
216 match Unix.wait () with
217 | p, (Unix.WEXITED 0 as s) ->
219 killall !childs; exit 0;
222 childs := List.filter ((<>)p) !childs; aux ()