%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD033-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:22:46 PM UTC 2026
% Result : Unsatisfiable 29.09s 5.62s
% Output : CNFRefutation 29.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of clauses : 61 ( 20 unt; 9 nHn; 61 RR)
% Number of literals : 141 ( 0 equ; 77 neg)
% Maximal clause size : 5 ( 2 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 : 76 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(existence_of_inverse_multiplication,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
cnf(compatibility_of_equality_and_multiplication,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
cnf(multiply_equals_a_4,negated_conjecture,
equalish(multiply(m,a),a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_a_4) ).
cnf(a_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
cnf(associativity_multiplication,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',associativity_multiplication) ).
cnf(m_is_defined,hypothesis,
defined(m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_is_defined) ).
cnf(commutativity_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_multiplication) ).
cnf(well_definedness_of_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplication) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).
cnf(m_not_equal_to_multiplicative_identity_5,negated_conjecture,
~ equalish(m,multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_not_equal_to_multiplicative_identity_5) ).
cnf(c_0_14,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_15,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_multiplication]) ).
cnf(c_0_16,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_multiplication]) ).
cnf(c_0_17,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_14 ).
cnf(c_0_18,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
c_0_15 ).
cnf(c_0_19,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
equalish(multiply(m,a),a),
multiply_equals_a_4 ).
cnf(c_0_21,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[a_not_equal_to_additive_identity_3]) ).
cnf(c_0_22,plain,
( ~ equalish(X2,multiply(X1,multiplicative_inverse(X1)))
| ~ defined(X1)
| equalish(X2,multiplicative_identity)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(multiply(m,a),X1),multiply(a,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_25,negated_conjecture,
~ equalish(a,additive_identity),
c_0_21 ).
cnf(c_0_26,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_27,negated_conjecture,
( ~ defined(multiplicative_inverse(a))
| equalish(multiply(multiply(m,a),multiplicative_inverse(a)),multiplicative_identity) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_28,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
equalish(multiply(multiply(m,a),multiplicative_inverse(a)),multiplicative_identity),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24])]),c_0_25]) ).
cnf(c_0_30,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication]) ).
cnf(c_0_31,negated_conjecture,
( ~ equalish(X1,multiply(multiply(m,a),multiplicative_inverse(a)))
| equalish(X1,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_32,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
c_0_30 ).
cnf(c_0_33,hypothesis,
defined(m),
m_is_defined ).
cnf(c_0_34,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_35,negated_conjecture,
( ~ defined(multiplicative_inverse(a))
| equalish(multiply(m,multiply(a,multiplicative_inverse(a))),multiplicative_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]),c_0_33])]) ).
cnf(c_0_36,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
c_0_34 ).
cnf(c_0_37,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplication]) ).
cnf(c_0_38,negated_conjecture,
equalish(multiply(m,multiply(a,multiplicative_inverse(a))),multiplicative_identity),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_24])]),c_0_25]) ).
cnf(c_0_39,plain,
( ~ equalish(X1,multiply(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,multiply(X2,X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_40,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
( ~ equalish(X1,multiply(m,multiply(a,multiplicative_inverse(a))))
| equalish(X1,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_38]) ).
cnf(c_0_42,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(multiply(X1,multiply(X2,X3)),multiply(X3,multiply(X1,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_40]) ).
cnf(c_0_43,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_44,negated_conjecture,
( ~ defined(multiplicative_inverse(a))
| equalish(multiply(a,multiply(multiplicative_inverse(a),m)),multiplicative_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_33]),c_0_24])]) ).
cnf(c_0_45,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_43 ).
cnf(c_0_46,negated_conjecture,
equalish(multiply(a,multiply(multiplicative_inverse(a),m)),multiplicative_identity),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_28]),c_0_24])]),c_0_25]) ).
cnf(c_0_47,plain,
( ~ equalish(X1,multiply(X2,multiply(X3,X4)))
| ~ defined(X2)
| ~ defined(X3)
| ~ defined(X4)
| equalish(X1,multiply(multiply(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_48,negated_conjecture,
equalish(multiplicative_identity,multiply(a,multiply(multiplicative_inverse(a),m))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_50,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(X1,additive_identity)
| equalish(multiply(multiply(X1,multiplicative_inverse(X1)),X2),multiply(multiplicative_identity,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_51,negated_conjecture,
( ~ defined(multiplicative_inverse(a))
| equalish(multiplicative_identity,multiply(multiply(a,multiplicative_inverse(a)),m)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_33]),c_0_24])]) ).
cnf(c_0_52,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
c_0_49 ).
cnf(c_0_53,plain,
( ~ equalish(X1,multiply(multiply(X3,multiplicative_inverse(X3)),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X3,additive_identity)
| equalish(X1,multiply(multiplicative_identity,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
equalish(multiplicative_identity,multiply(multiply(a,multiplicative_inverse(a)),m)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_28]),c_0_24])]),c_0_25]) ).
cnf(c_0_55,plain,
( ~ equalish(X1,multiply(multiplicative_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
equalish(multiplicative_identity,multiply(multiplicative_identity,m)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_33]),c_0_24])]),c_0_25]) ).
cnf(c_0_57,negated_conjecture,
~ equalish(m,multiplicative_identity),
inference(fof_simplification,[status(thm)],[m_not_equal_to_multiplicative_identity_5]) ).
cnf(c_0_58,negated_conjecture,
equalish(multiplicative_identity,m),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_33])]) ).
cnf(c_0_59,negated_conjecture,
~ equalish(m,multiplicative_identity),
c_0_57 ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD033-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.49 % Computer : n009.cluster.edu
% 0.21/0.49 % Model : x86_64 x86_64
% 0.21/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.49 % Memory : 8046.5625MB
% 0.21/0.49 % OS : Linux 6.8.0-71-generic
% 0.21/0.49 % CPULimit : 300
% 0.21/0.49 % WCLimit : 300
% 0.21/0.49 % DateTime : Mon Sep 21 15:39:13 UTC 2026
% 0.21/0.49 % CPUTime :
% 0.21/0.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.57 Running first-order theorem proving
% 0.25/0.57 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/benchmark/theBenchmark.p
% 29.09/5.62 % Version: 3.5.1
% 29.09/5.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 29.09/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.09/5.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.09/5.62 % Starting new_bool_3 with 300s (1) cores
% 29.09/5.62 % Starting new_bool_1 with 300s (1) cores
% 29.09/5.62 % Starting sh5l with 300s (1) cores
% 29.09/5.62 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2117636 completed with status 0
% 29.09/5.62 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 29.09/5.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 29.09/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.09/5.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.09/5.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 29.09/5.62 % No SInE strategy applied
% 29.09/5.62 % Search class: FGUNF-FFMS21-SFFFFFNN
% 29.09/5.62 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 29.09/5.62 % Starting SubtermCWHack with 136s (1) cores
% 29.09/5.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 29.09/5.62 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 29.09/5.62 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 29.09/5.62 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 29.09/5.62 % G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 2117642 completed with status 0
% 29.09/5.62 % Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 29.09/5.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 29.09/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.09/5.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 29.09/5.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 29.09/5.62 % No SInE strategy applied
% 29.09/5.62 % Search class: FGUNF-FFMS21-SFFFFFNN
% 29.09/5.62 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 29.09/5.62 % Starting SubtermCWHack with 136s (1) cores
% 29.09/5.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 29.09/5.62 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 29.09/5.62 % Preprocessing time : 0.002 s
% 29.09/5.62 % Presaturation interreduction done
% 29.09/5.62
% 29.09/5.62 % Proof found!
% 29.09/5.62 % SZS status Unsatisfiable
% 29.09/5.62 % SZS output start CNFRefutation
% See solution above
% 29.09/5.62 % Parsed axioms : 32
% 29.09/5.62 % Removed by relevancy pruning/SinE : 0
% 29.09/5.62 % Initial clauses : 32
% 29.09/5.62 % Removed in clause preprocessing : 0
% 29.09/5.62 % Initial clauses in saturation : 32
% 29.09/5.62 % Processed clauses : 14116
% 29.09/5.62 % ...of these trivial : 4559
% 29.09/5.62 % ...subsumed : 1698
% 29.09/5.62 % ...remaining for further processing : 7859
% 29.09/5.62 % Other redundant clauses eliminated : 0
% 29.09/5.62 % Clauses deleted for lack of memory : 0
% 29.09/5.62 % Backward-subsumed : 41
% 29.09/5.62 % Backward-rewritten : 286
% 29.09/5.62 % Generated clauses : 201869
% 29.09/5.62 % ...of the previous two non-redundant : 156477
% 29.09/5.62 % ...aggressively subsumed : 0
% 29.09/5.62 % Contextual simplify-reflections : 78
% 29.09/5.62 % Paramodulations : 201853
% 29.09/5.62 % Factorizations : 16
% 29.09/5.62 % NegExts : 0
% 29.09/5.62 % Equation resolutions : 0
% 29.09/5.62 % Disequality decompositions : 0
% 29.09/5.62 % Total rewrite steps : 111207
% 29.09/5.62 % ...of those cached : 108184
% 29.09/5.62 % Propositional unsat checks : 0
% 29.09/5.62 % Propositional check models : 0
% 29.09/5.62 % Propositional check unsatisfiable : 0
% 29.09/5.62 % Propositional clauses : 0
% 29.09/5.62 % Propositional clauses after purity: 0
% 29.09/5.62 % Propositional unsat core size : 0
% 29.09/5.62 % Propositional preprocessing time : 0.000
% 29.09/5.62 % Propositional encoding time : 0.000
% 29.09/5.62 % Propositional solver time : 0.000
% 29.09/5.62 % Success case prop preproc time : 0.000
% 29.09/5.62 % Success case prop encoding time : 0.000
% 29.09/5.62 % Success case prop solver time : 0.000
% 29.09/5.62 % Current number of processed clauses : 7500
% 29.09/5.62 % Positive orientable unit clauses : 3636
% 29.09/5.62 % Positive unorientable unit clauses: 0
% 29.09/5.62 % Negative unit clauses : 3
% 29.09/5.62 % Non-unit-clauses : 3861
% 29.09/5.62 % Current number of unprocessed clauses: 142385
% 29.09/5.62 % ...number of literals in the above : 313685
% 29.09/5.62 % Current number of archived formulas : 0
% 29.09/5.62 % Current number of archived clauses : 359
% 29.09/5.62 % Clause-clause subsumption calls (NU) : 642536
% 29.09/5.62 % Rec. Clause-clause subsumption calls : 515313
% 29.09/5.62 % Non-unit clause-clause subsumptions : 1817
% 29.09/5.62 % Unit Clause-clause subsumption calls : 60537
% 29.09/5.62 % Rewrite failures with RHS unbound : 0
% 29.09/5.62 % BW rewrite match attempts : 41512
% 29.09/5.62 % BW rewrite match successes : 280
% 29.09/5.62 % Condensation attempts : 0
% 29.09/5.62 % Condensation successes : 0
% 29.09/5.62 % Termbank termtop insertions : 3162147
% 29.09/5.62 % Search garbage collected termcells : 73
% 29.09/5.62
% 29.09/5.62 % -------------------------------------------------
% 29.09/5.62 % User time : 4.693 s
% 29.09/5.62 % System time : 0.171 s
% 29.09/5.62 % Total time : 4.864 s
% 29.09/5.62 % Maximum resident set size: 3628 pages
% 29.09/5.62
% 29.09/5.62 % -------------------------------------------------
% 29.09/5.62 % User time : 23.580 s
% 29.09/5.62 % System time : 0.836 s
% 29.09/5.62 % Total time : 24.416 s
% 29.09/5.62 % Maximum resident set size: 4864 pages
% 29.09/5.62 % E exiting
%------------------------------------------------------------------------------