%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC330+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:45:53 PM UTC 2026
% Result : Theorem 0.14s 0.50s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 14 unt; 0 def)
% Number of atoms : 210 ( 68 equ)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 251 ( 85 ~; 97 |; 44 &)
% ( 2 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 39 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( equalelemsP(X1)
& segmentP(X2,X1) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ? [X9] :
( lt(X9,X5)
& memberP(X7,X9)
& ssItem(X9) )
| ? [X8] :
( lt(X5,X8)
& memberP(X6,X8)
& ssItem(X8) )
| app(app(X6,X3),X7) != X4
| cons(X5,nil) != X3
| ~ ssList(X7) ) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax73) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(app(X3,X2),X4) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax74) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( equalelemsP(X1)
& segmentP(X2,X1) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ? [X9] :
( lt(X9,X5)
& memberP(X7,X9)
& ssItem(X9) )
| ? [X8] :
( lt(X5,X8)
& memberP(X6,X8)
& ssItem(X8) )
| app(app(X6,X3),X7) != X4
| cons(X5,nil) != X3
| ~ ssList(X7) ) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( equalelemsP(X1)
& segmentP(X2,X1) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ? [X9] :
( lt(X9,X5)
& memberP(X7,X9)
& ssItem(X9) )
| ? [X8] :
( lt(X5,X8)
& memberP(X6,X8)
& ssItem(X8) )
| app(app(X6,X3),X7) != X4
| cons(X5,nil) != X3
| ~ ssList(X7) ) ) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,negated_conjecture,
! [X261,X262] :
( ( ~ equalelemsP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) )
& ( ~ lt(X262,esk52_0)
| ~ memberP(esk54_0,X262)
| ~ ssItem(X262)
| nil = esk50_0 )
& ( ~ lt(X262,esk52_0)
| ~ memberP(esk54_0,X262)
| ~ ssItem(X262)
| nil = esk51_0 )
& ( ~ lt(esk52_0,X261)
| ~ memberP(esk53_0,X261)
| ~ ssItem(X261)
| nil = esk50_0 )
& ( ~ lt(esk52_0,X261)
| ~ memberP(esk53_0,X261)
| ~ ssItem(X261)
| nil = esk51_0 )
& ( app(app(esk53_0,esk50_0),esk54_0) = esk51_0
| nil = esk50_0 )
& ( app(app(esk53_0,esk50_0),esk54_0) = esk51_0
| nil = esk51_0 )
& ( cons(esk52_0,nil) = esk50_0
| nil = esk50_0 )
& ( cons(esk52_0,nil) = esk50_0
| nil = esk51_0 )
& ( ssList(esk54_0)
| nil = esk50_0 )
& ( ssList(esk54_0)
| nil = esk51_0 )
& ( ssList(esk53_0)
| nil = esk50_0 )
& ( ssList(esk53_0)
| nil = esk51_0 )
& ( ssItem(esk52_0)
| nil = esk50_0 )
& ( ssItem(esk52_0)
| nil = esk51_0 )
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
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)],[c_0_8])])])])])]) ).
fof(c_0_10,plain,
! [X209] :
( equalelemsP(cons(X209,nil))
| ~ ssItem(X209) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])])]) ).
fof(c_0_11,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_12,plain,
! [X31,X32,X35,X36] :
( ( ~ ssList(X31)
| ~ ssList(X32)
| segmentP(X31,X32)
| app(app(X35,X32),X36) != X31
| ~ ssList(X36)
| ~ ssList(X35) )
& ( ~ ssList(X31)
| ~ ssList(X32)
| ~ segmentP(X31,X32)
| app(app(esk8_2(X31,X32),X32),esk9_2(X31,X32)) = X31 )
& ( ~ ssList(X31)
| ~ ssList(X32)
| ~ segmentP(X31,X32)
| ssList(esk9_2(X31,X32)) )
& ( ~ ssList(X31)
| ~ ssList(X32)
| ~ segmentP(X31,X32)
| ssList(esk8_2(X31,X32)) ) ),
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)],[ax7])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ equalelemsP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( ssItem(esk52_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_19,plain,
! [X125,X126] :
( nil != cons(X126,X125)
| ~ ssItem(X126)
| ~ ssList(X125) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_20,plain,
( ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,X3),X2) != X4
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( ~ segmentP(esk51_0,esk50_0)
| ~ equalelemsP(esk50_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( equalelemsP(esk50_0)
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_25,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_28,negated_conjecture,
( ssItem(esk52_0)
| nil = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( app(app(esk53_0,esk50_0),esk54_0) = esk51_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_33,negated_conjecture,
( ssList(esk53_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
( ssList(esk54_0)
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
( ~ segmentP(esk51_0,esk50_0)
| esk50_0 = nil ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_36,plain,
! [X198] :
( ( ~ ssList(X198)
| segmentP(nil,X198)
| nil != X198 )
& ( ~ ssList(X198)
| nil = X198
| ~ segmentP(nil,X198) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_37,negated_conjecture,
( esk50_0 != nil
| esk51_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_38,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]),c_0_33]),c_0_34]),c_0_35]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
cnf(c_0_41,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_42,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_39]),c_0_27])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_38]),c_0_40]),c_0_38])]),c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC330+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n026.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 08:19:07 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.50 % Version: 3.5.1
% 0.14/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1818978 completed with status 0
% 0.14/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50 % No SInE strategy applied
% 0.14/0.50 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/0.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.50 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.14/0.50 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.14/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.14/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1818985 completed with status 0
% 0.14/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50 % No SInE strategy applied
% 0.14/0.50 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/0.50 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.50 % Preprocessing time : 0.005 s
% 0.14/0.50 % Presaturation interreduction done
% 0.14/0.50
% 0.14/0.50 % Proof found!
% 0.14/0.50 % SZS status Theorem
% 0.14/0.50 % SZS output start CNFRefutation
% See solution above
% 0.14/0.50 % Parsed axioms : 96
% 0.14/0.50 % Removed by relevancy pruning/SinE : 0
% 0.14/0.50 % Initial clauses : 211
% 0.14/0.50 % Removed in clause preprocessing : 2
% 0.14/0.50 % Initial clauses in saturation : 209
% 0.14/0.50 % Processed clauses : 459
% 0.14/0.50 % ...of these trivial : 3
% 0.14/0.50 % ...subsumed : 8
% 0.14/0.50 % ...remaining for further processing : 447
% 0.14/0.50 % Other redundant clauses eliminated : 59
% 0.14/0.50 % Clauses deleted for lack of memory : 0
% 0.14/0.50 % Backward-subsumed : 0
% 0.14/0.50 % Backward-rewritten : 31
% 0.14/0.50 % Generated clauses : 720
% 0.14/0.50 % ...of the previous two non-redundant : 626
% 0.14/0.50 % ...aggressively subsumed : 0
% 0.14/0.50 % Contextual simplify-reflections : 16
% 0.14/0.50 % Paramodulations : 658
% 0.14/0.50 % Factorizations : 0
% 0.14/0.50 % NegExts : 0
% 0.14/0.50 % Equation resolutions : 64
% 0.14/0.50 % Disequality decompositions : 0
% 0.14/0.50 % Total rewrite steps : 319
% 0.14/0.50 % ...of those cached : 301
% 0.14/0.50 % Propositional unsat checks : 0
% 0.14/0.50 % Propositional check models : 0
% 0.14/0.50 % Propositional check unsatisfiable : 0
% 0.14/0.50 % Propositional clauses : 0
% 0.14/0.50 % Propositional clauses after purity: 0
% 0.14/0.50 % Propositional unsat core size : 0
% 0.14/0.50 % Propositional preprocessing time : 0.000
% 0.14/0.50 % Propositional encoding time : 0.000
% 0.14/0.50 % Propositional solver time : 0.000
% 0.14/0.50 % Success case prop preproc time : 0.000
% 0.14/0.50 % Success case prop encoding time : 0.000
% 0.14/0.50 % Success case prop solver time : 0.000
% 0.14/0.50 % Current number of processed clauses : 190
% 0.14/0.50 % Positive orientable unit clauses : 18
% 0.14/0.50 % Positive unorientable unit clauses: 0
% 0.14/0.50 % Negative unit clauses : 2
% 0.14/0.50 % Non-unit-clauses : 170
% 0.14/0.50 % Current number of unprocessed clauses: 579
% 0.14/0.50 % ...number of literals in the above : 3756
% 0.14/0.50 % Current number of archived formulas : 0
% 0.14/0.50 % Current number of archived clauses : 234
% 0.14/0.50 % Clause-clause subsumption calls (NU) : 18838
% 0.14/0.50 % Rec. Clause-clause subsumption calls : 4260
% 0.14/0.50 % Non-unit clause-clause subsumptions : 22
% 0.14/0.50 % Unit Clause-clause subsumption calls : 89
% 0.14/0.50 % Rewrite failures with RHS unbound : 0
% 0.14/0.50 % BW rewrite match attempts : 2
% 0.14/0.50 % BW rewrite match successes : 2
% 0.14/0.50 % Condensation attempts : 0
% 0.14/0.50 % Condensation successes : 0
% 0.14/0.50 % Termbank termtop insertions : 35156
% 0.14/0.50 % Search garbage collected termcells : 4397
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.059 s
% 0.14/0.50 % System time : 0.012 s
% 0.14/0.50 % Total time : 0.071 s
% 0.14/0.50 % Maximum resident set size: 4272 pages
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.258 s
% 0.14/0.50 % System time : 0.034 s
% 0.14/0.50 % Total time : 0.292 s
% 0.14/0.50 % Maximum resident set size: 4608 pages
% 0.14/0.50 % E exiting
%------------------------------------------------------------------------------