%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN156-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 03:32:39 PM UTC 2026
% Result : Unsatisfiable 0.36s 0.49s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 25
% Syntax : Number of clauses : 93 ( 32 unt; 0 nHn; 81 RR)
% Number of literals : 186 ( 0 equ; 96 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 137 ( 43 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_159,axiom,
( ~ k1(X1)
| p2(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_159) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_236) ).
cnf(rule_274,axiom,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_274) ).
cnf(rule_240,axiom,
( ~ p2(X2,X3,X1)
| n3(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).
cnf(rule_284,axiom,
( ~ m3(X1,X1,X1)
| ~ k4(X2)
| n4(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_284) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(rule_255,axiom,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_255) ).
cnf(rule_186,axiom,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_186) ).
cnf(rule_003,axiom,
( ~ m0(X2,X1,X3)
| ~ r0(X4)
| ~ p0(X3,X1)
| l1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_003) ).
cnf(rule_092,axiom,
( ~ p0(X4,X1)
| ~ n0(X3,X2)
| q1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_092) ).
cnf(axiom_27,axiom,
m0(e,b,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_27) ).
cnf(axiom_18,axiom,
p0(c,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).
cnf(rule_141,axiom,
( ~ q1(X1,a,X1)
| p2(X1,a,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_141) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(rule_281,axiom,
( ~ n4(X1,X1)
| ~ p3(X1,X2,X2)
| n4(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_281) ).
cnf(rule_251,axiom,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_251) ).
cnf(rule_155,axiom,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_155) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(prove_this,negated_conjecture,
~ n4(a,e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_25,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_26,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_27,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_28,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_25 ).
cnf(c_0_29,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_30,plain,
( ~ k1(X1)
| p2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_159]) ).
cnf(c_0_31,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_26 ).
cnf(c_0_32,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_33,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_34,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_27 ).
cnf(c_0_35,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
inference(fof_simplification,[status(thm)],[rule_274]) ).
cnf(c_0_37,plain,
( ~ p2(X2,X3,X1)
| n3(X1) ),
inference(fof_simplification,[status(thm)],[rule_240]) ).
cnf(c_0_38,plain,
( ~ k1(X1)
| p2(X1,X1,X1) ),
c_0_30 ).
cnf(c_0_39,plain,
k1(e),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
( ~ m3(X1,X1,X1)
| ~ k4(X2)
| n4(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_284]) ).
cnf(c_0_41,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_33 ).
cnf(c_0_42,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
c_0_36 ).
cnf(c_0_44,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_45,plain,
( ~ p2(X2,X3,X1)
| n3(X1) ),
c_0_37 ).
cnf(c_0_46,plain,
p2(e,e,e),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_255]) ).
cnf(c_0_48,plain,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_186]) ).
cnf(c_0_49,plain,
( ~ m3(X1,X1,X1)
| ~ k4(X2)
| n4(X1,X1) ),
c_0_40 ).
cnf(c_0_50,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_51,plain,
( ~ n3(e)
| ~ q3(e,b)
| k4(c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_52,plain,
n3(e),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
c_0_47 ).
cnf(c_0_54,plain,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
c_0_48 ).
cnf(c_0_55,plain,
( ~ m0(X2,X1,X3)
| ~ r0(X4)
| ~ p0(X3,X1)
| l1(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_003]) ).
cnf(c_0_56,plain,
( ~ p0(X4,X1)
| ~ n0(X3,X2)
| q1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_092]) ).
cnf(c_0_57,plain,
( ~ k4(X2)
| n4(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_58,plain,
( ~ q3(e,b)
| k4(c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_59,plain,
( ~ n0(X1,X1)
| ~ l1(X2,X1)
| q3(X1,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
( ~ m0(X2,X1,X3)
| ~ r0(X4)
| ~ p0(X3,X1)
| l1(X1,X2) ),
c_0_55 ).
cnf(c_0_61,axiom,
m0(e,b,c),
axiom_27 ).
cnf(c_0_62,axiom,
p0(c,b),
axiom_18 ).
cnf(c_0_63,plain,
( ~ p0(X4,X1)
| ~ n0(X3,X2)
| q1(X1,X2,X1) ),
c_0_56 ).
cnf(c_0_64,plain,
( ~ q3(e,b)
| n4(X1,X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,plain,
( ~ l1(X1,e)
| q3(e,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_32]) ).
cnf(c_0_66,plain,
( ~ r0(X1)
| l1(b,e) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_67,axiom,
r0(b),
axiom_9 ).
cnf(c_0_68,plain,
( ~ q1(X1,a,X1)
| p2(X1,a,X1) ),
inference(fof_simplification,[status(thm)],[rule_141]) ).
cnf(c_0_69,plain,
( ~ n0(X3,X2)
| q1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_29]) ).
cnf(c_0_70,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_71,plain,
( ~ n4(X1,X1)
| ~ p3(X1,X2,X2)
| n4(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_281]) ).
cnf(c_0_72,plain,
( ~ l1(b,e)
| n4(X1,X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_73,plain,
l1(b,e),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_74,plain,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_251]) ).
cnf(c_0_75,plain,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_155]) ).
cnf(c_0_76,plain,
( ~ q1(X1,a,X1)
| p2(X1,a,X1) ),
c_0_68 ).
cnf(c_0_77,plain,
q1(X1,a,X1),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_78,plain,
( ~ n4(X1,X1)
| ~ p3(X1,X2,X2)
| n4(X1,X2) ),
c_0_71 ).
cnf(c_0_79,plain,
n4(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_80,plain,
( ~ p2(X1,X2,X4)
| ~ m3(X2,X3,X4)
| p3(X1,X2,X2) ),
c_0_74 ).
cnf(c_0_81,plain,
( ~ p2(e,X1,X2)
| ~ k1(X3)
| p2(X1,X2,X2) ),
c_0_75 ).
cnf(c_0_82,plain,
p2(X1,a,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]) ).
cnf(c_0_83,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_84,plain,
( ~ p3(X1,X2,X2)
| n4(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]) ).
cnf(c_0_85,plain,
( ~ p2(X1,X2,X2)
| p3(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_80,c_0_50]) ).
cnf(c_0_86,plain,
( ~ k1(X1)
| p2(a,e,e) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
k1(c),
inference(spm,[status(thm)],[c_0_31,c_0_83]) ).
cnf(c_0_88,negated_conjecture,
~ n4(a,e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_89,plain,
( ~ p2(X1,X2,X2)
| n4(X1,X2) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_90,plain,
p2(a,e,e),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_91,negated_conjecture,
~ n4(a,e),
c_0_88 ).
cnf(c_0_92,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN156-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:44:36 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/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.36/0.49 % Version: 3.5.1
% 0.36/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.36/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.36/0.49 % Starting sh5l with 300s (1) cores
% 0.36/0.49 % new_bool_3 with pid 577975 completed with status 0
% 0.36/0.49 % Result found by new_bool_3
% 0.36/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.36/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.36/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.36/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.36/0.49 % SubtermCWHack with pid 577983 completed with status 0
% 0.36/0.49 % Result found by SubtermCWHack
% 0.36/0.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.36/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.36/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.49 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.36/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.36/0.49 % Preprocessing time : 0.003 s
% 0.36/0.49
% 0.36/0.49 % Proof found!
% 0.36/0.49 % SZS status Unsatisfiable
% 0.36/0.49 % SZS output start CNFRefutation
% See solution above
% 0.36/0.49 % Parsed axioms : 369
% 0.36/0.49 % Removed by relevancy pruning/SinE : 26
% 0.36/0.49 % Initial clauses : 343
% 0.36/0.49 % Removed in clause preprocessing : 6
% 0.36/0.49 % Initial clauses in saturation : 337
% 0.36/0.49 % Processed clauses : 1105
% 0.36/0.49 % ...of these trivial : 135
% 0.36/0.49 % ...subsumed : 137
% 0.36/0.49 % ...remaining for further processing : 833
% 0.36/0.49 % Other redundant clauses eliminated : 0
% 0.36/0.49 % Clauses deleted for lack of memory : 0
% 0.36/0.49 % Backward-subsumed : 88
% 0.36/0.49 % Backward-rewritten : 256
% 0.36/0.49 % Generated clauses : 1357
% 0.36/0.49 % ...of the previous two non-redundant : 982
% 0.36/0.49 % ...aggressively subsumed : 0
% 0.36/0.49 % Contextual simplify-reflections : 1
% 0.36/0.49 % Paramodulations : 1357
% 0.36/0.49 % Factorizations : 0
% 0.36/0.49 % NegExts : 0
% 0.36/0.49 % Equation resolutions : 0
% 0.36/0.49 % Disequality decompositions : 0
% 0.36/0.49 % Total rewrite steps : 1122
% 0.36/0.49 % ...of those cached : 739
% 0.36/0.49 % Propositional unsat checks : 0
% 0.36/0.49 % Propositional check models : 0
% 0.36/0.49 % Propositional check unsatisfiable : 0
% 0.36/0.49 % Propositional clauses : 0
% 0.36/0.49 % Propositional clauses after purity: 0
% 0.36/0.49 % Propositional unsat core size : 0
% 0.36/0.49 % Propositional preprocessing time : 0.000
% 0.36/0.49 % Propositional encoding time : 0.000
% 0.36/0.49 % Propositional solver time : 0.000
% 0.36/0.49 % Success case prop preproc time : 0.000
% 0.36/0.49 % Success case prop encoding time : 0.000
% 0.36/0.49 % Success case prop solver time : 0.000
% 0.36/0.49 % Current number of processed clauses : 489
% 0.36/0.49 % Positive orientable unit clauses : 202
% 0.36/0.49 % Positive unorientable unit clauses: 0
% 0.36/0.49 % Negative unit clauses : 4
% 0.36/0.49 % Non-unit-clauses : 283
% 0.36/0.49 % Current number of unprocessed clauses: 93
% 0.36/0.49 % ...number of literals in the above : 378
% 0.36/0.49 % Current number of archived formulas : 0
% 0.36/0.49 % Current number of archived clauses : 344
% 0.36/0.49 % Clause-clause subsumption calls (NU) : 23321
% 0.36/0.49 % Rec. Clause-clause subsumption calls : 18405
% 0.36/0.49 % Non-unit clause-clause subsumptions : 193
% 0.36/0.49 % Unit Clause-clause subsumption calls : 1788
% 0.36/0.49 % Rewrite failures with RHS unbound : 0
% 0.36/0.49 % BW rewrite match attempts : 577
% 0.36/0.49 % BW rewrite match successes : 217
% 0.36/0.49 % Condensation attempts : 0
% 0.36/0.49 % Condensation successes : 0
% 0.36/0.49 % Termbank termtop insertions : 26474
% 0.36/0.49 % Search garbage collected termcells : 1499
% 0.36/0.49
% 0.36/0.49 % -------------------------------------------------
% 0.36/0.49 % User time : 0.037 s
% 0.36/0.49 % System time : 0.007 s
% 0.36/0.49 % Total time : 0.045 s
% 0.36/0.49 % Maximum resident set size: 4472 pages
% 0.36/0.49
% 0.36/0.49 % -------------------------------------------------
% 0.36/0.49 % User time : 0.043 s
% 0.36/0.49 % System time : 0.012 s
% 0.36/0.49 % Total time : 0.056 s
% 0.36/0.49 % Maximum resident set size: 5120 pages
% 0.36/0.49 % E exiting
%------------------------------------------------------------------------------