%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC153+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:43:14 PM UTC 2026
% Result : Theorem 0.16s 5.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 34 ( 17 unt; 0 def)
% Number of atoms : 215 ( 29 equ)
% Maximal formula atoms : 48 ( 6 avg)
% Number of connectives : 283 ( 102 ~; 96 |; 52 &)
% ( 0 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 40 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ! [X15] :
( ssList(X15)
=> ( ( leq(X11,X12)
& ! [X16] :
( ssItem(X16)
=> ( ( leq(X11,X16)
& leq(X16,X12) )
| ~ memberP(X14,X16) ) ) )
| ~ leq(X12,X11)
| app(app(app(app(X13,cons(X11,nil)),X14),cons(X12,nil)),X15) != X1 ) ) ) ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( ( ? [X10] :
( ( ~ leq(X10,X6)
| ~ leq(X5,X10) )
& memberP(X8,X10)
& ssItem(X10) )
| ~ leq(X5,X6) )
& leq(X6,X5)
& app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) = X3
& ssList(X9) )
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
& ssItem(X5) )
| X3 != X1
| X4 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax29,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( ( leq(X2,X1)
& leq(X1,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax29) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ! [X15] :
( ssList(X15)
=> ( ( leq(X11,X12)
& ! [X16] :
( ssItem(X16)
=> ( ( leq(X11,X16)
& leq(X16,X12) )
| ~ memberP(X14,X16) ) ) )
| ~ leq(X12,X11)
| app(app(app(app(X13,cons(X11,nil)),X14),cons(X12,nil)),X15) != X1 ) ) ) ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( ( ? [X10] :
( ( ~ leq(X10,X6)
| ~ leq(X5,X10) )
& memberP(X8,X10)
& ssItem(X10) )
| ~ leq(X5,X6) )
& leq(X6,X5)
& app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) = X3
& ssList(X9) )
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
& ssItem(X5) )
| X3 != X1
| X4 != X2 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ! [X15] :
( ssList(X15)
=> ( ( leq(X11,X12)
& ! [X16] :
( ssItem(X16)
=> ( ( leq(X11,X16)
& leq(X16,X12) )
| ~ memberP(X14,X16) ) ) )
| ~ leq(X12,X11)
| app(app(app(app(X13,cons(X11,nil)),X14),cons(X12,nil)),X15) != X1 ) ) ) ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( ( ? [X10] :
( ( ~ leq(X10,X6)
| ~ leq(X5,X10) )
& memberP(X8,X10)
& ssItem(X10) )
| ~ leq(X5,X6) )
& leq(X6,X5)
& app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) = X3
& ssList(X9) )
& ssList(X8) )
& ssList(X7) )
& ssItem(X6) )
& ssItem(X5) )
| X3 != X1
| X4 != X2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_4,negated_conjecture,
! [X21,X22,X23,X24,X25,X26] :
( ( ~ leq(esk5_0,esk6_0)
| ~ leq(esk5_0,esk10_0)
| ~ leq(esk10_0,esk6_0) )
& ( ~ leq(esk5_0,esk6_0)
| memberP(esk8_0,esk10_0) )
& ( ~ leq(esk5_0,esk6_0)
| ssItem(esk10_0) )
& leq(esk6_0,esk5_0)
& app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0
& ssList(esk9_0)
& ssList(esk8_0)
& ssList(esk7_0)
& ssItem(esk6_0)
& ssItem(esk5_0)
& ( ~ ssItem(X21)
| ~ ssItem(X22)
| ~ ssList(X23)
| ~ ssList(X24)
| ~ leq(X22,X21)
| app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25) != esk3_0
| ~ ssList(X25)
| ~ memberP(X24,X26)
| ~ ssItem(X26)
| leq(X26,X22) )
& ( ~ ssItem(X21)
| ~ ssItem(X22)
| ~ ssList(X23)
| ~ ssList(X24)
| ~ leq(X22,X21)
| app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25) != esk3_0
| ~ ssList(X25)
| ~ memberP(X24,X26)
| ~ ssItem(X26)
| leq(X21,X26) )
& ( ~ ssItem(X21)
| ~ ssItem(X22)
| ~ ssList(X23)
| ~ ssList(X24)
| ~ leq(X22,X21)
| app(app(app(app(X23,cons(X21,nil)),X24),cons(X22,nil)),X25) != esk3_0
| ~ ssList(X25)
| leq(X21,X22) )
& esk3_0 = esk1_0
& esk4_0 = esk2_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_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_3])])])])])]) ).
fof(c_0_5,plain,
! [X33,X34] :
( X33 = X34
| ~ leq(X34,X33)
| ~ leq(X33,X34)
| ~ ssItem(X34)
| ~ ssItem(X33) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])])])]) ).
cnf(c_0_6,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
esk3_0 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
leq(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ leq(X2,X1)
| app(app(app(app(X4,cons(X1,nil)),X5),cons(X2,nil)),X3) != esk3_0
| ~ ssList(X3)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk3_0,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( ~ leq(esk5_0,esk6_0)
| esk6_0 = esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_18,negated_conjecture,
leq(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]),c_0_14]),c_0_15]),c_0_16]),c_0_10]),c_0_11])]) ).
cnf(c_0_19,negated_conjecture,
esk6_0 = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssItem(X6)
| ~ ssItem(X2)
| ~ ssList(X5)
| ~ ssList(X3)
| ~ leq(X2,X6)
| app(app(app(app(X5,cons(X6,nil)),X3),cons(X2,nil)),X4) != esk3_0
| ~ ssList(X4)
| ~ memberP(X3,X1)
| ~ ssItem(X1)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
leq(esk5_0,esk5_0),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( ~ leq(esk5_0,esk6_0)
| memberP(esk8_0,esk10_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( ~ leq(esk5_0,esk6_0)
| ssItem(esk10_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_24,negated_conjecture,
( ~ leq(esk5_0,esk6_0)
| ~ leq(esk5_0,esk10_0)
| ~ leq(esk10_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk8_0,X1)
| leq(X1,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_19]),c_0_19]),c_0_21]),c_0_15]),c_0_16]),c_0_14]),c_0_11]),c_0_19]),c_0_11])]) ).
cnf(c_0_26,negated_conjecture,
memberP(esk8_0,esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_18])]) ).
cnf(c_0_27,negated_conjecture,
ssItem(esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_18])]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X6)
| ~ ssList(X5)
| ~ ssList(X3)
| ~ leq(X6,X1)
| app(app(app(app(X5,cons(X1,nil)),X3),cons(X6,nil)),X4) != esk3_0
| ~ ssList(X4)
| ~ memberP(X3,X2)
| ~ ssItem(X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_29,negated_conjecture,
( ~ leq(esk10_0,esk5_0)
| ~ leq(esk5_0,esk10_0) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_18])]),c_0_19]) ).
cnf(c_0_30,negated_conjecture,
leq(esk10_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk8_0,X1)
| leq(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_13]),c_0_19]),c_0_21]),c_0_15]),c_0_16]),c_0_14]),c_0_19]),c_0_11]),c_0_11])]) ).
cnf(c_0_32,negated_conjecture,
~ leq(esk5_0,esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_27])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC153+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n015.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 08:03:44 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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.16/5.47 % Version: 3.5.1
% 0.16/5.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.47 % Starting sh5l with 300s (1) cores
% 0.16/5.47 % new_bool_3 with pid 988934 completed with status 0
% 0.16/5.47 % Result found by new_bool_3
% 0.16/5.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/5.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.47 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.47 % SubtermCWHack with pid 988937 completed with status 0
% 0.16/5.47 % Result found by SubtermCWHack
% 0.16/5.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/5.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.47 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.47 % Preprocessing time : 0.002 s
% 0.16/5.47
% 0.16/5.47 % Proof found!
% 0.16/5.47 % SZS status Theorem
% 0.16/5.47 % SZS output start CNFRefutation
% See solution above
% 0.16/5.47 % Parsed axioms : 96
% 0.16/5.47 % Removed by relevancy pruning/SinE : 66
% 0.16/5.47 % Initial clauses : 64
% 0.16/5.47 % Removed in clause preprocessing : 0
% 0.16/5.47 % Initial clauses in saturation : 64
% 0.16/5.47 % Processed clauses : 179
% 0.16/5.47 % ...of these trivial : 1
% 0.16/5.47 % ...subsumed : 61
% 0.16/5.47 % ...remaining for further processing : 117
% 0.16/5.47 % Other redundant clauses eliminated : 15
% 0.16/5.47 % Clauses deleted for lack of memory : 0
% 0.16/5.47 % Backward-subsumed : 0
% 0.16/5.47 % Backward-rewritten : 22
% 0.16/5.47 % Generated clauses : 389
% 0.16/5.47 % ...of the previous two non-redundant : 310
% 0.16/5.47 % ...aggressively subsumed : 0
% 0.16/5.47 % Contextual simplify-reflections : 9
% 0.16/5.47 % Paramodulations : 371
% 0.16/5.47 % Factorizations : 0
% 0.16/5.47 % NegExts : 0
% 0.16/5.47 % Equation resolutions : 19
% 0.16/5.47 % Disequality decompositions : 0
% 0.16/5.47 % Total rewrite steps : 306
% 0.16/5.47 % ...of those cached : 289
% 0.16/5.47 % Propositional unsat checks : 0
% 0.16/5.47 % Propositional check models : 0
% 0.16/5.47 % Propositional check unsatisfiable : 0
% 0.16/5.47 % Propositional clauses : 0
% 0.16/5.47 % Propositional clauses after purity: 0
% 0.16/5.47 % Propositional unsat core size : 0
% 0.16/5.47 % Propositional preprocessing time : 0.000
% 0.16/5.47 % Propositional encoding time : 0.000
% 0.16/5.47 % Propositional solver time : 0.000
% 0.16/5.47 % Success case prop preproc time : 0.000
% 0.16/5.47 % Success case prop encoding time : 0.000
% 0.16/5.47 % Success case prop solver time : 0.000
% 0.16/5.47 % Current number of processed clauses : 91
% 0.16/5.47 % Positive orientable unit clauses : 18
% 0.16/5.47 % Positive unorientable unit clauses: 0
% 0.16/5.47 % Negative unit clauses : 4
% 0.16/5.47 % Non-unit-clauses : 69
% 0.16/5.47 % Current number of unprocessed clauses: 190
% 0.16/5.47 % ...number of literals in the above : 1216
% 0.16/5.47 % Current number of archived formulas : 0
% 0.16/5.47 % Current number of archived clauses : 22
% 0.16/5.47 % Clause-clause subsumption calls (NU) : 1263
% 0.16/5.47 % Rec. Clause-clause subsumption calls : 327
% 0.16/5.47 % Non-unit clause-clause subsumptions : 64
% 0.16/5.47 % Unit Clause-clause subsumption calls : 87
% 0.16/5.47 % Rewrite failures with RHS unbound : 0
% 0.16/5.47 % BW rewrite match attempts : 5
% 0.16/5.47 % BW rewrite match successes : 5
% 0.16/5.47 % Condensation attempts : 0
% 0.16/5.47 % Condensation successes : 0
% 0.16/5.47 % Termbank termtop insertions : 13758
% 0.16/5.47 % Search garbage collected termcells : 1978
% 0.16/5.47
% 0.16/5.47 % -------------------------------------------------
% 0.16/5.47 % User time : 0.020 s
% 0.16/5.47 % System time : 0.004 s
% 0.16/5.47 % Total time : 0.024 s
% 0.16/5.47 % Maximum resident set size: 3772 pages
% 0.16/5.47
% 0.16/5.47 % -------------------------------------------------
% 0.16/5.47 % User time : 0.024 s
% 0.16/5.47 % System time : 0.008 s
% 0.16/5.47 % Total time : 0.032 s
% 0.16/5.47 % Maximum resident set size: 4608 pages
% 0.16/5.47 % E exiting
%------------------------------------------------------------------------------