%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC303-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 : n011.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:51 PM UTC 2026
% Result : Unsatisfiable 0.53s 0.50s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of clauses : 63 ( 29 unt; 0 nHn; 63 RR)
% Number of literals : 171 ( 25 equ; 113 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_16,negated_conjecture,
app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_6,negated_conjecture,
sk3 = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_14,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause182,axiom,
( ~ ssList(X6)
| ~ totalorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| leq(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause182) ).
cnf(co1_15,negated_conjecture,
ssList(sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_12,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_9,negated_conjecture,
totalorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause103,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(clause130,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| X2 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause130) ).
cnf(co1_17,negated_conjecture,
lt(sk7,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause114,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause114) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_19,negated_conjecture,
app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk1,
co1_16 ).
cnf(c_0_20,negated_conjecture,
sk3 = sk1,
co1_6 ).
cnf(c_0_21,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_22,negated_conjecture,
app(app(app(app(sk8,cons(sk6,nil)),sk9),cons(sk7,nil)),sk10) = sk3,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_21 ).
cnf(c_0_24,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_25,negated_conjecture,
ssList(sk9),
co1_14 ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(app(sk8,app(cons(sk6,nil),sk9)),cons(sk7,nil)),sk10) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_30,plain,
( ~ ssList(X6)
| ~ totalorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| leq(X2,X4) ),
inference(fof_simplification,[status(thm)],[clause182]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(app(sk8,cons(sk6,sk9)),cons(sk7,nil)),sk10) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_25])]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk10),
co1_15 ).
cnf(c_0_33,plain,
( ~ ssList(X6)
| ~ totalorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| leq(X2,X4) ),
c_0_30 ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| ~ ssList(app(sk8,cons(sk6,sk9)))
| app(app(sk8,cons(sk6,sk9)),app(cons(sk7,nil),sk10)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
ssItem(sk7),
co1_12 ).
cnf(c_0_36,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_37,plain,
( ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| leq(X1,X2) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| ~ ssList(app(sk8,cons(sk6,sk9)))
| app(app(sk8,cons(sk6,sk9)),cons(sk7,sk10)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_35]),c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_36,c_0_20]) ).
cnf(c_0_40,negated_conjecture,
totalorderedP(sk3),
co1_9 ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_42,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_43,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[clause130]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| ~ ssList(app(sk8,cons(sk6,sk9)))
| leq(sk6,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35]),c_0_29]),c_0_39]),c_0_32]),c_0_25]),c_0_24]),c_0_40])]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_41 ).
cnf(c_0_46,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
c_0_42 ).
cnf(c_0_47,negated_conjecture,
lt(sk7,sk6),
co1_17 ).
cnf(c_0_48,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ leq(X2,X1)
| ~ leq(X1,X2)
| X2 = X1 ),
c_0_43 ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(cons(sk6,sk9))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| leq(sk6,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_24])]) ).
cnf(c_0_50,negated_conjecture,
leq(sk7,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_29]),c_0_35])]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(cons(sk6,sk9))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| sk7 = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_29]),c_0_35])]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_51 ).
cnf(c_0_54,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause114]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk7,nil))
| sk7 = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_29]),c_0_25])]) ).
cnf(c_0_56,axiom,
ssList(nil),
clause8 ).
cnf(c_0_57,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
c_0_54 ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| sk7 = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_53]),c_0_35]),c_0_56])]) ).
cnf(c_0_59,negated_conjecture,
~ lt(sk6,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_47]),c_0_35]),c_0_29])]) ).
cnf(c_0_60,negated_conjecture,
sk7 = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_53]),c_0_29]),c_0_56])]) ).
cnf(c_0_61,negated_conjecture,
~ lt(sk6,sk6),
inference(rw,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_60]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC303-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n011.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 08:13:56 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.53/0.50 % Version: 3.5.1
% 0.53/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.53/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.53/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.53/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.53/0.50 % Starting sh5l with 300s (1) cores
% 0.53/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1431693 completed with status 0
% 0.53/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.53/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.53/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.53/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.50 % No SInE strategy applied
% 0.53/0.50 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.53/0.50 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.53/0.50 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.53/0.50 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.53/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.53/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1431700 completed with status 0
% 0.53/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.53/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.53/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.53/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.50 % No SInE strategy applied
% 0.53/0.50 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.53/0.50 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.53/0.50 % Preprocessing time : 0.004 s
% 0.53/0.50 % Presaturation interreduction done
% 0.53/0.50
% 0.53/0.50 % Proof found!
% 0.53/0.50 % SZS status Unsatisfiable
% 0.53/0.50 % SZS output start CNFRefutation
% See solution above
% 0.53/0.50 % Parsed axioms : 203
% 0.53/0.50 % Removed by relevancy pruning/SinE : 0
% 0.53/0.50 % Initial clauses : 203
% 0.53/0.50 % Removed in clause preprocessing : 0
% 0.53/0.50 % Initial clauses in saturation : 203
% 0.53/0.50 % Processed clauses : 550
% 0.53/0.50 % ...of these trivial : 7
% 0.53/0.50 % ...subsumed : 41
% 0.53/0.50 % ...remaining for further processing : 501
% 0.53/0.50 % Other redundant clauses eliminated : 72
% 0.53/0.50 % Clauses deleted for lack of memory : 0
% 0.53/0.50 % Backward-subsumed : 18
% 0.53/0.50 % Backward-rewritten : 8
% 0.53/0.50 % Generated clauses : 1317
% 0.53/0.50 % ...of the previous two non-redundant : 1142
% 0.53/0.50 % ...aggressively subsumed : 0
% 0.53/0.50 % Contextual simplify-reflections : 2
% 0.53/0.50 % Paramodulations : 1241
% 0.53/0.50 % Factorizations : 0
% 0.53/0.50 % NegExts : 0
% 0.53/0.50 % Equation resolutions : 77
% 0.53/0.50 % Disequality decompositions : 0
% 0.53/0.50 % Total rewrite steps : 1290
% 0.53/0.50 % ...of those cached : 1170
% 0.53/0.50 % Propositional unsat checks : 0
% 0.53/0.50 % Propositional check models : 0
% 0.53/0.50 % Propositional check unsatisfiable : 0
% 0.53/0.50 % Propositional clauses : 0
% 0.53/0.50 % Propositional clauses after purity: 0
% 0.53/0.50 % Propositional unsat core size : 0
% 0.53/0.50 % Propositional preprocessing time : 0.000
% 0.53/0.50 % Propositional encoding time : 0.000
% 0.53/0.50 % Propositional solver time : 0.000
% 0.53/0.50 % Success case prop preproc time : 0.000
% 0.53/0.50 % Success case prop encoding time : 0.000
% 0.53/0.50 % Success case prop solver time : 0.000
% 0.53/0.50 % Current number of processed clauses : 257
% 0.53/0.50 % Positive orientable unit clauses : 75
% 0.53/0.50 % Positive unorientable unit clauses: 0
% 0.53/0.50 % Negative unit clauses : 4
% 0.53/0.50 % Non-unit-clauses : 178
% 0.53/0.50 % Current number of unprocessed clauses: 977
% 0.53/0.50 % ...number of literals in the above : 5757
% 0.53/0.50 % Current number of archived formulas : 0
% 0.53/0.50 % Current number of archived clauses : 221
% 0.53/0.50 % Clause-clause subsumption calls (NU) : 17738
% 0.53/0.50 % Rec. Clause-clause subsumption calls : 4829
% 0.53/0.50 % Non-unit clause-clause subsumptions : 43
% 0.53/0.50 % Unit Clause-clause subsumption calls : 95
% 0.53/0.50 % Rewrite failures with RHS unbound : 0
% 0.53/0.50 % BW rewrite match attempts : 1
% 0.53/0.50 % BW rewrite match successes : 1
% 0.53/0.50 % Condensation attempts : 0
% 0.53/0.50 % Condensation successes : 0
% 0.53/0.50 % Termbank termtop insertions : 36744
% 0.53/0.50 % Search garbage collected termcells : 542
% 0.53/0.50
% 0.53/0.50 % -------------------------------------------------
% 0.53/0.50 % User time : 0.061 s
% 0.53/0.50 % System time : 0.006 s
% 0.53/0.50 % Total time : 0.068 s
% 0.53/0.50 % Maximum resident set size: 4040 pages
% 0.53/0.50
% 0.53/0.50 % -------------------------------------------------
% 0.53/0.50 % User time : 0.282 s
% 0.53/0.50 % System time : 0.025 s
% 0.53/0.50 % Total time : 0.308 s
% 0.53/0.50 % Maximum resident set size: 4864 pages
% 0.53/0.50 % E exiting
%------------------------------------------------------------------------------