%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC002-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:44:29 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 53 ( 17 unt; 1 nHn; 53 RR)
% Number of literals : 176 ( 53 equ; 128 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_20,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(sk2,sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_26,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk7,cons(sk6,nil)),sk8) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_26) ).
cnf(co1_27,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk7,sk8) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_27) ).
cnf(co1_23,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_23) ).
cnf(co1_25,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_25) ).
cnf(co1_24,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_24) ).
cnf(co1_19,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_22,negated_conjecture,
( ~ neq(sk4,nil)
| X1 != sk5(X3,X2,X1)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_22) ).
cnf(co1_28,negated_conjecture,
( ~ neq(sk4,nil)
| ~ geq(X1,sk6)
| ~ memberP(sk4,X1)
| ~ ssItem(X1)
| sk6 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_28) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_21,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| geq(sk5(X3,X2,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_21) ).
cnf(c_0_13,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(sk2,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_20]) ).
cnf(c_0_15,negated_conjecture,
neq(sk2,nil),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk7,cons(sk6,nil)),sk8) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_26]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk7,sk8) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_27]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk6) ),
inference(fof_simplification,[status(thm)],[co1_23]) ).
cnf(c_0_20,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk8) ),
inference(fof_simplification,[status(thm)],[co1_25]) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
inference(fof_simplification,[status(thm)],[co1_24]) ).
cnf(c_0_22,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| X1 != sk5(X3,X2,X1)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_22]) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(sk4,nil)
| ~ geq(X1,sk6)
| ~ memberP(sk4,X1)
| ~ ssItem(X1)
| sk6 = X1 ),
inference(fof_simplification,[status(thm)],[co1_28]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(sk2,sk5(X3,X2,X1)) ),
c_0_14 ).
cnf(c_0_26,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_27,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk7,cons(sk6,nil)),sk8) = sk4 ),
c_0_17 ).
cnf(c_0_28,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk7,sk8) = sk3 ),
c_0_18 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk6) ),
c_0_19 ).
cnf(c_0_31,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk8) ),
c_0_20 ).
cnf(c_0_32,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
c_0_21 ).
cnf(c_0_33,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
c_0_22 ).
cnf(c_0_34,negated_conjecture,
( ~ neq(sk4,nil)
| X1 != sk5(X3,X2,X1)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_23 ).
cnf(c_0_35,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| geq(sk5(X3,X2,X1),X1) ),
inference(fof_simplification,[status(thm)],[co1_21]) ).
cnf(c_0_36,negated_conjecture,
( ~ neq(sk4,nil)
| ~ geq(X1,sk6)
| ~ memberP(sk4,X1)
| ~ ssItem(X1)
| sk6 = X1 ),
c_0_24 ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| app(X2,X1) != sk1
| app(app(X2,cons(X3,nil)),X1) != sk4
| memberP(sk4,sk5(X1,X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_16]),c_0_16]),c_0_26])]) ).
cnf(c_0_38,negated_conjecture,
app(app(sk7,cons(sk6,nil)),sk8) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_26])]) ).
cnf(c_0_39,negated_conjecture,
app(sk7,sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_26])]) ).
cnf(c_0_40,negated_conjecture,
ssItem(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_26])]) ).
cnf(c_0_41,negated_conjecture,
ssList(sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_26])]) ).
cnf(c_0_42,negated_conjecture,
ssList(sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_26])]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| app(X2,X1) != sk1
| app(app(X2,cons(X3,nil)),X1) != sk4
| ssItem(sk5(X1,X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_16]),c_0_26])]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2)
| app(X1,X3) != sk1
| sk5(X3,X1,X2) != X2
| app(app(X1,cons(X2,nil)),X3) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_16]),c_0_26])]) ).
cnf(c_0_45,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| geq(sk5(X3,X2,X1),X1) ),
c_0_35 ).
cnf(c_0_46,negated_conjecture,
( ~ ssItem(X1)
| ~ geq(X1,sk6)
| ~ memberP(sk4,X1)
| sk6 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_26])]) ).
cnf(c_0_47,negated_conjecture,
memberP(sk4,sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_48,negated_conjecture,
ssItem(sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_38]),c_0_39]),c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_49,negated_conjecture,
sk5(sk8,sk7,sk6) != sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_38]),c_0_39]),c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| app(X2,X1) != sk1
| app(app(X2,cons(X3,nil)),X1) != sk4
| geq(sk5(X1,X2,X3),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_16]),c_0_26])]) ).
cnf(c_0_51,negated_conjecture,
~ geq(sk5(sk8,sk7,sk6),sk6),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_38]),c_0_39]),c_0_40]),c_0_41]),c_0_42])]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC002-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n015.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 : Mon Sep 21 07:51:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 965625 completed with status 0
% 0.10/0.45 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.10/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.10/0.45 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.10/0.45 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.10/0.45 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.10/0.45 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.45 % U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 965633 completed with status 0
% 0.10/0.45 % Result found by U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.10/0.45 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.10/0.45 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.10/0.45 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.10/0.45 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.45 % Preprocessing time : 0.002 s
% 0.10/0.45 % Presaturation interreduction done
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Unsatisfiable
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 213
% 0.10/0.45 % Removed by relevancy pruning/SinE : 0
% 0.10/0.45 % Initial clauses : 213
% 0.10/0.45 % Removed in clause preprocessing : 0
% 0.10/0.45 % Initial clauses in saturation : 213
% 0.10/0.45 % Processed clauses : 304
% 0.10/0.45 % ...of these trivial : 13
% 0.10/0.45 % ...subsumed : 6
% 0.10/0.45 % ...remaining for further processing : 285
% 0.10/0.45 % Other redundant clauses eliminated : 24
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 0
% 0.10/0.45 % Backward-rewritten : 1
% 0.10/0.45 % Generated clauses : 34
% 0.10/0.45 % ...of the previous two non-redundant : 32
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 2
% 0.10/0.45 % Paramodulations : 11
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 24
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 83
% 0.10/0.45 % ...of those cached : 70
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 67
% 0.10/0.45 % Positive orientable unit clauses : 53
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 4
% 0.10/0.45 % Non-unit-clauses : 10
% 0.10/0.45 % Current number of unprocessed clauses: 135
% 0.10/0.45 % ...number of literals in the above : 500
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 195
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 7233
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 709
% 0.10/0.45 % Non-unit clause-clause subsumptions : 8
% 0.10/0.45 % Unit Clause-clause subsumption calls : 24
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 1
% 0.10/0.45 % BW rewrite match successes : 1
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 10571
% 0.10/0.45 % Search garbage collected termcells : 597
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.014 s
% 0.10/0.45 % System time : 0.002 s
% 0.10/0.45 % Total time : 0.016 s
% 0.10/0.45 % Maximum resident set size: 4080 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.065 s
% 0.10/0.45 % System time : 0.018 s
% 0.10/0.45 % Total time : 0.083 s
% 0.10/0.45 % Maximum resident set size: 4864 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------