%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC070-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 : 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:42:52 PM UTC 2026
% Result : Unsatisfiable 1.39s 0.63s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of clauses : 71 ( 19 unt; 10 nHn; 69 RR)
% Number of literals : 193 ( 44 equ; 124 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 70 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause154,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause154) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_8,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_12,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause83,axiom,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(clause84,axiom,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_7,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(co1_9,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_10,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause154]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
c_0_20 ).
cnf(c_0_27,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk3 ),
co1_12 ).
cnf(c_0_28,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause83]) ).
cnf(c_0_31,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_25 ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(X1,sk4)
| frontsegP(X1,sk3)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
c_0_30 ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_22]),c_0_24]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_39,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
c_0_32 ).
cnf(c_0_41,negated_conjecture,
( sk4 != nil
| frontsegP(nil,sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_29])]),c_0_36]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_37 ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_38 ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_45,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_39 ).
cnf(c_0_46,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
co1_9 ).
cnf(c_0_47,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_28])]),c_0_36]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_35])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_44 ).
cnf(c_0_52,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_53,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk4 ),
co1_10 ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_22]),c_0_24]) ).
cnf(c_0_55,negated_conjecture,
neq(sk3,nil),
inference(sr,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(nil,X2)
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_43]),c_0_35])]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_49 ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_50 ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X3,X2)
| ~ frontsegP(X1,X3)
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_51]),c_0_52])]) ).
cnf(c_0_60,negated_conjecture,
frontsegP(sk4,sk3),
inference(sr,[status(thm)],[c_0_53,c_0_47]) ).
cnf(c_0_61,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_28])]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| segmentP(X1,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_58]),c_0_35])]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| segmentP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_28]),c_0_29])]) ).
cnf(c_0_66,negated_conjecture,
( ~ segmentP(sk3,sk3)
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_29]),c_0_28])]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_63 ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| nil = X1 ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_28])]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_67]),c_0_28])]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC070-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n009.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 07:53:12 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 1.39/0.63 % Version: 3.5.1
% 1.39/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.39/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.39/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.39/0.63 % Starting new_bool_3 with 300s (1) cores
% 1.39/0.63 % Starting new_bool_1 with 300s (1) cores
% 1.39/0.63 % Starting sh5l with 300s (1) cores
% 1.39/0.63 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1249211 completed with status 0
% 1.39/0.63 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.39/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.39/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.39/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.39/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.39/0.63 % No SInE strategy applied
% 1.39/0.63 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.39/0.63 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.39/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.39/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.39/0.63 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.39/0.63 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.39/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.39/0.63 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 1249217 completed with status 0
% 1.39/0.63 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 1.39/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.39/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.39/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.39/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.39/0.63 % No SInE strategy applied
% 1.39/0.63 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.39/0.63 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.39/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.39/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.39/0.63 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.39/0.63 % Preprocessing time : 0.004 s
% 1.39/0.63 % Presaturation interreduction done
% 1.39/0.63
% 1.39/0.63 % Proof found!
% 1.39/0.63 % SZS status Unsatisfiable
% 1.39/0.63 % SZS output start CNFRefutation
% See solution above
% 1.39/0.63 % Parsed axioms : 197
% 1.39/0.63 % Removed by relevancy pruning/SinE : 0
% 1.39/0.63 % Initial clauses : 197
% 1.39/0.63 % Removed in clause preprocessing : 0
% 1.39/0.63 % Initial clauses in saturation : 197
% 1.39/0.63 % Processed clauses : 1411
% 1.39/0.63 % ...of these trivial : 104
% 1.39/0.63 % ...subsumed : 534
% 1.39/0.63 % ...remaining for further processing : 773
% 1.39/0.63 % Other redundant clauses eliminated : 124
% 1.39/0.63 % Clauses deleted for lack of memory : 0
% 1.39/0.63 % Backward-subsumed : 82
% 1.39/0.63 % Backward-rewritten : 28
% 1.39/0.63 % Generated clauses : 5423
% 1.39/0.63 % ...of the previous two non-redundant : 4746
% 1.39/0.63 % ...aggressively subsumed : 0
% 1.39/0.63 % Contextual simplify-reflections : 92
% 1.39/0.63 % Paramodulations : 5236
% 1.39/0.63 % Factorizations : 0
% 1.39/0.63 % NegExts : 0
% 1.39/0.63 % Equation resolutions : 148
% 1.39/0.63 % Disequality decompositions : 0
% 1.39/0.63 % Total rewrite steps : 4013
% 1.39/0.63 % ...of those cached : 3815
% 1.39/0.63 % Propositional unsat checks : 0
% 1.39/0.63 % Propositional check models : 0
% 1.39/0.63 % Propositional check unsatisfiable : 0
% 1.39/0.63 % Propositional clauses : 0
% 1.39/0.63 % Propositional clauses after purity: 0
% 1.39/0.63 % Propositional unsat core size : 0
% 1.39/0.63 % Propositional preprocessing time : 0.000
% 1.39/0.63 % Propositional encoding time : 0.000
% 1.39/0.63 % Propositional solver time : 0.000
% 1.39/0.63 % Success case prop preproc time : 0.000
% 1.39/0.63 % Success case prop encoding time : 0.000
% 1.39/0.63 % Success case prop solver time : 0.000
% 1.39/0.63 % Current number of processed clauses : 435
% 1.39/0.63 % Positive orientable unit clauses : 78
% 1.39/0.63 % Positive unorientable unit clauses: 0
% 1.39/0.63 % Negative unit clauses : 12
% 1.39/0.63 % Non-unit-clauses : 345
% 1.39/0.63 % Current number of unprocessed clauses: 3491
% 1.39/0.63 % ...number of literals in the above : 24077
% 1.39/0.63 % Current number of archived formulas : 0
% 1.39/0.63 % Current number of archived clauses : 328
% 1.39/0.63 % Clause-clause subsumption calls (NU) : 40937
% 1.39/0.63 % Rec. Clause-clause subsumption calls : 7975
% 1.39/0.63 % Non-unit clause-clause subsumptions : 557
% 1.39/0.63 % Unit Clause-clause subsumption calls : 2245
% 1.39/0.63 % Rewrite failures with RHS unbound : 0
% 1.39/0.63 % BW rewrite match attempts : 10
% 1.39/0.63 % BW rewrite match successes : 10
% 1.39/0.63 % Condensation attempts : 0
% 1.39/0.63 % Condensation successes : 0
% 1.39/0.63 % Termbank termtop insertions : 105617
% 1.39/0.63 % Search garbage collected termcells : 541
% 1.39/0.63
% 1.39/0.63 % -------------------------------------------------
% 1.39/0.63 % User time : 0.172 s
% 1.39/0.63 % System time : 0.009 s
% 1.39/0.63 % Total time : 0.181 s
% 1.39/0.63 % Maximum resident set size: 4068 pages
% 1.39/0.63
% 1.39/0.63 % -------------------------------------------------
% 1.39/0.63 % User time : 0.774 s
% 1.39/0.63 % System time : 0.059 s
% 1.39/0.63 % Total time : 0.833 s
% 1.39/0.63 % Maximum resident set size: 5120 pages
% 1.39/0.63 % E exiting
%------------------------------------------------------------------------------