TSTP Solution File: NUM510+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM510+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n033.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:21:36 EST 2018
% Result : Theorem 1.69s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 13
% Syntax : Number of formulae : 105 ( 23 unt; 0 def)
% Number of atoms : 426 ( 70 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 489 ( 168 ~; 193 |; 116 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn 53 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
~ ( equal(xk,sz00)
| equal(xk,sz10) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',m__2315) ).
fof(2,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',m_MulZero) ).
fof(5,axiom,
( aNaturalNumber0(xr)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(xk,sdtasdt0(xr,X1)) )
& doDivides0(xr,xk)
& ~ equal(xr,sz00)
& ~ equal(xr,sz10)
& ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xr,sdtasdt0(X1,X2)) )
| doDivides0(X1,xr) ) )
=> ( equal(X1,sz10)
| equal(X1,xr) ) )
& isPrime0(xr) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',m__2342) ).
fof(9,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( ~ equal(X1,sz00)
=> ! [X2,X3] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( equal(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
| equal(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) )
=> equal(X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',mMulCanc) ).
fof(10,axiom,
( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xr,X1)) )
& doDivides0(xr,xn) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',m__2487) ).
fof(19,axiom,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xp,X1),xn) )
| sdtlseqdt0(xp,xn) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',m__1870) ).
fof(22,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',m__1837) ).
fof(33,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ~ equal(X1,sz00)
=> sdtlseqdt0(X2,sdtasdt0(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',mMonMul2) ).
fof(34,axiom,
( aNaturalNumber0(sz10)
& ~ equal(sz10,sz00) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',mSortsC_01) ).
fof(35,conjecture,
( ~ ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& equal(sdtsldt0(xn,xr),xn) )
& ( ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr))) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(sdtsldt0(xn,xr),X1),xn) )
| sdtlseqdt0(sdtsldt0(xn,xr),xn) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',m__) ).
fof(47,axiom,
( aNaturalNumber0(xk)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,xk))
& equal(xk,sdtsldt0(sdtasdt0(xn,xm),xp)) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',m__2306) ).
fof(48,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',mMulComm) ).
fof(53,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(sdtasdt0(X1,sz10),X1)
& equal(X1,sdtasdt0(sz10,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1',m_MulUnit) ).
fof(54,negated_conjecture,
~ ( ~ ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& equal(sdtsldt0(xn,xr),xn) )
& ( ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr))) )
=> ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(sdtsldt0(xn,xr),X1),xn) )
| sdtlseqdt0(sdtsldt0(xn,xr),xn) ) ) ),
inference(assume_negation,[status(cth)],[35]) ).
fof(55,plain,
( ~ equal(xk,sz00)
& ~ equal(xk,sz10) ),
inference(fof_nnf,[status(thm)],[1]) ).
cnf(57,plain,
xk != sz00,
inference(split_conjunct,[status(thm)],[55]) ).
fof(58,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(59,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| ( equal(sdtasdt0(X2,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X2)) ) ),
inference(variable_rename,[status(thm)],[58]) ).
fof(60,plain,
! [X2] :
( ( equal(sdtasdt0(X2,sz00),sz00)
| ~ aNaturalNumber0(X2) )
& ( equal(sz00,sdtasdt0(sz00,X2))
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[59]) ).
cnf(61,plain,
( sz00 = sdtasdt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[60]) ).
fof(88,plain,
( aNaturalNumber0(xr)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(xk,sdtasdt0(xr,X1)) )
& doDivides0(xr,xk)
& ~ equal(xr,sz00)
& ~ equal(xr,sz10)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(xr,sdtasdt0(X1,X2)) )
& ~ doDivides0(X1,xr) )
| equal(X1,sz10)
| equal(X1,xr) )
& isPrime0(xr) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(89,plain,
( aNaturalNumber0(xr)
& ? [X3] :
( aNaturalNumber0(X3)
& equal(xk,sdtasdt0(xr,X3)) )
& doDivides0(xr,xk)
& ~ equal(xr,sz00)
& ~ equal(xr,sz10)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ( ! [X5] :
( ~ aNaturalNumber0(X5)
| ~ equal(xr,sdtasdt0(X4,X5)) )
& ~ doDivides0(X4,xr) )
| equal(X4,sz10)
| equal(X4,xr) )
& isPrime0(xr) ),
inference(variable_rename,[status(thm)],[88]) ).
fof(90,plain,
( aNaturalNumber0(xr)
& aNaturalNumber0(esk4_0)
& equal(xk,sdtasdt0(xr,esk4_0))
& doDivides0(xr,xk)
& ~ equal(xr,sz00)
& ~ equal(xr,sz10)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ( ! [X5] :
( ~ aNaturalNumber0(X5)
| ~ equal(xr,sdtasdt0(X4,X5)) )
& ~ doDivides0(X4,xr) )
| equal(X4,sz10)
| equal(X4,xr) )
& isPrime0(xr) ),
inference(skolemize,[status(esa)],[89]) ).
fof(91,plain,
! [X4,X5] :
( ( ( ( ~ aNaturalNumber0(X5)
| ~ equal(xr,sdtasdt0(X4,X5)) )
& ~ doDivides0(X4,xr) )
| ~ aNaturalNumber0(X4)
| equal(X4,sz10)
| equal(X4,xr) )
& aNaturalNumber0(xr)
& aNaturalNumber0(esk4_0)
& equal(xk,sdtasdt0(xr,esk4_0))
& doDivides0(xr,xk)
& ~ equal(xr,sz00)
& ~ equal(xr,sz10)
& isPrime0(xr) ),
inference(shift_quantors,[status(thm)],[90]) ).
fof(92,plain,
! [X4,X5] :
( ( ~ aNaturalNumber0(X5)
| ~ equal(xr,sdtasdt0(X4,X5))
| ~ aNaturalNumber0(X4)
| equal(X4,sz10)
| equal(X4,xr) )
& ( ~ doDivides0(X4,xr)
| ~ aNaturalNumber0(X4)
| equal(X4,sz10)
| equal(X4,xr) )
& aNaturalNumber0(xr)
& aNaturalNumber0(esk4_0)
& equal(xk,sdtasdt0(xr,esk4_0))
& doDivides0(xr,xk)
& ~ equal(xr,sz00)
& ~ equal(xr,sz10)
& isPrime0(xr) ),
inference(distribute,[status(thm)],[91]) ).
cnf(94,plain,
xr != sz10,
inference(split_conjunct,[status(thm)],[92]) ).
cnf(95,plain,
xr != sz00,
inference(split_conjunct,[status(thm)],[92]) ).
cnf(99,plain,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[92]) ).
fof(111,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| equal(X1,sz00)
| ! [X2,X3] :
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ( ~ equal(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& ~ equal(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) )
| equal(X2,X3) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(112,plain,
! [X4] :
( ~ aNaturalNumber0(X4)
| equal(X4,sz00)
| ! [X5,X6] :
( ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ( ~ equal(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
& ~ equal(sdtasdt0(X5,X4),sdtasdt0(X6,X4)) )
| equal(X5,X6) ) ),
inference(variable_rename,[status(thm)],[111]) ).
fof(113,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ( ~ equal(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
& ~ equal(sdtasdt0(X5,X4),sdtasdt0(X6,X4)) )
| equal(X5,X6)
| equal(X4,sz00)
| ~ aNaturalNumber0(X4) ),
inference(shift_quantors,[status(thm)],[112]) ).
fof(114,plain,
! [X4,X5,X6] :
( ( ~ equal(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
| equal(X5,X6)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| equal(X4,sz00)
| ~ aNaturalNumber0(X4) )
& ( ~ equal(sdtasdt0(X5,X4),sdtasdt0(X6,X4))
| equal(X5,X6)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| equal(X4,sz00)
| ~ aNaturalNumber0(X4) ) ),
inference(distribute,[status(thm)],[113]) ).
cnf(115,plain,
( X1 = sz00
| X3 = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| sdtasdt0(X3,X1) != sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[114]) ).
cnf(116,plain,
( X1 = sz00
| X3 = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| sdtasdt0(X1,X3) != sdtasdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[114]) ).
fof(117,plain,
( ? [X2] :
( aNaturalNumber0(X2)
& equal(xn,sdtasdt0(xr,X2)) )
& doDivides0(xr,xn) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(118,plain,
( aNaturalNumber0(esk5_0)
& equal(xn,sdtasdt0(xr,esk5_0))
& doDivides0(xr,xn) ),
inference(skolemize,[status(esa)],[117]) ).
cnf(120,plain,
xn = sdtasdt0(xr,esk5_0),
inference(split_conjunct,[status(thm)],[118]) ).
cnf(121,plain,
aNaturalNumber0(esk5_0),
inference(split_conjunct,[status(thm)],[118]) ).
fof(282,plain,
( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtpldt0(xp,X1),xn) )
& ~ sdtlseqdt0(xp,xn) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(283,plain,
( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xp,X2),xn) )
& ~ sdtlseqdt0(xp,xn) ),
inference(variable_rename,[status(thm)],[282]) ).
fof(284,plain,
! [X2] :
( ( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xp,X2),xn) )
& ~ sdtlseqdt0(xp,xn) ),
inference(shift_quantors,[status(thm)],[283]) ).
cnf(285,plain,
~ sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[284]) ).
cnf(300,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(301,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(302,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[22]) ).
fof(356,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(X1,sz00)
| sdtlseqdt0(X2,sdtasdt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[33]) ).
fof(357,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| equal(X3,sz00)
| sdtlseqdt0(X4,sdtasdt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[356]) ).
cnf(358,plain,
( sdtlseqdt0(X1,sdtasdt0(X1,X2))
| X2 = sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[357]) ).
cnf(360,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[34]) ).
fof(361,negated_conjecture,
( ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& equal(sdtsldt0(xn,xr),xn) )
| ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtpldt0(sdtsldt0(xn,xr),X1),xn) )
& ~ sdtlseqdt0(sdtsldt0(xn,xr),xn) ) ),
inference(fof_nnf,[status(thm)],[54]) ).
fof(362,negated_conjecture,
( ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& equal(sdtsldt0(xn,xr),xn) )
| ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(sdtsldt0(xn,xr),X2),xn) )
& ~ sdtlseqdt0(sdtsldt0(xn,xr),xn) ) ),
inference(variable_rename,[status(thm)],[361]) ).
fof(363,negated_conjecture,
! [X2] :
( ( ( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(sdtsldt0(xn,xr),X2),xn) )
& ~ sdtlseqdt0(sdtsldt0(xn,xr),xn)
& aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr))) )
| ( aNaturalNumber0(sdtsldt0(xn,xr))
& equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
& equal(sdtsldt0(xn,xr),xn) ) ),
inference(shift_quantors,[status(thm)],[362]) ).
fof(364,negated_conjecture,
! [X2] :
( ( aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(sdtsldt0(xn,xr),X2),xn) )
& ( equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
| ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(sdtsldt0(xn,xr),X2),xn) )
& ( equal(sdtsldt0(xn,xr),xn)
| ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(sdtsldt0(xn,xr),X2),xn) )
& ( aNaturalNumber0(sdtsldt0(xn,xr))
| ~ sdtlseqdt0(sdtsldt0(xn,xr),xn) )
& ( equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
| ~ sdtlseqdt0(sdtsldt0(xn,xr),xn) )
& ( equal(sdtsldt0(xn,xr),xn)
| ~ sdtlseqdt0(sdtsldt0(xn,xr),xn) )
& ( aNaturalNumber0(sdtsldt0(xn,xr))
| aNaturalNumber0(sdtsldt0(xn,xr)) )
& ( equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
| aNaturalNumber0(sdtsldt0(xn,xr)) )
& ( equal(sdtsldt0(xn,xr),xn)
| aNaturalNumber0(sdtsldt0(xn,xr)) )
& ( aNaturalNumber0(sdtsldt0(xn,xr))
| equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr))) )
& ( equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr)))
| equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr))) )
& ( equal(sdtsldt0(xn,xr),xn)
| equal(xn,sdtasdt0(xr,sdtsldt0(xn,xr))) ) ),
inference(distribute,[status(thm)],[363]) ).
cnf(366,negated_conjecture,
( xn = sdtasdt0(xr,sdtsldt0(xn,xr))
| xn = sdtasdt0(xr,sdtsldt0(xn,xr)) ),
inference(split_conjunct,[status(thm)],[364]) ).
cnf(370,negated_conjecture,
( aNaturalNumber0(sdtsldt0(xn,xr))
| aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(split_conjunct,[status(thm)],[364]) ).
cnf(371,negated_conjecture,
( sdtsldt0(xn,xr) = xn
| ~ sdtlseqdt0(sdtsldt0(xn,xr),xn) ),
inference(split_conjunct,[status(thm)],[364]) ).
cnf(430,plain,
sdtasdt0(xn,xm) = sdtasdt0(xp,xk),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(431,plain,
aNaturalNumber0(xk),
inference(split_conjunct,[status(thm)],[47]) ).
fof(432,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(sdtasdt0(X1,X2),sdtasdt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(433,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| equal(sdtasdt0(X3,X4),sdtasdt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[432]) ).
cnf(434,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[433]) ).
fof(456,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( equal(sdtasdt0(X1,sz10),X1)
& equal(X1,sdtasdt0(sz10,X1)) ) ),
inference(fof_nnf,[status(thm)],[53]) ).
fof(457,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| ( equal(sdtasdt0(X2,sz10),X2)
& equal(X2,sdtasdt0(sz10,X2)) ) ),
inference(variable_rename,[status(thm)],[456]) ).
fof(458,plain,
! [X2] :
( ( equal(sdtasdt0(X2,sz10),X2)
| ~ aNaturalNumber0(X2) )
& ( equal(X2,sdtasdt0(sz10,X2))
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[457]) ).
cnf(459,plain,
( X1 = sdtasdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[458]) ).
cnf(669,plain,
( sz00 = xk
| sdtlseqdt0(xp,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xk)
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[358,430,theory(equality)]) ).
cnf(676,plain,
( sz00 = X1
| sdtlseqdt0(X2,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[358,434,theory(equality)]) ).
cnf(692,plain,
( sz00 = xk
| sdtlseqdt0(xp,sdtasdt0(xn,xm))
| $false
| ~ aNaturalNumber0(xp) ),
inference(rw,[status(thm)],[669,431,theory(equality)]) ).
cnf(693,plain,
( sz00 = xk
| sdtlseqdt0(xp,sdtasdt0(xn,xm))
| $false
| $false ),
inference(rw,[status(thm)],[692,300,theory(equality)]) ).
cnf(694,plain,
( sz00 = xk
| sdtlseqdt0(xp,sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[693,theory(equality)]) ).
cnf(695,plain,
sdtlseqdt0(xp,sdtasdt0(xn,xm)),
inference(sr,[status(thm)],[694,57,theory(equality)]) ).
cnf(1375,plain,
( sz00 = X1
| sz10 = X2
| X1 != sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(sz10)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[115,459,theory(equality)]) ).
cnf(1439,plain,
( sz00 = X1
| sz10 = X2
| X1 != sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| $false
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[1375,360,theory(equality)]) ).
cnf(1440,plain,
( sz00 = X1
| sz10 = X2
| X1 != sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[1439,theory(equality)]) ).
cnf(1452,plain,
( sz00 = xr
| esk5_0 = X1
| xn != sdtasdt0(xr,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(esk5_0)
| ~ aNaturalNumber0(xr) ),
inference(spm,[status(thm)],[116,120,theory(equality)]) ).
cnf(1482,plain,
( sz00 = xr
| esk5_0 = X1
| xn != sdtasdt0(xr,X1)
| ~ aNaturalNumber0(X1)
| $false
| ~ aNaturalNumber0(xr) ),
inference(rw,[status(thm)],[1452,121,theory(equality)]) ).
cnf(1483,plain,
( sz00 = xr
| esk5_0 = X1
| xn != sdtasdt0(xr,X1)
| ~ aNaturalNumber0(X1)
| $false
| $false ),
inference(rw,[status(thm)],[1482,99,theory(equality)]) ).
cnf(1484,plain,
( sz00 = xr
| esk5_0 = X1
| xn != sdtasdt0(xr,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[1483,theory(equality)]) ).
cnf(1485,plain,
( esk5_0 = X1
| sdtasdt0(xr,X1) != xn
| ~ aNaturalNumber0(X1) ),
inference(sr,[status(thm)],[1484,95,theory(equality)]) ).
cnf(13296,negated_conjecture,
( esk5_0 = sdtsldt0(xn,xr)
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(spm,[status(thm)],[1485,366,theory(equality)]) ).
cnf(13308,negated_conjecture,
( esk5_0 = sdtsldt0(xn,xr)
| $false ),
inference(rw,[status(thm)],[13296,370,theory(equality)]) ).
cnf(13309,negated_conjecture,
esk5_0 = sdtsldt0(xn,xr),
inference(cn,[status(thm)],[13308,theory(equality)]) ).
cnf(13326,negated_conjecture,
sdtasdt0(xr,esk5_0) = xn,
inference(rw,[status(thm)],[366,13309,theory(equality)]) ).
cnf(13335,negated_conjecture,
( esk5_0 = xn
| ~ sdtlseqdt0(sdtsldt0(xn,xr),xn) ),
inference(rw,[status(thm)],[371,13309,theory(equality)]) ).
cnf(13336,negated_conjecture,
( esk5_0 = xn
| ~ sdtlseqdt0(esk5_0,xn) ),
inference(rw,[status(thm)],[13335,13309,theory(equality)]) ).
cnf(17238,negated_conjecture,
( sz00 = xr
| sdtlseqdt0(esk5_0,xn)
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(esk5_0) ),
inference(spm,[status(thm)],[676,13326,theory(equality)]) ).
cnf(17270,negated_conjecture,
( sz00 = xr
| sdtlseqdt0(esk5_0,xn)
| $false
| ~ aNaturalNumber0(esk5_0) ),
inference(rw,[status(thm)],[17238,99,theory(equality)]) ).
cnf(17271,negated_conjecture,
( sz00 = xr
| sdtlseqdt0(esk5_0,xn)
| $false
| $false ),
inference(rw,[status(thm)],[17270,121,theory(equality)]) ).
cnf(17272,negated_conjecture,
( sz00 = xr
| sdtlseqdt0(esk5_0,xn) ),
inference(cn,[status(thm)],[17271,theory(equality)]) ).
cnf(17273,negated_conjecture,
sdtlseqdt0(esk5_0,xn),
inference(sr,[status(thm)],[17272,95,theory(equality)]) ).
cnf(17304,negated_conjecture,
( esk5_0 = xn
| $false ),
inference(rw,[status(thm)],[13336,17273,theory(equality)]) ).
cnf(17305,negated_conjecture,
esk5_0 = xn,
inference(cn,[status(thm)],[17304,theory(equality)]) ).
cnf(17338,negated_conjecture,
sdtasdt0(xr,xn) = xn,
inference(rw,[status(thm)],[13326,17305,theory(equality)]) ).
cnf(79577,negated_conjecture,
( sz10 = xr
| sz00 = xn
| ~ aNaturalNumber0(xr)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[1440,17338,theory(equality)]) ).
cnf(79642,negated_conjecture,
( sz10 = xr
| sz00 = xn
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[79577,99,theory(equality)]) ).
cnf(79643,negated_conjecture,
( sz10 = xr
| sz00 = xn
| $false
| $false ),
inference(rw,[status(thm)],[79642,302,theory(equality)]) ).
cnf(79644,negated_conjecture,
( sz10 = xr
| sz00 = xn ),
inference(cn,[status(thm)],[79643,theory(equality)]) ).
cnf(79645,negated_conjecture,
sz00 = xn,
inference(sr,[status(thm)],[79644,94,theory(equality)]) ).
cnf(80173,plain,
( sdtasdt0(xn,X1) = sz00
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[61,79645,theory(equality)]) ).
cnf(80174,plain,
( sdtasdt0(xn,X1) = xn
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[80173,79645,theory(equality)]) ).
cnf(83504,plain,
( sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[695,80174,theory(equality)]) ).
cnf(83660,plain,
( sdtlseqdt0(xp,xn)
| $false ),
inference(rw,[status(thm)],[83504,301,theory(equality)]) ).
cnf(83661,plain,
sdtlseqdt0(xp,xn),
inference(cn,[status(thm)],[83660,theory(equality)]) ).
cnf(83662,plain,
$false,
inference(sr,[status(thm)],[83661,285,theory(equality)]) ).
cnf(83663,plain,
$false,
83662,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM510+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n033.star.cs.uiowa.edu
% 0.03/0.23 % Model : x86_64 x86_64
% 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23 % Memory : 32218.625MB
% 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Fri Jan 5 06:25:30 CST 2018
% 0.03/0.23 % CPUTime :
% 0.03/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.28 --creating new selector for []
% 1.69/1.96 -running prover on /export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1 with time limit 29
% 1.69/1.96 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpbZMQ0L/sel_theBenchmark.p_1']
% 1.69/1.96 -prover status Theorem
% 1.69/1.96 Problem theBenchmark.p solved in phase 0.
% 1.69/1.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.69/1.96 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.69/1.96 Solved 1 out of 1.
% 1.69/1.96 # Problem is unsatisfiable (or provable), constructing proof object
% 1.69/1.96 # SZS status Theorem
% 1.69/1.96 # SZS output start CNFRefutation.
% See solution above
% 1.69/1.96 # SZS output end CNFRefutation
%------------------------------------------------------------------------------