TSTP Solution File: CSR084+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR084+4 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:32:19 EDT 2024
% Result : Theorem 26.00s 5.50s
% Output : CNFRefutation 26.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 17 unt; 0 def)
% Number of atoms : 162 ( 25 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 187 ( 71 ~; 78 |; 26 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 89 ( 29 sgn 35 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
s__instance(s__BananaSlug10_1,s__Invertebrate),
file('/export/starexec/sandbox/tmp/tmp.K2mBCZCWV0/E---3.1_20275.p',prove_from_SUMO) ).
fof(kb_SUMO_3489,axiom,
! [X169,X170] :
( ! [X49] :
( ( s__instance(X170,s__Set)
& s__instance(X169,s__Set) )
=> ( s__element(X49,X170)
<=> s__element(X49,X169) ) )
=> X170 = X169 ),
file('/export/starexec/sandbox/tmp/tmp.K2mBCZCWV0/E---3.1_20275.p',kb_SUMO_3489) ).
fof(kb_SUMO_3496,axiom,
! [X171,X172,X173] :
( X172 = s__UnionFn(X173,X171)
<=> ! [X174,X175,X176] :
( ( s__instance(X173,s__SetOrClass)
& s__instance(X172,s__SetOrClass)
& s__instance(X171,s__SetOrClass) )
=> ( ( s__instance(X174,X173)
& s__instance(X175,X171)
& s__instance(X176,X172) )
=> ( s__instance(X174,X172)
& s__instance(X175,X172)
& ( s__instance(X176,X173)
| s__instance(X176,X171) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K2mBCZCWV0/E---3.1_20275.p',kb_SUMO_3496) ).
fof(kb_SUMO_502,axiom,
! [X26] : s__instance(X26,s__Entity),
file('/export/starexec/sandbox/tmp/tmp.K2mBCZCWV0/E---3.1_20275.p',kb_SUMO_502) ).
fof(kb_SUMO_3533,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox/tmp/tmp.K2mBCZCWV0/E---3.1_20275.p',kb_SUMO_3533) ).
fof(kb_SUMO_276,axiom,
! [X9,X10] :
( s__disjoint(X9,X10)
<=> ! [X48] :
( ( s__instance(X10,s__SetOrClass)
& s__instance(X9,s__SetOrClass) )
=> ~ ( s__instance(X48,X9)
& s__instance(X48,X10) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K2mBCZCWV0/E---3.1_20275.p',kb_SUMO_276) ).
fof(kb_SUMO_3537,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NonNullSet)
=> ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox/tmp/tmp.K2mBCZCWV0/E---3.1_20275.p',kb_SUMO_3537) ).
fof(c_0_7,negated_conjecture,
~ s__instance(s__BananaSlug10_1,s__Invertebrate),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO])]) ).
fof(c_0_8,negated_conjecture,
~ s__instance(s__BananaSlug10_1,s__Invertebrate),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X6426,X6427] :
( ( s__instance(X6427,s__Set)
| X6427 = X6426 )
& ( s__instance(X6426,s__Set)
| X6427 = X6426 )
& ( ~ s__element(esk157_2(X6426,X6427),X6427)
| ~ s__element(esk157_2(X6426,X6427),X6426)
| X6427 = X6426 )
& ( s__element(esk157_2(X6426,X6427),X6427)
| s__element(esk157_2(X6426,X6427),X6426)
| X6427 = X6426 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3489])])])])])]) ).
fof(c_0_10,plain,
! [X6429,X6430,X6431,X6432,X6433,X6434,X6435,X6436,X6437] :
( ( s__instance(X6432,X6430)
| ~ s__instance(X6432,X6431)
| ~ s__instance(X6433,X6429)
| ~ s__instance(X6434,X6430)
| ~ s__instance(X6431,s__SetOrClass)
| ~ s__instance(X6430,s__SetOrClass)
| ~ s__instance(X6429,s__SetOrClass)
| X6430 != s__UnionFn(X6431,X6429) )
& ( s__instance(X6433,X6430)
| ~ s__instance(X6432,X6431)
| ~ s__instance(X6433,X6429)
| ~ s__instance(X6434,X6430)
| ~ s__instance(X6431,s__SetOrClass)
| ~ s__instance(X6430,s__SetOrClass)
| ~ s__instance(X6429,s__SetOrClass)
| X6430 != s__UnionFn(X6431,X6429) )
& ( s__instance(X6434,X6431)
| s__instance(X6434,X6429)
| ~ s__instance(X6432,X6431)
| ~ s__instance(X6433,X6429)
| ~ s__instance(X6434,X6430)
| ~ s__instance(X6431,s__SetOrClass)
| ~ s__instance(X6430,s__SetOrClass)
| ~ s__instance(X6429,s__SetOrClass)
| X6430 != s__UnionFn(X6431,X6429) )
& ( s__instance(X6437,s__SetOrClass)
| X6436 = s__UnionFn(X6437,X6435) )
& ( s__instance(X6436,s__SetOrClass)
| X6436 = s__UnionFn(X6437,X6435) )
& ( s__instance(X6435,s__SetOrClass)
| X6436 = s__UnionFn(X6437,X6435) )
& ( s__instance(esk158_3(X6435,X6436,X6437),X6437)
| X6436 = s__UnionFn(X6437,X6435) )
& ( s__instance(esk159_3(X6435,X6436,X6437),X6435)
| X6436 = s__UnionFn(X6437,X6435) )
& ( s__instance(esk160_3(X6435,X6436,X6437),X6436)
| X6436 = s__UnionFn(X6437,X6435) )
& ( ~ s__instance(esk160_3(X6435,X6436,X6437),X6437)
| ~ s__instance(esk158_3(X6435,X6436,X6437),X6436)
| ~ s__instance(esk159_3(X6435,X6436,X6437),X6436)
| X6436 = s__UnionFn(X6437,X6435) )
& ( ~ s__instance(esk160_3(X6435,X6436,X6437),X6435)
| ~ s__instance(esk158_3(X6435,X6436,X6437),X6436)
| ~ s__instance(esk159_3(X6435,X6436,X6437),X6436)
| X6436 = s__UnionFn(X6437,X6435) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3496])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
~ s__instance(s__BananaSlug10_1,s__Invertebrate),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( s__instance(X1,s__Set)
| X2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X2330] : s__instance(X2330,s__Entity),
inference(variable_rename,[status(thm)],[kb_SUMO_502]) ).
cnf(c_0_14,plain,
( s__instance(X1,s__SetOrClass)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( s__instance(s__Invertebrate,s__Set)
| ~ s__instance(s__BananaSlug10_1,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
s__instance(X1,s__Entity),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__instance(s__BananaSlug10_1,s__UnionFn(X2,X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
s__instance(s__Invertebrate,s__Set),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,plain,
! [X6441,X6442] :
( ~ s__instance(X6441,s__SetOrClass)
| ~ s__instance(X6441,s__NullSet)
| ~ s__instance(X6442,X6441) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])])]) ).
cnf(c_0_20,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__instance(s__BananaSlug10_1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
s__instance(X1,s__Set),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_22,plain,
( ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_24,plain,
! [X1519,X1520,X1521,X1522,X1523] :
( ( ~ s__disjoint(X1519,X1520)
| ~ s__instance(X1520,s__SetOrClass)
| ~ s__instance(X1519,s__SetOrClass)
| ~ s__instance(X1521,X1519)
| ~ s__instance(X1521,X1520) )
& ( s__instance(X1523,s__SetOrClass)
| s__disjoint(X1522,X1523) )
& ( s__instance(X1522,s__SetOrClass)
| s__disjoint(X1522,X1523) )
& ( s__instance(esk1_2(X1522,X1523),X1522)
| s__disjoint(X1522,X1523) )
& ( s__instance(esk1_2(X1522,X1523),X1523)
| s__disjoint(X1522,X1523) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_276])])])])])])]) ).
cnf(c_0_25,plain,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,plain,
( s__instance(esk1_2(X1,X2),X1)
| s__disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
( s__disjoint(s__NullSet,X1)
| ~ s__instance(X2,esk1_2(s__NullSet,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( s__instance(esk158_3(X1,X2,X3),X3)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,plain,
( X1 = s__UnionFn(esk1_2(s__NullSet,X2),X3)
| s__disjoint(s__NullSet,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( X1 = X2
| s__disjoint(s__NullSet,X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_29]) ).
cnf(c_0_31,plain,
( ~ s__disjoint(X1,X2)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X3,X1)
| ~ s__instance(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( s__disjoint(s__NullSet,X1)
| ~ s__instance(s__BananaSlug10_1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_30]) ).
cnf(c_0_33,plain,
( ~ s__disjoint(X1,X2)
| ~ s__instance(X3,X2)
| ~ s__instance(X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_23]),c_0_23])]) ).
cnf(c_0_34,negated_conjecture,
s__disjoint(s__NullSet,X1),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_35,negated_conjecture,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
( X1 = s__UnionFn(s__NullSet,X2)
| ~ s__instance(esk158_3(X2,X1,s__NullSet),X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_37,negated_conjecture,
X1 = s__UnionFn(s__NullSet,X2),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
fof(c_0_38,plain,
! [X6443] :
( ~ s__instance(X6443,s__SetOrClass)
| ~ s__instance(X6443,s__NonNullSet)
| s__instance(esk161_1(X6443),X6443) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3537])])])]) ).
cnf(c_0_39,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_37,c_0_37]) ).
cnf(c_0_40,plain,
( s__instance(esk161_1(X1),X1)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X1,s__NonNullSet) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ s__instance(X1,s__Invertebrate),
inference(spm,[status(thm)],[c_0_11,c_0_39]) ).
cnf(c_0_42,plain,
( s__instance(esk161_1(X1),X1)
| ~ s__instance(X1,s__NonNullSet) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_23])]) ).
cnf(c_0_43,negated_conjecture,
~ s__instance(s__Invertebrate,s__NonNullSet),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
~ s__instance(s__Invertebrate,X1),
inference(spm,[status(thm)],[c_0_43,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_44,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.89/0.92 % Problem : CSR084+4 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.89/0.93 % Command : run_E %s %d THM
% 0.91/1.12 % Computer : n012.cluster.edu
% 0.91/1.12 % Model : x86_64 x86_64
% 0.91/1.12 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.91/1.12 % Memory : 8042.1875MB
% 0.91/1.12 % OS : Linux 3.10.0-693.el7.x86_64
% 0.91/1.12 % CPULimit : 300
% 0.91/1.12 % WCLimit : 300
% 0.91/1.12 % DateTime : Fri May 3 15:03:53 EDT 2024
% 0.91/1.13 % CPUTime :
% 1.75/1.98 Running first-order theorem proving
% 1.75/1.98 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/tmp/tmp.K2mBCZCWV0/E---3.1_20275.p
% 26.00/5.50 # Version: 3.1.0
% 26.00/5.50 # Preprocessing class: FMLLSMSLSSSNFFN.
% 26.00/5.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.00/5.50 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 26.00/5.50 # Starting new_bool_3 with 300s (1) cores
% 26.00/5.50 # Starting new_bool_1 with 300s (1) cores
% 26.00/5.50 # Starting sh5l with 300s (1) cores
% 26.00/5.50 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 20353 completed with status 0
% 26.00/5.50 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 26.00/5.50 # Preprocessing class: FMLLSMSLSSSNFFN.
% 26.00/5.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.00/5.50 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 26.00/5.50 # No SInE strategy applied
% 26.00/5.50 # Search class: FGHSM-SMLM31-MFFFFFNN
% 26.00/5.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 26.00/5.50 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 26.00/5.50 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 26.00/5.50 # Starting new_bool_3 with 136s (1) cores
% 26.00/5.50 # Starting new_bool_1 with 136s (1) cores
% 26.00/5.50 # Starting sh5l with 136s (1) cores
% 26.00/5.50 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 20365 completed with status 0
% 26.00/5.50 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 26.00/5.50 # Preprocessing class: FMLLSMSLSSSNFFN.
% 26.00/5.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.00/5.50 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 26.00/5.50 # No SInE strategy applied
% 26.00/5.50 # Search class: FGHSM-SMLM31-MFFFFFNN
% 26.00/5.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 26.00/5.50 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 26.00/5.50 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 26.00/5.50 # Preprocessing time : 0.091 s
% 26.00/5.50 # Presaturation interreduction done
% 26.00/5.50
% 26.00/5.50 # Proof found!
% 26.00/5.50 # SZS status Theorem
% 26.00/5.50 # SZS output start CNFRefutation
% See solution above
% 26.00/5.50 # Parsed axioms : 7225
% 26.00/5.50 # Removed by relevancy pruning/SinE : 0
% 26.00/5.50 # Initial clauses : 8419
% 26.00/5.50 # Removed in clause preprocessing : 63
% 26.00/5.50 # Initial clauses in saturation : 8356
% 26.00/5.50 # Processed clauses : 16867
% 26.00/5.50 # ...of these trivial : 559
% 26.00/5.50 # ...subsumed : 400
% 26.00/5.50 # ...remaining for further processing : 15908
% 26.00/5.50 # Other redundant clauses eliminated : 41
% 26.00/5.50 # Clauses deleted for lack of memory : 0
% 26.00/5.50 # Backward-subsumed : 218
% 26.00/5.50 # Backward-rewritten : 1730
% 26.00/5.50 # Generated clauses : 99772
% 26.00/5.50 # ...of the previous two non-redundant : 89529
% 26.00/5.50 # ...aggressively subsumed : 0
% 26.00/5.50 # Contextual simplify-reflections : 668
% 26.00/5.50 # Paramodulations : 99674
% 26.00/5.50 # Factorizations : 1
% 26.00/5.50 # NegExts : 0
% 26.00/5.50 # Equation resolutions : 59
% 26.00/5.50 # Disequality decompositions : 0
% 26.00/5.50 # Total rewrite steps : 12855
% 26.00/5.50 # ...of those cached : 7877
% 26.00/5.50 # Propositional unsat checks : 0
% 26.00/5.50 # Propositional check models : 0
% 26.00/5.50 # Propositional check unsatisfiable : 0
% 26.00/5.50 # Propositional clauses : 0
% 26.00/5.50 # Propositional clauses after purity: 0
% 26.00/5.50 # Propositional unsat core size : 0
% 26.00/5.50 # Propositional preprocessing time : 0.000
% 26.00/5.50 # Propositional encoding time : 0.000
% 26.00/5.50 # Propositional solver time : 0.000
% 26.00/5.50 # Success case prop preproc time : 0.000
% 26.00/5.50 # Success case prop encoding time : 0.000
% 26.00/5.50 # Success case prop solver time : 0.000
% 26.00/5.50 # Current number of processed clauses : 5755
% 26.00/5.50 # Positive orientable unit clauses : 3957
% 26.00/5.50 # Positive unorientable unit clauses: 1
% 26.00/5.50 # Negative unit clauses : 17
% 26.00/5.50 # Non-unit-clauses : 1780
% 26.00/5.50 # Current number of unprocessed clauses: 72144
% 26.00/5.50 # ...number of literals in the above : 145148
% 26.00/5.50 # Current number of archived formulas : 0
% 26.00/5.50 # Current number of archived clauses : 10145
% 26.00/5.50 # Clause-clause subsumption calls (NU) : 3003578
% 26.00/5.50 # Rec. Clause-clause subsumption calls : 718462
% 26.00/5.50 # Non-unit clause-clause subsumptions : 1077
% 26.00/5.50 # Unit Clause-clause subsumption calls : 305766
% 26.00/5.50 # Rewrite failures with RHS unbound : 9355
% 26.00/5.50 # BW rewrite match attempts : 31985
% 26.00/5.50 # BW rewrite match successes : 10538
% 26.00/5.50 # Condensation attempts : 0
% 26.00/5.50 # Condensation successes : 0
% 26.00/5.50 # Termbank termtop insertions : 1157260
% 26.00/5.50 # Search garbage collected termcells : 89883
% 26.00/5.50
% 26.00/5.50 # -------------------------------------------------
% 26.00/5.50 # User time : 3.224 s
% 26.00/5.50 # System time : 0.116 s
% 26.00/5.50 # Total time : 3.340 s
% 26.00/5.50 # Maximum resident set size: 29788 pages
% 26.00/5.50
% 26.00/5.50 # -------------------------------------------------
% 26.00/5.50 # User time : 14.344 s
% 26.00/5.50 # System time : 0.266 s
% 26.00/5.50 # Total time : 14.611 s
% 26.00/5.50 # Maximum resident set size: 9176 pages
% 26.00/5.50 % E---3.1 exiting
% 26.00/5.50 % E exiting
%------------------------------------------------------------------------------