%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM926+6 : 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 : n002.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:05 PM UTC 2026
% Result : Theorem 4.61s 1.16s
% Output : CNFRefutation 4.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 48 ( 34 unt; 0 def)
% Number of atoms : 71 ( 47 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 43 ( 20 ~; 15 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-3 aty)
% Number of variables : 47 ( 4 sgn 22 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_22_zless__le,axiom,
! [X17,X18] :
( ord_less(int,X17,X18)
<=> ( ti(int,X17) != ti(int,X18)
& ord_less_eq(int,X17,X18) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_zless__le) ).
fof(tsy_c_Int_OBit1_res,hypothesis,
! [X1] : ti(int,bit1(X1)) = bit1(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_OBit1_res) ).
fof(fact_86_number__of__is__id,axiom,
! [X19] : number_number_of(int,X19) = ti(int,X19),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_86_number__of__is__id) ).
fof(conj_0,conjecture,
? [X5,X6] : plus_plus(int,power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X6,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(tsy_c_Int_OBit0_res,hypothesis,
! [X1] : ti(int,bit0(X1)) = bit0(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_OBit0_res) ).
fof(fact_0_tpos,axiom,
ord_less_eq(int,one_one(int),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(fact_158_one__is__num__one,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_158_one__is__num__one) ).
fof(fact_85_zmult__commute,axiom,
! [X16,X12] : times_times(int,X16,X12) = times_times(int,X12,X16),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_85_zmult__commute) ).
fof(fact_89_zadd__commute,axiom,
! [X16,X12] : plus_plus(int,X16,X12) = plus_plus(int,X12,X16),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_89_zadd__commute) ).
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)
=> ? [X5,X6] : plus_plus(int,power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X6,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_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)
=> ? [X5,X6] : plus_plus(int,power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X6,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(tsy_v_t_____res,axiom,
ti(int,t) = t,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_v_t_____res) ).
fof(c_0_12,plain,
! [X17,X18] :
( ord_less(int,X17,X18)
<=> ( ti(int,X17) != ti(int,X18)
& ord_less_eq(int,X17,X18) ) ),
inference(fof_simplification,[status(thm)],[fact_22_zless__le]) ).
fof(c_0_13,hypothesis,
! [X440] : ti(int,bit1(X440)) = bit1(X440),
inference(variable_rename,[status(thm)],[tsy_c_Int_OBit1_res]) ).
fof(c_0_14,plain,
! [X496] : number_number_of(int,X496) = ti(int,X496),
inference(variable_rename,[status(thm)],[fact_86_number__of__is__id]) ).
fof(c_0_15,negated_conjecture,
~ ? [X5,X6] : plus_plus(int,power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X6,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_16,hypothesis,
! [X438] : ti(int,bit0(X438)) = bit0(X438),
inference(variable_rename,[status(thm)],[tsy_c_Int_OBit0_res]) ).
fof(c_0_17,plain,
! [X445,X446] :
( ( ord_less(int,X445,X446)
| ti(int,X445) = ti(int,X446)
| ~ ord_less_eq(int,X445,X446) )
& ( ~ ord_less(int,X445,X446)
| ti(int,X445) != ti(int,X446) )
& ( ~ ord_less(int,X445,X446)
| ord_less_eq(int,X445,X446) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_18,plain,
ord_less_eq(int,one_one(int),t),
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
cnf(c_0_19,plain,
one_one(int) = number_number_of(int,bit1(pls)),
inference(split_conjunct,[status(thm)],[fact_158_one__is__num__one]) ).
cnf(c_0_20,hypothesis,
ti(int,bit1(X1)) = bit1(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
number_number_of(int,X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,negated_conjecture,
! [X68,X69] : plus_plus(int,power_power(int,X68,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X69,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_15])])]) ).
cnf(c_0_23,hypothesis,
ti(int,bit0(X1)) = bit0(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,plain,
! [X494,X495] : times_times(int,X494,X495) = times_times(int,X495,X494),
inference(variable_rename,[status(thm)],[fact_85_zmult__commute]) ).
fof(c_0_25,plain,
! [X136,X137] : plus_plus(int,X136,X137) = plus_plus(int,X137,X136),
inference(variable_rename,[status(thm)],[fact_89_zadd__commute]) ).
fof(c_0_26,plain,
( plus_plus(int,power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk3_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_27,plain,
( plus_plus(int,power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk5_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])])])]) ).
cnf(c_0_28,plain,
( ~ ord_less_eq(int,X1,X2)
| ord_less(int,X1,X2)
| ti(int,X1) = ti(int,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
ord_less_eq(int,number_number_of(int,bit1(pls)),t),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_30,hypothesis,
number_number_of(int,bit1(X1)) = bit1(X1),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_31,plain,
ti(int,t) = t,
inference(split_conjunct,[status(thm)],[tsy_v_t_____res]) ).
cnf(c_0_32,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_22]) ).
cnf(c_0_33,hypothesis,
number_number_of(int,bit0(X1)) = bit0(X1),
inference(rw,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_34,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
( t != one_one(int)
| plus_plus(int,power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk3_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_26]) ).
cnf(c_0_37,plain,
( ~ ord_less(int,one_one(int),t)
| plus_plus(int,power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk5_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_27]) ).
cnf(c_0_38,plain,
( ~ ord_less_eq(int,X1,X2)
| ord_less(int,X1,X2)
| number_number_of(int,X1) = number_number_of(int,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_21]),c_0_21]) ).
cnf(c_0_39,plain,
ord_less_eq(int,bit1(pls),t),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
number_number_of(int,t) = t,
inference(rw,[status(thm)],[c_0_31,c_0_21]) ).
cnf(c_0_41,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,bit1(pls),times_times(int,m,bit0(bit0(bit1(pls))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_19]),c_0_30]),c_0_35]) ).
cnf(c_0_42,plain,
( bit1(pls) != t
| plus_plus(int,power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk3_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,bit1(pls),times_times(int,m,bit0(bit0(bit1(pls))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_33]),c_0_34]),c_0_19]),c_0_30]),c_0_35]),c_0_19]),c_0_30]) ).
cnf(c_0_43,plain,
( ~ ord_less(int,bit1(pls),t)
| plus_plus(int,power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk5_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,bit1(pls),times_times(int,m,bit0(bit0(bit1(pls))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_33]),c_0_34]),c_0_19]),c_0_30]),c_0_35]),c_0_19]),c_0_30]) ).
cnf(c_0_44,plain,
( ord_less(int,bit1(pls),t)
| bit1(pls) = t ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_30]),c_0_40]) ).
cnf(c_0_45,negated_conjecture,
bit1(pls) != t,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
~ ord_less(int,bit1(pls),t),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_44,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM926+6 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n002.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 03:21:17 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 4.61/1.16 % Version: 3.5.1
% 4.61/1.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.61/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.61/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.61/1.16 % Starting new_bool_3 with 300s (1) cores
% 4.61/1.16 % Starting new_bool_1 with 300s (1) cores
% 4.61/1.16 % Starting sh5l with 300s (1) cores
% 4.61/1.16 % sh5l with pid 2316171 completed with status 0
% 4.61/1.16 % Result found by sh5l
% 4.61/1.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.61/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.61/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.61/1.16 % Starting new_bool_3 with 300s (1) cores
% 4.61/1.16 % Starting new_bool_1 with 300s (1) cores
% 4.61/1.16 % Starting sh5l with 300s (1) cores
% 4.61/1.16 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 4.61/1.16 % SinE strategy is gf500_gu_R04_F100_L20000
% 4.61/1.16 % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.61/1.16 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.61/1.16 % Starting SubtermCWHack with 28s (1) cores
% 4.61/1.16 % SubtermCWHack with pid 2316174 completed with status 0
% 4.61/1.16 % Result found by SubtermCWHack
% 4.61/1.16 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.61/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.61/1.16 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.61/1.16 % Starting new_bool_3 with 300s (1) cores
% 4.61/1.16 % Starting new_bool_1 with 300s (1) cores
% 4.61/1.16 % Starting sh5l with 300s (1) cores
% 4.61/1.16 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 4.61/1.16 % SinE strategy is gf500_gu_R04_F100_L20000
% 4.61/1.16 % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.61/1.16 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.61/1.16 % Starting SubtermCWHack with 28s (1) cores
% 4.61/1.16 % Preprocessing time : 0.010 s
% 4.61/1.16
% 4.61/1.16 % Proof found!
% 4.61/1.16 % SZS status Theorem
% 4.61/1.16 % SZS output start CNFRefutation
% See solution above
% 4.61/1.16 % Parsed axioms : 653
% 4.61/1.16 % Removed by relevancy pruning/SinE : 101
% 4.61/1.16 % Initial clauses : 721
% 4.61/1.16 % Removed in clause preprocessing : 6
% 4.61/1.16 % Initial clauses in saturation : 715
% 4.61/1.16 % Processed clauses : 5219
% 4.61/1.16 % ...of these trivial : 197
% 4.61/1.16 % ...subsumed : 3489
% 4.61/1.16 % ...remaining for further processing : 1532
% 4.61/1.16 % Other redundant clauses eliminated : 52
% 4.61/1.16 % Clauses deleted for lack of memory : 0
% 4.61/1.16 % Backward-subsumed : 76
% 4.61/1.16 % Backward-rewritten : 37
% 4.61/1.16 % Generated clauses : 28668
% 4.61/1.16 % ...of the previous two non-redundant : 23670
% 4.61/1.16 % ...aggressively subsumed : 0
% 4.61/1.16 % Contextual simplify-reflections : 4
% 4.61/1.16 % Paramodulations : 28600
% 4.61/1.16 % Factorizations : 7
% 4.61/1.16 % NegExts : 0
% 4.61/1.16 % Equation resolutions : 63
% 4.61/1.16 % Disequality decompositions : 0
% 4.61/1.16 % Total rewrite steps : 31681
% 4.61/1.16 % ...of those cached : 29895
% 4.61/1.16 % Propositional unsat checks : 0
% 4.61/1.16 % Propositional check models : 0
% 4.61/1.16 % Propositional check unsatisfiable : 0
% 4.61/1.16 % Propositional clauses : 0
% 4.61/1.16 % Propositional clauses after purity: 0
% 4.61/1.16 % Propositional unsat core size : 0
% 4.61/1.16 % Propositional preprocessing time : 0.000
% 4.61/1.16 % Propositional encoding time : 0.000
% 4.61/1.16 % Propositional solver time : 0.000
% 4.61/1.16 % Success case prop preproc time : 0.000
% 4.61/1.16 % Success case prop encoding time : 0.000
% 4.61/1.16 % Success case prop solver time : 0.000
% 4.61/1.16 % Current number of processed clauses : 1397
% 4.61/1.16 % Positive orientable unit clauses : 354
% 4.61/1.16 % Positive unorientable unit clauses: 11
% 4.61/1.16 % Negative unit clauses : 150
% 4.61/1.16 % Non-unit-clauses : 882
% 4.61/1.16 % Current number of unprocessed clauses: 19140
% 4.61/1.16 % ...number of literals in the above : 47223
% 4.61/1.16 % Current number of archived formulas : 0
% 4.61/1.16 % Current number of archived clauses : 114
% 4.61/1.16 % Clause-clause subsumption calls (NU) : 84698
% 4.61/1.16 % Rec. Clause-clause subsumption calls : 58148
% 4.61/1.16 % Non-unit clause-clause subsumptions : 1619
% 4.61/1.16 % Unit Clause-clause subsumption calls : 7634
% 4.61/1.16 % Rewrite failures with RHS unbound : 0
% 4.61/1.16 % BW rewrite match attempts : 2711
% 4.61/1.16 % BW rewrite match successes : 53
% 4.61/1.16 % Condensation attempts : 0
% 4.61/1.16 % Condensation successes : 0
% 4.61/1.16 % Termbank termtop insertions : 444976
% 4.61/1.16 % Search garbage collected termcells : 8636
% 4.61/1.16
% 4.61/1.16 % -------------------------------------------------
% 4.61/1.16 % User time : 0.630 s
% 4.61/1.16 % System time : 0.038 s
% 4.61/1.16 % Total time : 0.668 s
% 4.61/1.16 % Maximum resident set size: 6436 pages
% 4.61/1.16
% 4.61/1.16 % -------------------------------------------------
% 4.61/1.16 % User time : 0.649 s
% 4.61/1.16 % System time : 0.043 s
% 4.61/1.16 % Total time : 0.692 s
% 4.61/1.16 % Maximum resident set size: 5632 pages
% 4.61/1.16 % E exiting
%------------------------------------------------------------------------------