TSTP Solution File: KLE024+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE024+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 11:49:17 EST 2010
% Result : Theorem 186.70s
% Output : CNFRefutation 186.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 17
% Syntax : Number of formulae : 178 ( 56 unt; 0 def)
% Number of atoms : 415 ( 233 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 424 ( 187 ~; 194 |; 31 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 206 ( 13 sgn 81 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',right_annihilation) ).
fof(2,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',multiplicative_left_identity) ).
fof(3,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',additive_identity) ).
fof(5,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',additive_associativity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',additive_commutativity) ).
fof(7,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',additive_idempotence) ).
fof(8,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',multiplicative_associativity) ).
fof(9,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',left_annihilation) ).
fof(10,axiom,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',test_4) ).
fof(11,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',test_3) ).
fof(12,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',test_2) ).
fof(13,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',test_1) ).
fof(14,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',multiplicative_right_identity) ).
fof(15,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(addition(X4,X5)) = multiplication(c(X4),c(X5)) ),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',test_deMorgan1) ).
fof(16,axiom,
! [X4,X5] :
( ( test(X4)
& test(X5) )
=> c(multiplication(X4,X5)) = addition(c(X4),c(X5)) ),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',test_deMorgan2) ).
fof(17,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',right_distributivity) ).
fof(18,conjecture,
! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4)
=> multiplication(multiplication(X5,X4),c(X6)) = zero ) ),
file('/tmp/tmpzylLq1/sel_KLE024+2.p_4',goals) ).
fof(19,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4)
=> multiplication(multiplication(X5,X4),c(X6)) = zero ) ),
inference(assume_negation,[status(cth)],[18]) ).
fof(20,plain,
! [X4] :
( ~ test(X4)
=> c(X4) = zero ),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(21,plain,
! [X2] : multiplication(X2,zero) = zero,
inference(variable_rename,[status(thm)],[1]) ).
cnf(22,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[21]) ).
fof(23,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(24,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[23]) ).
fof(25,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(26,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[25]) ).
fof(29,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[5]) ).
cnf(30,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[29]) ).
fof(31,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[31]) ).
fof(33,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[7]) ).
cnf(34,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[33]) ).
fof(35,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[8]) ).
cnf(36,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[35]) ).
fof(37,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[9]) ).
cnf(38,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[37]) ).
fof(39,plain,
! [X4] :
( test(X4)
| c(X4) = zero ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(40,plain,
! [X5] :
( test(X5)
| c(X5) = zero ),
inference(variable_rename,[status(thm)],[39]) ).
cnf(41,plain,
( c(X1) = zero
| test(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
fof(42,plain,
! [X4,X5] :
( ~ test(X4)
| ( ( c(X4) != X5
| complement(X4,X5) )
& ( ~ complement(X4,X5)
| c(X4) = X5 ) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(43,plain,
! [X6,X7] :
( ~ test(X6)
| ( ( c(X6) != X7
| complement(X6,X7) )
& ( ~ complement(X6,X7)
| c(X6) = X7 ) ) ),
inference(variable_rename,[status(thm)],[42]) ).
fof(44,plain,
! [X6,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(X6) ) ),
inference(distribute,[status(thm)],[43]) ).
cnf(45,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[44]) ).
cnf(46,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[44]) ).
fof(47,plain,
! [X4,X5] :
( ( ~ complement(X5,X4)
| ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) )
& ( multiplication(X4,X5) != zero
| multiplication(X5,X4) != zero
| addition(X4,X5) != one
| complement(X5,X4) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(48,plain,
! [X6,X7] :
( ( ~ complement(X7,X6)
| ( multiplication(X6,X7) = zero
& multiplication(X7,X6) = zero
& addition(X6,X7) = one ) )
& ( multiplication(X6,X7) != zero
| multiplication(X7,X6) != zero
| addition(X6,X7) != one
| complement(X7,X6) ) ),
inference(variable_rename,[status(thm)],[47]) ).
fof(49,plain,
! [X6,X7] :
( ( multiplication(X6,X7) = zero
| ~ complement(X7,X6) )
& ( multiplication(X7,X6) = zero
| ~ complement(X7,X6) )
& ( addition(X6,X7) = one
| ~ complement(X7,X6) )
& ( multiplication(X6,X7) != zero
| multiplication(X7,X6) != zero
| addition(X6,X7) != one
| complement(X7,X6) ) ),
inference(distribute,[status(thm)],[48]) ).
cnf(50,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(51,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(52,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(53,plain,
( multiplication(X2,X1) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(54,plain,
! [X4] :
( ( ~ test(X4)
| ? [X5] : complement(X5,X4) )
& ( ! [X5] : ~ complement(X5,X4)
| test(X4) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(55,plain,
! [X6] :
( ( ~ test(X6)
| ? [X7] : complement(X7,X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,plain,
! [X6] :
( ( ~ test(X6)
| complement(esk1_1(X6),X6) )
& ( ! [X8] : ~ complement(X8,X6)
| test(X6) ) ),
inference(skolemize,[status(esa)],[55]) ).
fof(57,plain,
! [X6,X8] :
( ( ~ complement(X8,X6)
| test(X6) )
& ( ~ test(X6)
| complement(esk1_1(X6),X6) ) ),
inference(shift_quantors,[status(thm)],[56]) ).
cnf(58,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(59,plain,
( test(X1)
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(60,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[14]) ).
cnf(61,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[60]) ).
fof(62,plain,
! [X4,X5] :
( ~ test(X4)
| ~ test(X5)
| c(addition(X4,X5)) = multiplication(c(X4),c(X5)) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(63,plain,
! [X6,X7] :
( ~ test(X6)
| ~ test(X7)
| c(addition(X6,X7)) = multiplication(c(X6),c(X7)) ),
inference(variable_rename,[status(thm)],[62]) ).
cnf(64,plain,
( c(addition(X1,X2)) = multiplication(c(X1),c(X2))
| ~ test(X2)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[63]) ).
fof(65,plain,
! [X4,X5] :
( ~ test(X4)
| ~ test(X5)
| c(multiplication(X4,X5)) = addition(c(X4),c(X5)) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(66,plain,
! [X6,X7] :
( ~ test(X6)
| ~ test(X7)
| c(multiplication(X6,X7)) = addition(c(X6),c(X7)) ),
inference(variable_rename,[status(thm)],[65]) ).
cnf(67,plain,
( c(multiplication(X1,X2)) = addition(c(X1),c(X2))
| ~ test(X2)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(68,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[17]) ).
cnf(69,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[68]) ).
fof(70,negated_conjecture,
? [X4,X5,X6] :
( test(X5)
& test(X6)
& addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4)
& multiplication(multiplication(X5,X4),c(X6)) != zero ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(71,negated_conjecture,
? [X7,X8,X9] :
( test(X8)
& test(X9)
& addition(multiplication(X7,c(X9)),multiplication(c(X8),X7)) = multiplication(c(X8),X7)
& multiplication(multiplication(X8,X7),c(X9)) != zero ),
inference(variable_rename,[status(thm)],[70]) ).
fof(72,negated_conjecture,
( test(esk3_0)
& test(esk4_0)
& addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) = multiplication(c(esk3_0),esk2_0)
& multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) != zero ),
inference(skolemize,[status(esa)],[71]) ).
cnf(73,negated_conjecture,
multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) != zero,
inference(split_conjunct,[status(thm)],[72]) ).
cnf(74,negated_conjecture,
addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) = multiplication(c(esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(76,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(77,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[26,32,theory(equality)]) ).
cnf(84,plain,
( multiplication(X1,esk1_1(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[53,58,theory(equality)]) ).
cnf(86,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[51,58,theory(equality)]) ).
cnf(87,plain,
( test(X1)
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[59,46,theory(equality)]) ).
cnf(88,plain,
( multiplication(X1,X2) = zero
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[53,46,theory(equality)]) ).
cnf(89,plain,
( multiplication(X1,X2) = zero
| c(X1) != X2
| ~ test(X1) ),
inference(spm,[status(thm)],[52,46,theory(equality)]) ).
cnf(90,plain,
( addition(X1,X2) = one
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[51,46,theory(equality)]) ).
cnf(100,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) != zero,
inference(rw,[status(thm)],[73,36,theory(equality)]) ).
cnf(114,plain,
addition(X1,X2) = addition(X1,addition(X1,X2)),
inference(spm,[status(thm)],[30,34,theory(equality)]) ).
cnf(126,plain,
( multiplication(c(addition(X1,X2)),X3) = multiplication(c(X1),multiplication(c(X2),X3))
| ~ test(X2)
| ~ test(X1) ),
inference(spm,[status(thm)],[36,64,theory(equality)]) ).
cnf(127,plain,
( c(multiplication(X1,X1)) = c(X1)
| ~ test(X1) ),
inference(spm,[status(thm)],[34,67,theory(equality)]) ).
cnf(198,plain,
( test(X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(spm,[status(thm)],[59,50,theory(equality)]) ).
cnf(202,plain,
( c(X1) = X2
| ~ test(X1)
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| addition(X2,X1) != one ),
inference(spm,[status(thm)],[45,50,theory(equality)]) ).
cnf(210,plain,
( test(c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[87,theory(equality)]) ).
cnf(227,plain,
( addition(multiplication(X1,X2),zero) = multiplication(X1,addition(X2,esk1_1(X1)))
| ~ test(X1) ),
inference(spm,[status(thm)],[69,84,theory(equality)]) ).
cnf(232,plain,
( multiplication(X1,X2) = multiplication(X1,addition(X2,esk1_1(X1)))
| ~ test(X1) ),
inference(rw,[status(thm)],[227,26,theory(equality)]) ).
cnf(280,plain,
( multiplication(c(X1),X1) = zero
| ~ test(X1) ),
inference(er,[status(thm)],[88,theory(equality)]) ).
cnf(291,plain,
( zero = c(one)
| ~ test(one) ),
inference(spm,[status(thm)],[61,280,theory(equality)]) ).
cnf(292,plain,
( multiplication(zero,X2) = multiplication(c(X1),multiplication(X1,X2))
| ~ test(X1) ),
inference(spm,[status(thm)],[36,280,theory(equality)]) ).
cnf(293,plain,
( addition(zero,multiplication(c(X1),X2)) = multiplication(c(X1),addition(X1,X2))
| ~ test(X1) ),
inference(spm,[status(thm)],[69,280,theory(equality)]) ).
cnf(300,plain,
( zero = multiplication(c(X1),multiplication(X1,X2))
| ~ test(X1) ),
inference(rw,[status(thm)],[292,38,theory(equality)]) ).
cnf(301,plain,
( multiplication(c(X1),X2) = multiplication(c(X1),addition(X1,X2))
| ~ test(X1) ),
inference(rw,[status(thm)],[293,77,theory(equality)]) ).
cnf(307,plain,
c(one) = zero,
inference(csr,[status(thm)],[291,41]) ).
cnf(312,plain,
( test(X1)
| zero != X1
| ~ test(one) ),
inference(spm,[status(thm)],[87,307,theory(equality)]) ).
cnf(313,plain,
( test(zero)
| ~ test(one) ),
inference(spm,[status(thm)],[210,307,theory(equality)]) ).
cnf(374,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[114,86,theory(equality)]) ).
cnf(388,plain,
( multiplication(X1,c(X1)) = zero
| ~ test(X1) ),
inference(er,[status(thm)],[89,theory(equality)]) ).
cnf(444,plain,
( multiplication(zero,X2) = multiplication(X1,multiplication(c(X1),X2))
| ~ test(X1) ),
inference(spm,[status(thm)],[36,388,theory(equality)]) ).
cnf(456,plain,
( zero = multiplication(X1,multiplication(c(X1),X2))
| ~ test(X1) ),
inference(rw,[status(thm)],[444,38,theory(equality)]) ).
cnf(479,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(er,[status(thm)],[90,theory(equality)]) ).
cnf(484,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[479,32,theory(equality)]) ).
cnf(487,plain,
( one = c(zero)
| ~ test(zero) ),
inference(spm,[status(thm)],[77,484,theory(equality)]) ).
cnf(491,plain,
( addition(multiplication(X1,X1),c(X1)) = one
| ~ test(multiplication(X1,X1))
| ~ test(X1) ),
inference(spm,[status(thm)],[484,127,theory(equality)]) ).
cnf(500,plain,
( c(zero) = one
| c(zero) = zero ),
inference(spm,[status(thm)],[487,41,theory(equality)]) ).
cnf(501,plain,
( c(zero) = zero
| one != zero ),
inference(ef,[status(thm)],[500,theory(equality)]) ).
cnf(507,plain,
( test(one)
| c(zero) = zero
| ~ test(zero) ),
inference(spm,[status(thm)],[210,500,theory(equality)]) ).
cnf(559,plain,
( c(zero) = zero
| test(one) ),
inference(csr,[status(thm)],[507,41]) ).
cnf(561,plain,
( test(X1)
| c(zero) = zero
| zero != X1 ),
inference(spm,[status(thm)],[312,559,theory(equality)]) ).
cnf(1010,plain,
( addition(multiplication(c(X1),X2),zero) = multiplication(c(X1),addition(X2,multiplication(X1,X3)))
| ~ test(X1) ),
inference(spm,[status(thm)],[69,300,theory(equality)]) ).
cnf(1033,plain,
( multiplication(c(X1),X2) = multiplication(c(X1),addition(X2,multiplication(X1,X3)))
| ~ test(X1) ),
inference(rw,[status(thm)],[1010,26,theory(equality)]) ).
cnf(1219,plain,
( multiplication(zero,multiplication(c(X1),X2)) = multiplication(c(addition(zero,X1)),X2)
| ~ test(X1)
| ~ test(zero)
| one != zero ),
inference(spm,[status(thm)],[126,501,theory(equality)]) ).
cnf(1253,plain,
( zero = multiplication(c(addition(zero,X1)),X2)
| ~ test(X1)
| ~ test(zero)
| one != zero ),
inference(rw,[status(thm)],[1219,38,theory(equality)]) ).
cnf(1254,plain,
( zero = multiplication(c(X1),X2)
| ~ test(X1)
| ~ test(zero)
| one != zero ),
inference(rw,[status(thm)],[1253,77,theory(equality)]) ).
cnf(1781,negated_conjecture,
( addition(multiplication(esk2_0,c(esk4_0)),zero) = zero
| one != zero
| ~ test(zero)
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[74,1254,theory(equality)]) ).
cnf(1807,negated_conjecture,
( multiplication(esk2_0,c(esk4_0)) = zero
| one != zero
| ~ test(zero)
| ~ test(esk3_0) ),
inference(rw,[status(thm)],[1781,26,theory(equality)]) ).
cnf(1808,negated_conjecture,
( multiplication(esk2_0,c(esk4_0)) = zero
| one != zero
| ~ test(zero)
| $false ),
inference(rw,[status(thm)],[1807,76,theory(equality)]) ).
cnf(1809,negated_conjecture,
( multiplication(esk2_0,c(esk4_0)) = zero
| one != zero
| ~ test(zero) ),
inference(cn,[status(thm)],[1808,theory(equality)]) ).
cnf(1847,negated_conjecture,
( multiplication(esk3_0,zero) != zero
| one != zero
| ~ test(zero) ),
inference(spm,[status(thm)],[100,1809,theory(equality)]) ).
cnf(1859,negated_conjecture,
( $false
| one != zero
| ~ test(zero) ),
inference(rw,[status(thm)],[1847,22,theory(equality)]) ).
cnf(1860,negated_conjecture,
( one != zero
| ~ test(zero) ),
inference(cn,[status(thm)],[1859,theory(equality)]) ).
cnf(4244,plain,
( test(X1)
| multiplication(X1,zero) != zero
| multiplication(zero,X1) != zero
| X1 != one ),
inference(spm,[status(thm)],[198,26,theory(equality)]) ).
cnf(4287,plain,
( test(X1)
| $false
| multiplication(zero,X1) != zero
| X1 != one ),
inference(rw,[status(thm)],[4244,22,theory(equality)]) ).
cnf(4288,plain,
( test(X1)
| $false
| $false
| X1 != one ),
inference(rw,[status(thm)],[4287,38,theory(equality)]) ).
cnf(4289,plain,
( test(X1)
| X1 != one ),
inference(cn,[status(thm)],[4288,theory(equality)]) ).
cnf(4348,plain,
test(zero),
inference(spm,[status(thm)],[313,4289,theory(equality)]) ).
cnf(4359,negated_conjecture,
one != zero,
inference(spm,[status(thm)],[1860,4289,theory(equality)]) ).
cnf(4376,plain,
( c(zero) = one
| $false ),
inference(rw,[status(thm)],[487,4348,theory(equality)]) ).
cnf(4377,plain,
c(zero) = one,
inference(cn,[status(thm)],[4376,theory(equality)]) ).
cnf(4419,plain,
( one = zero
| test(X1)
| zero != X1 ),
inference(rw,[status(thm)],[561,4377,theory(equality)]) ).
cnf(4420,plain,
( test(X1)
| zero != X1 ),
inference(sr,[status(thm)],[4419,4359,theory(equality)]) ).
cnf(4596,plain,
( addition(X1,one) = one
| zero != X1 ),
inference(spm,[status(thm)],[374,4420,theory(equality)]) ).
cnf(4991,plain,
( one = addition(one,X1)
| zero != X1 ),
inference(spm,[status(thm)],[32,4596,theory(equality)]) ).
cnf(6129,plain,
( c(X1) = one
| multiplication(one,X1) != zero
| multiplication(X1,one) != zero
| ~ test(X1)
| zero != X1 ),
inference(spm,[status(thm)],[202,4991,theory(equality)]) ).
cnf(6200,plain,
( c(X1) = one
| X1 != zero
| multiplication(X1,one) != zero
| ~ test(X1)
| zero != X1 ),
inference(rw,[status(thm)],[6129,24,theory(equality)]) ).
cnf(6201,plain,
( c(X1) = one
| X1 != zero
| X1 != zero
| ~ test(X1)
| zero != X1 ),
inference(rw,[status(thm)],[6200,61,theory(equality)]) ).
cnf(6202,plain,
( c(X1) = one
| X1 != zero
| ~ test(X1) ),
inference(cn,[status(thm)],[6201,theory(equality)]) ).
cnf(6203,plain,
( c(X1) = one
| X1 != zero ),
inference(csr,[status(thm)],[6202,4420]) ).
cnf(8133,plain,
( multiplication(X1,one) = multiplication(X1,X1)
| ~ test(X1) ),
inference(spm,[status(thm)],[232,86,theory(equality)]) ).
cnf(8173,plain,
( X1 = multiplication(X1,X1)
| ~ test(X1) ),
inference(rw,[status(thm)],[8133,61,theory(equality)]) ).
cnf(8636,negated_conjecture,
multiplication(esk3_0,esk3_0) = esk3_0,
inference(spm,[status(thm)],[8173,76,theory(equality)]) ).
cnf(8762,negated_conjecture,
( multiplication(c(esk3_0),esk3_0) = zero
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[300,8636,theory(equality)]) ).
cnf(8782,negated_conjecture,
( multiplication(c(esk3_0),esk3_0) = zero
| $false ),
inference(rw,[status(thm)],[8762,76,theory(equality)]) ).
cnf(8783,negated_conjecture,
multiplication(c(esk3_0),esk3_0) = zero,
inference(cn,[status(thm)],[8782,theory(equality)]) ).
cnf(8843,negated_conjecture,
multiplication(zero,X1) = multiplication(c(esk3_0),multiplication(esk3_0,X1)),
inference(spm,[status(thm)],[36,8783,theory(equality)]) ).
cnf(8872,negated_conjecture,
zero = multiplication(c(esk3_0),multiplication(esk3_0,X1)),
inference(rw,[status(thm)],[8843,38,theory(equality)]) ).
cnf(9472,negated_conjecture,
( multiplication(one,multiplication(esk3_0,X1)) = zero
| esk3_0 != zero ),
inference(spm,[status(thm)],[8872,6203,theory(equality)]) ).
cnf(9547,negated_conjecture,
( multiplication(esk3_0,X1) = zero
| esk3_0 != zero ),
inference(rw,[status(thm)],[9472,24,theory(equality)]) ).
cnf(9596,negated_conjecture,
esk3_0 != zero,
inference(spm,[status(thm)],[100,9547,theory(equality)]) ).
cnf(15921,negated_conjecture,
( addition(esk3_0,c(esk3_0)) = one
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[491,8636,theory(equality)]) ).
cnf(16020,negated_conjecture,
( addition(esk3_0,c(esk3_0)) = one
| $false ),
inference(rw,[status(thm)],[15921,76,theory(equality)]) ).
cnf(16021,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(cn,[status(thm)],[16020,theory(equality)]) ).
cnf(16125,negated_conjecture,
( c(c(esk3_0)) = esk3_0
| multiplication(esk3_0,c(esk3_0)) != zero
| multiplication(c(esk3_0),esk3_0) != zero
| ~ test(c(esk3_0)) ),
inference(spm,[status(thm)],[202,16021,theory(equality)]) ).
cnf(16137,negated_conjecture,
( multiplication(c(esk3_0),one) = multiplication(c(esk3_0),c(esk3_0))
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[301,16021,theory(equality)]) ).
cnf(16193,negated_conjecture,
( c(c(esk3_0)) = esk3_0
| multiplication(esk3_0,c(esk3_0)) != zero
| $false
| ~ test(c(esk3_0)) ),
inference(rw,[status(thm)],[16125,8783,theory(equality)]) ).
cnf(16194,negated_conjecture,
( c(c(esk3_0)) = esk3_0
| multiplication(esk3_0,c(esk3_0)) != zero
| ~ test(c(esk3_0)) ),
inference(cn,[status(thm)],[16193,theory(equality)]) ).
cnf(16219,negated_conjecture,
( c(esk3_0) = multiplication(c(esk3_0),c(esk3_0))
| ~ test(esk3_0) ),
inference(rw,[status(thm)],[16137,61,theory(equality)]) ).
cnf(16220,negated_conjecture,
( c(esk3_0) = multiplication(c(esk3_0),c(esk3_0))
| $false ),
inference(rw,[status(thm)],[16219,76,theory(equality)]) ).
cnf(16221,negated_conjecture,
c(esk3_0) = multiplication(c(esk3_0),c(esk3_0)),
inference(cn,[status(thm)],[16220,theory(equality)]) ).
cnf(16546,negated_conjecture,
( multiplication(esk3_0,c(esk3_0)) = zero
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[456,16221,theory(equality)]) ).
cnf(16590,negated_conjecture,
( multiplication(esk3_0,c(esk3_0)) = zero
| $false ),
inference(rw,[status(thm)],[16546,76,theory(equality)]) ).
cnf(16591,negated_conjecture,
multiplication(esk3_0,c(esk3_0)) = zero,
inference(cn,[status(thm)],[16590,theory(equality)]) ).
cnf(16619,negated_conjecture,
multiplication(zero,X1) = multiplication(esk3_0,multiplication(c(esk3_0),X1)),
inference(spm,[status(thm)],[36,16591,theory(equality)]) ).
cnf(16661,negated_conjecture,
zero = multiplication(esk3_0,multiplication(c(esk3_0),X1)),
inference(rw,[status(thm)],[16619,38,theory(equality)]) ).
cnf(17227,negated_conjecture,
( c(c(esk3_0)) = esk3_0
| $false
| ~ test(c(esk3_0)) ),
inference(rw,[status(thm)],[16194,16591,theory(equality)]) ).
cnf(17228,negated_conjecture,
( c(c(esk3_0)) = esk3_0
| ~ test(c(esk3_0)) ),
inference(cn,[status(thm)],[17227,theory(equality)]) ).
cnf(17230,negated_conjecture,
( c(c(esk3_0)) = esk3_0
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[17228,210,theory(equality)]) ).
cnf(17239,negated_conjecture,
( c(c(esk3_0)) = esk3_0
| $false ),
inference(rw,[status(thm)],[17230,76,theory(equality)]) ).
cnf(17240,negated_conjecture,
c(c(esk3_0)) = esk3_0,
inference(cn,[status(thm)],[17239,theory(equality)]) ).
cnf(32590,negated_conjecture,
( multiplication(c(c(esk3_0)),multiplication(c(esk3_0),esk2_0)) = multiplication(c(c(esk3_0)),multiplication(esk2_0,c(esk4_0)))
| ~ test(c(esk3_0)) ),
inference(spm,[status(thm)],[1033,74,theory(equality)]) ).
cnf(32777,negated_conjecture,
( zero = multiplication(c(c(esk3_0)),multiplication(esk2_0,c(esk4_0)))
| ~ test(c(esk3_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[32590,17240,theory(equality)]),16661,theory(equality)]) ).
cnf(32778,negated_conjecture,
( zero = multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))
| ~ test(c(esk3_0)) ),
inference(rw,[status(thm)],[32777,17240,theory(equality)]) ).
cnf(32779,negated_conjecture,
~ test(c(esk3_0)),
inference(sr,[status(thm)],[32778,100,theory(equality)]) ).
cnf(32973,negated_conjecture,
c(c(esk3_0)) = zero,
inference(spm,[status(thm)],[32779,41,theory(equality)]) ).
cnf(32990,negated_conjecture,
esk3_0 = zero,
inference(rw,[status(thm)],[32973,17240,theory(equality)]) ).
cnf(32991,negated_conjecture,
$false,
inference(sr,[status(thm)],[32990,9596,theory(equality)]) ).
cnf(32992,negated_conjecture,
$false,
32991,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE024+2.p
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% eprover: CPU time limit exceeded, terminating
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpzylLq1/sel_KLE024+2.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpzylLq1/sel_KLE024+2.p_2 with time limit 81
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% eprover: CPU time limit exceeded, terminating
% -running prover on /tmp/tmpzylLq1/sel_KLE024+2.p_3 with time limit 75
% -prover status ResourceOut
% --creating new selector for [KLE001+0.ax, KLE001+1.ax, KLE001+2.ax]
% -running prover on /tmp/tmpzylLq1/sel_KLE024+2.p_4 with time limit 55
% -prover status Theorem
% Problem KLE024+2.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE024+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE024+2.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------