%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM487+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n111.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:31 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 11
% Syntax : Number of formulae : 93 ( 18 unt; 0 def)
% Number of atoms : 385 ( 42 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 483 ( 191 ~; 197 |; 86 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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; 8 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 63 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
( ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& ! [X1] :
( ( aNaturalNumber0(X1)
& ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xp,sdtasdt0(X1,X2)) )
| doDivides0(X1,xp) ) )
=> ( equal(X1,sz10)
| equal(X1,xp) ) )
& isPrime0(xp)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,X1)) )
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',m__1860) ).
fof(3,axiom,
( aNaturalNumber0(xr)
& equal(sdtpldt0(xp,xr),xn)
& equal(xr,sdtmndt0(xn,xp)) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',m__1883) ).
fof(5,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> equal(sdtpldt0(X1,X2),sdtpldt0(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',mAddComm) ).
fof(13,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X3) )
=> sdtlseqdt0(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',mLETran) ).
fof(15,axiom,
( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xp,X1),xn) )
& sdtlseqdt0(xp,xn) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',m__1870) ).
fof(17,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',m__1837) ).
fof(22,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',mDefLE) ).
fof(29,conjecture,
( ~ equal(xr,xn)
& ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xr,X1),xn) )
| sdtlseqdt0(xr,xn) ) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',m__) ).
fof(36,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',mSortsC) ).
fof(39,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( equal(sdtpldt0(X1,X2),sdtpldt0(X1,X3))
| equal(sdtpldt0(X2,X1),sdtpldt0(X3,X1)) )
=> equal(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',mAddCanc) ).
fof(43,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( equal(sdtpldt0(X1,sz00),X1)
& equal(X1,sdtpldt0(sz00,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1',m_AddZero) ).
fof(45,negated_conjecture,
~ ( ~ equal(xr,xn)
& ( ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtpldt0(xr,X1),xn) )
| sdtlseqdt0(xr,xn) ) ),
inference(assume_negation,[status(cth)],[29]) ).
fof(51,plain,
( ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(xp,sdtasdt0(X1,X2)) )
& ~ doDivides0(X1,xp) )
| equal(X1,sz10)
| equal(X1,xp) )
& isPrime0(xp)
& ? [X1] :
( aNaturalNumber0(X1)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,X1)) )
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(52,plain,
( ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& ! [X3] :
( ~ aNaturalNumber0(X3)
| ( ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4)) )
& ~ doDivides0(X3,xp) )
| equal(X3,sz10)
| equal(X3,xp) )
& isPrime0(xp)
& ? [X5] :
( aNaturalNumber0(X5)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,X5)) )
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(variable_rename,[status(thm)],[51]) ).
fof(53,plain,
( ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& ! [X3] :
( ~ aNaturalNumber0(X3)
| ( ! [X4] :
( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4)) )
& ~ doDivides0(X3,xp) )
| equal(X3,sz10)
| equal(X3,xp) )
& isPrime0(xp)
& aNaturalNumber0(esk1_0)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,esk1_0))
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(skolemize,[status(esa)],[52]) ).
fof(54,plain,
! [X3,X4] :
( ( ( ( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4)) )
& ~ doDivides0(X3,xp) )
| ~ aNaturalNumber0(X3)
| equal(X3,sz10)
| equal(X3,xp) )
& ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& isPrime0(xp)
& aNaturalNumber0(esk1_0)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,esk1_0))
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(shift_quantors,[status(thm)],[53]) ).
fof(55,plain,
! [X3,X4] :
( ( ~ aNaturalNumber0(X4)
| ~ equal(xp,sdtasdt0(X3,X4))
| ~ aNaturalNumber0(X3)
| equal(X3,sz10)
| equal(X3,xp) )
& ( ~ doDivides0(X3,xp)
| ~ aNaturalNumber0(X3)
| equal(X3,sz10)
| equal(X3,xp) )
& ~ equal(xp,sz00)
& ~ equal(xp,sz10)
& isPrime0(xp)
& aNaturalNumber0(esk1_0)
& equal(sdtasdt0(xn,xm),sdtasdt0(xp,esk1_0))
& doDivides0(xp,sdtasdt0(xn,xm)) ),
inference(distribute,[status(thm)],[54]) ).
cnf(61,plain,
xp != sz00,
inference(split_conjunct,[status(thm)],[55]) ).
cnf(65,plain,
sdtpldt0(xp,xr) = xn,
inference(split_conjunct,[status(thm)],[3]) ).
cnf(66,plain,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[3]) ).
fof(70,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(sdtpldt0(X1,X2),sdtpldt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(71,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| equal(sdtpldt0(X3,X4),sdtpldt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[70]) ).
cnf(72,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[71]) ).
fof(234,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X3)
| sdtlseqdt0(X1,X3) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(235,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ~ sdtlseqdt0(X4,X5)
| ~ sdtlseqdt0(X5,X6)
| sdtlseqdt0(X4,X6) ),
inference(variable_rename,[status(thm)],[234]) ).
cnf(236,plain,
( sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X3,X2)
| ~ sdtlseqdt0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[235]) ).
fof(240,plain,
( ? [X2] :
( aNaturalNumber0(X2)
& equal(sdtpldt0(xp,X2),xn) )
& sdtlseqdt0(xp,xn) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(241,plain,
( aNaturalNumber0(esk7_0)
& equal(sdtpldt0(xp,esk7_0),xn)
& sdtlseqdt0(xp,xn) ),
inference(skolemize,[status(esa)],[240]) ).
cnf(242,plain,
sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[241]) ).
cnf(248,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(250,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[17]) ).
fof(272,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ( ( ~ sdtlseqdt0(X1,X2)
| ? [X3] :
( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) )
& ( ! [X3] :
( ~ aNaturalNumber0(X3)
| ~ equal(sdtpldt0(X1,X3),X2) )
| sdtlseqdt0(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(273,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ sdtlseqdt0(X4,X5)
| ? [X6] :
( aNaturalNumber0(X6)
& equal(sdtpldt0(X4,X6),X5) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5) )
| sdtlseqdt0(X4,X5) ) ) ),
inference(variable_rename,[status(thm)],[272]) ).
fof(274,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ( ( ~ sdtlseqdt0(X4,X5)
| ( aNaturalNumber0(esk8_2(X4,X5))
& equal(sdtpldt0(X4,esk8_2(X4,X5)),X5) ) )
& ( ! [X7] :
( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5) )
| sdtlseqdt0(X4,X5) ) ) ),
inference(skolemize,[status(esa)],[273]) ).
fof(275,plain,
! [X4,X5,X7] :
( ( ( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5)
| sdtlseqdt0(X4,X5) )
& ( ~ sdtlseqdt0(X4,X5)
| ( aNaturalNumber0(esk8_2(X4,X5))
& equal(sdtpldt0(X4,esk8_2(X4,X5)),X5) ) ) )
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[274]) ).
fof(276,plain,
! [X4,X5,X7] :
( ( ~ aNaturalNumber0(X7)
| ~ equal(sdtpldt0(X4,X7),X5)
| sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( aNaturalNumber0(esk8_2(X4,X5))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(sdtpldt0(X4,esk8_2(X4,X5)),X5)
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[275]) ).
cnf(277,plain,
( sdtpldt0(X2,esk8_2(X2,X1)) = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[276]) ).
cnf(278,plain,
( aNaturalNumber0(esk8_2(X2,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[276]) ).
cnf(279,plain,
( sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X3) != X1
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[276]) ).
fof(303,negated_conjecture,
( equal(xr,xn)
| ( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(sdtpldt0(xr,X1),xn) )
& ~ sdtlseqdt0(xr,xn) ) ),
inference(fof_nnf,[status(thm)],[45]) ).
fof(304,negated_conjecture,
( equal(xr,xn)
| ( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xr,X2),xn) )
& ~ sdtlseqdt0(xr,xn) ) ),
inference(variable_rename,[status(thm)],[303]) ).
fof(305,negated_conjecture,
! [X2] :
( ( ( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xr,X2),xn) )
& ~ sdtlseqdt0(xr,xn) )
| equal(xr,xn) ),
inference(shift_quantors,[status(thm)],[304]) ).
fof(306,negated_conjecture,
! [X2] :
( ( ~ aNaturalNumber0(X2)
| ~ equal(sdtpldt0(xr,X2),xn)
| equal(xr,xn) )
& ( ~ sdtlseqdt0(xr,xn)
| equal(xr,xn) ) ),
inference(distribute,[status(thm)],[305]) ).
cnf(308,negated_conjecture,
( xr = xn
| sdtpldt0(xr,X1) != xn
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[306]) ).
cnf(342,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[36]) ).
fof(353,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ( ~ equal(sdtpldt0(X1,X2),sdtpldt0(X1,X3))
& ~ equal(sdtpldt0(X2,X1),sdtpldt0(X3,X1)) )
| equal(X2,X3) ),
inference(fof_nnf,[status(thm)],[39]) ).
fof(354,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ( ~ equal(sdtpldt0(X4,X5),sdtpldt0(X4,X6))
& ~ equal(sdtpldt0(X5,X4),sdtpldt0(X6,X4)) )
| equal(X5,X6) ),
inference(variable_rename,[status(thm)],[353]) ).
fof(355,plain,
! [X4,X5,X6] :
( ( ~ equal(sdtpldt0(X4,X5),sdtpldt0(X4,X6))
| equal(X5,X6)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) )
& ( ~ equal(sdtpldt0(X5,X4),sdtpldt0(X6,X4))
| equal(X5,X6)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6) ) ),
inference(distribute,[status(thm)],[354]) ).
cnf(356,plain,
( X2 = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| sdtpldt0(X2,X3) != sdtpldt0(X1,X3) ),
inference(split_conjunct,[status(thm)],[355]) ).
fof(368,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| ( equal(sdtpldt0(X1,sz00),X1)
& equal(X1,sdtpldt0(sz00,X1)) ) ),
inference(fof_nnf,[status(thm)],[43]) ).
fof(369,plain,
! [X2] :
( ~ aNaturalNumber0(X2)
| ( equal(sdtpldt0(X2,sz00),X2)
& equal(X2,sdtpldt0(sz00,X2)) ) ),
inference(variable_rename,[status(thm)],[368]) ).
fof(370,plain,
! [X2] :
( ( equal(sdtpldt0(X2,sz00),X2)
| ~ aNaturalNumber0(X2) )
& ( equal(X2,sdtpldt0(sz00,X2))
| ~ aNaturalNumber0(X2) ) ),
inference(distribute,[status(thm)],[369]) ).
cnf(371,plain,
( X1 = sdtpldt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[370]) ).
cnf(435,negated_conjecture,
( xr = xn
| sdtpldt0(X1,xr) != xn
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xr) ),
inference(spm,[status(thm)],[308,72,theory(equality)]) ).
cnf(445,negated_conjecture,
( xr = xn
| sdtpldt0(X1,xr) != xn
| ~ aNaturalNumber0(X1)
| $false ),
inference(rw,[status(thm)],[435,66,theory(equality)]) ).
cnf(446,negated_conjecture,
( xr = xn
| sdtpldt0(X1,xr) != xn
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[445,theory(equality)]) ).
cnf(477,plain,
( sdtlseqdt0(sz00,X1)
| X2 != X1
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(sz00)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[279,371,theory(equality)]) ).
cnf(489,plain,
( sdtlseqdt0(sz00,X1)
| X2 != X1
| ~ aNaturalNumber0(X2)
| $false
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[477,342,theory(equality)]) ).
cnf(490,plain,
( sdtlseqdt0(sz00,X1)
| X2 != X1
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[489,theory(equality)]) ).
cnf(491,plain,
( sdtlseqdt0(sz00,X1)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[490,theory(equality)]) ).
cnf(574,plain,
( sdtlseqdt0(X1,xn)
| ~ sdtlseqdt0(X1,xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[236,242,theory(equality)]) ).
cnf(580,plain,
( sdtlseqdt0(X1,xn)
| ~ sdtlseqdt0(X1,xp)
| $false
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[574,248,theory(equality)]) ).
cnf(581,plain,
( sdtlseqdt0(X1,xn)
| ~ sdtlseqdt0(X1,xp)
| $false
| $false
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[580,250,theory(equality)]) ).
cnf(582,plain,
( sdtlseqdt0(X1,xn)
| ~ sdtlseqdt0(X1,xp)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[581,theory(equality)]) ).
cnf(4611,plain,
( sdtlseqdt0(sz00,xn)
| ~ aNaturalNumber0(sz00)
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[582,491,theory(equality)]) ).
cnf(4624,plain,
( sdtlseqdt0(sz00,xn)
| $false
| ~ aNaturalNumber0(xp) ),
inference(rw,[status(thm)],[4611,342,theory(equality)]) ).
cnf(4625,plain,
( sdtlseqdt0(sz00,xn)
| $false
| $false ),
inference(rw,[status(thm)],[4624,248,theory(equality)]) ).
cnf(4626,plain,
sdtlseqdt0(sz00,xn),
inference(cn,[status(thm)],[4625,theory(equality)]) ).
cnf(4692,plain,
( aNaturalNumber0(esk8_2(sz00,xn))
| ~ aNaturalNumber0(sz00)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[278,4626,theory(equality)]) ).
cnf(4695,plain,
( sdtpldt0(sz00,esk8_2(sz00,xn)) = xn
| ~ aNaturalNumber0(sz00)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[277,4626,theory(equality)]) ).
cnf(4704,plain,
( aNaturalNumber0(esk8_2(sz00,xn))
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[4692,342,theory(equality)]) ).
cnf(4705,plain,
( aNaturalNumber0(esk8_2(sz00,xn))
| $false
| $false ),
inference(rw,[status(thm)],[4704,250,theory(equality)]) ).
cnf(4706,plain,
aNaturalNumber0(esk8_2(sz00,xn)),
inference(cn,[status(thm)],[4705,theory(equality)]) ).
cnf(4714,plain,
( sdtpldt0(sz00,esk8_2(sz00,xn)) = xn
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[4695,342,theory(equality)]) ).
cnf(4715,plain,
( sdtpldt0(sz00,esk8_2(sz00,xn)) = xn
| $false
| $false ),
inference(rw,[status(thm)],[4714,250,theory(equality)]) ).
cnf(4716,plain,
sdtpldt0(sz00,esk8_2(sz00,xn)) = xn,
inference(cn,[status(thm)],[4715,theory(equality)]) ).
cnf(5015,plain,
( xn = esk8_2(sz00,xn)
| ~ aNaturalNumber0(esk8_2(sz00,xn)) ),
inference(spm,[status(thm)],[371,4716,theory(equality)]) ).
cnf(5029,plain,
( xn = esk8_2(sz00,xn)
| $false ),
inference(rw,[status(thm)],[5015,4706,theory(equality)]) ).
cnf(5030,plain,
xn = esk8_2(sz00,xn),
inference(cn,[status(thm)],[5029,theory(equality)]) ).
cnf(5185,plain,
( xr = xn
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[446,65,theory(equality)]) ).
cnf(5190,plain,
( xr = xn
| $false ),
inference(rw,[status(thm)],[5185,248,theory(equality)]) ).
cnf(5191,plain,
xr = xn,
inference(cn,[status(thm)],[5190,theory(equality)]) ).
cnf(5202,plain,
sdtpldt0(xp,xn) = xn,
inference(rw,[status(thm)],[65,5191,theory(equality)]) ).
cnf(5266,plain,
( xp = X1
| xn != sdtpldt0(X1,xn)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[356,5202,theory(equality)]) ).
cnf(5291,plain,
( xp = X1
| xn != sdtpldt0(X1,xn)
| $false
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xp) ),
inference(rw,[status(thm)],[5266,250,theory(equality)]) ).
cnf(5292,plain,
( xp = X1
| xn != sdtpldt0(X1,xn)
| $false
| ~ aNaturalNumber0(X1)
| $false ),
inference(rw,[status(thm)],[5291,248,theory(equality)]) ).
cnf(5293,plain,
( xp = X1
| xn != sdtpldt0(X1,xn)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[5292,theory(equality)]) ).
cnf(5329,plain,
sdtpldt0(sz00,xn) = xn,
inference(rw,[status(thm)],[4716,5030,theory(equality)]) ).
cnf(7041,plain,
( xp = sz00
| ~ aNaturalNumber0(sz00) ),
inference(spm,[status(thm)],[5293,5329,theory(equality)]) ).
cnf(7046,plain,
( xp = sz00
| $false ),
inference(rw,[status(thm)],[7041,342,theory(equality)]) ).
cnf(7047,plain,
xp = sz00,
inference(cn,[status(thm)],[7046,theory(equality)]) ).
cnf(7048,plain,
$false,
inference(sr,[status(thm)],[7047,61,theory(equality)]) ).
cnf(7049,plain,
$false,
7048,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM487+3 : TPTP v7.0.0. Released v4.0.0.
% 0.03/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.03/0.23 % Computer : n111.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 05:32:14 CST 2018
% 0.03/0.23 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.06/0.51 -running prover on /export/starexec/sandbox2/tmp/tmp6I2Zel/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.51 -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/tmp6I2Zel/sel_theBenchmark.p_1']
% 0.06/0.51 -prover status Theorem
% 0.06/0.51 Problem theBenchmark.p solved in phase 0.
% 0.06/0.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.51 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.51 Solved 1 out of 1.
% 0.06/0.51 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.51 # SZS status Theorem
% 0.06/0.51 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.52 # SZS output end CNFRefutation
%------------------------------------------------------------------------------