%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU371+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:24:53 PM UTC 2026
% Result : Theorem 0.48s 0.69s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 19 unt; 0 def)
% Number of atoms : 163 ( 28 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 168 ( 44 ~; 38 |; 81 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 22 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 9 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t29_yellow_0,axiom,
! [X1] :
( ( latt_str(X1)
& complete_latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( meet_of_latt_set(X1,X2) = meet_on_relstr(poset_of_lattice(X1),X2)
& join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t29_yellow_0) ).
fof(fc1_knaster,axiom,
! [X1] :
( complete_latt_str(boole_lattice(X1))
& boolean_lattstr(boole_lattice(X1))
& complemented_lattstr(boole_lattice(X1))
& bounded_lattstr(boole_lattice(X1))
& upper_bounded_semilattstr(boole_lattice(X1))
& lower_bounded_semilattstr(boole_lattice(X1))
& modular_lattstr(boole_lattice(X1))
& distributive_lattstr(boole_lattice(X1))
& lattice(boole_lattice(X1))
& join_absorbing(boole_lattice(X1))
& meet_absorbing(boole_lattice(X1))
& meet_associative(boole_lattice(X1))
& meet_commutative(boole_lattice(X1))
& join_associative(boole_lattice(X1))
& join_commutative(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_knaster) ).
fof(t50_lattice3,axiom,
! [X1] :
( ( latt_str(X1)
& complete_latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ( bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set)
& latt_str(X1)
& lower_bounded_semilattstr(X1)
& lattice(X1)
& ~ empty_carrier(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_lattice3) ).
fof(t18_yellow_1,conjecture,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_yellow_1) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( latt_str(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lattice3) ).
fof(t3_lattice3,axiom,
! [X1] :
( bottom_of_semilattstr(boole_lattice(X1)) = empty_set
& lower_bounded_semilattstr(boole_lattice(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_lattice3) ).
fof(dt_k3_yellow_1,axiom,
! [X1] :
( rel_str(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k3_yellow_1) ).
fof(d2_yellow_1,axiom,
! [X1] : boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_yellow_1) ).
fof(d11_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_yellow_0) ).
fof(c_0_9,plain,
! [X1] :
( ( latt_str(X1)
& complete_latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( meet_of_latt_set(X1,X2) = meet_on_relstr(poset_of_lattice(X1),X2)
& join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2) ) ),
inference(fof_simplification,[status(thm)],[t29_yellow_0]) ).
fof(c_0_10,plain,
! [X1] :
( complete_latt_str(boole_lattice(X1))
& boolean_lattstr(boole_lattice(X1))
& complemented_lattstr(boole_lattice(X1))
& bounded_lattstr(boole_lattice(X1))
& upper_bounded_semilattstr(boole_lattice(X1))
& lower_bounded_semilattstr(boole_lattice(X1))
& modular_lattstr(boole_lattice(X1))
& distributive_lattstr(boole_lattice(X1))
& lattice(boole_lattice(X1))
& join_absorbing(boole_lattice(X1))
& meet_absorbing(boole_lattice(X1))
& meet_associative(boole_lattice(X1))
& meet_commutative(boole_lattice(X1))
& join_associative(boole_lattice(X1))
& join_commutative(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_knaster]) ).
fof(c_0_11,plain,
! [X1] :
( ( latt_str(X1)
& complete_latt_str(X1)
& lattice(X1)
& ~ empty_carrier(X1) )
=> ( bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set)
& latt_str(X1)
& lower_bounded_semilattstr(X1)
& lattice(X1)
& ~ empty_carrier(X1) ) ),
inference(fof_simplification,[status(thm)],[t50_lattice3]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(assume_negation,[status(cth)],[t18_yellow_1]) ).
fof(c_0_13,plain,
! [X147,X148] :
( ( ~ latt_str(X147)
| ~ complete_latt_str(X147)
| ~ lattice(X147)
| empty_carrier(X147)
| meet_of_latt_set(X147,X148) = meet_on_relstr(poset_of_lattice(X147),X148) )
& ( ~ latt_str(X147)
| ~ complete_latt_str(X147)
| ~ lattice(X147)
| empty_carrier(X147)
| join_of_latt_set(X147,X148) = join_on_relstr(poset_of_lattice(X147),X148) ) ),
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_9])])])])]) ).
fof(c_0_14,plain,
! [X76] :
( complete_latt_str(boole_lattice(X76))
& boolean_lattstr(boole_lattice(X76))
& complemented_lattstr(boole_lattice(X76))
& bounded_lattstr(boole_lattice(X76))
& upper_bounded_semilattstr(boole_lattice(X76))
& lower_bounded_semilattstr(boole_lattice(X76))
& modular_lattstr(boole_lattice(X76))
& distributive_lattstr(boole_lattice(X76))
& lattice(boole_lattice(X76))
& join_absorbing(boole_lattice(X76))
& meet_absorbing(boole_lattice(X76))
& meet_associative(boole_lattice(X76))
& meet_commutative(boole_lattice(X76))
& join_associative(boole_lattice(X76))
& join_commutative(boole_lattice(X76))
& strict_latt_str(boole_lattice(X76))
& ~ empty_carrier(boole_lattice(X76)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_15,plain,
! [X42] :
( latt_str(boole_lattice(X42))
& strict_latt_str(boole_lattice(X42)) ),
inference(variable_rename,[status(thm)],[dt_k1_lattice3]) ).
fof(c_0_16,plain,
! [X160] :
( ( ~ latt_str(X160)
| ~ complete_latt_str(X160)
| ~ lattice(X160)
| empty_carrier(X160)
| bottom_of_semilattstr(X160) = join_of_latt_set(X160,empty_set) )
& ( ~ latt_str(X160)
| ~ complete_latt_str(X160)
| ~ lattice(X160)
| empty_carrier(X160)
| latt_str(X160) )
& ( ~ latt_str(X160)
| ~ complete_latt_str(X160)
| ~ lattice(X160)
| empty_carrier(X160)
| lower_bounded_semilattstr(X160) )
& ( ~ latt_str(X160)
| ~ complete_latt_str(X160)
| ~ lattice(X160)
| empty_carrier(X160)
| lattice(X160) )
& ( ~ latt_str(X160)
| ~ complete_latt_str(X160)
| ~ lattice(X160)
| empty_carrier(X160)
| ~ empty_carrier(X160) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_17,plain,
! [X154] :
( bottom_of_semilattstr(boole_lattice(X154)) = empty_set
& lower_bounded_semilattstr(boole_lattice(X154)) ),
inference(variable_rename,[status(thm)],[t3_lattice3]) ).
fof(c_0_18,plain,
! [X50] :
( rel_str(boole_POSet(X50))
& strict_rel_str(boole_POSet(X50)) ),
inference(variable_rename,[status(thm)],[dt_k3_yellow_1]) ).
fof(c_0_19,plain,
! [X32] : boole_POSet(X32) = poset_of_lattice(boole_lattice(X32)),
inference(variable_rename,[status(thm)],[d2_yellow_1]) ).
fof(c_0_20,negated_conjecture,
bottom_of_relstr(boole_POSet(esk29_0)) != empty_set,
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_21,plain,
! [X28] :
( bottom_of_relstr(X28) = join_on_relstr(X28,empty_set)
| ~ rel_str(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_yellow_0])])]) ).
cnf(c_0_22,plain,
( ~ latt_str(X1)
| ~ complete_latt_str(X1)
| ~ lattice(X1)
| empty_carrier(X1)
| join_of_latt_set(X1,X2) = join_on_relstr(poset_of_lattice(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
complete_latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
lattice(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( ~ latt_str(X1)
| ~ complete_latt_str(X1)
| ~ lattice(X1)
| empty_carrier(X1)
| bottom_of_semilattstr(X1) = join_of_latt_set(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
bottom_of_semilattstr(boole_lattice(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
rel_str(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
boole_POSet(X1) = poset_of_lattice(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,negated_conjecture,
bottom_of_relstr(boole_POSet(esk29_0)) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,plain,
( ~ rel_str(X1)
| bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
join_on_relstr(poset_of_lattice(boole_lattice(X1)),X2) = join_of_latt_set(boole_lattice(X1),X2),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_34,plain,
join_of_latt_set(boole_lattice(X1),empty_set) = empty_set,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_28]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_35,plain,
rel_str(poset_of_lattice(boole_lattice(X1))),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
bottom_of_relstr(poset_of_lattice(boole_lattice(esk29_0))) != empty_set,
inference(rw,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_37,plain,
bottom_of_relstr(poset_of_lattice(boole_lattice(X1))) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU371+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.47 % Computer : n026.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Mon Sep 21 06:19:22 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.53 Running first-order theorem proving
% 0.25/0.53 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.48/0.69 % Version: 3.5.1
% 0.48/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.48/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.48/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.48/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.48/0.69 % Starting sh5l with 300s (1) cores
% 0.48/0.69 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1546349 completed with status 0
% 0.48/0.69 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.48/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.48/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.48/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.48/0.69 % No SInE strategy applied
% 0.48/0.69 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.48/0.69 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.48/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.48/0.69 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.48/0.69 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.48/0.69 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.48/0.69 % U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1546359 completed with status 0
% 0.48/0.69 % Result found by U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.48/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.48/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.48/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.48/0.69 % No SInE strategy applied
% 0.48/0.69 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.48/0.69 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.48/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.48/0.69 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.48/0.69 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.48/0.69 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.48/0.69 % Preprocessing time : 0.007 s
% 0.48/0.69 % Presaturation interreduction done
% 0.48/0.69
% 0.48/0.69 % Proof found!
% 0.48/0.69 % SZS status Theorem
% 0.48/0.69 % SZS output start CNFRefutation
% See solution above
% 0.48/0.69 % Parsed axioms : 115
% 0.48/0.69 % Removed by relevancy pruning/SinE : 0
% 0.48/0.69 % Initial clauses : 383
% 0.48/0.69 % Removed in clause preprocessing : 23
% 0.48/0.69 % Initial clauses in saturation : 360
% 0.48/0.69 % Processed clauses : 796
% 0.48/0.69 % ...of these trivial : 31
% 0.48/0.69 % ...subsumed : 54
% 0.48/0.69 % ...remaining for further processing : 711
% 0.48/0.69 % Other redundant clauses eliminated : 1
% 0.48/0.69 % Clauses deleted for lack of memory : 0
% 0.48/0.69 % Backward-subsumed : 1
% 0.48/0.69 % Backward-rewritten : 21
% 0.48/0.69 % Generated clauses : 401
% 0.48/0.69 % ...of the previous two non-redundant : 308
% 0.48/0.69 % ...aggressively subsumed : 0
% 0.48/0.69 % Contextual simplify-reflections : 0
% 0.48/0.69 % Paramodulations : 398
% 0.48/0.69 % Factorizations : 2
% 0.48/0.69 % NegExts : 0
% 0.48/0.69 % Equation resolutions : 1
% 0.48/0.69 % Disequality decompositions : 0
% 0.48/0.69 % Total rewrite steps : 444
% 0.48/0.69 % ...of those cached : 328
% 0.48/0.69 % Propositional unsat checks : 0
% 0.48/0.69 % Propositional check models : 0
% 0.48/0.69 % Propositional check unsatisfiable : 0
% 0.48/0.69 % Propositional clauses : 0
% 0.48/0.69 % Propositional clauses after purity: 0
% 0.48/0.69 % Propositional unsat core size : 0
% 0.48/0.69 % Propositional preprocessing time : 0.000
% 0.48/0.69 % Propositional encoding time : 0.000
% 0.48/0.69 % Propositional solver time : 0.000
% 0.48/0.69 % Success case prop preproc time : 0.000
% 0.48/0.69 % Success case prop encoding time : 0.000
% 0.48/0.69 % Success case prop solver time : 0.000
% 0.48/0.69 % Current number of processed clauses : 409
% 0.48/0.69 % Positive orientable unit clauses : 259
% 0.48/0.69 % Positive unorientable unit clauses: 0
% 0.48/0.69 % Negative unit clauses : 16
% 0.48/0.69 % Non-unit-clauses : 134
% 0.48/0.69 % Current number of unprocessed clauses: 151
% 0.48/0.69 % ...number of literals in the above : 421
% 0.48/0.69 % Current number of archived formulas : 0
% 0.48/0.69 % Current number of archived clauses : 302
% 0.48/0.69 % Clause-clause subsumption calls (NU) : 10643
% 0.48/0.69 % Rec. Clause-clause subsumption calls : 2348
% 0.48/0.69 % Non-unit clause-clause subsumptions : 48
% 0.48/0.69 % Unit Clause-clause subsumption calls : 1343
% 0.48/0.69 % Rewrite failures with RHS unbound : 0
% 0.48/0.69 % BW rewrite match attempts : 9
% 0.48/0.69 % BW rewrite match successes : 9
% 0.48/0.69 % Condensation attempts : 0
% 0.48/0.69 % Condensation successes : 0
% 0.48/0.69 % Termbank termtop insertions : 26015
% 0.48/0.69 % Search garbage collected termcells : 2578
% 0.48/0.69
% 0.48/0.69 % -------------------------------------------------
% 0.48/0.69 % User time : 0.053 s
% 0.48/0.69 % System time : 0.007 s
% 0.48/0.69 % Total time : 0.060 s
% 0.48/0.69 % Maximum resident set size: 4024 pages
% 0.48/0.69
% 0.48/0.69 % -------------------------------------------------
% 0.48/0.69 % User time : 0.161 s
% 0.48/0.69 % System time : 0.026 s
% 0.48/0.69 % Total time : 0.187 s
% 0.48/0.69 % Maximum resident set size: 4608 pages
% 0.48/0.69 % E exiting
%------------------------------------------------------------------------------