%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM645^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:17:17 AM UTC 2026
% Result : Theorem 0.32s 0.26s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 92 ( 59 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 360 ( 53 ~; 25 |; 1 &; 274 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 79 ( 21 ^; 58 !; 0 ?; 79 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
set: $tType ).
thf(decl_23,type,
x: nat ).
thf(decl_24,type,
y: nat ).
thf(decl_25,type,
pl: nat > nat > nat ).
thf(decl_26,type,
esti: nat > set > $o ).
thf(decl_27,type,
setof: ( nat > $o ) > set ).
thf(decl_28,type,
n_1: nat ).
thf(decl_29,type,
suc: nat > nat ).
thf(decl_30,type,
esk1_1: set > nat ).
thf(satz7,conjecture,
( y
!= ( pl @ x @ y ) ),
file('/export/starexec/sandbox/tmp/tmp.TDGOfCTVRK/E---3.1_1172748.p',satz7) ).
thf(ax5,axiom,
! [X3: set] :
( ( esti @ n_1 @ X3 )
=> ( ! [X4: nat] :
( ( esti @ X4 @ X3 )
=> ( esti @ ( suc @ X4 ) @ X3 ) )
=> ! [X4: nat] : ( esti @ X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TDGOfCTVRK/E---3.1_1172748.p',ax5) ).
thf(satz4a,axiom,
! [X4: nat] :
( ( pl @ X4 @ n_1 )
= ( suc @ X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.TDGOfCTVRK/E---3.1_1172748.p',satz4a) ).
thf(estii,axiom,
! [X1: nat > $o,X2: nat] :
( ( X1 @ X2 )
=> ( esti @ X2 @ ( setof @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TDGOfCTVRK/E---3.1_1172748.p',estii) ).
thf(ax3,axiom,
! [X4: nat] :
( ( suc @ X4 )
!= n_1 ),
file('/export/starexec/sandbox/tmp/tmp.TDGOfCTVRK/E---3.1_1172748.p',ax3) ).
thf(satz1,axiom,
! [X4: nat,X5: nat] :
( ( X4 != X5 )
=> ( ( suc @ X4 )
!= ( suc @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TDGOfCTVRK/E---3.1_1172748.p',satz1) ).
thf(satz4b,axiom,
! [X4: nat,X5: nat] :
( ( pl @ X4 @ ( suc @ X5 ) )
= ( suc @ ( pl @ X4 @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TDGOfCTVRK/E---3.1_1172748.p',satz4b) ).
thf(estie,axiom,
! [X1: nat > $o,X2: nat] :
( ( esti @ X2 @ ( setof @ X1 ) )
=> ( X1 @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.TDGOfCTVRK/E---3.1_1172748.p',estie) ).
thf(c_0_8,negated_conjecture,
~ ( ( y
!= ( pl @ x @ y ) ) ),
inference(assume_negation,[status(cth)],[satz7]) ).
thf(c_0_9,plain,
! [X22: set,X24: nat] :
( ( ( esti @ ( esk1_1 @ X22 ) @ X22 )
| ( esti @ X24 @ X22 )
| ~ ( esti @ n_1 @ X22 ) )
& ( ~ ( esti @ ( suc @ ( esk1_1 @ X22 ) ) @ X22 )
| ( esti @ X24 @ X22 )
| ~ ( esti @ n_1 @ X22 ) ) ),
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)],[ax5])])])])])]) ).
thf(c_0_10,plain,
! [X19: nat] :
( ( pl @ X19 @ n_1 )
= ( suc @ X19 ) ),
inference(variable_rename,[status(thm)],[satz4a]) ).
thf(c_0_11,plain,
! [X30: nat > $o,X31: nat] :
( ~ ( X30 @ X31 )
| ( esti @ X31 @ ( setof @ X30 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[estii])])]) ).
thf(c_0_12,negated_conjecture,
( y
= ( pl @ x @ y ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
! [X4: nat] :
( ( suc @ X4 )
!= n_1 ),
inference(fof_simplification,[status(thm)],[ax3]) ).
thf(c_0_14,plain,
! [X2: nat,X3: set] :
( ( esti @ X2 @ X3 )
| ~ ( esti @ ( suc @ ( esk1_1 @ X3 ) ) @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X2: nat] :
( ( pl @ X2 @ n_1 )
= ( suc @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X1: nat > $o,X2: nat] :
( ( esti @ X2 @ ( setof @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,negated_conjecture,
( y
= ( pl @ x @ y ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
! [X25: nat] :
( ( suc @ X25 )
!= n_1 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
thf(c_0_19,plain,
! [X4: nat,X5: nat] :
( ( X4 != X5 )
=> ( ( suc @ X4 )
!= ( suc @ X5 ) ) ),
inference(fof_simplification,[status(thm)],[satz1]) ).
thf(c_0_20,plain,
! [X2: nat,X3: set] :
( ( esti @ X2 @ X3 )
| ~ ( esti @ ( pl @ ( esk1_1 @ X3 ) @ n_1 ) @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_21,plain,
! [X2: nat] :
( ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
| ( X2
= ( pl @ x @ X2 ) ) ),
inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]),c_0_16,c_0_17]) ).
thf(c_0_22,plain,
! [X2: nat] :
( ( suc @ X2 )
!= n_1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
! [X20: nat,X21: nat] :
( ( pl @ X20 @ ( suc @ X21 ) )
= ( suc @ ( pl @ X20 @ X21 ) ) ),
inference(variable_rename,[status(thm)],[satz4b]) ).
thf(c_0_24,plain,
! [X26: nat,X27: nat] :
( ( X26 = X27 )
| ( ( suc @ X26 )
!= ( suc @ X27 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
thf(c_0_25,plain,
! [X28: nat > $o,X29: nat] :
( ~ ( esti @ X29 @ ( setof @ X28 ) )
| ( X28 @ X29 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[estie])])]) ).
thf(c_0_26,plain,
! [X2: nat] :
( ( ( pl @ x
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ n_1 ) )
= ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ n_1 ) )
| ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
| ~ ( esti @ n_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_27,plain,
! [X2: nat] :
( ( pl @ X2 @ n_1 )
!= n_1 ),
inference(rw,[status(thm)],[c_0_22,c_0_15]) ).
thf(c_0_28,plain,
! [X2: nat,X4: nat] :
( ( pl @ X2 @ ( suc @ X4 ) )
= ( suc @ ( pl @ X2 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,plain,
! [X2: nat,X4: nat] :
( ( X2 = X4 )
| ( ( suc @ X2 )
!= ( suc @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_30,plain,
! [X2: nat,X1: nat > $o] :
( ( X1 @ X2 )
| ~ ( esti @ X2 @ ( setof @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_31,plain,
! [X2: nat] :
( ( ( pl @ x
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ n_1 ) )
= ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ n_1 ) )
| ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16])]),c_0_27]) ).
thf(c_0_32,plain,
! [X2: nat,X4: nat] :
( ( pl @ ( pl @ X2 @ X4 ) @ n_1 )
= ( pl @ X2 @ ( pl @ X4 @ n_1 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_15]),c_0_15]) ).
thf(c_0_33,plain,
! [X2: nat,X3: set] :
( ( esti @ ( esk1_1 @ X3 ) @ X3 )
| ( esti @ X2 @ X3 )
| ~ ( esti @ n_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_34,plain,
! [X2: nat,X4: nat] :
( ( X2 = X4 )
| ( ( pl @ X2 @ n_1 )
!= ( pl @ X4 @ n_1 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_15]),c_0_15]) ).
thf(c_0_35,plain,
! [X2: nat] :
( ( ( pl @ x
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ n_1 ) )
= ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ n_1 ) )
| ( ( pl @ x @ X2 )
!= X2 ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31])]) ).
thf(c_0_36,negated_conjecture,
( ( pl @ x @ ( pl @ y @ n_1 ) )
= ( pl @ y @ n_1 ) ),
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
thf(c_0_37,plain,
! [X2: nat] :
( ( esti
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
| ( esti @ X2
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_21]),c_0_27]) ).
thf(c_0_38,plain,
! [X2: nat,X4: nat,X5: nat] :
( ( X2
= ( pl @ X4 @ X5 ) )
| ( ( pl @ X2 @ n_1 )
!= ( pl @ X4 @ ( pl @ X5 @ n_1 ) ) ) ),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
thf(c_0_39,negated_conjecture,
( ( pl @ x
@ ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ n_1 ) )
= ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ n_1 ) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
thf(c_0_40,plain,
( esti
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) ),
inference(ef,[status(thm)],[c_0_37]) ).
thf(c_0_41,negated_conjecture,
! [X2: nat] :
( ( X2
= ( pl @ x
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) ) ) )
| ( ( pl @ X2 @ n_1 )
!= ( pl
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) )
@ n_1 ) ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_42,plain,
( ( pl @ x
@ ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) ) )
!= ( esk1_1
@ ( setof
@ ^ [Z0: nat] :
( Z0
!= ( pl @ x @ Z0 ) ) ) ) ),
inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_40])]) ).
thf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM645^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n001.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 12:37:05 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.TDGOfCTVRK/E---3.1_1172748.p
% 0.32/0.26 % Version: 3.5.1-ho
% 0.32/0.26 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.32/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.26 % Starting new_ho_14 with 1200s (4) cores
% 0.32/0.26 % Starting new_ho_13 with 600s (2) cores
% 0.32/0.26 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.32/0.26 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.26 % new_ho_14 with pid 1172761 completed with status 0
% 0.32/0.26 % Result found by new_ho_14
% 0.32/0.26 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.32/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.26 % Starting new_ho_14 with 1200s (4) cores
% 0.32/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.32/0.26 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.32/0.26 % Search class: HGHSS-FFSF21-MSFFFSBN
% 0.32/0.26 % partial match(2): HGHSS-FFSF21-MSSFFMBN
% 0.32/0.26 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.32/0.26 % Starting SubtermCWHack with 109s (1) cores
% 0.32/0.26 % Starting new_ho_14 with 121s (1) cores
% 0.32/0.26 % Starting lpo8_s with 135s (1) cores
% 0.32/0.26 % Starting sh5l with 135s (1) cores
% 0.32/0.26 % SubtermCWHack with pid 1172765 completed with status 0
% 0.32/0.26 % Result found by SubtermCWHack
% 0.32/0.26 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.32/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.26 % Starting new_ho_14 with 1200s (4) cores
% 0.32/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.32/0.26 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.32/0.26 % Search class: HGHSS-FFSF21-MSFFFSBN
% 0.32/0.26 % partial match(2): HGHSS-FFSF21-MSSFFMBN
% 0.32/0.26 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.32/0.26 % Starting SubtermCWHack with 109s (1) cores
% 0.32/0.26 % Preprocessing time : 0.001 s
% 0.32/0.26
% 0.32/0.26 % Proof found!
% 0.32/0.26 % SZS status Theorem
% 0.32/0.26 % SZS output start CNFRefutation
% See solution above
% 0.32/0.26 % Parsed axioms : 17
% 0.32/0.26 % Removed by relevancy pruning/SinE : 9
% 0.32/0.26 % Initial clauses : 9
% 0.32/0.26 % Removed in clause preprocessing : 0
% 0.32/0.26 % Initial clauses in saturation : 11
% 0.32/0.26 % Processed clauses : 196
% 0.32/0.26 % ...of these trivial : 13
% 0.32/0.26 % ...subsumed : 131
% 0.32/0.26 % ...remaining for further processing : 52
% 0.32/0.26 % Other redundant clauses eliminated : 0
% 0.32/0.26 % Clauses deleted for lack of memory : 0
% 0.32/0.26 % Backward-subsumed : 3
% 0.32/0.26 % Backward-rewritten : 2
% 0.32/0.26 % Generated clauses : 353
% 0.32/0.26 % ...of the previous two non-redundant : 342
% 0.32/0.26 % ...aggressively subsumed : 0
% 0.32/0.26 % Contextual simplify-reflections : 0
% 0.32/0.26 % Paramodulations : 347
% 0.32/0.26 % Factorizations : 2
% 0.32/0.26 % NegExts : 0
% 0.32/0.26 % Equation resolutions : 4
% 0.32/0.26 % Disequality decompositions : 0
% 0.32/0.26 % Total rewrite steps : 779
% 0.32/0.26 % ...of those cached : 562
% 0.32/0.26 % Propositional unsat checks : 0
% 0.32/0.26 % Propositional check models : 0
% 0.32/0.26 % Propositional check unsatisfiable : 0
% 0.32/0.26 % Propositional clauses : 0
% 0.32/0.26 % Propositional clauses after purity: 0
% 0.32/0.26 % Propositional unsat core size : 0
% 0.32/0.26 % Propositional preprocessing time : 0.000
% 0.32/0.26 % Propositional encoding time : 0.000
% 0.32/0.26 % Propositional solver time : 0.000
% 0.32/0.26 % Success case prop preproc time : 0.000
% 0.32/0.26 % Success case prop encoding time : 0.000
% 0.32/0.26 % Success case prop solver time : 0.000
% 0.32/0.26 % Current number of processed clauses : 47
% 0.32/0.26 % Positive orientable unit clauses : 17
% 0.32/0.26 % Positive unorientable unit clauses: 0
% 0.32/0.26 % Negative unit clauses : 12
% 0.32/0.26 % Non-unit-clauses : 18
% 0.32/0.26 % Current number of unprocessed clauses: 144
% 0.32/0.26 % ...number of literals in the above : 213
% 0.32/0.26 % Current number of archived formulas : 0
% 0.32/0.26 % Current number of archived clauses : 5
% 0.32/0.26 % Clause-clause subsumption calls (NU) : 245
% 0.32/0.26 % Rec. Clause-clause subsumption calls : 245
% 0.32/0.26 % Non-unit clause-clause subsumptions : 37
% 0.32/0.26 % Unit Clause-clause subsumption calls : 3
% 0.32/0.26 % Rewrite failures with RHS unbound : 0
% 0.32/0.26 % BW rewrite match attempts : 23
% 0.32/0.26 % BW rewrite match successes : 3
% 0.32/0.26 % Condensation attempts : 0
% 0.32/0.26 % Condensation successes : 0
% 0.32/0.26 % Termbank termtop insertions : 11259
% 0.32/0.26 % Search garbage collected termcells : 161
% 0.32/0.26
% 0.32/0.26 % -------------------------------------------------
% 0.32/0.26 % User time : 0.017 s
% 0.32/0.26 % System time : 0.002 s
% 0.32/0.26 % Total time : 0.019 s
% 0.32/0.26 % Maximum resident set size: 3640 pages
% 0.32/0.26
% 0.32/0.26 % -------------------------------------------------
% 0.32/0.26 % User time : 0.058 s
% 0.32/0.26 % System time : 0.012 s
% 0.32/0.26 % Total time : 0.070 s
% 0.32/0.26 % Maximum resident set size: 4864 pages
% 0.32/0.26 % E exiting
%------------------------------------------------------------------------------