%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC218+1 : TPTP v9.3.1. Released v2.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:43:30 PM UTC 2026
% Result : Theorem 0.25s 0.60s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 21 unt; 0 def)
% Number of atoms : 165 ( 61 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 179 ( 67 ~; 58 |; 15 &)
% ( 3 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( neq(X1,nil)
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ! [X7] :
( ssItem(X7)
=> app(app(X5,cons(X7,nil)),X6) != X3 )
| app(X5,X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( neq(X1,nil)
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ! [X7] :
( ssItem(X7)
=> app(app(X5,cons(X7,nil)),X6) != X3 )
| app(X5,X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( neq(X1,nil)
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ! [X7] :
( ssItem(X7)
=> app(app(X5,cons(X7,nil)),X6) != X3 )
| app(X5,X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_11,negated_conjecture,
( ~ neq(esk1_0,nil)
& app(app(esk5_0,cons(esk7_0,nil)),esk6_0) = esk3_0
& ssItem(esk7_0)
& app(esk5_0,esk6_0) = esk4_0
& ssList(esk6_0)
& ssList(esk5_0)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_12,plain,
! [X17,X18] :
( ( ~ ssList(X17)
| ~ ssList(X18)
| neq(X17,X18)
| X17 = X18 )
& ( ~ ssList(X17)
| ~ ssList(X18)
| X17 != X18
| ~ neq(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
cnf(c_0_13,negated_conjecture,
app(app(esk5_0,cons(esk7_0,nil)),esk6_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ neq(esk1_0,nil),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,plain,
! [X41,X42] :
( ( ~ ssList(X41)
| ~ ssList(X42)
| nil = app(X41,X42)
| nil != X41
| nil != X42 )
& ( ~ ssList(X41)
| ~ ssList(X42)
| nil != app(X41,X42)
| nil = X41 )
& ( ~ ssList(X41)
| ~ ssList(X42)
| nil != app(X41,X42)
| nil = X42 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_20,negated_conjecture,
app(app(esk5_0,cons(esk7_0,nil)),esk6_0) = esk1_0,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
app(app(esk5_0,cons(esk7_0,nil)),esk6_0) = nil,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
! [X24,X25] :
( ssList(app(X24,X25))
| ~ ssList(X25)
| ~ ssList(X24) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(app(esk5_0,cons(esk7_0,nil)))
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_29,plain,
! [X44,X45] :
( ssList(cons(X45,X44))
| ~ ssItem(X45)
| ~ ssList(X44) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(cons(esk7_0,nil))
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X43] :
( app(X43,nil) = X43
| ~ ssList(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_34,negated_conjecture,
app(esk5_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_35,negated_conjecture,
esk6_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
app(esk5_0,nil) = esk4_0,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
esk5_0 = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_28])]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_40,negated_conjecture,
app(app(esk4_0,cons(esk7_0,nil)),nil) = nil,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_35]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(app(esk4_0,cons(esk7_0,nil)))
| app(esk4_0,cons(esk7_0,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_17])]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(cons(esk7_0,nil))
| app(esk4_0,cons(esk7_0,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_27]),c_0_42])]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(cons(esk7_0,nil))
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_43]),c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_31]),c_0_17]),c_0_32])]) ).
fof(c_0_46,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(cons(esk7_0,nil))
| app(nil,cons(esk7_0,nil)) = nil ),
inference(rw,[status(thm)],[c_0_43,c_0_45]) ).
fof(c_0_48,plain,
! [X22,X23] :
( nil != cons(X23,X22)
| ~ ssItem(X23)
| ~ ssList(X22) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(cons(esk7_0,nil))
| cons(esk7_0,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_47]),c_0_17])]) ).
cnf(c_0_50,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
cons(esk7_0,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_31]),c_0_17]),c_0_32])]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_17]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC218+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n020.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 08:06:33 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.52 Running first-order theorem proving
% 0.25/0.52 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.25/0.60 % Version: 3.5.1
% 0.25/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.60 % Starting sh5l with 300s (1) cores
% 0.25/0.60 % new_bool_3 with pid 2448190 completed with status 0
% 0.25/0.60 % Result found by new_bool_3
% 0.25/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.60 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.25/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.60 % SubtermCWHack with pid 2448193 completed with status 0
% 0.25/0.60 % Result found by SubtermCWHack
% 0.25/0.60 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.60 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.25/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.60 % Preprocessing time : 0.002 s
% 0.25/0.60
% 0.25/0.60 % Proof found!
% 0.25/0.60 % SZS status Theorem
% 0.25/0.60 % SZS output start CNFRefutation
% See solution above
% 0.25/0.60 % Parsed axioms : 96
% 0.25/0.60 % Removed by relevancy pruning/SinE : 77
% 0.25/0.60 % Initial clauses : 39
% 0.25/0.60 % Removed in clause preprocessing : 0
% 0.25/0.60 % Initial clauses in saturation : 39
% 0.25/0.60 % Processed clauses : 107
% 0.25/0.60 % ...of these trivial : 1
% 0.25/0.60 % ...subsumed : 25
% 0.25/0.60 % ...remaining for further processing : 81
% 0.25/0.60 % Other redundant clauses eliminated : 12
% 0.25/0.60 % Clauses deleted for lack of memory : 0
% 0.25/0.60 % Backward-subsumed : 4
% 0.25/0.60 % Backward-rewritten : 34
% 0.25/0.60 % Generated clauses : 200
% 0.25/0.60 % ...of the previous two non-redundant : 130
% 0.25/0.60 % ...aggressively subsumed : 0
% 0.25/0.60 % Contextual simplify-reflections : 0
% 0.25/0.60 % Paramodulations : 185
% 0.25/0.60 % Factorizations : 0
% 0.25/0.60 % NegExts : 0
% 0.25/0.60 % Equation resolutions : 16
% 0.25/0.60 % Disequality decompositions : 0
% 0.25/0.60 % Total rewrite steps : 249
% 0.25/0.60 % ...of those cached : 233
% 0.25/0.60 % Propositional unsat checks : 0
% 0.25/0.60 % Propositional check models : 0
% 0.25/0.60 % Propositional check unsatisfiable : 0
% 0.25/0.60 % Propositional clauses : 0
% 0.25/0.60 % Propositional clauses after purity: 0
% 0.25/0.60 % Propositional unsat core size : 0
% 0.25/0.60 % Propositional preprocessing time : 0.000
% 0.25/0.60 % Propositional encoding time : 0.000
% 0.25/0.60 % Propositional solver time : 0.000
% 0.25/0.60 % Success case prop preproc time : 0.000
% 0.25/0.60 % Success case prop encoding time : 0.000
% 0.25/0.60 % Success case prop solver time : 0.000
% 0.25/0.60 % Current number of processed clauses : 40
% 0.25/0.60 % Positive orientable unit clauses : 14
% 0.25/0.60 % Positive unorientable unit clauses: 0
% 0.25/0.60 % Negative unit clauses : 2
% 0.25/0.60 % Non-unit-clauses : 24
% 0.25/0.60 % Current number of unprocessed clauses: 52
% 0.25/0.60 % ...number of literals in the above : 204
% 0.25/0.60 % Current number of archived formulas : 0
% 0.25/0.60 % Current number of archived clauses : 38
% 0.25/0.60 % Clause-clause subsumption calls (NU) : 247
% 0.25/0.60 % Rec. Clause-clause subsumption calls : 126
% 0.25/0.60 % Non-unit clause-clause subsumptions : 25
% 0.25/0.60 % Unit Clause-clause subsumption calls : 19
% 0.25/0.60 % Rewrite failures with RHS unbound : 0
% 0.25/0.60 % BW rewrite match attempts : 9
% 0.25/0.60 % BW rewrite match successes : 9
% 0.25/0.60 % Condensation attempts : 0
% 0.25/0.60 % Condensation successes : 0
% 0.25/0.60 % Termbank termtop insertions : 6499
% 0.25/0.60 % Search garbage collected termcells : 1326
% 0.25/0.60
% 0.25/0.60 % -------------------------------------------------
% 0.25/0.60 % User time : 0.018 s
% 0.25/0.60 % System time : 0.004 s
% 0.25/0.60 % Total time : 0.022 s
% 0.25/0.60 % Maximum resident set size: 3756 pages
% 0.25/0.60
% 0.25/0.60 % -------------------------------------------------
% 0.25/0.60 % User time : 0.023 s
% 0.25/0.60 % System time : 0.011 s
% 0.25/0.60 % Total time : 0.034 s
% 0.25/0.60 % Maximum resident set size: 4608 pages
% 0.25/0.60 % E exiting
%------------------------------------------------------------------------------