%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD049-2 : 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 : n007.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:50 PM UTC 2026
% Result : Unsatisfiable 56.11s 8.66s
% Output : CNFRefutation 56.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 20
% Syntax : Number of clauses : 109 ( 55 unt; 10 nHn; 109 RR)
% Number of literals : 213 ( 0 equ; 103 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(s_is_defined,hypothesis,
defined(s),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s_is_defined) ).
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(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_is_defined) ).
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_s_10,negated_conjecture,
equalish(multiply(c,multiplicative_inverse(d)),s),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_s_10) ).
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(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(d_not_equal_to_additive_identity_8,negated_conjecture,
~ equalish(d,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_not_equal_to_additive_identity_8) ).
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(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(multiply_equals_s_9,negated_conjecture,
equalish(multiply(a,multiplicative_inverse(b)),s),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_s_9) ).
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(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(b_not_equal_to_additive_identity_7,negated_conjecture,
~ equalish(b,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_not_equal_to_additive_identity_7) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(multiply_equals_k_11,negated_conjecture,
equalish(multiply(a,d),k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_k_11) ).
cnf(multiply_not_equal_to_k_12,negated_conjecture,
~ equalish(multiply(b,c),k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_not_equal_to_k_12) ).
cnf(c_0_20,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_21,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
c_0_20 ).
cnf(c_0_22,hypothesis,
defined(s),
s_is_defined ).
cnf(c_0_23,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_24,hypothesis,
( ~ defined(X1)
| equalish(multiply(s,X1),multiply(X1,s)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_26,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_27,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_23 ).
cnf(c_0_28,hypothesis,
equalish(multiply(s,d),multiply(d,s)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
c_0_26 ).
cnf(c_0_30,negated_conjecture,
equalish(multiply(c,multiplicative_inverse(d)),s),
multiply_equals_s_10 ).
cnf(c_0_31,hypothesis,
( ~ equalish(X1,multiply(s,d))
| equalish(X1,multiply(d,s)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(multiply(c,multiplicative_inverse(d)),X1),multiply(s,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,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_34,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_35,hypothesis,
equalish(multiply(multiply(c,multiplicative_inverse(d)),d),multiply(d,s)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]) ).
cnf(c_0_36,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
c_0_33 ).
cnf(c_0_37,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
c_0_34 ).
cnf(c_0_38,negated_conjecture,
~ equalish(d,additive_identity),
inference(fof_simplification,[status(thm)],[d_not_equal_to_additive_identity_8]) ).
cnf(c_0_39,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplication]) ).
cnf(c_0_40,hypothesis,
( ~ equalish(X1,multiply(multiply(c,multiplicative_inverse(d)),d))
| equalish(X1,multiply(d,s)) ),
inference(spm,[status(thm)],[c_0_27,c_0_35]) ).
cnf(c_0_41,plain,
( ~ defined(X2)
| ~ defined(X1)
| ~ defined(X3)
| equalish(X2,additive_identity)
| equalish(multiply(X1,multiply(multiplicative_inverse(X2),X3)),multiply(multiply(X1,multiplicative_inverse(X2)),X3)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_43,negated_conjecture,
~ equalish(d,additive_identity),
c_0_38 ).
cnf(c_0_44,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
c_0_39 ).
cnf(c_0_45,hypothesis,
equalish(multiply(c,multiply(multiplicative_inverse(d),d)),multiply(d,s)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25]),c_0_42])]),c_0_43]) ).
cnf(c_0_46,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(multiply(multiply(X1,X2),X3),multiply(X3,multiply(X1,X2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_44]) ).
cnf(c_0_47,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_48,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_49,hypothesis,
( ~ equalish(X1,multiply(c,multiply(multiplicative_inverse(d),d)))
| equalish(X1,multiply(d,s)) ),
inference(spm,[status(thm)],[c_0_27,c_0_45]) ).
cnf(c_0_50,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(X1,additive_identity)
| equalish(multiply(multiply(multiplicative_inverse(X1),X2),X3),multiply(X3,multiply(multiplicative_inverse(X1),X2))) ),
inference(spm,[status(thm)],[c_0_46,c_0_37]) ).
cnf(c_0_51,hypothesis,
equalish(multiply(s,b),multiply(b,s)),
inference(spm,[status(thm)],[c_0_24,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
equalish(multiply(a,multiplicative_inverse(b)),s),
multiply_equals_s_9 ).
cnf(c_0_53,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_54,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(multiply(multiply(X1,X2),X3),multiply(multiply(X2,X1),X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_55,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_48 ).
cnf(c_0_56,hypothesis,
equalish(multiply(multiply(multiplicative_inverse(d),d),c),multiply(d,s)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_42]),c_0_25])]),c_0_43]) ).
cnf(c_0_57,hypothesis,
( ~ equalish(X1,multiply(s,b))
| equalish(X1,multiply(b,s)) ),
inference(spm,[status(thm)],[c_0_27,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(multiply(a,multiplicative_inverse(b)),X1),multiply(s,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_52]) ).
cnf(c_0_59,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_60,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
c_0_53 ).
cnf(c_0_61,plain,
( ~ equalish(X1,multiply(multiply(X3,X2),X4))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X4)
| equalish(X1,multiply(multiply(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_27,c_0_54]) ).
cnf(c_0_62,hypothesis,
equalish(multiply(d,s),multiply(multiply(multiplicative_inverse(d),d),c)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,hypothesis,
equalish(multiply(multiply(a,multiplicative_inverse(b)),b),multiply(b,s)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_47])]) ).
cnf(c_0_64,negated_conjecture,
~ equalish(b,additive_identity),
inference(fof_simplification,[status(thm)],[b_not_equal_to_additive_identity_7]) ).
cnf(c_0_65,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
c_0_59 ).
cnf(c_0_66,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_29,c_0_60]) ).
cnf(c_0_67,hypothesis,
( ~ defined(multiplicative_inverse(d))
| equalish(multiply(d,s),multiply(multiply(d,multiplicative_inverse(d)),c)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_42]),c_0_25])]) ).
cnf(c_0_68,hypothesis,
( ~ equalish(X1,multiply(multiply(a,multiplicative_inverse(b)),b))
| equalish(X1,multiply(b,s)) ),
inference(spm,[status(thm)],[c_0_27,c_0_63]) ).
cnf(c_0_69,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_70,negated_conjecture,
~ equalish(b,additive_identity),
c_0_64 ).
cnf(c_0_71,hypothesis,
equalish(multiply(multiplicative_identity,c),c),
inference(spm,[status(thm)],[c_0_65,c_0_42]) ).
cnf(c_0_72,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_27,c_0_66]) ).
cnf(c_0_73,hypothesis,
equalish(multiply(d,s),multiply(multiply(d,multiplicative_inverse(d)),c)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_37]),c_0_25])]),c_0_43]) ).
cnf(c_0_74,hypothesis,
equalish(multiply(a,multiply(multiplicative_inverse(b),b)),multiply(b,s)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_41]),c_0_47]),c_0_69])]),c_0_70]) ).
cnf(c_0_75,hypothesis,
( ~ equalish(X1,multiply(multiplicative_identity,c))
| equalish(X1,c) ),
inference(spm,[status(thm)],[c_0_27,c_0_71]) ).
cnf(c_0_76,hypothesis,
equalish(multiply(d,s),multiply(multiplicative_identity,c)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_42]),c_0_25])]),c_0_43]) ).
cnf(c_0_77,hypothesis,
( ~ equalish(X1,multiply(a,multiply(multiplicative_inverse(b),b)))
| equalish(X1,multiply(b,s)) ),
inference(spm,[status(thm)],[c_0_27,c_0_74]) ).
cnf(c_0_78,hypothesis,
equalish(multiply(d,s),c),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_79,hypothesis,
equalish(multiply(multiply(multiplicative_inverse(b),b),a),multiply(b,s)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_50]),c_0_69]),c_0_47])]),c_0_70]) ).
cnf(c_0_80,hypothesis,
( ~ defined(X1)
| equalish(multiply(multiply(d,s),X1),multiply(c,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_78]) ).
cnf(c_0_81,hypothesis,
equalish(multiply(b,s),multiply(multiply(multiplicative_inverse(b),b),a)),
inference(spm,[status(thm)],[c_0_55,c_0_79]) ).
cnf(c_0_82,hypothesis,
equalish(multiply(multiply(d,s),b),multiply(c,b)),
inference(spm,[status(thm)],[c_0_80,c_0_47]) ).
cnf(c_0_83,hypothesis,
( ~ defined(multiplicative_inverse(b))
| equalish(multiply(b,s),multiply(multiply(b,multiplicative_inverse(b)),a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_81]),c_0_69]),c_0_47])]) ).
cnf(c_0_84,hypothesis,
equalish(multiply(c,b),multiply(multiply(d,s),b)),
inference(spm,[status(thm)],[c_0_55,c_0_82]) ).
cnf(c_0_85,hypothesis,
equalish(multiply(multiplicative_identity,a),a),
inference(spm,[status(thm)],[c_0_65,c_0_69]) ).
cnf(c_0_86,hypothesis,
equalish(multiply(b,s),multiply(multiply(b,multiplicative_inverse(b)),a)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_37]),c_0_47])]),c_0_70]) ).
cnf(c_0_87,plain,
( ~ equalish(X1,multiply(multiply(X3,X4),X2))
| ~ defined(X3)
| ~ defined(X4)
| ~ defined(X2)
| equalish(X1,multiply(X2,multiply(X3,X4))) ),
inference(spm,[status(thm)],[c_0_27,c_0_46]) ).
cnf(c_0_88,hypothesis,
equalish(multiply(c,b),multiply(multiply(s,d),b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_84]),c_0_47]),c_0_22]),c_0_25])]) ).
cnf(c_0_89,hypothesis,
( ~ equalish(X1,multiply(multiplicative_identity,a))
| equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_27,c_0_85]) ).
cnf(c_0_90,hypothesis,
equalish(multiply(b,s),multiply(multiplicative_identity,a)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_86]),c_0_69]),c_0_47])]),c_0_70]) ).
cnf(c_0_91,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_27,c_0_36]) ).
cnf(c_0_92,hypothesis,
equalish(multiply(c,b),multiply(b,multiply(s,d))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_47]),c_0_25]),c_0_22])]) ).
cnf(c_0_93,hypothesis,
equalish(multiply(b,s),a),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_94,hypothesis,
equalish(multiply(c,b),multiply(multiply(b,s),d)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_25]),c_0_22]),c_0_47])]) ).
cnf(c_0_95,negated_conjecture,
equalish(multiply(a,d),k),
multiply_equals_k_11 ).
cnf(c_0_96,hypothesis,
( ~ defined(X1)
| equalish(multiply(multiply(b,s),X1),multiply(a,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_93]) ).
cnf(c_0_97,plain,
( ~ equalish(X1,multiply(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,multiply(X2,X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_98,hypothesis,
equalish(multiply(multiply(b,s),d),multiply(c,b)),
inference(spm,[status(thm)],[c_0_55,c_0_94]) ).
cnf(c_0_99,negated_conjecture,
( ~ equalish(X1,multiply(a,d))
| equalish(X1,k) ),
inference(spm,[status(thm)],[c_0_27,c_0_95]) ).
cnf(c_0_100,hypothesis,
equalish(multiply(multiply(b,s),d),multiply(a,d)),
inference(spm,[status(thm)],[c_0_96,c_0_25]) ).
cnf(c_0_101,hypothesis,
equalish(multiply(multiply(b,s),d),multiply(b,c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_47]),c_0_42])]) ).
cnf(c_0_102,negated_conjecture,
equalish(multiply(multiply(b,s),d),k),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,hypothesis,
( ~ equalish(X1,multiply(multiply(b,s),d))
| equalish(X1,multiply(b,c)) ),
inference(spm,[status(thm)],[c_0_27,c_0_101]) ).
cnf(c_0_104,negated_conjecture,
equalish(k,multiply(multiply(b,s),d)),
inference(spm,[status(thm)],[c_0_55,c_0_102]) ).
cnf(c_0_105,negated_conjecture,
~ equalish(multiply(b,c),k),
inference(fof_simplification,[status(thm)],[multiply_not_equal_to_k_12]) ).
cnf(c_0_106,hypothesis,
equalish(k,multiply(b,c)),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_107,negated_conjecture,
~ equalish(multiply(b,c),k),
c_0_105 ).
cnf(c_0_108,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_106]),c_0_107]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD049-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 15:39:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 56.11/8.66 % Version: 3.5.1
% 56.11/8.66 % Preprocessing class: FSMSSMSMSSSNFFN.
% 56.11/8.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.11/8.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 56.11/8.66 % Starting new_bool_3 with 300s (1) cores
% 56.11/8.66 % Starting new_bool_1 with 300s (1) cores
% 56.11/8.66 % Starting sh5l with 300s (1) cores
% 56.11/8.66 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1447746 completed with status 0
% 56.11/8.66 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 56.11/8.66 % Preprocessing class: FSMSSMSMSSSNFFN.
% 56.11/8.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.11/8.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 56.11/8.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 56.11/8.66 % No SInE strategy applied
% 56.11/8.66 % Search class: FGUNF-FFMM21-SFFFFFNN
% 56.11/8.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 56.11/8.66 % Starting SubtermCWHack with 136s (1) cores
% 56.11/8.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 56.11/8.66 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 56.11/8.66 % Starting new_bool_3 with 269s (1) cores
% 56.11/8.66 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 56.11/8.66 % G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 1447757 completed with status 0
% 56.11/8.66 % Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 56.11/8.66 % Preprocessing class: FSMSSMSMSSSNFFN.
% 56.11/8.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.11/8.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 56.11/8.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 56.11/8.66 % No SInE strategy applied
% 56.11/8.66 % Search class: FGUNF-FFMM21-SFFFFFNN
% 56.11/8.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 56.11/8.66 % Starting SubtermCWHack with 136s (1) cores
% 56.11/8.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 56.11/8.66 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 56.11/8.66 % Starting new_bool_3 with 269s (1) cores
% 56.11/8.66 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 56.11/8.66 % Preprocessing time : 0.002 s
% 56.11/8.66 % Presaturation interreduction done
% 56.11/8.66
% 56.11/8.66 % Proof found!
% 56.11/8.66 % SZS status Unsatisfiable
% 56.11/8.66 % SZS output start CNFRefutation
% See solution above
% 56.11/8.66 % Parsed axioms : 39
% 56.11/8.66 % Removed by relevancy pruning/SinE : 0
% 56.11/8.66 % Initial clauses : 39
% 56.11/8.66 % Removed in clause preprocessing : 0
% 56.11/8.66 % Initial clauses in saturation : 39
% 56.11/8.66 % Processed clauses : 25802
% 56.11/8.66 % ...of these trivial : 9291
% 56.11/8.66 % ...subsumed : 1808
% 56.11/8.66 % ...remaining for further processing : 14703
% 56.11/8.66 % Other redundant clauses eliminated : 0
% 56.11/8.66 % Clauses deleted for lack of memory : 0
% 56.11/8.66 % Backward-subsumed : 2
% 56.11/8.66 % Backward-rewritten : 132
% 56.11/8.66 % Generated clauses : 227517
% 56.11/8.66 % ...of the previous two non-redundant : 192022
% 56.11/8.66 % ...aggressively subsumed : 0
% 56.11/8.66 % Contextual simplify-reflections : 20
% 56.11/8.66 % Paramodulations : 227509
% 56.11/8.66 % Factorizations : 8
% 56.11/8.66 % NegExts : 0
% 56.11/8.66 % Equation resolutions : 0
% 56.11/8.66 % Disequality decompositions : 0
% 56.11/8.66 % Total rewrite steps : 107805
% 56.11/8.66 % ...of those cached : 99154
% 56.11/8.66 % Propositional unsat checks : 0
% 56.11/8.66 % Propositional check models : 0
% 56.11/8.66 % Propositional check unsatisfiable : 0
% 56.11/8.66 % Propositional clauses : 0
% 56.11/8.66 % Propositional clauses after purity: 0
% 56.11/8.66 % Propositional unsat core size : 0
% 56.11/8.66 % Propositional preprocessing time : 0.000
% 56.11/8.66 % Propositional encoding time : 0.000
% 56.11/8.66 % Propositional solver time : 0.000
% 56.11/8.66 % Success case prop preproc time : 0.000
% 56.11/8.66 % Success case prop encoding time : 0.000
% 56.11/8.66 % Success case prop solver time : 0.000
% 56.11/8.66 % Current number of processed clauses : 14530
% 56.11/8.66 % Positive orientable unit clauses : 9586
% 56.11/8.66 % Positive unorientable unit clauses: 0
% 56.11/8.66 % Negative unit clauses : 4
% 56.11/8.66 % Non-unit-clauses : 4940
% 56.11/8.66 % Current number of unprocessed clauses: 166296
% 56.11/8.66 % ...number of literals in the above : 429086
% 56.11/8.66 % Current number of archived formulas : 0
% 56.11/8.66 % Current number of archived clauses : 173
% 56.11/8.66 % Clause-clause subsumption calls (NU) : 1065840
% 56.11/8.66 % Rec. Clause-clause subsumption calls : 758587
% 56.11/8.66 % Non-unit clause-clause subsumptions : 1830
% 56.11/8.66 % Unit Clause-clause subsumption calls : 396762
% 56.11/8.66 % Rewrite failures with RHS unbound : 0
% 56.11/8.66 % BW rewrite match attempts : 92838
% 56.11/8.66 % BW rewrite match successes : 125
% 56.11/8.66 % Condensation attempts : 0
% 56.11/8.66 % Condensation successes : 0
% 56.11/8.66 % Termbank termtop insertions : 3649698
% 56.11/8.66 % Search garbage collected termcells : 75
% 56.11/8.66
% 56.11/8.66 % -------------------------------------------------
% 56.11/8.66 % User time : 7.636 s
% 56.11/8.66 % System time : 0.301 s
% 56.11/8.66 % Total time : 7.937 s
% 56.11/8.66 % Maximum resident set size: 3660 pages
% 56.11/8.66
% 56.11/8.66 % -------------------------------------------------
% 56.11/8.66 % User time : 38.144 s
% 56.11/8.66 % System time : 1.542 s
% 56.11/8.66 % Total time : 39.686 s
% 56.11/8.66 % Maximum resident set size: 4608 pages
% 56.11/8.66 % E exiting
%------------------------------------------------------------------------------