%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM926+1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 01:51:03 PM UTC 2026
% Result : Theorem 0.14s 0.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 25 unt; 0 def)
% Number of atoms : 63 ( 42 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 47 ( 24 ~; 15 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 46 ( 7 sgn 20 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
? [X1,X2] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(fact_111_number__of__is__id,axiom,
! [X21] : number_number_of_int(X21) = X21,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_111_number__of__is__id) ).
fof(fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
! [X82,X83] : plus_plus_int(X82,X83) = plus_plus_int(X83,X82),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
fof(fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J,axiom,
! [X64,X65] : times_times_int(X64,X65) = times_times_int(X65,X64),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
fof(fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
! [X8] : times_times_int(X8,X8) = power_power_int(X8,number_number_of_nat(bit0(bit1(pls)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
fof(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( ord_less_int(one_one_int,t)
=> ? [X1,X2] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( t = one_one_int
=> ? [X1,X2] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(fact_28_zless__le,axiom,
! [X17,X18] :
( ord_less_int(X17,X18)
<=> ( X17 != X18
& ord_less_eq_int(X17,X18) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_28_zless__le) ).
fof(fact_0_tpos,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(c_0_9,negated_conjecture,
~ ? [X1,X2] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_10,negated_conjecture,
! [X329,X330] : plus_plus_int(power_power_int(X329,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X330,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_11,plain,
! [X308] : number_number_of_int(X308) = X308,
inference(variable_rename,[status(thm)],[fact_111_number__of__is__id]) ).
cnf(c_0_12,negated_conjecture,
plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X289,X290] : plus_plus_int(X289,X290) = plus_plus_int(X290,X289),
inference(variable_rename,[status(thm)],[fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).
fof(c_0_15,plain,
! [X253,X254] : times_times_int(X253,X254) = times_times_int(X254,X253),
inference(variable_rename,[status(thm)],[fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J]) ).
cnf(c_0_16,negated_conjecture,
plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X102] : times_times_int(X102,X102) = power_power_int(X102,number_number_of_nat(bit0(bit1(pls)))),
inference(variable_rename,[status(thm)],[fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).
fof(c_0_20,plain,
( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| ~ ord_less_int(one_one_int,t) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])]) ).
fof(c_0_21,plain,
( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int)
| t != one_one_int ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])]) ).
fof(c_0_22,plain,
! [X17,X18] :
( ord_less_int(X17,X18)
<=> ( X17 != X18
& ord_less_eq_int(X17,X18) ) ),
inference(fof_simplification,[status(thm)],[fact_28_zless__le]) ).
cnf(c_0_23,negated_conjecture,
plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,plain,
times_times_int(X1,X1) = power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( t != one_one_int
| plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,plain,
! [X116,X117] :
( ( ord_less_int(X116,X117)
| X116 = X117
| ~ ord_less_eq_int(X116,X117) )
& ( ~ ord_less_int(X116,X117)
| X116 != X117 )
& ( ~ ord_less_int(X116,X117)
| ord_less_eq_int(X116,X117) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
cnf(c_0_28,negated_conjecture,
plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),times_times_int(X2,X2)) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int) ),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_30,plain,
( t != one_one_int
| plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int) ),
inference(rw,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_31,plain,
( ~ ord_less_eq_int(X1,X2)
| ord_less_int(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
ord_less_eq_int(one_one_int,t),
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
cnf(c_0_33,negated_conjecture,
plus_plus_int(times_times_int(X1,X1),times_times_int(X2,X2)) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_34,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(times_times_int(esk3_0,esk3_0),times_times_int(esk4_0,esk4_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_24]),c_0_24]),c_0_17]),c_0_18]) ).
cnf(c_0_35,plain,
( t != one_one_int
| plus_plus_int(times_times_int(esk1_0,esk1_0),times_times_int(esk2_0,esk2_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_24]),c_0_24]),c_0_17]),c_0_18]) ).
cnf(c_0_36,plain,
( ord_less_int(one_one_int,t)
| t = one_one_int ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ ord_less_int(one_one_int,t),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
t != one_one_int,
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n014.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 03:17:49 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.48 % Version: 3.5.1
% 0.14/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 % Starting sh5l with 300s (1) cores
% 0.14/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3028282 completed with status 0
% 0.14/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.48 % No SInE strategy applied
% 0.14/0.48 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.14/0.48 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.14/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.48 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.14/0.48 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 3028290 completed with status 0
% 0.14/0.48 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.14/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.48 % No SInE strategy applied
% 0.14/0.48 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.14/0.48 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.14/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.48 % Preprocessing time : 0.003 s
% 0.14/0.48
% 0.14/0.48 % Proof found!
% 0.14/0.48 % SZS status Theorem
% 0.14/0.48 % SZS output start CNFRefutation
% See solution above
% 0.14/0.48 % Parsed axioms : 124
% 0.14/0.48 % Removed by relevancy pruning/SinE : 0
% 0.14/0.48 % Initial clauses : 163
% 0.14/0.48 % Removed in clause preprocessing : 17
% 0.14/0.48 % Initial clauses in saturation : 146
% 0.14/0.48 % Processed clauses : 747
% 0.14/0.48 % ...of these trivial : 75
% 0.14/0.48 % ...subsumed : 363
% 0.14/0.48 % ...remaining for further processing : 308
% 0.14/0.48 % Other redundant clauses eliminated : 1
% 0.14/0.48 % Clauses deleted for lack of memory : 0
% 0.14/0.48 % Backward-subsumed : 22
% 0.14/0.48 % Backward-rewritten : 11
% 0.14/0.48 % Generated clauses : 3016
% 0.14/0.48 % ...of the previous two non-redundant : 2828
% 0.14/0.48 % ...aggressively subsumed : 0
% 0.14/0.48 % Contextual simplify-reflections : 1
% 0.14/0.48 % Paramodulations : 3001
% 0.14/0.48 % Factorizations : 6
% 0.14/0.48 % NegExts : 0
% 0.14/0.48 % Equation resolutions : 3
% 0.14/0.48 % Disequality decompositions : 0
% 0.14/0.48 % Total rewrite steps : 962
% 0.14/0.48 % ...of those cached : 591
% 0.14/0.48 % Propositional unsat checks : 0
% 0.14/0.48 % Propositional check models : 0
% 0.14/0.48 % Propositional check unsatisfiable : 0
% 0.14/0.48 % Propositional clauses : 0
% 0.14/0.48 % Propositional clauses after purity: 0
% 0.14/0.48 % Propositional unsat core size : 0
% 0.14/0.48 % Propositional preprocessing time : 0.000
% 0.14/0.48 % Propositional encoding time : 0.000
% 0.14/0.48 % Propositional solver time : 0.000
% 0.14/0.48 % Success case prop preproc time : 0.000
% 0.14/0.48 % Success case prop encoding time : 0.000
% 0.14/0.48 % Success case prop solver time : 0.000
% 0.14/0.48 % Current number of processed clauses : 268
% 0.14/0.48 % Positive orientable unit clauses : 58
% 0.14/0.48 % Positive unorientable unit clauses: 21
% 0.14/0.48 % Negative unit clauses : 43
% 0.14/0.48 % Non-unit-clauses : 146
% 0.14/0.48 % Current number of unprocessed clauses: 2155
% 0.14/0.48 % ...number of literals in the above : 3964
% 0.14/0.48 % Current number of archived formulas : 0
% 0.14/0.48 % Current number of archived clauses : 40
% 0.14/0.48 % Clause-clause subsumption calls (NU) : 3938
% 0.14/0.48 % Rec. Clause-clause subsumption calls : 3113
% 0.14/0.48 % Non-unit clause-clause subsumptions : 178
% 0.14/0.48 % Unit Clause-clause subsumption calls : 1060
% 0.14/0.48 % Rewrite failures with RHS unbound : 0
% 0.14/0.48 % BW rewrite match attempts : 116
% 0.14/0.48 % BW rewrite match successes : 76
% 0.14/0.48 % Condensation attempts : 0
% 0.14/0.48 % Condensation successes : 0
% 0.14/0.48 % Termbank termtop insertions : 47487
% 0.14/0.48 % Search garbage collected termcells : 930
% 0.14/0.48
% 0.14/0.48 % -------------------------------------------------
% 0.14/0.48 % User time : 0.042 s
% 0.14/0.48 % System time : 0.011 s
% 0.14/0.48 % Total time : 0.053 s
% 0.14/0.48 % Maximum resident set size: 4056 pages
% 0.14/0.48
% 0.14/0.48 % -------------------------------------------------
% 0.14/0.48 % User time : 0.166 s
% 0.14/0.48 % System time : 0.034 s
% 0.14/0.48 % Total time : 0.199 s
% 0.14/0.48 % Maximum resident set size: 5120 pages
% 0.14/0.48 % E exiting
%------------------------------------------------------------------------------