TSTP Solution File: FLD063-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD063-1 : TPTP v8.1.2. Bugfixed v2.1.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 17:30:45 EDT 2023
% Result : Unsatisfiable 10.83s 1.84s
% Output : CNFRefutation 10.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of clauses : 72 ( 27 unt; 2 nHn; 72 RR)
% Number of literals : 147 ( 0 equ; 75 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',totality_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',well_definedness_of_additive_identity) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',existence_of_identity_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',a_is_defined) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',existence_of_inverse_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',b_is_defined) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',compatibility_of_equality_and_order_relation) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',transitivity_of_equality) ).
cnf(compatibility_of_equality_and_addition,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',compatibility_of_equality_and_addition) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',symmetry_of_equality) ).
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',commutativity_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',well_definedness_of_additive_inverse) ).
cnf(associativity_addition,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',associativity_addition) ).
cnf(transitivity_of_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',transitivity_of_order_relation) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_inverse(b),additive_inverse(a)),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',less_or_equal_3) ).
cnf(well_definedness_of_addition,axiom,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',well_definedness_of_addition) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(a,b),
file('/export/starexec/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p',not_less_or_equal_4) ).
cnf(c_0_18,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_19,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_18]) ).
cnf(c_0_20,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_21,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_22,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_23,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_24,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_25,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_26,plain,
less_or_equal(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_28,hypothesis,
equalish(add(additive_identity,a),a),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_addition ).
cnf(c_0_30,hypothesis,
equalish(add(b,additive_inverse(b)),additive_identity),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( less_or_equal(X1,additive_identity)
| ~ equalish(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_33,hypothesis,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_34,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,add(additive_identity,a)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,hypothesis,
( equalish(add(add(b,additive_inverse(b)),X1),add(additive_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( less_or_equal(X1,additive_identity)
| ~ equalish(additive_identity,X2)
| ~ equalish(X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_37,hypothesis,
equalish(additive_identity,add(a,additive_inverse(a))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_addition ).
cnf(c_0_39,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_40,hypothesis,
equalish(add(add(b,additive_inverse(b)),a),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22])]) ).
cnf(c_0_41,hypothesis,
( less_or_equal(X1,additive_identity)
| ~ equalish(add(a,additive_inverse(a)),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( equalish(add(X1,additive_inverse(X2)),add(additive_inverse(X2),X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,add(add(b,additive_inverse(b)),a)) ),
inference(spm,[status(thm)],[c_0_27,c_0_40]) ).
cnf(c_0_44,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
associativity_addition ).
cnf(c_0_45,hypothesis,
less_or_equal(b,b),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_46,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_47,hypothesis,
less_or_equal(add(additive_inverse(a),a),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_22])]) ).
cnf(c_0_48,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
compatibility_of_order_relation_and_addition ).
cnf(c_0_49,negated_conjecture,
less_or_equal(additive_inverse(b),additive_inverse(a)),
less_or_equal_3 ).
cnf(c_0_50,axiom,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
well_definedness_of_addition ).
cnf(c_0_51,hypothesis,
( equalish(add(b,add(additive_inverse(b),a)),a)
| ~ defined(additive_inverse(b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_22]),c_0_24])]) ).
cnf(c_0_52,hypothesis,
( less_or_equal(X1,b)
| ~ equalish(b,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_45]) ).
cnf(c_0_53,hypothesis,
equalish(add(additive_identity,b),b),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_54,hypothesis,
( less_or_equal(X1,additive_identity)
| ~ less_or_equal(X1,add(additive_inverse(a),a)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,negated_conjecture,
( less_or_equal(add(additive_inverse(b),X1),add(additive_inverse(a),X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
( equalish(add(X1,add(X2,X3)),add(add(X2,X3),X1))
| ~ defined(X1)
| ~ defined(X3)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_50]) ).
cnf(c_0_57,hypothesis,
equalish(add(b,add(additive_inverse(b),a)),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_39]),c_0_24])]) ).
cnf(c_0_58,hypothesis,
( less_or_equal(X1,b)
| ~ less_or_equal(X1,X2)
| ~ equalish(b,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_52]) ).
cnf(c_0_59,hypothesis,
equalish(b,add(additive_identity,b)),
inference(spm,[status(thm)],[c_0_32,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
less_or_equal(add(additive_inverse(b),a),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_22])]) ).
cnf(c_0_61,plain,
( equalish(X1,add(add(X2,X3),X4))
| ~ defined(X4)
| ~ defined(X3)
| ~ defined(X2)
| ~ equalish(X1,add(X4,add(X2,X3))) ),
inference(spm,[status(thm)],[c_0_27,c_0_56]) ).
cnf(c_0_62,hypothesis,
equalish(a,add(b,add(additive_inverse(b),a))),
inference(spm,[status(thm)],[c_0_32,c_0_57]) ).
cnf(c_0_63,hypothesis,
( less_or_equal(X1,b)
| ~ less_or_equal(X1,add(additive_identity,b)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( less_or_equal(add(add(additive_inverse(b),a),X1),add(additive_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_60]) ).
cnf(c_0_65,hypothesis,
( equalish(a,add(add(additive_inverse(b),a),b))
| ~ defined(additive_inverse(b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_24]),c_0_22])]) ).
cnf(c_0_66,hypothesis,
less_or_equal(add(add(additive_inverse(b),a),b),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_24])]) ).
cnf(c_0_67,hypothesis,
equalish(a,add(add(additive_inverse(b),a),b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_39]),c_0_24])]) ).
cnf(c_0_68,hypothesis,
( less_or_equal(X1,b)
| ~ equalish(add(add(additive_inverse(b),a),b),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
~ less_or_equal(a,b),
not_less_or_equal_4 ).
cnf(c_0_70,hypothesis,
equalish(add(add(additive_inverse(b),a),b),a),
inference(spm,[status(thm)],[c_0_32,c_0_67]) ).
cnf(c_0_71,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_68,c_0_69,c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD063-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 23:41:07 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.valOn1PzsS/E---3.1_22452.p
% 10.83/1.84 # Version: 3.1pre001
% 10.83/1.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.83/1.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.83/1.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.83/1.84 # Starting new_bool_3 with 300s (1) cores
% 10.83/1.84 # Starting new_bool_1 with 300s (1) cores
% 10.83/1.84 # Starting sh5l with 300s (1) cores
% 10.83/1.84 # new_bool_1 with pid 22554 completed with status 0
% 10.83/1.84 # Result found by new_bool_1
% 10.83/1.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.83/1.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.83/1.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.83/1.84 # Starting new_bool_3 with 300s (1) cores
% 10.83/1.84 # Starting new_bool_1 with 300s (1) cores
% 10.83/1.84 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.83/1.84 # Search class: FGUNF-FFMS21-SFFFFFNN
% 10.83/1.84 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 10.83/1.84 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 10.83/1.84 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 22561 completed with status 0
% 10.83/1.84 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 10.83/1.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.83/1.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.83/1.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.83/1.84 # Starting new_bool_3 with 300s (1) cores
% 10.83/1.84 # Starting new_bool_1 with 300s (1) cores
% 10.83/1.84 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.83/1.84 # Search class: FGUNF-FFMS21-SFFFFFNN
% 10.83/1.84 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 10.83/1.84 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 10.83/1.84 # Preprocessing time : 0.001 s
% 10.83/1.84 # Presaturation interreduction done
% 10.83/1.84 # SatCheck found unsatisfiable ground set
% 10.83/1.84
% 10.83/1.84 # Proof found!
% 10.83/1.84 # SZS status Unsatisfiable
% 10.83/1.84 # SZS output start CNFRefutation
% See solution above
% 10.83/1.84 # Parsed axioms : 31
% 10.83/1.84 # Removed by relevancy pruning/SinE : 5
% 10.83/1.84 # Initial clauses : 26
% 10.83/1.84 # Removed in clause preprocessing : 0
% 10.83/1.84 # Initial clauses in saturation : 26
% 10.83/1.84 # Processed clauses : 11677
% 10.83/1.84 # ...of these trivial : 117
% 10.83/1.84 # ...subsumed : 6560
% 10.83/1.84 # ...remaining for further processing : 5000
% 10.83/1.84 # Other redundant clauses eliminated : 0
% 10.83/1.84 # Clauses deleted for lack of memory : 0
% 10.83/1.84 # Backward-subsumed : 378
% 10.83/1.84 # Backward-rewritten : 120
% 10.83/1.84 # Generated clauses : 53160
% 10.83/1.84 # ...of the previous two non-redundant : 45449
% 10.83/1.84 # ...aggressively subsumed : 0
% 10.83/1.84 # Contextual simplify-reflections : 37
% 10.83/1.84 # Paramodulations : 53140
% 10.83/1.84 # Factorizations : 20
% 10.83/1.84 # NegExts : 0
% 10.83/1.84 # Equation resolutions : 0
% 10.83/1.84 # Total rewrite steps : 21162
% 10.83/1.84 # Propositional unsat checks : 1
% 10.83/1.84 # Propositional check models : 0
% 10.83/1.84 # Propositional check unsatisfiable : 1
% 10.83/1.84 # Propositional clauses : 38168
% 10.83/1.84 # Propositional clauses after purity: 7361
% 10.83/1.84 # Propositional unsat core size : 3
% 10.83/1.84 # Propositional preprocessing time : 0.000
% 10.83/1.84 # Propositional encoding time : 0.019
% 10.83/1.84 # Propositional solver time : 0.005
% 10.83/1.84 # Success case prop preproc time : 0.000
% 10.83/1.84 # Success case prop encoding time : 0.019
% 10.83/1.84 # Success case prop solver time : 0.005
% 10.83/1.84 # Current number of processed clauses : 4476
% 10.83/1.84 # Positive orientable unit clauses : 380
% 10.83/1.84 # Positive unorientable unit clauses: 0
% 10.83/1.84 # Negative unit clauses : 9
% 10.83/1.84 # Non-unit-clauses : 4087
% 10.83/1.84 # Current number of unprocessed clauses: 33692
% 10.83/1.84 # ...number of literals in the above : 114667
% 10.83/1.84 # Current number of archived formulas : 0
% 10.83/1.84 # Current number of archived clauses : 524
% 10.83/1.84 # Clause-clause subsumption calls (NU) : 1662030
% 10.83/1.84 # Rec. Clause-clause subsumption calls : 1249095
% 10.83/1.84 # Non-unit clause-clause subsumptions : 6801
% 10.83/1.84 # Unit Clause-clause subsumption calls : 15552
% 10.83/1.84 # Rewrite failures with RHS unbound : 0
% 10.83/1.84 # BW rewrite match attempts : 803
% 10.83/1.84 # BW rewrite match successes : 116
% 10.83/1.84 # Condensation attempts : 0
% 10.83/1.84 # Condensation successes : 0
% 10.83/1.84 # Termbank termtop insertions : 954414
% 10.83/1.84
% 10.83/1.84 # -------------------------------------------------
% 10.83/1.84 # User time : 1.260 s
% 10.83/1.84 # System time : 0.036 s
% 10.83/1.84 # Total time : 1.296 s
% 10.83/1.84 # Maximum resident set size: 1760 pages
% 10.83/1.84
% 10.83/1.84 # -------------------------------------------------
% 10.83/1.84 # User time : 1.261 s
% 10.83/1.84 # System time : 0.038 s
% 10.83/1.84 # Total time : 1.300 s
% 10.83/1.84 # Maximum resident set size: 1692 pages
% 10.83/1.84 % E---3.1 exiting
%------------------------------------------------------------------------------