%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC165-1 : TPTP v9.3.1. Released v2.4.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 : Thu Sep 24 02:43:17 PM UTC 2026
% Result : Unsatisfiable 0.30s 0.78s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 21
% Syntax : Number of clauses : 70 ( 26 unt; 8 nHn; 70 RR)
% Number of literals : 177 ( 53 equ; 112 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause102,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_11,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause65,axiom,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause65) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_23,negated_conjecture,
( nil = sk3
| cons(sk9,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_23) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| ssItem(sk9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_21,negated_conjecture,
~ neq(sk5,sk6),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_22,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_24,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_25,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_26,negated_conjecture,
~ neq(sk5,sk6),
c_0_21 ).
cnf(c_0_27,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_29,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_23 ).
cnf(c_0_31,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_33,negated_conjecture,
sk6 = sk5,
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(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(app(app(sk7,cons(sk5,nil)),cons(sk5,nil)))
| sk3 != nil
| app(app(sk7,cons(sk5,nil)),cons(sk5,nil)) = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]),c_0_33]) ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_34 ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| sk3 != nil
| app(app(sk7,cons(sk5,nil)),cons(sk5,nil)) = nil ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| sk3 != nil
| cons(sk5,nil) = nil ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_43,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_44,plain,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause65]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk3 != nil
| cons(sk5,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_41])]) ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_42 ).
cnf(c_0_48,axiom,
ssList(nil),
clause8 ).
cnf(c_0_49,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_50,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_43 ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_52,plain,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
c_0_44 ).
cnf(c_0_53,negated_conjecture,
( nil = sk3
| cons(sk9,nil) = sk3 ),
co1_23 ).
cnf(c_0_54,negated_conjecture,
( nil = sk3
| ssItem(sk9) ),
co1_14 ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_45 ).
cnf(c_0_56,negated_conjecture,
( sk3 != nil
| cons(sk5,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_28]),c_0_48])]) ).
cnf(c_0_57,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_49 ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_50]),c_0_33]),c_0_33]),c_0_32])]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_51 ).
cnf(c_0_60,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_61,negated_conjecture,
( duplicatefreeP(sk3)
| sk3 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_62,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_28]),c_0_48])]) ).
cnf(c_0_63,plain,
( ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(sk7,cons(sk5,nil)),cons(sk5,sk8)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_28]),c_0_32])]) ).
cnf(c_0_65,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_60,c_0_25]) ).
cnf(c_0_66,negated_conjecture,
duplicatefreeP(sk3),
inference(sr,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil))) ),
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_63,c_0_64]),c_0_28]),c_0_65]),c_0_32]),c_0_48]),c_0_41]),c_0_66])]) ).
cnf(c_0_68,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_37]),c_0_41])]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_47]),c_0_28]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC165-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n007.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 07:58:51 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.54 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
% 0.30/0.78 % Version: 3.5.1
% 0.30/0.78 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.78 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/0.78 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.78 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.78 % Starting sh5l with 300s (1) cores
% 0.30/0.78 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 594111 completed with status 0
% 0.30/0.78 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.30/0.78 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.78 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/0.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.78 % No SInE strategy applied
% 0.30/0.78 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.30/0.78 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.78 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.78 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.30/0.78 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.30/0.78 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.30/0.78 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.30/0.78 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 594118 completed with status 0
% 0.30/0.78 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.30/0.78 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.78 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/0.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.78 % No SInE strategy applied
% 0.30/0.78 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.30/0.78 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.78 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.78 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.30/0.78 % Preprocessing time : 0.006 s
% 0.30/0.78 % Presaturation interreduction done
% 0.30/0.78
% 0.30/0.78 % Proof found!
% 0.30/0.78 % SZS status Unsatisfiable
% 0.30/0.78 % SZS output start CNFRefutation
% See solution above
% 0.30/0.78 % Parsed axioms : 211
% 0.30/0.78 % Removed by relevancy pruning/SinE : 0
% 0.30/0.78 % Initial clauses : 211
% 0.30/0.78 % Removed in clause preprocessing : 0
% 0.30/0.78 % Initial clauses in saturation : 211
% 0.30/0.78 % Processed clauses : 844
% 0.30/0.78 % ...of these trivial : 34
% 0.30/0.78 % ...subsumed : 110
% 0.30/0.78 % ...remaining for further processing : 700
% 0.30/0.78 % Other redundant clauses eliminated : 79
% 0.30/0.78 % Clauses deleted for lack of memory : 0
% 0.30/0.78 % Backward-subsumed : 85
% 0.30/0.78 % Backward-rewritten : 3
% 0.30/0.78 % Generated clauses : 2419
% 0.30/0.78 % ...of the previous two non-redundant : 2146
% 0.30/0.78 % ...aggressively subsumed : 0
% 0.30/0.78 % Contextual simplify-reflections : 30
% 0.30/0.78 % Paramodulations : 2308
% 0.30/0.78 % Factorizations : 0
% 0.30/0.78 % NegExts : 0
% 0.30/0.78 % Equation resolutions : 84
% 0.30/0.78 % Disequality decompositions : 0
% 0.30/0.78 % Total rewrite steps : 2135
% 0.30/0.78 % ...of those cached : 1994
% 0.30/0.78 % Propositional unsat checks : 0
% 0.30/0.78 % Propositional check models : 0
% 0.30/0.78 % Propositional check unsatisfiable : 0
% 0.30/0.78 % Propositional clauses : 0
% 0.30/0.78 % Propositional clauses after purity: 0
% 0.30/0.78 % Propositional unsat core size : 0
% 0.30/0.78 % Propositional preprocessing time : 0.000
% 0.30/0.78 % Propositional encoding time : 0.000
% 0.30/0.78 % Propositional solver time : 0.000
% 0.30/0.78 % Success case prop preproc time : 0.000
% 0.30/0.78 % Success case prop encoding time : 0.000
% 0.30/0.78 % Success case prop solver time : 0.000
% 0.30/0.78 % Current number of processed clauses : 358
% 0.30/0.78 % Positive orientable unit clauses : 91
% 0.30/0.78 % Positive unorientable unit clauses: 0
% 0.30/0.78 % Negative unit clauses : 12
% 0.30/0.78 % Non-unit-clauses : 255
% 0.30/0.78 % Current number of unprocessed clauses: 1594
% 0.30/0.78 % ...number of literals in the above : 8320
% 0.30/0.78 % Current number of archived formulas : 0
% 0.30/0.78 % Current number of archived clauses : 319
% 0.30/0.78 % Clause-clause subsumption calls (NU) : 21490
% 0.30/0.78 % Rec. Clause-clause subsumption calls : 7144
% 0.30/0.78 % Non-unit clause-clause subsumptions : 148
% 0.30/0.78 % Unit Clause-clause subsumption calls : 1098
% 0.30/0.78 % Rewrite failures with RHS unbound : 0
% 0.30/0.78 % BW rewrite match attempts : 10
% 0.30/0.78 % BW rewrite match successes : 9
% 0.30/0.78 % Condensation attempts : 0
% 0.30/0.78 % Condensation successes : 0
% 0.30/0.78 % Termbank termtop insertions : 51738
% 0.30/0.78 % Search garbage collected termcells : 547
% 0.30/0.78
% 0.30/0.78 % -------------------------------------------------
% 0.30/0.78 % User time : 0.150 s
% 0.30/0.78 % System time : 0.012 s
% 0.30/0.78 % Total time : 0.163 s
% 0.30/0.78 % Maximum resident set size: 3820 pages
% 0.30/0.78
% 0.30/0.78 % -------------------------------------------------
% 0.30/0.78 % User time : 0.575 s
% 0.30/0.78 % System time : 0.056 s
% 0.30/0.78 % Total time : 0.631 s
% 0.30/0.78 % Maximum resident set size: 4864 pages
% 0.30/0.78 % E exiting
%------------------------------------------------------------------------------