%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE100+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 12:58:51 PM UTC 2026
% Result : Theorem 3.46s 6.09s
% Output : CNFRefutation 3.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 68 ( 64 unt; 0 def)
% Number of atoms : 72 ( 71 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 0 |; 1 &)
% ( 0 <=>; 1 =>; 2 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 97 ( 3 sgn 53 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( addition(forward_diamond(X4,domain(X5)),domain(X6)) = domain(X6)
<= multiplication(antidomain(X6),multiplication(X4,domain(X5))) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(forward_diamond,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+6.ax',forward_diamond) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(domain2,axiom,
! [X4,X5] : addition(antidomain(multiplication(X4,X5)),antidomain(multiplication(X4,antidomain(antidomain(X5))))) = antidomain(multiplication(X4,antidomain(antidomain(X5)))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain2) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(c_0_14,negated_conjecture,
~ ! [X4,X5,X6] :
( addition(forward_diamond(X4,domain(X5)),domain(X6)) = domain(X6)
<= multiplication(antidomain(X6),multiplication(X4,domain(X5))) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,negated_conjecture,
~ ! [X4,X5,X6] :
( multiplication(antidomain(X6),multiplication(X4,domain(X5))) = zero
=> addition(forward_diamond(X4,domain(X5)),domain(X6)) = domain(X6) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_16,plain,
! [X40] : addition(antidomain(antidomain(X40)),antidomain(X40)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_17,plain,
! [X27,X28] : addition(X27,X28) = addition(X28,X27),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_18,plain,
! [X38] : multiplication(X38,one) = X38,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_19,plain,
! [X13] : multiplication(antidomain(X13),X13) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_20,plain,
! [X10] : addition(X10,zero) = X10,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_21,plain,
! [X29,X30,X31] : addition(X31,addition(X30,X29)) = addition(addition(X31,X30),X29),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_22,plain,
! [X32] : addition(X32,X32) = X32,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_23,negated_conjecture,
( addition(forward_diamond(esk1_0,domain(esk2_0)),domain(esk3_0)) != domain(esk3_0)
& multiplication(antidomain(esk3_0),multiplication(esk1_0,domain(esk2_0))) = zero ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_24,plain,
! [X24] : domain(X24) = antidomain(antidomain(X24)),
inference(variable_rename,[status(thm)],[domain4]) ).
cnf(c_0_25,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_30,plain,
! [X33,X34] : forward_diamond(X33,X34) = domain(multiplication(X33,domain(X34))),
inference(variable_rename,[status(thm)],[forward_diamond]) ).
cnf(c_0_31,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_33,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_34,plain,
! [X25,X26] : addition(antidomain(multiplication(X25,X26)),antidomain(multiplication(X25,antidomain(antidomain(X26))))) = antidomain(multiplication(X25,antidomain(antidomain(X26)))),
inference(variable_rename,[status(thm)],[domain2]) ).
cnf(c_0_35,negated_conjecture,
multiplication(antidomain(esk3_0),multiplication(esk1_0,domain(esk2_0))) = zero,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_36,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_38,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_39,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_40,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_42,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_43,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_44,plain,
! [X39] : multiplication(one,X39) = X39,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_45,plain,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_46,negated_conjecture,
multiplication(antidomain(esk3_0),multiplication(esk1_0,antidomain(antidomain(esk2_0)))) = zero,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_47,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_48,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))) = forward_diamond(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_36]),c_0_36]) ).
cnf(c_0_49,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_37]),c_0_26]) ).
cnf(c_0_50,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_28]),c_0_39]) ).
cnf(c_0_52,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,negated_conjecture,
antidomain(multiplication(antidomain(esk3_0),forward_diamond(esk1_0,esk2_0))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_49]),c_0_48]) ).
cnf(c_0_54,plain,
multiplication(antidomain(X1),addition(X2,X1)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_28]),c_0_29]) ).
cnf(c_0_55,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_37]),c_0_52]) ).
cnf(c_0_56,negated_conjecture,
multiplication(antidomain(esk3_0),forward_diamond(esk1_0,esk2_0)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_53]),c_0_52]) ).
cnf(c_0_57,negated_conjecture,
addition(forward_diamond(esk1_0,domain(esk2_0)),domain(esk3_0)) != domain(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_58,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_37]),c_0_27]),c_0_55]) ).
cnf(c_0_59,negated_conjecture,
multiplication(addition(antidomain(esk3_0),X1),forward_diamond(esk1_0,esk2_0)) = multiplication(X1,forward_diamond(esk1_0,esk2_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_56]),c_0_39]) ).
cnf(c_0_60,plain,
addition(forward_diamond(X1,X2),antidomain(forward_diamond(X1,X2))) = one,
inference(spm,[status(thm)],[c_0_37,c_0_48]) ).
cnf(c_0_61,negated_conjecture,
addition(antidomain(antidomain(esk3_0)),forward_diamond(esk1_0,antidomain(antidomain(esk2_0)))) != antidomain(antidomain(esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_36]),c_0_36]),c_0_26]),c_0_36]) ).
cnf(c_0_62,plain,
forward_diamond(X1,antidomain(antidomain(X2))) = forward_diamond(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_58]),c_0_48]) ).
cnf(c_0_63,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_27]),c_0_26]) ).
cnf(c_0_64,negated_conjecture,
multiplication(antidomain(antidomain(esk3_0)),forward_diamond(esk1_0,esk2_0)) = forward_diamond(esk1_0,esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_37]),c_0_52]) ).
cnf(c_0_65,plain,
addition(one,forward_diamond(X1,X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_60]),c_0_26]) ).
cnf(c_0_66,negated_conjecture,
addition(antidomain(antidomain(esk3_0)),forward_diamond(esk1_0,esk2_0)) != antidomain(antidomain(esk3_0)),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_26]),c_0_65]),c_0_27]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE100+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/5.39 % Computer : n018.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Sun Sep 20 22:45:19 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.45 Running first-order theorem proving
% 0.17/5.45 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
% 3.46/6.09 % Version: 3.5.1
% 3.46/6.09 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.46/6.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.46/6.09 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.46/6.09 % Starting new_bool_3 with 300s (1) cores
% 3.46/6.09 % Starting new_bool_1 with 300s (1) cores
% 3.46/6.09 % Starting sh5l with 300s (1) cores
% 3.46/6.09 % new_bool_1 with pid 359414 completed with status 0
% 3.46/6.09 % Result found by new_bool_1
% 3.46/6.09 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.46/6.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.46/6.09 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.46/6.09 % Starting new_bool_3 with 300s (1) cores
% 3.46/6.09 % Starting new_bool_1 with 300s (1) cores
% 3.46/6.09 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.46/6.09 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.46/6.09 % Search class: FUUPM-FFSF21-MFFFFFNN
% 3.46/6.09 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 3.46/6.09 % Starting SubtermCWHack with 28s (1) cores
% 3.46/6.09 % SubtermCWHack with pid 359420 completed with status 0
% 3.46/6.09 % Result found by SubtermCWHack
% 3.46/6.09 % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.46/6.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.46/6.09 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.46/6.09 % Starting new_bool_3 with 300s (1) cores
% 3.46/6.09 % Starting new_bool_1 with 300s (1) cores
% 3.46/6.09 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.46/6.09 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.46/6.09 % Search class: FUUPM-FFSF21-MFFFFFNN
% 3.46/6.09 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 3.46/6.09 % Starting SubtermCWHack with 28s (1) cores
% 3.46/6.09 % Preprocessing time : 0.002 s
% 3.46/6.09
% 3.46/6.09 % Proof found!
% 3.46/6.09 % SZS status Theorem
% 3.46/6.09 % SZS output start CNFRefutation
% See solution above
% 3.46/6.09 % Parsed axioms : 27
% 3.46/6.09 % Removed by relevancy pruning/SinE : 7
% 3.46/6.09 % Initial clauses : 21
% 3.46/6.09 % Removed in clause preprocessing : 0
% 3.46/6.09 % Initial clauses in saturation : 21
% 3.46/6.09 % Processed clauses : 1295
% 3.46/6.09 % ...of these trivial : 628
% 3.46/6.09 % ...subsumed : 208
% 3.46/6.09 % ...remaining for further processing : 459
% 3.46/6.09 % Other redundant clauses eliminated : 0
% 3.46/6.09 % Clauses deleted for lack of memory : 0
% 3.46/6.09 % Backward-subsumed : 0
% 3.46/6.09 % Backward-rewritten : 100
% 3.46/6.09 % Generated clauses : 40781
% 3.46/6.09 % ...of the previous two non-redundant : 13512
% 3.46/6.09 % ...aggressively subsumed : 0
% 3.46/6.09 % Contextual simplify-reflections : 0
% 3.46/6.09 % Paramodulations : 40781
% 3.46/6.09 % Factorizations : 0
% 3.46/6.09 % NegExts : 0
% 3.46/6.09 % Equation resolutions : 0
% 3.46/6.09 % Disequality decompositions : 0
% 3.46/6.09 % Total rewrite steps : 82185
% 3.46/6.09 % ...of those cached : 71552
% 3.46/6.09 % Propositional unsat checks : 0
% 3.46/6.09 % Propositional check models : 0
% 3.46/6.09 % Propositional check unsatisfiable : 0
% 3.46/6.09 % Propositional clauses : 0
% 3.46/6.09 % Propositional clauses after purity: 0
% 3.46/6.09 % Propositional unsat core size : 0
% 3.46/6.09 % Propositional preprocessing time : 0.000
% 3.46/6.09 % Propositional encoding time : 0.000
% 3.46/6.09 % Propositional solver time : 0.000
% 3.46/6.09 % Success case prop preproc time : 0.000
% 3.46/6.09 % Success case prop encoding time : 0.000
% 3.46/6.09 % Success case prop solver time : 0.000
% 3.46/6.09 % Current number of processed clauses : 359
% 3.46/6.09 % Positive orientable unit clauses : 354
% 3.46/6.09 % Positive unorientable unit clauses: 4
% 3.46/6.09 % Negative unit clauses : 1
% 3.46/6.09 % Non-unit-clauses : 0
% 3.46/6.09 % Current number of unprocessed clauses: 11956
% 3.46/6.09 % ...number of literals in the above : 11956
% 3.46/6.09 % Current number of archived formulas : 0
% 3.46/6.09 % Current number of archived clauses : 100
% 3.46/6.09 % Clause-clause subsumption calls (NU) : 0
% 3.46/6.09 % Rec. Clause-clause subsumption calls : 0
% 3.46/6.09 % Non-unit clause-clause subsumptions : 0
% 3.46/6.09 % Unit Clause-clause subsumption calls : 12
% 3.46/6.09 % Rewrite failures with RHS unbound : 0
% 3.46/6.09 % BW rewrite match attempts : 777
% 3.46/6.09 % BW rewrite match successes : 177
% 3.46/6.09 % Condensation attempts : 0
% 3.46/6.09 % Condensation successes : 0
% 3.46/6.09 % Termbank termtop insertions : 429895
% 3.46/6.09 % Search garbage collected termcells : 73
% 3.46/6.09
% 3.46/6.09 % -------------------------------------------------
% 3.46/6.09 % User time : 0.490 s
% 3.46/6.09 % System time : 0.032 s
% 3.46/6.09 % Total time : 0.522 s
% 3.46/6.09 % Maximum resident set size: 3660 pages
% 3.46/6.09
% 3.46/6.09 % -------------------------------------------------
% 3.46/6.09 % User time : 0.492 s
% 3.46/6.09 % System time : 0.040 s
% 3.46/6.09 % Total time : 0.532 s
% 3.46/6.09 % Maximum resident set size: 4864 pages
% 3.46/6.09 % E exiting
%------------------------------------------------------------------------------