TSTP Solution File: KLE010+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE010+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 18:04:36 EDT 2023
% Result : Theorem 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 15
% Syntax : Number of formulae : 122 ( 77 unt; 0 def)
% Number of atoms : 199 ( 112 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 142 ( 65 ~; 56 |; 14 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 147 ( 5 sgn; 58 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',test_3) ).
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> ( leq(one,addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))
& leq(addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one) ) ),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',goals) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',test_2) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',additive_commutativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',left_annihilation) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',test_1) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',multiplicative_left_identity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',multiplicative_associativity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',left_distributivity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',multiplicative_right_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',additive_idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p',order) ).
fof(c_0_15,plain,
! [X29,X30] :
( ( c(X29) != X30
| complement(X29,X30)
| ~ test(X29) )
& ( ~ complement(X29,X30)
| c(X29) = X30
| ~ test(X29) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_16,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> ( leq(one,addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))
& leq(addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))),one) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_17,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,negated_conjecture,
( test(esk2_0)
& test(esk1_0)
& ( ~ leq(one,addition(addition(addition(addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0)),multiplication(esk1_0,esk2_0)),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))))
| ~ leq(addition(addition(addition(addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0)),multiplication(esk1_0,esk2_0)),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))),one) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_19,plain,
! [X12,X13] :
( ( multiplication(X12,X13) = zero
| ~ complement(X13,X12) )
& ( multiplication(X13,X12) = zero
| ~ complement(X13,X12) )
& ( addition(X12,X13) = one
| ~ complement(X13,X12) )
& ( multiplication(X12,X13) != zero
| multiplication(X13,X12) != zero
| addition(X12,X13) != one
| complement(X13,X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_20,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
complement(esk2_0,c(esk2_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
zero = multiplication(c(esk2_0),esk2_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( multiplication(X1,X2) = multiplication(c(esk2_0),esk2_0)
| ~ complement(X1,X2) ),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
multiplication(c(esk2_0),esk2_0) = multiplication(esk2_0,c(esk2_0)),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
( multiplication(X1,X2) = multiplication(esk2_0,c(esk2_0))
| ~ complement(X2,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_25]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
complement(esk1_0,c(esk1_0)),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
multiplication(esk2_0,c(esk2_0)) = multiplication(c(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_32,plain,
! [X36] : addition(X36,zero) = X36,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_33,plain,
! [X14,X15] : addition(X14,X15) = addition(X15,X14),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_34,plain,
( multiplication(X1,X2) = multiplication(c(esk1_0),esk1_0)
| ~ complement(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_31]) ).
cnf(c_0_35,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_37,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_38,plain,
! [X38] : multiplication(zero,X38) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_39,negated_conjecture,
multiplication(c(esk1_0),esk1_0) = multiplication(esk1_0,c(esk1_0)),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
fof(c_0_40,plain,
! [X32,X34,X35] :
( ( ~ test(X32)
| complement(esk3_1(X32),X32) )
& ( ~ complement(X35,X34)
| test(X34) ) ),
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])])])])]) ).
cnf(c_0_41,plain,
addition(X1,multiplication(c(esk1_0),esk1_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_25]),c_0_27]),c_0_31]) ).
fof(c_0_42,plain,
! [X11] : multiplication(one,X11) = X11,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_43,negated_conjecture,
one = addition(esk2_0,c(esk2_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_23]),c_0_37]) ).
cnf(c_0_44,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_45,plain,
! [X26,X27,X28] : multiplication(X26,multiplication(X27,X28)) = multiplication(multiplication(X26,X27),X28),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_46,plain,
! [X23,X24,X25] : multiplication(addition(X23,X24),X25) = addition(multiplication(X23,X25),multiplication(X24,X25)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_47,plain,
( multiplication(X1,X2) = multiplication(esk1_0,c(esk1_0))
| ~ complement(X2,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_31]),c_0_39]) ).
cnf(c_0_48,plain,
( complement(esk3_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_49,plain,
addition(multiplication(c(esk1_0),esk1_0),X1) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_41]) ).
cnf(c_0_50,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
( addition(X1,X2) = addition(esk2_0,c(esk2_0))
| ~ complement(X2,X1) ),
inference(rw,[status(thm)],[c_0_36,c_0_43]) ).
cnf(c_0_52,plain,
multiplication(multiplication(esk2_0,c(esk2_0)),X1) = multiplication(esk2_0,c(esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_25]),c_0_25]),c_0_27]),c_0_27]) ).
cnf(c_0_53,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_54,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_55,plain,
( multiplication(X1,esk3_1(X1)) = multiplication(esk1_0,c(esk1_0))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
addition(multiplication(esk1_0,c(esk1_0)),X1) = X1,
inference(rw,[status(thm)],[c_0_49,c_0_39]) ).
cnf(c_0_57,plain,
multiplication(addition(esk2_0,c(esk2_0)),X1) = X1,
inference(rw,[status(thm)],[c_0_50,c_0_43]) ).
cnf(c_0_58,negated_conjecture,
addition(esk2_0,c(esk2_0)) = addition(esk1_0,c(esk1_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_30]),c_0_37]) ).
fof(c_0_59,plain,
! [X20,X21,X22] : multiplication(X20,addition(X21,X22)) = addition(multiplication(X20,X21),multiplication(X20,X22)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_60,plain,
! [X10] : multiplication(X10,one) = X10,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_61,plain,
multiplication(esk2_0,multiplication(c(esk2_0),X1)) = multiplication(c(esk1_0),esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_31]) ).
cnf(c_0_62,plain,
( multiplication(addition(X1,X2),esk3_1(X1)) = multiplication(X2,esk3_1(X1))
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_63,plain,
multiplication(addition(esk1_0,c(esk1_0)),X1) = X1,
inference(rw,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_65,plain,
( addition(X1,X2) = addition(esk1_0,c(esk1_0))
| ~ complement(X2,X1) ),
inference(rw,[status(thm)],[c_0_51,c_0_58]) ).
cnf(c_0_66,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_67,plain,
addition(X1,multiplication(esk1_0,c(esk1_0))) = X1,
inference(rw,[status(thm)],[c_0_41,c_0_39]) ).
cnf(c_0_68,plain,
multiplication(esk2_0,multiplication(c(esk2_0),X1)) = multiplication(esk1_0,c(esk1_0)),
inference(rw,[status(thm)],[c_0_61,c_0_39]) ).
cnf(c_0_69,negated_conjecture,
multiplication(c(esk2_0),esk3_1(esk2_0)) = esk3_1(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_58]),c_0_63]),c_0_21])]) ).
fof(c_0_70,plain,
! [X16,X17,X18] : addition(X18,addition(X17,X16)) = addition(addition(X18,X17),X16),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_71,plain,
! [X19] : addition(X19,X19) = X19,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_72,plain,
( test(X2)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_73,plain,
( multiplication(X1,addition(esk3_1(X1),X2)) = multiplication(X1,X2)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_55]),c_0_56]) ).
cnf(c_0_74,plain,
( addition(X1,esk3_1(X1)) = addition(esk1_0,c(esk1_0))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_48]) ).
cnf(c_0_75,plain,
multiplication(X1,addition(esk1_0,c(esk1_0))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_43]),c_0_58]) ).
cnf(c_0_76,plain,
( multiplication(addition(X1,X2),esk3_1(X2)) = multiplication(X1,esk3_1(X2))
| ~ test(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_67]) ).
cnf(c_0_77,negated_conjecture,
multiplication(esk2_0,esk3_1(esk2_0)) = multiplication(esk1_0,c(esk1_0)),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_78,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_79,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_80,negated_conjecture,
test(c(esk2_0)),
inference(spm,[status(thm)],[c_0_72,c_0_23]) ).
cnf(c_0_81,plain,
( c(X1) = X2
| ~ complement(X1,X2)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_82,plain,
( multiplication(X1,esk3_1(esk3_1(X1))) = X1
| ~ test(esk3_1(X1))
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]) ).
cnf(c_0_83,plain,
( multiplication(X1,esk3_1(esk3_1(X1))) = esk3_1(esk3_1(X1))
| ~ test(esk3_1(X1))
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_74]),c_0_63]) ).
cnf(c_0_84,negated_conjecture,
multiplication(esk2_0,addition(esk3_1(esk2_0),X1)) = multiplication(esk2_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_77]),c_0_56]) ).
cnf(c_0_85,negated_conjecture,
multiplication(c(esk2_0),esk2_0) = multiplication(c(esk1_0),esk1_0),
inference(rw,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_86,negated_conjecture,
( ~ leq(one,addition(addition(addition(addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0)),multiplication(esk1_0,esk2_0)),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))))
| ~ leq(addition(addition(addition(addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0)),multiplication(esk1_0,esk2_0)),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))),one) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_87,plain,
multiplication(esk1_0,addition(c(esk1_0),X1)) = multiplication(esk1_0,X1),
inference(spm,[status(thm)],[c_0_64,c_0_56]) ).
cnf(c_0_88,negated_conjecture,
test(c(esk1_0)),
inference(spm,[status(thm)],[c_0_72,c_0_30]) ).
cnf(c_0_89,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_90,negated_conjecture,
complement(c(esk2_0),c(c(esk2_0))),
inference(spm,[status(thm)],[c_0_20,c_0_80]) ).
cnf(c_0_91,plain,
( c(esk3_1(X1)) = X1
| ~ test(esk3_1(X1))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_48]) ).
cnf(c_0_92,plain,
( esk3_1(esk3_1(X1)) = X1
| ~ test(esk3_1(X1))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_93,negated_conjecture,
( multiplication(esk2_0,esk3_1(esk3_1(esk2_0))) = esk2_0
| ~ test(esk3_1(esk2_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_74]),c_0_75]) ).
cnf(c_0_94,negated_conjecture,
multiplication(c(esk2_0),esk2_0) = multiplication(esk1_0,c(esk1_0)),
inference(rw,[status(thm)],[c_0_85,c_0_39]) ).
cnf(c_0_95,negated_conjecture,
( ~ leq(one,addition(multiplication(c(esk1_0),c(esk2_0)),addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0))))))
| ~ leq(addition(multiplication(c(esk1_0),c(esk2_0)),addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_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)],[c_0_86,c_0_37]),c_0_37]),c_0_37]),c_0_37]),c_0_37]),c_0_37]) ).
cnf(c_0_96,plain,
multiplication(esk1_0,esk3_1(c(esk1_0))) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_74]),c_0_75]),c_0_88])]) ).
cnf(c_0_97,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_89,c_0_37]) ).
cnf(c_0_98,negated_conjecture,
addition(c(esk2_0),c(c(esk2_0))) = addition(esk1_0,c(esk1_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_90]),c_0_37]) ).
cnf(c_0_99,plain,
( esk3_1(X1) = c(X1)
| ~ test(esk3_1(X1))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_100,negated_conjecture,
( esk3_1(esk3_1(esk2_0)) = esk2_0
| ~ test(esk3_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_83]),c_0_21])]) ).
cnf(c_0_101,negated_conjecture,
multiplication(c(esk2_0),addition(esk2_0,X1)) = multiplication(c(esk2_0),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_94]),c_0_56]) ).
cnf(c_0_102,negated_conjecture,
( ~ leq(addition(esk2_0,c(esk2_0)),addition(multiplication(c(esk1_0),c(esk2_0)),addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),multiplication(addition(esk2_0,c(esk2_0)),esk1_0)))))
| ~ leq(addition(multiplication(c(esk1_0),c(esk2_0)),addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),multiplication(addition(esk2_0,c(esk2_0)),esk1_0)))),addition(esk2_0,c(esk2_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_43]),c_0_54]),c_0_54]),c_0_43]) ).
fof(c_0_103,plain,
! [X8,X9] :
( ( ~ leq(X8,X9)
| addition(X8,X9) = X9 )
& ( addition(X8,X9) != X9
| leq(X8,X9) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_104,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(esk1_0,addition(c(esk1_0),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_75]),c_0_78]) ).
cnf(c_0_105,plain,
esk3_1(c(esk1_0)) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_76]),c_0_96]),c_0_88])]) ).
cnf(c_0_106,negated_conjecture,
addition(esk1_0,addition(c(esk1_0),c(c(esk2_0)))) = addition(esk1_0,c(esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_37]),c_0_78]) ).
cnf(c_0_107,negated_conjecture,
( c(esk3_1(esk2_0)) = esk2_0
| ~ test(esk3_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_21])]) ).
cnf(c_0_108,negated_conjecture,
esk3_1(esk2_0) = c(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_74]),c_0_75]),c_0_69]),c_0_21])]) ).
cnf(c_0_109,negated_conjecture,
( ~ leq(addition(esk1_0,c(esk1_0)),addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(addition(esk1_0,c(esk1_0)),esk1_0),multiplication(c(esk1_0),c(esk2_0))))))
| ~ leq(addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(addition(esk1_0,c(esk1_0)),esk1_0),multiplication(c(esk1_0),c(esk2_0))))),addition(esk1_0,c(esk1_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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_58]),c_0_58]),c_0_37]),c_0_78]),c_0_78]),c_0_58]),c_0_37]),c_0_78]),c_0_78]),c_0_58]) ).
cnf(c_0_110,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_103]) ).
cnf(c_0_111,plain,
addition(X1,multiplication(X1,esk1_0)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_74]),c_0_105]),c_0_89]),c_0_75]),c_0_88])]) ).
cnf(c_0_112,negated_conjecture,
addition(X1,multiplication(X1,c(c(esk2_0)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_106]),c_0_75]) ).
cnf(c_0_113,negated_conjecture,
c(c(esk2_0)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108]),c_0_108]),c_0_80])]) ).
cnf(c_0_114,negated_conjecture,
( addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(addition(esk1_0,c(esk1_0)),esk1_0),addition(esk1_0,addition(c(esk1_0),multiplication(c(esk1_0),c(esk2_0))))))) != addition(esk1_0,c(esk1_0))
| ~ leq(addition(esk1_0,c(esk1_0)),addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(addition(esk1_0,c(esk1_0)),esk1_0),multiplication(c(esk1_0),c(esk2_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_109,c_0_110]),c_0_78]),c_0_78]),c_0_78]),c_0_37]),c_0_78]) ).
cnf(c_0_115,plain,
addition(X1,addition(multiplication(X1,esk1_0),X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_78,c_0_111]) ).
cnf(c_0_116,negated_conjecture,
addition(X1,multiplication(X1,esk2_0)) = X1,
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_117,negated_conjecture,
( addition(esk1_0,addition(c(esk1_0),addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(addition(esk1_0,c(esk1_0)),esk1_0),multiplication(c(esk1_0),c(esk2_0))))))) != addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(addition(esk1_0,c(esk1_0)),esk1_0),multiplication(c(esk1_0),c(esk2_0)))))
| addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(addition(esk1_0,c(esk1_0)),esk1_0),addition(esk1_0,addition(c(esk1_0),multiplication(c(esk1_0),c(esk2_0))))))) != addition(esk1_0,c(esk1_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_110]),c_0_78]) ).
cnf(c_0_118,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_37]),c_0_78]) ).
cnf(c_0_119,negated_conjecture,
addition(X1,multiplication(X1,multiplication(esk1_0,esk2_0))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_111]),c_0_53]) ).
cnf(c_0_120,negated_conjecture,
addition(esk1_0,addition(multiplication(esk1_0,esk2_0),c(esk1_0))) != addition(esk1_0,c(esk1_0)),
inference(cn,[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(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(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)],[c_0_117,c_0_118]),c_0_63]),c_0_118]),c_0_64]),c_0_58]),c_0_75]),c_0_118]),c_0_118]),c_0_97]),c_0_89]),c_0_118]),c_0_63]),c_0_118]),c_0_64]),c_0_58]),c_0_75]),c_0_118]),c_0_118]),c_0_63]),c_0_89]),c_0_118]),c_0_118]),c_0_64]),c_0_58]),c_0_75]),c_0_79]),c_0_118])]) ).
cnf(c_0_121,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_63]),c_0_78]),c_0_37]),c_0_120]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : KLE010+2 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n007.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 04:43:09 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.5Dn1w4LgyK/E---3.1_27033.p
% 0.16/0.50 # Version: 3.1pre001
% 0.16/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # Starting sh5l with 300s (1) cores
% 0.16/0.50 # new_bool_1 with pid 27112 completed with status 0
% 0.16/0.50 # Result found by new_bool_1
% 0.16/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50 # Search class: FGHSM-FFMF21-DFFFFFNN
% 0.16/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50 # Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.50 # G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27121 completed with status 0
% 0.16/0.50 # Result found by G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50 # Search class: FGHSM-FFMF21-DFFFFFNN
% 0.16/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50 # Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.50 # Preprocessing time : 0.001 s
% 0.16/0.50 # Presaturation interreduction done
% 0.16/0.50
% 0.16/0.50 # Proof found!
% 0.16/0.50 # SZS status Theorem
% 0.16/0.50 # SZS output start CNFRefutation
% See solution above
% 0.16/0.50 # Parsed axioms : 17
% 0.16/0.50 # Removed by relevancy pruning/SinE : 0
% 0.16/0.50 # Initial clauses : 25
% 0.16/0.50 # Removed in clause preprocessing : 0
% 0.16/0.50 # Initial clauses in saturation : 25
% 0.16/0.50 # Processed clauses : 582
% 0.16/0.50 # ...of these trivial : 106
% 0.16/0.50 # ...subsumed : 93
% 0.16/0.50 # ...remaining for further processing : 383
% 0.16/0.50 # Other redundant clauses eliminated : 1
% 0.16/0.50 # Clauses deleted for lack of memory : 0
% 0.16/0.50 # Backward-subsumed : 2
% 0.16/0.50 # Backward-rewritten : 123
% 0.16/0.50 # Generated clauses : 4337
% 0.16/0.50 # ...of the previous two non-redundant : 3122
% 0.16/0.50 # ...aggressively subsumed : 0
% 0.16/0.50 # Contextual simplify-reflections : 1
% 0.16/0.50 # Paramodulations : 4334
% 0.16/0.50 # Factorizations : 2
% 0.16/0.50 # NegExts : 0
% 0.16/0.50 # Equation resolutions : 1
% 0.16/0.50 # Total rewrite steps : 6607
% 0.16/0.50 # Propositional unsat checks : 0
% 0.16/0.50 # Propositional check models : 0
% 0.16/0.50 # Propositional check unsatisfiable : 0
% 0.16/0.50 # Propositional clauses : 0
% 0.16/0.50 # Propositional clauses after purity: 0
% 0.16/0.50 # Propositional unsat core size : 0
% 0.16/0.50 # Propositional preprocessing time : 0.000
% 0.16/0.50 # Propositional encoding time : 0.000
% 0.16/0.50 # Propositional solver time : 0.000
% 0.16/0.50 # Success case prop preproc time : 0.000
% 0.16/0.50 # Success case prop encoding time : 0.000
% 0.16/0.50 # Success case prop solver time : 0.000
% 0.16/0.50 # Current number of processed clauses : 232
% 0.16/0.50 # Positive orientable unit clauses : 174
% 0.16/0.50 # Positive unorientable unit clauses: 5
% 0.16/0.50 # Negative unit clauses : 2
% 0.16/0.50 # Non-unit-clauses : 51
% 0.16/0.50 # Current number of unprocessed clauses: 2489
% 0.16/0.50 # ...number of literals in the above : 2931
% 0.16/0.50 # Current number of archived formulas : 0
% 0.16/0.50 # Current number of archived clauses : 150
% 0.16/0.50 # Clause-clause subsumption calls (NU) : 1152
% 0.16/0.50 # Rec. Clause-clause subsumption calls : 1030
% 0.16/0.50 # Non-unit clause-clause subsumptions : 61
% 0.16/0.50 # Unit Clause-clause subsumption calls : 1562
% 0.16/0.50 # Rewrite failures with RHS unbound : 0
% 0.16/0.50 # BW rewrite match attempts : 706
% 0.16/0.50 # BW rewrite match successes : 215
% 0.16/0.50 # Condensation attempts : 0
% 0.16/0.50 # Condensation successes : 0
% 0.16/0.50 # Termbank termtop insertions : 67223
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.064 s
% 0.16/0.50 # System time : 0.004 s
% 0.16/0.50 # Total time : 0.069 s
% 0.16/0.50 # Maximum resident set size: 1756 pages
% 0.16/0.50
% 0.16/0.50 # -------------------------------------------------
% 0.16/0.50 # User time : 0.066 s
% 0.16/0.50 # System time : 0.006 s
% 0.16/0.50 # Total time : 0.072 s
% 0.16/0.50 # Maximum resident set size: 1692 pages
% 0.16/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------