TSTP Solution File: KLE027+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE027+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:50:58 EST 2010
% Result : Theorem 186.54s
% Output : CNFRefutation 186.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of formulae : 86 ( 43 unt; 0 def)
% Number of atoms : 180 ( 104 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 168 ( 74 ~; 62 |; 26 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 134 ( 4 sgn 68 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',multiplicative_left_identity) ).
fof(3,axiom,
! [X1] : addition(X1,zero) = X1,
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',additive_identity) ).
fof(4,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',left_distributivity) ).
fof(5,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',additive_associativity) ).
fof(6,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',additive_commutativity) ).
fof(7,axiom,
! [X1] : addition(X1,X1) = X1,
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',additive_idempotence) ).
fof(8,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',multiplicative_associativity) ).
fof(9,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',left_annihilation) ).
fof(10,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',order) ).
fof(12,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',test_3) ).
fof(13,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',test_2) ).
fof(18,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',right_distributivity) ).
fof(19,conjecture,
! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> ( leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))
& leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))) ) ),
file('/tmp/tmpiC_Mc7/sel_KLE027+4.p_4',goals) ).
fof(20,negated_conjecture,
~ ! [X4,X5,X6,X7,X8] :
( ( test(X7)
& test(X8) )
=> ( leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))
& leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))) ) ),
inference(assume_negation,[status(cth)],[19]) ).
fof(24,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[2]) ).
cnf(25,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[24]) ).
fof(26,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[3]) ).
cnf(27,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[26]) ).
fof(28,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[4]) ).
cnf(29,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[28]) ).
fof(30,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[5]) ).
cnf(31,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[30]) ).
fof(32,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[6]) ).
cnf(33,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[32]) ).
fof(34,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[7]) ).
cnf(35,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[34]) ).
fof(36,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[8]) ).
cnf(37,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[36]) ).
fof(38,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[9]) ).
cnf(39,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[38]) ).
fof(40,plain,
! [X1,X2] :
( ( ~ leq(X1,X2)
| addition(X1,X2) = X2 )
& ( addition(X1,X2) != X2
| leq(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(41,plain,
! [X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(variable_rename,[status(thm)],[40]) ).
cnf(42,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(47,plain,
! [X4,X5] :
( ~ test(X4)
| ( ( c(X4) != X5
| complement(X4,X5) )
& ( ~ complement(X4,X5)
| c(X4) = X5 ) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(48,plain,
! [X6,X7] :
( ~ test(X6)
| ( ( c(X6) != X7
| complement(X6,X7) )
& ( ~ complement(X6,X7)
| c(X6) = X7 ) ) ),
inference(variable_rename,[status(thm)],[47]) ).
fof(49,plain,
! [X6,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(X6) ) ),
inference(distribute,[status(thm)],[48]) ).
cnf(51,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(52,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)],[13]) ).
fof(53,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)],[52]) ).
fof(54,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)],[53]) ).
cnf(56,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(57,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
cnf(58,plain,
( multiplication(X2,X1) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
fof(73,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[18]) ).
cnf(74,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[73]) ).
fof(75,negated_conjecture,
? [X4,X5,X6,X7,X8] :
( test(X7)
& test(X8)
& ( ~ leq(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6)),addition(multiplication(X7,X4),multiplication(c(X7),X6)))
| ~ leq(addition(multiplication(X7,X4),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))) ) ),
inference(fof_nnf,[status(thm)],[20]) ).
fof(76,negated_conjecture,
? [X9,X10,X11,X12,X13] :
( test(X12)
& test(X13)
& ( ~ leq(addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11)),addition(multiplication(X12,X9),multiplication(c(X12),X11)))
| ~ leq(addition(multiplication(X12,X9),multiplication(c(X12),X11)),addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11))) ) ),
inference(variable_rename,[status(thm)],[75]) ).
fof(77,negated_conjecture,
( test(esk5_0)
& test(esk6_0)
& ( ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))
| ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0))) ) ),
inference(skolemize,[status(esa)],[76]) ).
cnf(78,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)))
| ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(80,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(93,plain,
( multiplication(X1,X2) = zero
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[58,51,theory(equality)]) ).
cnf(94,plain,
( multiplication(X1,X2) = zero
| c(X1) != X2
| ~ test(X1) ),
inference(spm,[status(thm)],[57,51,theory(equality)]) ).
cnf(95,plain,
( addition(X1,X2) = one
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[56,51,theory(equality)]) ).
cnf(116,plain,
addition(X1,X2) = addition(X1,addition(X1,X2)),
inference(spm,[status(thm)],[31,35,theory(equality)]) ).
cnf(120,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[33,31,theory(equality)]) ).
cnf(145,plain,
addition(multiplication(X1,addition(X2,X3)),X4) = addition(multiplication(X1,X2),addition(multiplication(X1,X3),X4)),
inference(spm,[status(thm)],[31,74,theory(equality)]) ).
cnf(206,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
| ~ leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
inference(rw,[status(thm)],[78,33,theory(equality)]) ).
cnf(207,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
| ~ leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) ),
inference(rw,[status(thm)],[206,33,theory(equality)]) ).
cnf(208,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
| addition(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
inference(spm,[status(thm)],[207,42,theory(equality)]) ).
cnf(209,negated_conjecture,
( ~ leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))
| addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[208,31,theory(equality)]),33,theory(equality)]),31,theory(equality)]) ).
cnf(210,negated_conjecture,
( addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))
| addition(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))) ),
inference(spm,[status(thm)],[209,42,theory(equality)]) ).
cnf(211,negated_conjecture,
( addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))
| addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))) ),
inference(rw,[status(thm)],[210,31,theory(equality)]) ).
cnf(300,negated_conjecture,
( addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))
| addition(multiplication(c(esk5_0),esk4_0),addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
inference(rw,[status(thm)],[211,116,theory(equality)]) ).
cnf(332,plain,
( multiplication(c(X1),X1) = zero
| ~ test(X1) ),
inference(er,[status(thm)],[93,theory(equality)]) ).
cnf(408,plain,
( multiplication(X1,c(X1)) = zero
| ~ test(X1) ),
inference(er,[status(thm)],[94,theory(equality)]) ).
cnf(419,negated_conjecture,
multiplication(c(esk5_0),esk5_0) = zero,
inference(spm,[status(thm)],[332,80,theory(equality)]) ).
cnf(431,negated_conjecture,
addition(multiplication(X1,esk5_0),zero) = multiplication(addition(X1,c(esk5_0)),esk5_0),
inference(spm,[status(thm)],[29,419,theory(equality)]) ).
cnf(437,negated_conjecture,
multiplication(X1,esk5_0) = multiplication(addition(X1,c(esk5_0)),esk5_0),
inference(rw,[status(thm)],[431,27,theory(equality)]) ).
cnf(499,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(er,[status(thm)],[95,theory(equality)]) ).
cnf(505,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[499,33,theory(equality)]) ).
cnf(600,negated_conjecture,
multiplication(esk5_0,c(esk5_0)) = zero,
inference(spm,[status(thm)],[408,80,theory(equality)]) ).
cnf(611,negated_conjecture,
multiplication(zero,X1) = multiplication(esk5_0,multiplication(c(esk5_0),X1)),
inference(spm,[status(thm)],[37,600,theory(equality)]) ).
cnf(617,negated_conjecture,
zero = multiplication(esk5_0,multiplication(c(esk5_0),X1)),
inference(rw,[status(thm)],[611,39,theory(equality)]) ).
cnf(861,negated_conjecture,
addition(multiplication(esk5_0,X1),zero) = multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2))),
inference(spm,[status(thm)],[74,617,theory(equality)]) ).
cnf(877,negated_conjecture,
multiplication(esk5_0,X1) = multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2))),
inference(rw,[status(thm)],[861,27,theory(equality)]) ).
cnf(956,negated_conjecture,
( addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))
| addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[300,120,theory(equality)]),31,theory(equality)]),33,theory(equality)]),116,theory(equality)]) ).
cnf(1743,negated_conjecture,
( multiplication(one,esk5_0) = multiplication(esk5_0,esk5_0)
| ~ test(esk5_0) ),
inference(spm,[status(thm)],[437,505,theory(equality)]) ).
cnf(1758,negated_conjecture,
( esk5_0 = multiplication(esk5_0,esk5_0)
| ~ test(esk5_0) ),
inference(rw,[status(thm)],[1743,25,theory(equality)]) ).
cnf(1759,negated_conjecture,
( esk5_0 = multiplication(esk5_0,esk5_0)
| $false ),
inference(rw,[status(thm)],[1758,80,theory(equality)]) ).
cnf(1760,negated_conjecture,
esk5_0 = multiplication(esk5_0,esk5_0),
inference(cn,[status(thm)],[1759,theory(equality)]) ).
cnf(1763,negated_conjecture,
multiplication(esk5_0,X1) = multiplication(esk5_0,multiplication(esk5_0,X1)),
inference(spm,[status(thm)],[37,1760,theory(equality)]) ).
cnf(28407,negated_conjecture,
( addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) != addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))
| addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[956,877,theory(equality)]),1763,theory(equality)]),33,theory(equality)]),145,theory(equality)]),35,theory(equality)]) ).
cnf(28408,negated_conjecture,
( $false
| addition(multiplication(esk5_0,esk2_0),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))))) != addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[28407,877,theory(equality)]),1763,theory(equality)]),33,theory(equality)]) ).
cnf(28409,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[28408,877,theory(equality)]),1763,theory(equality)]),33,theory(equality)]),145,theory(equality)]),35,theory(equality)]) ).
cnf(28410,negated_conjecture,
$false,
inference(cn,[status(thm)],[28409,theory(equality)]) ).
cnf(28411,negated_conjecture,
$false,
28410,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE027+4.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/tmpiC_Mc7/sel_KLE027+4.p_1 with time limit 29
% -prover status ResourceOut
% -running prover on /tmp/tmpiC_Mc7/sel_KLE027+4.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/tmpiC_Mc7/sel_KLE027+4.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/tmpiC_Mc7/sel_KLE027+4.p_4 with time limit 54
% -prover status Theorem
% Problem KLE027+4.p solved in phase 3.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE027+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE027+4.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
%
%------------------------------------------------------------------------------