TSTP Solution File: KLE027+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE027+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:03:56 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 54 ( 35 unt; 0 def)
% Number of atoms : 97 ( 51 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 73 ( 30 ~; 24 |; 13 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 83 ( 3 sgn; 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',test_3) ).
fof(goals,conjecture,
! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> ( leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))
& leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',goals) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',additive_commutativity) ).
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.Sc6LnA6J8T/E---3.1_27066.p',test_2) ).
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.Sc6LnA6J8T/E---3.1_27066.p',right_distributivity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',left_annihilation) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',multiplicative_left_identity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',additive_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',order) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p',additive_idempotence) ).
fof(c_0_12,plain,
! [X37,X38] :
( ( c(X37) != X38
| complement(X37,X38)
| ~ test(X37) )
& ( ~ complement(X37,X38)
| c(X37) = X38
| ~ test(X37) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> ( leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))
& leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_14,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,negated_conjecture,
( test(esk5_0)
& test(esk6_0)
& ( ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))
| ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0))) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_16,plain,
! [X9,X10] : addition(X9,X10) = addition(X10,X9),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_17,plain,
! [X35,X36] :
( ( multiplication(X35,X36) = zero
| ~ complement(X36,X35) )
& ( multiplication(X36,X35) = zero
| ~ complement(X36,X35) )
& ( addition(X35,X36) = one
| ~ complement(X36,X35) )
& ( multiplication(X35,X36) != zero
| multiplication(X36,X35) != zero
| addition(X35,X36) != one
| complement(X36,X35) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_18,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))
| ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0))) ),
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]) ).
fof(c_0_22,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_23,plain,
! [X16,X17,X18] : multiplication(X16,multiplication(X17,X18)) = multiplication(multiplication(X16,X17),X18),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_24,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
complement(esk5_0,c(esk5_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_26,plain,
! [X28] : multiplication(zero,X28) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_27,plain,
! [X24,X25,X26] : multiplication(addition(X24,X25),X26) = addition(multiplication(X24,X26),multiplication(X25,X26)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_28,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_29,plain,
! [X20] : multiplication(one,X20) = X20,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_30,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
| ~ leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_32,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
multiplication(esk5_0,c(esk5_0)) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_36,plain,
! [X14] : addition(X14,zero) = X14,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_37,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,negated_conjecture,
addition(esk5_0,c(esk5_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_21]) ).
cnf(c_0_39,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,negated_conjecture,
multiplication(c(esk5_0),esk5_0) = zero,
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
fof(c_0_41,plain,
! [X29,X30] :
( ( ~ leq(X29,X30)
| addition(X29,X30) = X30 )
& ( addition(X29,X30) != X30
| leq(X29,X30) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_42,plain,
! [X15] : addition(X15,X15) = X15,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_43,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,multiplication(esk5_0,esk2_0)),multiplication(esk5_0,multiplication(c(esk5_0),esk3_0)))))
| ~ leq(addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,multiplication(esk5_0,esk2_0)),multiplication(esk5_0,multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_44,negated_conjecture,
multiplication(esk5_0,multiplication(c(esk5_0),X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_45,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,negated_conjecture,
addition(multiplication(esk5_0,X1),multiplication(c(esk5_0),X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_47,negated_conjecture,
multiplication(c(esk5_0),multiplication(esk5_0,X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_40]),c_0_35]) ).
cnf(c_0_48,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,multiplication(esk5_0,esk2_0)),multiplication(c(esk5_0),esk4_0)))
| ~ leq(addition(multiplication(esk5_0,multiplication(esk5_0,esk2_0)),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_21]),c_0_45]),c_0_21]) ).
cnf(c_0_51,negated_conjecture,
multiplication(esk5_0,multiplication(esk5_0,X1)) = multiplication(esk5_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_45]) ).
cnf(c_0_52,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE027+2 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n031.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 2400
% 0.14/0.33 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 05:15:59 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/tmp/tmp.Sc6LnA6J8T/E---3.1_27066.p
% 0.20/0.53 # Version: 3.1pre001
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 # Starting sh5l with 300s (1) cores
% 0.20/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27191 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 811s (1) cores
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.53 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S00EN with 136s (1) cores
% 0.20/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.53 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 27196 completed with status 0
% 0.20/0.53 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 0.20/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.53 # No SInE strategy applied
% 0.20/0.53 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.20/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 811s (1) cores
% 0.20/0.53 # Preprocessing time : 0.001 s
% 0.20/0.53 # Presaturation interreduction done
% 0.20/0.53
% 0.20/0.53 # Proof found!
% 0.20/0.53 # SZS status Theorem
% 0.20/0.53 # SZS output start CNFRefutation
% See solution above
% 0.20/0.53 # Parsed axioms : 17
% 0.20/0.53 # Removed by relevancy pruning/SinE : 0
% 0.20/0.53 # Initial clauses : 25
% 0.20/0.53 # Removed in clause preprocessing : 0
% 0.20/0.53 # Initial clauses in saturation : 25
% 0.20/0.53 # Processed clauses : 629
% 0.20/0.53 # ...of these trivial : 72
% 0.20/0.53 # ...subsumed : 216
% 0.20/0.53 # ...remaining for further processing : 341
% 0.20/0.53 # Other redundant clauses eliminated : 27
% 0.20/0.53 # Clauses deleted for lack of memory : 0
% 0.20/0.53 # Backward-subsumed : 0
% 0.20/0.53 # Backward-rewritten : 104
% 0.20/0.53 # Generated clauses : 3520
% 0.20/0.53 # ...of the previous two non-redundant : 2316
% 0.20/0.53 # ...aggressively subsumed : 0
% 0.20/0.53 # Contextual simplify-reflections : 0
% 0.20/0.53 # Paramodulations : 3493
% 0.20/0.53 # Factorizations : 0
% 0.20/0.53 # NegExts : 0
% 0.20/0.53 # Equation resolutions : 27
% 0.20/0.53 # Total rewrite steps : 5297
% 0.20/0.53 # Propositional unsat checks : 0
% 0.20/0.53 # Propositional check models : 0
% 0.20/0.53 # Propositional check unsatisfiable : 0
% 0.20/0.53 # Propositional clauses : 0
% 0.20/0.53 # Propositional clauses after purity: 0
% 0.20/0.53 # Propositional unsat core size : 0
% 0.20/0.53 # Propositional preprocessing time : 0.000
% 0.20/0.53 # Propositional encoding time : 0.000
% 0.20/0.53 # Propositional solver time : 0.000
% 0.20/0.53 # Success case prop preproc time : 0.000
% 0.20/0.53 # Success case prop encoding time : 0.000
% 0.20/0.53 # Success case prop solver time : 0.000
% 0.20/0.53 # Current number of processed clauses : 211
% 0.20/0.53 # Positive orientable unit clauses : 114
% 0.20/0.53 # Positive unorientable unit clauses: 3
% 0.20/0.53 # Negative unit clauses : 0
% 0.20/0.53 # Non-unit-clauses : 94
% 0.20/0.53 # Current number of unprocessed clauses: 1667
% 0.20/0.53 # ...number of literals in the above : 3121
% 0.20/0.53 # Current number of archived formulas : 0
% 0.20/0.53 # Current number of archived clauses : 129
% 0.20/0.53 # Clause-clause subsumption calls (NU) : 1806
% 0.20/0.53 # Rec. Clause-clause subsumption calls : 1675
% 0.20/0.53 # Non-unit clause-clause subsumptions : 208
% 0.20/0.53 # Unit Clause-clause subsumption calls : 1501
% 0.20/0.53 # Rewrite failures with RHS unbound : 0
% 0.20/0.53 # BW rewrite match attempts : 188
% 0.20/0.53 # BW rewrite match successes : 56
% 0.20/0.53 # Condensation attempts : 0
% 0.20/0.53 # Condensation successes : 0
% 0.20/0.53 # Termbank termtop insertions : 39295
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.056 s
% 0.20/0.53 # System time : 0.003 s
% 0.20/0.53 # Total time : 0.059 s
% 0.20/0.53 # Maximum resident set size: 1752 pages
% 0.20/0.53
% 0.20/0.53 # -------------------------------------------------
% 0.20/0.53 # User time : 0.280 s
% 0.20/0.53 # System time : 0.012 s
% 0.20/0.53 # Total time : 0.291 s
% 0.20/0.53 # Maximum resident set size: 1692 pages
% 0.20/0.53 % E---3.1 exiting
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------