%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC085+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 : n006.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:44:51 PM UTC 2026
% Result : Theorem 1.08s 0.69s
% Output : CNFRefutation 1.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 50 ( 14 unt; 0 def)
% Number of atoms : 193 ( 41 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 237 ( 94 ~; 91 |; 27 &)
% ( 2 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 34 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil)
| 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)
=> ( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X52,X53,X54,X55] :
( segmentP(app(app(X54,X52),X55),X53)
| ~ segmentP(X52,X53)
| ~ ssList(X55)
| ~ ssList(X54)
| ~ ssList(X53)
| ~ ssList(X52) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_11,plain,
! [X63] :
( app(nil,X63) = X63
| ~ ssList(X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_12,negated_conjecture,
! [X11] :
( ( nil = esk3_0
| frontsegP(esk4_0,esk3_0) )
& ( nil = esk3_0
| neq(esk3_0,nil) )
& ( nil = esk4_0
| frontsegP(esk4_0,esk3_0) )
& ( nil = esk4_0
| neq(esk3_0,nil) )
& ( ~ segmentP(esk1_0,X11)
| ~ segmentP(esk2_0,X11)
| ~ neq(X11,nil)
| ~ ssList(X11) )
& neq(esk2_0,nil)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_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_9])])])])])]) ).
cnf(c_0_13,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_16,plain,
! [X12,X13,X15] :
( ( ~ ssList(X12)
| ~ ssList(X13)
| frontsegP(X12,X13)
| app(X13,X15) != X12
| ~ ssList(X15) )
& ( ~ ssList(X12)
| ~ ssList(X13)
| ~ frontsegP(X12,X13)
| app(X13,esk5_2(X12,X13)) = X12 )
& ( ~ ssList(X12)
| ~ ssList(X13)
| ~ frontsegP(X12,X13)
| ssList(esk5_2(X12,X13)) ) ),
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)],[ax5])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk5_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk5_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk3_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( nil = esk3_0
| neq(esk3_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ frontsegP(X1,X3)
| ~ segmentP(X3,X2)
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( nil = esk3_0
| frontsegP(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ segmentP(esk3_0,esk3_0)
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk3_0,X1)
| segmentP(esk4_0,X1)
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]),c_0_28])]) ).
fof(c_0_32,plain,
! [X51] :
( segmentP(X51,X51)
| ~ ssList(X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
fof(c_0_33,plain,
! [X57] :
( ( ~ ssList(X57)
| segmentP(nil,X57)
| nil != X57 )
& ( ~ ssList(X57)
| nil = X57
| ~ segmentP(nil,X57) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_34,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_35,negated_conjecture,
( nil = esk4_0
| neq(esk3_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( ~ segmentP(esk3_0,esk3_0)
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( ~ segmentP(esk4_0,esk4_0)
| ~ segmentP(esk3_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_34]),c_0_28])]) ).
cnf(c_0_40,negated_conjecture,
( ~ segmentP(esk4_0,esk3_0)
| ~ segmentP(esk3_0,esk3_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_35]),c_0_25])]) ).
cnf(c_0_41,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_25])]) ).
cnf(c_0_42,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_15])]) ).
fof(c_0_43,plain,
! [X56] :
( segmentP(X56,nil)
| ~ ssList(X56) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
cnf(c_0_44,negated_conjecture,
~ segmentP(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_37]),c_0_28])]) ).
cnf(c_0_45,negated_conjecture,
( ~ segmentP(esk4_0,nil)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_41]),c_0_42]),c_0_41])]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ segmentP(nil,esk4_0),
inference(rw,[status(thm)],[c_0_44,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_28])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC085+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n006.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 07:54:12 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.51 Running first-order theorem proving
% 0.27/0.51 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
% 1.08/0.69 % Version: 3.5.1
% 1.08/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.08/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.08/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.08/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.08/0.69 % Starting sh5l with 300s (1) cores
% 1.08/0.69 % new_bool_1 with pid 2360040 completed with status 0
% 1.08/0.69 % Result found by new_bool_1
% 1.08/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.08/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.08/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.08/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.08/0.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.08/0.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.08/0.69 % Search class: FGHSF-FFMM21-MFFFFFNN
% 1.08/0.69 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.08/0.69 % Starting SubtermCWHack with 31s (1) cores
% 1.08/0.69 % SubtermCWHack with pid 2360043 completed with status 0
% 1.08/0.69 % Result found by SubtermCWHack
% 1.08/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.08/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.08/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.08/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.08/0.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.08/0.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.08/0.69 % Search class: FGHSF-FFMM21-MFFFFFNN
% 1.08/0.69 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.08/0.69 % Starting SubtermCWHack with 31s (1) cores
% 1.08/0.69 % Preprocessing time : 0.002 s
% 1.08/0.69
% 1.08/0.69 % Proof found!
% 1.08/0.69 % SZS status Theorem
% 1.08/0.69 % SZS output start CNFRefutation
% See solution above
% 1.08/0.69 % Parsed axioms : 96
% 1.08/0.69 % Removed by relevancy pruning/SinE : 62
% 1.08/0.69 % Initial clauses : 63
% 1.08/0.69 % Removed in clause preprocessing : 0
% 1.08/0.69 % Initial clauses in saturation : 63
% 1.08/0.69 % Processed clauses : 1765
% 1.08/0.69 % ...of these trivial : 0
% 1.08/0.69 % ...subsumed : 1411
% 1.08/0.69 % ...remaining for further processing : 354
% 1.08/0.69 % Other redundant clauses eliminated : 161
% 1.08/0.69 % Clauses deleted for lack of memory : 0
% 1.08/0.69 % Backward-subsumed : 12
% 1.08/0.69 % Backward-rewritten : 53
% 1.08/0.69 % Generated clauses : 8801
% 1.08/0.69 % ...of the previous two non-redundant : 7734
% 1.08/0.69 % ...aggressively subsumed : 0
% 1.08/0.69 % Contextual simplify-reflections : 120
% 1.08/0.69 % Paramodulations : 8626
% 1.08/0.69 % Factorizations : 0
% 1.08/0.69 % NegExts : 0
% 1.08/0.69 % Equation resolutions : 176
% 1.08/0.69 % Disequality decompositions : 0
% 1.08/0.69 % Total rewrite steps : 5912
% 1.08/0.69 % ...of those cached : 5901
% 1.08/0.69 % Propositional unsat checks : 0
% 1.08/0.69 % Propositional check models : 0
% 1.08/0.69 % Propositional check unsatisfiable : 0
% 1.08/0.69 % Propositional clauses : 0
% 1.08/0.69 % Propositional clauses after purity: 0
% 1.08/0.69 % Propositional unsat core size : 0
% 1.08/0.69 % Propositional preprocessing time : 0.000
% 1.08/0.69 % Propositional encoding time : 0.000
% 1.08/0.69 % Propositional solver time : 0.000
% 1.08/0.69 % Success case prop preproc time : 0.000
% 1.08/0.69 % Success case prop encoding time : 0.000
% 1.08/0.69 % Success case prop solver time : 0.000
% 1.08/0.69 % Current number of processed clauses : 281
% 1.08/0.69 % Positive orientable unit clauses : 10
% 1.08/0.69 % Positive unorientable unit clauses: 0
% 1.08/0.69 % Negative unit clauses : 1
% 1.08/0.69 % Non-unit-clauses : 270
% 1.08/0.69 % Current number of unprocessed clauses: 6015
% 1.08/0.69 % ...number of literals in the above : 35631
% 1.08/0.69 % Current number of archived formulas : 0
% 1.08/0.69 % Current number of archived clauses : 65
% 1.08/0.69 % Clause-clause subsumption calls (NU) : 31921
% 1.08/0.69 % Rec. Clause-clause subsumption calls : 19166
% 1.08/0.69 % Non-unit clause-clause subsumptions : 1541
% 1.08/0.69 % Unit Clause-clause subsumption calls : 84
% 1.08/0.69 % Rewrite failures with RHS unbound : 0
% 1.08/0.69 % BW rewrite match attempts : 5
% 1.08/0.69 % BW rewrite match successes : 5
% 1.08/0.69 % Condensation attempts : 0
% 1.08/0.69 % Condensation successes : 0
% 1.08/0.69 % Termbank termtop insertions : 156288
% 1.08/0.69 % Search garbage collected termcells : 1779
% 1.08/0.69
% 1.08/0.69 % -------------------------------------------------
% 1.08/0.69 % User time : 0.150 s
% 1.08/0.69 % System time : 0.006 s
% 1.08/0.69 % Total time : 0.156 s
% 1.08/0.69 % Maximum resident set size: 3716 pages
% 1.08/0.69
% 1.08/0.69 % -------------------------------------------------
% 1.08/0.69 % User time : 0.157 s
% 1.08/0.69 % System time : 0.012 s
% 1.08/0.69 % Total time : 0.169 s
% 1.08/0.69 % Maximum resident set size: 4864 pages
% 1.08/0.69 % E exiting
%------------------------------------------------------------------------------