TSTP Solution File: KLE018+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE018+1 : 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:42:36 EST 2010
% Result : Theorem 27.09s
% Output : CNFRefutation 27.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 14
% Syntax : Number of formulae : 125 ( 84 unt; 0 def)
% Number of atoms : 219 ( 134 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 151 ( 57 ~; 54 |; 32 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 151 ( 2 sgn 66 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',multiplicative_left_identity) ).
fof(3,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',additive_identity) ).
fof(4,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',left_distributivity) ).
fof(5,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',additive_associativity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',additive_commutativity) ).
fof(7,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',additive_idempotence) ).
fof(8,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',multiplicative_associativity) ).
fof(9,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',left_annihilation) ).
fof(11,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',test_3) ).
fof(12,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',test_2) ).
fof(14,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',multiplicative_right_identity) ).
fof(15,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',right_distributivity) ).
fof(16,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',order) ).
fof(17,conjecture,
! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(multiplication(X4,c(X5)),X6)
=> leq(X4,addition(X5,X6)) ) ),
file('/tmp/tmpFgRnEZ/sel_KLE018+1.p_1',goals) ).
fof(18,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(multiplication(X4,c(X5)),X6)
=> leq(X4,addition(X5,X6)) ) ),
inference(assume_negation,[status(cth)],[17]) ).
fof(22,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(23,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[22]) ).
fof(24,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(25,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[24]) ).
fof(26,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(27,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[26]) ).
fof(28,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[5]) ).
cnf(29,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[28]) ).
fof(30,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(31,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[30]) ).
fof(32,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[7]) ).
cnf(33,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[32]) ).
fof(34,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[8]) ).
cnf(35,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[34]) ).
fof(36,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[9]) ).
cnf(37,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[36]) ).
fof(41,plain,
! [X4,X5] :
( ~ test(X4)
| ( ( c(X4) != X5
| complement(X4,X5) )
& ( ~ complement(X4,X5)
| c(X4) = X5 ) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(42,plain,
! [X6,X7] :
( ~ test(X6)
| ( ( c(X6) != X7
| complement(X6,X7) )
& ( ~ complement(X6,X7)
| c(X6) = X7 ) ) ),
inference(variable_rename,[status(thm)],[41]) ).
fof(43,plain,
! [X6,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(X6) ) ),
inference(distribute,[status(thm)],[42]) ).
cnf(45,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(46,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(47,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)],[46]) ).
fof(48,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)],[47]) ).
cnf(50,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(52,plain,
( multiplication(X2,X1) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[48]) ).
fof(59,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[14]) ).
cnf(60,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[59]) ).
fof(61,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[15]) ).
cnf(62,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[61]) ).
fof(63,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| addition(X1,X2) = X2 )
& ( addition(X1,X2) != X2
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(64,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[63]) ).
cnf(65,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(66,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[64]) ).
fof(67,negated_conjecture,
? [X4,X5,X6] :
( test(X4)
& test(X5)
& test(X6)
& leq(multiplication(X4,c(X5)),X6)
& ~ leq(X4,addition(X5,X6)) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(68,negated_conjecture,
? [X7,X8,X9] :
( test(X7)
& test(X8)
& test(X9)
& leq(multiplication(X7,c(X8)),X9)
& ~ leq(X7,addition(X8,X9)) ),
inference(variable_rename,[status(thm)],[67]) ).
fof(69,negated_conjecture,
( test(esk2_0)
& test(esk3_0)
& test(esk4_0)
& leq(multiplication(esk2_0,c(esk3_0)),esk4_0)
& ~ leq(esk2_0,addition(esk3_0,esk4_0)) ),
inference(skolemize,[status(esa)],[68]) ).
cnf(70,negated_conjecture,
~ leq(esk2_0,addition(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(71,negated_conjecture,
leq(multiplication(esk2_0,c(esk3_0)),esk4_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(72,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(73,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(74,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[69]) ).
cnf(84,negated_conjecture,
addition(multiplication(esk2_0,c(esk3_0)),esk4_0) = esk4_0,
inference(spm,[status(thm)],[66,71,theory(equality)]) ).
cnf(85,negated_conjecture,
addition(esk4_0,multiplication(esk2_0,c(esk3_0))) = esk4_0,
inference(rw,[status(thm)],[84,31,theory(equality)]) ).
cnf(86,negated_conjecture,
addition(esk2_0,addition(esk3_0,esk4_0)) != addition(esk3_0,esk4_0),
inference(spm,[status(thm)],[70,65,theory(equality)]) ).
cnf(89,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[45,theory(equality)]) ).
cnf(113,plain,
addition(X1,X2) = addition(X1,addition(X1,X2)),
inference(spm,[status(thm)],[29,33,theory(equality)]) ).
cnf(119,plain,
addition(addition(X2,X1),X3) = addition(X1,addition(X2,X3)),
inference(spm,[status(thm)],[29,31,theory(equality)]) ).
cnf(124,plain,
addition(X2,addition(X1,X3)) = addition(X1,addition(X2,X3)),
inference(rw,[status(thm)],[119,29,theory(equality)]) ).
cnf(131,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[62,60,theory(equality)]) ).
cnf(165,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[27,23,theory(equality)]) ).
cnf(194,negated_conjecture,
addition(esk4_0,X1) = addition(esk4_0,addition(multiplication(esk2_0,c(esk3_0)),X1)),
inference(spm,[status(thm)],[29,85,theory(equality)]) ).
cnf(207,plain,
( multiplication(c(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[52,89,theory(equality)]) ).
cnf(209,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[50,89,theory(equality)]) ).
cnf(210,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[209,31,theory(equality)]) ).
cnf(213,plain,
( multiplication(zero,X2) = multiplication(c(X1),multiplication(X1,X2))
| ~ test(X1) ),
inference(spm,[status(thm)],[35,207,theory(equality)]) ).
cnf(217,plain,
( addition(multiplication(X1,X2),zero) = multiplication(addition(X1,c(X2)),X2)
| ~ test(X2) ),
inference(spm,[status(thm)],[27,207,theory(equality)]) ).
cnf(219,plain,
( zero = multiplication(c(X1),multiplication(X1,X2))
| ~ test(X1) ),
inference(rw,[status(thm)],[213,37,theory(equality)]) ).
cnf(223,plain,
( multiplication(X1,X2) = multiplication(addition(X1,c(X2)),X2)
| ~ test(X2) ),
inference(rw,[status(thm)],[217,25,theory(equality)]) ).
cnf(255,plain,
( addition(one,X2) = addition(X1,addition(c(X1),X2))
| ~ test(X1) ),
inference(spm,[status(thm)],[29,210,theory(equality)]) ).
cnf(320,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[113,210,theory(equality)]) ).
cnf(333,negated_conjecture,
addition(esk2_0,one) = one,
inference(spm,[status(thm)],[320,74,theory(equality)]) ).
cnf(334,negated_conjecture,
addition(esk3_0,one) = one,
inference(spm,[status(thm)],[320,73,theory(equality)]) ).
cnf(335,negated_conjecture,
addition(esk4_0,one) = one,
inference(spm,[status(thm)],[320,72,theory(equality)]) ).
cnf(338,negated_conjecture,
addition(one,esk2_0) = one,
inference(rw,[status(thm)],[333,31,theory(equality)]) ).
cnf(339,negated_conjecture,
addition(one,esk3_0) = one,
inference(rw,[status(thm)],[334,31,theory(equality)]) ).
cnf(340,negated_conjecture,
addition(one,esk4_0) = one,
inference(rw,[status(thm)],[335,31,theory(equality)]) ).
cnf(346,negated_conjecture,
addition(one,X1) = addition(one,addition(esk3_0,X1)),
inference(spm,[status(thm)],[29,339,theory(equality)]) ).
cnf(574,negated_conjecture,
( addition(one,one) = addition(one,c(esk3_0))
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[346,210,theory(equality)]) ).
cnf(584,negated_conjecture,
( one = addition(one,c(esk3_0))
| ~ test(esk3_0) ),
inference(rw,[status(thm)],[574,33,theory(equality)]) ).
cnf(585,negated_conjecture,
( one = addition(one,c(esk3_0))
| $false ),
inference(rw,[status(thm)],[584,73,theory(equality)]) ).
cnf(586,negated_conjecture,
one = addition(one,c(esk3_0)),
inference(cn,[status(thm)],[585,theory(equality)]) ).
cnf(1407,plain,
( multiplication(one,X1) = multiplication(X1,X1)
| ~ test(X1) ),
inference(spm,[status(thm)],[223,210,theory(equality)]) ).
cnf(1425,plain,
( X1 = multiplication(X1,X1)
| ~ test(X1) ),
inference(rw,[status(thm)],[1407,23,theory(equality)]) ).
cnf(1430,negated_conjecture,
multiplication(esk2_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[1425,74,theory(equality)]) ).
cnf(1431,negated_conjecture,
multiplication(esk3_0,esk3_0) = esk3_0,
inference(spm,[status(thm)],[1425,73,theory(equality)]) ).
cnf(1436,negated_conjecture,
multiplication(esk2_0,X1) = multiplication(esk2_0,multiplication(esk2_0,X1)),
inference(spm,[status(thm)],[35,1430,theory(equality)]) ).
cnf(1437,negated_conjecture,
addition(esk2_0,multiplication(esk2_0,X1)) = multiplication(esk2_0,addition(esk2_0,X1)),
inference(spm,[status(thm)],[62,1430,theory(equality)]) ).
cnf(1445,negated_conjecture,
multiplication(esk2_0,addition(one,X1)) = multiplication(esk2_0,addition(esk2_0,X1)),
inference(rw,[status(thm)],[1437,131,theory(equality)]) ).
cnf(1457,negated_conjecture,
addition(multiplication(X1,esk3_0),esk3_0) = multiplication(addition(X1,esk3_0),esk3_0),
inference(spm,[status(thm)],[27,1431,theory(equality)]) ).
cnf(1461,negated_conjecture,
( multiplication(c(esk3_0),esk3_0) = zero
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[219,1431,theory(equality)]) ).
cnf(1464,negated_conjecture,
addition(esk3_0,multiplication(X1,esk3_0)) = multiplication(addition(X1,esk3_0),esk3_0),
inference(rw,[status(thm)],[1457,31,theory(equality)]) ).
cnf(1468,negated_conjecture,
( multiplication(c(esk3_0),esk3_0) = zero
| $false ),
inference(rw,[status(thm)],[1461,73,theory(equality)]) ).
cnf(1469,negated_conjecture,
multiplication(c(esk3_0),esk3_0) = zero,
inference(cn,[status(thm)],[1468,theory(equality)]) ).
cnf(1517,negated_conjecture,
addition(multiplication(X1,esk3_0),zero) = multiplication(addition(X1,c(esk3_0)),esk3_0),
inference(spm,[status(thm)],[27,1469,theory(equality)]) ).
cnf(1528,negated_conjecture,
multiplication(X1,esk3_0) = multiplication(addition(X1,c(esk3_0)),esk3_0),
inference(rw,[status(thm)],[1517,25,theory(equality)]) ).
cnf(1571,negated_conjecture,
addition(multiplication(esk2_0,X1),multiplication(esk2_0,X2)) = multiplication(esk2_0,addition(X1,multiplication(esk2_0,X2))),
inference(spm,[status(thm)],[62,1436,theory(equality)]) ).
cnf(1589,negated_conjecture,
multiplication(esk2_0,addition(X1,X2)) = multiplication(esk2_0,addition(X1,multiplication(esk2_0,X2))),
inference(rw,[status(thm)],[1571,62,theory(equality)]) ).
cnf(2478,negated_conjecture,
addition(addition(X1,c(esk3_0)),multiplication(X1,esk3_0)) = multiplication(addition(X1,c(esk3_0)),addition(one,esk3_0)),
inference(spm,[status(thm)],[131,1528,theory(equality)]) ).
cnf(2496,negated_conjecture,
addition(X1,addition(c(esk3_0),multiplication(X1,esk3_0))) = multiplication(addition(X1,c(esk3_0)),addition(one,esk3_0)),
inference(rw,[status(thm)],[2478,29,theory(equality)]) ).
cnf(2497,negated_conjecture,
addition(X1,addition(c(esk3_0),multiplication(X1,esk3_0))) = addition(X1,c(esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[2496,339,theory(equality)]),60,theory(equality)]) ).
cnf(3678,negated_conjecture,
multiplication(addition(one,X1),esk3_0) = multiplication(addition(X1,esk3_0),esk3_0),
inference(rw,[status(thm)],[1464,165,theory(equality)]) ).
cnf(3694,negated_conjecture,
addition(addition(X1,esk3_0),multiplication(addition(one,X1),esk3_0)) = multiplication(addition(X1,esk3_0),addition(one,esk3_0)),
inference(spm,[status(thm)],[131,3678,theory(equality)]) ).
cnf(3739,negated_conjecture,
addition(X1,multiplication(addition(one,X1),esk3_0)) = multiplication(addition(X1,esk3_0),addition(one,esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3694,29,theory(equality)]),165,theory(equality)]),113,theory(equality)]) ).
cnf(3740,negated_conjecture,
addition(X1,multiplication(addition(one,X1),esk3_0)) = addition(X1,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[3739,339,theory(equality)]),60,theory(equality)]) ).
cnf(5579,negated_conjecture,
addition(esk4_0,multiplication(esk2_0,addition(c(esk3_0),X1))) = addition(esk4_0,multiplication(esk2_0,X1)),
inference(spm,[status(thm)],[194,62,theory(equality)]) ).
cnf(214500,negated_conjecture,
( addition(esk3_0,c(esk3_0)) = addition(one,multiplication(esk3_0,esk3_0))
| ~ test(esk3_0) ),
inference(spm,[status(thm)],[255,2497,theory(equality)]) ).
cnf(214986,negated_conjecture,
( addition(esk3_0,c(esk3_0)) = one
| ~ test(esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[214500,1431,theory(equality)]),339,theory(equality)]) ).
cnf(214987,negated_conjecture,
( addition(esk3_0,c(esk3_0)) = one
| $false ),
inference(rw,[status(thm)],[214986,73,theory(equality)]) ).
cnf(214988,negated_conjecture,
addition(esk3_0,c(esk3_0)) = one,
inference(cn,[status(thm)],[214987,theory(equality)]) ).
cnf(676143,negated_conjecture,
addition(esk4_0,multiplication(esk2_0,addition(c(esk3_0),esk3_0))) = addition(esk4_0,multiplication(esk2_0,multiplication(addition(one,c(esk3_0)),esk3_0))),
inference(spm,[status(thm)],[5579,3740,theory(equality)]) ).
cnf(676366,negated_conjecture,
addition(esk2_0,esk4_0) = addition(esk4_0,multiplication(esk2_0,multiplication(addition(one,c(esk3_0)),esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[676143,31,theory(equality)]),214988,theory(equality)]),60,theory(equality)]),31,theory(equality)]) ).
cnf(676367,negated_conjecture,
addition(esk2_0,esk4_0) = addition(esk4_0,multiplication(esk2_0,esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[676366,586,theory(equality)]),23,theory(equality)]) ).
cnf(679621,negated_conjecture,
multiplication(esk2_0,addition(esk2_0,esk4_0)) = multiplication(esk2_0,addition(esk4_0,esk3_0)),
inference(spm,[status(thm)],[1589,676367,theory(equality)]) ).
cnf(679761,negated_conjecture,
esk2_0 = multiplication(esk2_0,addition(esk4_0,esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[679621,1445,theory(equality)]),340,theory(equality)]),60,theory(equality)]) ).
cnf(679762,negated_conjecture,
esk2_0 = multiplication(esk2_0,addition(esk3_0,esk4_0)),
inference(rw,[status(thm)],[679761,31,theory(equality)]) ).
cnf(680889,negated_conjecture,
addition(addition(esk3_0,esk4_0),esk2_0) = multiplication(addition(one,esk2_0),addition(esk3_0,esk4_0)),
inference(spm,[status(thm)],[165,679762,theory(equality)]) ).
cnf(681112,negated_conjecture,
addition(esk2_0,addition(esk3_0,esk4_0)) = multiplication(addition(one,esk2_0),addition(esk3_0,esk4_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[680889,29,theory(equality)]),31,theory(equality)]),124,theory(equality)]) ).
cnf(681113,negated_conjecture,
addition(esk2_0,addition(esk3_0,esk4_0)) = addition(esk3_0,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[681112,338,theory(equality)]),23,theory(equality)]) ).
cnf(681114,negated_conjecture,
$false,
inference(sr,[status(thm)],[681113,86,theory(equality)]) ).
cnf(681115,negated_conjecture,
$false,
681114,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE018+1.p
% --creating new selector for [KLE001+0.ax, KLE001+1.ax]
% -running prover on /tmp/tmpFgRnEZ/sel_KLE018+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE018+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE018+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE018+1.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
%
%------------------------------------------------------------------------------