%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU291+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:24:35 PM UTC 2026
% Result : Theorem 0.22s 15.87s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 48 ( 18 unt; 0 def)
% Number of atoms : 150 ( 57 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 158 ( 56 ~; 58 |; 27 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 64 ( 0 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t9_funct_2,conjecture,
! [X1,X2,X3,X4] :
( ( relation_of2_as_subset(X4,X1,X2)
& quasi_total(X4,X1,X2)
& function(X4) )
=> ( subset(X2,X3)
=> ( ( relation_of2_as_subset(X4,X1,X3)
& quasi_total(X4,X1,X3)
& function(X4) )
| ( X1 != empty_set
& X2 = empty_set ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_funct_2) ).
fof(t16_relset_1,axiom,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(X1,X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(redefinition_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_dom_as_subset(X1,X2,X3) = relation_dom(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k4_relset_1) ).
fof(d1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ( X2 = empty_set
=> ( ( quasi_total(X3,X1,X2)
<=> X3 = empty_set )
| X1 = empty_set ) )
& ( ( X2 = empty_set
=> X1 = empty_set )
=> ( quasi_total(X3,X1,X2)
<=> X1 = relation_dom_as_subset(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_funct_2) ).
fof(t3_xboole_1,axiom,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( relation_of2_as_subset(X4,X1,X2)
& quasi_total(X4,X1,X2)
& function(X4) )
=> ( subset(X2,X3)
=> ( ( relation_of2_as_subset(X4,X1,X3)
& quasi_total(X4,X1,X3)
& function(X4) )
| ( X1 != empty_set
& X2 = empty_set ) ) ) ),
inference(assume_negation,[status(cth)],[t9_funct_2]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( relation_of2_as_subset(X4,X1,X2)
& quasi_total(X4,X1,X2)
& function(X4) )
=> ( subset(X2,X3)
=> ( ( relation_of2_as_subset(X4,X1,X3)
& quasi_total(X4,X1,X3)
& function(X4) )
| ( X1 != empty_set
& X2 = empty_set ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X62,X63,X64,X65] :
( relation_of2_as_subset(X65,X64,X63)
| ~ subset(X62,X63)
| ~ relation_of2_as_subset(X65,X64,X62) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_relset_1])])]) ).
fof(c_0_9,negated_conjecture,
( ( ~ relation_of2_as_subset(esk21_0,esk18_0,esk20_0)
| ~ quasi_total(esk21_0,esk18_0,esk20_0)
| ~ function(esk21_0) )
& ( esk18_0 = empty_set
| esk19_0 != empty_set )
& subset(esk19_0,esk20_0)
& relation_of2_as_subset(esk21_0,esk18_0,esk19_0)
& quasi_total(esk21_0,esk18_0,esk19_0)
& function(esk21_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_10,plain,
( ~ subset(X3,X4)
| ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2_as_subset(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
subset(esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X58,X59,X60] :
( ( relation_of2_as_subset(X60,X58,X59)
| ~ relation_of2(X60,X58,X59) )
& ( relation_of2(X60,X58,X59)
| ~ relation_of2_as_subset(X60,X58,X59) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ relation_of2_as_subset(X1,X2,esk19_0)
| relation_of2_as_subset(X1,X2,esk20_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
relation_of2_as_subset(esk21_0,esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X55,X56,X57] :
( relation_dom_as_subset(X55,X56,X57) = relation_dom(X57)
| ~ relation_of2(X57,X55,X56) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])])]) ).
cnf(c_0_16,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
relation_of2_as_subset(esk21_0,esk18_0,esk20_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ relation_of2(X1,X2,X3)
| relation_dom_as_subset(X2,X3,X1) = relation_dom(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
relation_of2(esk21_0,esk18_0,esk19_0),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( ~ relation_of2_as_subset(esk21_0,esk18_0,esk20_0)
| ~ quasi_total(esk21_0,esk18_0,esk20_0)
| ~ function(esk21_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
function(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_22,plain,
! [X13,X14,X15] :
( ( ~ relation_of2_as_subset(X15,X13,X14)
| X14 != empty_set
| X13 = empty_set
| quasi_total(X15,X13,X14)
| X15 != empty_set )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X14 != empty_set
| X13 = empty_set
| X15 = empty_set
| ~ quasi_total(X15,X13,X14) )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X13 != empty_set
| quasi_total(X15,X13,X14)
| X13 != relation_dom_as_subset(X13,X14,X15) )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X13 != empty_set
| X13 = relation_dom_as_subset(X13,X14,X15)
| ~ quasi_total(X15,X13,X14) )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X14 = empty_set
| quasi_total(X15,X13,X14)
| X13 != relation_dom_as_subset(X13,X14,X15) )
& ( ~ relation_of2_as_subset(X15,X13,X14)
| X14 = empty_set
| X13 = relation_dom_as_subset(X13,X14,X15)
| ~ quasi_total(X15,X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_2])])])]) ).
cnf(c_0_23,negated_conjecture,
relation_of2(esk21_0,esk18_0,esk20_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
relation_dom(esk21_0) = relation_dom_as_subset(esk18_0,esk19_0,esk21_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( ~ relation_of2_as_subset(esk21_0,esk18_0,esk20_0)
| ~ quasi_total(esk21_0,esk18_0,esk20_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_26,plain,
( ~ relation_of2_as_subset(X3,X1,X2)
| X1 != relation_dom_as_subset(X1,X2,X3)
| X2 = empty_set
| quasi_total(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
relation_dom_as_subset(esk18_0,esk20_0,esk21_0) = relation_dom_as_subset(esk18_0,esk19_0,esk21_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_23]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
~ quasi_total(esk21_0,esk18_0,esk20_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_17])]) ).
cnf(c_0_29,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| ~ quasi_total(X1,X2,X3)
| X3 = empty_set
| X2 = relation_dom_as_subset(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
quasi_total(esk21_0,esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,negated_conjecture,
( relation_dom_as_subset(esk18_0,esk19_0,esk21_0) != esk18_0
| esk20_0 = empty_set ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17])]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( esk19_0 = empty_set
| relation_dom_as_subset(esk18_0,esk19_0,esk21_0) = esk18_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_14])]) ).
fof(c_0_33,plain,
! [X72] :
( X72 = empty_set
| ~ subset(X72,empty_set) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_xboole_1])])]) ).
cnf(c_0_34,negated_conjecture,
( esk20_0 = empty_set
| esk19_0 = empty_set ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( ~ subset(X1,empty_set)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( esk19_0 != empty_set
| esk18_0 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_37,negated_conjecture,
esk19_0 = empty_set,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| X2 != empty_set
| ~ quasi_total(X1,X2,X3)
| X2 = relation_dom_as_subset(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_39,negated_conjecture,
esk18_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_40,plain,
( ~ relation_of2_as_subset(X2,empty_set,X1)
| ~ quasi_total(X2,empty_set,X1)
| relation_dom_as_subset(empty_set,X1,X2) = empty_set ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_41,negated_conjecture,
quasi_total(esk21_0,empty_set,empty_set),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_37]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
relation_of2_as_subset(esk21_0,empty_set,empty_set),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_37]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( relation_dom_as_subset(empty_set,empty_set,esk21_0) != empty_set
| esk20_0 = empty_set ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_37]),c_0_39]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
relation_dom_as_subset(empty_set,empty_set,esk21_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
~ quasi_total(esk21_0,empty_set,esk20_0),
inference(rw,[status(thm)],[c_0_28,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
esk20_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU291+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/15.67 % Computer : n014.cluster.edu
% 0.17/15.67 % Model : x86_64 x86_64
% 0.17/15.67 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/15.67 % Memory : 8046.5625MB
% 0.17/15.67 % OS : Linux 6.8.0-71-generic
% 0.17/15.67 % CPULimit : 300
% 0.17/15.67 % WCLimit : 300
% 0.17/15.67 % DateTime : Mon Sep 21 06:08:07 UTC 2026
% 0.17/15.67 % CPUTime :
% 0.17/15.67 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/15.73 Running first-order theorem proving
% 0.22/15.73 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.22/15.87 % Version: 3.5.1
% 0.22/15.87 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/15.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/15.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/15.87 % Starting new_bool_3 with 300s (1) cores
% 0.22/15.87 % Starting new_bool_1 with 300s (1) cores
% 0.22/15.87 % Starting sh5l with 300s (1) cores
% 0.22/15.87 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3302989 completed with status 0
% 0.22/15.87 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/15.87 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/15.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/15.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/15.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/15.87 % No SInE strategy applied
% 0.22/15.87 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.22/15.87 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/15.87 % Starting SubtermCWHack with 136s (1) cores
% 0.22/15.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/15.87 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.22/15.87 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.22/15.87 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/15.87 % G-E--_208_C18_F1_SE_CS_SP_PS_S4b with pid 3302996 completed with status 0
% 0.22/15.87 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4b
% 0.22/15.87 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/15.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/15.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/15.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/15.87 % No SInE strategy applied
% 0.22/15.87 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.22/15.87 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/15.87 % Starting SubtermCWHack with 136s (1) cores
% 0.22/15.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/15.87 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.22/15.87 % Preprocessing time : 0.003 s
% 0.22/15.87 % Presaturation interreduction done
% 0.22/15.87
% 0.22/15.87 % Proof found!
% 0.22/15.87 % SZS status Theorem
% 0.22/15.87 % SZS output start CNFRefutation
% See solution above
% 0.22/15.88 % Parsed axioms : 52
% 0.22/15.88 % Removed by relevancy pruning/SinE : 0
% 0.22/15.88 % Initial clauses : 90
% 0.22/15.88 % Removed in clause preprocessing : 8
% 0.22/15.88 % Initial clauses in saturation : 82
% 0.22/15.88 % Processed clauses : 247
% 0.22/15.88 % ...of these trivial : 4
% 0.22/15.88 % ...subsumed : 15
% 0.22/15.88 % ...remaining for further processing : 228
% 0.22/15.88 % Other redundant clauses eliminated : 5
% 0.22/15.88 % Clauses deleted for lack of memory : 0
% 0.22/15.88 % Backward-subsumed : 1
% 0.22/15.88 % Backward-rewritten : 38
% 0.22/15.88 % Generated clauses : 165
% 0.22/15.88 % ...of the previous two non-redundant : 145
% 0.22/15.88 % ...aggressively subsumed : 0
% 0.22/15.88 % Contextual simplify-reflections : 3
% 0.22/15.88 % Paramodulations : 161
% 0.22/15.88 % Factorizations : 0
% 0.22/15.88 % NegExts : 0
% 0.22/15.88 % Equation resolutions : 5
% 0.22/15.88 % Disequality decompositions : 0
% 0.22/15.88 % Total rewrite steps : 116
% 0.22/15.88 % ...of those cached : 70
% 0.22/15.88 % Propositional unsat checks : 0
% 0.22/15.88 % Propositional check models : 0
% 0.22/15.88 % Propositional check unsatisfiable : 0
% 0.22/15.88 % Propositional clauses : 0
% 0.22/15.88 % Propositional clauses after purity: 0
% 0.22/15.88 % Propositional unsat core size : 0
% 0.22/15.88 % Propositional preprocessing time : 0.000
% 0.22/15.88 % Propositional encoding time : 0.000
% 0.22/15.88 % Propositional solver time : 0.000
% 0.22/15.88 % Success case prop preproc time : 0.000
% 0.22/15.88 % Success case prop encoding time : 0.000
% 0.22/15.88 % Success case prop solver time : 0.000
% 0.22/15.88 % Current number of processed clauses : 106
% 0.22/15.88 % Positive orientable unit clauses : 52
% 0.22/15.88 % Positive unorientable unit clauses: 0
% 0.22/15.88 % Negative unit clauses : 6
% 0.22/15.88 % Non-unit-clauses : 48
% 0.22/15.88 % Current number of unprocessed clauses: 51
% 0.22/15.88 % ...number of literals in the above : 71
% 0.22/15.88 % Current number of archived formulas : 0
% 0.22/15.88 % Current number of archived clauses : 118
% 0.22/15.88 % Clause-clause subsumption calls (NU) : 418
% 0.22/15.88 % Rec. Clause-clause subsumption calls : 315
% 0.22/15.88 % Non-unit clause-clause subsumptions : 13
% 0.22/15.88 % Unit Clause-clause subsumption calls : 77
% 0.22/15.88 % Rewrite failures with RHS unbound : 0
% 0.22/15.88 % BW rewrite match attempts : 24
% 0.22/15.88 % BW rewrite match successes : 11
% 0.22/15.88 % Condensation attempts : 0
% 0.22/15.88 % Condensation successes : 0
% 0.22/15.88 % Termbank termtop insertions : 5762
% 0.22/15.88 % Search garbage collected termcells : 669
% 0.22/15.88
% 0.22/15.88 % -------------------------------------------------
% 0.22/15.88 % User time : 0.026 s
% 0.22/15.88 % System time : 0.006 s
% 0.22/15.88 % Total time : 0.031 s
% 0.22/15.88 % Maximum resident set size: 3416 pages
% 0.22/15.88
% 0.22/15.88 % -------------------------------------------------
% 0.22/15.88 % User time : 0.122 s
% 0.22/15.88 % System time : 0.031 s
% 0.22/15.88 % Total time : 0.153 s
% 0.22/15.88 % Maximum resident set size: 4608 pages
% 0.22/15.88 % E exiting
%------------------------------------------------------------------------------