%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC120-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 : n019.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:05 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.55s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 18
% Syntax : Number of clauses : 69 ( 16 unt; 20 nHn; 69 RR)
% Number of literals : 200 ( 56 equ; 122 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_20,negated_conjecture,
neq(sk2,nil),
c_0_18 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| app(sk3,X2) != X1
| tl(sk4) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| sk4 = X1 ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_26,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_22 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_23 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(app(sk1,tl(sk4)))
| ~ neq(nil,sk4)
| app(sk1,tl(sk4)) = sk4 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])])])]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_34,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_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| app(sk1,tl(sk4)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_37,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(tl(sk4))
| ~ segmentP(sk1,X1)
| ~ neq(nil,sk4)
| segmentP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33])]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_36 ).
cnf(c_0_40,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_42,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
c_0_37 ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk1,X1)
| ~ neq(nil,sk4)
| segmentP(sk4,X1)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ neq(sk1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_21]),c_0_26])]) ).
cnf(c_0_46,negated_conjecture,
( ~ neq(nil,sk4)
| segmentP(sk4,sk1)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_33])]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_48,negated_conjecture,
( ~ neq(nil,sk4)
| ~ neq(sk1,nil)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_47 ).
cnf(c_0_50,negated_conjecture,
( ~ neq(nil,sk4)
| sk4 = nil
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_33]),c_0_30])]) ).
cnf(c_0_51,negated_conjecture,
( sk1 = nil
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_49]),c_0_30]),c_0_40])]) ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| sk4 = nil
| app(nil,tl(sk4)) = sk4 ),
inference(spm,[status(thm)],[c_0_35,c_0_51]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_52 ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_53 ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_54 ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ neq(nil,sk4)
| sk4 = nil
| tl(sk4) = sk4 ),
inference(spm,[status(thm)],[c_0_29,c_0_55]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| tl(X1) != X1
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_39]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( ~ neq(nil,sk4)
| sk4 = nil
| tl(sk4) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_39]),c_0_40])]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_63,negated_conjecture,
( ~ neq(nil,sk4)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_40])]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_62 ).
cnf(c_0_65,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_49]),c_0_30]),c_0_40])]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_67,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_26,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC120-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.12/0.38 % Computer : n019.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 07:57:20 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.18/0.55 % Version: 3.5.1
% 0.18/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.55 % Starting sh5l with 300s (1) cores
% 0.18/0.55 % sh5l with pid 2082544 completed with status 0
% 0.18/0.55 % Result found by sh5l
% 0.18/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.55 % Starting sh5l with 300s (1) cores
% 0.18/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.18/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.55 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.55 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.55 % Starting SubtermCWHack with 28s (1) cores
% 0.18/0.55 % SubtermCWHack with pid 2082552 completed with status 0
% 0.18/0.55 % Result found by SubtermCWHack
% 0.18/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.55 % Starting sh5l with 300s (1) cores
% 0.18/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.18/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.55 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.55 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.55 % Starting SubtermCWHack with 28s (1) cores
% 0.18/0.55 % Preprocessing time : 0.003 s
% 0.18/0.55
% 0.18/0.55 % Proof found!
% 0.18/0.55 % SZS status Unsatisfiable
% 0.18/0.55 % SZS output start CNFRefutation
% See solution above
% 0.18/0.55 % Parsed axioms : 197
% 0.18/0.55 % Removed by relevancy pruning/SinE : 33
% 0.18/0.55 % Initial clauses : 164
% 0.18/0.55 % Removed in clause preprocessing : 0
% 0.18/0.55 % Initial clauses in saturation : 164
% 0.18/0.55 % Processed clauses : 1022
% 0.18/0.55 % ...of these trivial : 7
% 0.18/0.55 % ...subsumed : 579
% 0.18/0.55 % ...remaining for further processing : 436
% 0.18/0.55 % Other redundant clauses eliminated : 75
% 0.18/0.55 % Clauses deleted for lack of memory : 0
% 0.18/0.55 % Backward-subsumed : 55
% 0.18/0.55 % Backward-rewritten : 74
% 0.18/0.55 % Generated clauses : 3243
% 0.18/0.55 % ...of the previous two non-redundant : 2855
% 0.18/0.55 % ...aggressively subsumed : 0
% 0.18/0.55 % Contextual simplify-reflections : 78
% 0.18/0.55 % Paramodulations : 3164
% 0.18/0.55 % Factorizations : 0
% 0.18/0.55 % NegExts : 0
% 0.18/0.55 % Equation resolutions : 81
% 0.18/0.55 % Disequality decompositions : 0
% 0.18/0.55 % Total rewrite steps : 2224
% 0.18/0.55 % ...of those cached : 2157
% 0.18/0.55 % Propositional unsat checks : 0
% 0.18/0.55 % Propositional check models : 0
% 0.18/0.55 % Propositional check unsatisfiable : 0
% 0.18/0.55 % Propositional clauses : 0
% 0.18/0.55 % Propositional clauses after purity: 0
% 0.18/0.55 % Propositional unsat core size : 0
% 0.18/0.55 % Propositional preprocessing time : 0.000
% 0.18/0.55 % Propositional encoding time : 0.000
% 0.18/0.55 % Propositional solver time : 0.000
% 0.18/0.55 % Success case prop preproc time : 0.000
% 0.18/0.55 % Success case prop encoding time : 0.000
% 0.18/0.55 % Success case prop solver time : 0.000
% 0.18/0.55 % Current number of processed clauses : 286
% 0.18/0.55 % Positive orientable unit clauses : 43
% 0.18/0.55 % Positive unorientable unit clauses: 0
% 0.18/0.55 % Negative unit clauses : 0
% 0.18/0.55 % Non-unit-clauses : 243
% 0.18/0.55 % Current number of unprocessed clauses: 1883
% 0.18/0.55 % ...number of literals in the above : 11122
% 0.18/0.55 % Current number of archived formulas : 0
% 0.18/0.55 % Current number of archived clauses : 129
% 0.18/0.55 % Clause-clause subsumption calls (NU) : 25397
% 0.18/0.55 % Rec. Clause-clause subsumption calls : 7769
% 0.18/0.55 % Non-unit clause-clause subsumptions : 712
% 0.18/0.55 % Unit Clause-clause subsumption calls : 130
% 0.18/0.55 % Rewrite failures with RHS unbound : 0
% 0.18/0.55 % BW rewrite match attempts : 3
% 0.18/0.55 % BW rewrite match successes : 3
% 0.18/0.55 % Condensation attempts : 0
% 0.18/0.55 % Condensation successes : 0
% 0.18/0.55 % Termbank termtop insertions : 62315
% 0.18/0.55 % Search garbage collected termcells : 640
% 0.18/0.55
% 0.18/0.55 % -------------------------------------------------
% 0.18/0.55 % User time : 0.095 s
% 0.18/0.55 % System time : 0.006 s
% 0.18/0.55 % Total time : 0.101 s
% 0.18/0.55 % Maximum resident set size: 4068 pages
% 0.18/0.55
% 0.18/0.55 % -------------------------------------------------
% 0.18/0.55 % User time : 0.098 s
% 0.18/0.55 % System time : 0.012 s
% 0.18/0.55 % Total time : 0.110 s
% 0.18/0.55 % Maximum resident set size: 5120 pages
% 0.18/0.55 % E exiting
%------------------------------------------------------------------------------