TSTP Solution File: NUM498+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM498+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n123.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:33 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 13
% Syntax : Number of formulae : 117 ( 25 unt; 0 def)
% Number of atoms : 493 ( 88 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 606 ( 230 ~; 287 |; 74 &)
% ( 3 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn 64 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',m_MulZero) ).
fof(2,axiom,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',m__1860) ).
fof(5,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( equal(sdtasdt0(X1,X2),sz00)
=> ( equal(X1,sz00)
| equal(X2,sz00) ) ) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',mZeroMul) ).
fof(9,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',mDefDiv) ).
fof(16,axiom,
( ~ equal(xn,xp)
& sdtlseqdt0(xn,xp)
& ~ equal(xm,xp)
& sdtlseqdt0(xm,xp) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',m__2287) ).
fof(17,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',m__1837) ).
fof(25,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( ~ equal(X1,sz00)
& doDivides0(X1,X2) )
=> ! [X3] :
( equal(X3,sdtsldt0(X2,X1))
<=> ( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',mDefQuot) ).
fof(29,conjecture,
( ( equal(xk,sz00)
| equal(xk,sz10) )
=> ( doDivides0(xp,xn)
| doDivides0(xp,xm) ) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',m__) ).
fof(34,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',mSortsB_02) ).
fof(35,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( ~ equal(X1,sz00)
& ~ equal(X1,sz10)
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( equal(X2,sz10)
| equal(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',mDefPrime) ).
fof(36,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',mSortsC) ).
fof(41,axiom,
equal(xk,sdtsldt0(sdtasdt0(xn,xm),xp)),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',m__2306) ).
fof(46,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(sdtasdt0(X1,sz10),X1)
& equal(X1,sdtasdt0(sz10,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1',m_MulUnit) ).
fof(47,negated_conjecture,
~ ( ( equal(xk,sz00)
| equal(xk,sz10) )
=> ( doDivides0(xp,xn)
| doDivides0(xp,xm) ) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(50,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( equal(sdtasdt0(X1,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X1)) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(51,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| ( equal(sdtasdt0(X2,sz00),sz00)
& equal(sz00,sdtasdt0(sz00,X2)) ) ),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,plain,
! [X2] :
( ( equal(sdtasdt0(X2,sz00),sz00)
| ~ aNaturalNumber0(X2) )
& ( equal(sz00,sdtasdt0(sz00,X2))
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[51]) ).
cnf(54,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(55,plain,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[2]) ).
cnf(56,plain,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[2]) ).
fof(63,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ equal(sdtasdt0(X1,X2),sz00)
| equal(X1,sz00)
| equal(X2,sz00) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(64,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| ~ equal(sdtasdt0(X3,X4),sz00)
| equal(X3,sz00)
| equal(X4,sz00) ),
inference(variable_rename,[status(thm)],[63]) ).
cnf(65,plain,
( X1 = sz00
| X2 = sz00
| sdtasdt0(X2,X1) != sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[64]) ).
fof(80,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ( ( ~ doDivides0(X1,X2)
| ? [X3] :
( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) )
& ( ! [X3] :
( ~ aNaturalNumber0(X3)
| ~ equal(X2,sdtasdt0(X1,X3)) )
| doDivides0(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(81,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ doDivides0(X4,X5)
| ? [X6] :
( aNaturalNumber0(X6)
& equal(X5,sdtasdt0(X4,X6)) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7)) )
| doDivides0(X4,X5) ) ) ),
inference(variable_rename,[status(thm)],[80]) ).
fof(82,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ doDivides0(X4,X5)
| ( aNaturalNumber0(esk1_2(X4,X5))
& equal(X5,sdtasdt0(X4,esk1_2(X4,X5))) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7)) )
| doDivides0(X4,X5) ) ) ),
inference(skolemize,[status(esa)],[81]) ).
fof(83,plain,
! [X4,X5,X7] :
( ( ( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7))
| doDivides0(X4,X5) )
& ( ~ doDivides0(X4,X5)
| ( aNaturalNumber0(esk1_2(X4,X5))
& equal(X5,sdtasdt0(X4,esk1_2(X4,X5))) ) ) )
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[82]) ).
fof(84,plain,
! [X4,X5,X7] :
( ( ~ aNaturalNumber0(X7)
| ~ equal(X5,sdtasdt0(X4,X7))
| doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( aNaturalNumber0(esk1_2(X4,X5))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(X5,sdtasdt0(X4,esk1_2(X4,X5)))
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[83]) ).
cnf(87,plain,
( doDivides0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| X1 != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[84]) ).
cnf(109,plain,
xn != xp,
inference(split_conjunct,[status(thm)],[16]) ).
cnf(110,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(111,plain,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(112,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[17]) ).
fof(148,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(X1,sz00)
| ~ doDivides0(X1,X2)
| ! [X3] :
( ( ~ equal(X3,sdtsldt0(X2,X1))
| ( aNaturalNumber0(X3)
& equal(X2,sdtasdt0(X1,X3)) ) )
& ( ~ aNaturalNumber0(X3)
| ~ equal(X2,sdtasdt0(X1,X3))
| equal(X3,sdtsldt0(X2,X1)) ) ) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(149,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ! [X6] :
( ( ~ equal(X6,sdtsldt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(X5,sdtasdt0(X4,X6)) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(X5,sdtasdt0(X4,X6))
| equal(X6,sdtsldt0(X5,X4)) ) ) ),
inference(variable_rename,[status(thm)],[148]) ).
fof(150,plain,
! [X4,X5,X6] :
( ( ( ~ equal(X6,sdtsldt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(X5,sdtasdt0(X4,X6)) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(X5,sdtasdt0(X4,X6))
| equal(X6,sdtsldt0(X5,X4)) ) )
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[149]) ).
fof(151,plain,
! [X4,X5,X6] :
( ( aNaturalNumber0(X6)
| ~ equal(X6,sdtsldt0(X5,X4))
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(X5,sdtasdt0(X4,X6))
| ~ equal(X6,sdtsldt0(X5,X4))
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(X5,sdtasdt0(X4,X6))
| equal(X6,sdtsldt0(X5,X4))
| equal(X4,sz00)
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[150]) ).
cnf(153,plain,
( X2 = sz00
| X1 = sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[151]) ).
fof(165,negated_conjecture,
( ( equal(xk,sz00)
| equal(xk,sz10) )
& ~ doDivides0(xp,xn)
& ~ doDivides0(xp,xm) ),
inference(fof_nnf,[status(thm)],[47]) ).
cnf(166,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[165]) ).
cnf(167,negated_conjecture,
~ doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[165]) ).
cnf(168,negated_conjecture,
( xk = sz10
| xk = sz00 ),
inference(split_conjunct,[status(thm)],[165]) ).
fof(187,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(188,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[187]) ).
cnf(189,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[188]) ).
fof(190,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( ( ~ isPrime0(X1)
| ( ~ equal(X1,sz00)
& ~ equal(X1,sz10)
& ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| equal(X2,sz10)
| equal(X2,X1) ) ) )
& ( equal(X1,sz00)
| equal(X1,sz10)
| ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& ~ equal(X2,sz10)
& ~ equal(X2,X1) )
| isPrime0(X1) ) ) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(191,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| ( ( ~ isPrime0(X3)
| ( ~ equal(X3,sz00)
& ~ equal(X3,sz10)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| equal(X4,sz10)
| equal(X4,X3) ) ) )
& ( equal(X3,sz00)
| equal(X3,sz10)
| ? [X5] :
( aNaturalNumber0(X5)
& doDivides0(X5,X3)
& ~ equal(X5,sz10)
& ~ equal(X5,X3) )
| isPrime0(X3) ) ) ),
inference(variable_rename,[status(thm)],[190]) ).
fof(192,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| ( ( ~ isPrime0(X3)
| ( ~ equal(X3,sz00)
& ~ equal(X3,sz10)
& ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| equal(X4,sz10)
| equal(X4,X3) ) ) )
& ( equal(X3,sz00)
| equal(X3,sz10)
| ( aNaturalNumber0(esk3_1(X3))
& doDivides0(esk3_1(X3),X3)
& ~ equal(esk3_1(X3),sz10)
& ~ equal(esk3_1(X3),X3) )
| isPrime0(X3) ) ) ),
inference(skolemize,[status(esa)],[191]) ).
fof(193,plain,
! [X3,X4] :
( ( ( ( ( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| equal(X4,sz10)
| equal(X4,X3) )
& ~ equal(X3,sz00)
& ~ equal(X3,sz10) )
| ~ isPrime0(X3) )
& ( equal(X3,sz00)
| equal(X3,sz10)
| ( aNaturalNumber0(esk3_1(X3))
& doDivides0(esk3_1(X3),X3)
& ~ equal(esk3_1(X3),sz10)
& ~ equal(esk3_1(X3),X3) )
| isPrime0(X3) ) )
| ~ aNaturalNumber0(X3) ),
inference(shift_quantors,[status(thm)],[192]) ).
fof(194,plain,
! [X3,X4] :
( ( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| equal(X4,sz10)
| equal(X4,X3)
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(X3,sz00)
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(X3,sz10)
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( aNaturalNumber0(esk3_1(X3))
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( doDivides0(esk3_1(X3),X3)
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(esk3_1(X3),sz10)
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(esk3_1(X3),X3)
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) ) ),
inference(distribute,[status(thm)],[193]) ).
cnf(200,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[194]) ).
cnf(201,plain,
( X2 = X1
| X2 = sz10
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| ~ doDivides0(X2,X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[194]) ).
cnf(202,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(221,plain,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[41]) ).
fof(235,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( equal(sdtasdt0(X1,sz10),X1)
& equal(X1,sdtasdt0(sz10,X1)) ) ),
inference(fof_nnf,[status(thm)],[46]) ).
fof(236,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| ( equal(sdtasdt0(X2,sz10),X2)
& equal(X2,sdtasdt0(sz10,X2)) ) ),
inference(variable_rename,[status(thm)],[235]) ).
fof(237,plain,
! [X2] :
( ( equal(sdtasdt0(X2,sz10),X2)
| ~ aNaturalNumber0(X2) )
& ( equal(X2,sdtasdt0(sz10,X2))
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[236]) ).
cnf(238,plain,
( X1 = sdtasdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[237]) ).
cnf(239,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[237]) ).
cnf(241,plain,
( sz00 != xp
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[200,56,theory(equality)]) ).
cnf(242,plain,
( sz00 != xp
| $false ),
inference(rw,[status(thm)],[241,110,theory(equality)]) ).
cnf(243,plain,
sz00 != xp,
inference(cn,[status(thm)],[242,theory(equality)]) ).
cnf(380,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(er,[status(thm)],[87,theory(equality)]) ).
cnf(381,plain,
( doDivides0(X1,X2)
| sz00 != X2
| ~ aNaturalNumber0(sz00)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[87,54,theory(equality)]) ).
cnf(387,plain,
( doDivides0(X1,X2)
| sz00 != X2
| $false
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(rw,[status(thm)],[381,202,theory(equality)]) ).
cnf(388,plain,
( doDivides0(X1,X2)
| sz00 != X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cn,[status(thm)],[387,theory(equality)]) ).
cnf(509,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| sz00 = X1
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[153,theory(equality)]) ).
cnf(1135,negated_conjecture,
( sz00 != xn
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[167,388,theory(equality)]) ).
cnf(1136,negated_conjecture,
( sz00 != xm
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[166,388,theory(equality)]) ).
cnf(1141,negated_conjecture,
( sz00 != xn
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[1135,110,theory(equality)]) ).
cnf(1142,negated_conjecture,
( sz00 != xn
| $false
| $false ),
inference(rw,[status(thm)],[1141,112,theory(equality)]) ).
cnf(1143,negated_conjecture,
sz00 != xn,
inference(cn,[status(thm)],[1142,theory(equality)]) ).
cnf(1144,negated_conjecture,
( sz00 != xm
| $false
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[1136,110,theory(equality)]) ).
cnf(1145,negated_conjecture,
( sz00 != xm
| $false
| $false ),
inference(rw,[status(thm)],[1144,111,theory(equality)]) ).
cnf(1146,negated_conjecture,
sz00 != xm,
inference(cn,[status(thm)],[1145,theory(equality)]) ).
cnf(2917,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[380,189]) ).
cnf(5567,plain,
( sdtasdt0(xp,xk) = sdtasdt0(xn,xm)
| sz00 = xp
| ~ doDivides0(xp,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(spm,[status(thm)],[509,221,theory(equality)]) ).
cnf(5609,plain,
( sdtasdt0(xp,xk) = sdtasdt0(xn,xm)
| sz00 = xp
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(rw,[status(thm)],[5567,55,theory(equality)]) ).
cnf(5610,plain,
( sdtasdt0(xp,xk) = sdtasdt0(xn,xm)
| sz00 = xp
| $false
| $false
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(rw,[status(thm)],[5609,110,theory(equality)]) ).
cnf(5611,plain,
( sdtasdt0(xp,xk) = sdtasdt0(xn,xm)
| sz00 = xp
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[5610,theory(equality)]) ).
cnf(5612,plain,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(sr,[status(thm)],[5611,243,theory(equality)]) ).
cnf(5654,plain,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[5612,189,theory(equality)]) ).
cnf(5658,plain,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[5654,111,theory(equality)]) ).
cnf(5659,plain,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| $false
| $false ),
inference(rw,[status(thm)],[5658,112,theory(equality)]) ).
cnf(5660,plain,
sdtasdt0(xn,xm) = sdtasdt0(xp,xk),
inference(cn,[status(thm)],[5659,theory(equality)]) ).
cnf(5662,plain,
( sz00 = xm
| sz00 = xn
| sdtasdt0(xp,xk) != sz00
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[65,5660,theory(equality)]) ).
cnf(5682,plain,
( doDivides0(xn,sdtasdt0(xp,xk))
| ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[2917,5660,theory(equality)]) ).
cnf(5687,plain,
doDivides0(xp,sdtasdt0(xp,xk)),
inference(rw,[status(thm)],[55,5660,theory(equality)]) ).
cnf(5703,plain,
( sz00 = xm
| sz00 = xn
| sdtasdt0(xp,xk) != sz00
| $false
| ~ aNaturalNumber0(xm) ),
inference(rw,[status(thm)],[5662,112,theory(equality)]) ).
cnf(5704,plain,
( sz00 = xm
| sz00 = xn
| sdtasdt0(xp,xk) != sz00
| $false
| $false ),
inference(rw,[status(thm)],[5703,111,theory(equality)]) ).
cnf(5705,plain,
( sz00 = xm
| sz00 = xn
| sdtasdt0(xp,xk) != sz00 ),
inference(cn,[status(thm)],[5704,theory(equality)]) ).
cnf(5706,plain,
( xn = sz00
| sdtasdt0(xp,xk) != sz00 ),
inference(sr,[status(thm)],[5705,1146,theory(equality)]) ).
cnf(5707,plain,
sdtasdt0(xp,xk) != sz00,
inference(sr,[status(thm)],[5706,1143,theory(equality)]) ).
cnf(5777,plain,
( doDivides0(xn,sdtasdt0(xp,xk))
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[5682,111,theory(equality)]) ).
cnf(5778,plain,
( doDivides0(xn,sdtasdt0(xp,xk))
| $false
| $false ),
inference(rw,[status(thm)],[5777,112,theory(equality)]) ).
cnf(5779,plain,
doDivides0(xn,sdtasdt0(xp,xk)),
inference(cn,[status(thm)],[5778,theory(equality)]) ).
cnf(5807,negated_conjecture,
( doDivides0(xn,sdtasdt0(xp,sz10))
| xk = sz00 ),
inference(spm,[status(thm)],[5779,168,theory(equality)]) ).
cnf(5946,negated_conjecture,
( xk = sz00
| doDivides0(xn,xp)
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[5807,239,theory(equality)]) ).
cnf(5954,negated_conjecture,
( xk = sz00
| doDivides0(xn,xp)
| $false ),
inference(rw,[status(thm)],[5946,110,theory(equality)]) ).
cnf(5955,negated_conjecture,
( xk = sz00
| doDivides0(xn,xp) ),
inference(cn,[status(thm)],[5954,theory(equality)]) ).
cnf(5973,negated_conjecture,
( sz10 = xn
| xp = xn
| xk = sz00
| ~ isPrime0(xp)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[201,5955,theory(equality)]) ).
cnf(5981,negated_conjecture,
( sz10 = xn
| xp = xn
| xk = sz00
| $false
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xp) ),
inference(rw,[status(thm)],[5973,56,theory(equality)]) ).
cnf(5982,negated_conjecture,
( sz10 = xn
| xp = xn
| xk = sz00
| $false
| $false
| ~ aNaturalNumber0(xp) ),
inference(rw,[status(thm)],[5981,112,theory(equality)]) ).
cnf(5983,negated_conjecture,
( sz10 = xn
| xp = xn
| xk = sz00
| $false
| $false
| $false ),
inference(rw,[status(thm)],[5982,110,theory(equality)]) ).
cnf(5984,negated_conjecture,
( sz10 = xn
| xp = xn
| xk = sz00 ),
inference(cn,[status(thm)],[5983,theory(equality)]) ).
cnf(5985,negated_conjecture,
( xn = sz10
| xk = sz00 ),
inference(sr,[status(thm)],[5984,109,theory(equality)]) ).
cnf(6002,negated_conjecture,
( xn = sz10
| sdtasdt0(xp,sz00) != sz00 ),
inference(spm,[status(thm)],[5707,5985,theory(equality)]) ).
cnf(6175,negated_conjecture,
( xn = sz10
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[6002,54,theory(equality)]) ).
cnf(6178,negated_conjecture,
( xn = sz10
| $false ),
inference(rw,[status(thm)],[6175,110,theory(equality)]) ).
cnf(6179,negated_conjecture,
xn = sz10,
inference(cn,[status(thm)],[6178,theory(equality)]) ).
cnf(6187,plain,
sdtasdt0(sz10,xm) = sdtasdt0(xp,xk),
inference(rw,[status(thm)],[5660,6179,theory(equality)]) ).
cnf(6414,plain,
doDivides0(xp,sdtasdt0(sz10,xm)),
inference(rw,[status(thm)],[5687,6187,theory(equality)]) ).
cnf(6685,plain,
( doDivides0(xp,xm)
| ~ aNaturalNumber0(xm) ),
inference(spm,[status(thm)],[6414,238,theory(equality)]) ).
cnf(6691,plain,
( doDivides0(xp,xm)
| $false ),
inference(rw,[status(thm)],[6685,111,theory(equality)]) ).
cnf(6692,plain,
doDivides0(xp,xm),
inference(cn,[status(thm)],[6691,theory(equality)]) ).
cnf(6693,plain,
$false,
inference(sr,[status(thm)],[6692,166,theory(equality)]) ).
cnf(6694,plain,
$false,
6693,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM498+1 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n123.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 05:55:45 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 0.06/0.46 -running prover on /export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.46 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmp1K3w2z/sel_theBenchmark.p_1']
% 0.06/0.46 -prover status Theorem
% 0.06/0.46 Problem theBenchmark.p solved in phase 0.
% 0.06/0.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.46 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.46 Solved 1 out of 1.
% 0.06/0.46 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.46 # SZS status Theorem
% 0.06/0.46 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.47 # SZS output end CNFRefutation
%------------------------------------------------------------------------------