TSTP Solution File: KLE027+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE027+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:04:43 EDT 2023
% Result : Theorem 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 65 ( 41 unt; 0 def)
% Number of atoms : 118 ( 65 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 92 ( 39 ~; 34 |; 12 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 93 ( 3 sgn; 54 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)) = addition(multiplication(X7,X4),multiplication(c(X7),X6)) ),
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',goals) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',test_1) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',additive_commutativity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',test_3) ).
fof(test_deMorgan1,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(addition(X4,X5)) = multiplication(c(X4),c(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',test_deMorgan1) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',right_distributivity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',additive_associativity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',additive_identity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.0eqFgl0uHT/E---3.1_20999.p',additive_idempotence) ).
fof(c_0_12,negated_conjecture,
~ ! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)) = addition(multiplication(X7,X4),multiplication(c(X7),X6)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_13,plain,
! [X43,X45,X46] :
( ( ~ test(X43)
| complement(esk6_1(X43),X43) )
& ( ~ complement(X46,X45)
| test(X45) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])]) ).
fof(c_0_14,negated_conjecture,
( test(esk4_0)
& test(esk5_0)
& addition(multiplication(esk4_0,addition(multiplication(esk4_0,esk1_0),multiplication(c(esk4_0),esk2_0))),multiplication(c(esk4_0),esk3_0)) != addition(multiplication(esk4_0,esk1_0),multiplication(c(esk4_0),esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_15,plain,
! [X27,X28] :
( ( multiplication(X27,X28) = zero
| ~ complement(X28,X27) )
& ( multiplication(X28,X27) = zero
| ~ complement(X28,X27) )
& ( addition(X27,X28) = one
| ~ complement(X28,X27) )
& ( multiplication(X27,X28) != zero
| multiplication(X28,X27) != zero
| addition(X27,X28) != one
| complement(X28,X27) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
fof(c_0_16,plain,
! [X14,X15] : addition(X14,X15) = addition(X15,X14),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_17,plain,
( complement(esk6_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X40,X41] :
( ( c(X40) != X41
| complement(X40,X41)
| ~ test(X40) )
& ( ~ complement(X40,X41)
| c(X40) = X41
| ~ test(X40) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
cnf(c_0_20,plain,
( complement(X2,X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
complement(esk6_1(esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( complement(X1,X2)
| addition(X1,X2) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
addition(esk4_0,esk6_1(esk4_0)) = one,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
multiplication(esk4_0,esk6_1(esk4_0)) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
multiplication(esk6_1(esk4_0),esk4_0) = zero,
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_31,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( c(X1) = X2
| ~ complement(X1,X2)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,plain,
( test(X2)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
complement(esk4_0,esk6_1(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
fof(c_0_35,plain,
! [X29,X30] :
( ~ test(X29)
| ~ test(X30)
| c(addition(X29,X30)) = multiplication(c(X29),c(X30)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_deMorgan1])]) ).
cnf(c_0_36,negated_conjecture,
complement(esk4_0,c(esk4_0)),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_37,negated_conjecture,
( c(esk6_1(esk4_0)) = esk4_0
| ~ test(esk6_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_38,negated_conjecture,
test(esk6_1(esk4_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
esk6_1(esk4_0) = c(esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_34]),c_0_18])]) ).
fof(c_0_40,plain,
! [X21,X22,X23] : multiplication(X21,addition(X22,X23)) = addition(multiplication(X21,X22),multiplication(X21,X23)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_41,plain,
! [X16,X17,X18] : addition(X18,addition(X17,X16)) = addition(addition(X18,X17),X16),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_42,plain,
! [X33,X34,X35] : multiplication(X33,multiplication(X34,X35)) = multiplication(multiplication(X33,X34),X35),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_43,plain,
! [X39] : multiplication(zero,X39) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_44,plain,
! [X19] : addition(X19,zero) = X19,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_45,plain,
( c(addition(X1,X2)) = multiplication(c(X1),c(X2))
| ~ test(X1)
| ~ test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_46,negated_conjecture,
test(c(esk4_0)),
inference(spm,[status(thm)],[c_0_33,c_0_36]) ).
cnf(c_0_47,negated_conjecture,
c(c(esk4_0)) = esk4_0,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),c_0_39]) ).
fof(c_0_48,plain,
! [X20] : addition(X20,X20) = X20,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_49,negated_conjecture,
addition(multiplication(esk4_0,addition(multiplication(esk4_0,esk1_0),multiplication(c(esk4_0),esk2_0))),multiplication(c(esk4_0),esk3_0)) != addition(multiplication(esk4_0,esk1_0),multiplication(c(esk4_0),esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_50,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_51,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_52,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_53,negated_conjecture,
multiplication(esk4_0,c(esk4_0)) = zero,
inference(spm,[status(thm)],[c_0_25,c_0_36]) ).
cnf(c_0_54,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_55,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_56,negated_conjecture,
( multiplication(c(X1),esk4_0) = c(addition(X1,c(esk4_0)))
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_57,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_58,negated_conjecture,
addition(multiplication(esk4_0,multiplication(esk4_0,esk1_0)),addition(multiplication(esk4_0,multiplication(c(esk4_0),esk2_0)),multiplication(c(esk4_0),esk3_0))) != addition(multiplication(esk4_0,esk1_0),multiplication(c(esk4_0),esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_59,negated_conjecture,
multiplication(esk4_0,multiplication(c(esk4_0),X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_60,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_55,c_0_21]) ).
cnf(c_0_61,negated_conjecture,
multiplication(esk4_0,esk4_0) = esk4_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_46]),c_0_47]),c_0_57]),c_0_47]) ).
cnf(c_0_62,negated_conjecture,
addition(multiplication(esk4_0,multiplication(esk4_0,esk1_0)),multiplication(c(esk4_0),esk3_0)) != addition(multiplication(esk4_0,esk1_0),multiplication(c(esk4_0),esk3_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_63,negated_conjecture,
multiplication(esk4_0,multiplication(esk4_0,X1)) = multiplication(esk4_0,X1),
inference(spm,[status(thm)],[c_0_52,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : KLE027+3 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 2400
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Tue Oct 3 05:16:52 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.16/0.41 Running first-order model finding
% 0.16/0.41 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.0eqFgl0uHT/E---3.1_20999.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # sh5l with pid 21079 completed with status 0
% 0.16/0.47 # Result found by sh5l
% 0.16/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGUSM-FFMF21-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 181s (1) cores
% 0.16/0.47 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 21088 completed with status 0
% 0.16/0.47 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.16/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGUSM-FFMF21-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 181s (1) cores
% 0.16/0.47 # Preprocessing time : 0.001 s
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Theorem
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 19
% 0.16/0.47 # Removed by relevancy pruning/SinE : 1
% 0.16/0.47 # Initial clauses : 25
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 25
% 0.16/0.47 # Processed clauses : 577
% 0.16/0.47 # ...of these trivial : 83
% 0.16/0.47 # ...subsumed : 204
% 0.16/0.47 # ...remaining for further processing : 290
% 0.16/0.47 # Other redundant clauses eliminated : 82
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 2
% 0.16/0.47 # Backward-rewritten : 58
% 0.16/0.47 # Generated clauses : 3223
% 0.16/0.47 # ...of the previous two non-redundant : 2206
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 0
% 0.16/0.47 # Paramodulations : 3141
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 82
% 0.16/0.47 # Total rewrite steps : 5203
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 229
% 0.16/0.47 # Positive orientable unit clauses : 128
% 0.16/0.47 # Positive unorientable unit clauses: 4
% 0.16/0.47 # Negative unit clauses : 0
% 0.16/0.47 # Non-unit-clauses : 97
% 0.16/0.47 # Current number of unprocessed clauses: 1611
% 0.16/0.47 # ...number of literals in the above : 3546
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 60
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 1722
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 1528
% 0.16/0.47 # Non-unit clause-clause subsumptions : 163
% 0.16/0.47 # Unit Clause-clause subsumption calls : 467
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 170
% 0.16/0.47 # BW rewrite match successes : 65
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 44902
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.047 s
% 0.16/0.47 # System time : 0.000 s
% 0.16/0.47 # Total time : 0.047 s
% 0.16/0.47 # Maximum resident set size: 1760 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.049 s
% 0.16/0.47 # System time : 0.001 s
% 0.16/0.47 # Total time : 0.050 s
% 0.16/0.47 # Maximum resident set size: 1692 pages
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------