%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC324+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 : n005.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:52 PM UTC 2026
% Result : Theorem 0.12s 0.48s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 11 unt; 0 def)
% Number of atoms : 195 ( 77 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 249 ( 98 ~; 93 |; 39 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn 33 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X4
& nil != X3 )
| ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X4
& app(X8,cons(X7,nil)) != X3
& ssList(X8) )
& ssItem(X7) )
| ? [X5] :
( ? [X6] :
( app(X6,X5) = X1
& app(X5,X6) = X2
& ssList(X6) )
& ssList(X5) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( cons(X2,nil) = X1
& ssItem(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X4
& nil != X3 )
| ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X4
& app(X8,cons(X7,nil)) != X3
& ssList(X8) )
& ssItem(X7) )
| ? [X5] :
( ? [X6] :
( app(X6,X5) = X1
& app(X5,X6) = X2
& ssList(X6) )
& ssList(X5) )
| 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] :
( ( nil = X4
& nil != X3 )
| ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X4
& app(X8,cons(X7,nil)) != X3
& ssList(X8) )
& ssItem(X7) )
| ? [X5] :
( ? [X6] :
( app(X6,X5) = X1
& app(X5,X6) = X2
& ssList(X6) )
& ssList(X5) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,negated_conjecture,
! [X257,X258,X259,X260] :
( ( nil != esk51_0
| nil = esk50_0 )
& ( app(cons(X259,nil),X260) != esk51_0
| app(X260,cons(X259,nil)) = esk50_0
| ~ ssList(X260)
| ~ ssItem(X259) )
& ( app(X258,X257) != esk48_0
| app(X257,X258) != esk49_0
| ~ ssList(X258)
| ~ ssList(X257) )
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_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_8])])])])]) ).
fof(c_0_10,plain,
! [X19,X21] :
( ( ~ ssList(X19)
| singletonP(X19)
| cons(X21,nil) != X19
| ~ ssItem(X21) )
& ( ~ ssList(X19)
| ~ singletonP(X19)
| cons(esk5_1(X19),nil) = X19 )
& ( ~ ssList(X19)
| ~ singletonP(X19)
| ssItem(esk5_1(X19)) ) ),
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)],[ax4])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( app(X2,X1) != esk48_0
| app(X1,X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ ssList(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| singletonP(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X113,X114] :
( ssList(cons(X114,X113))
| ~ ssItem(X114)
| ~ ssList(X113) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_16,plain,
! [X227,X228] :
( ( ~ ssList(X227)
| ~ ssList(X228)
| nil = app(X227,X228)
| nil != X227
| nil != X228 )
& ( ~ ssList(X227)
| ~ ssList(X228)
| nil != app(X227,X228)
| nil = X227 )
& ( ~ ssList(X227)
| ~ ssList(X228)
| nil != app(X227,X228)
| nil = X228 ) ),
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_17,negated_conjecture,
( app(cons(X1,nil),X2) != esk51_0
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(esk5_1(X1),nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssItem(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X2,X1) != esk51_0
| app(X1,X2) != esk50_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
fof(c_0_21,plain,
! [X222,X223] :
( cons(X223,X222) = app(cons(X223,nil),X222)
| ~ ssItem(X223)
| ~ ssList(X222) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_22,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ singletonP(X1)
| app(X1,X2) != esk51_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]) ).
cnf(c_0_27,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
fof(c_0_29,plain,
! [X121] :
( ( ~ ssList(X121)
| nil = X121
| cons(esk45_1(X121),esk44_1(X121)) = X121 )
& ( ~ ssList(X121)
| nil = X121
| ssItem(esk45_1(X121)) )
& ( ~ ssList(X121)
| nil = X121
| ssList(esk44_1(X121)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])]),c_0_24])]) ).
cnf(c_0_32,negated_conjecture,
( nil != esk51_0
| nil = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| cons(X1,X2) != esk51_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk45_1(X1),esk44_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_30,c_0_13]) ).
cnf(c_0_36,negated_conjecture,
esk51_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_31]),c_0_24])]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssItem(esk45_1(esk51_0))
| ~ ssList(esk44_1(esk51_0))
| ~ ssList(cons(esk45_1(esk51_0),nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34])]),c_0_35])]),c_0_36]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk44_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssItem(esk45_1(esk51_0))
| ~ ssList(cons(esk45_1(esk51_0),nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35])]),c_0_36]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk45_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,negated_conjecture,
~ ssList(cons(esk45_1(esk51_0),nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35])]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ ssItem(esk45_1(esk51_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_23]),c_0_24])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_35])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC324+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.09/0.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 08:15:33 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.40 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.12/0.48 % Version: 3.5.1
% 0.12/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.48 % Starting sh5l with 300s (1) cores
% 0.12/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2991943 completed with status 0
% 0.12/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.12/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.48 % No SInE strategy applied
% 0.12/0.48 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.12/0.48 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.12/0.48 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.12/0.48 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.12/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.12/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2991953 completed with status 0
% 0.12/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.12/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.48 % No SInE strategy applied
% 0.12/0.48 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.12/0.48 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.12/0.48 % Preprocessing time : 0.003 s
% 0.12/0.48 % Presaturation interreduction done
% 0.12/0.48
% 0.12/0.48 % Proof found!
% 0.12/0.48 % SZS status Theorem
% 0.12/0.48 % SZS output start CNFRefutation
% See solution above
% 0.12/0.48 % Parsed axioms : 96
% 0.12/0.48 % Removed by relevancy pruning/SinE : 0
% 0.12/0.48 % Initial clauses : 199
% 0.12/0.48 % Removed in clause preprocessing : 2
% 0.12/0.48 % Initial clauses in saturation : 197
% 0.12/0.48 % Processed clauses : 676
% 0.12/0.48 % ...of these trivial : 2
% 0.12/0.48 % ...subsumed : 153
% 0.12/0.48 % ...remaining for further processing : 521
% 0.12/0.48 % Other redundant clauses eliminated : 166
% 0.12/0.48 % Clauses deleted for lack of memory : 0
% 0.12/0.48 % Backward-subsumed : 19
% 0.12/0.48 % Backward-rewritten : 18
% 0.12/0.48 % Generated clauses : 1218
% 0.12/0.48 % ...of the previous two non-redundant : 974
% 0.12/0.48 % ...aggressively subsumed : 0
% 0.12/0.48 % Contextual simplify-reflections : 29
% 0.12/0.48 % Paramodulations : 1049
% 0.12/0.48 % Factorizations : 0
% 0.12/0.48 % NegExts : 0
% 0.12/0.48 % Equation resolutions : 171
% 0.12/0.48 % Disequality decompositions : 0
% 0.12/0.48 % Total rewrite steps : 730
% 0.12/0.48 % ...of those cached : 704
% 0.12/0.48 % Propositional unsat checks : 0
% 0.12/0.48 % Propositional check models : 0
% 0.12/0.48 % Propositional check unsatisfiable : 0
% 0.12/0.48 % Propositional clauses : 0
% 0.12/0.48 % Propositional clauses after purity: 0
% 0.12/0.48 % Propositional unsat core size : 0
% 0.12/0.48 % Propositional preprocessing time : 0.000
% 0.12/0.48 % Propositional encoding time : 0.000
% 0.12/0.48 % Propositional solver time : 0.000
% 0.12/0.48 % Success case prop preproc time : 0.000
% 0.12/0.48 % Success case prop encoding time : 0.000
% 0.12/0.48 % Success case prop solver time : 0.000
% 0.12/0.48 % Current number of processed clauses : 270
% 0.12/0.48 % Positive orientable unit clauses : 22
% 0.12/0.48 % Positive unorientable unit clauses: 0
% 0.12/0.48 % Negative unit clauses : 15
% 0.12/0.48 % Non-unit-clauses : 233
% 0.12/0.48 % Current number of unprocessed clauses: 641
% 0.12/0.48 % ...number of literals in the above : 4221
% 0.12/0.48 % Current number of archived formulas : 0
% 0.12/0.48 % Current number of archived clauses : 228
% 0.12/0.48 % Clause-clause subsumption calls (NU) : 21777
% 0.12/0.48 % Rec. Clause-clause subsumption calls : 5322
% 0.12/0.48 % Non-unit clause-clause subsumptions : 112
% 0.12/0.48 % Unit Clause-clause subsumption calls : 367
% 0.12/0.48 % Rewrite failures with RHS unbound : 0
% 0.12/0.48 % BW rewrite match attempts : 6
% 0.12/0.48 % BW rewrite match successes : 6
% 0.12/0.48 % Condensation attempts : 0
% 0.12/0.48 % Condensation successes : 0
% 0.12/0.48 % Termbank termtop insertions : 42789
% 0.12/0.48 % Search garbage collected termcells : 4290
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.051 s
% 0.12/0.48 % System time : 0.006 s
% 0.12/0.48 % Total time : 0.057 s
% 0.12/0.48 % Maximum resident set size: 4268 pages
% 0.12/0.48
% 0.12/0.48 % -------------------------------------------------
% 0.12/0.48 % User time : 0.188 s
% 0.12/0.48 % System time : 0.023 s
% 0.12/0.48 % Total time : 0.210 s
% 0.12/0.48 % Maximum resident set size: 4864 pages
% 0.12/0.48 % E exiting
%------------------------------------------------------------------------------