%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET741^4 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:22:18 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 82 ( 64 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 258 ( 14 ~; 9 |; 14 &; 212 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 80 ( 10 ^; 63 !; 7 ?; 80 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
fun_composition: ( $i > $i ) > ( $i > $i ) > $i > $i ).
thf(decl_26,type,
fun_injective: ( $i > $i ) > $o ).
thf(decl_27,type,
fun_surjective: ( $i > $i ) > $o ).
thf(decl_28,type,
fun_bijective: ( $i > $i ) > $o ).
thf(decl_31,type,
esk1_0: $i > $i ).
thf(decl_32,type,
esk2_0: $i > $i ).
thf(decl_33,type,
esk3_0: $i > $i ).
thf(decl_34,type,
esk4_1: $i > $i ).
thf(decl_35,type,
esk5_1: $i > $i ).
thf(decl_36,type,
esk6_0: $i ).
thf(decl_37,type,
esk7_0: $i ).
thf(decl_38,type,
esk8_0: $i ).
thf(fun_bijective,axiom,
( fun_bijective
= ( ^ [X1: $i > $i] :
( ( fun_injective @ X1 )
& ( fun_surjective @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Ynz6jos8ET/E---3.1_3372985.p',fun_bijective) ).
thf(fun_injective,axiom,
( fun_injective
= ( ^ [X1: $i > $i] :
! [X4: $i,X3: $i] :
( ( ( X1 @ X4 )
= ( X1 @ X3 ) )
=> ( X4 = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Ynz6jos8ET/E---3.1_3372985.p',fun_injective) ).
thf(fun_surjective,axiom,
( fun_surjective
= ( ^ [X1: $i > $i] :
! [X3: $i] :
? [X4: $i] :
( X3
= ( X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Ynz6jos8ET/E---3.1_3372985.p',fun_surjective) ).
thf(thm,conjecture,
! [X1: $i > $i,X5: $i > $i,X8: $i > $i] :
( ( ( fun_injective @ ( fun_composition @ ( fun_composition @ X1 @ X5 ) @ X8 ) )
& ( fun_surjective @ ( fun_composition @ ( fun_composition @ X5 @ X8 ) @ X1 ) )
& ( fun_surjective @ ( fun_composition @ ( fun_composition @ X8 @ X1 ) @ X5 ) ) )
=> ( fun_bijective @ X8 ) ),
file('/export/starexec/sandbox/tmp/tmp.Ynz6jos8ET/E---3.1_3372985.p',thm) ).
thf(fun_composition,axiom,
( fun_composition
= ( ^ [X1: $i > $i,X5: $i > $i,X4: $i] : ( X5 @ ( X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Ynz6jos8ET/E---3.1_3372985.p',fun_composition) ).
thf(c_0_5,plain,
( fun_bijective
= ( ^ [Z0: $i > $i] :
( ! [X12: $i,X13: $i] :
( ( ( Z0 @ X12 )
= ( Z0 @ X13 ) )
=> ( X12 = X13 ) )
& ! [X14: $i] :
? [X15: $i] :
( X14
= ( Z0 @ X15 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[fun_bijective]) ).
thf(c_0_6,plain,
( fun_injective
= ( ^ [Z0: $i > $i] :
! [X4: $i,X3: $i] :
( ( ( Z0 @ X4 )
= ( Z0 @ X3 ) )
=> ( X4 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[fun_injective]) ).
thf(c_0_7,plain,
( fun_surjective
= ( ^ [Z0: $i > $i] :
! [X3: $i] :
? [X4: $i] :
( X3
= ( Z0 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[fun_surjective]) ).
thf(c_0_8,negated_conjecture,
~ ! [X1: $i > $i,X5: $i > $i,X8: $i > $i] :
( ( ( fun_injective @ ( fun_composition @ ( fun_composition @ X1 @ X5 ) @ X8 ) )
& ( fun_surjective @ ( fun_composition @ ( fun_composition @ X5 @ X8 ) @ X1 ) )
& ( fun_surjective @ ( fun_composition @ ( fun_composition @ X8 @ X1 ) @ X5 ) ) )
=> ( fun_bijective @ X8 ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_9,plain,
( fun_bijective
= ( ^ [Z0: $i > $i] :
( ! [X12: $i,X13: $i] :
( ( ( Z0 @ X12 )
= ( Z0 @ X13 ) )
=> ( X12 = X13 ) )
& ! [X14: $i] :
? [X15: $i] :
( X14
= ( Z0 @ X15 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
~ ! [X1: $i > $i,X5: $i > $i,X8: $i > $i] :
( ( ! [X16: $i,X17: $i] :
( ( ( fun_composition @ ( fun_composition @ X1 @ X5 ) @ X8 @ X16 )
= ( fun_composition @ ( fun_composition @ X1 @ X5 ) @ X8 @ X17 ) )
=> ( X16 = X17 ) )
& ! [X18: $i] :
? [X19: $i] :
( X18
= ( fun_composition @ ( fun_composition @ X5 @ X8 ) @ X1 @ X19 ) )
& ! [X20: $i] :
? [X21: $i] :
( X20
= ( fun_composition @ ( fun_composition @ X8 @ X1 ) @ X5 @ X21 ) ) )
=> ( ! [X22: $i,X23: $i] :
( ( ( X8 @ X22 )
= ( X8 @ X23 ) )
=> ( X22 = X23 ) )
& ! [X24: $i] :
? [X25: $i] :
( X24
= ( X8 @ X25 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,c_0_6]),c_0_7]),c_0_9]) ).
thf(c_0_11,plain,
! [X26: $i > $i,X27: $i > $i,X28: $i] :
( ( fun_composition @ X26 @ X27 @ X28 )
= ( X27 @ ( X26 @ X28 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fun_composition])]) ).
thf(c_0_12,negated_conjecture,
! [X35: $i,X36: $i,X37: $i,X39: $i,X44: $i] :
( ( ( ( fun_composition @ ( fun_composition @ esk1_0 @ esk2_0 ) @ esk3_0 @ X35 )
!= ( fun_composition @ ( fun_composition @ esk1_0 @ esk2_0 ) @ esk3_0 @ X36 ) )
| ( X35 = X36 ) )
& ( X37
= ( fun_composition @ ( fun_composition @ esk2_0 @ esk3_0 ) @ esk1_0 @ ( esk4_1 @ X37 ) ) )
& ( X39
= ( fun_composition @ ( fun_composition @ esk3_0 @ esk1_0 ) @ esk2_0 @ ( esk5_1 @ X39 ) ) )
& ( ( ( esk3_0 @ esk6_0 )
= ( esk3_0 @ esk7_0 ) )
| ( esk8_0
!= ( esk3_0 @ X44 ) ) )
& ( ( esk6_0 != esk7_0 )
| ( esk8_0
!= ( esk3_0 @ X44 ) ) ) ),
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_10])])])])])]) ).
thf(c_0_13,plain,
! [X29: $i > $i,X30: $i > $i,X31: $i] :
( ( fun_composition @ X29 @ X30 @ X31 )
= ( X30 @ ( X29 @ X31 ) ) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i,X4: $i] :
( ( X3 = X4 )
| ( ( fun_composition @ ( fun_composition @ esk1_0 @ esk2_0 ) @ esk3_0 @ X3 )
!= ( fun_composition @ ( fun_composition @ esk1_0 @ esk2_0 ) @ esk3_0 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,plain,
! [X1: $i > $i,X5: $i > $i,X3: $i] :
( ( fun_composition @ X1 @ X5 @ X3 )
= ( X5 @ ( X1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i] :
( X3
= ( fun_composition @ ( fun_composition @ esk3_0 @ esk1_0 ) @ esk2_0 @ ( esk5_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i] :
( X3
= ( fun_composition @ ( fun_composition @ esk2_0 @ esk3_0 ) @ esk1_0 @ ( esk4_1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,negated_conjecture,
! [X3: $i,X4: $i] :
( ( X3 = X4 )
| ( ( esk3_0 @ ( esk2_0 @ ( esk1_0 @ X3 ) ) )
!= ( esk3_0 @ ( esk2_0 @ ( esk1_0 @ X4 ) ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15]),c_0_15]) ).
thf(c_0_19,negated_conjecture,
! [X3: $i] :
( ( esk2_0 @ ( esk1_0 @ ( esk3_0 @ ( esk5_1 @ X3 ) ) ) )
= X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15]),c_0_15]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i] :
( ( esk1_0 @ ( esk3_0 @ ( esk2_0 @ ( esk4_1 @ X3 ) ) ) )
= X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15]),c_0_15]) ).
thf(c_0_21,negated_conjecture,
! [X3: $i,X4: $i] :
( ( X3
= ( esk3_0 @ ( esk5_1 @ X4 ) ) )
| ( ( esk3_0 @ ( esk2_0 @ ( esk1_0 @ X3 ) ) )
!= ( esk3_0 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i,X4: $i] :
( ( X3
= ( esk3_0 @ ( esk2_0 @ ( esk4_1 @ X4 ) ) ) )
| ( ( esk3_0 @ ( esk2_0 @ ( esk1_0 @ X3 ) ) )
!= ( esk3_0 @ ( esk2_0 @ X4 ) ) ) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i] :
( ( esk3_0 @ ( esk5_1 @ ( esk2_0 @ ( esk1_0 @ X3 ) ) ) )
= X3 ),
inference(er,[status(thm)],[c_0_21]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i] :
( ( esk3_0 @ ( esk2_0 @ ( esk4_1 @ ( esk1_0 @ X3 ) ) ) )
= X3 ),
inference(er,[status(thm)],[c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X3: $i] :
( ( esk3_0 @ ( esk5_1 @ ( esk2_0 @ X3 ) ) )
= ( esk3_0 @ ( esk2_0 @ ( esk4_1 @ X3 ) ) ) ),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i] :
( ( esk3_0 @ ( esk2_0 @ ( esk4_1 @ ( esk4_1 @ ( esk1_0 @ ( esk3_0 @ ( esk2_0 @ ( esk1_0 @ X3 ) ) ) ) ) ) ) )
= X3 ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24])]),c_0_25]) ).
thf(c_0_27,negated_conjecture,
! [X3: $i] :
( ( esk4_1 @ ( esk1_0 @ ( esk3_0 @ ( esk2_0 @ ( esk1_0 @ X3 ) ) ) ) )
= ( esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i] :
( ( esk4_1 @ ( esk1_0 @ ( esk3_0 @ ( esk2_0 @ X3 ) ) ) )
= X3 ),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
thf(c_0_29,negated_conjecture,
! [X3: $i] :
( ( ( esk3_0 @ esk6_0 )
= ( esk3_0 @ esk7_0 ) )
| ( esk8_0
!= ( esk3_0 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i] :
( ( esk4_1 @ ( esk1_0 @ ( esk3_0 @ X3 ) ) )
= ( esk1_0 @ ( esk3_0 @ ( esk5_1 @ X3 ) ) ) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
thf(c_0_31,negated_conjecture,
( ( esk3_0 @ esk6_0 )
= ( esk3_0 @ esk7_0 ) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_23])]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i] :
( ( esk6_0 != esk7_0 )
| ( esk8_0
!= ( esk3_0 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_33,negated_conjecture,
( ( esk1_0 @ ( esk3_0 @ ( esk5_1 @ esk6_0 ) ) )
= ( esk1_0 @ ( esk3_0 @ ( esk5_1 @ esk7_0 ) ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_30]) ).
thf(c_0_34,negated_conjecture,
esk6_0 != esk7_0,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_23])]) ).
thf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_33]),c_0_19]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET741^4 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n007.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 13:38:55 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Ynz6jos8ET/E---3.1_3372985.p
% 0.09/0.26 % Version: 3.5.1-ho
% 0.09/0.26 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26 % Starting sh1l with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.26 % post_as_ho10 with pid 3373001 completed with status 0
% 0.09/0.26 % Result found by post_as_ho10
% 0.09/0.26 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26 % Starting sh1l with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HHHPS-FFSF31-SHSSMSNN
% 0.09/0.26 % partial match(3): HHHNS-FFSF11-SHSSMFNN
% 0.09/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26 % SubtermCWHack with pid 3373002 completed with status 0
% 0.09/0.26 % Result found by SubtermCWHack
% 0.09/0.26 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26 % Starting sh1l with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HHHPS-FFSF31-SHSSMSNN
% 0.09/0.26 % partial match(3): HHHNS-FFSF11-SHSSMFNN
% 0.09/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26 % Preprocessing time : 0.001 s
% 0.09/0.26
% 0.09/0.26 % Proof found!
% 0.09/0.26 % SZS status Theorem
% 0.09/0.26 % SZS output start CNFRefutation
% See solution above
% 0.09/0.26 % Parsed axioms : 17
% 0.09/0.26 % Removed by relevancy pruning/SinE : 0
% 0.09/0.26 % Initial clauses : 14
% 0.09/0.26 % Removed in clause preprocessing : 8
% 0.09/0.26 % Initial clauses in saturation : 6
% 0.09/0.26 % Processed clauses : 18
% 0.09/0.26 % ...of these trivial : 0
% 0.09/0.26 % ...subsumed : 0
% 0.09/0.26 % ...remaining for further processing : 18
% 0.09/0.26 % Other redundant clauses eliminated : 7
% 0.09/0.26 % Clauses deleted for lack of memory : 0
% 0.09/0.26 % Backward-subsumed : 1
% 0.09/0.26 % Backward-rewritten : 4
% 0.09/0.26 % Generated clauses : 55
% 0.09/0.26 % ...of the previous two non-redundant : 35
% 0.09/0.26 % ...aggressively subsumed : 0
% 0.09/0.26 % Contextual simplify-reflections : 0
% 0.09/0.26 % Paramodulations : 45
% 0.09/0.26 % Factorizations : 0
% 0.09/0.26 % NegExts : 0
% 0.09/0.26 % Equation resolutions : 10
% 0.09/0.26 % Disequality decompositions : 0
% 0.09/0.26 % Total rewrite steps : 48
% 0.09/0.26 % ...of those cached : 21
% 0.09/0.26 % Propositional unsat checks : 0
% 0.09/0.26 % Propositional check models : 0
% 0.09/0.26 % Propositional check unsatisfiable : 0
% 0.09/0.26 % Propositional clauses : 0
% 0.09/0.26 % Propositional clauses after purity: 0
% 0.09/0.26 % Propositional unsat core size : 0
% 0.09/0.26 % Propositional preprocessing time : 0.000
% 0.09/0.26 % Propositional encoding time : 0.000
% 0.09/0.26 % Propositional solver time : 0.000
% 0.09/0.26 % Success case prop preproc time : 0.000
% 0.09/0.26 % Success case prop encoding time : 0.000
% 0.09/0.26 % Success case prop solver time : 0.000
% 0.09/0.26 % Current number of processed clauses : 13
% 0.09/0.26 % Positive orientable unit clauses : 9
% 0.09/0.26 % Positive unorientable unit clauses: 0
% 0.09/0.26 % Negative unit clauses : 1
% 0.09/0.26 % Non-unit-clauses : 3
% 0.09/0.26 % Current number of unprocessed clauses: 14
% 0.09/0.26 % ...number of literals in the above : 22
% 0.09/0.26 % Current number of archived formulas : 0
% 0.09/0.26 % Current number of archived clauses : 5
% 0.09/0.26 % Clause-clause subsumption calls (NU) : 1
% 0.09/0.26 % Rec. Clause-clause subsumption calls : 1
% 0.09/0.26 % Non-unit clause-clause subsumptions : 0
% 0.09/0.26 % Unit Clause-clause subsumption calls : 1
% 0.09/0.26 % Rewrite failures with RHS unbound : 0
% 0.09/0.26 % BW rewrite match attempts : 10
% 0.09/0.26 % BW rewrite match successes : 4
% 0.09/0.26 % Condensation attempts : 0
% 0.09/0.26 % Condensation successes : 0
% 0.09/0.26 % Termbank termtop insertions : 1772
% 0.09/0.26 % Search garbage collected termcells : 265
% 0.09/0.26
% 0.09/0.26 % -------------------------------------------------
% 0.09/0.26 % User time : 0.003 s
% 0.09/0.26 % System time : 0.003 s
% 0.09/0.26 % Total time : 0.006 s
% 0.09/0.26 % Maximum resident set size: 3648 pages
% 0.09/0.26
% 0.09/0.26 % -------------------------------------------------
% 0.09/0.26 % User time : 0.003 s
% 0.09/0.26 % System time : 0.010 s
% 0.09/0.26 % Total time : 0.013 s
% 0.09/0.26 % Maximum resident set size: 4864 pages
% 0.09/0.26 % E exiting
%------------------------------------------------------------------------------