%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC310-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:53 PM UTC 2026
% Result : Unsatisfiable 0.36s 0.63s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of clauses : 75 ( 20 unt; 8 nHn; 75 RR)
% Number of literals : 190 ( 78 equ; 113 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
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_14,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_7,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_12,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_13,negated_conjecture,
( ~ neq(nil,sk2)
| ~ neq(nil,sk2)
| hd(sk2) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk2) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| sk1 != X1
| ~ ssList(X1)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_20,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_22,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk6) = sk4 ),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_21 ).
cnf(c_0_27,negated_conjecture,
( ~ neq(sk2,nil)
| app(cons(sk5,nil),sk6) = sk2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_24 ).
cnf(c_0_29,negated_conjecture,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(rw,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(rw,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_32,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_35,negated_conjecture,
( ~ neq(sk2,nil)
| cons(sk5,sk6) = sk2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_41,axiom,
ssList(nil),
clause8 ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_34 ).
cnf(c_0_43,negated_conjecture,
( sk1 != nil
| cons(sk5,sk6) = sk2 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( sk1 != nil
| ssList(sk6) ),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
( sk1 != nil
| ssItem(sk5) ),
inference(spm,[status(thm)],[c_0_30,c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( sk2 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_23]) ).
cnf(c_0_47,negated_conjecture,
( neq(sk2,nil)
| nil = sk2 ),
co1_12 ).
cnf(c_0_48,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_49,negated_conjecture,
( ~ neq(nil,sk2)
| ~ neq(nil,sk2)
| hd(sk2) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk2) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| sk1 != X1
| ~ ssList(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_51,negated_conjecture,
( sk2 = nil
| cons(sk5,sk6) = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_52,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ssItem(sk5)
| sk2 = nil ),
inference(spm,[status(thm)],[c_0_30,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( ssList(sk6)
| sk2 = nil ),
inference(spm,[status(thm)],[c_0_29,c_0_47]) ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_56,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,cons(sk5,nil)) = sk3 ),
c_0_48 ).
cnf(c_0_57,negated_conjecture,
( ~ neq(nil,sk2)
| ~ neq(nil,sk2)
| hd(sk2) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk2) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| sk1 != X1
| ~ ssList(X1)
| nil = sk2 ),
c_0_49 ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_50 ).
cnf(c_0_59,negated_conjecture,
cons(sk5,sk6) = sk2,
inference(sr,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_60,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_53,c_0_52]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_54,c_0_52]) ).
cnf(c_0_62,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_55 ).
cnf(c_0_63,negated_conjecture,
( ~ neq(sk2,nil)
| app(sk6,cons(sk5,nil)) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_38]),c_0_23]) ).
cnf(c_0_64,negated_conjecture,
neq(sk2,nil),
inference(sr,[status(thm)],[c_0_47,c_0_52]) ).
cnf(c_0_65,negated_conjecture,
( ~ neq(nil,sk2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk2) != X4
| tl(sk2) != X2
| sk1 != X1
| sk2 = nil ),
inference(cn,[status(thm)],[c_0_57]) ).
cnf(c_0_66,negated_conjecture,
tl(sk2) = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]) ).
cnf(c_0_67,negated_conjecture,
hd(sk2) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_59]),c_0_60]),c_0_61])]) ).
cnf(c_0_68,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]) ).
cnf(c_0_69,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ neq(nil,sk2) ),
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(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_52])])])])]),c_0_68]),c_0_60]),c_0_61]),c_0_68]),c_0_69])]) ).
cnf(c_0_71,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_72,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_39]),c_0_41]),c_0_40])]),c_0_52]) ).
cnf(c_0_73,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_71 ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_60]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC310-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.19/0.46 % Computer : n007.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 08:12:36 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 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.36/0.63 % Version: 3.5.1
% 0.36/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.36/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.36/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.36/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.36/0.63 % Starting sh5l with 300s (1) cores
% 0.36/0.63 % new_bool_1 with pid 617940 completed with status 0
% 0.36/0.63 % Result found by new_bool_1
% 0.36/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.36/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.36/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.36/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.36/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.36/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.63 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.36/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.36/0.63 % SubtermCWHack with pid 617942 completed with status 0
% 0.36/0.63 % Result found by SubtermCWHack
% 0.36/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.36/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.36/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.36/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.36/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.36/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.63 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.36/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.36/0.63 % Preprocessing time : 0.003 s
% 0.36/0.63
% 0.36/0.63 % Proof found!
% 0.36/0.63 % SZS status Unsatisfiable
% 0.36/0.63 % SZS output start CNFRefutation
% See solution above
% 0.36/0.63 % Parsed axioms : 200
% 0.36/0.63 % Removed by relevancy pruning/SinE : 129
% 0.36/0.63 % Initial clauses : 71
% 0.36/0.63 % Removed in clause preprocessing : 0
% 0.36/0.63 % Initial clauses in saturation : 71
% 0.36/0.63 % Processed clauses : 211
% 0.36/0.63 % ...of these trivial : 3
% 0.36/0.63 % ...subsumed : 52
% 0.36/0.63 % ...remaining for further processing : 156
% 0.36/0.63 % Other redundant clauses eliminated : 23
% 0.36/0.63 % Clauses deleted for lack of memory : 0
% 0.36/0.63 % Backward-subsumed : 36
% 0.36/0.63 % Backward-rewritten : 10
% 0.36/0.63 % Generated clauses : 466
% 0.36/0.63 % ...of the previous two non-redundant : 353
% 0.36/0.63 % ...aggressively subsumed : 0
% 0.36/0.63 % Contextual simplify-reflections : 9
% 0.36/0.63 % Paramodulations : 438
% 0.36/0.63 % Factorizations : 0
% 0.36/0.63 % NegExts : 0
% 0.36/0.63 % Equation resolutions : 28
% 0.36/0.63 % Disequality decompositions : 0
% 0.36/0.63 % Total rewrite steps : 437
% 0.36/0.63 % ...of those cached : 420
% 0.36/0.63 % Propositional unsat checks : 0
% 0.36/0.63 % Propositional check models : 0
% 0.36/0.63 % Propositional check unsatisfiable : 0
% 0.36/0.63 % Propositional clauses : 0
% 0.36/0.63 % Propositional clauses after purity: 0
% 0.36/0.63 % Propositional unsat core size : 0
% 0.36/0.63 % Propositional preprocessing time : 0.000
% 0.36/0.63 % Propositional encoding time : 0.000
% 0.36/0.63 % Propositional solver time : 0.000
% 0.36/0.63 % Success case prop preproc time : 0.000
% 0.36/0.63 % Success case prop encoding time : 0.000
% 0.36/0.63 % Success case prop solver time : 0.000
% 0.36/0.63 % Current number of processed clauses : 99
% 0.36/0.63 % Positive orientable unit clauses : 19
% 0.36/0.63 % Positive unorientable unit clauses: 0
% 0.36/0.63 % Negative unit clauses : 5
% 0.36/0.63 % Non-unit-clauses : 75
% 0.36/0.63 % Current number of unprocessed clauses: 188
% 0.36/0.63 % ...number of literals in the above : 1031
% 0.36/0.63 % Current number of archived formulas : 0
% 0.36/0.63 % Current number of archived clauses : 50
% 0.36/0.63 % Clause-clause subsumption calls (NU) : 1827
% 0.36/0.63 % Rec. Clause-clause subsumption calls : 574
% 0.36/0.63 % Non-unit clause-clause subsumptions : 51
% 0.36/0.63 % Unit Clause-clause subsumption calls : 105
% 0.36/0.63 % Rewrite failures with RHS unbound : 0
% 0.36/0.63 % BW rewrite match attempts : 7
% 0.36/0.63 % BW rewrite match successes : 7
% 0.36/0.63 % Condensation attempts : 0
% 0.36/0.63 % Condensation successes : 0
% 0.36/0.63 % Termbank termtop insertions : 11526
% 0.36/0.63 % Search garbage collected termcells : 886
% 0.36/0.63
% 0.36/0.63 % -------------------------------------------------
% 0.36/0.63 % User time : 0.020 s
% 0.36/0.63 % System time : 0.004 s
% 0.36/0.63 % Total time : 0.025 s
% 0.36/0.63 % Maximum resident set size: 4072 pages
% 0.36/0.63
% 0.36/0.63 % -------------------------------------------------
% 0.36/0.63 % User time : 0.030 s
% 0.36/0.63 % System time : 0.009 s
% 0.36/0.63 % Total time : 0.039 s
% 0.36/0.63 % Maximum resident set size: 5120 pages
% 0.36/0.63 % E exiting
%------------------------------------------------------------------------------