%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA031-1.003 : TPTP v9.3.1. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:58:54 PM UTC 2026
% Result : Unsatisfiable 153.61s 45.83s
% Output : CNFRefutation 153.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 20
% Syntax : Number of clauses : 74 ( 37 unt; 0 nHn; 74 RR)
% Number of literals : 120 ( 0 equ; 49 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-8 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 271 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk1,axiom,
( ~ path(X5,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| s(X1,X2,X3,X4,X9,X6,X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk1) ).
cnf(map7,axiom,
path(s2,p1_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map7) ).
cnf(map6,axiom,
path(p1_2,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map6) ).
cnf(init,axiom,
s(s1,s2,s2,s0,s2,s0,s1,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',init) ).
cnf(load1,axiom,
( ~ s(X1,X2,X3,X4,X5,X6,X1,X7)
| s(truck1,X2,X3,X4,X5,X6,X1,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load1) ).
cnf(drive1,axiom,
( ~ link(X6,X8)
| ~ s(X1,X2,X3,X4,truck1,X5,X6,X7)
| s(X1,X2,X3,X4,truck1,X5,X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive1) ).
cnf(board1,axiom,
( ~ neq(X6,truck1)
| ~ s(X1,X2,X3,X4,X5,X6,X5,X7)
| s(X1,X2,X3,X4,truck1,X6,X5,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board1) ).
cnf(map13,axiom,
link(s1,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map13) ).
cnf(neq17,axiom,
neq(s0,truck1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq17) ).
cnf(load2,axiom,
( ~ s(truck1,X2,X3,X4,X5,X6,X1,X7)
| s(X1,X2,X3,X4,X5,X6,X1,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load2) ).
cnf(load9,axiom,
( ~ s(X1,X2,X3,X4,X5,X6,X3,X7)
| s(X1,X2,truck1,X4,X5,X6,X3,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load9) ).
cnf(map15,axiom,
link(s2,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map15) ).
cnf(load10,axiom,
( ~ s(X1,X2,truck1,X4,X5,X6,X3,X7)
| s(X1,X2,X3,X4,X5,X6,X3,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load10) ).
cnf(load13,axiom,
( ~ s(X1,X2,X3,X4,X5,X6,X4,X7)
| s(X1,X2,X3,truck1,X5,X6,X4,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load13) ).
cnf(map16,axiom,
link(s0,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map16) ).
cnf(load14,axiom,
( ~ s(X1,X2,X3,truck1,X5,X6,X4,X7)
| s(X1,X2,X3,X4,X5,X6,X4,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load14) ).
cnf(board2,axiom,
( ~ s(X1,X2,X3,X4,truck1,X6,X5,X7)
| s(X1,X2,X3,X4,X5,X6,X5,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board2) ).
cnf(map1,axiom,
path(s0,p0_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map1) ).
cnf(map4,axiom,
path(p0_1,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map4) ).
cnf(goal,negated_conjecture,
~ s(s2,s2,s0,s2,s1,X1,s0,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_20,plain,
( ~ path(X5,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| s(X1,X2,X3,X4,X9,X6,X7,X8) ),
inference(fof_simplification,[status(thm)],[walk1]) ).
cnf(c_0_21,plain,
( ~ path(X5,X9)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| s(X1,X2,X3,X4,X9,X6,X7,X8) ),
c_0_20 ).
cnf(c_0_22,axiom,
path(s2,p1_2),
map7 ).
cnf(c_0_23,axiom,
path(p1_2,s1),
map6 ).
cnf(c_0_24,plain,
( ~ s(X1,X2,X3,X4,s2,X5,X6,X7)
| s(X1,X2,X3,X4,p1_2,X5,X6,X7) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
s(s1,s2,s2,s0,s2,s0,s1,s1),
init ).
cnf(c_0_26,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X1,X7)
| s(truck1,X2,X3,X4,X5,X6,X1,X7) ),
inference(fof_simplification,[status(thm)],[load1]) ).
cnf(c_0_27,plain,
( ~ s(X1,X2,X3,X4,p1_2,X5,X6,X7)
| s(X1,X2,X3,X4,s1,X5,X6,X7) ),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_28,plain,
s(s1,s2,s2,s0,p1_2,s0,s1,s1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ link(X6,X8)
| ~ s(X1,X2,X3,X4,truck1,X5,X6,X7)
| s(X1,X2,X3,X4,truck1,X5,X8,X7) ),
inference(fof_simplification,[status(thm)],[drive1]) ).
cnf(c_0_30,plain,
( ~ neq(X6,truck1)
| ~ s(X1,X2,X3,X4,X5,X6,X5,X7)
| s(X1,X2,X3,X4,truck1,X6,X5,X7) ),
inference(fof_simplification,[status(thm)],[board1]) ).
cnf(c_0_31,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X1,X7)
| s(truck1,X2,X3,X4,X5,X6,X1,X7) ),
c_0_26 ).
cnf(c_0_32,plain,
s(s1,s2,s2,s0,s1,s0,s1,s1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( ~ link(X6,X8)
| ~ s(X1,X2,X3,X4,truck1,X5,X6,X7)
| s(X1,X2,X3,X4,truck1,X5,X8,X7) ),
c_0_29 ).
cnf(c_0_34,axiom,
link(s1,s2),
map13 ).
cnf(c_0_35,plain,
( ~ neq(X6,truck1)
| ~ s(X1,X2,X3,X4,X5,X6,X5,X7)
| s(X1,X2,X3,X4,truck1,X6,X5,X7) ),
c_0_30 ).
cnf(c_0_36,plain,
s(truck1,s2,s2,s0,s1,s0,s1,s1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,axiom,
neq(s0,truck1),
neq17 ).
cnf(c_0_38,plain,
( ~ s(truck1,X2,X3,X4,X5,X6,X1,X7)
| s(X1,X2,X3,X4,X5,X6,X1,X7) ),
inference(fof_simplification,[status(thm)],[load2]) ).
cnf(c_0_39,plain,
( ~ s(X1,X2,X3,X4,truck1,X5,s1,X6)
| s(X1,X2,X3,X4,truck1,X5,s2,X6) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
s(truck1,s2,s2,s0,truck1,s0,s1,s1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_41,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X3,X7)
| s(X1,X2,truck1,X4,X5,X6,X3,X7) ),
inference(fof_simplification,[status(thm)],[load9]) ).
cnf(c_0_42,plain,
( ~ s(truck1,X2,X3,X4,X5,X6,X1,X7)
| s(X1,X2,X3,X4,X5,X6,X1,X7) ),
c_0_38 ).
cnf(c_0_43,plain,
s(truck1,s2,s2,s0,truck1,s0,s2,s1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,axiom,
link(s2,s0),
map15 ).
cnf(c_0_45,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X3,X7)
| s(X1,X2,truck1,X4,X5,X6,X3,X7) ),
c_0_41 ).
cnf(c_0_46,plain,
s(s2,s2,s2,s0,truck1,s0,s2,s1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
( ~ s(X1,X2,truck1,X4,X5,X6,X3,X7)
| s(X1,X2,X3,X4,X5,X6,X3,X7) ),
inference(fof_simplification,[status(thm)],[load10]) ).
cnf(c_0_48,plain,
( ~ s(X1,X2,X3,X4,truck1,X5,s2,X6)
| s(X1,X2,X3,X4,truck1,X5,s0,X6) ),
inference(spm,[status(thm)],[c_0_33,c_0_44]) ).
cnf(c_0_49,plain,
s(s2,s2,truck1,s0,truck1,s0,s2,s1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X4,X7)
| s(X1,X2,X3,truck1,X5,X6,X4,X7) ),
inference(fof_simplification,[status(thm)],[load13]) ).
cnf(c_0_51,plain,
( ~ s(X1,X2,truck1,X4,X5,X6,X3,X7)
| s(X1,X2,X3,X4,X5,X6,X3,X7) ),
c_0_47 ).
cnf(c_0_52,plain,
s(s2,s2,truck1,s0,truck1,s0,s0,s1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,axiom,
link(s0,s2),
map16 ).
cnf(c_0_54,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X4,X7)
| s(X1,X2,X3,truck1,X5,X6,X4,X7) ),
c_0_50 ).
cnf(c_0_55,plain,
s(s2,s2,s0,s0,truck1,s0,s0,s1),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( ~ s(X1,X2,X3,truck1,X5,X6,X4,X7)
| s(X1,X2,X3,X4,X5,X6,X4,X7) ),
inference(fof_simplification,[status(thm)],[load14]) ).
cnf(c_0_57,plain,
( ~ s(X1,X2,X3,X4,truck1,X5,s0,X6)
| s(X1,X2,X3,X4,truck1,X5,s2,X6) ),
inference(spm,[status(thm)],[c_0_33,c_0_53]) ).
cnf(c_0_58,plain,
s(s2,s2,s0,truck1,truck1,s0,s0,s1),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
( ~ s(X1,X2,X3,truck1,X5,X6,X4,X7)
| s(X1,X2,X3,X4,X5,X6,X4,X7) ),
c_0_56 ).
cnf(c_0_60,plain,
s(s2,s2,s0,truck1,truck1,s0,s2,s1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
( ~ s(X1,X2,X3,X4,truck1,X6,X5,X7)
| s(X1,X2,X3,X4,X5,X6,X5,X7) ),
inference(fof_simplification,[status(thm)],[board2]) ).
cnf(c_0_62,plain,
s(s2,s2,s0,s2,truck1,s0,s2,s1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,axiom,
path(s0,p0_1),
map1 ).
cnf(c_0_64,plain,
( ~ s(X1,X2,X3,X4,truck1,X6,X5,X7)
| s(X1,X2,X3,X4,X5,X6,X5,X7) ),
c_0_61 ).
cnf(c_0_65,plain,
s(s2,s2,s0,s2,truck1,s0,s0,s1),
inference(spm,[status(thm)],[c_0_48,c_0_62]) ).
cnf(c_0_66,axiom,
path(p0_1,s1),
map4 ).
cnf(c_0_67,plain,
( ~ s(X1,X2,X3,X4,s0,X5,X6,X7)
| s(X1,X2,X3,X4,p0_1,X5,X6,X7) ),
inference(spm,[status(thm)],[c_0_21,c_0_63]) ).
cnf(c_0_68,plain,
s(s2,s2,s0,s2,s0,s0,s0,s1),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
~ s(s2,s2,s0,s2,s1,X1,s0,X2),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_70,plain,
( ~ s(X1,X2,X3,X4,p0_1,X5,X6,X7)
| s(X1,X2,X3,X4,s1,X5,X6,X7) ),
inference(spm,[status(thm)],[c_0_21,c_0_66]) ).
cnf(c_0_71,plain,
s(s2,s2,s0,s2,p0_1,s0,s0,s1),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
~ s(s2,s2,s0,s2,s1,X1,s0,X2),
c_0_69 ).
cnf(c_0_73,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PLA031-1.003 : TPTP v9.3.1. Released v3.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/15.37 % Computer : n012.cluster.edu
% 0.08/15.37 % Model : x86_64 x86_64
% 0.08/15.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/15.37 % Memory : 8046.5625MB
% 0.08/15.37 % OS : Linux 6.8.0-71-generic
% 0.08/15.37 % CPULimit : 300
% 0.08/15.37 % WCLimit : 300
% 0.08/15.37 % DateTime : Mon Sep 21 03:33:25 UTC 2026
% 0.08/15.37 % CPUTime :
% 0.08/15.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/15.39 Running first-order theorem proving
% 0.08/15.39 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 153.61/45.83 % Version: 3.5.1
% 153.61/45.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 153.61/45.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 153.61/45.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 153.61/45.83 % Starting new_bool_3 with 300s (1) cores
% 153.61/45.83 % Starting new_bool_1 with 300s (1) cores
% 153.61/45.83 % Starting sh5l with 300s (1) cores
% 153.61/45.83 % new_bool_1 with pid 1473883 completed with status 9
% 153.61/45.83 % new_bool_3 with pid 1473882 completed with status 9
% 153.61/45.83 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1473881 completed with status 0
% 153.61/45.83 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 153.61/45.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 153.61/45.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 153.61/45.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 153.61/45.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 153.61/45.83 % No SInE strategy applied
% 153.61/45.83 % Search class: FHUNF-FFMM00-SFFFFFNN
% 153.61/45.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 153.61/45.83 % Starting SubtermCWHack with 136s (1) cores
% 153.61/45.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 153.61/45.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 153.61/45.83 % Starting new_bool_3 with 136s (1) cores
% 153.61/45.83 % Starting new_bool_1 with 136s (1) cores
% 153.61/45.83 % new_bool_1 with pid 1473892 completed with status 0
% 153.61/45.83 % Result found by new_bool_1
% 153.61/45.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 153.61/45.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 153.61/45.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 153.61/45.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 153.61/45.83 % No SInE strategy applied
% 153.61/45.83 % Search class: FHUNF-FFMM00-SFFFFFNN
% 153.61/45.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 153.61/45.83 % Starting SubtermCWHack with 136s (1) cores
% 153.61/45.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 153.61/45.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 153.61/45.83 % Starting new_bool_3 with 136s (1) cores
% 153.61/45.83 % Starting new_bool_1 with 136s (1) cores
% 153.61/45.83 % Preprocessing time : 0.001 s
% 153.61/45.83 % Presaturation interreduction done
% 153.61/45.83
% 153.61/45.83 % Proof found!
% 153.61/45.83 % SZS status Unsatisfiable
% 153.61/45.83 % SZS output start CNFRefutation
% See solution above
% 153.61/45.83 % Parsed axioms : 112
% 153.61/45.83 % Removed by relevancy pruning/SinE : 0
% 153.61/45.83 % Initial clauses : 112
% 153.61/45.83 % Removed in clause preprocessing : 0
% 153.61/45.83 % Initial clauses in saturation : 112
% 153.61/45.83 % Processed clauses : 165817
% 153.61/45.83 % ...of these trivial : 97263
% 153.61/45.83 % ...subsumed : 4917
% 153.61/45.83 % ...remaining for further processing : 63637
% 153.61/45.83 % Other redundant clauses eliminated : 0
% 153.61/45.83 % Clauses deleted for lack of memory : 0
% 153.61/45.83 % Backward-subsumed : 0
% 153.61/45.83 % Backward-rewritten : 0
% 153.61/45.83 % Generated clauses : 494308
% 153.61/45.83 % ...of the previous two non-redundant : 324206
% 153.61/45.83 % ...aggressively subsumed : 0
% 153.61/45.83 % Contextual simplify-reflections : 0
% 153.61/45.83 % Paramodulations : 494308
% 153.61/45.83 % Factorizations : 0
% 153.61/45.83 % NegExts : 0
% 153.61/45.83 % Equation resolutions : 0
% 153.61/45.83 % Disequality decompositions : 0
% 153.61/45.83 % Total rewrite steps : 307455
% 153.61/45.83 % ...of those cached : 246264
% 153.61/45.83 % Propositional unsat checks : 12
% 153.61/45.83 % Propositional check models : 2
% 153.61/45.83 % Propositional check unsatisfiable : 0
% 153.61/45.83 % Propositional clauses : 0
% 153.61/45.83 % Propositional clauses after purity: 0
% 153.61/45.83 % Propositional unsat core size : 0
% 153.61/45.83 % Propositional preprocessing time : 0.000
% 153.61/45.83 % Propositional encoding time : 0.360
% 153.61/45.83 % Propositional solver time : 0.725
% 153.61/45.83 % Success case prop preproc time : 0.000
% 153.61/45.83 % Success case prop encoding time : 0.000
% 153.61/45.83 % Success case prop solver time : 0.000
% 153.61/45.83 % Current number of processed clauses : 63525
% 153.61/45.83 % Positive orientable unit clauses : 63446
% 153.61/45.83 % Positive unorientable unit clauses: 0
% 153.61/45.83 % Negative unit clauses : 9
% 153.61/45.83 % Non-unit-clauses : 70
% 153.61/45.83 % Current number of unprocessed clauses: 158611
% 153.61/45.83 % ...number of literals in the above : 158611
% 153.61/45.83 % Current number of archived formulas : 0
% 153.61/45.83 % Current number of archived clauses : 112
% 153.61/45.83 % Clause-clause subsumption calls (NU) : 1724
% 153.61/45.83 % Rec. Clause-clause subsumption calls : 1724
% 153.61/45.83 % Non-unit clause-clause subsumptions : 0
% 153.61/45.83 % Unit Clause-clause subsumption calls : 0
% 153.61/45.83 % Rewrite failures with RHS unbound : 0
% 153.61/45.83 % BW rewrite match attempts : 142968080
% 153.61/45.83 % BW rewrite match successes : 0
% 153.61/45.83 % Condensation attempts : 0
% 153.61/45.83 % Condensation successes : 0
% 153.61/45.83 % Termbank termtop insertions : 6115827
% 153.61/45.83 % Search garbage collected termcells : 106
% 153.61/45.83
% 153.61/45.83 % -------------------------------------------------
% 153.61/45.83 % User time : 30.020 s
% 153.61/45.83 % System time : 0.308 s
% 153.61/45.83 % Total time : 30.327 s
% 153.61/45.83 % Maximum resident set size: 3436 pages
% 153.61/45.83
% 153.61/45.83 % -------------------------------------------------
% 153.61/45.83 % User time : 152.026 s
% 153.61/45.83 % System time : 1.480 s
% 153.61/45.83 % Total time : 153.506 s
% 153.61/45.83 % Maximum resident set size: 4864 pages
% 153.61/45.83 % E exiting
%------------------------------------------------------------------------------