%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU640^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 : Wed Sep 30 08:24:50 AM UTC 2026
% Result : Theorem 0.23s 0.28s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 110 ( 18 equ; 0 cnn)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 428 ( 46 ~; 56 |; 14 &; 271 @)
% ( 2 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 70 ( 10 ^; 54 !; 6 ?; 70 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_26,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_27,type,
singleton: $i > $o ).
thf(decl_28,type,
singletonprop: $o ).
thf(decl_29,type,
ex1: $i > ( $i > $o ) > $o ).
thf(decl_30,type,
esk1_2: $i > ( $i > $o ) > $i ).
thf(decl_31,type,
esk2_2: $i > ( $i > $o ) > $i ).
thf(decl_32,type,
esk3_0: $i ).
thf(decl_33,type,
epred1_0: $i > $o ).
thf(decl_34,type,
esk4_0: $i ).
thf(ex1I2,conjecture,
( singletonprop
=> ! [X1: $i,X3: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X3 @ X2 )
=> ( ( X3 @ X4 )
=> ( X2 = X4 ) ) ) ) )
=> ( ? [X2: $i] :
( ( in @ X2 @ X1 )
& ( X3 @ X2 ) )
=> ( ex1 @ X1
@ ^ [X2: $i] : ( X3 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZxEh9tCzY6/E---3.1_122260.p',ex1I2) ).
thf(singletonprop,axiom,
( singletonprop
<=> ! [X1: $i,X3: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X3 @ X2 )
=> ( ( X3 @ X4 )
=> ( X2 = X4 ) ) ) ) )
=> ( ? [X2: $i] :
( ( in @ X2 @ X1 )
& ( X3 @ X2 ) )
=> ( singleton
@ ( dsetconstr @ X1
@ ^ [X2: $i] : ( X3 @ X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZxEh9tCzY6/E---3.1_122260.p',singletonprop) ).
thf(ex1,axiom,
( ex1
= ( ^ [X1: $i,X3: $i > $o] :
( singleton
@ ( dsetconstr @ X1
@ ^ [X2: $i] : ( X3 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZxEh9tCzY6/E---3.1_122260.p',ex1) ).
thf(c_0_3,negated_conjecture,
~ ( singletonprop
=> ! [X1: $i,X3: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X3 @ X2 )
=> ( ( X3 @ X4 )
=> ( X2 = X4 ) ) ) ) )
=> ( ? [X2: $i] :
( ( in @ X2 @ X1 )
& ( X3 @ X2 ) )
=> ( ex1 @ X1
@ ^ [X2: $i] : ( X3 @ X2 ) ) ) ) ),
inference(assume_negation,[status(cth)],[ex1I2]) ).
thf(c_0_4,plain,
( singletonprop
<=> ! [X1: $i,X3: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X3 @ X2 )
=> ( ( X3 @ X4 )
=> ( X2 = X4 ) ) ) ) )
=> ( ? [X2: $i] :
( ( in @ X2 @ X1 )
& ( X3 @ X2 ) )
=> ( singleton
@ ( dsetconstr @ X1
@ ^ [Z0: $i] : ( X3 @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[singletonprop]) ).
thf(c_0_5,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
( singleton
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ex1]) ).
thf(c_0_6,negated_conjecture,
~ ( ! [X15: $i,X16: $i > $o] :
( ! [X17: $i] :
( ( in @ X17 @ X15 )
=> ! [X18: $i] :
( ( in @ X18 @ X15 )
=> ( ( X16 @ X17 )
=> ( ( X16 @ X18 )
=> ( X17 = X18 ) ) ) ) )
=> ( ? [X19: $i] :
( ( in @ X19 @ X15 )
& ( X16 @ X19 ) )
=> ( singleton @ ( dsetconstr @ X15 @ X16 ) ) ) )
=> ! [X1: $i,X3: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( X3 @ X2 )
=> ( ( X3 @ X4 )
=> ( X2 = X4 ) ) ) ) )
=> ( ? [X2: $i] :
( ( in @ X2 @ X1 )
& ( X3 @ X2 ) )
=> ( singleton @ ( dsetconstr @ X1 @ X3 ) ) ) ) ),
inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3]),c_0_4]),c_0_5])]) ).
thf(c_0_7,negated_conjecture,
! [X20: $i,X21: $i > $o,X24: $i,X27: $i,X28: $i] :
( ( ( in @ ( esk1_2 @ X20 @ X21 ) @ X20 )
| ~ ( in @ X24 @ X20 )
| ~ ( X21 @ X24 )
| ( singleton @ ( dsetconstr @ X20 @ X21 ) ) )
& ( ( in @ ( esk2_2 @ X20 @ X21 ) @ X20 )
| ~ ( in @ X24 @ X20 )
| ~ ( X21 @ X24 )
| ( singleton @ ( dsetconstr @ X20 @ X21 ) ) )
& ( ( X21 @ ( esk1_2 @ X20 @ X21 ) )
| ~ ( in @ X24 @ X20 )
| ~ ( X21 @ X24 )
| ( singleton @ ( dsetconstr @ X20 @ X21 ) ) )
& ( ( X21 @ ( esk2_2 @ X20 @ X21 ) )
| ~ ( in @ X24 @ X20 )
| ~ ( X21 @ X24 )
| ( singleton @ ( dsetconstr @ X20 @ X21 ) ) )
& ( ( ( esk1_2 @ X20 @ X21 )
!= ( esk2_2 @ X20 @ X21 ) )
| ~ ( in @ X24 @ X20 )
| ~ ( X21 @ X24 )
| ( singleton @ ( dsetconstr @ X20 @ X21 ) ) )
& ( ~ ( in @ X27 @ esk3_0 )
| ~ ( in @ X28 @ esk3_0 )
| ~ ( epred1_0 @ X27 )
| ~ ( epred1_0 @ X28 )
| ( X27 = X28 ) )
& ( in @ esk4_0 @ esk3_0 )
& ( epred1_0 @ esk4_0 )
& ~ ( singleton @ ( dsetconstr @ esk3_0 @ epred1_0 ) ) ),
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])])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( in @ X2 @ esk3_0 )
| ~ ( epred1_0 @ X1 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
in @ esk4_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
epred1_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X3: $i > $o,X2: $i] :
( ( in @ ( esk2_2 @ X1 @ X3 ) @ X1 )
| ( singleton @ ( dsetconstr @ X1 @ X3 ) )
| ~ ( in @ X2 @ X1 )
| ~ ( X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X3: $i > $o,X2: $i] :
( ( X3 @ ( esk2_2 @ X1 @ X3 ) )
| ( singleton @ ( dsetconstr @ X1 @ X3 ) )
| ~ ( in @ X2 @ X1 )
| ~ ( X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X3: $i > $o,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ X3 ) @ X1 )
| ( singleton @ ( dsetconstr @ X1 @ X3 ) )
| ~ ( in @ X2 @ X1 )
| ~ ( X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X3: $i > $o,X2: $i] :
( ( X3 @ ( esk1_2 @ X1 @ X3 ) )
| ( singleton @ ( dsetconstr @ X1 @ X3 ) )
| ~ ( in @ X2 @ X1 )
| ~ ( X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
( ( X1 = esk4_0 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( epred1_0 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i > $o] :
( ( in @ ( esk2_2 @ esk3_0 @ X3 ) @ esk3_0 )
| ( singleton @ ( dsetconstr @ esk3_0 @ X3 ) )
| ~ ( X3 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i > $o] :
( ( singleton @ ( dsetconstr @ esk3_0 @ X3 ) )
| ( X3 @ ( esk2_2 @ esk3_0 @ X3 ) )
| ~ ( X3 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
thf(c_0_18,negated_conjecture,
~ ( singleton @ ( dsetconstr @ esk3_0 @ epred1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_19,negated_conjecture,
! [X3: $i > $o] :
( ( in @ ( esk1_2 @ esk3_0 @ X3 ) @ esk3_0 )
| ( singleton @ ( dsetconstr @ esk3_0 @ X3 ) )
| ~ ( X3 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i > $o] :
( ( singleton @ ( dsetconstr @ esk3_0 @ X3 ) )
| ( X3 @ ( esk1_2 @ esk3_0 @ X3 ) )
| ~ ( X3 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X3: $i > $o,X2: $i] :
( ( singleton @ ( dsetconstr @ X1 @ X3 ) )
| ( ( esk1_2 @ X1 @ X3 )
!= ( esk2_2 @ X1 @ X3 ) )
| ~ ( in @ X2 @ X1 )
| ~ ( X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i > $o] :
( ( ( esk2_2 @ esk3_0 @ X3 )
= esk4_0 )
| ( singleton @ ( dsetconstr @ esk3_0 @ X3 ) )
| ~ ( epred1_0 @ ( esk2_2 @ esk3_0 @ X3 ) )
| ~ ( X3 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_23,negated_conjecture,
epred1_0 @ ( esk2_2 @ esk3_0 @ epred1_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_10]),c_0_18]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i > $o] :
( ( ( esk1_2 @ esk3_0 @ X3 )
= esk4_0 )
| ( singleton @ ( dsetconstr @ esk3_0 @ X3 ) )
| ~ ( epred1_0 @ ( esk1_2 @ esk3_0 @ X3 ) )
| ~ ( X3 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
thf(c_0_25,negated_conjecture,
epred1_0 @ ( esk1_2 @ esk3_0 @ epred1_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_10]),c_0_18]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i > $o] :
( ( singleton @ ( dsetconstr @ esk3_0 @ X3 ) )
| ( ( esk2_2 @ esk3_0 @ X3 )
!= ( esk1_2 @ esk3_0 @ X3 ) )
| ~ ( X3 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
thf(c_0_27,negated_conjecture,
( ( esk2_2 @ esk3_0 @ epred1_0 )
= esk4_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_10])]),c_0_18]) ).
thf(c_0_28,negated_conjecture,
( ( esk1_2 @ esk3_0 @ epred1_0 )
= esk4_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_10])]),c_0_18]) ).
thf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_27]),c_0_28]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU640^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n018.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 14:03:26 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.24 Running higher-order theorem proving
% 0.07/0.25 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ZxEh9tCzY6/E---3.1_122260.p
% 0.23/0.28 % Version: 3.5.1-ho
% 0.23/0.28 % Preprocessing class: HSSSSMSSSLMNHSA.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.28 % Starting sh5l with 300s (1) cores
% 0.23/0.28 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.28 % Starting new_bool_2 with 300s (1) cores
% 0.23/0.28 % new_bool_1 with pid 122275 completed with status 0
% 0.23/0.28 % Result found by new_bool_1
% 0.23/0.28 % Preprocessing class: HSSSSMSSSLMNHSA.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.28 % Starting sh5l with 300s (1) cores
% 0.23/0.28 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.28 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.28 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.28 % Search class: HGUSF-FFSF22-SHSFMMBN
% 0.23/0.28 % partial match(2): HGUNF-FFSF22-SHSSMMBN
% 0.23/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.28 % SubtermCWHack with pid 122283 completed with status 0
% 0.23/0.28 % Result found by SubtermCWHack
% 0.23/0.28 % Preprocessing class: HSSSSMSSSLMNHSA.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.28 % Starting sh5l with 300s (1) cores
% 0.23/0.28 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.28 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.28 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.28 % Search class: HGUSF-FFSF22-SHSFMMBN
% 0.23/0.28 % partial match(2): HGUNF-FFSF22-SHSSMMBN
% 0.23/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.28 % Preprocessing time : 0.001 s
% 0.23/0.28
% 0.23/0.28 % Proof found!
% 0.23/0.28 % SZS status Theorem
% 0.23/0.28 % SZS output start CNFRefutation
% See solution above
% 0.23/0.28 % Parsed axioms : 11
% 0.23/0.28 % Removed by relevancy pruning/SinE : 8
% 0.23/0.28 % Initial clauses : 9
% 0.23/0.28 % Removed in clause preprocessing : 0
% 0.23/0.28 % Initial clauses in saturation : 9
% 0.23/0.28 % Processed clauses : 21
% 0.23/0.28 % ...of these trivial : 0
% 0.23/0.28 % ...subsumed : 0
% 0.23/0.28 % ...remaining for further processing : 21
% 0.23/0.28 % Other redundant clauses eliminated : 0
% 0.23/0.28 % Clauses deleted for lack of memory : 0
% 0.23/0.28 % Backward-subsumed : 0
% 0.23/0.28 % Backward-rewritten : 2
% 0.23/0.28 % Generated clauses : 27
% 0.23/0.28 % ...of the previous two non-redundant : 24
% 0.23/0.28 % ...aggressively subsumed : 0
% 0.23/0.28 % Contextual simplify-reflections : 0
% 0.23/0.28 % Paramodulations : 27
% 0.23/0.28 % Factorizations : 0
% 0.23/0.28 % NegExts : 0
% 0.23/0.28 % Equation resolutions : 0
% 0.23/0.28 % Disequality decompositions : 0
% 0.23/0.28 % Total rewrite steps : 14
% 0.23/0.28 % ...of those cached : 10
% 0.23/0.28 % Propositional unsat checks : 0
% 0.23/0.28 % Propositional check models : 0
% 0.23/0.28 % Propositional check unsatisfiable : 0
% 0.23/0.28 % Propositional clauses : 0
% 0.23/0.28 % Propositional clauses after purity: 0
% 0.23/0.28 % Propositional unsat core size : 0
% 0.23/0.28 % Propositional preprocessing time : 0.000
% 0.23/0.28 % Propositional encoding time : 0.000
% 0.23/0.28 % Propositional solver time : 0.000
% 0.23/0.28 % Success case prop preproc time : 0.000
% 0.23/0.28 % Success case prop encoding time : 0.000
% 0.23/0.28 % Success case prop solver time : 0.000
% 0.23/0.28 % Current number of processed clauses : 19
% 0.23/0.28 % Positive orientable unit clauses : 4
% 0.23/0.28 % Positive unorientable unit clauses: 0
% 0.23/0.28 % Negative unit clauses : 1
% 0.23/0.28 % Non-unit-clauses : 14
% 0.23/0.28 % Current number of unprocessed clauses: 12
% 0.23/0.28 % ...number of literals in the above : 62
% 0.23/0.28 % Current number of archived formulas : 0
% 0.23/0.28 % Current number of archived clauses : 2
% 0.23/0.28 % Clause-clause subsumption calls (NU) : 8
% 0.23/0.28 % Rec. Clause-clause subsumption calls : 4
% 0.23/0.28 % Non-unit clause-clause subsumptions : 0
% 0.23/0.28 % Unit Clause-clause subsumption calls : 0
% 0.23/0.28 % Rewrite failures with RHS unbound : 0
% 0.23/0.28 % BW rewrite match attempts : 2
% 0.23/0.28 % BW rewrite match successes : 2
% 0.23/0.28 % Condensation attempts : 0
% 0.23/0.28 % Condensation successes : 0
% 0.23/0.28 % Termbank termtop insertions : 1977
% 0.23/0.28 % Search garbage collected termcells : 462
% 0.23/0.28
% 0.23/0.28 % -------------------------------------------------
% 0.23/0.28 % User time : 0.006 s
% 0.23/0.28 % System time : 0.002 s
% 0.23/0.28 % Total time : 0.008 s
% 0.23/0.28 % Maximum resident set size: 3636 pages
% 0.23/0.28
% 0.23/0.28 % -------------------------------------------------
% 0.23/0.28 % User time : 0.007 s
% 0.23/0.28 % System time : 0.008 s
% 0.23/0.28 % Total time : 0.015 s
% 0.23/0.28 % Maximum resident set size: 4864 pages
% 0.23/0.28 % E exiting
%------------------------------------------------------------------------------