TSTP Solution File: RNG090+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG090+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : Tue May 21 02:36:17 EDT 2024
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 52 ( 29 unt; 0 def)
% Number of atoms : 132 ( 31 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 118 ( 38 ~; 30 |; 39 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 13 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__901,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = xx )
& aElementOf0(xx,sdtpldt1(xI,xJ))
& ? [X1,X2] :
( aElementOf0(X1,xI)
& aElementOf0(X2,xJ)
& sdtpldt0(X1,X2) = xy )
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__901) ).
fof(m__934,hypothesis,
( aElementOf0(xk,xI)
& aElementOf0(xl,xJ)
& xx = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__934) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__870,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& aSet0(xJ)
& ! [X1] :
( aElementOf0(X1,xJ)
=> ( ! [X2] :
( aElementOf0(X2,xJ)
=> aElementOf0(sdtpldt0(X1,X2),xJ) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xJ) ) ) )
& aIdeal0(xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).
fof(mAddAsso,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddAsso) ).
fof(m__967,hypothesis,
( aElementOf0(xm,xI)
& aElementOf0(xn,xJ)
& xy = sdtpldt0(xm,xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__967) ).
fof(m__994,hypothesis,
( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__994) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(c_0_10,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_11,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
fof(c_0_12,hypothesis,
( aElementOf0(esk1_0,xI)
& aElementOf0(esk2_0,xJ)
& sdtpldt0(esk1_0,esk2_0) = xx
& aElementOf0(xx,sdtpldt1(xI,xJ))
& aElementOf0(esk3_0,xI)
& aElementOf0(esk4_0,xJ)
& sdtpldt0(esk3_0,esk4_0) = xy
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__901])]) ).
cnf(c_0_13,negated_conjecture,
sdtpldt0(xx,xy) != sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
xx = sdtpldt0(xk,xl),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_15,hypothesis,
sdtpldt0(esk1_0,esk2_0) = xx,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X44,X45] :
( ~ aSet0(X44)
| ~ aElementOf0(X45,X44)
| aElement0(X45) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_17,hypothesis,
! [X7,X8,X9,X10,X11,X12] :
( aSet0(xI)
& ( ~ aElementOf0(X8,xI)
| aElementOf0(sdtpldt0(X7,X8),xI)
| ~ aElementOf0(X7,xI) )
& ( ~ aElement0(X9)
| aElementOf0(sdtasdt0(X9,X7),xI)
| ~ aElementOf0(X7,xI) )
& aIdeal0(xI)
& aSet0(xJ)
& ( ~ aElementOf0(X11,xJ)
| aElementOf0(sdtpldt0(X10,X11),xJ)
| ~ aElementOf0(X10,xJ) )
& ( ~ aElement0(X12)
| aElementOf0(sdtasdt0(X12,X10),xJ)
| ~ aElementOf0(X10,xJ) )
& aIdeal0(xJ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__870])])])])]) ).
cnf(c_0_18,negated_conjecture,
sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)) != sdtpldt0(sdtpldt0(xk,xl),xy),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
sdtpldt0(xk,xl) = sdtpldt0(esk1_0,esk2_0),
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
fof(c_0_20,plain,
! [X40,X41,X42] :
( ~ aElement0(X40)
| ~ aElement0(X41)
| ~ aElement0(X42)
| sdtpldt0(sdtpldt0(X40,X41),X42) = sdtpldt0(X40,sdtpldt0(X41,X42)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])])]) ).
cnf(c_0_21,hypothesis,
xy = sdtpldt0(xm,xn),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_22,hypothesis,
sdtpldt0(esk3_0,esk4_0) = xy,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,hypothesis,
aElementOf0(xn,xJ),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_25,hypothesis,
aSet0(xJ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,hypothesis,
aElementOf0(xm,xI),
inference(split_conjunct,[status(thm)],[m__967]) ).
cnf(c_0_27,hypothesis,
aSet0(xI),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,negated_conjecture,
sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)) != sdtpldt0(sdtpldt0(esk1_0,esk2_0),xy),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_29,hypothesis,
aElementOf0(sdtpldt0(xl,xn),xJ),
inference(split_conjunct,[status(thm)],[m__994]) ).
cnf(c_0_30,hypothesis,
aElementOf0(xk,xI),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_31,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,hypothesis,
sdtpldt0(xm,xn) = sdtpldt0(esk3_0,esk4_0),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_33,hypothesis,
aElement0(xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_34,hypothesis,
aElement0(xm),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_26]),c_0_27])]) ).
fof(c_0_35,plain,
! [X38,X39] :
( ~ aElement0(X38)
| ~ aElement0(X39)
| sdtpldt0(X38,X39) = sdtpldt0(X39,X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
cnf(c_0_36,hypothesis,
aElementOf0(xl,xJ),
inference(split_conjunct,[status(thm)],[m__934]) ).
cnf(c_0_37,negated_conjecture,
sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)) != sdtpldt0(sdtpldt0(esk1_0,esk2_0),sdtpldt0(esk3_0,esk4_0)),
inference(rw,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_38,hypothesis,
aElement0(sdtpldt0(xl,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_29]),c_0_25])]) ).
cnf(c_0_39,hypothesis,
aElement0(xk),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_30]),c_0_27])]) ).
cnf(c_0_40,hypothesis,
( sdtpldt0(xm,sdtpldt0(xn,X1)) = sdtpldt0(sdtpldt0(esk3_0,esk4_0),X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_41,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,hypothesis,
aElement0(xl),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_36]),c_0_25])]) ).
fof(c_0_43,plain,
! [X36,X37] :
( ~ aElement0(X36)
| ~ aElement0(X37)
| aElement0(sdtpldt0(X36,X37)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
cnf(c_0_44,negated_conjecture,
sdtpldt0(xk,sdtpldt0(xm,sdtpldt0(xl,xn))) != sdtpldt0(sdtpldt0(esk1_0,esk2_0),sdtpldt0(esk3_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_31]),c_0_38]),c_0_34]),c_0_39])]) ).
cnf(c_0_45,hypothesis,
( sdtpldt0(xm,sdtpldt0(X1,xn)) = sdtpldt0(sdtpldt0(esk3_0,esk4_0),X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33])]) ).
cnf(c_0_46,hypothesis,
( sdtpldt0(xk,sdtpldt0(xl,X1)) = sdtpldt0(sdtpldt0(esk1_0,esk2_0),X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_42]),c_0_39])]) ).
cnf(c_0_47,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
sdtpldt0(xk,sdtpldt0(sdtpldt0(esk3_0,esk4_0),xl)) != sdtpldt0(sdtpldt0(esk1_0,esk2_0),sdtpldt0(esk3_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_42])]) ).
cnf(c_0_49,hypothesis,
( sdtpldt0(xk,sdtpldt0(X1,xl)) = sdtpldt0(sdtpldt0(esk1_0,esk2_0),X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_41]),c_0_42])]) ).
cnf(c_0_50,hypothesis,
aElement0(sdtpldt0(esk3_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : RNG090+2 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n020.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sat May 18 12:13:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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
% 0.22/0.55 # Version: 3.1.0
% 0.22/0.55 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # Starting sh5l with 300s (1) cores
% 0.22/0.55 # new_bool_1 with pid 24643 completed with status 0
% 0.22/0.55 # Result found by new_bool_1
% 0.22/0.55 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FGUSF-FFMM32-SFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.55 # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 24646 completed with status 0
% 0.22/0.55 # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.55 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.55 # Search class: FGUSF-FFMM32-SFFFFFNN
% 0.22/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.55 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.55 # Preprocessing time : 0.002 s
% 0.22/0.55 # Presaturation interreduction done
% 0.22/0.55
% 0.22/0.55 # Proof found!
% 0.22/0.55 # SZS status Theorem
% 0.22/0.55 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 31
% 0.22/0.55 # Removed by relevancy pruning/SinE : 11
% 0.22/0.55 # Initial clauses : 60
% 0.22/0.55 # Removed in clause preprocessing : 2
% 0.22/0.55 # Initial clauses in saturation : 58
% 0.22/0.55 # Processed clauses : 148
% 0.22/0.55 # ...of these trivial : 0
% 0.22/0.55 # ...subsumed : 1
% 0.22/0.55 # ...remaining for further processing : 147
% 0.22/0.55 # Other redundant clauses eliminated : 6
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 0
% 0.22/0.55 # Backward-rewritten : 4
% 0.22/0.55 # Generated clauses : 186
% 0.22/0.55 # ...of the previous two non-redundant : 172
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 0
% 0.22/0.55 # Paramodulations : 181
% 0.22/0.55 # Factorizations : 0
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 6
% 0.22/0.55 # Disequality decompositions : 0
% 0.22/0.55 # Total rewrite steps : 131
% 0.22/0.55 # ...of those cached : 112
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 80
% 0.22/0.55 # Positive orientable unit clauses : 40
% 0.22/0.55 # Positive unorientable unit clauses: 0
% 0.22/0.55 # Negative unit clauses : 4
% 0.22/0.55 # Non-unit-clauses : 36
% 0.22/0.55 # Current number of unprocessed clauses: 135
% 0.22/0.55 # ...number of literals in the above : 550
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 62
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 597
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 231
% 0.22/0.55 # Non-unit clause-clause subsumptions : 1
% 0.22/0.55 # Unit Clause-clause subsumption calls : 34
% 0.22/0.55 # Rewrite failures with RHS unbound : 0
% 0.22/0.55 # BW rewrite match attempts : 2
% 0.22/0.55 # BW rewrite match successes : 2
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 7334
% 0.22/0.55 # Search garbage collected termcells : 896
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.013 s
% 0.22/0.55 # System time : 0.004 s
% 0.22/0.55 # Total time : 0.017 s
% 0.22/0.55 # Maximum resident set size: 1876 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.016 s
% 0.22/0.55 # System time : 0.005 s
% 0.22/0.55 # Total time : 0.021 s
% 0.22/0.55 # Maximum resident set size: 1736 pages
% 0.22/0.55 % E---3.1 exiting
% 0.22/0.55 % E exiting
%------------------------------------------------------------------------------