%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU280+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:33 PM UTC 2026
% Result : Theorem 3.10s 1.03s
% Output : CNFRefutation 3.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 50 ( 5 unt; 0 def)
% Number of atoms : 217 ( 61 equ)
% Maximal formula atoms : 70 ( 4 avg)
% Number of connectives : 257 ( 90 ~; 130 |; 30 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 94 ( 7 sgn 22 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_xboole_0__e6_22__wellord2,conjecture,
! [X1] :
? [X2] :
! [X3] :
( in(X3,X2)
<=> ( ordinal(X3)
& in(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_xboole_0__e6_22__wellord2) ).
fof(s1_tarski__e6_22__wellord2__1,axiom,
! [X1] :
( ! [X2,X3,X4] :
( ( ordinal(X4)
& X2 = X4
& ordinal(X3)
& X2 = X3 )
=> X3 = X4 )
=> ? [X2] :
! [X3] :
( in(X3,X2)
<=> ? [X4] :
( ordinal(X3)
& X4 = X3
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_tarski__e6_22__wellord2__1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
? [X2] :
! [X3] :
( in(X3,X2)
<=> ( ordinal(X3)
& in(X3,X1) ) ),
inference(assume_negation,[status(cth)],[s1_xboole_0__e6_22__wellord2]) ).
fof(c_0_4,plain,
! [X19,X21,X23,X24] :
( ( esk4_0 != esk5_0
| in(X23,esk6_1(X19))
| ~ ordinal(X23)
| X24 != X23
| ~ in(X24,X19) )
& ( esk4_0 != esk5_0
| ~ in(X21,esk6_1(X19))
| ordinal(X21) )
& ( esk4_0 != esk5_0
| ~ in(X21,esk6_1(X19))
| esk7_2(X19,X21) = X21 )
& ( esk4_0 != esk5_0
| ~ in(X21,esk6_1(X19))
| in(esk7_2(X19,X21),X19) )
& ( ordinal(esk5_0)
| in(X23,esk6_1(X19))
| ~ ordinal(X23)
| X24 != X23
| ~ in(X24,X19) )
& ( ordinal(esk5_0)
| ~ in(X21,esk6_1(X19))
| ordinal(X21) )
& ( ordinal(esk5_0)
| ~ in(X21,esk6_1(X19))
| esk7_2(X19,X21) = X21 )
& ( ordinal(esk5_0)
| ~ in(X21,esk6_1(X19))
| in(esk7_2(X19,X21),X19) )
& ( esk3_0 = esk5_0
| in(X23,esk6_1(X19))
| ~ ordinal(X23)
| X24 != X23
| ~ in(X24,X19) )
& ( esk3_0 = esk5_0
| ~ in(X21,esk6_1(X19))
| ordinal(X21) )
& ( esk3_0 = esk5_0
| ~ in(X21,esk6_1(X19))
| esk7_2(X19,X21) = X21 )
& ( esk3_0 = esk5_0
| ~ in(X21,esk6_1(X19))
| in(esk7_2(X19,X21),X19) )
& ( ordinal(esk4_0)
| in(X23,esk6_1(X19))
| ~ ordinal(X23)
| X24 != X23
| ~ in(X24,X19) )
& ( ordinal(esk4_0)
| ~ in(X21,esk6_1(X19))
| ordinal(X21) )
& ( ordinal(esk4_0)
| ~ in(X21,esk6_1(X19))
| esk7_2(X19,X21) = X21 )
& ( ordinal(esk4_0)
| ~ in(X21,esk6_1(X19))
| in(esk7_2(X19,X21),X19) )
& ( esk3_0 = esk4_0
| in(X23,esk6_1(X19))
| ~ ordinal(X23)
| X24 != X23
| ~ in(X24,X19) )
& ( esk3_0 = esk4_0
| ~ in(X21,esk6_1(X19))
| ordinal(X21) )
& ( esk3_0 = esk4_0
| ~ in(X21,esk6_1(X19))
| esk7_2(X19,X21) = X21 )
& ( esk3_0 = esk4_0
| ~ in(X21,esk6_1(X19))
| in(esk7_2(X19,X21),X19) ) ),
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)],[s1_tarski__e6_22__wellord2__1])])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X14] :
( ( in(esk2_1(X14),X14)
| ordinal(esk2_1(X14)) )
& ( in(esk2_1(X14),X14)
| in(esk2_1(X14),esk1_0) )
& ( ~ ordinal(esk2_1(X14))
| ~ in(esk2_1(X14),esk1_0)
| ~ in(esk2_1(X14),X14) ) ),
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_3])])])])]) ).
cnf(c_0_6,plain,
( ~ in(X2,esk6_1(X1))
| esk3_0 = esk4_0
| in(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ in(X2,esk6_1(X1))
| esk3_0 = esk4_0
| esk7_2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ in(X2,esk6_1(X1))
| esk3_0 = esk5_0
| in(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( ~ in(X2,esk6_1(X1))
| esk3_0 = esk5_0
| esk7_2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X45,X46,X47,X48,X49] :
( ( subset(X48,X49)
| ~ in(esk11_2(X48,X49),X49) )
& ( subset(X48,X49)
| in(esk11_2(X48,X49),X48) )
& ( in(X47,X46)
| ~ in(X47,X45)
| ~ subset(X45,X46) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_11,plain,
( ~ ordinal(X3)
| X1 != X3
| ~ in(X1,X2)
| esk3_0 = esk4_0
| in(X3,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( ~ in(X1,esk6_1(X2))
| esk3_0 = esk4_0
| ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( in(esk2_1(X1),X1)
| ordinal(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( ~ in(X1,esk6_1(X2))
| in(X1,X2)
| esk3_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( in(esk2_1(X1),X1)
| in(esk2_1(X1),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( esk4_0 != esk5_0
| ~ in(X2,esk6_1(X1))
| in(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,plain,
( esk4_0 != esk5_0
| ~ in(X2,esk6_1(X1))
| esk7_2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,plain,
( ~ in(X1,esk6_1(X2))
| in(X1,X2)
| esk3_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| in(esk11_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
( ~ ordinal(esk2_1(X1))
| ~ in(esk2_1(X1),esk1_0)
| ~ in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| in(X1,esk6_1(X2))
| esk3_0 = esk4_0 ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
( ordinal(esk2_1(esk6_1(X1)))
| esk3_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( in(esk2_1(esk6_1(X1)),X1)
| in(esk2_1(esk6_1(X1)),esk1_0)
| esk3_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_24,plain,
( ~ in(X1,esk6_1(X2))
| esk5_0 != esk4_0
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,plain,
( ~ in(esk11_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( in(esk11_2(esk6_1(X1),X2),X1)
| subset(esk6_1(X1),X2)
| esk3_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( ~ in(esk2_1(esk6_1(X1)),X1)
| ~ in(esk2_1(esk6_1(X1)),esk1_0)
| esk3_0 = esk4_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( in(esk2_1(esk6_1(esk1_0)),esk1_0)
| esk3_0 = esk4_0 ),
inference(ef,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( esk5_0 != esk4_0
| in(esk11_2(esk6_1(X1),X2),X1)
| subset(esk6_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_30,plain,
( subset(esk6_1(X1),X1)
| esk3_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
esk3_0 = esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_32,plain,
( esk5_0 != esk4_0
| subset(esk6_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_33,plain,
( ~ ordinal(X3)
| X1 != X3
| ~ in(X1,X2)
| esk3_0 = esk5_0
| in(X3,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_34,plain,
( esk4_0 != esk5_0
| ~ ordinal(X3)
| X1 != X3
| ~ in(X1,X2)
| in(X3,esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_35,plain,
( ~ in(X1,esk6_1(X2))
| esk3_0 = esk5_0
| ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_36,plain,
( esk4_0 != esk5_0
| ~ in(X1,esk6_1(X2))
| ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_37,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,plain,
subset(esk6_1(X1),X1),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_39,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| in(X1,esk6_1(X2))
| esk3_0 = esk5_0 ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| esk5_0 != esk4_0
| in(X1,esk6_1(X2)) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( ordinal(esk2_1(esk6_1(X1)))
| esk3_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_42,negated_conjecture,
( esk5_0 != esk4_0
| ordinal(esk2_1(esk6_1(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_13]) ).
cnf(c_0_43,plain,
( ~ in(X1,esk6_1(X2))
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( ~ in(X1,X2)
| ~ ordinal(X1)
| in(X1,esk6_1(X2)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_31]),c_0_40]) ).
cnf(c_0_45,negated_conjecture,
ordinal(esk2_1(esk6_1(X1))),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_31]),c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( in(esk2_1(esk6_1(X1)),X1)
| in(esk2_1(esk6_1(X1)),esk1_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_15]) ).
cnf(c_0_47,negated_conjecture,
( ~ in(esk2_1(esk6_1(X1)),X1)
| ~ in(esk2_1(esk6_1(X1)),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_44]),c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
in(esk2_1(esk6_1(esk1_0)),esk1_0),
inference(ef,[status(thm)],[c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU280+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 06:06:41 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 3.10/1.03 % Version: 3.5.1
% 3.10/1.03 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.10/1.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.10/1.03 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.10/1.03 % Starting new_bool_3 with 300s (1) cores
% 3.10/1.03 % Starting new_bool_1 with 300s (1) cores
% 3.10/1.03 % Starting sh5l with 300s (1) cores
% 3.10/1.03 % new_bool_3 with pid 1137674 completed with status 0
% 3.10/1.03 % Result found by new_bool_3
% 3.10/1.03 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.10/1.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.10/1.03 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.10/1.03 % Starting new_bool_3 with 300s (1) cores
% 3.10/1.03 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.10/1.03 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.10/1.03 % Search class: FGHSF-FFMF21-SFFFFFNN
% 3.10/1.03 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.10/1.03 % Starting SubtermCWHack with 31s (1) cores
% 3.10/1.03 % SubtermCWHack with pid 1137677 completed with status 0
% 3.10/1.03 % Result found by SubtermCWHack
% 3.10/1.03 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.10/1.03 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.10/1.03 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.10/1.03 % Starting new_bool_3 with 300s (1) cores
% 3.10/1.03 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.10/1.03 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.10/1.03 % Search class: FGHSF-FFMF21-SFFFFFNN
% 3.10/1.03 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.10/1.03 % Starting SubtermCWHack with 31s (1) cores
% 3.10/1.03 % Preprocessing time : 0.002 s
% 3.10/1.03
% 3.10/1.03 % Proof found!
% 3.10/1.03 % SZS status Theorem
% 3.10/1.03 % SZS output start CNFRefutation
% See solution above
% 3.10/1.03 % Parsed axioms : 364
% 3.10/1.03 % Removed by relevancy pruning/SinE : 351
% 3.10/1.03 % Initial clauses : 41
% 3.10/1.03 % Removed in clause preprocessing : 0
% 3.10/1.03 % Initial clauses in saturation : 41
% 3.10/1.03 % Processed clauses : 2493
% 3.10/1.03 % ...of these trivial : 12
% 3.10/1.03 % ...subsumed : 1532
% 3.10/1.03 % ...remaining for further processing : 949
% 3.10/1.03 % Other redundant clauses eliminated : 7
% 3.10/1.03 % Clauses deleted for lack of memory : 0
% 3.10/1.03 % Backward-subsumed : 70
% 3.10/1.03 % Backward-rewritten : 553
% 3.10/1.03 % Generated clauses : 18698
% 3.10/1.03 % ...of the previous two non-redundant : 18560
% 3.10/1.03 % ...aggressively subsumed : 0
% 3.10/1.03 % Contextual simplify-reflections : 28
% 3.10/1.03 % Paramodulations : 18651
% 3.10/1.03 % Factorizations : 40
% 3.10/1.03 % NegExts : 0
% 3.10/1.03 % Equation resolutions : 7
% 3.10/1.03 % Disequality decompositions : 0
% 3.10/1.03 % Total rewrite steps : 744
% 3.10/1.03 % ...of those cached : 719
% 3.10/1.03 % Propositional unsat checks : 0
% 3.10/1.03 % Propositional check models : 0
% 3.10/1.03 % Propositional check unsatisfiable : 0
% 3.10/1.03 % Propositional clauses : 0
% 3.10/1.03 % Propositional clauses after purity: 0
% 3.10/1.03 % Propositional unsat core size : 0
% 3.10/1.03 % Propositional preprocessing time : 0.000
% 3.10/1.03 % Propositional encoding time : 0.000
% 3.10/1.03 % Propositional solver time : 0.000
% 3.10/1.03 % Success case prop preproc time : 0.000
% 3.10/1.03 % Success case prop encoding time : 0.000
% 3.10/1.03 % Success case prop solver time : 0.000
% 3.10/1.03 % Current number of processed clauses : 319
% 3.10/1.03 % Positive orientable unit clauses : 15
% 3.10/1.03 % Positive unorientable unit clauses: 0
% 3.10/1.03 % Negative unit clauses : 12
% 3.10/1.03 % Non-unit-clauses : 292
% 3.10/1.03 % Current number of unprocessed clauses: 13969
% 3.10/1.03 % ...number of literals in the above : 63866
% 3.10/1.03 % Current number of archived formulas : 0
% 3.10/1.03 % Current number of archived clauses : 623
% 3.10/1.03 % Clause-clause subsumption calls (NU) : 102430
% 3.10/1.03 % Rec. Clause-clause subsumption calls : 55318
% 3.10/1.03 % Non-unit clause-clause subsumptions : 1585
% 3.10/1.03 % Unit Clause-clause subsumption calls : 2232
% 3.10/1.03 % Rewrite failures with RHS unbound : 0
% 3.10/1.03 % BW rewrite match attempts : 92
% 3.10/1.03 % BW rewrite match successes : 13
% 3.10/1.03 % Condensation attempts : 0
% 3.10/1.03 % Condensation successes : 0
% 3.10/1.03 % Termbank termtop insertions : 340232
% 3.10/1.03 % Search garbage collected termcells : 3100
% 3.10/1.03
% 3.10/1.03 % -------------------------------------------------
% 3.10/1.03 % User time : 0.529 s
% 3.10/1.03 % System time : 0.021 s
% 3.10/1.03 % Total time : 0.550 s
% 3.10/1.03 % Maximum resident set size: 4052 pages
% 3.10/1.03
% 3.10/1.03 % -------------------------------------------------
% 3.10/1.03 % User time : 0.538 s
% 3.10/1.03 % System time : 0.027 s
% 3.10/1.03 % Total time : 0.565 s
% 3.10/1.03 % Maximum resident set size: 5120 pages
% 3.10/1.03 % E exiting
%------------------------------------------------------------------------------