%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO901^11 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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 : Wed Sep 30 08:44:57 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 143 ( 8 equ; 0 cnn)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 315 ( 45 ~; 47 |; 8 &; 201 @)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 52 ( 18 ^; 34 !; 0 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_23,type,
mrel: mworld > mworld > $o ).
thf(decl_24,type,
mactual: mworld ).
thf(decl_25,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_29,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_31,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_33,type,
p: mworld > $o ).
thf(decl_34,type,
q: mworld > $o ).
thf(decl_35,type,
esk1_0: mworld ).
thf(decl_36,type,
esk2_0: mworld ).
thf(decl_37,type,
esk3_0: mworld ).
thf(con,conjecture,
mlocal @ ( mimplies @ ( mbox @ ( mequiv @ p @ q ) ) @ ( mbox @ ( mequiv @ ( mbox @ p ) @ ( mbox @ q ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Lai1eeBM81/E---3.1_3172890.p',con) ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Lai1eeBM81/E---3.1_3172890.p',mlocal_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Lai1eeBM81/E---3.1_3172890.p',mimplies_def) ).
thf(mequiv_def,axiom,
( mequiv
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
<=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Lai1eeBM81/E---3.1_3172890.p',mequiv_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Lai1eeBM81/E---3.1_3172890.p',mbox_def) ).
thf(mrel_euclidean,axiom,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( ( mrel @ X3 @ X6 )
& ( mrel @ X3 @ X5 ) )
=> ( mrel @ X6 @ X5 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Lai1eeBM81/E---3.1_3172890.p',mrel_euclidean) ).
thf(mrel_reflexive,axiom,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
file('/export/starexec/sandbox2/tmp/tmp.Lai1eeBM81/E---3.1_3172890.p',mrel_reflexive) ).
thf(c_0_7,negated_conjecture,
~ ( mlocal @ ( mimplies @ ( mbox @ ( mequiv @ p @ q ) ) @ ( mbox @ ( mequiv @ ( mbox @ p ) @ ( mbox @ q ) ) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_8,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_10,plain,
( mequiv
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
<=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv_def]) ).
thf(c_0_11,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_12,negated_conjecture,
~ ( ! [X11: mworld] :
( ( mrel @ mactual @ X11 )
=> ( ( p @ X11 )
<=> ( q @ X11 ) ) )
=> ! [X14: mworld] :
( ( mrel @ mactual @ X14 )
=> ( ! [X12: mworld] :
( ( mrel @ X14 @ X12 )
=> ( p @ X12 ) )
<=> ! [X13: mworld] :
( ( mrel @ X14 @ X13 )
=> ( q @ X13 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_11]) ).
thf(c_0_13,plain,
! [X16: mworld,X17: mworld,X18: mworld] :
( ~ ( mrel @ X16 @ X18 )
| ~ ( mrel @ X16 @ X17 )
| ( mrel @ X18 @ X17 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mrel_euclidean])])]) ).
thf(c_0_14,plain,
! [X15: mworld] : ( mrel @ X15 @ X15 ),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
thf(c_0_15,negated_conjecture,
! [X19: mworld,X23: mworld,X24: mworld] :
( ( ~ ( p @ X19 )
| ( q @ X19 )
| ~ ( mrel @ mactual @ X19 ) )
& ( ~ ( q @ X19 )
| ( p @ X19 )
| ~ ( mrel @ mactual @ X19 ) )
& ( mrel @ mactual @ esk1_0 )
& ( ( mrel @ esk1_0 @ esk3_0 )
| ( mrel @ esk1_0 @ esk2_0 ) )
& ( ~ ( q @ esk3_0 )
| ( mrel @ esk1_0 @ esk2_0 ) )
& ( ( mrel @ esk1_0 @ esk3_0 )
| ~ ( p @ esk2_0 ) )
& ( ~ ( q @ esk3_0 )
| ~ ( p @ esk2_0 ) )
& ( ~ ( mrel @ esk1_0 @ X23 )
| ( p @ X23 )
| ~ ( mrel @ esk1_0 @ X24 )
| ( q @ X24 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])]) ).
thf(c_0_16,plain,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( mrel @ X5 @ X6 )
| ~ ( mrel @ X3 @ X5 )
| ~ ( mrel @ X3 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X3: mworld,X5: mworld] :
( ( p @ X3 )
| ( q @ X5 )
| ~ ( mrel @ esk1_0 @ X3 )
| ~ ( mrel @ esk1_0 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,negated_conjecture,
( ( mrel @ esk1_0 @ esk3_0 )
| ( mrel @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,negated_conjecture,
( ( mrel @ esk1_0 @ esk2_0 )
| ~ ( q @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_21,plain,
! [X5: mworld,X3: mworld] :
( ( mrel @ X3 @ X5 )
| ~ ( mrel @ X5 @ X3 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,negated_conjecture,
mrel @ mactual @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_23,negated_conjecture,
! [X3: mworld] :
( ( q @ X3 )
| ~ ( p @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_24,negated_conjecture,
! [X3: mworld] :
( ( mrel @ esk1_0 @ esk2_0 )
| ( p @ X3 )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
thf(c_0_25,negated_conjecture,
! [X3: mworld] :
( ( mrel @ esk1_0 @ esk2_0 )
| ( mrel @ X3 @ esk3_0 )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
thf(c_0_26,negated_conjecture,
mrel @ esk1_0 @ mactual,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_27,negated_conjecture,
! [X3: mworld] :
( ( mrel @ esk1_0 @ esk2_0 )
| ( q @ X3 )
| ~ ( mrel @ mactual @ X3 )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_28,negated_conjecture,
( ( mrel @ mactual @ esk3_0 )
| ( mrel @ esk1_0 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_29,negated_conjecture,
! [X3: mworld] :
( ( mrel @ X3 @ mactual )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
thf(c_0_30,negated_conjecture,
mrel @ esk1_0 @ esk2_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_19]),c_0_28]) ).
thf(c_0_31,negated_conjecture,
( ( mrel @ esk1_0 @ esk3_0 )
| ~ ( p @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_32,negated_conjecture,
! [X3: mworld] :
( ( p @ X3 )
| ~ ( q @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_33,negated_conjecture,
mrel @ esk2_0 @ mactual,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_34,negated_conjecture,
( ~ ( q @ esk3_0 )
| ~ ( p @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_35,negated_conjecture,
( ( mrel @ esk1_0 @ esk3_0 )
| ~ ( mrel @ mactual @ esk2_0 )
| ~ ( q @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_36,negated_conjecture,
mrel @ mactual @ esk2_0,
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
thf(c_0_37,negated_conjecture,
( ~ ( mrel @ mactual @ esk2_0 )
| ~ ( q @ esk3_0 )
| ~ ( q @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
thf(c_0_38,negated_conjecture,
! [X3: mworld] :
( ( q @ esk2_0 )
| ( p @ X3 )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
thf(c_0_39,negated_conjecture,
( ( mrel @ esk1_0 @ esk3_0 )
| ~ ( q @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
thf(c_0_40,negated_conjecture,
( ~ ( q @ esk3_0 )
| ~ ( q @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_36])]) ).
thf(c_0_41,negated_conjecture,
mrel @ esk1_0 @ esk3_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_38]),c_0_30])]),c_0_39]) ).
thf(c_0_42,negated_conjecture,
~ ( q @ esk3_0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_38]),c_0_30])]),c_0_40]) ).
thf(c_0_43,negated_conjecture,
! [X3: mworld] :
( ( p @ X3 )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_41]),c_0_42]) ).
thf(c_0_44,negated_conjecture,
mrel @ esk3_0 @ mactual,
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
thf(c_0_45,negated_conjecture,
! [X3: mworld] :
( ( q @ X3 )
| ~ ( mrel @ mactual @ X3 )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_43]) ).
thf(c_0_46,negated_conjecture,
mrel @ mactual @ esk3_0,
inference(spm,[status(thm)],[c_0_21,c_0_44]) ).
thf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_45]),c_0_46]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO901^11 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n010.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 17:26:48 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Lai1eeBM81/E---3.1_3172890.p
% 0.09/0.25 % Version: 3.5.1-ho
% 0.09/0.25 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.25 % Starting sh1l with 300s (1) cores
% 0.09/0.25 % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.25 % new_ho_9 with pid 3172903 completed with status 0
% 0.09/0.25 % Result found by new_ho_9
% 0.09/0.25 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.25 % No SInE strategy applied
% 0.09/0.25 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.09/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.25 % Starting new_ho_9 with 151s (1) cores
% 0.09/0.25 % Starting sh5l with 136s (1) cores
% 0.09/0.25 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.09/0.25 % Starting lpo1_def_fix with 136s (1) cores
% 0.09/0.25 % sh5l with pid 3172909 completed with status 0
% 0.09/0.25 % Result found by sh5l
% 0.09/0.25 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.25 % No SInE strategy applied
% 0.09/0.25 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.09/0.25 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.25 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.25 % Starting new_ho_9 with 151s (1) cores
% 0.09/0.25 % Starting sh5l with 136s (1) cores
% 0.09/0.25 % Preprocessing time : 0.001 s
% 0.09/0.25 % Presaturation interreduction done
% 0.09/0.25
% 0.09/0.25 % Proof found!
% 0.09/0.25 % SZS status Theorem
% 0.09/0.25 % SZS output start CNFRefutation
% See solution above
% 0.09/0.25 % Parsed axioms : 24
% 0.09/0.25 % Removed by relevancy pruning/SinE : 0
% 0.09/0.25 % Initial clauses : 23
% 0.09/0.25 % Removed in clause preprocessing : 13
% 0.09/0.25 % Initial clauses in saturation : 10
% 0.09/0.25 % Processed clauses : 74
% 0.09/0.25 % ...of these trivial : 0
% 0.09/0.25 % ...subsumed : 9
% 0.09/0.25 % ...remaining for further processing : 65
% 0.09/0.25 % Other redundant clauses eliminated : 0
% 0.09/0.25 % Clauses deleted for lack of memory : 0
% 0.09/0.25 % Backward-subsumed : 5
% 0.09/0.25 % Backward-rewritten : 21
% 0.09/0.25 % Generated clauses : 108
% 0.09/0.25 % ...of the previous two non-redundant : 66
% 0.09/0.25 % ...aggressively subsumed : 0
% 0.09/0.25 % Contextual simplify-reflections : 9
% 0.09/0.25 % Paramodulations : 108
% 0.09/0.25 % Factorizations : 0
% 0.09/0.25 % NegExts : 0
% 0.09/0.25 % Equation resolutions : 0
% 0.09/0.25 % Disequality decompositions : 0
% 0.09/0.25 % Total rewrite steps : 67
% 0.09/0.25 % ...of those cached : 48
% 0.09/0.25 % Propositional unsat checks : 0
% 0.09/0.25 % Propositional check models : 0
% 0.09/0.25 % Propositional check unsatisfiable : 0
% 0.09/0.25 % Propositional clauses : 0
% 0.09/0.25 % Propositional clauses after purity: 0
% 0.09/0.25 % Propositional unsat core size : 0
% 0.09/0.25 % Propositional preprocessing time : 0.000
% 0.09/0.25 % Propositional encoding time : 0.000
% 0.09/0.25 % Propositional solver time : 0.000
% 0.09/0.25 % Success case prop preproc time : 0.000
% 0.09/0.25 % Success case prop encoding time : 0.000
% 0.09/0.25 % Success case prop solver time : 0.000
% 0.09/0.25 % Current number of processed clauses : 29
% 0.09/0.25 % Positive orientable unit clauses : 15
% 0.09/0.25 % Positive unorientable unit clauses: 0
% 0.09/0.25 % Negative unit clauses : 1
% 0.09/0.25 % Non-unit-clauses : 13
% 0.09/0.25 % Current number of unprocessed clauses: 6
% 0.09/0.25 % ...number of literals in the above : 11
% 0.09/0.25 % Current number of archived formulas : 0
% 0.09/0.25 % Current number of archived clauses : 36
% 0.09/0.25 % Clause-clause subsumption calls (NU) : 147
% 0.09/0.25 % Rec. Clause-clause subsumption calls : 121
% 0.09/0.25 % Non-unit clause-clause subsumptions : 20
% 0.09/0.25 % Unit Clause-clause subsumption calls : 11
% 0.09/0.25 % Rewrite failures with RHS unbound : 0
% 0.09/0.25 % BW rewrite match attempts : 12
% 0.09/0.25 % BW rewrite match successes : 5
% 0.09/0.25 % Condensation attempts : 74
% 0.09/0.25 % Condensation successes : 0
% 0.09/0.25 % Termbank termtop insertions : 2908
% 0.09/0.25 % Search garbage collected termcells : 344
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.005 s
% 0.09/0.25 % System time : 0.001 s
% 0.09/0.25 % Total time : 0.006 s
% 0.09/0.25 % Maximum resident set size: 3592 pages
% 0.09/0.25
% 0.09/0.25 % -------------------------------------------------
% 0.09/0.25 % User time : 0.019 s
% 0.09/0.25 % System time : 0.007 s
% 0.09/0.25 % Total time : 0.027 s
% 0.09/0.25 % Maximum resident set size: 4864 pages
% 0.09/0.25 % E exiting
%------------------------------------------------------------------------------