%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO263^5 : TPTP v9.3.1. Released v4.0.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:42:40 AM UTC 2026
% Result : Theorem 0.22s 0.38s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 64 ( 0 equ; 0 cnn)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 534 ( 114 ~; 111 |; 21 &; 286 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 29 ( 29 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 63 ( 26 ^; 33 !; 4 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
esk1_0: $i ).
thf(decl_24,type,
esk2_0: $i ).
thf(decl_25,type,
esk3_0: $i ).
thf(decl_26,type,
epred1_0: $i > $o ).
thf(decl_27,type,
esk4_2: ( $i > $o ) > ( $i > $o ) > $i ).
thf(cTHM125D,conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i > $o] :
? [X5: $i > $o,X6: $i > $o] :
( ( ( X6 @ X1 )
| ( X5 @ X1 ) )
& ( ( X4 @ X2 )
| ( X6 @ X2 ) )
& ( ( X5 @ X3 )
| ~ ( X4 @ X3 ) )
& ! [X7: $i] :
( ( X6 @ X7 )
<=> ~ ( X4 @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qjVVWU5jII/E---3.1_3115308.p',cTHM125D) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i,X2: $i,X3: $i,X4: $i > $o] :
? [X5: $i > $o,X6: $i > $o] :
( ( ( X6 @ X1 )
| ( X5 @ X1 ) )
& ( ( X4 @ X2 )
| ( X6 @ X2 ) )
& ( ( X5 @ X3 )
| ~ ( X4 @ X3 ) )
& ! [X7: $i] :
( ( X6 @ X7 )
<=> ~ ( X4 @ X7 ) ) ),
inference(assume_negation,[status(cth)],[cTHM125D]) ).
thf(c_0_2,negated_conjecture,
! [X19: $i > $o,X20: $i > $o] :
( ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X20 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( X19 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ~ ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) )
& ( ( X20 @ ( esk4_2 @ X19 @ X20 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X19 @ X20 ) )
| ( epred1_0 @ esk3_0 )
| ~ ( X20 @ esk2_0 )
| ~ ( X19 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( X4 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5 @ esk2_0 )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( X4 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] :
~ ( X4 @ Z0 ) ) )
| ( X4
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] :
~ ( X4 @ Z0 ) ) )
| ( X4 @ esk2_0 ) ),
inference(er,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( X4 @ esk2_0 )
| ~ ( epred1_0
@ ( esk4_2 @ X5
@ ^ [Z0: $i] :
~ ( X4 @ Z0 ) ) )
| ~ ( X4
@ ( esk4_2 @ X5
@ ^ [Z0: $i] :
~ ( X4 @ Z0 ) ) )
| ~ ( X5 @ esk1_0 )
| ~ ( X5 @ esk3_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) )
| ( epred1_0 @ esk2_0 ) ),
inference(ef,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X4: $i > $o,X5: $i > $o] :
( ( X4 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( epred1_0 @ ( esk4_2 @ X5 @ X4 ) )
| ~ ( X5 @ esk3_0 )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X5 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] :
~ ( X4 @ Z0 ) ) )
| ( X4
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] :
~ ( X4 @ Z0 ) ) )
| ~ ( epred1_0 @ esk2_0 ) ),
inference(er,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
epred1_0 @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ~ ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ~ ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ~ ( epred1_0 @ esk2_0 )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] :
~ ( X4 @ Z0 ) ) )
| ( X4
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] :
~ ( X4 @ Z0 ) ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_16,negated_conjecture,
! [X5: $i > $o,X4: $i > $o] :
( ~ ( epred1_0
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ~ ( X5
@ ( esk4_2 @ X4
@ ^ [Z0: $i] :
~ ( X5 @ Z0 ) ) )
| ~ ( X4 @ esk1_0 )
| ~ ( X4 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13])]) ).
thf(c_0_17,negated_conjecture,
( epred1_0
@ ( esk4_2
@ ^ [Z0: $i] : $true
@ ^ [Z0: $i] :
~ ( epred1_0 @ Z0 ) ) ),
inference(ef,[status(thm)],[c_0_15]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO263^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n010.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 16:42:18 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.25 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.qjVVWU5jII/E---3.1_3115308.p
% 0.22/0.38 % Version: 3.5.1-ho
% 0.22/0.38 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.38 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.38 % Starting post_as_ho12 with 300s (1) cores
% 0.22/0.38 % Starting new_bool_9 with 300s (1) cores
% 0.22/0.38 % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.38 % Starting post_as_ho4 with 300s (1) cores
% 0.22/0.38 % Starting post_as_ho2 with 300s (1) cores
% 0.22/0.38 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.38 % Starting full_lambda_10 with 300s (1) cores
% 0.22/0.38 % Starting new_ho_8 with 300s (1) cores
% 0.22/0.38 % post_as_ho4 with pid 3115324 completed with status 0
% 0.22/0.38 % Result found by post_as_ho4
% 0.22/0.38 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.38 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.38 % Starting post_as_ho12 with 300s (1) cores
% 0.22/0.38 % Starting new_bool_9 with 300s (1) cores
% 0.22/0.38 % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.38 % Starting post_as_ho4 with 300s (1) cores
% 0.22/0.38 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.38 % No SInE strategy applied
% 0.22/0.38 % Search class: HGUNF-FFMF22-SSSFFMBN
% 0.22/0.38 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.38 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.38 % SubtermCWHack with pid 3115329 completed with status 10
% 0.22/0.38 % Starting post_as_ho4 with 31s (1) cores
% 0.22/0.38 % post_as_ho4 with pid 3115335 completed with status 0
% 0.22/0.38 % Result found by post_as_ho4
% 0.22/0.38 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.38 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.38 % Starting post_as_ho12 with 300s (1) cores
% 0.22/0.38 % Starting new_bool_9 with 300s (1) cores
% 0.22/0.38 % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.38 % Starting post_as_ho4 with 300s (1) cores
% 0.22/0.38 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.38 % No SInE strategy applied
% 0.22/0.38 % Search class: HGUNF-FFMF22-SSSFFMBN
% 0.22/0.38 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.38 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.38 % SubtermCWHack with pid 3115329 completed with status 10
% 0.22/0.38 % Starting post_as_ho4 with 31s (1) cores
% 0.22/0.38 % Preprocessing time : 0.001 s
% 0.22/0.38 % Presaturation interreduction done
% 0.22/0.38
% 0.22/0.38 % Proof found!
% 0.22/0.38 % SZS status Theorem
% 0.22/0.38 % SZS output start CNFRefutation
% See solution above
% 0.22/0.38 % Parsed axioms : 1
% 0.22/0.38 % Removed by relevancy pruning/SinE : 0
% 0.22/0.38 % Initial clauses : 16
% 0.22/0.38 % Removed in clause preprocessing : 0
% 0.22/0.38 % Initial clauses in saturation : 16
% 0.22/0.38 % Processed clauses : 436
% 0.22/0.38 % ...of these trivial : 8
% 0.22/0.38 % ...subsumed : 163
% 0.22/0.38 % ...remaining for further processing : 265
% 0.22/0.38 % Other redundant clauses eliminated : 28
% 0.22/0.38 % Clauses deleted for lack of memory : 0
% 0.22/0.38 % Backward-subsumed : 78
% 0.22/0.38 % Backward-rewritten : 75
% 0.22/0.38 % Generated clauses : 1513
% 0.22/0.38 % ...of the previous two non-redundant : 1147
% 0.22/0.38 % ...aggressively subsumed : 0
% 0.22/0.38 % Contextual simplify-reflections : 6
% 0.22/0.38 % Paramodulations : 1209
% 0.22/0.38 % Factorizations : 6
% 0.22/0.38 % NegExts : 0
% 0.22/0.38 % Equation resolutions : 145
% 0.22/0.38 % Disequality decompositions : 0
% 0.22/0.38 % Total rewrite steps : 206
% 0.22/0.38 % ...of those cached : 200
% 0.22/0.38 % Propositional unsat checks : 0
% 0.22/0.38 % Propositional check models : 0
% 0.22/0.38 % Propositional check unsatisfiable : 0
% 0.22/0.38 % Propositional clauses : 0
% 0.22/0.38 % Propositional clauses after purity: 0
% 0.22/0.38 % Propositional unsat core size : 0
% 0.22/0.38 % Propositional preprocessing time : 0.000
% 0.22/0.38 % Propositional encoding time : 0.000
% 0.22/0.38 % Propositional solver time : 0.000
% 0.22/0.38 % Success case prop preproc time : 0.000
% 0.22/0.38 % Success case prop encoding time : 0.000
% 0.22/0.38 % Success case prop solver time : 0.000
% 0.22/0.38 % Current number of processed clauses : 96
% 0.22/0.38 % Positive orientable unit clauses : 13
% 0.22/0.38 % Positive unorientable unit clauses: 0
% 0.22/0.38 % Negative unit clauses : 4
% 0.22/0.38 % Non-unit-clauses : 79
% 0.22/0.38 % Current number of unprocessed clauses: 719
% 0.22/0.38 % ...number of literals in the above : 3971
% 0.22/0.38 % Current number of archived formulas : 0
% 0.22/0.38 % Current number of archived clauses : 169
% 0.22/0.38 % Clause-clause subsumption calls (NU) : 3023
% 0.22/0.38 % Rec. Clause-clause subsumption calls : 1074
% 0.22/0.38 % Non-unit clause-clause subsumptions : 223
% 0.22/0.38 % Unit Clause-clause subsumption calls : 210
% 0.22/0.38 % Rewrite failures with RHS unbound : 0
% 0.22/0.38 % BW rewrite match attempts : 290
% 0.22/0.38 % BW rewrite match successes : 8
% 0.22/0.38 % Condensation attempts : 436
% 0.22/0.38 % Condensation successes : 0
% 0.22/0.38 % Termbank termtop insertions : 318352
% 0.22/0.38 % Search garbage collected termcells : 238
% 0.22/0.38
% 0.22/0.38 % -------------------------------------------------
% 0.22/0.38 % User time : 0.098 s
% 0.22/0.38 % System time : 0.011 s
% 0.22/0.38 % Total time : 0.109 s
% 0.22/0.38 % Maximum resident set size: 3632 pages
% 0.22/0.38
% 0.22/0.38 % -------------------------------------------------
% 0.22/0.38 % User time : 0.098 s
% 0.22/0.38 % System time : 0.017 s
% 0.22/0.38 % Total time : 0.116 s
% 0.22/0.38 % Maximum resident set size: 4864 pages
% 0.22/0.38 % E exiting
%------------------------------------------------------------------------------