TSTP Solution File: NUM496+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM496+3 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n071.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.37s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 10
% Syntax : Number of formulae : 89 ( 16 unt; 0 def)
% Number of atoms : 464 ( 67 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 545 ( 170 ~; 237 |; 130 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 49 !; 17 ?)
% 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/sandbox/tmp/tmph4apWB/sel_theBenchmark.p_1',m__1860) ).
fof(3,axiom,
( aNaturalNumber0(xr)
& equal(sdtpldt0(xp,xr),xn)
& equal(xr,sdtmndt0(xn,xp)) ),
file('/export/starexec/sandbox/tmp/tmph4apWB/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/sandbox/tmp/tmph4apWB/sel_theBenchmark.p_1',mAddComm) ).
fof(9,axiom,
( ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xr,sdtasdt0(xp,X1)) )
& doDivides0(xp,xr) )
| ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xm,sdtasdt0(xp,X1)) )
& doDivides0(xp,xm) ) ),
file('/export/starexec/sandbox/tmp/tmph4apWB/sel_theBenchmark.p_1',m__2027) ).
fof(18,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmph4apWB/sel_theBenchmark.p_1',m__1837) ).
fof(22,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( doDivides0(X1,X2)
& doDivides0(X1,X3) )
=> doDivides0(X1,sdtpldt0(X2,X3)) ) ),
file('/export/starexec/sandbox/tmp/tmph4apWB/sel_theBenchmark.p_1',mDivSum) ).
fof(31,axiom,
( aNaturalNumber0(sz10)
& ~ equal(sz10,sz00) ),
file('/export/starexec/sandbox/tmp/tmph4apWB/sel_theBenchmark.p_1',mSortsC_01) ).
fof(32,conjecture,
( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xp,X1)) )
| doDivides0(xp,xn)
| ? [X1] :
( aNaturalNumber0(X1)
& equal(xm,sdtasdt0(xp,X1)) )
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox/tmp/tmph4apWB/sel_theBenchmark.p_1',m__) ).
fof(38,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/tmph4apWB/sel_theBenchmark.p_1',mDefPrime) ).
fof(41,axiom,
! [X1] :
( ( aNaturalNumber0(X1)
& ~ equal(X1,sz00)
& ~ equal(X1,sz10) )
=> ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& isPrime0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmph4apWB/sel_theBenchmark.p_1',mPrimDiv) ).
fof(48,negated_conjecture,
~ ( ? [X1] :
( aNaturalNumber0(X1)
& equal(xn,sdtasdt0(xp,X1)) )
| doDivides0(xp,xn)
| ? [X1] :
( aNaturalNumber0(X1)
& equal(xm,sdtasdt0(xp,X1)) )
| doDivides0(xp,xm) ),
inference(assume_negation,[status(cth)],[32]) ).
fof(54,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(55,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)],[54]) ).
fof(56,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)],[55]) ).
fof(57,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)],[56]) ).
fof(58,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)],[57]) ).
cnf(63,plain,
xp != sz10,
inference(split_conjunct,[status(thm)],[58]) ).
cnf(64,plain,
xp != sz00,
inference(split_conjunct,[status(thm)],[58]) ).
cnf(65,plain,
( X1 = xp
| X1 = sz10
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,xp) ),
inference(split_conjunct,[status(thm)],[58]) ).
cnf(68,plain,
sdtpldt0(xp,xr) = xn,
inference(split_conjunct,[status(thm)],[3]) ).
cnf(69,plain,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[3]) ).
fof(73,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| equal(sdtpldt0(X1,X2),sdtpldt0(X2,X1)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(74,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| equal(sdtpldt0(X3,X4),sdtpldt0(X4,X3)) ),
inference(variable_rename,[status(thm)],[73]) ).
cnf(75,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[74]) ).
fof(216,plain,
( ( ? [X2] :
( aNaturalNumber0(X2)
& equal(xr,sdtasdt0(xp,X2)) )
& doDivides0(xp,xr) )
| ( ? [X3] :
( aNaturalNumber0(X3)
& equal(xm,sdtasdt0(xp,X3)) )
& doDivides0(xp,xm) ) ),
inference(variable_rename,[status(thm)],[9]) ).
fof(217,plain,
( ( aNaturalNumber0(esk6_0)
& equal(xr,sdtasdt0(xp,esk6_0))
& doDivides0(xp,xr) )
| ( aNaturalNumber0(esk7_0)
& equal(xm,sdtasdt0(xp,esk7_0))
& doDivides0(xp,xm) ) ),
inference(skolemize,[status(esa)],[216]) ).
fof(218,plain,
( ( aNaturalNumber0(esk7_0)
| aNaturalNumber0(esk6_0) )
& ( equal(xm,sdtasdt0(xp,esk7_0))
| aNaturalNumber0(esk6_0) )
& ( doDivides0(xp,xm)
| aNaturalNumber0(esk6_0) )
& ( aNaturalNumber0(esk7_0)
| equal(xr,sdtasdt0(xp,esk6_0)) )
& ( equal(xm,sdtasdt0(xp,esk7_0))
| equal(xr,sdtasdt0(xp,esk6_0)) )
& ( doDivides0(xp,xm)
| equal(xr,sdtasdt0(xp,esk6_0)) )
& ( aNaturalNumber0(esk7_0)
| doDivides0(xp,xr) )
& ( equal(xm,sdtasdt0(xp,esk7_0))
| doDivides0(xp,xr) )
& ( doDivides0(xp,xm)
| doDivides0(xp,xr) ) ),
inference(distribute,[status(thm)],[217]) ).
cnf(219,plain,
( doDivides0(xp,xr)
| doDivides0(xp,xm) ),
inference(split_conjunct,[status(thm)],[218]) ).
cnf(263,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[18]) ).
fof(282,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X1,X3)
| doDivides0(X1,sdtpldt0(X2,X3)) ),
inference(fof_nnf,[status(thm)],[22]) ).
fof(283,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ~ doDivides0(X4,X5)
| ~ doDivides0(X4,X6)
| doDivides0(X4,sdtpldt0(X5,X6)) ),
inference(variable_rename,[status(thm)],[282]) ).
cnf(284,plain,
( doDivides0(X1,sdtpldt0(X2,X3))
| ~ doDivides0(X1,X3)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[283]) ).
cnf(328,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[31]) ).
fof(329,negated_conjecture,
( ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(xn,sdtasdt0(xp,X1)) )
& ~ doDivides0(xp,xn)
& ! [X1] :
( ~ aNaturalNumber0(X1)
| ~ equal(xm,sdtasdt0(xp,X1)) )
& ~ doDivides0(xp,xm) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(330,negated_conjecture,
( ! [X2] :
( ~ aNaturalNumber0(X2)
| ~ equal(xn,sdtasdt0(xp,X2)) )
& ~ doDivides0(xp,xn)
& ! [X3] :
( ~ aNaturalNumber0(X3)
| ~ equal(xm,sdtasdt0(xp,X3)) )
& ~ doDivides0(xp,xm) ),
inference(variable_rename,[status(thm)],[329]) ).
fof(331,negated_conjecture,
! [X2,X3] :
( ( ~ aNaturalNumber0(X3)
| ~ equal(xm,sdtasdt0(xp,X3)) )
& ( ~ aNaturalNumber0(X2)
| ~ equal(xn,sdtasdt0(xp,X2)) )
& ~ doDivides0(xp,xn)
& ~ doDivides0(xp,xm) ),
inference(shift_quantors,[status(thm)],[330]) ).
cnf(332,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[331]) ).
cnf(333,negated_conjecture,
~ doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[331]) ).
fof(357,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)],[38]) ).
fof(358,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)],[357]) ).
fof(359,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(esk13_1(X3))
& doDivides0(esk13_1(X3),X3)
& ~ equal(esk13_1(X3),sz10)
& ~ equal(esk13_1(X3),X3) )
| isPrime0(X3) ) ) ),
inference(skolemize,[status(esa)],[358]) ).
fof(360,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(esk13_1(X3))
& doDivides0(esk13_1(X3),X3)
& ~ equal(esk13_1(X3),sz10)
& ~ equal(esk13_1(X3),X3) )
| isPrime0(X3) ) )
| ~ aNaturalNumber0(X3) ),
inference(shift_quantors,[status(thm)],[359]) ).
fof(361,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(esk13_1(X3))
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( doDivides0(esk13_1(X3),X3)
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(esk13_1(X3),sz10)
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ equal(esk13_1(X3),X3)
| equal(X3,sz00)
| equal(X3,sz10)
| isPrime0(X3)
| ~ aNaturalNumber0(X3) ) ),
inference(distribute,[status(thm)],[360]) ).
cnf(366,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz10 ),
inference(split_conjunct,[status(thm)],[361]) ).
fof(373,plain,
! [X1] :
( ~ aNaturalNumber0(X1)
| equal(X1,sz00)
| equal(X1,sz10)
| ? [X2] :
( aNaturalNumber0(X2)
& doDivides0(X2,X1)
& isPrime0(X2) ) ),
inference(fof_nnf,[status(thm)],[41]) ).
fof(374,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10)
| ? [X4] :
( aNaturalNumber0(X4)
& doDivides0(X4,X3)
& isPrime0(X4) ) ),
inference(variable_rename,[status(thm)],[373]) ).
fof(375,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10)
| ( aNaturalNumber0(esk14_1(X3))
& doDivides0(esk14_1(X3),X3)
& isPrime0(esk14_1(X3)) ) ),
inference(skolemize,[status(esa)],[374]) ).
fof(376,plain,
! [X3] :
( ( aNaturalNumber0(esk14_1(X3))
| ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10) )
& ( doDivides0(esk14_1(X3),X3)
| ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10) )
& ( isPrime0(esk14_1(X3))
| ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10) ) ),
inference(distribute,[status(thm)],[375]) ).
cnf(377,plain,
( X1 = sz10
| X1 = sz00
| isPrime0(esk14_1(X1))
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[376]) ).
cnf(378,plain,
( X1 = sz10
| X1 = sz00
| doDivides0(esk14_1(X1),X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[376]) ).
cnf(379,plain,
( X1 = sz10
| X1 = sz00
| aNaturalNumber0(esk14_1(X1))
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[376]) ).
cnf(407,plain,
doDivides0(xp,xr),
inference(sr,[status(thm)],[219,332,theory(equality)]) ).
cnf(489,plain,
( ~ isPrime0(sz10)
| ~ aNaturalNumber0(sz10) ),
inference(er,[status(thm)],[366,theory(equality)]) ).
cnf(490,plain,
( ~ isPrime0(sz10)
| $false ),
inference(rw,[status(thm)],[489,328,theory(equality)]) ).
cnf(491,plain,
~ isPrime0(sz10),
inference(cn,[status(thm)],[490,theory(equality)]) ).
cnf(626,plain,
( sz10 = esk14_1(xp)
| xp = esk14_1(xp)
| sz10 = xp
| sz00 = xp
| ~ aNaturalNumber0(esk14_1(xp))
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[65,378,theory(equality)]) ).
cnf(628,plain,
( sz10 = esk14_1(xp)
| xp = esk14_1(xp)
| sz10 = xp
| sz00 = xp
| ~ aNaturalNumber0(esk14_1(xp))
| $false ),
inference(rw,[status(thm)],[626,263,theory(equality)]) ).
cnf(629,plain,
( sz10 = esk14_1(xp)
| xp = esk14_1(xp)
| sz10 = xp
| sz00 = xp
| ~ aNaturalNumber0(esk14_1(xp)) ),
inference(cn,[status(thm)],[628,theory(equality)]) ).
cnf(630,plain,
( esk14_1(xp) = sz10
| esk14_1(xp) = xp
| sz00 = xp
| ~ aNaturalNumber0(esk14_1(xp)) ),
inference(sr,[status(thm)],[629,63,theory(equality)]) ).
cnf(631,plain,
( esk14_1(xp) = sz10
| esk14_1(xp) = xp
| ~ aNaturalNumber0(esk14_1(xp)) ),
inference(sr,[status(thm)],[630,64,theory(equality)]) ).
cnf(17027,plain,
( esk14_1(xp) = xp
| esk14_1(xp) = sz10
| sz10 = xp
| sz00 = xp
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[631,379,theory(equality)]) ).
cnf(17028,plain,
( esk14_1(xp) = xp
| esk14_1(xp) = sz10
| sz10 = xp
| sz00 = xp
| $false ),
inference(rw,[status(thm)],[17027,263,theory(equality)]) ).
cnf(17029,plain,
( esk14_1(xp) = xp
| esk14_1(xp) = sz10
| sz10 = xp
| sz00 = xp ),
inference(cn,[status(thm)],[17028,theory(equality)]) ).
cnf(17030,plain,
( esk14_1(xp) = xp
| esk14_1(xp) = sz10
| sz00 = xp ),
inference(sr,[status(thm)],[17029,63,theory(equality)]) ).
cnf(17031,plain,
( esk14_1(xp) = xp
| esk14_1(xp) = sz10 ),
inference(sr,[status(thm)],[17030,64,theory(equality)]) ).
cnf(17035,plain,
( sz10 = xp
| sz00 = xp
| isPrime0(sz10)
| esk14_1(xp) = xp
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[377,17031,theory(equality)]) ).
cnf(17041,plain,
( sz10 = xp
| sz00 = xp
| isPrime0(sz10)
| esk14_1(xp) = xp
| $false ),
inference(rw,[status(thm)],[17035,263,theory(equality)]) ).
cnf(17042,plain,
( sz10 = xp
| sz00 = xp
| isPrime0(sz10)
| esk14_1(xp) = xp ),
inference(cn,[status(thm)],[17041,theory(equality)]) ).
cnf(17043,plain,
( sz00 = xp
| isPrime0(sz10)
| esk14_1(xp) = xp ),
inference(sr,[status(thm)],[17042,63,theory(equality)]) ).
cnf(17044,plain,
( isPrime0(sz10)
| esk14_1(xp) = xp ),
inference(sr,[status(thm)],[17043,64,theory(equality)]) ).
cnf(17045,plain,
esk14_1(xp) = xp,
inference(sr,[status(thm)],[17044,491,theory(equality)]) ).
cnf(17052,plain,
( sz10 = xp
| sz00 = xp
| doDivides0(xp,xp)
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[378,17045,theory(equality)]) ).
cnf(17063,plain,
( sz10 = xp
| sz00 = xp
| doDivides0(xp,xp)
| $false ),
inference(rw,[status(thm)],[17052,263,theory(equality)]) ).
cnf(17064,plain,
( sz10 = xp
| sz00 = xp
| doDivides0(xp,xp) ),
inference(cn,[status(thm)],[17063,theory(equality)]) ).
cnf(17065,plain,
( sz00 = xp
| doDivides0(xp,xp) ),
inference(sr,[status(thm)],[17064,63,theory(equality)]) ).
cnf(17066,plain,
doDivides0(xp,xp),
inference(sr,[status(thm)],[17065,64,theory(equality)]) ).
cnf(17071,plain,
( doDivides0(xp,sdtpldt0(X1,xp))
| ~ doDivides0(xp,X1)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[284,17066,theory(equality)]) ).
cnf(17083,plain,
( doDivides0(xp,sdtpldt0(X1,xp))
| ~ doDivides0(xp,X1)
| $false
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[17071,263,theory(equality)]) ).
cnf(17084,plain,
( doDivides0(xp,sdtpldt0(X1,xp))
| ~ doDivides0(xp,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[17083,theory(equality)]) ).
cnf(20414,plain,
( doDivides0(xp,sdtpldt0(xr,xp))
| ~ aNaturalNumber0(xr) ),
inference(spm,[status(thm)],[17084,407,theory(equality)]) ).
cnf(20421,plain,
( doDivides0(xp,sdtpldt0(xr,xp))
| $false ),
inference(rw,[status(thm)],[20414,69,theory(equality)]) ).
cnf(20422,plain,
doDivides0(xp,sdtpldt0(xr,xp)),
inference(cn,[status(thm)],[20421,theory(equality)]) ).
cnf(20475,plain,
( doDivides0(xp,sdtpldt0(xp,xr))
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xr) ),
inference(spm,[status(thm)],[20422,75,theory(equality)]) ).
cnf(20487,plain,
( doDivides0(xp,xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xr) ),
inference(rw,[status(thm)],[20475,68,theory(equality)]) ).
cnf(20488,plain,
( doDivides0(xp,xn)
| $false
| ~ aNaturalNumber0(xr) ),
inference(rw,[status(thm)],[20487,263,theory(equality)]) ).
cnf(20489,plain,
( doDivides0(xp,xn)
| $false
| $false ),
inference(rw,[status(thm)],[20488,69,theory(equality)]) ).
cnf(20490,plain,
doDivides0(xp,xn),
inference(cn,[status(thm)],[20489,theory(equality)]) ).
cnf(20491,plain,
$false,
inference(sr,[status(thm)],[20490,333,theory(equality)]) ).
cnf(20492,plain,
$false,
20491,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM496+3 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n071.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:48:59 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.37/0.75 -running prover on /export/starexec/sandbox/tmp/tmph4apWB/sel_theBenchmark.p_1 with time limit 29
% 0.37/0.75 -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/tmph4apWB/sel_theBenchmark.p_1']
% 0.37/0.75 -prover status Theorem
% 0.37/0.75 Problem theBenchmark.p solved in phase 0.
% 0.37/0.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.75 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.75 Solved 1 out of 1.
% 0.37/0.75 # Problem is unsatisfiable (or provable), constructing proof object
% 0.37/0.75 # SZS status Theorem
% 0.37/0.75 # SZS output start CNFRefutation.
% See solution above
% 0.57/0.75 # SZS output end CNFRefutation
%------------------------------------------------------------------------------