%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV167+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 02:53:52 PM UTC 2026
% Result : Theorem 0.13s 0.46s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 242 ( 69 equ)
% Maximal formula atoms : 45 ( 7 avg)
% Number of connectives : 268 ( 57 ~; 52 |; 100 &)
% ( 2 <=>; 57 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 16 con; 0-3 aty)
% Number of variables : 71 ( 0 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0011,conjecture,
( ( ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select2(sigmaold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X29] :
( ( leq(X29,n4)
& leq(n0,X29) )
=> a_select2(rhoold_init,X29) = init ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(muold_init,X28) = init ) )
& ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select3(center_init,X22,n0) = init )
& ! [X21] :
( ( leq(X21,pred(pv40))
& leq(n0,X21) )
=> a_select2(sigma_init,X21) = init )
& ! [X20] :
( ( leq(X20,pred(pv40))
& leq(n0,X20) )
=> a_select2(mu_init,X20) = init )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(rho_init,X4) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) )
& leq(pv40,n4)
& leq(n0,pv40)
& a_select2(sigma_init,pv40) = init
& a_select2(mu_init,pv40) = init )
=> ! [X11] :
( ( leq(X11,pv40)
& leq(n0,X11) )
=> a_select2(mu_init,X11) = init ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0011) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(leq_gt2,axiom,
! [X1,X2] :
( ( X1 != X2
& leq(X1,X2) )
=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(c_0_4,plain,
( epred2_0
<=> ( ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select2(sigmaold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X29] :
( ( leq(X29,n4)
& leq(n0,X29) )
=> a_select2(rhoold_init,X29) = init ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(muold_init,X28) = init ) )
& ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select3(center_init,X22,n0) = init )
& ! [X21] :
( ( leq(X21,pred(pv40))
& leq(n0,X21) )
=> a_select2(sigma_init,X21) = init )
& ! [X20] :
( ( leq(X20,pred(pv40))
& leq(n0,X20) )
=> a_select2(mu_init,X20) = init )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(rho_init,X4) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) )
& leq(pv40,n4)
& leq(n0,pv40)
& a_select2(sigma_init,pv40) = init
& a_select2(mu_init,pv40) = init ) ),
introduced(definition) ).
fof(c_0_5,plain,
( epred2_0
=> ( ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select2(sigmaold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X29] :
( ( leq(X29,n4)
& leq(n0,X29) )
=> a_select2(rhoold_init,X29) = init ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(muold_init,X28) = init ) )
& ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select3(center_init,X22,n0) = init )
& ! [X21] :
( ( leq(X21,pred(pv40))
& leq(n0,X21) )
=> a_select2(sigma_init,X21) = init )
& ! [X20] :
( ( leq(X20,pred(pv40))
& leq(n0,X20) )
=> a_select2(mu_init,X20) = init )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(rho_init,X4) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) )
& leq(pv40,n4)
& leq(n0,pv40)
& a_select2(sigma_init,pv40) = init
& a_select2(mu_init,pv40) = init ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
~ ( ( ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(X5,n4)
& leq(n0,X5) )
=> a_select2(sigmaold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X29] :
( ( leq(X29,n4)
& leq(n0,X29) )
=> a_select2(rhoold_init,X29) = init ) )
& ( gt(loopcounter,n1)
=> ! [X28] :
( ( leq(X28,n4)
& leq(n0,X28) )
=> a_select2(muold_init,X28) = init ) )
& ! [X22] :
( ( leq(X22,n4)
& leq(n0,X22) )
=> a_select3(center_init,X22,n0) = init )
& ! [X21] :
( ( leq(X21,pred(pv40))
& leq(n0,X21) )
=> a_select2(sigma_init,X21) = init )
& ! [X20] :
( ( leq(X20,pred(pv40))
& leq(n0,X20) )
=> a_select2(mu_init,X20) = init )
& ! [X4] :
( ( leq(X4,n4)
& leq(n0,X4) )
=> a_select2(rho_init,X4) = init )
& ! [X14] :
( ( leq(X14,n135299)
& leq(n0,X14) )
=> ! [X18] :
( ( leq(X18,n4)
& leq(n0,X18) )
=> a_select3(q_init,X14,X18) = init ) )
& leq(pv40,n4)
& leq(n0,pv40)
& a_select2(sigma_init,pv40) = init
& a_select2(mu_init,pv40) = init )
=> ! [X11] :
( ( leq(X11,pv40)
& leq(n0,X11) )
=> a_select2(mu_init,X11) = init ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_init_0011]) ).
fof(c_0_7,plain,
! [X203,X204,X205,X206,X207,X208,X209,X210,X211] :
( ( ~ epred2_0
| a_select2(sigmaold_init,X211) = init
| ~ leq(X211,n4)
| ~ leq(n0,X211)
| ~ gt(loopcounter,n1) )
& ( ~ epred2_0
| a_select2(rhoold_init,X210) = init
| ~ leq(X210,n4)
| ~ leq(n0,X210)
| ~ gt(loopcounter,n1) )
& ( ~ epred2_0
| a_select2(muold_init,X209) = init
| ~ leq(X209,n4)
| ~ leq(n0,X209)
| ~ gt(loopcounter,n1) )
& ( ~ epred2_0
| a_select3(center_init,X208,n0) = init
| ~ leq(X208,n4)
| ~ leq(n0,X208) )
& ( ~ epred2_0
| a_select2(sigma_init,X207) = init
| ~ leq(X207,pred(pv40))
| ~ leq(n0,X207) )
& ( ~ epred2_0
| a_select2(mu_init,X206) = init
| ~ leq(X206,pred(pv40))
| ~ leq(n0,X206) )
& ( ~ epred2_0
| a_select2(rho_init,X205) = init
| ~ leq(X205,n4)
| ~ leq(n0,X205) )
& ( ~ epred2_0
| a_select3(q_init,X203,X204) = init
| ~ leq(X204,n4)
| ~ leq(n0,X204)
| ~ leq(X203,n135299)
| ~ leq(n0,X203) )
& ( ~ epred2_0
| leq(pv40,n4) )
& ( ~ epred2_0
| leq(n0,pv40) )
& ( ~ epred2_0
| a_select2(sigma_init,pv40) = init )
& ( ~ epred2_0
| a_select2(mu_init,pv40) = init ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,plain,
! [X147] : minus(X147,n1) = pred(X147),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_9,negated_conjecture,
~ ( epred2_0
=> ! [X11] :
( ( leq(X11,pv40)
& leq(n0,X11) )
=> a_select2(mu_init,X11) = init ) ),
inference(apply_def,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_10,plain,
( ~ epred2_0
| ~ leq(X1,pred(pv40))
| ~ leq(n0,X1)
| a_select2(mu_init,X1) = init ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
( a_select2(mu_init,esk24_0) != init
& leq(esk24_0,pv40)
& leq(n0,esk24_0)
& epred2_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X48,X49] :
( ( leq(X48,pred(X49))
| ~ gt(X49,X48) )
& ( gt(X49,X48)
| ~ leq(X48,pred(X49)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
cnf(c_0_14,plain,
( ~ leq(X1,minus(pv40,n1))
| ~ leq(n0,X1)
| ~ epred2_0
| a_select2(mu_init,X1) = init ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
epred2_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ gt(X1,X2)
| leq(X2,pred(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ leq(n0,X1)
| ~ leq(X1,minus(pv40,n1))
| a_select2(mu_init,X1) = init ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_18,plain,
( ~ gt(X1,X2)
| leq(X2,minus(X1,n1)) ),
inference(rw,[status(thm)],[c_0_16,c_0_11]) ).
fof(c_0_19,plain,
! [X1,X2] :
( ( X1 != X2
& leq(X1,X2) )
=> gt(X2,X1) ),
inference(fof_simplification,[status(thm)],[leq_gt2]) ).
cnf(c_0_20,negated_conjecture,
a_select2(mu_init,esk24_0) != init,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( ~ gt(pv40,X1)
| ~ leq(n0,X1)
| a_select2(mu_init,X1) = init ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
leq(n0,esk24_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_23,plain,
! [X46,X47] :
( gt(X47,X46)
| X46 = X47
| ~ leq(X46,X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_24,negated_conjecture,
~ gt(pv40,esk24_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( ~ leq(X1,X2)
| gt(X2,X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
leq(esk24_0,pv40),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
( ~ epred2_0
| a_select2(mu_init,pv40) = init ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
esk24_0 = pv40,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
a_select2(mu_init,pv40) = init,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_15])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV167+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:33:32 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.13/0.46 % Version: 3.5.1
% 0.13/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.46 % Starting sh5l with 300s (1) cores
% 0.13/0.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3033109 completed with status 0
% 0.13/0.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.46 % No SInE strategy applied
% 0.13/0.46 % Search class: FGUSM-FSLM33-DFFFFFNN
% 0.13/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 169s (1) cores
% 0.13/0.46 % Starting new_bool_3 with 169s (1) cores
% 0.13/0.46 % Starting new_bool_1 with 169s (1) cores
% 0.13/0.46 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3033118 completed with status 0
% 0.13/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.13/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.46 % No SInE strategy applied
% 0.13/0.46 % Search class: FGUSM-FSLM33-DFFFFFNN
% 0.13/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 169s (1) cores
% 0.13/0.46 % Preprocessing time : 0.003 s
% 0.13/0.46 % Presaturation interreduction done
% 0.13/0.46
% 0.13/0.46 % Proof found!
% 0.13/0.46 % SZS status Theorem
% 0.13/0.46 % SZS output start CNFRefutation
% See solution above
% 0.13/0.46 % Parsed axioms : 92
% 0.13/0.46 % Removed by relevancy pruning/SinE : 0
% 0.13/0.46 % Initial clauses : 215
% 0.13/0.46 % Removed in clause preprocessing : 2
% 0.13/0.46 % Initial clauses in saturation : 213
% 0.13/0.46 % Processed clauses : 610
% 0.13/0.46 % ...of these trivial : 3
% 0.13/0.46 % ...subsumed : 143
% 0.13/0.46 % ...remaining for further processing : 464
% 0.13/0.46 % Other redundant clauses eliminated : 3
% 0.13/0.46 % Clauses deleted for lack of memory : 0
% 0.13/0.46 % Backward-subsumed : 1
% 0.13/0.46 % Backward-rewritten : 34
% 0.13/0.46 % Generated clauses : 604
% 0.13/0.46 % ...of the previous two non-redundant : 572
% 0.13/0.46 % ...aggressively subsumed : 0
% 0.13/0.46 % Contextual simplify-reflections : 0
% 0.13/0.46 % Paramodulations : 600
% 0.13/0.46 % Factorizations : 2
% 0.13/0.46 % NegExts : 0
% 0.13/0.46 % Equation resolutions : 3
% 0.13/0.46 % Disequality decompositions : 0
% 0.13/0.46 % Total rewrite steps : 327
% 0.13/0.46 % ...of those cached : 243
% 0.13/0.46 % Propositional unsat checks : 0
% 0.13/0.46 % Propositional check models : 0
% 0.13/0.46 % Propositional check unsatisfiable : 0
% 0.13/0.46 % Propositional clauses : 0
% 0.13/0.46 % Propositional clauses after purity: 0
% 0.13/0.46 % Propositional unsat core size : 0
% 0.13/0.46 % Propositional preprocessing time : 0.000
% 0.13/0.46 % Propositional encoding time : 0.000
% 0.13/0.46 % Propositional solver time : 0.000
% 0.13/0.46 % Success case prop preproc time : 0.000
% 0.13/0.46 % Success case prop encoding time : 0.000
% 0.13/0.46 % Success case prop solver time : 0.000
% 0.13/0.46 % Current number of processed clauses : 214
% 0.13/0.46 % Positive orientable unit clauses : 95
% 0.13/0.46 % Positive unorientable unit clauses: 5
% 0.13/0.46 % Negative unit clauses : 56
% 0.13/0.46 % Non-unit-clauses : 58
% 0.13/0.46 % Current number of unprocessed clauses: 381
% 0.13/0.46 % ...number of literals in the above : 1212
% 0.13/0.46 % Current number of archived formulas : 0
% 0.13/0.46 % Current number of archived clauses : 250
% 0.13/0.46 % Clause-clause subsumption calls (NU) : 9749
% 0.13/0.46 % Rec. Clause-clause subsumption calls : 2032
% 0.13/0.46 % Non-unit clause-clause subsumptions : 8
% 0.13/0.46 % Unit Clause-clause subsumption calls : 1553
% 0.13/0.46 % Rewrite failures with RHS unbound : 0
% 0.13/0.46 % BW rewrite match attempts : 59
% 0.13/0.46 % BW rewrite match successes : 51
% 0.13/0.46 % Condensation attempts : 0
% 0.13/0.46 % Condensation successes : 0
% 0.13/0.46 % Termbank termtop insertions : 23668
% 0.13/0.46 % Search garbage collected termcells : 2380
% 0.13/0.46
% 0.13/0.46 % -------------------------------------------------
% 0.13/0.46 % User time : 0.037 s
% 0.13/0.46 % System time : 0.004 s
% 0.13/0.46 % Total time : 0.041 s
% 0.13/0.46 % Maximum resident set size: 4268 pages
% 0.13/0.46
% 0.13/0.46 % -------------------------------------------------
% 0.13/0.46 % User time : 0.129 s
% 0.13/0.46 % System time : 0.022 s
% 0.13/0.46 % Total time : 0.152 s
% 0.13/0.46 % Maximum resident set size: 4608 pages
% 0.13/0.46 % E exiting
%------------------------------------------------------------------------------