%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV055+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:53:36 PM UTC 2026
% Result : Theorem 0.84s 0.60s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 15 unt; 0 def)
% Number of atoms : 146 ( 25 equ)
% Maximal formula atoms : 41 ( 3 avg)
% Number of connectives : 164 ( 59 ~; 65 |; 29 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-3 aty)
% Number of variables : 40 ( 1 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0037,conjecture,
( ( ! [X14,X18] :
( ( leq(X14,minus(pv10,n1))
& leq(n0,X14) )
=> sum(n0,minus(n5,n1),a_select3(q,X14,X18)) = n1 )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( ! [X21,X22] :
( ( leq(X21,minus(pv10,n1))
& leq(n0,X21) )
=> sum(n0,minus(n5,n1),a_select3(q,X21,X22)) = n1 )
& ! [X4,X20] :
( ( leq(X4,minus(n0,n1))
& leq(n0,X4) )
=> a_select3(q,pv10,X4) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X20,n0),a_select2(x,pv10)),minus(a_select3(center,X20,n0),a_select2(x,pv10)))))) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0037) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(X1,n0)
& leq(n0,X1) )
=> X1 = n0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finite_domain_0) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(c_0_6,negated_conjecture,
~ ( ( ! [X14,X18] :
( ( leq(X14,minus(pv10,n1))
& leq(n0,X14) )
=> sum(n0,minus(n5,n1),a_select3(q,X14,X18)) = n1 )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( ! [X21,X22] :
( ( leq(X21,minus(pv10,n1))
& leq(n0,X21) )
=> sum(n0,minus(n5,n1),a_select3(q,X21,X22)) = n1 )
& ! [X4,X20] :
( ( leq(X4,minus(n0,n1))
& leq(n0,X4) )
=> a_select3(q,pv10,X4) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X20,n0),a_select2(x,pv10)),minus(a_select3(center,X20,n0),a_select2(x,pv10)))))) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0037]) ).
fof(c_0_7,negated_conjecture,
! [X186,X187] :
( ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| a_select3(q,pv10,esk24_0) != divide(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk25_0,n0),a_select2(x,pv10))))))
| sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0)) != n1 )
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| a_select3(q,pv10,esk24_0) != divide(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk25_0,n0),a_select2(x,pv10))))))
| leq(esk26_0,minus(pv10,n1)) )
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| a_select3(q,pv10,esk24_0) != divide(sqrt(times(minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk24_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk25_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk25_0,n0),a_select2(x,pv10))))))
| leq(n0,esk26_0) )
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(esk24_0,minus(n0,n1))
| sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0)) != n1 )
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(esk24_0,minus(n0,n1))
| leq(esk26_0,minus(pv10,n1)) )
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(esk24_0,minus(n0,n1))
| leq(n0,esk26_0) )
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(n0,esk24_0)
| sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0)) != n1 )
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(n0,esk24_0)
| leq(esk26_0,minus(pv10,n1)) )
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(n0,esk24_0)
| leq(n0,esk26_0) )
& ( sum(n0,minus(n5,n1),a_select3(q,X186,X187)) = n1
| ~ leq(X186,minus(pv10,n1))
| ~ leq(n0,X186) )
& leq(pv10,minus(n135300,n1))
& leq(n0,pv10) ),
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_6])])])])])]) ).
fof(c_0_8,plain,
! [X46,X47] :
( ( leq(X46,pred(X47))
| ~ gt(X47,X46) )
& ( gt(X47,X46)
| ~ leq(X46,pred(X47)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
fof(c_0_9,plain,
! [X145] : minus(X145,n1) = pred(X145),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_10,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0)) != n1
| leq(esk24_0,minus(n0,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(esk24_0,minus(n0,n1))
| leq(n0,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(esk24_0,minus(n0,n1))
| leq(esk26_0,minus(pv10,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( ~ leq(X1,pred(X2))
| gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0)) != n1
| leq(esk24_0,minus(n0,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_18,negated_conjecture,
( ~ leq(X1,minus(pv10,n1))
| ~ leq(n0,X1)
| sum(n0,minus(n5,n1),a_select3(q,X1,X2)) = n1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( leq(n0,esk26_0)
| leq(esk24_0,minus(n0,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_12])]) ).
cnf(c_0_20,negated_conjecture,
( leq(esk24_0,minus(n0,n1))
| leq(esk26_0,minus(pv10,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11]),c_0_12])]) ).
fof(c_0_21,plain,
! [X42,X43] :
( leq(X42,X43)
| ~ gt(X43,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])])]) ).
cnf(c_0_22,plain,
( ~ leq(X1,minus(X2,n1))
| gt(X2,X1) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
leq(esk24_0,minus(n0,n1)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0)) != n1
| leq(n0,esk24_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(n0,esk24_0)
| leq(n0,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| leq(n0,esk24_0)
| leq(esk26_0,minus(pv10,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_27,plain,
! [X194] :
( X194 = n0
| ~ leq(X194,n0)
| ~ leq(n0,X194) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])])]) ).
cnf(c_0_28,plain,
( ~ gt(X1,X2)
| leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
gt(n0,esk24_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( sum(n0,minus(n5,n1),a_select3(q,esk26_0,esk27_0)) != n1
| leq(n0,esk24_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_11]),c_0_12])]) ).
cnf(c_0_31,negated_conjecture,
( leq(n0,esk24_0)
| leq(n0,esk26_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_11]),c_0_12])]) ).
cnf(c_0_32,negated_conjecture,
( leq(n0,esk24_0)
| leq(esk26_0,minus(pv10,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_11]),c_0_12])]) ).
fof(c_0_33,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_34,plain,
( ~ leq(X1,n0)
| ~ leq(n0,X1)
| X1 = n0 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
leq(esk24_0,n0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
leq(n0,esk24_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_31]),c_0_32]) ).
fof(c_0_37,plain,
! [X33] : ~ gt(X33,X33),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_33])]) ).
cnf(c_0_38,negated_conjecture,
esk24_0 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_39,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV055+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n009.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 08:29:12 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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.84/0.60 % Version: 3.5.1
% 0.84/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.84/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.84/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.84/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.84/0.60 % Starting sh5l with 300s (1) cores
% 0.84/0.60 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1319260 completed with status 0
% 0.84/0.60 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.84/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.84/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.84/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.84/0.60 % No SInE strategy applied
% 0.84/0.60 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.84/0.60 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.84/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.84/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.84/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 113s (1) cores
% 0.84/0.60 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.84/0.60 % Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.84/0.60 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1319268 completed with status 0
% 0.84/0.60 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.84/0.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.84/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.84/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.84/0.60 % No SInE strategy applied
% 0.84/0.60 % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.84/0.60 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.84/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.84/0.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.84/0.60 % Preprocessing time : 0.008 s
% 0.84/0.60 % Presaturation interreduction done
% 0.84/0.60
% 0.84/0.60 % Proof found!
% 0.84/0.60 % SZS status Theorem
% 0.84/0.60 % SZS output start CNFRefutation
% See solution above
% 0.84/0.61 % Parsed axioms : 92
% 0.84/0.61 % Removed by relevancy pruning/SinE : 0
% 0.84/0.61 % Initial clauses : 211
% 0.84/0.61 % Removed in clause preprocessing : 2
% 0.84/0.61 % Initial clauses in saturation : 209
% 0.84/0.61 % Processed clauses : 337
% 0.84/0.61 % ...of these trivial : 1
% 0.84/0.61 % ...subsumed : 0
% 0.84/0.61 % ...remaining for further processing : 336
% 0.84/0.61 % Other redundant clauses eliminated : 3
% 0.84/0.61 % Clauses deleted for lack of memory : 0
% 0.84/0.61 % Backward-subsumed : 2
% 0.84/0.61 % Backward-rewritten : 23
% 0.84/0.61 % Generated clauses : 214
% 0.84/0.61 % ...of the previous two non-redundant : 187
% 0.84/0.61 % ...aggressively subsumed : 0
% 0.84/0.61 % Contextual simplify-reflections : 4
% 0.84/0.61 % Paramodulations : 210
% 0.84/0.61 % Factorizations : 2
% 0.84/0.61 % NegExts : 0
% 0.84/0.61 % Equation resolutions : 3
% 0.84/0.61 % Disequality decompositions : 0
% 0.84/0.61 % Total rewrite steps : 121
% 0.84/0.61 % ...of those cached : 80
% 0.84/0.61 % Propositional unsat checks : 0
% 0.84/0.61 % Propositional check models : 0
% 0.84/0.61 % Propositional check unsatisfiable : 0
% 0.84/0.61 % Propositional clauses : 0
% 0.84/0.61 % Propositional clauses after purity: 0
% 0.84/0.61 % Propositional unsat core size : 0
% 0.84/0.61 % Propositional preprocessing time : 0.000
% 0.84/0.61 % Propositional encoding time : 0.000
% 0.84/0.61 % Propositional solver time : 0.000
% 0.84/0.61 % Success case prop preproc time : 0.000
% 0.84/0.61 % Success case prop encoding time : 0.000
% 0.84/0.61 % Success case prop solver time : 0.000
% 0.84/0.61 % Current number of processed clauses : 101
% 0.84/0.61 % Positive orientable unit clauses : 69
% 0.84/0.61 % Positive unorientable unit clauses: 1
% 0.84/0.61 % Negative unit clauses : 2
% 0.84/0.61 % Non-unit-clauses : 29
% 0.84/0.61 % Current number of unprocessed clauses: 267
% 0.84/0.61 % ...number of literals in the above : 1002
% 0.84/0.61 % Current number of archived formulas : 0
% 0.84/0.61 % Current number of archived clauses : 235
% 0.84/0.61 % Clause-clause subsumption calls (NU) : 14737
% 0.84/0.61 % Rec. Clause-clause subsumption calls : 1601
% 0.84/0.61 % Non-unit clause-clause subsumptions : 4
% 0.84/0.61 % Unit Clause-clause subsumption calls : 740
% 0.84/0.61 % Rewrite failures with RHS unbound : 0
% 0.84/0.61 % BW rewrite match attempts : 33
% 0.84/0.61 % BW rewrite match successes : 21
% 0.84/0.61 % Condensation attempts : 0
% 0.84/0.61 % Condensation successes : 0
% 0.84/0.61 % Termbank termtop insertions : 20204
% 0.84/0.61 % Search garbage collected termcells : 2347
% 0.84/0.61
% 0.84/0.61 % -------------------------------------------------
% 0.84/0.61 % User time : 0.073 s
% 0.84/0.61 % System time : 0.010 s
% 0.84/0.61 % Total time : 0.083 s
% 0.84/0.61 % Maximum resident set size: 3744 pages
% 0.84/0.61
% 0.84/0.61 % -------------------------------------------------
% 0.84/0.61 % User time : 0.288 s
% 0.84/0.61 % System time : 0.037 s
% 0.84/0.61 % Total time : 0.325 s
% 0.84/0.61 % Maximum resident set size: 4608 pages
% 0.84/0.61 % E exiting
%------------------------------------------------------------------------------