%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.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 01:27:09 PM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 19 unt; 0 def)
% Number of atoms : 187 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 215 ( 81 ~; 68 |; 55 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 115 ( 1 sgn 79 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_FOL,conjecture,
! [X1,X6,X7,X8,X9,X4,X5] :
( ( greater(X7,X6)
& size(X1,X9,X5)
& size(X1,X8,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_FOL) ).
fof(t12_FOL,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( greater(X5,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL) ).
fof(mp17,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> reorganization_free(X1,X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17) ).
fof(mp15,axiom,
! [X1,X3] :
( organization(X1,X3)
=> time(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15) ).
fof(t11_FOL,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( greater(X5,X4)
& size(X1,X9,X5)
& size(X1,X8,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL) ).
fof(mp16,axiom,
! [X4,X5] :
( ( time(X5)
& time(X4) )
=> ( greater(X5,X4)
| X4 = X5
| greater(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16) ).
fof(mp18,axiom,
! [X1,X6,X7,X4,X5] :
( ( X4 = X5
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& organization(X1,X5)
& organization(X1,X4) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp18) ).
fof(mp6_1,axiom,
! [X1,X2] :
~ ( X1 = X2
& greater(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X6,X7,X8,X9,X4,X5] :
( ( greater(X7,X6)
& size(X1,X9,X5)
& size(X1,X8,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
inference(assume_negation,[status(cth)],[t13_FOL]) ).
fof(c_0_9,hypothesis,
! [X1,X6,X7,X4,X5] :
( ( greater(X5,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X6,X7) ),
inference(fof_simplification,[status(thm)],[t12_FOL]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X6,X7,X8,X9,X4,X5] :
( ( greater(X7,X6)
& size(X1,X9,X5)
& size(X1,X8,X4)
& complexity(X1,X7,X5)
& complexity(X1,X6,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_11,hypothesis,
! [X31,X32,X33,X34,X35] :
( ~ greater(X32,X33)
| ~ greater(X35,X34)
| ~ complexity(X31,X33,X35)
| ~ complexity(X31,X32,X34)
| ~ reorganization_free(X31,X34,X35)
| ~ organization(X31,X35)
| ~ organization(X31,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,negated_conjecture,
( greater(esk4_0,esk5_0)
& greater(esk3_0,esk2_0)
& size(esk1_0,esk5_0,esk7_0)
& size(esk1_0,esk4_0,esk6_0)
& complexity(esk1_0,esk3_0,esk7_0)
& complexity(esk1_0,esk2_0,esk6_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& organization(esk1_0,esk7_0)
& organization(esk1_0,esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_13,plain,
! [X18,X19,X20] :
( reorganization_free(X18,X20,X19)
| ~ reorganization_free(X18,X19,X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp17])])]) ).
fof(c_0_14,plain,
! [X14,X15] :
( time(X15)
| ~ organization(X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp15])])]) ).
cnf(c_0_15,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ reorganization_free(X1,X2,X3)
| reorganization_free(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,hypothesis,
! [X1,X8,X9,X4,X5] :
( ( greater(X5,X4)
& size(X1,X9,X5)
& size(X1,X8,X4)
& reorganization_free(X1,X4,X5)
& organization(X1,X5)
& organization(X1,X4) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[t11_FOL]) ).
fof(c_0_21,plain,
! [X16,X17] :
( greater(X17,X16)
| X16 = X17
| greater(X16,X17)
| ~ time(X17)
| ~ time(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp16])])]) ).
cnf(c_0_22,plain,
( ~ organization(X1,X2)
| time(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
( ~ greater(esk6_0,X2)
| ~ greater(X1,esk2_0)
| ~ organization(esk1_0,X2)
| ~ reorganization_free(esk1_0,X2,esk6_0)
| ~ complexity(esk1_0,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
reorganization_free(esk1_0,esk7_0,esk6_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_26,hypothesis,
! [X26,X27,X28,X29,X30] :
( ~ greater(X27,X28)
| ~ greater(X30,X29)
| ~ size(X26,X28,X30)
| ~ size(X26,X27,X29)
| ~ reorganization_free(X26,X29,X30)
| ~ organization(X26,X30)
| ~ organization(X26,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_27,plain,
( ~ time(X2)
| ~ time(X1)
| greater(X2,X1)
| X1 = X2
| greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
time(esk7_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( ~ greater(X1,esk2_0)
| ~ greater(esk6_0,esk7_0)
| ~ complexity(esk1_0,X1,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23])]) ).
cnf(c_0_30,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,negated_conjecture,
greater(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,hypothesis,
( ~ greater(X4,X5)
| ~ greater(X3,X2)
| ~ size(X1,X5,X3)
| ~ size(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_34,plain,
! [X21,X22,X23,X24,X25] :
( X22 = X23
| X24 != X25
| ~ complexity(X21,X23,X25)
| ~ complexity(X21,X22,X24)
| ~ organization(X21,X25)
| ~ organization(X21,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp18])])]) ).
cnf(c_0_35,negated_conjecture,
( ~ time(X1)
| greater(esk7_0,X1)
| greater(X1,esk7_0)
| X1 = esk7_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
time(esk6_0),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_37,negated_conjecture,
~ greater(esk6_0,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_38,negated_conjecture,
( ~ greater(esk7_0,X2)
| ~ greater(X1,esk5_0)
| ~ organization(esk1_0,X2)
| ~ reorganization_free(esk1_0,X2,esk7_0)
| ~ size(esk1_0,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_23])]) ).
cnf(c_0_39,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,negated_conjecture,
greater(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_41,plain,
( X2 != X3
| ~ complexity(X1,X5,X3)
| ~ complexity(X1,X4,X2)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( greater(esk7_0,esk6_0)
| esk7_0 = esk6_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_43,negated_conjecture,
~ greater(esk7_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_19]),c_0_17]),c_0_40])]) ).
cnf(c_0_44,plain,
( ~ organization(X3,X4)
| ~ complexity(X3,X1,X4)
| ~ complexity(X3,X2,X4)
| X1 = X2 ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_45,negated_conjecture,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[c_0_42,c_0_43]) ).
fof(c_0_46,plain,
! [X10,X11] :
( X10 != X11
| ~ greater(X10,X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_1])])]) ).
cnf(c_0_47,negated_conjecture,
( ~ complexity(esk1_0,X1,esk6_0)
| X1 = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_16]),c_0_17])]) ).
cnf(c_0_48,negated_conjecture,
complexity(esk1_0,esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_30,c_0_45]) ).
cnf(c_0_49,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_50,negated_conjecture,
esk3_0 = esk2_0,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:21:06 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.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 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2849649 completed with status 0
% 0.13/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FGHSF-FFSM00-SFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.43 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2849656 completed with status 0
% 0.13/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 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 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FGHSF-FFSM00-SFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43 % Presaturation interreduction done
% 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 : 9
% 0.13/0.43 % Removed by relevancy pruning/SinE : 0
% 0.13/0.43 % Initial clauses : 17
% 0.13/0.43 % Removed in clause preprocessing : 0
% 0.13/0.43 % Initial clauses in saturation : 17
% 0.13/0.43 % Processed clauses : 62
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 4
% 0.13/0.43 % ...remaining for further processing : 58
% 0.13/0.43 % Other redundant clauses eliminated : 2
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 2
% 0.13/0.43 % Backward-rewritten : 15
% 0.13/0.43 % Generated clauses : 33
% 0.13/0.43 % ...of the previous two non-redundant : 42
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 0
% 0.13/0.43 % Paramodulations : 30
% 0.13/0.43 % Factorizations : 0
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 2
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 46
% 0.13/0.43 % ...of those cached : 36
% 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 : 9
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 2
% 0.13/0.43 % Non-unit-clauses : 10
% 0.13/0.43 % Current number of unprocessed clauses: 13
% 0.13/0.43 % ...number of literals in the above : 42
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 35
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 142
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 53
% 0.13/0.43 % Non-unit clause-clause subsumptions : 0
% 0.13/0.43 % Unit Clause-clause subsumption calls : 24
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 2
% 0.13/0.43 % BW rewrite match successes : 2
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 2117
% 0.13/0.43 % Search garbage collected termcells : 328
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.007 s
% 0.13/0.43 % System time : 0.001 s
% 0.13/0.43 % Total time : 0.009 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.022 s
% 0.13/0.43 % System time : 0.009 s
% 0.13/0.43 % Total time : 0.031 s
% 0.13/0.43 % Maximum resident set size: 4608 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------