TSTP Solution File: KLE039+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE039+1 : TPTP v8.1.2. Released v4.0.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:04:46 EDT 2023
% Result : Theorem 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 69 ( 47 unt; 0 def)
% Number of atoms : 93 ( 51 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 47 ( 23 ~; 20 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 116 ( 0 sgn; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',additive_idempotence) ).
fof(star_induction_right,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X1)
=> leq(multiplication(X3,star(X2)),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',star_induction_right) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',multiplicative_right_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',additive_commutativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',order) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',multiplicative_left_identity) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',star_unfold_right) ).
fof(star_induction_left,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X2)
=> leq(multiplication(star(X1),X3),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',star_induction_left) ).
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.qFCZZOjA7e/E---3.1_8969.p',right_distributivity) ).
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.qFCZZOjA7e/E---3.1_8969.p',left_distributivity) ).
fof(goals,conjecture,
! [X4] : star(star(X4)) = star(X4),
file('/export/starexec/sandbox2/tmp/tmp.qFCZZOjA7e/E---3.1_8969.p',goals) ).
fof(c_0_12,plain,
! [X18,X19,X20] : addition(X20,addition(X19,X18)) = addition(addition(X20,X19),X18),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_13,plain,
! [X22] : addition(X22,X22) = X22,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_14,plain,
! [X11,X12,X13] :
( ~ leq(addition(multiplication(X11,X12),X13),X11)
| leq(multiplication(X13,star(X12)),X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])]) ).
fof(c_0_15,plain,
! [X32] : multiplication(X32,one) = X32,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_16,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X16,X17] : addition(X16,X17) = addition(X17,X16),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_19,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X14,X15] :
( ( ~ leq(X14,X15)
| addition(X14,X15) = X15 )
& ( addition(X14,X15) != X15
| leq(X14,X15) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_22,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,plain,
! [X33] : multiplication(one,X33) = X33,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_28,plain,
! [X6] : leq(addition(one,multiplication(X6,star(X6))),star(X6)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
cnf(c_0_29,plain,
( leq(multiplication(X1,star(one)),X2)
| addition(X1,X2) != X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_26]) ).
cnf(c_0_30,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( leq(star(one),X1)
| addition(one,X1) != X1 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
leq(addition(one,star(one)),star(one)),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_35,plain,
( addition(star(one),X1) = X1
| addition(one,X1) != X1 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
addition(one,star(one)) = star(one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_34]),c_0_16]),c_0_17]) ).
cnf(c_0_37,plain,
( addition(X1,star(one)) = X1
| addition(one,X1) != X1 ),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_38,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(X1,multiplication(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_39,plain,
star(one) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17])]) ).
cnf(c_0_40,plain,
( leq(X1,X2)
| ~ leq(addition(X1,X2),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_20]),c_0_39]),c_0_20]) ).
cnf(c_0_41,plain,
( leq(addition(X1,X2),X3)
| ~ leq(addition(X1,addition(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_16]) ).
fof(c_0_42,plain,
! [X8,X9,X10] :
( ~ leq(addition(multiplication(X8,X9),X10),X9)
| leq(multiplication(star(X8),X10),X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_left])]) ).
cnf(c_0_43,plain,
( leq(addition(X1,X2),X1)
| ~ leq(addition(X2,X1),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_17]),c_0_16]),c_0_26]) ).
cnf(c_0_44,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_16]),c_0_23]) ).
cnf(c_0_46,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_47,plain,
( leq(addition(X1,X2),X1)
| addition(X2,X1) != X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_25]),c_0_16]),c_0_17]) ).
cnf(c_0_48,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(X2,multiplication(X1,X3)),X3) ),
inference(spm,[status(thm)],[c_0_44,c_0_23]) ).
cnf(c_0_49,plain,
addition(star(X1),multiplication(X1,star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_45]),c_0_16]),c_0_23]),c_0_22]) ).
cnf(c_0_50,plain,
leq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_39]),c_0_20]),c_0_17])]) ).
cnf(c_0_51,plain,
leq(multiplication(star(X1),star(X1)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_52,plain,
addition(star(X1),multiplication(star(X1),star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_51]),c_0_23]) ).
fof(c_0_53,plain,
! [X23,X24,X25] : multiplication(X23,addition(X24,X25)) = addition(multiplication(X23,X24),multiplication(X23,X25)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_54,plain,
leq(multiplication(star(X1),star(star(X1))),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_52]),c_0_50])]) ).
cnf(c_0_55,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
fof(c_0_56,plain,
! [X26,X27,X28] : multiplication(addition(X26,X27),X28) = addition(multiplication(X26,X28),multiplication(X27,X28)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_57,plain,
addition(star(X1),multiplication(star(X1),star(star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_54]),c_0_23]) ).
cnf(c_0_58,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_20]),c_0_23]) ).
cnf(c_0_59,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
fof(c_0_60,negated_conjecture,
~ ! [X4] : star(star(X4)) = star(X4),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_61,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_62,plain,
multiplication(star(X1),star(star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_23]),c_0_59]) ).
fof(c_0_63,negated_conjecture,
star(star(esk1_0)) != star(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])]) ).
cnf(c_0_64,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_30]),c_0_23]) ).
cnf(c_0_65,plain,
addition(star(X1),star(star(X1))) = star(star(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_62]),c_0_23]) ).
cnf(c_0_66,negated_conjecture,
star(star(esk1_0)) != star(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_67,plain,
star(star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_62]),c_0_23]),c_0_65]),c_0_23]),c_0_59]),c_0_62]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KLE039+1 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 04:51:28 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.qFCZZOjA7e/E---3.1_8969.p
% 0.19/0.53 # Version: 3.1pre001
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # sh5l with pid 9049 completed with status 0
% 0.19/0.53 # Result found by sh5l
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.53 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.19/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.19/0.53 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 9055 completed with status 0
% 0.19/0.53 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.53 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.19/0.53 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.19/0.53 # Preprocessing time : 0.001 s
% 0.19/0.53 # Presaturation interreduction done
% 0.19/0.53
% 0.19/0.53 # Proof found!
% 0.19/0.53 # SZS status Theorem
% 0.19/0.53 # SZS output start CNFRefutation
% See solution above
% 0.19/0.53 # Parsed axioms : 17
% 0.19/0.53 # Removed by relevancy pruning/SinE : 0
% 0.19/0.53 # Initial clauses : 18
% 0.19/0.53 # Removed in clause preprocessing : 0
% 0.19/0.53 # Initial clauses in saturation : 18
% 0.19/0.53 # Processed clauses : 469
% 0.19/0.53 # ...of these trivial : 36
% 0.19/0.53 # ...subsumed : 233
% 0.19/0.53 # ...remaining for further processing : 200
% 0.19/0.53 # Other redundant clauses eliminated : 5
% 0.19/0.53 # Clauses deleted for lack of memory : 0
% 0.19/0.53 # Backward-subsumed : 37
% 0.19/0.53 # Backward-rewritten : 42
% 0.19/0.53 # Generated clauses : 2543
% 0.19/0.53 # ...of the previous two non-redundant : 1602
% 0.19/0.53 # ...aggressively subsumed : 0
% 0.19/0.53 # Contextual simplify-reflections : 4
% 0.19/0.53 # Paramodulations : 2538
% 0.19/0.53 # Factorizations : 0
% 0.19/0.53 # NegExts : 0
% 0.19/0.53 # Equation resolutions : 5
% 0.19/0.53 # Total rewrite steps : 3072
% 0.19/0.53 # Propositional unsat checks : 0
% 0.19/0.53 # Propositional check models : 0
% 0.19/0.53 # Propositional check unsatisfiable : 0
% 0.19/0.53 # Propositional clauses : 0
% 0.19/0.53 # Propositional clauses after purity: 0
% 0.19/0.53 # Propositional unsat core size : 0
% 0.19/0.53 # Propositional preprocessing time : 0.000
% 0.19/0.53 # Propositional encoding time : 0.000
% 0.19/0.53 # Propositional solver time : 0.000
% 0.19/0.53 # Success case prop preproc time : 0.000
% 0.19/0.53 # Success case prop encoding time : 0.000
% 0.19/0.53 # Success case prop solver time : 0.000
% 0.19/0.53 # Current number of processed clauses : 103
% 0.19/0.53 # Positive orientable unit clauses : 38
% 0.19/0.53 # Positive unorientable unit clauses: 6
% 0.19/0.53 # Negative unit clauses : 13
% 0.19/0.53 # Non-unit-clauses : 46
% 0.19/0.53 # Current number of unprocessed clauses: 1101
% 0.19/0.53 # ...number of literals in the above : 1907
% 0.19/0.53 # Current number of archived formulas : 0
% 0.19/0.53 # Current number of archived clauses : 97
% 0.19/0.53 # Clause-clause subsumption calls (NU) : 830
% 0.19/0.53 # Rec. Clause-clause subsumption calls : 744
% 0.19/0.53 # Non-unit clause-clause subsumptions : 153
% 0.19/0.53 # Unit Clause-clause subsumption calls : 255
% 0.19/0.53 # Rewrite failures with RHS unbound : 0
% 0.19/0.53 # BW rewrite match attempts : 162
% 0.19/0.53 # BW rewrite match successes : 58
% 0.19/0.53 # Condensation attempts : 0
% 0.19/0.53 # Condensation successes : 0
% 0.19/0.53 # Termbank termtop insertions : 25391
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.042 s
% 0.19/0.53 # System time : 0.001 s
% 0.19/0.53 # Total time : 0.043 s
% 0.19/0.53 # Maximum resident set size: 1756 pages
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.044 s
% 0.19/0.53 # System time : 0.003 s
% 0.19/0.53 # Total time : 0.047 s
% 0.19/0.53 # Maximum resident set size: 1688 pages
% 0.19/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------