%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL299-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 01:12:22 PM UTC 2026
% Result : Unsatisfiable 26.94s 4.60s
% Output : CNFRefutation 26.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of clauses : 73 ( 37 unt; 0 nHn; 36 RR)
% Number of literals : 123 ( 7 equ; 59 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 140 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(not(implies(not(p),q)),and(not(p),not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_11,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_18,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_21,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_22,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_24,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_25,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_26,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_27,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_28,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_29,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_30,plain,
( ~ axiom(or(X1,or(not(X3),X2)))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_31,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_32,plain,
( ~ axiom(or(X1,or(or(X1,X2),X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_33,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_34,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
~ theorem(equivalent(not(implies(not(p),q)),and(not(p),not(q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_36,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_37,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_38,plain,
( ~ theorem(X2)
| theorem(or(not(or(X1,not(X2))),X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_40,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
( ~ axiom(or(X2,or(not(X4),X3)))
| ~ theorem(or(X1,X4))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_34,c_0_25]) ).
cnf(c_0_42,negated_conjecture,
~ theorem(equivalent(not(implies(not(p),q)),and(not(p),not(q)))),
c_0_35 ).
cnf(c_0_43,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_13]),c_0_13]),c_0_37]) ).
cnf(c_0_44,plain,
( ~ theorem(X2)
| ~ theorem(or(X1,not(X2)))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_38]) ).
cnf(c_0_45,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_41,c_0_33]) ).
cnf(c_0_47,negated_conjecture,
~ theorem(not(or(not(or(not(not(or(not(not(p)),q))),not(or(not(not(p)),not(not(q)))))),not(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(not(p)),q))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_13]),c_0_37]),c_0_43]) ).
cnf(c_0_48,plain,
( ~ theorem(X2)
| ~ theorem(X1)
| theorem(not(or(not(X1),not(X2)))) ),
inference(spm,[status(thm)],[c_0_44,c_0_38]) ).
cnf(c_0_49,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_34,c_0_45]) ).
cnf(c_0_50,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_51,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( ~ theorem(or(not(not(or(not(not(p)),not(not(q))))),not(or(not(not(p)),q))))
| ~ theorem(or(not(not(or(not(not(p)),q))),not(or(not(not(p)),not(not(q)))))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( ~ theorem(or(X2,X1))
| theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_49]) ).
cnf(c_0_54,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_55,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X1,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_56,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_50,c_0_31]) ).
cnf(c_0_57,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_22,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
( ~ theorem(or(not(or(not(not(p)),q)),or(not(not(p)),not(not(q)))))
| ~ theorem(or(not(not(or(not(not(p)),q))),not(or(not(not(p)),not(not(q)))))) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_54]) ).
cnf(c_0_60,plain,
( ~ theorem(or(X1,X2))
| ~ theorem(or(not(X3),X4))
| theorem(or(X1,or(not(or(not(X2),X3)),X4))) ),
inference(spm,[status(thm)],[c_0_34,c_0_55]) ).
cnf(c_0_61,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( ~ theorem(or(not(or(not(not(p)),not(not(q)))),or(not(not(p)),q)))
| ~ theorem(or(not(or(not(not(p)),q)),or(not(not(p)),not(not(q))))) ),
inference(spm,[status(thm)],[c_0_58,c_0_53]) ).
cnf(c_0_63,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_59]) ).
cnf(c_0_64,plain,
( ~ theorem(or(X4,X1))
| ~ theorem(or(not(X2),X3))
| theorem(or(or(not(or(not(X1),X2)),X3),X4)) ),
inference(spm,[status(thm)],[c_0_39,c_0_60]) ).
cnf(c_0_65,plain,
theorem(or(X1,or(X2,not(X2)))),
inference(spm,[status(thm)],[c_0_56,c_0_51]) ).
cnf(c_0_66,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_22,c_0_61]) ).
cnf(c_0_67,negated_conjecture,
( ~ theorem(or(not(not(not(q))),q))
| ~ theorem(or(not(or(not(not(p)),q)),or(not(not(p)),not(not(q))))) ),
inference(spm,[status(thm)],[c_0_62,c_0_29]) ).
cnf(c_0_68,plain,
( ~ theorem(or(X3,X1))
| ~ theorem(or(not(X2),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,plain,
theorem(or(X1,or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_22,c_0_65]) ).
cnf(c_0_70,plain,
theorem(or(or(not(X1),X2),X1)),
inference(spm,[status(thm)],[c_0_39,c_0_66]) ).
cnf(c_0_71,negated_conjecture,
~ theorem(or(not(not(not(q))),q)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70])]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_53]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL299-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n008.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 00:19:53 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.55 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
% 26.94/4.60 % Version: 3.5.1
% 26.94/4.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 26.94/4.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.94/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 26.94/4.60 % Starting new_bool_3 with 300s (1) cores
% 26.94/4.60 % Starting new_bool_1 with 300s (1) cores
% 26.94/4.60 % Starting sh5l with 300s (1) cores
% 26.94/4.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3951452 completed with status 0
% 26.94/4.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 26.94/4.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 26.94/4.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.94/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 26.94/4.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.94/4.60 % No SInE strategy applied
% 26.94/4.60 % Search class: FHUNM-FFSF21-DFFFFFNN
% 26.94/4.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.94/4.60 % Starting SubtermCWHack with 136s (1) cores
% 26.94/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 26.94/4.60 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 300s (1) cores
% 26.94/4.60 % Starting new_bool_3 with 296s (1) cores
% 26.94/4.60 % Starting new_bool_1 with 291s (1) cores
% 26.94/4.60 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 3951459 completed with status 0
% 26.94/4.60 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 26.94/4.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 26.94/4.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.94/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 26.94/4.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 26.94/4.60 % No SInE strategy applied
% 26.94/4.60 % Search class: FHUNM-FFSF21-DFFFFFNN
% 26.94/4.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 26.94/4.60 % Starting SubtermCWHack with 136s (1) cores
% 26.94/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 26.94/4.60 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 300s (1) cores
% 26.94/4.60 % Preprocessing time : 0.087 s
% 26.94/4.60
% 26.94/4.60 % Proof found!
% 26.94/4.60 % SZS status Unsatisfiable
% 26.94/4.60 % SZS output start CNFRefutation
% See solution above
% 26.94/4.60 % Parsed axioms : 11
% 26.94/4.60 % Removed by relevancy pruning/SinE : 0
% 26.94/4.60 % Initial clauses : 11
% 26.94/4.60 % Removed in clause preprocessing : 3
% 26.94/4.60 % Initial clauses in saturation : 8
% 26.94/4.60 % Processed clauses : 5612
% 26.94/4.60 % ...of these trivial : 13
% 26.94/4.60 % ...subsumed : 3568
% 26.94/4.60 % ...remaining for further processing : 2031
% 26.94/4.60 % Other redundant clauses eliminated : 0
% 26.94/4.60 % Clauses deleted for lack of memory : 0
% 26.94/4.60 % Backward-subsumed : 809
% 26.94/4.60 % Backward-rewritten : 3
% 26.94/4.60 % Generated clauses : 80013
% 26.94/4.60 % ...of the previous two non-redundant : 79430
% 26.94/4.60 % ...aggressively subsumed : 0
% 26.94/4.60 % Contextual simplify-reflections : 16
% 26.94/4.60 % Paramodulations : 80013
% 26.94/4.60 % Factorizations : 0
% 26.94/4.60 % NegExts : 0
% 26.94/4.60 % Equation resolutions : 0
% 26.94/4.60 % Disequality decompositions : 0
% 26.94/4.60 % Total rewrite steps : 650
% 26.94/4.60 % ...of those cached : 536
% 26.94/4.60 % Propositional unsat checks : 0
% 26.94/4.60 % Propositional check models : 0
% 26.94/4.60 % Propositional check unsatisfiable : 0
% 26.94/4.60 % Propositional clauses : 0
% 26.94/4.60 % Propositional clauses after purity: 0
% 26.94/4.60 % Propositional unsat core size : 0
% 26.94/4.60 % Propositional preprocessing time : 0.000
% 26.94/4.60 % Propositional encoding time : 0.000
% 26.94/4.60 % Propositional solver time : 0.000
% 26.94/4.60 % Success case prop preproc time : 0.000
% 26.94/4.60 % Success case prop encoding time : 0.000
% 26.94/4.60 % Success case prop solver time : 0.000
% 26.94/4.60 % Current number of processed clauses : 1219
% 26.94/4.60 % Positive orientable unit clauses : 33
% 26.94/4.60 % Positive unorientable unit clauses: 0
% 26.94/4.60 % Negative unit clauses : 62
% 26.94/4.60 % Non-unit-clauses : 1124
% 26.94/4.60 % Current number of unprocessed clauses: 72934
% 26.94/4.60 % ...number of literals in the above : 281487
% 26.94/4.60 % Current number of archived formulas : 0
% 26.94/4.60 % Current number of archived clauses : 815
% 26.94/4.60 % Clause-clause subsumption calls (NU) : 425231
% 26.94/4.60 % Rec. Clause-clause subsumption calls : 295807
% 26.94/4.60 % Non-unit clause-clause subsumptions : 2704
% 26.94/4.60 % Unit Clause-clause subsumption calls : 9036
% 26.94/4.60 % Rewrite failures with RHS unbound : 0
% 26.94/4.60 % BW rewrite match attempts : 1800
% 26.94/4.60 % BW rewrite match successes : 3
% 26.94/4.60 % Condensation attempts : 0
% 26.94/4.60 % Condensation successes : 0
% 26.94/4.60 % Termbank termtop insertions : 1640516
% 26.94/4.60 % Search garbage collected termcells : 11
% 26.94/4.60
% 26.94/4.60 % -------------------------------------------------
% 26.94/4.60 % User time : 3.714 s
% 26.94/4.60 % System time : 0.109 s
% 26.94/4.60 % Total time : 3.824 s
% 26.94/4.60 % Maximum resident set size: 3388 pages
% 26.94/4.60
% 26.94/4.60 % -------------------------------------------------
% 26.94/4.60 % User time : 18.651 s
% 26.94/4.60 % System time : 0.736 s
% 26.94/4.60 % Total time : 19.387 s
% 26.94/4.60 % Maximum resident set size: 4608 pages
% 26.94/4.60 % E exiting
%------------------------------------------------------------------------------