%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS167+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 01:01:04 PM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 55 ( 5 unt; 0 def)
% Number of atoms : 214 ( 18 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 257 ( 98 ~; 119 |; 28 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-1 aty)
% Number of variables : 73 ( 8 sgn 31 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X4] :
( cc1(X4)
<=> cc2(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_2,axiom,
! [X4] :
( cc1(X4)
<=> ( ! [X5,X6] :
( ( rp(X4,X6)
& rp(X4,X5) )
=> X5 = X6 )
& ? [X5] : rp(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X4] :
( cc2(X4)
<=> ( ! [X5,X6] :
( ( rp(X4,X6)
& rp(X4,X5) )
=> X5 = X6 )
& ? [X5] : rp(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_0,axiom,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(c_0_5,negated_conjecture,
~ ( ! [X4] :
( cc1(X4)
<=> cc2(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_6,plain,
! [X22,X24,X25,X26,X27] :
( ( cc1(X26)
| ~ rp(X26,X27)
| esk8_1(X26) != esk9_1(X26) )
& ( cc1(X26)
| ~ rp(X26,X27)
| rp(X26,esk9_1(X26)) )
& ( cc1(X26)
| ~ rp(X26,X27)
| rp(X26,esk8_1(X26)) )
& ( ~ cc1(X22)
| X24 = X25
| ~ rp(X22,X25)
| ~ rp(X22,X24) )
& ( ~ cc1(X22)
| rp(X22,esk7_1(X22)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])])]) ).
fof(c_0_7,plain,
! [X12,X14,X15,X16,X17] :
( ( cc2(X16)
| ~ rp(X16,X17)
| esk5_1(X16) != esk6_1(X16) )
& ( cc2(X16)
| ~ rp(X16,X17)
| rp(X16,esk6_1(X16)) )
& ( cc2(X16)
| ~ rp(X16,X17)
| rp(X16,esk5_1(X16)) )
& ( ~ cc2(X12)
| X14 = X15
| ~ rp(X12,X15)
| ~ rp(X12,X14) )
& ( ~ cc2(X12)
| rp(X12,esk4_1(X12)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ ( ! [X4] :
( cc1(X4)
<=> cc2(X4) )
& ! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) )
& ! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X4] :
( ~ cowlNothing(X4)
& cowlThing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_10,plain,
! [X4] :
( xsd_string(X4)
<=> ~ xsd_integer(X4) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_11,plain,
( ~ cc1(X1)
| ~ rp(X1,X3)
| ~ rp(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ cc1(X1)
| rp(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ rp(X1,X2)
| cc2(X1)
| rp(X1,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ rp(X1,X2)
| cc2(X1)
| rp(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,negated_conjecture,
( ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| cc2(esk3_0)
| cc1(esk3_0) )
& ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| ~ cc2(esk3_0)
| ~ cc1(esk3_0) )
& ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| cc2(esk3_0)
| cc1(esk3_0) )
& ( cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cc2(esk3_0)
| ~ cc1(esk3_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_16,plain,
! [X37] :
( ~ cowlNothing(X37)
& cowlThing(X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
fof(c_0_17,plain,
! [X32] :
( ( xsd_string(X32)
| xsd_integer(X32) )
& ( ~ xsd_integer(X32)
| ~ xsd_string(X32) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_18,plain,
( ~ cc1(X2)
| ~ rp(X2,X1)
| X1 = esk7_1(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( ~ cc1(X1)
| cc2(X1)
| rp(X1,esk6_1(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_20,plain,
( ~ cc1(X1)
| cc2(X1)
| rp(X1,esk5_1(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_21,plain,
( ~ rp(X1,X2)
| esk5_1(X1) != esk6_1(X1)
| cc2(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cc2(esk3_0)
| cc1(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cc2(esk3_0)
| cc1(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,plain,
( ~ cc1(X1)
| cc2(X1)
| esk7_1(X1) = esk6_1(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
( ~ cc1(X1)
| cc2(X1)
| esk7_1(X1) = esk5_1(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_29,plain,
( ~ cc1(X1)
| esk6_1(X1) != esk5_1(X1)
| cc2(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_30,plain,
( ~ rp(X1,X2)
| cc1(X1)
| rp(X1,esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,plain,
( ~ cc2(X1)
| rp(X1,esk4_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,negated_conjecture,
( cc1(esk3_0)
| cc2(esk3_0)
| xsd_string(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),c_0_24]),c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( cc1(esk3_0)
| cc2(esk3_0)
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_23])]),c_0_24]),c_0_25]) ).
cnf(c_0_35,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cc2(esk3_0)
| ~ cc1(esk3_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,plain,
( ~ cc1(X1)
| cc2(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_37,plain,
( ~ cc2(X1)
| ~ rp(X1,X3)
| ~ rp(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_38,plain,
( ~ rp(X1,X2)
| cc1(X1)
| rp(X1,esk9_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_39,plain,
( ~ cc2(X1)
| cc1(X1)
| rp(X1,esk8_1(X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,negated_conjecture,
( ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cc2(esk3_0)
| ~ cc1(esk3_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_41,negated_conjecture,
( cc1(esk3_0)
| cc2(esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( ~ cc1(esk3_0)
| xsd_string(esk2_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_23])]),c_0_24]),c_0_36]),c_0_25]) ).
cnf(c_0_43,plain,
( ~ cc2(X2)
| ~ rp(X2,X1)
| X1 = esk4_1(X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_44,plain,
( ~ cc2(X1)
| cc1(X1)
| rp(X1,esk9_1(X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( ~ rp(X1,X2)
| esk8_1(X1) != esk9_1(X1)
| cc1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_46,negated_conjecture,
( ~ cc1(esk3_0)
| ~ cc2(esk3_0)
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_23])]),c_0_24]),c_0_25]) ).
cnf(c_0_47,negated_conjecture,
cc2(esk3_0),
inference(spm,[status(thm)],[c_0_36,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( ~ cc1(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_42]) ).
cnf(c_0_49,plain,
( ~ cc2(X1)
| cc1(X1)
| esk4_1(X1) = esk9_1(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
( ~ cc2(X1)
| cc1(X1)
| esk4_1(X1) = esk8_1(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_39]) ).
cnf(c_0_51,plain,
( ~ cc2(X1)
| esk9_1(X1) != esk8_1(X1)
| cc1(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
~ cc1(esk3_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),c_0_48]) ).
cnf(c_0_53,plain,
( ~ cc2(X1)
| cc1(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS167+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 22:56:58 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % new_bool_3 with pid 380929 completed with status 0
% 0.13/0.43 % Result found by new_bool_3
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % SubtermCWHack with pid 380933 completed with status 0
% 0.13/0.43 % Result found by SubtermCWHack
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Theorem
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 13
% 0.13/0.43 % Removed by relevancy pruning/SinE : 0
% 0.13/0.43 % Initial clauses : 26
% 0.13/0.43 % Removed in clause preprocessing : 8
% 0.13/0.43 % Initial clauses in saturation : 18
% 0.13/0.43 % Processed clauses : 56
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 19
% 0.13/0.43 % ...remaining for further processing : 37
% 0.13/0.43 % Other redundant clauses eliminated : 0
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 14
% 0.13/0.43 % Backward-rewritten : 2
% 0.13/0.43 % Generated clauses : 69
% 0.13/0.43 % ...of the previous two non-redundant : 43
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 9
% 0.13/0.43 % Paramodulations : 69
% 0.13/0.43 % Factorizations : 0
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 0
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 7
% 0.13/0.43 % ...of those cached : 5
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 21
% 0.13/0.43 % Positive orientable unit clauses : 2
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 2
% 0.13/0.43 % Non-unit-clauses : 17
% 0.13/0.43 % Current number of unprocessed clauses: 3
% 0.13/0.43 % ...number of literals in the above : 12
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 16
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 255
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 215
% 0.13/0.43 % Non-unit clause-clause subsumptions : 40
% 0.13/0.43 % Unit Clause-clause subsumption calls : 2
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 1
% 0.13/0.43 % BW rewrite match successes : 1
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 2635
% 0.13/0.43 % Search garbage collected termcells : 518
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.006 s
% 0.13/0.43 % System time : 0.001 s
% 0.13/0.43 % Total time : 0.008 s
% 0.13/0.43 % Maximum resident set size: 3640 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.007 s
% 0.13/0.43 % System time : 0.006 s
% 0.13/0.43 % Total time : 0.013 s
% 0.13/0.43 % Maximum resident set size: 4608 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------