%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE019+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:58:37 PM UTC 2026
% Result : Theorem 0.20s 0.73s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of formulae : 124 ( 90 unt; 0 def)
% Number of atoms : 199 ( 123 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 124 ( 49 ~; 44 |; 18 &)
% ( 4 <=>; 7 =>; 2 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 138 ( 4 sgn 66 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X6)
& test(X5)
& test(X4) )
=> ( leq(multiplication(X4,c(X5)),X6)
<= leq(X4,addition(X5,X6)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( addition(X4,X5) = one
& multiplication(X5,X4) = zero
& multiplication(X4,X5) = zero ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(test_4,axiom,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_4) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',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/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(c_0_16,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X6)
& test(X5)
& test(X4) )
=> ( leq(multiplication(X4,c(X5)),X6)
<= leq(X4,addition(X5,X6)) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_17,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X6)
& test(X5)
& test(X4) )
=> ( leq(X4,addition(X5,X6))
=> leq(multiplication(X4,c(X5)),X6) ) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
fof(c_0_18,plain,
! [X35,X36] :
( ( ~ test(X35)
| c(X35) = X36
| ~ complement(X35,X36) )
& ( ~ test(X35)
| complement(X35,X36)
| c(X35) != X36 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).
fof(c_0_19,plain,
! [X29,X31,X32] :
( ( test(X31)
| ~ complement(X32,X31) )
& ( complement(esk1_1(X29),X29)
| ~ test(X29) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])])]) ).
fof(c_0_20,plain,
! [X33,X34] :
( ( complement(X34,X33)
| addition(X33,X34) != one
| multiplication(X34,X33) != zero
| multiplication(X33,X34) != zero )
& ( ~ complement(X34,X33)
| addition(X33,X34) = one )
& ( ~ complement(X34,X33)
| multiplication(X34,X33) = zero )
& ( ~ complement(X34,X33)
| multiplication(X33,X34) = zero ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])]) ).
fof(c_0_21,negated_conjecture,
( ~ leq(multiplication(esk2_0,c(esk3_0)),esk4_0)
& leq(esk2_0,addition(esk3_0,esk4_0))
& test(esk4_0)
& test(esk3_0)
& test(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_22,plain,
( ~ test(X1)
| c(X1) != X2
| complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( ~ complement(X1,X2)
| test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( addition(X1,X2) != one
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_25,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_26,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_27,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_28,plain,
( ~ test(X1)
| complement(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one
| test(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_36,negated_conjecture,
complement(esk1_1(esk2_0),esk2_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_37,plain,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
inference(fof_simplification,[status(thm)],[test_4]) ).
fof(c_0_38,plain,
! [X27,X28] :
( ( leq(X27,X28)
| addition(X27,X28) != X28 )
& ( addition(X27,X28) = X28
| ~ leq(X27,X28) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_39,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_40,plain,
( ~ complement(X1,X2)
| multiplication(X1,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_41,negated_conjecture,
complement(esk2_0,c(esk2_0)),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
fof(c_0_42,plain,
! [X26] : multiplication(zero,X26) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_43,plain,
( ~ test(X1)
| ~ complement(X1,X2)
| c(X1) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_44,plain,
( multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X2,X1) != one
| test(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_45,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_46,negated_conjecture,
addition(esk2_0,esk1_1(esk2_0)) = one,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_47,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_48,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_49,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_50,plain,
! [X37] :
( c(X37) = zero
| test(X37) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])]) ).
cnf(c_0_51,negated_conjecture,
~ leq(multiplication(esk2_0,c(esk3_0)),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_52,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_53,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_54,negated_conjecture,
multiplication(esk2_0,c(esk2_0)) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_55,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_56,plain,
( multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| addition(X2,X1) != one
| c(X1) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_24]),c_0_44]) ).
cnf(c_0_57,negated_conjecture,
addition(one,esk2_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_32]) ).
cnf(c_0_58,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_59,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
fof(c_0_60,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_61,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_62,plain,
( c(X1) = zero
| test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_63,plain,
( ~ complement(X2,X1)
| multiplication(X1,X2) = zero ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_64,negated_conjecture,
addition(multiplication(esk2_0,c(esk3_0)),esk4_0) != esk4_0,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_65,negated_conjecture,
multiplication(esk2_0,multiplication(c(esk2_0),X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_66,negated_conjecture,
( esk2_0 != zero
| c(esk2_0) = one ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59])]) ).
cnf(c_0_67,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_68,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_69,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_61,c_0_32]) ).
cnf(c_0_70,plain,
( complement(X1,c(X1))
| c(X1) = zero ),
inference(spm,[status(thm)],[c_0_30,c_0_62]) ).
cnf(c_0_71,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_41]),c_0_32]) ).
cnf(c_0_72,negated_conjecture,
multiplication(c(esk2_0),esk2_0) = zero,
inference(spm,[status(thm)],[c_0_63,c_0_41]) ).
cnf(c_0_73,negated_conjecture,
addition(esk4_0,multiplication(esk2_0,c(esk3_0))) != esk4_0,
inference(rw,[status(thm)],[c_0_64,c_0_32]) ).
cnf(c_0_74,negated_conjecture,
( esk2_0 != zero
| multiplication(esk2_0,X1) = zero ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_59]) ).
cnf(c_0_75,negated_conjecture,
complement(esk1_1(esk3_0),esk3_0),
inference(spm,[status(thm)],[c_0_28,c_0_67]) ).
cnf(c_0_76,negated_conjecture,
multiplication(esk2_0,addition(c(esk2_0),X1)) = multiplication(esk2_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_54]),c_0_69]) ).
cnf(c_0_77,plain,
( c(X1) = zero
| addition(X1,c(X1)) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_70]),c_0_32]) ).
cnf(c_0_78,negated_conjecture,
c(c(esk2_0)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_71]),c_0_72]),c_0_54])]) ).
cnf(c_0_79,negated_conjecture,
esk2_0 != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_61])]) ).
cnf(c_0_80,negated_conjecture,
addition(esk3_0,esk1_1(esk3_0)) = one,
inference(spm,[status(thm)],[c_0_35,c_0_75]) ).
fof(c_0_81,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_82,negated_conjecture,
multiplication(esk2_0,esk2_0) = esk2_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_58]),c_0_78]),c_0_78]),c_0_79]) ).
cnf(c_0_83,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_58]),c_0_32]) ).
cnf(c_0_84,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[c_0_68,c_0_58]) ).
cnf(c_0_85,negated_conjecture,
addition(one,esk3_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_80]),c_0_32]) ).
cnf(c_0_86,negated_conjecture,
complement(esk3_0,c(esk3_0)),
inference(spm,[status(thm)],[c_0_30,c_0_67]) ).
cnf(c_0_87,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_88,negated_conjecture,
multiplication(esk2_0,addition(esk2_0,X1)) = multiplication(esk2_0,addition(X1,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_82]),c_0_83]) ).
cnf(c_0_89,negated_conjecture,
addition(X1,multiplication(X1,esk3_0)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_58]) ).
cnf(c_0_90,negated_conjecture,
multiplication(esk3_0,c(esk3_0)) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_86]) ).
cnf(c_0_91,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_92,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_59]),c_0_32]) ).
cnf(c_0_93,negated_conjecture,
multiplication(esk2_0,addition(one,multiplication(esk2_0,esk3_0))) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_82]),c_0_32]) ).
cnf(c_0_94,negated_conjecture,
multiplication(addition(esk3_0,X1),c(esk3_0)) = multiplication(X1,c(esk3_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_90]),c_0_69]) ).
cnf(c_0_95,negated_conjecture,
addition(X1,multiplication(X1,esk2_0)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_57]),c_0_58]) ).
cnf(c_0_96,negated_conjecture,
complement(esk1_1(esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_28,c_0_91]) ).
cnf(c_0_97,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[c_0_87,c_0_59]) ).
cnf(c_0_98,negated_conjecture,
addition(one,multiplication(esk2_0,esk3_0)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_92,c_0_93]),c_0_33]),c_0_32]),c_0_89]),c_0_57]),c_0_32]),c_0_57]),c_0_59]) ).
cnf(c_0_99,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk3_0))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_90]),c_0_53]) ).
cnf(c_0_100,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_101,negated_conjecture,
leq(esk2_0,addition(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_102,negated_conjecture,
addition(esk4_0,esk1_1(esk4_0)) = one,
inference(spm,[status(thm)],[c_0_35,c_0_96]) ).
cnf(c_0_103,negated_conjecture,
addition(X1,multiplication(esk2_0,multiplication(esk3_0,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_53]),c_0_59]) ).
cnf(c_0_104,negated_conjecture,
multiplication(esk3_0,addition(one,multiplication(esk2_0,c(esk3_0)))) = esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_99]),c_0_61]),c_0_32]) ).
cnf(c_0_105,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_86]),c_0_32]) ).
cnf(c_0_106,negated_conjecture,
multiplication(addition(esk2_0,X1),esk2_0) = multiplication(addition(X1,one),esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_82]),c_0_92]) ).
cnf(c_0_107,negated_conjecture,
addition(esk2_0,addition(esk3_0,esk4_0)) = addition(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_108,negated_conjecture,
addition(one,esk4_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_102]),c_0_32]) ).
cnf(c_0_109,negated_conjecture,
addition(one,multiplication(esk2_0,c(esk3_0))) = one,
inference(rw,[status(thm)],[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_103,c_0_104]),c_0_33]),c_0_68]),c_0_32]),c_0_105]),c_0_58]),c_0_57]) ).
cnf(c_0_110,negated_conjecture,
multiplication(addition(esk3_0,esk4_0),esk2_0) = esk2_0,
inference(rw,[status(thm)],[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_106,c_0_107]),c_0_33]),c_0_32]),c_0_108]),c_0_32]),c_0_85]),c_0_59]) ).
cnf(c_0_111,negated_conjecture,
multiplication(esk2_0,addition(esk3_0,esk4_0)) = esk2_0,
inference(rw,[status(thm)],[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_88,c_0_107]),c_0_33]),c_0_32]),c_0_108]),c_0_32]),c_0_85]),c_0_58]) ).
cnf(c_0_112,negated_conjecture,
test(c(esk3_0)),
inference(spm,[status(thm)],[c_0_23,c_0_86]) ).
cnf(c_0_113,negated_conjecture,
addition(X1,multiplication(X1,multiplication(esk2_0,c(esk3_0)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_109]),c_0_58]) ).
cnf(c_0_114,negated_conjecture,
multiplication(addition(esk3_0,esk4_0),multiplication(esk2_0,X1)) = multiplication(esk2_0,X1),
inference(spm,[status(thm)],[c_0_53,c_0_110]) ).
cnf(c_0_115,negated_conjecture,
multiplication(esk2_0,multiplication(addition(esk3_0,esk4_0),X1)) = multiplication(esk2_0,X1),
inference(spm,[status(thm)],[c_0_53,c_0_111]) ).
cnf(c_0_116,negated_conjecture,
complement(c(esk3_0),c(c(esk3_0))),
inference(spm,[status(thm)],[c_0_30,c_0_112]) ).
cnf(c_0_117,negated_conjecture,
addition(esk3_0,addition(esk4_0,multiplication(esk2_0,c(esk3_0)))) = addition(esk3_0,esk4_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_33]) ).
cnf(c_0_118,negated_conjecture,
multiplication(esk2_0,multiplication(esk4_0,c(esk3_0))) = multiplication(esk2_0,c(esk3_0)),
inference(spm,[status(thm)],[c_0_115,c_0_94]) ).
cnf(c_0_119,negated_conjecture,
addition(c(esk3_0),c(c(esk3_0))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_116]),c_0_32]) ).
cnf(c_0_120,negated_conjecture,
multiplication(addition(esk4_0,multiplication(esk2_0,c(esk3_0))),c(esk3_0)) = multiplication(esk4_0,c(esk3_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_117]),c_0_94]) ).
cnf(c_0_121,negated_conjecture,
multiplication(addition(esk2_0,esk4_0),c(esk3_0)) = multiplication(esk4_0,c(esk3_0)),
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_92,c_0_118]),c_0_87]),c_0_32]),c_0_32]),c_0_57]),c_0_59]) ).
cnf(c_0_122,negated_conjecture,
addition(one,c(esk3_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_119]),c_0_32]) ).
cnf(c_0_123,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_83,c_0_120]),c_0_33]),c_0_87]),c_0_121]),c_0_83]),c_0_32]),c_0_122]),c_0_58]),c_0_32]),c_0_122]),c_0_58]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE019+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 22:43:52 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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
% 0.20/0.73 % Version: 3.5.1
% 0.20/0.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.73 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.73 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.73 % Starting sh5l with 300s (1) cores
% 0.20/0.73 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 951546 completed with status 0
% 0.20/0.73 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.73 % No SInE strategy applied
% 0.20/0.73 % Search class: FGUSM-FFSS21-SFFFFFNN
% 0.20/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.73 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.73 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.20/0.73 % Starting new_bool_3 with 136s (1) cores
% 0.20/0.73 % Starting new_bool_1 with 136s (1) cores
% 0.20/0.73 % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 951552 completed with status 0
% 0.20/0.73 % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.20/0.73 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.73 % No SInE strategy applied
% 0.20/0.73 % Search class: FGUSM-FFSS21-SFFFFFNN
% 0.20/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.73 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.73 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.73 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.20/0.73 % Preprocessing time : 0.001 s
% 0.20/0.73 % Presaturation interreduction done
% 0.20/0.73
% 0.20/0.73 % Proof found!
% 0.20/0.73 % SZS status Theorem
% 0.20/0.73 % SZS output start CNFRefutation
% See solution above
% 0.20/0.73 % Parsed axioms : 17
% 0.20/0.73 % Removed by relevancy pruning/SinE : 0
% 0.20/0.73 % Initial clauses : 27
% 0.20/0.73 % Removed in clause preprocessing : 0
% 0.20/0.73 % Initial clauses in saturation : 27
% 0.20/0.73 % Processed clauses : 1356
% 0.20/0.73 % ...of these trivial : 178
% 0.20/0.73 % ...subsumed : 359
% 0.20/0.73 % ...remaining for further processing : 819
% 0.20/0.73 % Other redundant clauses eliminated : 318
% 0.20/0.73 % Clauses deleted for lack of memory : 0
% 0.20/0.73 % Backward-subsumed : 54
% 0.20/0.73 % Backward-rewritten : 139
% 0.20/0.73 % Generated clauses : 16211
% 0.20/0.73 % ...of the previous two non-redundant : 9250
% 0.20/0.73 % ...aggressively subsumed : 0
% 0.20/0.73 % Contextual simplify-reflections : 23
% 0.20/0.73 % Paramodulations : 15887
% 0.20/0.73 % Factorizations : 3
% 0.20/0.73 % NegExts : 0
% 0.20/0.73 % Equation resolutions : 318
% 0.20/0.73 % Disequality decompositions : 0
% 0.20/0.73 % Total rewrite steps : 32319
% 0.20/0.73 % ...of those cached : 26979
% 0.20/0.73 % Propositional unsat checks : 0
% 0.20/0.73 % Propositional check models : 0
% 0.20/0.73 % Propositional check unsatisfiable : 0
% 0.20/0.73 % Propositional clauses : 0
% 0.20/0.73 % Propositional clauses after purity: 0
% 0.20/0.73 % Propositional unsat core size : 0
% 0.20/0.73 % Propositional preprocessing time : 0.000
% 0.20/0.73 % Propositional encoding time : 0.000
% 0.20/0.73 % Propositional solver time : 0.000
% 0.20/0.73 % Success case prop preproc time : 0.000
% 0.20/0.73 % Success case prop encoding time : 0.000
% 0.20/0.73 % Success case prop solver time : 0.000
% 0.20/0.73 % Current number of processed clauses : 595
% 0.20/0.73 % Positive orientable unit clauses : 348
% 0.20/0.73 % Positive unorientable unit clauses: 7
% 0.20/0.73 % Negative unit clauses : 5
% 0.20/0.73 % Non-unit-clauses : 235
% 0.20/0.73 % Current number of unprocessed clauses: 7747
% 0.20/0.73 % ...number of literals in the above : 13270
% 0.20/0.73 % Current number of archived formulas : 0
% 0.20/0.73 % Current number of archived clauses : 223
% 0.20/0.73 % Clause-clause subsumption calls (NU) : 8342
% 0.20/0.73 % Rec. Clause-clause subsumption calls : 7517
% 0.20/0.73 % Non-unit clause-clause subsumptions : 285
% 0.20/0.73 % Unit Clause-clause subsumption calls : 467
% 0.20/0.73 % Rewrite failures with RHS unbound : 0
% 0.20/0.73 % BW rewrite match attempts : 778
% 0.20/0.73 % BW rewrite match successes : 101
% 0.20/0.73 % Condensation attempts : 0
% 0.20/0.73 % Condensation successes : 0
% 0.20/0.73 % Termbank termtop insertions : 242058
% 0.20/0.73 % Search garbage collected termcells : 200
% 0.20/0.73
% 0.20/0.73 % -------------------------------------------------
% 0.20/0.73 % User time : 0.244 s
% 0.20/0.73 % System time : 0.009 s
% 0.20/0.73 % Total time : 0.253 s
% 0.20/0.73 % Maximum resident set size: 3648 pages
% 0.20/0.73
% 0.20/0.73 % -------------------------------------------------
% 0.20/0.73 % User time : 0.938 s
% 0.20/0.73 % System time : 0.061 s
% 0.20/0.73 % Total time : 0.999 s
% 0.20/0.73 % Maximum resident set size: 4864 pages
% 0.20/0.73 % E exiting
%------------------------------------------------------------------------------