%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS010-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:00:33 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of clauses : 67 ( 6 unt; 27 nHn; 67 RR)
% Number of literals : 227 ( 0 equ; 134 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 87 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_31,axiom,
( ~ d(X3)
| ~ d(X2)
| ~ r(X1,X3)
| ~ r(X1,X2)
| equalish(X2,X3)
| f(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_31) ).
cnf(clause_22,axiom,
( ~ r3least(X1)
| r(X1,u2r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_22) ).
cnf(clause_3,axiom,
( ~ a(X1)
| d(X1)
| c(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_8,axiom,
( ~ r(X2,X1)
| ~ e(X2)
| a(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_7,axiom,
( ~ e(X1)
| r3least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_23,axiom,
( ~ r3least(X1)
| r(X1,u2r2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_23) ).
cnf(clause_19,axiom,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_19) ).
cnf(clause_6,axiom,
( ~ c(X2)
| ~ c(X1)
| ~ r(X3,X2)
| ~ r(X3,X1)
| ~ e(X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_24,axiom,
( ~ r3least(X1)
| r(X1,u2r3(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_24) ).
cnf(clause_21,axiom,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_20,axiom,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_13,plain,
( ~ d(X3)
| ~ d(X2)
| ~ r(X1,X3)
| ~ r(X1,X2)
| equalish(X2,X3)
| f(X1) ),
inference(fof_simplification,[status(thm)],[clause_31]) ).
cnf(c_0_14,plain,
( ~ r3least(X1)
| r(X1,u2r1(X1)) ),
inference(fof_simplification,[status(thm)],[clause_22]) ).
cnf(c_0_15,plain,
( ~ d(X3)
| ~ d(X2)
| ~ r(X1,X3)
| ~ r(X1,X2)
| equalish(X2,X3)
| f(X1) ),
c_0_13 ).
cnf(c_0_16,plain,
( ~ r3least(X1)
| r(X1,u2r1(X1)) ),
c_0_14 ).
cnf(c_0_17,plain,
( ~ a(X1)
| d(X1)
| c(X1) ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_18,plain,
( ~ r(X2,X1)
| ~ e(X2)
| a(X1) ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_19,plain,
( ~ e(X1)
| r3least(X1) ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_20,plain,
( ~ d(X1)
| ~ d(u2r1(X2))
| ~ r(X2,X1)
| ~ r3least(X2)
| f(X2)
| equalish(X1,u2r1(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ a(X1)
| d(X1)
| c(X1) ),
c_0_17 ).
cnf(c_0_22,plain,
( ~ r(X2,X1)
| ~ e(X2)
| a(X1) ),
c_0_18 ).
cnf(c_0_23,plain,
( ~ e(X1)
| r3least(X1) ),
c_0_19 ).
cnf(c_0_24,plain,
( ~ d(X1)
| ~ a(u2r1(X2))
| ~ r(X2,X1)
| ~ r3least(X2)
| f(X2)
| c(u2r1(X2))
| equalish(X1,u2r1(X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ e(X1)
| a(u2r1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_23]) ).
cnf(c_0_26,plain,
( ~ r3least(X1)
| r(X1,u2r2(X1)) ),
inference(fof_simplification,[status(thm)],[clause_23]) ).
cnf(c_0_27,plain,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[clause_19]) ).
cnf(c_0_28,plain,
( ~ e(X2)
| ~ d(X1)
| ~ r(X2,X1)
| f(X2)
| c(u2r1(X2))
| equalish(X1,u2r1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23]) ).
cnf(c_0_29,plain,
( ~ r3least(X1)
| r(X1,u2r2(X1)) ),
c_0_26 ).
cnf(c_0_30,plain,
( ~ c(X2)
| ~ c(X1)
| ~ r(X3,X2)
| ~ r(X3,X1)
| ~ e(X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_31,plain,
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
c_0_27 ).
cnf(c_0_32,plain,
( ~ e(X1)
| ~ d(u2r2(X1))
| f(X1)
| c(u2r1(X1))
| equalish(u2r2(X1),u2r1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23]) ).
cnf(c_0_33,plain,
( ~ d(X1)
| ~ d(u2r2(X2))
| ~ r(X2,X1)
| ~ r3least(X2)
| f(X2)
| equalish(X1,u2r2(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_34,plain,
( ~ c(X2)
| ~ c(X1)
| ~ r(X3,X2)
| ~ r(X3,X1)
| ~ e(X3)
| equalish(X1,X2) ),
c_0_30 ).
cnf(c_0_35,plain,
( ~ e(X1)
| ~ d(u2r2(X1))
| f(X1)
| c(u2r1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23]) ).
cnf(c_0_36,plain,
( ~ e(X1)
| a(u2r2(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_23]) ).
cnf(c_0_37,plain,
( ~ d(X1)
| ~ a(u2r2(X2))
| ~ r(X2,X1)
| ~ r3least(X2)
| f(X2)
| c(u2r2(X2))
| equalish(X1,u2r2(X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_38,plain,
( ~ r3least(X1)
| r(X1,u2r3(X1)) ),
inference(fof_simplification,[status(thm)],[clause_24]) ).
cnf(c_0_39,plain,
( ~ e(X2)
| ~ c(X1)
| ~ c(u2r1(X2))
| ~ r(X2,X1)
| equalish(X1,u2r1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_16]),c_0_23]) ).
cnf(c_0_40,plain,
( ~ e(X1)
| f(X1)
| c(u2r1(X1))
| c(u2r2(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_21]),c_0_36]) ).
cnf(c_0_41,plain,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[clause_21]) ).
cnf(c_0_42,plain,
( ~ e(X2)
| ~ d(X1)
| ~ r(X2,X1)
| f(X2)
| c(u2r2(X2))
| equalish(X1,u2r2(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_23]) ).
cnf(c_0_43,plain,
( ~ r3least(X1)
| r(X1,u2r3(X1)) ),
c_0_38 ).
cnf(c_0_44,plain,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
inference(fof_simplification,[status(thm)],[clause_20]) ).
cnf(c_0_45,plain,
( ~ e(X2)
| ~ c(X1)
| ~ r(X2,X1)
| f(X2)
| c(u2r2(X2))
| equalish(X1,u2r1(X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
c_0_41 ).
cnf(c_0_47,plain,
( ~ e(X1)
| ~ d(u2r3(X1))
| f(X1)
| c(u2r2(X1))
| equalish(u2r3(X1),u2r2(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_23]) ).
cnf(c_0_48,plain,
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
c_0_44 ).
cnf(c_0_49,plain,
( ~ e(X1)
| ~ c(u2r3(X1))
| f(X1)
| c(u2r2(X1))
| equalish(u2r3(X1),u2r1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_43]),c_0_23]) ).
cnf(c_0_50,plain,
( ~ e(X1)
| ~ d(u2r3(X1))
| f(X1)
| c(u2r2(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_23]) ).
cnf(c_0_51,plain,
( ~ e(X1)
| a(u2r3(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_43]),c_0_23]) ).
cnf(c_0_52,plain,
( ~ e(X1)
| ~ c(u2r3(X1))
| f(X1)
| c(u2r2(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_23]) ).
cnf(c_0_53,plain,
( ~ e(X2)
| ~ c(X1)
| ~ c(u2r2(X2))
| ~ r(X2,X1)
| equalish(X1,u2r2(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_23]) ).
cnf(c_0_54,plain,
( ~ e(X1)
| f(X1)
| c(u2r2(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_21]),c_0_51]),c_0_52]) ).
cnf(c_0_55,plain,
( ~ e(X1)
| ~ d(u2r3(X1))
| f(X1)
| c(u2r1(X1))
| equalish(u2r3(X1),u2r1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_43]),c_0_23]) ).
cnf(c_0_56,plain,
( ~ e(X2)
| ~ c(X1)
| ~ r(X2,X1)
| f(X2)
| equalish(X1,u2r2(X2)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( ~ e(X1)
| ~ d(u2r3(X1))
| f(X1)
| c(u2r1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_55]),c_0_23]) ).
cnf(c_0_58,plain,
( ~ e(X1)
| ~ c(u2r3(X1))
| f(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_56]),c_0_43]),c_0_23]) ).
cnf(c_0_59,plain,
( ~ e(X1)
| f(X1)
| c(u2r1(X1))
| c(u2r3(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_21]),c_0_51]) ).
cnf(c_0_60,plain,
( ~ e(X1)
| f(X1)
| c(u2r1(X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,negated_conjecture,
~ f(exist),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_62,plain,
( ~ e(X2)
| ~ c(X1)
| ~ r(X2,X1)
| f(X2)
| equalish(X1,u2r1(X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
~ f(exist),
c_0_61 ).
cnf(c_0_64,plain,
( ~ e(X1)
| f(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_62]),c_0_54]),c_0_29]),c_0_23]) ).
cnf(c_0_65,negated_conjecture,
e(exist),
clause_1 ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS010-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 22:50:05 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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.14/0.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1661590 completed with status 0
% 0.14/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.42 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % SubtermCWHack with pid 1661594 completed with status 0
% 0.14/0.42 % Result found by SubtermCWHack
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Preprocessing time : 0.001 s
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Unsatisfiable
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 31
% 0.14/0.42 % Removed by relevancy pruning/SinE : 0
% 0.14/0.42 % Initial clauses : 31
% 0.14/0.42 % Removed in clause preprocessing : 0
% 0.14/0.42 % Initial clauses in saturation : 31
% 0.14/0.42 % Processed clauses : 92
% 0.14/0.42 % ...of these trivial : 0
% 0.14/0.42 % ...subsumed : 8
% 0.14/0.42 % ...remaining for further processing : 84
% 0.14/0.42 % Other redundant clauses eliminated : 0
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 28
% 0.14/0.42 % Backward-rewritten : 0
% 0.14/0.42 % Generated clauses : 121
% 0.14/0.42 % ...of the previous two non-redundant : 69
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 36
% 0.14/0.42 % Paramodulations : 121
% 0.14/0.42 % Factorizations : 0
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 0
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 3
% 0.14/0.42 % ...of those cached : 2
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 56
% 0.14/0.42 % Positive orientable unit clauses : 2
% 0.14/0.42 % Positive unorientable unit clauses: 0
% 0.14/0.42 % Negative unit clauses : 1
% 0.14/0.42 % Non-unit-clauses : 53
% 0.14/0.42 % Current number of unprocessed clauses: 7
% 0.14/0.42 % ...number of literals in the above : 47
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 28
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 2977
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 525
% 0.14/0.42 % Non-unit clause-clause subsumptions : 72
% 0.14/0.42 % Unit Clause-clause subsumption calls : 3
% 0.14/0.42 % Rewrite failures with RHS unbound : 0
% 0.14/0.42 % BW rewrite match attempts : 0
% 0.14/0.42 % BW rewrite match successes : 0
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 4187
% 0.14/0.42 % Search garbage collected termcells : 88
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.006 s
% 0.14/0.42 % System time : 0.002 s
% 0.14/0.42 % Total time : 0.008 s
% 0.14/0.42 % Maximum resident set size: 3652 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.024 s
% 0.14/0.42 % System time : 0.010 s
% 0.14/0.42 % Total time : 0.034 s
% 0.14/0.42 % Maximum resident set size: 4864 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------