%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU053+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:28:01 PM UTC 2026
% Result : Theorem 0.14s 5.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 22 unt; 0 def)
% Number of atoms : 123 ( 41 equ)
% Maximal formula atoms : 23 ( 2 avg)
% Number of connectives : 120 ( 45 ~; 46 |; 16 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 55 ( 2 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t122_funct_1,conjecture,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( ! [X2,X3] : relation_image(X1,set_intersection2(X2,X3)) = set_intersection2(relation_image(X1,X2),relation_image(X1,X3))
=> one_to_one(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t122_funct_1) ).
fof(d8_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
<=> ! [X2,X3] :
( ( apply(X1,X2) = apply(X1,X3)
& in(X3,relation_dom(X1))
& in(X2,relation_dom(X1)) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_funct_1) ).
fof(t117_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(X2))
=> relation_image(X2,singleton(X1)) = singleton(apply(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t117_funct_1) ).
fof(t17_zfmisc_1,axiom,
! [X1,X2] :
( X1 != X2
=> disjoint(singleton(X1),singleton(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_zfmisc_1) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(t149_relat_1,axiom,
! [X1] :
( relation(X1)
=> relation_image(X1,empty_set) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t149_relat_1) ).
fof(fc2_subset_1,axiom,
! [X1] : ~ empty(singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_subset_1) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(fc12_relat_1,axiom,
( relation_empty_yielding(empty_set)
& relation(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc12_relat_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( function(X1)
& relation(X1) )
=> ( ! [X2,X3] : relation_image(X1,set_intersection2(X2,X3)) = set_intersection2(relation_image(X1,X2),relation_image(X1,X3))
=> one_to_one(X1) ) ),
inference(assume_negation,[status(cth)],[t122_funct_1]) ).
fof(c_0_10,plain,
! [X20,X21,X22] :
( ( ~ function(X20)
| ~ relation(X20)
| one_to_one(X20)
| esk2_1(X20) != esk3_1(X20) )
& ( ~ function(X20)
| ~ relation(X20)
| one_to_one(X20)
| apply(X20,esk2_1(X20)) = apply(X20,esk3_1(X20)) )
& ( ~ function(X20)
| ~ relation(X20)
| one_to_one(X20)
| in(esk3_1(X20),relation_dom(X20)) )
& ( ~ function(X20)
| ~ relation(X20)
| one_to_one(X20)
| in(esk2_1(X20),relation_dom(X20)) )
& ( ~ function(X20)
| ~ relation(X20)
| X21 = X22
| apply(X20,X21) != apply(X20,X22)
| ~ in(X22,relation_dom(X20))
| ~ in(X21,relation_dom(X20))
| ~ one_to_one(X20) ) ),
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)],[d8_funct_1])])])])])]) ).
fof(c_0_11,negated_conjecture,
! [X58,X59] :
( ~ one_to_one(esk15_0)
& relation_image(esk15_0,set_intersection2(X58,X59)) = set_intersection2(relation_image(esk15_0,X58),relation_image(esk15_0,X59))
& function(esk15_0)
& relation(esk15_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_12,plain,
! [X55,X56] :
( relation_image(X56,singleton(X55)) = singleton(apply(X56,X55))
| ~ in(X55,relation_dom(X56))
| ~ function(X56)
| ~ relation(X56) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t117_funct_1])])]) ).
cnf(c_0_13,plain,
( ~ function(X1)
| ~ relation(X1)
| one_to_one(X1)
| in(esk3_1(X1),relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
relation(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
function(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ one_to_one(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ function(X1)
| ~ relation(X1)
| one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ function(X1)
| ~ relation(X1)
| one_to_one(X1)
| apply(X1,esk2_1(X1)) = apply(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( ~ in(X2,relation_dom(X1))
| ~ function(X1)
| ~ relation(X1)
| relation_image(X1,singleton(X2)) = singleton(apply(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
in(esk3_1(esk15_0),relation_dom(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]) ).
fof(c_0_21,plain,
! [X1,X2] :
( X1 != X2
=> disjoint(singleton(X1),singleton(X2)) ),
inference(fof_simplification,[status(thm)],[t17_zfmisc_1]) ).
cnf(c_0_22,negated_conjecture,
in(esk2_1(esk15_0),relation_dom(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
apply(esk15_0,esk2_1(esk15_0)) = apply(esk15_0,esk3_1(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_24,negated_conjecture,
singleton(apply(esk15_0,esk3_1(esk15_0))) = relation_image(esk15_0,singleton(esk3_1(esk15_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]),c_0_15])]) ).
fof(c_0_25,plain,
! [X18,X19] :
( ( disjoint(X18,X19)
| set_intersection2(X18,X19) != empty_set )
& ( set_intersection2(X18,X19) = empty_set
| ~ disjoint(X18,X19) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])]) ).
fof(c_0_26,plain,
! [X61,X62] :
( disjoint(singleton(X61),singleton(X62))
| X61 = X62 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).
fof(c_0_27,plain,
! [X60] :
( relation_image(X60,empty_set) = empty_set
| ~ relation(X60) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t149_relat_1])])]) ).
fof(c_0_28,plain,
! [X1] : ~ empty(singleton(X1)),
inference(fof_simplification,[status(thm)],[fc2_subset_1]) ).
cnf(c_0_29,negated_conjecture,
relation_image(esk15_0,set_intersection2(X1,X2)) = set_intersection2(relation_image(esk15_0,X1),relation_image(esk15_0,X2)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
relation_image(esk15_0,singleton(esk2_1(esk15_0))) = relation_image(esk15_0,singleton(esk3_1(esk15_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_22]),c_0_14]),c_0_15])]),c_0_23]),c_0_24]) ).
cnf(c_0_31,plain,
( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( disjoint(singleton(X1),singleton(X2))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( ~ relation(X1)
| relation_image(X1,empty_set) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_34,plain,
! [X30] : ~ empty(singleton(X30)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
relation_image(esk15_0,set_intersection2(singleton(esk2_1(esk15_0)),X1)) = relation_image(esk15_0,set_intersection2(singleton(esk3_1(esk15_0)),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_29]) ).
cnf(c_0_36,plain,
( X1 = X2
| set_intersection2(singleton(X1),singleton(X2)) = empty_set ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
relation_image(esk15_0,empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_33,c_0_14]) ).
fof(c_0_38,plain,
! [X33] : set_intersection2(X33,X33) = X33,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k3_xboole_0])]) ).
cnf(c_0_39,plain,
~ empty(singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( esk2_1(esk15_0) = X1
| relation_image(esk15_0,set_intersection2(singleton(esk3_1(esk15_0)),singleton(X1))) = empty_set ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_41,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
~ empty(relation_image(esk15_0,singleton(esk3_1(esk15_0)))),
inference(spm,[status(thm)],[c_0_39,c_0_24]) ).
cnf(c_0_43,negated_conjecture,
( esk2_1(esk15_0) = esk3_1(esk15_0)
| relation_image(esk15_0,singleton(esk3_1(esk15_0))) = empty_set ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc12_relat_1]) ).
cnf(c_0_45,plain,
( ~ function(X1)
| ~ relation(X1)
| esk2_1(X1) != esk3_1(X1)
| one_to_one(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_46,negated_conjecture,
esk2_1(esk15_0) = esk3_1(esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_14]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU053+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n008.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 05:49:00 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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/5.47 % Version: 3.5.1
% 0.14/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.47 % Starting sh5l with 300s (1) cores
% 0.14/5.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 276238 completed with status 0
% 0.14/5.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.47 % No SInE strategy applied
% 0.14/5.47 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.14/5.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/5.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/5.47 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.14/5.47 % G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with pid 276249 completed with status 0
% 0.14/5.47 % Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN
% 0.14/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.47 % No SInE strategy applied
% 0.14/5.47 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.14/5.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/5.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/5.47 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.14/5.47 % Preprocessing time : 0.002 s
% 0.14/5.47 % Presaturation interreduction done
% 0.14/5.47
% 0.14/5.47 % Proof found!
% 0.14/5.47 % SZS status Theorem
% 0.14/5.47 % SZS output start CNFRefutation
% See solution above
% 0.14/5.47 % Parsed axioms : 46
% 0.14/5.47 % Removed by relevancy pruning/SinE : 0
% 0.14/5.47 % Initial clauses : 75
% 0.14/5.47 % Removed in clause preprocessing : 2
% 0.14/5.47 % Initial clauses in saturation : 73
% 0.14/5.47 % Processed clauses : 410
% 0.14/5.47 % ...of these trivial : 13
% 0.14/5.47 % ...subsumed : 120
% 0.14/5.47 % ...remaining for further processing : 277
% 0.14/5.47 % Other redundant clauses eliminated : 3
% 0.14/5.47 % Clauses deleted for lack of memory : 0
% 0.14/5.47 % Backward-subsumed : 1
% 0.14/5.47 % Backward-rewritten : 21
% 0.14/5.47 % Generated clauses : 604
% 0.14/5.47 % ...of the previous two non-redundant : 428
% 0.14/5.47 % ...aggressively subsumed : 0
% 0.14/5.47 % Contextual simplify-reflections : 2
% 0.14/5.47 % Paramodulations : 602
% 0.14/5.47 % Factorizations : 0
% 0.14/5.47 % NegExts : 0
% 0.14/5.47 % Equation resolutions : 3
% 0.14/5.47 % Disequality decompositions : 0
% 0.14/5.47 % Total rewrite steps : 719
% 0.14/5.47 % ...of those cached : 658
% 0.14/5.47 % Propositional unsat checks : 0
% 0.14/5.47 % Propositional check models : 0
% 0.14/5.47 % Propositional check unsatisfiable : 0
% 0.14/5.47 % Propositional clauses : 0
% 0.14/5.47 % Propositional clauses after purity: 0
% 0.14/5.47 % Propositional unsat core size : 0
% 0.14/5.47 % Propositional preprocessing time : 0.000
% 0.14/5.47 % Propositional encoding time : 0.000
% 0.14/5.47 % Propositional solver time : 0.000
% 0.14/5.47 % Success case prop preproc time : 0.000
% 0.14/5.47 % Success case prop encoding time : 0.000
% 0.14/5.47 % Success case prop solver time : 0.000
% 0.14/5.47 % Current number of processed clauses : 183
% 0.14/5.47 % Positive orientable unit clauses : 50
% 0.14/5.47 % Positive unorientable unit clauses: 1
% 0.14/5.47 % Negative unit clauses : 14
% 0.14/5.47 % Non-unit-clauses : 118
% 0.14/5.47 % Current number of unprocessed clauses: 152
% 0.14/5.47 % ...number of literals in the above : 491
% 0.14/5.47 % Current number of archived formulas : 0
% 0.14/5.47 % Current number of archived clauses : 92
% 0.14/5.47 % Clause-clause subsumption calls (NU) : 4104
% 0.14/5.47 % Rec. Clause-clause subsumption calls : 2821
% 0.14/5.47 % Non-unit clause-clause subsumptions : 109
% 0.14/5.47 % Unit Clause-clause subsumption calls : 204
% 0.14/5.47 % Rewrite failures with RHS unbound : 0
% 0.14/5.47 % BW rewrite match attempts : 26
% 0.14/5.47 % BW rewrite match successes : 23
% 0.14/5.47 % Condensation attempts : 0
% 0.14/5.47 % Condensation successes : 0
% 0.14/5.47 % Termbank termtop insertions : 15763
% 0.14/5.47 % Search garbage collected termcells : 744
% 0.14/5.47
% 0.14/5.47 % -------------------------------------------------
% 0.14/5.47 % User time : 0.025 s
% 0.14/5.47 % System time : 0.008 s
% 0.14/5.47 % Total time : 0.033 s
% 0.14/5.47 % Maximum resident set size: 3668 pages
% 0.14/5.47
% 0.14/5.47 % -------------------------------------------------
% 0.14/5.47 % User time : 0.119 s
% 0.14/5.47 % System time : 0.027 s
% 0.14/5.47 % Total time : 0.146 s
% 0.14/5.47 % Maximum resident set size: 4608 pages
% 0.14/5.47 % E exiting
%------------------------------------------------------------------------------