%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM512+3 : 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 : n019.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:49:22 PM UTC 2026
% Result : Theorem 0.45s 0.48s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 11 unt; 0 def)
% Number of atoms : 138 ( 72 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 147 ( 42 ~; 36 |; 60 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 14 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ( sdtasdt0(xp,xk) = sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr))
& aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr)) )
=> sdtasdt0(xn,xm) = sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) )
& ( ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) )
=> sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) = sdtasdt0(xn,xm) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2342,hypothesis,
( isPrime0(xr)
& ! [X1] :
( ( ( doDivides0(X1,xr)
| ? [X2] :
( xr = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) ) )
& aNaturalNumber0(X1) )
=> ( X1 = xr
| X1 = sz10 ) )
& xr != sz10
& xr != sz00
& doDivides0(xr,xk)
& ? [X1] :
( xk = sdtasdt0(xr,X1)
& aNaturalNumber0(X1) )
& aNaturalNumber0(xr) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2342) ).
fof(m__2306,hypothesis,
( xk = sdtsldt0(sdtasdt0(xn,xm),xp)
& sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
& aNaturalNumber0(xk) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2306) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(m__2504,hypothesis,
( sdtlseqdt0(sdtsldt0(xn,xr),xn)
& ? [X1] :
( sdtpldt0(sdtsldt0(xn,xr),X1) = xn
& aNaturalNumber0(X1) )
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr))
& ~ ( ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) )
=> sdtsldt0(xn,xr) = xn ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2504) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).
fof(c_0_7,negated_conjecture,
~ ( ( ( sdtasdt0(xp,xk) = sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr))
& aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr)) )
=> sdtasdt0(xn,xm) = sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) )
& ( ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) )
=> sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) = sdtasdt0(xn,xm) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,negated_conjecture,
( ( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| sdtasdt0(xn,xm) != sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) )
& ( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| sdtasdt0(xp,xk) = sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr)) )
& ( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr)) )
& ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
| sdtasdt0(xn,xm) != sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) )
& ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
| sdtasdt0(xp,xk) = sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr)) )
& ( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
| aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr)) )
& ( aNaturalNumber0(sdtsldt0(xn,xr))
| sdtasdt0(xn,xm) != sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) )
& ( aNaturalNumber0(sdtsldt0(xn,xr))
| sdtasdt0(xp,xk) = sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr)) )
& ( aNaturalNumber0(sdtsldt0(xn,xr))
| aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,hypothesis,
( isPrime0(xr)
& ! [X1] :
( ( ( doDivides0(X1,xr)
| ? [X2] :
( xr = sdtasdt0(X1,X2)
& aNaturalNumber0(X2) ) )
& aNaturalNumber0(X1) )
=> ( X1 = xr
| X1 = sz10 ) )
& xr != sz10
& xr != sz00
& doDivides0(xr,xk)
& ? [X1] :
( xk = sdtasdt0(xr,X1)
& aNaturalNumber0(X1) )
& aNaturalNumber0(xr) ),
inference(fof_simplification,[status(thm)],[m__2342]) ).
cnf(c_0_10,negated_conjecture,
( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| sdtasdt0(xn,xm) != sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
sdtasdt0(xn,xm) = sdtasdt0(xp,xk),
inference(split_conjunct,[status(thm)],[m__2306]) ).
fof(c_0_12,plain,
! [X17,X18] :
( sdtasdt0(X17,X18) = sdtasdt0(X18,X17)
| ~ aNaturalNumber0(X18)
| ~ aNaturalNumber0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
fof(c_0_13,hypothesis,
! [X107,X108] :
( isPrime0(xr)
& ( X107 = xr
| X107 = sz10
| ~ aNaturalNumber0(X107)
| ~ doDivides0(X107,xr) )
& ( X107 = xr
| X107 = sz10
| ~ aNaturalNumber0(X107)
| xr != sdtasdt0(X107,X108)
| ~ aNaturalNumber0(X108) )
& xr != sz10
& xr != sz00
& doDivides0(xr,xk)
& xk = sdtasdt0(xr,esk12_0)
& aNaturalNumber0(esk12_0)
& aNaturalNumber0(xr) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| aNaturalNumber0(sdtsldt0(sdtasdt0(xp,xk),xr)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| sdtasdt0(xp,xk) = sdtasdt0(xr,sdtsldt0(sdtasdt0(xp,xk),xr)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| sdtasdt0(sdtsldt0(sdtasdt0(xn,xm),xr),xr) != sdtasdt0(xn,xm) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xr)) ),
inference(rw,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm)
| sdtasdt0(xr,sdtsldt0(sdtasdt0(xn,xm),xr)) = sdtasdt0(xn,xm) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11]),c_0_11]) ).
fof(c_0_21,hypothesis,
( sdtlseqdt0(sdtsldt0(xn,xr),xn)
& sdtpldt0(sdtsldt0(xn,xr),esk19_0) = xn
& aNaturalNumber0(esk19_0)
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr))
& sdtsldt0(xn,xr) != xn
& xn = sdtasdt0(xr,sdtsldt0(xn,xr))
& aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2504])])])]) ).
cnf(c_0_22,negated_conjecture,
sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) != sdtasdt0(xn,xm),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]),c_0_20]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_24,hypothesis,
aNaturalNumber0(sdtsldt0(xn,xr)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_25,plain,
! [X19,X20,X21] :
( sdtasdt0(sdtasdt0(X19,X20),X21) = sdtasdt0(X19,sdtasdt0(X20,X21))
| ~ aNaturalNumber0(X21)
| ~ aNaturalNumber0(X20)
| ~ aNaturalNumber0(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
cnf(c_0_26,negated_conjecture,
sdtasdt0(sdtasdt0(xm,sdtsldt0(xn,xr)),xr) != sdtasdt0(xn,xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
sdtasdt0(xm,sdtasdt0(sdtsldt0(xn,xr),xr)) != sdtasdt0(xn,xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18]),c_0_24]),c_0_23])]) ).
cnf(c_0_29,hypothesis,
xn = sdtasdt0(xr,sdtsldt0(xn,xr)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
sdtasdt0(xm,xn) != sdtasdt0(xn,xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_29]),c_0_18]),c_0_24])]) ).
cnf(c_0_31,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_17]),c_0_31]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM512+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n019.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 : Mon Sep 21 02:36:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.45/0.48 % Version: 3.5.1
% 0.45/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.45/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.45/0.48 % Starting sh5l with 300s (1) cores
% 0.45/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1505525 completed with status 0
% 0.45/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.45/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.48 % No SInE strategy applied
% 0.45/0.48 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.45/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.45/0.48 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.45/0.48 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.45/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 136s (1) cores
% 0.45/0.48 % G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 1505533 completed with status 0
% 0.45/0.48 % Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.45/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.48 % No SInE strategy applied
% 0.45/0.48 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.45/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.45/0.48 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.45/0.48 % Preprocessing time : 0.006 s
% 0.45/0.48
% 0.45/0.48 % Proof found!
% 0.45/0.48 % SZS status Theorem
% 0.45/0.48 % SZS output start CNFRefutation
% See solution above
% 0.45/0.48 % Parsed axioms : 54
% 0.45/0.48 % Removed by relevancy pruning/SinE : 0
% 0.45/0.48 % Initial clauses : 273
% 0.45/0.48 % Removed in clause preprocessing : 3
% 0.45/0.48 % Initial clauses in saturation : 270
% 0.45/0.48 % Processed clauses : 316
% 0.45/0.48 % ...of these trivial : 13
% 0.45/0.48 % ...subsumed : 67
% 0.45/0.48 % ...remaining for further processing : 236
% 0.45/0.48 % Other redundant clauses eliminated : 4
% 0.45/0.48 % Clauses deleted for lack of memory : 0
% 0.45/0.48 % Backward-subsumed : 8
% 0.45/0.48 % Backward-rewritten : 2
% 0.45/0.48 % Generated clauses : 673
% 0.45/0.48 % ...of the previous two non-redundant : 618
% 0.45/0.48 % ...aggressively subsumed : 0
% 0.45/0.48 % Contextual simplify-reflections : 5
% 0.45/0.48 % Paramodulations : 667
% 0.45/0.48 % Factorizations : 2
% 0.45/0.48 % NegExts : 0
% 0.45/0.48 % Equation resolutions : 4
% 0.45/0.48 % Disequality decompositions : 0
% 0.45/0.48 % Total rewrite steps : 477
% 0.45/0.48 % ...of those cached : 445
% 0.45/0.48 % Propositional unsat checks : 0
% 0.45/0.48 % Propositional check models : 0
% 0.45/0.48 % Propositional check unsatisfiable : 0
% 0.45/0.48 % Propositional clauses : 0
% 0.45/0.48 % Propositional clauses after purity: 0
% 0.45/0.48 % Propositional unsat core size : 0
% 0.45/0.48 % Propositional preprocessing time : 0.000
% 0.45/0.48 % Propositional encoding time : 0.000
% 0.45/0.48 % Propositional solver time : 0.000
% 0.45/0.48 % Success case prop preproc time : 0.000
% 0.45/0.48 % Success case prop encoding time : 0.000
% 0.45/0.48 % Success case prop solver time : 0.000
% 0.45/0.48 % Current number of processed clauses : 222
% 0.45/0.48 % Positive orientable unit clauses : 61
% 0.45/0.48 % Positive unorientable unit clauses: 0
% 0.45/0.48 % Negative unit clauses : 22
% 0.45/0.48 % Non-unit-clauses : 139
% 0.45/0.48 % Current number of unprocessed clauses: 555
% 0.45/0.48 % ...number of literals in the above : 2634
% 0.45/0.48 % Current number of archived formulas : 0
% 0.45/0.48 % Current number of archived clauses : 10
% 0.45/0.48 % Clause-clause subsumption calls (NU) : 2924
% 0.45/0.48 % Rec. Clause-clause subsumption calls : 2733
% 0.45/0.48 % Non-unit clause-clause subsumptions : 41
% 0.45/0.48 % Unit Clause-clause subsumption calls : 686
% 0.45/0.48 % Rewrite failures with RHS unbound : 0
% 0.45/0.48 % BW rewrite match attempts : 2
% 0.45/0.48 % BW rewrite match successes : 2
% 0.45/0.48 % Condensation attempts : 0
% 0.45/0.48 % Condensation successes : 0
% 0.45/0.48 % Termbank termtop insertions : 25696
% 0.45/0.48 % Search garbage collected termcells : 2509
% 0.45/0.48
% 0.45/0.48 % -------------------------------------------------
% 0.45/0.48 % User time : 0.030 s
% 0.45/0.48 % System time : 0.011 s
% 0.45/0.48 % Total time : 0.040 s
% 0.45/0.48 % Maximum resident set size: 4220 pages
% 0.45/0.48
% 0.45/0.48 % -------------------------------------------------
% 0.45/0.48 % User time : 0.142 s
% 0.45/0.48 % System time : 0.023 s
% 0.45/0.48 % Total time : 0.165 s
% 0.45/0.48 % Maximum resident set size: 4608 pages
% 0.45/0.48 % E exiting
%------------------------------------------------------------------------------