TSTP Solution File: KLE012+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE012+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 48.39s 6.55s
% Output : CNFRefutation 48.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of formulae : 117 ( 67 unt; 0 def)
% Number of atoms : 200 ( 126 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 152 ( 69 ~; 66 |; 11 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 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 : 153 ( 4 sgn; 54 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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.2VPnvu8yIG/E---3.1_19631.p',test_2) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',test_1) ).
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.2VPnvu8yIG/E---3.1_19631.p',right_distributivity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',additive_identity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',multiplicative_right_identity) ).
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> multiplication(X4,X5) = multiplication(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',left_annihilation) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',additive_commutativity) ).
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.2VPnvu8yIG/E---3.1_19631.p',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',multiplicative_left_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',additive_idempotence) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p',test_3) ).
fof(c_0_14,plain,
! [X32,X33] :
( ( multiplication(X32,X33) = zero
| ~ complement(X33,X32) )
& ( multiplication(X33,X32) = zero
| ~ complement(X33,X32) )
& ( addition(X32,X33) = one
| ~ complement(X33,X32) )
& ( multiplication(X32,X33) != zero
| multiplication(X33,X32) != zero
| addition(X32,X33) != one
| complement(X33,X32) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
fof(c_0_15,plain,
! [X28,X30,X31] :
( ( ~ test(X28)
| complement(esk1_1(X28),X28) )
& ( ~ complement(X31,X30)
| test(X30) ) ),
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_16,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_17,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_20,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( multiplication(X1,esk1_1(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_25,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> multiplication(X4,X5) = multiplication(X5,X4) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_26,plain,
! [X13,X14,X15] : multiplication(X13,multiplication(X14,X15)) = multiplication(multiplication(X13,X14),X15),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_27,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_28,plain,
! [X25] : multiplication(zero,X25) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_29,plain,
( multiplication(X1,addition(X2,esk1_1(X1))) = multiplication(X1,X2)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_30,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_31,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_32,negated_conjecture,
( test(esk3_0)
& test(esk2_0)
& multiplication(esk2_0,esk3_0) != multiplication(esk3_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
cnf(c_0_33,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( multiplication(esk1_1(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_35,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( multiplication(X1,X1) = X1
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_37,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_38,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_39,plain,
( test(X2)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_40,plain,
( complement(X2,X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_41,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_42,plain,
( multiplication(esk1_1(X1),multiplication(X1,X2)) = zero
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_43,negated_conjecture,
multiplication(esk2_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( test(X1)
| addition(X1,X2) != one
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,negated_conjecture,
multiplication(esk1_1(esk2_0),esk2_0) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_37])]) ).
cnf(c_0_48,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_44]) ).
fof(c_0_49,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_50,plain,
( test(X1)
| addition(X2,X1) != one
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero ),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
fof(c_0_51,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_52,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_53,plain,
! [X34,X35] :
( ( c(X34) != X35
| complement(X34,X35)
| ~ test(X34) )
& ( ~ complement(X34,X35)
| c(X34) = X35
| ~ test(X34) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
cnf(c_0_54,negated_conjecture,
multiplication(addition(esk1_1(esk2_0),X1),esk2_0) = multiplication(X1,esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_55,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_56,plain,
( multiplication(esk1_1(X1),addition(X2,X1)) = multiplication(esk1_1(X1),X2)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_34]),c_0_22]) ).
cnf(c_0_57,plain,
( test(esk1_1(X1))
| ~ test(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_30]),c_0_34]),c_0_21]) ).
cnf(c_0_58,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,plain,
( c(X1) = X2
| ~ complement(X1,X2)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( multiplication(esk1_1(esk1_1(esk2_0)),esk2_0) = esk2_0
| ~ test(esk1_1(esk2_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_30]),c_0_55]) ).
cnf(c_0_62,plain,
( multiplication(esk1_1(esk1_1(X1)),X1) = esk1_1(esk1_1(X1))
| ~ test(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_30]),c_0_31]),c_0_57]) ).
cnf(c_0_63,plain,
( multiplication(X1,multiplication(X2,esk1_1(multiplication(X1,X2)))) = zero
| ~ test(multiplication(X1,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_64,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,plain,
( c(esk1_1(X1)) = X1
| ~ test(esk1_1(X1))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_18]) ).
cnf(c_0_66,negated_conjecture,
( esk1_1(esk1_1(esk2_0)) = esk2_0
| ~ test(esk1_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_37])]) ).
cnf(c_0_67,negated_conjecture,
multiplication(esk2_0,multiplication(esk2_0,esk1_1(esk2_0))) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_43]),c_0_37])]) ).
cnf(c_0_68,negated_conjecture,
multiplication(esk2_0,multiplication(esk2_0,X1)) = multiplication(esk2_0,X1),
inference(spm,[status(thm)],[c_0_33,c_0_43]) ).
cnf(c_0_69,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_44]) ).
cnf(c_0_70,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_30]) ).
cnf(c_0_71,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_72,negated_conjecture,
( esk1_1(esk2_0) = c(esk2_0)
| ~ test(esk1_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_37])]) ).
cnf(c_0_73,negated_conjecture,
multiplication(esk2_0,esk1_1(esk2_0)) = zero,
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_74,plain,
( c(X1) = X2
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_40]),c_0_50]) ).
cnf(c_0_75,plain,
( multiplication(esk1_1(X1),addition(X1,X2)) = multiplication(esk1_1(X1),X2)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_34]),c_0_48]) ).
cnf(c_0_76,negated_conjecture,
multiplication(esk2_0,addition(X1,one)) = multiplication(esk2_0,addition(X1,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_43]),c_0_44]),c_0_69]) ).
cnf(c_0_77,negated_conjecture,
addition(esk3_0,one) = one,
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_78,negated_conjecture,
esk1_1(esk2_0) = c(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_57]),c_0_37])]) ).
cnf(c_0_79,negated_conjecture,
multiplication(esk2_0,addition(esk1_1(esk2_0),X1)) = multiplication(esk2_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_73]),c_0_48]) ).
cnf(c_0_80,plain,
( c(X1) = X2
| addition(X1,X2) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(spm,[status(thm)],[c_0_74,c_0_44]) ).
cnf(c_0_81,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_82,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_44]),c_0_58]) ).
cnf(c_0_83,plain,
( addition(multiplication(esk1_1(X1),X2),multiplication(X3,addition(X1,X2))) = multiplication(addition(esk1_1(X1),X3),addition(X1,X2))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_75]) ).
cnf(c_0_84,negated_conjecture,
multiplication(esk2_0,addition(esk2_0,esk3_0)) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_31]),c_0_44]) ).
cnf(c_0_85,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_78]),c_0_37])]) ).
cnf(c_0_86,negated_conjecture,
( multiplication(esk2_0,esk1_1(esk1_1(esk2_0))) = esk2_0
| ~ test(esk1_1(esk2_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_30]),c_0_31]) ).
cnf(c_0_87,plain,
( esk1_1(X1) = c(X1)
| ~ test(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_30]),c_0_34]),c_0_21]) ).
cnf(c_0_88,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_81]) ).
cnf(c_0_89,plain,
addition(X1,addition(X2,multiplication(X1,X3))) = addition(X2,multiplication(X1,addition(X3,one))),
inference(spm,[status(thm)],[c_0_82,c_0_69]) ).
cnf(c_0_90,negated_conjecture,
addition(esk2_0,multiplication(c(esk2_0),esk3_0)) = addition(esk2_0,esk3_0),
inference(rw,[status(thm)],[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(spm,[status(thm)],[c_0_83,c_0_84]),c_0_78]),c_0_44]),c_0_78]),c_0_85]),c_0_55]),c_0_37])]),c_0_44]) ).
cnf(c_0_91,negated_conjecture,
( multiplication(esk2_0,esk1_1(c(esk2_0))) = esk2_0
| ~ test(c(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_37])]) ).
cnf(c_0_92,negated_conjecture,
test(c(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_78]),c_0_37])]) ).
cnf(c_0_93,plain,
( multiplication(c(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_88]) ).
cnf(c_0_94,plain,
( multiplication(X1,c(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_88]) ).
cnf(c_0_95,negated_conjecture,
addition(esk2_0,addition(esk3_0,c(esk2_0))) = one,
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_89,c_0_90]),c_0_77]),c_0_31]),c_0_85]),c_0_44]),c_0_58]) ).
cnf(c_0_96,plain,
( multiplication(addition(X1,X2),esk1_1(X2)) = multiplication(X1,esk1_1(X2))
| ~ test(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_21]),c_0_22]) ).
cnf(c_0_97,negated_conjecture,
multiplication(esk2_0,esk1_1(c(esk2_0))) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_98,plain,
( multiplication(c(X1),multiplication(X1,X2)) = zero
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_93]),c_0_35]) ).
cnf(c_0_99,plain,
( multiplication(addition(X1,X2),c(X1)) = multiplication(X2,c(X1))
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_94]),c_0_48]) ).
cnf(c_0_100,plain,
( addition(multiplication(X1,addition(X2,X3)),multiplication(esk1_1(X3),X2)) = multiplication(addition(X1,esk1_1(X3)),addition(X2,X3))
| ~ test(X3) ),
inference(spm,[status(thm)],[c_0_46,c_0_56]) ).
cnf(c_0_101,negated_conjecture,
multiplication(c(esk2_0),addition(esk3_0,c(esk2_0))) = c(esk2_0),
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_75,c_0_95]),c_0_31]),c_0_78]),c_0_78]),c_0_37])]) ).
cnf(c_0_102,negated_conjecture,
esk1_1(c(esk2_0)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_85]),c_0_55]),c_0_97]),c_0_92])]) ).
cnf(c_0_103,negated_conjecture,
complement(c(esk2_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_78]),c_0_37])]) ).
cnf(c_0_104,negated_conjecture,
multiplication(c(esk2_0),esk2_0) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_43]),c_0_37])]) ).
cnf(c_0_105,plain,
( addition(multiplication(X1,esk1_1(X2)),multiplication(addition(X1,X2),X3)) = multiplication(addition(X1,X2),addition(esk1_1(X2),X3))
| ~ test(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_96]) ).
cnf(c_0_106,negated_conjecture,
multiplication(addition(esk3_0,c(esk2_0)),c(esk2_0)) = c(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_95]),c_0_55]),c_0_37])]) ).
cnf(c_0_107,negated_conjecture,
multiplication(esk2_0,c(esk2_0)) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_87]),c_0_37])]) ).
cnf(c_0_108,plain,
( multiplication(addition(X1,X2),c(X2)) = multiplication(X1,c(X2))
| ~ test(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_94]),c_0_22]) ).
cnf(c_0_109,negated_conjecture,
addition(multiplication(esk2_0,esk3_0),c(esk2_0)) = addition(esk3_0,c(esk2_0)),
inference(rw,[status(thm)],[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(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),c_0_102]),c_0_44]),c_0_85]),c_0_55]),c_0_92])]),c_0_44]) ).
cnf(c_0_110,negated_conjecture,
c(c(esk2_0)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_103]),c_0_92])]) ).
cnf(c_0_111,negated_conjecture,
multiplication(addition(X1,c(esk2_0)),esk2_0) = multiplication(X1,esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_104]),c_0_22]) ).
cnf(c_0_112,negated_conjecture,
addition(multiplication(esk3_0,esk2_0),c(esk2_0)) = addition(esk3_0,c(esk2_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(spm,[status(thm)],[c_0_105,c_0_106]),c_0_102]),c_0_102]),c_0_85]),c_0_31]),c_0_92])]) ).
cnf(c_0_113,negated_conjecture,
multiplication(esk2_0,addition(X1,c(esk2_0))) = multiplication(esk2_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_107]),c_0_22]) ).
cnf(c_0_114,negated_conjecture,
multiplication(esk2_0,multiplication(esk3_0,esk2_0)) = multiplication(esk3_0,esk2_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(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]),c_0_111]),c_0_110]),c_0_33]),c_0_92])]) ).
cnf(c_0_115,negated_conjecture,
multiplication(esk2_0,esk3_0) != multiplication(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_116,negated_conjecture,
$false,
inference(sr,[status(thm)],[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(spm,[status(thm)],[c_0_56,c_0_112]),c_0_102]),c_0_113]),c_0_102]),c_0_114]),c_0_92])]),c_0_115]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KLE012+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n026.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 05:08:44 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.2VPnvu8yIG/E---3.1_19631.p
% 48.39/6.55 # Version: 3.1pre001
% 48.39/6.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 48.39/6.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 48.39/6.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 48.39/6.55 # Starting new_bool_3 with 300s (1) cores
% 48.39/6.55 # Starting new_bool_1 with 300s (1) cores
% 48.39/6.55 # Starting sh5l with 300s (1) cores
% 48.39/6.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19709 completed with status 0
% 48.39/6.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 48.39/6.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 48.39/6.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 48.39/6.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 48.39/6.55 # No SInE strategy applied
% 48.39/6.55 # Search class: FGUSM-FFSF21-SFFFFFNN
% 48.39/6.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 48.39/6.55 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 48.39/6.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 48.39/6.55 # Starting new_bool_3 with 136s (1) cores
% 48.39/6.55 # Starting new_bool_1 with 136s (1) cores
% 48.39/6.55 # Starting sh5l with 136s (1) cores
% 48.39/6.55 # G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 19713 completed with status 0
% 48.39/6.55 # Result found by G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 48.39/6.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 48.39/6.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 48.39/6.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 48.39/6.55 # No SInE strategy applied
% 48.39/6.55 # Search class: FGUSM-FFSF21-SFFFFFNN
% 48.39/6.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 48.39/6.55 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 48.39/6.55 # Preprocessing time : 0.001 s
% 48.39/6.55 # Presaturation interreduction done
% 48.39/6.55
% 48.39/6.55 # Proof found!
% 48.39/6.55 # SZS status Theorem
% 48.39/6.55 # SZS output start CNFRefutation
% See solution above
% 48.39/6.55 # Parsed axioms : 17
% 48.39/6.55 # Removed by relevancy pruning/SinE : 0
% 48.39/6.55 # Initial clauses : 25
% 48.39/6.55 # Removed in clause preprocessing : 0
% 48.39/6.55 # Initial clauses in saturation : 25
% 48.39/6.55 # Processed clauses : 12269
% 48.39/6.55 # ...of these trivial : 642
% 48.39/6.55 # ...subsumed : 10017
% 48.39/6.55 # ...remaining for further processing : 1610
% 48.39/6.55 # Other redundant clauses eliminated : 610
% 48.39/6.55 # Clauses deleted for lack of memory : 0
% 48.39/6.55 # Backward-subsumed : 239
% 48.39/6.55 # Backward-rewritten : 230
% 48.39/6.55 # Generated clauses : 337912
% 48.39/6.55 # ...of the previous two non-redundant : 291029
% 48.39/6.55 # ...aggressively subsumed : 0
% 48.39/6.55 # Contextual simplify-reflections : 92
% 48.39/6.55 # Paramodulations : 337302
% 48.39/6.55 # Factorizations : 0
% 48.39/6.55 # NegExts : 0
% 48.39/6.55 # Equation resolutions : 610
% 48.39/6.55 # Total rewrite steps : 473422
% 48.39/6.55 # Propositional unsat checks : 0
% 48.39/6.55 # Propositional check models : 0
% 48.39/6.55 # Propositional check unsatisfiable : 0
% 48.39/6.55 # Propositional clauses : 0
% 48.39/6.55 # Propositional clauses after purity: 0
% 48.39/6.55 # Propositional unsat core size : 0
% 48.39/6.55 # Propositional preprocessing time : 0.000
% 48.39/6.55 # Propositional encoding time : 0.000
% 48.39/6.55 # Propositional solver time : 0.000
% 48.39/6.55 # Success case prop preproc time : 0.000
% 48.39/6.55 # Success case prop encoding time : 0.000
% 48.39/6.55 # Success case prop solver time : 0.000
% 48.39/6.55 # Current number of processed clauses : 1115
% 48.39/6.55 # Positive orientable unit clauses : 295
% 48.39/6.55 # Positive unorientable unit clauses: 17
% 48.39/6.55 # Negative unit clauses : 22
% 48.39/6.55 # Non-unit-clauses : 781
% 48.39/6.55 # Current number of unprocessed clauses: 276805
% 48.39/6.55 # ...number of literals in the above : 731743
% 48.39/6.55 # Current number of archived formulas : 0
% 48.39/6.55 # Current number of archived clauses : 494
% 48.39/6.55 # Clause-clause subsumption calls (NU) : 99720
% 48.39/6.55 # Rec. Clause-clause subsumption calls : 75414
% 48.39/6.55 # Non-unit clause-clause subsumptions : 5247
% 48.39/6.55 # Unit Clause-clause subsumption calls : 4851
% 48.39/6.55 # Rewrite failures with RHS unbound : 0
% 48.39/6.55 # BW rewrite match attempts : 1024
% 48.39/6.55 # BW rewrite match successes : 255
% 48.39/6.55 # Condensation attempts : 0
% 48.39/6.55 # Condensation successes : 0
% 48.39/6.55 # Termbank termtop insertions : 6751963
% 48.39/6.55
% 48.39/6.55 # -------------------------------------------------
% 48.39/6.55 # User time : 5.801 s
% 48.39/6.55 # System time : 0.214 s
% 48.39/6.55 # Total time : 6.015 s
% 48.39/6.55 # Maximum resident set size: 1780 pages
% 48.39/6.55
% 48.39/6.55 # -------------------------------------------------
% 48.39/6.55 # User time : 29.716 s
% 48.39/6.55 # System time : 0.422 s
% 48.39/6.55 # Total time : 30.138 s
% 48.39/6.55 # Maximum resident set size: 1692 pages
% 48.39/6.55 % E---3.1 exiting
% 48.39/6.55 % E---3.1 exiting
%------------------------------------------------------------------------------