TSTP Solution File: KLE011+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE011+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:03:50 EDT 2023
% Result : Theorem 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 111 ( 79 unt; 0 def)
% Number of atoms : 175 ( 102 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 114 ( 50 ~; 43 |; 13 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 110 ( 3 sgn; 58 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(multiplication(addition(X5,c(X5)),X4),multiplication(addition(X4,c(X4)),X5)),multiplication(c(X4),c(X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',goals) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',additive_commutativity) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',test_1) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',test_2) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',left_annihilation) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',right_annihilation) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',test_3) ).
fof(test_deMorgan2,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(multiplication(X4,X5)) = addition(c(X4),c(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',test_deMorgan2) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',additive_idempotence) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',additive_associativity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',left_distributivity) ).
fof(test_deMorgan1,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(addition(X4,X5)) = multiplication(c(X4),c(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',test_deMorgan1) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',multiplicative_right_identity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.pPvZzoGshW/E---3.1_31276.p',multiplicative_left_identity) ).
fof(c_0_16,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(multiplication(addition(X5,c(X5)),X4),multiplication(addition(X4,c(X4)),X5)),multiplication(c(X4),c(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_17,plain,
! [X32] : addition(X32,zero) = X32,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_18,plain,
! [X8,X9] : addition(X8,X9) = addition(X9,X8),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_19,plain,
! [X35,X37,X38] :
( ( ~ test(X35)
| complement(esk3_1(X35),X35) )
& ( ~ complement(X38,X37)
| test(X37) ) ),
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,negated_conjecture,
( test(esk2_0)
& test(esk1_0)
& one != addition(addition(multiplication(addition(esk2_0,c(esk2_0)),esk1_0),multiplication(addition(esk1_0,c(esk1_0)),esk2_0)),multiplication(c(esk1_0),c(esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_21,plain,
! [X30,X31] :
( ( multiplication(X30,X31) = zero
| ~ complement(X31,X30) )
& ( multiplication(X31,X30) = zero
| ~ complement(X31,X30) )
& ( addition(X30,X31) = one
| ~ complement(X31,X30) )
& ( multiplication(X30,X31) != zero
| multiplication(X31,X30) != zero
| addition(X30,X31) != one
| complement(X31,X30) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
fof(c_0_22,plain,
! [X34] : multiplication(zero,X34) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_23,plain,
! [X33] : multiplication(X33,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_24,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( complement(esk3_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_28,plain,
! [X39,X40] :
( ( c(X39) != X40
| complement(X39,X40)
| ~ test(X39) )
& ( ~ complement(X39,X40)
| c(X39) = X40
| ~ test(X39) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
cnf(c_0_29,plain,
( complement(X2,X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_34,negated_conjecture,
complement(esk3_1(esk2_0),esk2_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_36,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_37,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_38,plain,
( c(X1) = X2
| ~ complement(X1,X2)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
complement(zero,one),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_24]),c_0_30]),c_0_31])])]) ).
cnf(c_0_40,plain,
( test(X2)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_41,plain,
complement(one,zero),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_32]),c_0_31]),c_0_30])])]) ).
cnf(c_0_42,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_43,plain,
( complement(X1,X2)
| addition(X1,X2) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_44,negated_conjecture,
addition(esk2_0,esk3_1(esk2_0)) = one,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_45,negated_conjecture,
multiplication(esk2_0,esk3_1(esk2_0)) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_46,negated_conjecture,
multiplication(esk3_1(esk2_0),esk2_0) = zero,
inference(spm,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_47,negated_conjecture,
complement(esk3_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_26,c_0_37]) ).
fof(c_0_48,plain,
! [X26,X27] :
( ~ test(X26)
| ~ test(X27)
| c(multiplication(X26,X27)) = addition(c(X26),c(X27)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_deMorgan2])]) ).
cnf(c_0_49,plain,
( c(zero) = one
| ~ test(zero) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_50,plain,
test(zero),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_51,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_52,negated_conjecture,
complement(esk2_0,esk3_1(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_53,negated_conjecture,
addition(esk1_0,esk3_1(esk1_0)) = one,
inference(spm,[status(thm)],[c_0_33,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
multiplication(esk1_0,esk3_1(esk1_0)) = zero,
inference(spm,[status(thm)],[c_0_35,c_0_47]) ).
cnf(c_0_55,negated_conjecture,
multiplication(esk3_1(esk1_0),esk1_0) = zero,
inference(spm,[status(thm)],[c_0_36,c_0_47]) ).
fof(c_0_56,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_57,plain,
! [X10,X11,X12] : addition(X12,addition(X11,X10)) = addition(addition(X12,X11),X10),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_58,plain,
( c(multiplication(X1,X2)) = addition(c(X1),c(X2))
| ~ test(X1)
| ~ test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_59,plain,
c(zero) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
fof(c_0_60,plain,
! [X17,X18,X19] : multiplication(addition(X17,X18),X19) = addition(multiplication(X17,X19),multiplication(X18,X19)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_61,plain,
! [X24,X25] :
( ~ test(X24)
| ~ test(X25)
| c(addition(X24,X25)) = multiplication(c(X24),c(X25)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_deMorgan1])]) ).
cnf(c_0_62,negated_conjecture,
complement(esk2_0,c(esk2_0)),
inference(spm,[status(thm)],[c_0_51,c_0_27]) ).
cnf(c_0_63,negated_conjecture,
( c(esk3_1(esk2_0)) = esk2_0
| ~ test(esk3_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_64,negated_conjecture,
test(esk3_1(esk2_0)),
inference(spm,[status(thm)],[c_0_40,c_0_52]) ).
cnf(c_0_65,negated_conjecture,
esk3_1(esk2_0) = c(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_52]),c_0_27])]) ).
cnf(c_0_66,negated_conjecture,
complement(esk1_0,esk3_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_67,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_68,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_69,plain,
( addition(one,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_50]),c_0_31]),c_0_59]),c_0_25]),c_0_59]) ).
cnf(c_0_70,negated_conjecture,
one != addition(addition(multiplication(addition(esk2_0,c(esk2_0)),esk1_0),multiplication(addition(esk1_0,c(esk1_0)),esk2_0)),multiplication(c(esk1_0),c(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_71,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_72,plain,
( c(addition(X1,X2)) = multiplication(c(X1),c(X2))
| ~ test(X1)
| ~ test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_73,negated_conjecture,
test(c(esk2_0)),
inference(spm,[status(thm)],[c_0_40,c_0_62]) ).
cnf(c_0_74,negated_conjecture,
c(c(esk2_0)) = esk2_0,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]),c_0_65]) ).
cnf(c_0_75,negated_conjecture,
complement(esk1_0,c(esk1_0)),
inference(spm,[status(thm)],[c_0_51,c_0_37]) ).
cnf(c_0_76,negated_conjecture,
( c(esk3_1(esk1_0)) = esk1_0
| ~ test(esk3_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_47]) ).
cnf(c_0_77,negated_conjecture,
test(esk3_1(esk1_0)),
inference(spm,[status(thm)],[c_0_40,c_0_66]) ).
cnf(c_0_78,negated_conjecture,
esk3_1(esk1_0) = c(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_66]),c_0_37])]) ).
fof(c_0_79,plain,
! [X14,X15,X16] : multiplication(X14,addition(X15,X16)) = addition(multiplication(X14,X15),multiplication(X14,X16)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_80,plain,
addition(X1,addition(X2,addition(X1,X2))) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_81,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_62]),c_0_25]) ).
cnf(c_0_82,negated_conjecture,
addition(one,c(esk2_0)) = one,
inference(spm,[status(thm)],[c_0_69,c_0_27]) ).
fof(c_0_83,plain,
! [X28] : multiplication(X28,one) = X28,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_84,negated_conjecture,
addition(multiplication(c(esk1_0),c(esk2_0)),addition(multiplication(esk1_0,esk2_0),addition(multiplication(c(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)],[c_0_70,c_0_25]),c_0_25]),c_0_71]),c_0_71]),c_0_68]) ).
cnf(c_0_85,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_25]),c_0_68]) ).
cnf(c_0_86,negated_conjecture,
( multiplication(c(X1),esk2_0) = c(addition(X1,c(esk2_0)))
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).
cnf(c_0_87,negated_conjecture,
test(c(esk1_0)),
inference(spm,[status(thm)],[c_0_40,c_0_75]) ).
cnf(c_0_88,negated_conjecture,
c(c(esk1_0)) = esk1_0,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]),c_0_78]) ).
cnf(c_0_89,negated_conjecture,
( multiplication(c(X1),c(esk2_0)) = c(addition(X1,esk2_0))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_27]) ).
fof(c_0_90,plain,
! [X29] : multiplication(one,X29) = X29,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_91,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_79]) ).
cnf(c_0_92,negated_conjecture,
addition(one,esk2_0) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_25]),c_0_82]),c_0_25]) ).
cnf(c_0_93,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_94,negated_conjecture,
( multiplication(c(X1),c(esk1_0)) = c(addition(X1,esk1_0))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_37]) ).
cnf(c_0_95,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),addition(multiplication(esk2_0,esk1_0),addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(c(esk1_0),c(esk2_0)),multiplication(c(esk2_0),esk1_0))))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_85]),c_0_85]),c_0_85]) ).
cnf(c_0_96,negated_conjecture,
multiplication(esk1_0,esk2_0) = c(addition(c(esk1_0),c(esk2_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]) ).
cnf(c_0_97,negated_conjecture,
multiplication(c(esk1_0),c(esk2_0)) = c(addition(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_89,c_0_37]) ).
cnf(c_0_98,negated_conjecture,
multiplication(c(esk1_0),esk2_0) = c(addition(esk1_0,c(esk2_0))),
inference(spm,[status(thm)],[c_0_86,c_0_37]) ).
cnf(c_0_99,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_100,negated_conjecture,
addition(X1,multiplication(X1,esk2_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_93]) ).
cnf(c_0_101,negated_conjecture,
multiplication(c(c(esk2_0)),c(esk1_0)) = c(addition(esk1_0,c(esk2_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_73]),c_0_25]) ).
cnf(c_0_102,negated_conjecture,
addition(c(addition(esk1_0,esk2_0)),addition(c(addition(esk1_0,c(esk2_0))),addition(c(addition(c(esk1_0),c(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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_85]),c_0_85]),c_0_85]),c_0_98]),c_0_85]),c_0_85]) ).
cnf(c_0_103,negated_conjecture,
addition(multiplication(esk2_0,X1),multiplication(c(esk2_0),X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_81]),c_0_99]) ).
cnf(c_0_104,negated_conjecture,
addition(esk1_0,c(addition(c(esk1_0),c(esk2_0)))) = esk1_0,
inference(spm,[status(thm)],[c_0_100,c_0_96]) ).
cnf(c_0_105,negated_conjecture,
multiplication(c(esk2_0),c(esk1_0)) = c(addition(esk1_0,esk2_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_27]),c_0_25]) ).
cnf(c_0_106,negated_conjecture,
multiplication(esk2_0,c(esk1_0)) = c(addition(esk1_0,c(esk2_0))),
inference(rw,[status(thm)],[c_0_101,c_0_74]) ).
cnf(c_0_107,negated_conjecture,
addition(esk1_0,addition(c(addition(esk1_0,esk2_0)),c(addition(esk1_0,c(esk2_0))))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_25]),c_0_104]),c_0_25]),c_0_85]) ).
cnf(c_0_108,negated_conjecture,
addition(c(addition(esk1_0,esk2_0)),c(addition(esk1_0,c(esk2_0)))) = c(esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_105]),c_0_106]),c_0_25]) ).
cnf(c_0_109,negated_conjecture,
addition(esk1_0,c(esk1_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_75]),c_0_25]) ).
cnf(c_0_110,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108]),c_0_109])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : KLE011+3 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 05:04:31 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/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/tmp/tmp.pPvZzoGshW/E---3.1_31276.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # new_bool_3 with pid 31390 completed with status 0
% 0.16/0.47 # Result found by new_bool_3
% 0.16/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGUSM-FFMF21-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 181s (1) cores
% 0.16/0.47 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 31400 completed with status 0
% 0.16/0.47 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.16/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGUSM-FFMF21-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 181s (1) cores
% 0.16/0.47 # Preprocessing time : 0.001 s
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Theorem
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 19
% 0.16/0.47 # Removed by relevancy pruning/SinE : 1
% 0.16/0.47 # Initial clauses : 25
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 25
% 0.16/0.47 # Processed clauses : 291
% 0.16/0.47 # ...of these trivial : 30
% 0.16/0.47 # ...subsumed : 51
% 0.16/0.47 # ...remaining for further processing : 210
% 0.16/0.47 # Other redundant clauses eliminated : 25
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 1
% 0.16/0.47 # Backward-rewritten : 52
% 0.16/0.47 # Generated clauses : 1492
% 0.16/0.47 # ...of the previous two non-redundant : 1014
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 1
% 0.16/0.47 # Paramodulations : 1467
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 25
% 0.16/0.47 # Total rewrite steps : 2427
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 156
% 0.16/0.47 # Positive orientable unit clauses : 86
% 0.16/0.47 # Positive unorientable unit clauses: 3
% 0.16/0.47 # Negative unit clauses : 2
% 0.16/0.47 # Non-unit-clauses : 65
% 0.16/0.47 # Current number of unprocessed clauses: 730
% 0.16/0.47 # ...number of literals in the above : 1359
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 53
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 551
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 485
% 0.16/0.47 # Non-unit clause-clause subsumptions : 40
% 0.16/0.47 # Unit Clause-clause subsumption calls : 440
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 92
% 0.16/0.47 # BW rewrite match successes : 43
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 19972
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.027 s
% 0.16/0.47 # System time : 0.000 s
% 0.16/0.47 # Total time : 0.027 s
% 0.16/0.47 # Maximum resident set size: 1708 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.028 s
% 0.16/0.47 # System time : 0.003 s
% 0.16/0.47 # Total time : 0.031 s
% 0.16/0.47 # Maximum resident set size: 1688 pages
% 0.16/0.47 % E---3.1 exiting
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------