%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU444+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:25:13 PM UTC 2026
% Result : Theorem 5.65s 2.04s
% Output : CNFRefutation 5.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 5 unt; 0 def)
% Number of atoms : 93 ( 33 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 91 ( 40 ~; 30 |; 10 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 73 ( 4 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t56_relset_2,conjecture,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3))
& k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t56_relset_2) ).
fof(t51_relset_2,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k2_funct_5(X3) = k10_relset_1(X2,X1,X3,X2)
& k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t51_relset_2) ).
fof(dt_k6_relset_1,axiom,
! [X1,X2,X3] :
( m1_relset_1(X3,X1,X2)
=> m2_relset_1(k6_relset_1(X1,X2,X3),X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+16.ax',dt_k6_relset_1) ).
fof(redefinition_k6_relset_1,axiom,
! [X1,X2,X3] :
( m1_relset_1(X3,X1,X2)
=> k6_relset_1(X1,X2,X3) = k4_relat_1(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+16.ax',redefinition_k6_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
<=> m1_relset_1(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+16.ax',redefinition_m2_relset_1) ).
fof(t21_funct_5,axiom,
! [X1] :
( v1_relat_1(X1)
=> ( k2_funct_5(X1) = k2_relat_1(X1)
& k1_funct_5(X1) = k1_relat_1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+61.ax',t21_funct_5) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> v1_relat_1(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+16.ax',cc1_relset_1) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X1,X2)
=> m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+16.ax',dt_m2_relset_1) ).
fof(t37_relat_1,axiom,
! [X1] :
( v1_relat_1(X1)
=> ( k1_relat_1(X1) = k2_relat_1(k4_relat_1(X1))
& k2_relat_1(X1) = k1_relat_1(k4_relat_1(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t37_relat_1) ).
fof(dt_k4_relat_1,axiom,
! [X1] :
( v1_relat_1(X1)
=> v1_relat_1(k4_relat_1(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',dt_k4_relat_1) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3))
& k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) ) ),
inference(assume_negation,[status(cth)],[t56_relset_2]) ).
fof(c_0_11,negated_conjecture,
( ( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0))
| k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) )
& m2_relset_1(esk3_0,esk2_0,esk1_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_12,plain,
! [X114,X115,X116] :
( ( ~ m2_relset_1(X116,X115,X114)
| k2_funct_5(X116) = k10_relset_1(X115,X114,X116,X115) )
& ( ~ m2_relset_1(X116,X115,X114)
| k1_funct_5(X116) = k10_relset_1(X114,X115,k6_relset_1(X115,X114,X116),X114) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t51_relset_2])])])]) ).
cnf(c_0_13,negated_conjecture,
( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0))
| k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( ~ m2_relset_1(X1,X2,X3)
| k2_funct_5(X1) = k10_relset_1(X2,X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
m2_relset_1(esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) != k1_funct_5(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
fof(c_0_17,plain,
! [X105,X106,X107] :
( m2_relset_1(k6_relset_1(X105,X106,X107),X106,X105)
| ~ m1_relset_1(X107,X105,X106) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_relset_1])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ m2_relset_1(k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0,esk2_0)
| k2_funct_5(k6_relset_1(esk2_0,esk1_0,esk3_0)) != k1_funct_5(esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_19,plain,
( ~ m1_relset_1(X1,X2,X3)
| m2_relset_1(k6_relset_1(X2,X3,X1),X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X111,X112,X113] :
( k6_relset_1(X111,X112,X113) = k4_relat_1(X113)
| ~ m1_relset_1(X113,X111,X112) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_relset_1])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ m1_relset_1(esk3_0,esk2_0,esk1_0)
| k2_funct_5(k6_relset_1(esk2_0,esk1_0,esk3_0)) != k1_funct_5(esk3_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ m1_relset_1(X1,X2,X3)
| k6_relset_1(X2,X3,X1) = k4_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X566,X567,X568] :
( ( m2_relset_1(X568,X566,X567)
| ~ m1_relset_1(X568,X566,X567) )
& ( m1_relset_1(X568,X566,X567)
| ~ m2_relset_1(X568,X566,X567) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ m1_relset_1(esk3_0,esk2_0,esk1_0)
| k2_funct_5(k4_relat_1(esk3_0)) != k1_funct_5(esk3_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ m2_relset_1(X1,X2,X3)
| m1_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X83] :
( ( ~ v1_relat_1(X83)
| k2_funct_5(X83) = k2_relat_1(X83) )
& ( ~ v1_relat_1(X83)
| k1_funct_5(X83) = k1_relat_1(X83) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_funct_5])])])]) ).
fof(c_0_27,plain,
! [X546,X547,X548] :
( v1_relat_1(X548)
| ~ m1_subset_1(X548,k1_zfmisc_1(k2_zfmisc_1(X546,X547))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])])]) ).
fof(c_0_28,plain,
! [X549,X550,X551] :
( m1_subset_1(X551,k1_zfmisc_1(k2_zfmisc_1(X549,X550)))
| ~ m2_relset_1(X551,X549,X550) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])])]) ).
cnf(c_0_29,negated_conjecture,
k2_funct_5(k4_relat_1(esk3_0)) != k1_funct_5(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15])]) ).
cnf(c_0_30,plain,
( ~ v1_relat_1(X1)
| k2_funct_5(X1) = k2_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_31,plain,
! [X1870] :
( ( ~ v1_relat_1(X1870)
| k1_relat_1(X1870) = k2_relat_1(k4_relat_1(X1870)) )
& ( ~ v1_relat_1(X1870)
| k2_relat_1(X1870) = k1_relat_1(k4_relat_1(X1870)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_relat_1])])])]) ).
fof(c_0_32,plain,
! [X1883] :
( v1_relat_1(k4_relat_1(X1883))
| ~ v1_relat_1(X1883) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_relat_1])])]) ).
cnf(c_0_33,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
| v1_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( ~ m2_relset_1(X1,X2,X3)
| m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( ~ v1_relat_1(k4_relat_1(esk3_0))
| k2_relat_1(k4_relat_1(esk3_0)) != k1_funct_5(esk3_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( ~ v1_relat_1(X1)
| k1_relat_1(X1) = k2_relat_1(k4_relat_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( ~ v1_relat_1(X1)
| v1_relat_1(k4_relat_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
( ~ v1_relat_1(X1)
| k1_funct_5(X1) = k1_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,plain,
( ~ m2_relset_1(X1,X2,X3)
| v1_relat_1(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ v1_relat_1(esk3_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_15]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU444+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.47 % Computer : n020.cluster.edu
% 0.17/0.47 % Model : x86_64 x86_64
% 0.17/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.47 % Memory : 8046.5625MB
% 0.17/0.47 % OS : Linux 6.8.0-71-generic
% 0.17/0.47 % CPULimit : 300
% 0.17/0.47 % WCLimit : 300
% 0.17/0.47 % DateTime : Mon Sep 21 06:34:02 UTC 2026
% 0.17/0.47 % CPUTime :
% 0.17/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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
% 5.65/2.04 % Version: 3.5.1
% 5.65/2.04 % Preprocessing class: FMLMSMLLSSSNFFN.
% 5.65/2.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.65/2.04 % Starting new_bool_3 with 900s (3) cores
% 5.65/2.04 % Starting new_bool_1 with 900s (3) cores
% 5.65/2.04 % Starting sh5l with 300s (1) cores
% 5.65/2.04 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 5.65/2.04 % new_bool_1 with pid 2261806 completed with status 0
% 5.65/2.04 % Result found by new_bool_1
% 5.65/2.04 % Preprocessing class: FMLMSMLLSSSNFFN.
% 5.65/2.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.65/2.04 % Starting new_bool_3 with 900s (3) cores
% 5.65/2.04 % Starting new_bool_1 with 900s (3) cores
% 5.65/2.04 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.65/2.04 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.65/2.04 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.65/2.04 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 5.65/2.04 % Starting SubtermCWHack with 82s (1) cores
% 5.65/2.04 % Starting new_bool_1 with 91s (1) cores
% 5.65/2.04 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 5.65/2.04 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 2261812 completed with status 0
% 5.65/2.04 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 5.65/2.04 % Preprocessing class: FMLMSMLLSSSNFFN.
% 5.65/2.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.65/2.04 % Starting new_bool_3 with 900s (3) cores
% 5.65/2.04 % Starting new_bool_1 with 900s (3) cores
% 5.65/2.04 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.65/2.04 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.65/2.04 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.65/2.04 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 5.65/2.04 % Starting SubtermCWHack with 82s (1) cores
% 5.65/2.04 % Starting new_bool_1 with 91s (1) cores
% 5.65/2.04 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 5.65/2.04 % Preprocessing time : 0.032 s
% 5.65/2.04 % Presaturation interreduction done
% 5.65/2.04
% 5.65/2.04 % Proof found!
% 5.65/2.04 % SZS status Theorem
% 5.65/2.04 % SZS output start CNFRefutation
% See solution above
% 5.65/2.04 % Parsed axioms : 4528
% 5.65/2.04 % Removed by relevancy pruning/SinE : 3462
% 5.65/2.04 % Initial clauses : 1948
% 5.65/2.04 % Removed in clause preprocessing : 43
% 5.65/2.04 % Initial clauses in saturation : 1905
% 5.65/2.04 % Processed clauses : 7584
% 5.65/2.04 % ...of these trivial : 61
% 5.65/2.04 % ...subsumed : 3851
% 5.65/2.04 % ...remaining for further processing : 3672
% 5.65/2.04 % Other redundant clauses eliminated : 346
% 5.65/2.04 % Clauses deleted for lack of memory : 0
% 5.65/2.04 % Backward-subsumed : 61
% 5.65/2.04 % Backward-rewritten : 60
% 5.65/2.04 % Generated clauses : 24536
% 5.65/2.04 % ...of the previous two non-redundant : 20920
% 5.65/2.04 % ...aggressively subsumed : 0
% 5.65/2.04 % Contextual simplify-reflections : 95
% 5.65/2.04 % Paramodulations : 24197
% 5.65/2.04 % Factorizations : 1
% 5.65/2.04 % NegExts : 0
% 5.65/2.04 % Equation resolutions : 351
% 5.65/2.04 % Disequality decompositions : 0
% 5.65/2.04 % Total rewrite steps : 12135
% 5.65/2.04 % ...of those cached : 10821
% 5.65/2.04 % Propositional unsat checks : 0
% 5.65/2.04 % Propositional check models : 0
% 5.65/2.04 % Propositional check unsatisfiable : 0
% 5.65/2.04 % Propositional clauses : 0
% 5.65/2.04 % Propositional clauses after purity: 0
% 5.65/2.04 % Propositional unsat core size : 0
% 5.65/2.04 % Propositional preprocessing time : 0.000
% 5.65/2.04 % Propositional encoding time : 0.000
% 5.65/2.04 % Propositional solver time : 0.000
% 5.65/2.04 % Success case prop preproc time : 0.000
% 5.65/2.04 % Success case prop encoding time : 0.000
% 5.65/2.04 % Success case prop solver time : 0.000
% 5.65/2.04 % Current number of processed clauses : 1580
% 5.65/2.04 % Positive orientable unit clauses : 340
% 5.65/2.04 % Positive unorientable unit clauses: 4
% 5.65/2.04 % Negative unit clauses : 296
% 5.65/2.04 % Non-unit-clauses : 940
% 5.65/2.04 % Current number of unprocessed clauses: 16800
% 5.65/2.04 % ...number of literals in the above : 39456
% 5.65/2.04 % Current number of archived formulas : 0
% 5.65/2.04 % Current number of archived clauses : 1874
% 5.65/2.04 % Clause-clause subsumption calls (NU) : 1232932
% 5.65/2.04 % Rec. Clause-clause subsumption calls : 400484
% 5.65/2.04 % Non-unit clause-clause subsumptions : 1410
% 5.65/2.04 % Unit Clause-clause subsumption calls : 37322
% 5.65/2.04 % Rewrite failures with RHS unbound : 0
% 5.65/2.04 % BW rewrite match attempts : 418
% 5.65/2.04 % BW rewrite match successes : 311
% 5.65/2.04 % Condensation attempts : 0
% 5.65/2.04 % Condensation successes : 0
% 5.65/2.04 % Termbank termtop insertions : 459598
% 5.65/2.04 % Search garbage collected termcells : 58996
% 5.65/2.04
% 5.65/2.04 % -------------------------------------------------
% 5.65/2.04 % User time : 1.063 s
% 5.65/2.04 % System time : 0.057 s
% 5.65/2.04 % Total time : 1.120 s
% 5.65/2.04 % Maximum resident set size: 15620 pages
% 5.65/2.04
% 5.65/2.04 % -------------------------------------------------
% 5.65/2.04 % User time : 2.651 s
% 5.65/2.04 % System time : 0.162 s
% 5.65/2.04 % Total time : 2.813 s
% 5.65/2.04 % Maximum resident set size: 10240 pages
% 5.65/2.04 % E exiting
%------------------------------------------------------------------------------