%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU251+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 02:24:27 PM UTC 2026
% Result : Theorem 10.75s 2.15s
% Output : CNFRefutation 10.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 16 unt; 0 def)
% Number of atoms : 132 ( 31 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 153 ( 63 ~; 64 |; 13 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 91 ( 2 sgn 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( X3 = fiber(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(ordered_pair(X4,X2),X1)
& X4 != X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_wellord1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(t21_wellord1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_wellord1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,cartesian_product2(X2,X2))
& in(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
fof(c_0_7,plain,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( X3 = fiber(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(ordered_pair(X4,X2),X1)
& X4 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[d1_wellord1]) ).
fof(c_0_8,plain,
! [X13,X14,X15,X16,X17,X18,X19] :
( ( ~ relation(X13)
| X19 = fiber(X13,X18)
| in(esk1_3(X13,X18,X19),X19)
| in(ordered_pair(esk1_3(X13,X18,X19),X18),X13) )
& ( ~ relation(X13)
| X19 = fiber(X13,X18)
| in(esk1_3(X13,X18,X19),X19)
| esk1_3(X13,X18,X19) != X18 )
& ( ~ relation(X13)
| X19 = fiber(X13,X18)
| ~ in(ordered_pair(esk1_3(X13,X18,X19),X18),X13)
| esk1_3(X13,X18,X19) = X18
| ~ in(esk1_3(X13,X18,X19),X19) )
& ( ~ relation(X13)
| X15 != fiber(X13,X14)
| in(X17,X15)
| ~ in(ordered_pair(X17,X14),X13)
| X17 = X14 )
& ( ~ relation(X13)
| X15 != fiber(X13,X14)
| ~ in(X16,X15)
| in(ordered_pair(X16,X14),X13) )
& ( ~ relation(X13)
| X15 != fiber(X13,X14)
| ~ in(X16,X15)
| X16 != X14 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])])]) ).
fof(c_0_9,plain,
! [X27,X28] : ordered_pair(X27,X28) = unordered_pair(unordered_pair(X27,X28),singleton(X27)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)) ),
inference(assume_negation,[status(cth)],[t21_wellord1]) ).
cnf(c_0_11,plain,
( ~ relation(X3)
| X4 != fiber(X3,X2)
| ~ in(X1,X4)
| in(ordered_pair(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X9,X10] : unordered_pair(X9,X10) = unordered_pair(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_14,negated_conjecture,
( ~ subset(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0))
& relation(esk11_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_15,plain,
! [X21,X22,X23,X24,X25] :
( ( subset(X24,X25)
| ~ in(esk2_2(X24,X25),X25) )
& ( subset(X24,X25)
| in(esk2_2(X24,X25),X24) )
& ( in(X23,X22)
| ~ in(X23,X21)
| ~ subset(X21,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(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).
cnf(c_0_16,plain,
( ~ in(X1,X4)
| ~ relation(X3)
| X4 != fiber(X3,X2)
| in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ subset(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( ~ relation(X3)
| X4 != fiber(X3,X2)
| ~ in(ordered_pair(X1,X2),X3)
| in(X1,X4)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( ~ in(X1,fiber(X3,X2))
| ~ relation(X3)
| in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
in(esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)),fiber(relation_restriction(esk11_0,esk9_0),esk10_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X31,X32] :
( relation(relation_restriction(X31,X32))
| ~ relation(X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])]) ).
cnf(c_0_24,plain,
( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| ~ relation(X3)
| X4 != fiber(X3,X2)
| in(X1,X4)
| X1 = X2 ),
inference(rw,[status(thm)],[c_0_20,c_0_12]) ).
fof(c_0_25,plain,
! [X44,X45,X46] :
( ( ~ relation(X46)
| in(X44,relation_restriction(X46,X45))
| ~ in(X44,cartesian_product2(X45,X45))
| ~ in(X44,X46) )
& ( ~ relation(X46)
| ~ in(X44,relation_restriction(X46,X45))
| in(X44,cartesian_product2(X45,X45)) )
& ( ~ relation(X46)
| ~ in(X44,relation_restriction(X46,X45))
| in(X44,X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ relation(relation_restriction(esk11_0,esk9_0))
| in(unordered_pair(singleton(esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0))),unordered_pair(esk10_0,esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)))),relation_restriction(esk11_0,esk9_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17]) ).
cnf(c_0_27,plain,
( ~ relation(X1)
| relation(relation_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
relation(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,plain,
( ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3)
| ~ relation(X3)
| in(X1,fiber(X3,X2))
| X1 = X2 ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_17])]) ).
cnf(c_0_30,plain,
( ~ relation(X2)
| ~ in(X1,relation_restriction(X2,X3))
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
in(unordered_pair(singleton(esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0))),unordered_pair(esk10_0,esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)))),relation_restriction(esk11_0,esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( ~ in(esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_33,plain,
( ~ in(unordered_pair(singleton(X1),unordered_pair(X2,X1)),X3)
| ~ relation(X3)
| in(X1,fiber(X3,X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
in(unordered_pair(singleton(esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0))),unordered_pair(esk10_0,esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)))),esk11_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
~ in(esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)),fiber(esk11_0,esk10_0)),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_36,plain,
( ~ relation(X4)
| X3 != fiber(X4,X2)
| ~ in(X1,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_37,negated_conjecture,
esk2_2(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)) = esk10_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28])]),c_0_35]) ).
cnf(c_0_38,plain,
( ~ in(X2,fiber(X1,X2))
| ~ relation(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
in(esk10_0,fiber(relation_restriction(esk11_0,esk9_0),esk10_0)),
inference(rw,[status(thm)],[c_0_22,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
~ relation(relation_restriction(esk11_0,esk9_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU251+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 06:05:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 10.75/2.15 % Version: 3.5.1
% 10.75/2.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.75/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.75/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.75/2.15 % Starting new_bool_3 with 300s (1) cores
% 10.75/2.15 % Starting new_bool_1 with 300s (1) cores
% 10.75/2.15 % Starting sh5l with 300s (1) cores
% 10.75/2.15 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3572372 completed with status 0
% 10.75/2.15 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.75/2.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.75/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.75/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.75/2.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.75/2.15 % No SInE strategy applied
% 10.75/2.15 % Search class: FGHSM-FFMM31-MFFFFFNN
% 10.75/2.15 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 10.75/2.15 % Starting SubtermCWHack with 136s (1) cores
% 10.75/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.75/2.15 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 10.75/2.15 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 10.75/2.15 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 10.75/2.15 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 3572379 completed with status 0
% 10.75/2.15 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 10.75/2.15 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.75/2.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.75/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.75/2.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.75/2.15 % No SInE strategy applied
% 10.75/2.15 % Search class: FGHSM-FFMM31-MFFFFFNN
% 10.75/2.15 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 10.75/2.15 % Starting SubtermCWHack with 136s (1) cores
% 10.75/2.15 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.75/2.15 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 10.75/2.15 % Preprocessing time : 0.003 s
% 10.75/2.15 % Presaturation interreduction done
% 10.75/2.15
% 10.75/2.15 % Proof found!
% 10.75/2.15 % SZS status Theorem
% 10.75/2.15 % SZS output start CNFRefutation
% See solution above
% 10.75/2.15 % Parsed axioms : 40
% 10.75/2.15 % Removed by relevancy pruning/SinE : 0
% 10.75/2.15 % Initial clauses : 58
% 10.75/2.15 % Removed in clause preprocessing : 12
% 10.75/2.15 % Initial clauses in saturation : 46
% 10.75/2.15 % Processed clauses : 4211
% 10.75/2.15 % ...of these trivial : 33
% 10.75/2.15 % ...subsumed : 1802
% 10.75/2.15 % ...remaining for further processing : 2376
% 10.75/2.15 % Other redundant clauses eliminated : 5
% 10.75/2.15 % Clauses deleted for lack of memory : 0
% 10.75/2.15 % Backward-subsumed : 97
% 10.75/2.15 % Backward-rewritten : 649
% 10.75/2.15 % Generated clauses : 32368
% 10.75/2.15 % ...of the previous two non-redundant : 31166
% 10.75/2.15 % ...aggressively subsumed : 0
% 10.75/2.15 % Contextual simplify-reflections : 1
% 10.75/2.15 % Paramodulations : 32344
% 10.75/2.15 % Factorizations : 20
% 10.75/2.15 % NegExts : 0
% 10.75/2.15 % Equation resolutions : 5
% 10.75/2.15 % Disequality decompositions : 0
% 10.75/2.15 % Total rewrite steps : 2779
% 10.75/2.15 % ...of those cached : 2554
% 10.75/2.15 % Propositional unsat checks : 0
% 10.75/2.15 % Propositional check models : 0
% 10.75/2.15 % Propositional check unsatisfiable : 0
% 10.75/2.15 % Propositional clauses : 0
% 10.75/2.15 % Propositional clauses after purity: 0
% 10.75/2.15 % Propositional unsat core size : 0
% 10.75/2.15 % Propositional preprocessing time : 0.000
% 10.75/2.15 % Propositional encoding time : 0.000
% 10.75/2.15 % Propositional solver time : 0.000
% 10.75/2.15 % Success case prop preproc time : 0.000
% 10.75/2.15 % Success case prop encoding time : 0.000
% 10.75/2.15 % Success case prop solver time : 0.000
% 10.75/2.15 % Current number of processed clauses : 1581
% 10.75/2.15 % Positive orientable unit clauses : 248
% 10.75/2.15 % Positive unorientable unit clauses: 2
% 10.75/2.15 % Negative unit clauses : 244
% 10.75/2.15 % Non-unit-clauses : 1087
% 10.75/2.15 % Current number of unprocessed clauses: 27009
% 10.75/2.15 % ...number of literals in the above : 112573
% 10.75/2.15 % Current number of archived formulas : 0
% 10.75/2.15 % Current number of archived clauses : 793
% 10.75/2.15 % Clause-clause subsumption calls (NU) : 215238
% 10.75/2.15 % Rec. Clause-clause subsumption calls : 115958
% 10.75/2.15 % Non-unit clause-clause subsumptions : 1323
% 10.75/2.15 % Unit Clause-clause subsumption calls : 49219
% 10.75/2.15 % Rewrite failures with RHS unbound : 0
% 10.75/2.15 % BW rewrite match attempts : 5591
% 10.75/2.15 % BW rewrite match successes : 135
% 10.75/2.15 % Condensation attempts : 0
% 10.75/2.15 % Condensation successes : 0
% 10.75/2.15 % Termbank termtop insertions : 672553
% 10.75/2.15 % Search garbage collected termcells : 581
% 10.75/2.15
% 10.75/2.15 % -------------------------------------------------
% 10.75/2.15 % User time : 1.481 s
% 10.75/2.15 % System time : 0.052 s
% 10.75/2.15 % Total time : 1.533 s
% 10.75/2.15 % Maximum resident set size: 3660 pages
% 10.75/2.15
% 10.75/2.15 % -------------------------------------------------
% 10.75/2.15 % User time : 7.423 s
% 10.75/2.15 % System time : 0.267 s
% 10.75/2.15 % Total time : 7.691 s
% 10.75/2.15 % Maximum resident set size: 4864 pages
% 10.75/2.15 % E exiting
%------------------------------------------------------------------------------