TSTP Solution File: NUN076+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUN076+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 09:09:01 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 19 unt; 0 def)
% Number of atoms : 201 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 251 ( 109 ~; 92 |; 50 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 145 ( 15 sgn 56 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',axiom_1) ).
fof(thereexistsanevennumberid,conjecture,
? [X63,X46,X47] :
( ? [X40] :
( id(X40,X63)
& ? [X49] :
( r4(X49,X46,X40)
& ? [X43] :
( r2(X43,X49)
& ? [X58] :
( r1(X58)
& r2(X58,X43) ) ) ) )
& ? [X41] :
( id(X41,X63)
& r3(X46,X47,X41) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',thereexistsanevennumberid) ).
fof(axiom_6,axiom,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',axiom_6) ).
fof(axiom_5a,axiom,
! [X57] :
? [X58] :
( ? [X59] :
( r1(X59)
& r4(X57,X59,X58) )
& ? [X60] :
( id(X58,X60)
& r1(X60) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',axiom_5a) ).
fof(axiom_8,axiom,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',axiom_8) ).
fof(axiom_7,axiom,
! [X17,X18,X19] :
( ~ id(X17,X18)
| id(X17,X19)
| ~ id(X18,X19) ),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',axiom_7) ).
fof(axiom_4a,axiom,
! [X54] :
? [X55] :
( id(X55,X54)
& ? [X56] :
( r1(X56)
& r3(X54,X56,X55) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',axiom_4a) ).
fof(axiom_9,axiom,
! [X22,X23,X24,X25] :
( ~ id(X22,X24)
| ~ id(X23,X25)
| ( ~ r2(X22,X23)
& ~ r2(X24,X25) )
| ( r2(X22,X23)
& r2(X24,X25) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',axiom_9) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',axiom_2) ).
fof(axiom_5,axiom,
! [X14] : id(X14,X14),
file('/export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p',axiom_5) ).
fof(c_0_10,plain,
? [X1] :
! [X2] :
( ( id(X2,X1)
& r1(X2) )
| ( ~ r1(X2)
& ~ id(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_11,negated_conjecture,
~ ? [X63,X46,X47] :
( ? [X40] :
( id(X40,X63)
& ? [X49] :
( r4(X49,X46,X40)
& ? [X43] :
( r2(X43,X49)
& ? [X58] :
( r1(X58)
& r2(X58,X43) ) ) ) )
& ? [X41] :
( id(X41,X63)
& r3(X46,X47,X41) ) ),
inference(assume_negation,[status(cth)],[thereexistsanevennumberid]) ).
fof(c_0_12,plain,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
fof(c_0_13,plain,
! [X102] :
( ( ~ r1(X102)
| id(X102,esk12_0) )
& ( ~ id(X102,esk12_0)
| id(X102,esk12_0) )
& ( ~ r1(X102)
| r1(X102) )
& ( ~ id(X102,esk12_0)
| r1(X102) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X132] :
( r1(esk16_1(X132))
& r4(X132,esk16_1(X132),esk15_1(X132))
& id(esk15_1(X132),esk17_1(X132))
& r1(esk17_1(X132)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).
fof(c_0_15,plain,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
inference(fof_simplification,[status(thm)],[axiom_8]) ).
fof(c_0_16,negated_conjecture,
! [X68,X69,X70,X71,X72,X73,X74,X75] :
( ~ id(X71,X68)
| ~ r4(X72,X69,X71)
| ~ r2(X73,X72)
| ~ r1(X74)
| ~ r2(X74,X73)
| ~ id(X75,X68)
| ~ r3(X69,X70,X75) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_17,plain,
! [X17,X18,X19] :
( ~ id(X17,X18)
| id(X17,X19)
| ~ id(X18,X19) ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
fof(c_0_18,plain,
! [X111,X112] :
( ~ id(X111,X112)
| id(X112,X111) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
cnf(c_0_19,plain,
( id(X1,esk12_0)
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
r1(esk16_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X116,X117] :
( ( r1(X116)
| ~ r1(X116)
| ~ id(X116,X117) )
& ( r1(X117)
| ~ r1(X116)
| ~ id(X116,X117) )
& ( r1(X116)
| ~ r1(X117)
| ~ id(X116,X117) )
& ( r1(X117)
| ~ r1(X117)
| ~ id(X116,X117) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ id(X1,X2)
| ~ r4(X3,X4,X1)
| ~ r2(X5,X3)
| ~ r1(X6)
| ~ r2(X6,X5)
| ~ id(X7,X2)
| ~ r3(X4,X8,X7) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X98] :
( id(esk10_1(X98),X98)
& r1(esk11_1(X98))
& r3(X98,esk11_1(X98),esk10_1(X98)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_25,plain,
! [X113,X114,X115] :
( ~ id(X113,X114)
| id(X113,X115)
| ~ id(X114,X115) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_17])]) ).
cnf(c_0_26,plain,
( id(X2,X1)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
id(esk16_1(X1),esk12_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
id(esk15_1(X1),esk17_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,plain,
r1(esk17_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_31,plain,
! [X22,X23,X24,X25] :
( ~ id(X22,X24)
| ~ id(X23,X25)
| ( ~ r2(X22,X23)
& ~ r2(X24,X25) )
| ( r2(X22,X23)
& r2(X24,X25) ) ),
inference(fof_simplification,[status(thm)],[axiom_9]) ).
cnf(c_0_32,negated_conjecture,
( ~ r3(esk16_1(X1),X2,X3)
| ~ r2(X4,X5)
| ~ r2(X5,X1)
| ~ r1(X4)
| ~ id(esk15_1(X1),X6)
| ~ id(X3,X6) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_33,plain,
r3(X1,esk11_1(X1),esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
( id(X1,X3)
| ~ id(X1,X2)
| ~ id(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
id(esk12_0,esk16_1(X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
r1(esk15_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
fof(c_0_37,plain,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_38,plain,
! [X118,X119,X120,X121] :
( ( r2(X118,X119)
| ~ r2(X118,X119)
| ~ id(X118,X120)
| ~ id(X119,X121) )
& ( r2(X120,X121)
| ~ r2(X118,X119)
| ~ id(X118,X120)
| ~ id(X119,X121) )
& ( r2(X118,X119)
| ~ r2(X120,X121)
| ~ id(X118,X120)
| ~ id(X119,X121) )
& ( r2(X120,X121)
| ~ r2(X120,X121)
| ~ id(X118,X120)
| ~ id(X119,X121) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_31])])]) ).
fof(c_0_39,plain,
! [X110] : id(X110,X110),
inference(variable_rename,[status(thm)],[axiom_5]) ).
cnf(c_0_40,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r1(X1)
| ~ id(esk10_1(esk16_1(X3)),X4)
| ~ id(esk15_1(X3),X4) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
id(esk10_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_42,plain,
( id(X1,esk16_1(X2))
| ~ id(X1,esk12_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
id(esk15_1(X1),esk12_0),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
fof(c_0_44,plain,
! [X103,X105] :
( ( ~ r2(X103,X105)
| id(X105,esk13_1(X103)) )
& ( ~ id(X105,esk13_1(X103))
| id(X105,esk13_1(X103)) )
& ( ~ r2(X103,X105)
| r2(X103,X105) )
& ( ~ id(X105,esk13_1(X103))
| r2(X103,X105) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_37])])])]) ).
cnf(c_0_45,plain,
( r2(X1,X2)
| ~ r2(X3,X4)
| ~ id(X3,X1)
| ~ id(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r1(X1)
| ~ id(esk15_1(X3),esk16_1(X3)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
id(esk15_1(X1),esk16_1(X2)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
( r2(X2,X1)
| ~ id(X1,esk13_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
( r2(X1,X2)
| ~ r2(X3,X2)
| ~ id(X3,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_52,plain,
r2(X1,esk13_1(X1)),
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_53,plain,
( r2(X1,X2)
| ~ r2(esk10_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_41]) ).
cnf(c_0_54,negated_conjecture,
( ~ r2(esk13_1(X1),X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
r2(X1,esk13_1(esk10_1(X1))),
inference(spm,[status(thm)],[c_0_53,c_0_52]) ).
cnf(c_0_56,plain,
r1(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_57,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
$false,
inference(sr,[status(thm)],[c_0_56,c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN076+1 : TPTP v8.1.2. Released v7.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 12:04:42 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.yf0bvxvMJl/E---3.1_2962.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # sh5l with pid 3042 completed with status 0
% 0.20/0.52 # Result found by sh5l
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.52 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 139s (1) cores
% 0.20/0.52 # H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with pid 3050 completed with status 0
% 0.20/0.52 # Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.52 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 139s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 19
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 59
% 0.20/0.52 # Removed in clause preprocessing : 16
% 0.20/0.52 # Initial clauses in saturation : 43
% 0.20/0.52 # Processed clauses : 278
% 0.20/0.52 # ...of these trivial : 2
% 0.20/0.52 # ...subsumed : 60
% 0.20/0.52 # ...remaining for further processing : 216
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 77
% 0.20/0.52 # Backward-rewritten : 2
% 0.20/0.52 # Generated clauses : 1129
% 0.20/0.52 # ...of the previous two non-redundant : 960
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 1114
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 194
% 0.20/0.52 # ...of those cached : 134
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 122
% 0.20/0.52 # Positive orientable unit clauses : 46
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 75
% 0.20/0.52 # Current number of unprocessed clauses: 721
% 0.20/0.52 # ...number of literals in the above : 1429
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 94
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 3483
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 1235
% 0.20/0.52 # Non-unit clause-clause subsumptions : 90
% 0.20/0.52 # Unit Clause-clause subsumption calls : 586
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 44
% 0.20/0.52 # BW rewrite match successes : 2
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 14269
% 0.20/0.52 # Search garbage collected termcells : 441
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.023 s
% 0.20/0.52 # System time : 0.004 s
% 0.20/0.52 # Total time : 0.028 s
% 0.20/0.52 # Maximum resident set size: 1900 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.027 s
% 0.20/0.52 # System time : 0.005 s
% 0.20/0.52 # Total time : 0.031 s
% 0.20/0.52 # Maximum resident set size: 1760 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------