TSTP Solution File: FLD027-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD027-1 : TPTP v8.1.2. Bugfixed v2.1.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 17:30:00 EDT 2023
% Result : Unsatisfiable 3.00s 0.79s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of clauses : 67 ( 29 unt; 4 nHn; 67 RR)
% Number of literals : 126 ( 0 equ; 62 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_multiplication,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',existence_of_identity_multiplication) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',b_is_defined) ).
cnf(existence_of_inverse_multiplication,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',existence_of_inverse_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',a_is_defined) ).
cnf(a_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',a_not_equal_to_additive_identity_3) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',transitivity_of_equality) ).
cnf(compatibility_of_equality_and_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',compatibility_of_equality_and_multiplication) ).
cnf(commutativity_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',commutativity_multiplication) ).
cnf(well_definedness_of_multiplication,axiom,
( defined(multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',well_definedness_of_multiplication) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',well_definedness_of_multiplicative_inverse) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',symmetry_of_equality) ).
cnf(associativity_multiplication,axiom,
( equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',associativity_multiplication) ).
cnf(b_not_equal_to_additive_identity_4,negated_conjecture,
~ equalish(b,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',b_not_equal_to_additive_identity_4) ).
cnf(multiplicative_inverses_equal,negated_conjecture,
equalish(multiplicative_inverse(a),multiplicative_inverse(b)),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',multiplicative_inverses_equal) ).
cnf(a_not_equal_to_b_6,negated_conjecture,
~ equalish(a,b),
file('/export/starexec/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p',a_not_equal_to_b_6) ).
cnf(c_0_15,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_16,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_17,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_18,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_19,negated_conjecture,
~ equalish(a,additive_identity),
a_not_equal_to_additive_identity_3 ).
cnf(c_0_20,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_21,hypothesis,
equalish(multiply(multiplicative_identity,b),b),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_multiplication ).
cnf(c_0_23,hypothesis,
equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,multiply(multiplicative_identity,b)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
( equalish(multiply(multiply(a,multiplicative_inverse(a)),X1),multiply(multiplicative_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,hypothesis,
equalish(multiply(multiply(a,multiplicative_inverse(a)),b),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16])]) ).
cnf(c_0_27,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_multiplication ).
cnf(c_0_28,axiom,
( defined(multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
well_definedness_of_multiplication ).
cnf(c_0_29,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
well_definedness_of_multiplicative_inverse ).
cnf(c_0_30,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,multiply(multiply(a,multiplicative_inverse(a)),b)) ),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_31,plain,
( equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X2,X3),X1))
| ~ defined(X1)
| ~ defined(X3)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,hypothesis,
defined(multiplicative_inverse(a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_19]) ).
cnf(c_0_33,hypothesis,
equalish(multiply(b,multiply(a,multiplicative_inverse(a))),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]),c_0_32]),c_0_18])]) ).
cnf(c_0_34,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_35,axiom,
( equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
associativity_multiplication ).
cnf(c_0_36,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,multiply(b,multiply(a,multiplicative_inverse(a)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_37,plain,
( equalish(multiply(multiply(X1,X2),X3),multiply(X1,multiply(X2,X3)))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
~ equalish(b,additive_identity),
b_not_equal_to_additive_identity_4 ).
cnf(c_0_39,hypothesis,
equalish(multiply(multiply(b,a),multiplicative_inverse(a)),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32]),c_0_18]),c_0_16])]) ).
cnf(c_0_40,hypothesis,
equalish(multiply(multiplicative_identity,a),a),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_41,hypothesis,
equalish(multiply(b,multiplicative_inverse(b)),multiplicative_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_38]) ).
cnf(c_0_42,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,multiply(multiply(b,a),multiplicative_inverse(a))) ),
inference(spm,[status(thm)],[c_0_20,c_0_39]) ).
cnf(c_0_43,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,multiply(multiplicative_identity,a)) ),
inference(spm,[status(thm)],[c_0_20,c_0_40]) ).
cnf(c_0_44,hypothesis,
( equalish(multiply(multiply(b,multiplicative_inverse(b)),X1),multiply(multiplicative_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_41]) ).
cnf(c_0_45,hypothesis,
equalish(multiplicative_identity,multiply(b,multiplicative_inverse(b))),
inference(spm,[status(thm)],[c_0_34,c_0_41]) ).
cnf(c_0_46,hypothesis,
equalish(multiply(multiplicative_inverse(a),multiply(b,a)),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_31]),c_0_32]),c_0_18]),c_0_16])]) ).
cnf(c_0_47,hypothesis,
equalish(multiply(multiply(b,multiplicative_inverse(b)),a),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_18])]) ).
cnf(c_0_48,hypothesis,
( equalish(X1,multiply(b,multiplicative_inverse(b)))
| ~ equalish(X1,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_49,hypothesis,
( equalish(multiply(X1,b),multiply(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_50,hypothesis,
defined(multiplicative_inverse(b)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_16]),c_0_38]) ).
cnf(c_0_51,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,multiply(multiplicative_inverse(a),multiply(b,a))) ),
inference(spm,[status(thm)],[c_0_20,c_0_46]) ).
cnf(c_0_52,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,multiply(multiply(b,multiplicative_inverse(b)),a)) ),
inference(spm,[status(thm)],[c_0_20,c_0_47]) ).
cnf(c_0_53,hypothesis,
( equalish(multiply(X1,X2),multiply(multiply(b,multiplicative_inverse(b)),X2))
| ~ defined(X2)
| ~ equalish(X1,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_22,c_0_48]) ).
cnf(c_0_54,hypothesis,
( equalish(X1,multiplicative_identity)
| ~ equalish(X1,multiply(b,multiplicative_inverse(b))) ),
inference(spm,[status(thm)],[c_0_20,c_0_41]) ).
cnf(c_0_55,hypothesis,
equalish(multiply(multiplicative_inverse(b),b),multiply(b,multiplicative_inverse(b))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,hypothesis,
equalish(multiply(multiply(multiplicative_inverse(a),b),a),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_37]),c_0_18]),c_0_16]),c_0_32])]) ).
cnf(c_0_57,hypothesis,
( equalish(multiply(X1,a),a)
| ~ equalish(X1,multiplicative_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_18])]) ).
cnf(c_0_58,hypothesis,
equalish(multiply(multiplicative_inverse(b),b),multiplicative_identity),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
equalish(multiplicative_inverse(a),multiplicative_inverse(b)),
multiplicative_inverses_equal ).
cnf(c_0_60,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,multiply(multiply(multiplicative_inverse(a),b),a)) ),
inference(spm,[status(thm)],[c_0_20,c_0_56]) ).
cnf(c_0_61,hypothesis,
( equalish(a,multiply(X1,a))
| ~ equalish(X1,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_34,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
~ equalish(a,b),
a_not_equal_to_b_6 ).
cnf(c_0_63,hypothesis,
( equalish(X1,multiplicative_identity)
| ~ equalish(X1,multiply(multiplicative_inverse(b),b)) ),
inference(spm,[status(thm)],[c_0_20,c_0_58]) ).
cnf(c_0_64,negated_conjecture,
( equalish(multiply(multiplicative_inverse(a),X1),multiply(multiplicative_inverse(b),X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_59]) ).
cnf(c_0_65,hypothesis,
~ equalish(multiply(multiplicative_inverse(a),b),multiplicative_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_16])]),c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : FLD027-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n031.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 23:50:43 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.QzvHREp6cA/E---3.1_13246.p
% 3.00/0.79 # Version: 3.1pre001
% 3.00/0.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.00/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.00/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.00/0.79 # Starting new_bool_3 with 300s (1) cores
% 3.00/0.79 # Starting new_bool_1 with 300s (1) cores
% 3.00/0.79 # Starting sh5l with 300s (1) cores
% 3.00/0.79 # new_bool_3 with pid 13326 completed with status 0
% 3.00/0.79 # Result found by new_bool_3
% 3.00/0.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.00/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.00/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.00/0.79 # Starting new_bool_3 with 300s (1) cores
% 3.00/0.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.00/0.79 # Search class: FGUNF-FFMS21-SFFFFFNN
% 3.00/0.79 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.00/0.79 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 3.00/0.79 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 13330 completed with status 0
% 3.00/0.79 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 3.00/0.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.00/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.00/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.00/0.79 # Starting new_bool_3 with 300s (1) cores
% 3.00/0.79 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.00/0.79 # Search class: FGUNF-FFMS21-SFFFFFNN
% 3.00/0.79 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.00/0.79 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 3.00/0.79 # Preprocessing time : 0.001 s
% 3.00/0.79 # Presaturation interreduction done
% 3.00/0.79
% 3.00/0.79 # Proof found!
% 3.00/0.79 # SZS status Unsatisfiable
% 3.00/0.79 # SZS output start CNFRefutation
% See solution above
% 3.00/0.79 # Parsed axioms : 33
% 3.00/0.79 # Removed by relevancy pruning/SinE : 2
% 3.00/0.79 # Initial clauses : 31
% 3.00/0.79 # Removed in clause preprocessing : 0
% 3.00/0.79 # Initial clauses in saturation : 31
% 3.00/0.79 # Processed clauses : 3562
% 3.00/0.79 # ...of these trivial : 51
% 3.00/0.79 # ...subsumed : 1548
% 3.00/0.79 # ...remaining for further processing : 1963
% 3.00/0.79 # Other redundant clauses eliminated : 0
% 3.00/0.79 # Clauses deleted for lack of memory : 0
% 3.00/0.79 # Backward-subsumed : 227
% 3.00/0.79 # Backward-rewritten : 1
% 3.00/0.79 # Generated clauses : 13380
% 3.00/0.79 # ...of the previous two non-redundant : 11603
% 3.00/0.79 # ...aggressively subsumed : 0
% 3.00/0.79 # Contextual simplify-reflections : 32
% 3.00/0.79 # Paramodulations : 13350
% 3.00/0.79 # Factorizations : 26
% 3.00/0.79 # NegExts : 0
% 3.00/0.79 # Equation resolutions : 0
% 3.00/0.79 # Total rewrite steps : 4649
% 3.00/0.79 # Propositional unsat checks : 0
% 3.00/0.79 # Propositional check models : 0
% 3.00/0.79 # Propositional check unsatisfiable : 0
% 3.00/0.79 # Propositional clauses : 0
% 3.00/0.79 # Propositional clauses after purity: 0
% 3.00/0.79 # Propositional unsat core size : 0
% 3.00/0.79 # Propositional preprocessing time : 0.000
% 3.00/0.79 # Propositional encoding time : 0.000
% 3.00/0.79 # Propositional solver time : 0.000
% 3.00/0.79 # Success case prop preproc time : 0.000
% 3.00/0.79 # Success case prop encoding time : 0.000
% 3.00/0.79 # Success case prop solver time : 0.000
% 3.00/0.79 # Current number of processed clauses : 1700
% 3.00/0.79 # Positive orientable unit clauses : 328
% 3.00/0.79 # Positive unorientable unit clauses: 0
% 3.00/0.79 # Negative unit clauses : 91
% 3.00/0.79 # Non-unit-clauses : 1281
% 3.00/0.79 # Current number of unprocessed clauses: 7967
% 3.00/0.79 # ...number of literals in the above : 22025
% 3.00/0.79 # Current number of archived formulas : 0
% 3.00/0.79 # Current number of archived clauses : 263
% 3.00/0.79 # Clause-clause subsumption calls (NU) : 292216
% 3.00/0.79 # Rec. Clause-clause subsumption calls : 225404
% 3.00/0.79 # Non-unit clause-clause subsumptions : 1351
% 3.00/0.79 # Unit Clause-clause subsumption calls : 26309
% 3.00/0.79 # Rewrite failures with RHS unbound : 0
% 3.00/0.79 # BW rewrite match attempts : 138
% 3.00/0.79 # BW rewrite match successes : 1
% 3.00/0.79 # Condensation attempts : 0
% 3.00/0.79 # Condensation successes : 0
% 3.00/0.79 # Termbank termtop insertions : 181243
% 3.00/0.79
% 3.00/0.79 # -------------------------------------------------
% 3.00/0.79 # User time : 0.356 s
% 3.00/0.79 # System time : 0.012 s
% 3.00/0.79 # Total time : 0.369 s
% 3.00/0.79 # Maximum resident set size: 1628 pages
% 3.00/0.79
% 3.00/0.79 # -------------------------------------------------
% 3.00/0.79 # User time : 0.357 s
% 3.00/0.79 # System time : 0.014 s
% 3.00/0.79 # Total time : 0.372 s
% 3.00/0.79 # Maximum resident set size: 1696 pages
% 3.00/0.79 % E---3.1 exiting
% 3.00/0.79 % E---3.1 exiting
%------------------------------------------------------------------------------