TSTP Solution File: NUM496+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM496+1 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n096.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 : 34
% Number of leaves : 12
% Syntax : Number of formulae : 101 ( 15 unt; 0 def)
% Number of atoms : 493 ( 85 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 638 ( 246 ~; 314 |; 66 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn 56 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/tmp/tmptr8l1A/sel_theBenchmark.p_1',m__1860) ).
fof(3,axiom,
equal(xr,sdtmndt0(xn,xp)),
file('/export/starexec/sandbox/tmp/tmptr8l1A/sel_theBenchmark.p_1',m__1883) ).
fof(4,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( doDivides0(X1,X2)
& doDivides0(X2,X3) )
=> doDivides0(X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmptr8l1A/sel_theBenchmark.p_1',mDivTrans) ).
fof(9,axiom,
( doDivides0(xp,xr)
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox/tmp/tmptr8l1A/sel_theBenchmark.p_1',m__2027) ).
fof(16,axiom,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/tmp/tmptr8l1A/sel_theBenchmark.p_1',m__1870) ).
fof(18,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmptr8l1A/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/tmptr8l1A/sel_theBenchmark.p_1',mDivSum) ).
fof(32,conjecture,
( doDivides0(xp,xn)
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox/tmp/tmptr8l1A/sel_theBenchmark.p_1',m__) ).
fof(36,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( equal(X3,sdtmndt0(X2,X1))
<=> ( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmptr8l1A/sel_theBenchmark.p_1',mDefDiff) ).
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/tmptr8l1A/sel_theBenchmark.p_1',mDefPrime) ).
fof(40,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmptr8l1A/sel_theBenchmark.p_1',mSortsB) ).
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/tmptr8l1A/sel_theBenchmark.p_1',mPrimDiv) ).
fof(48,negated_conjecture,
~ ( doDivides0(xp,xn)
| doDivides0(xp,xm) ),
inference(assume_negation,[status(cth)],[32]) ).
cnf(55,plain,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[2]) ).
cnf(56,plain,
xr = sdtmndt0(xn,xp),
inference(split_conjunct,[status(thm)],[3]) ).
fof(57,plain,
! [X1,X2,X3] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X2)
| ~ doDivides0(X2,X3)
| doDivides0(X1,X3) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(58,plain,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ~ doDivides0(X4,X5)
| ~ doDivides0(X5,X6)
| doDivides0(X4,X6) ),
inference(variable_rename,[status(thm)],[57]) ).
cnf(59,plain,
( doDivides0(X1,X2)
| ~ doDivides0(X3,X2)
| ~ doDivides0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[58]) ).
cnf(75,plain,
( doDivides0(xp,xm)
| doDivides0(xp,xr) ),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(103,plain,
sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(107,plain,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(109,plain,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[18]) ).
fof(122,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(123,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)],[122]) ).
cnf(124,plain,
( doDivides0(X1,sdtpldt0(X2,X3))
| ~ doDivides0(X1,X3)
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[123]) ).
fof(165,negated_conjecture,
( ~ doDivides0(xp,xn)
& ~ doDivides0(xp,xm) ),
inference(fof_nnf,[status(thm)],[48]) ).
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]) ).
fof(179,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| ! [X3] :
( ( ~ equal(X3,sdtmndt0(X2,X1))
| ( aNaturalNumber0(X3)
& equal(sdtpldt0(X1,X3),X2) ) )
& ( ~ aNaturalNumber0(X3)
| ~ equal(sdtpldt0(X1,X3),X2)
| equal(X3,sdtmndt0(X2,X1)) ) ) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(180,plain,
! [X4,X5] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ sdtlseqdt0(X4,X5)
| ! [X6] :
( ( ~ equal(X6,sdtmndt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(sdtpldt0(X4,X6),X5) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(sdtpldt0(X4,X6),X5)
| equal(X6,sdtmndt0(X5,X4)) ) ) ),
inference(variable_rename,[status(thm)],[179]) ).
fof(181,plain,
! [X4,X5,X6] :
( ( ( ~ equal(X6,sdtmndt0(X5,X4))
| ( aNaturalNumber0(X6)
& equal(sdtpldt0(X4,X6),X5) ) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(sdtpldt0(X4,X6),X5)
| equal(X6,sdtmndt0(X5,X4)) ) )
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ),
inference(shift_quantors,[status(thm)],[180]) ).
fof(182,plain,
! [X4,X5,X6] :
( ( aNaturalNumber0(X6)
| ~ equal(X6,sdtmndt0(X5,X4))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( equal(sdtpldt0(X4,X6),X5)
| ~ equal(X6,sdtmndt0(X5,X4))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| ~ equal(sdtpldt0(X4,X6),X5)
| equal(X6,sdtmndt0(X5,X4))
| ~ sdtlseqdt0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
inference(distribute,[status(thm)],[181]) ).
cnf(184,plain,
( sdtpldt0(X2,X3) = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| X3 != sdtmndt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[182]) ).
cnf(185,plain,
( aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X2,X1)
| X3 != sdtmndt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[182]) ).
fof(189,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(190,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)],[189]) ).
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)
| ( 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)],[190]) ).
fof(192,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)],[191]) ).
fof(193,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)],[192]) ).
cnf(198,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz10 ),
inference(split_conjunct,[status(thm)],[193]) ).
cnf(199,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[193]) ).
cnf(200,plain,
( X2 = X1
| X2 = sz10
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| ~ doDivides0(X2,X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[193]) ).
fof(202,plain,
! [X1,X2] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(fof_nnf,[status(thm)],[40]) ).
fof(203,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[202]) ).
cnf(204,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[203]) ).
fof(205,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(206,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10)
| ? [X4] :
( aNaturalNumber0(X4)
& doDivides0(X4,X3)
& isPrime0(X4) ) ),
inference(variable_rename,[status(thm)],[205]) ).
fof(207,plain,
! [X3] :
( ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10)
| ( aNaturalNumber0(esk4_1(X3))
& doDivides0(esk4_1(X3),X3)
& isPrime0(esk4_1(X3)) ) ),
inference(skolemize,[status(esa)],[206]) ).
fof(208,plain,
! [X3] :
( ( aNaturalNumber0(esk4_1(X3))
| ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10) )
& ( doDivides0(esk4_1(X3),X3)
| ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10) )
& ( isPrime0(esk4_1(X3))
| ~ aNaturalNumber0(X3)
| equal(X3,sz00)
| equal(X3,sz10) ) ),
inference(distribute,[status(thm)],[207]) ).
cnf(209,plain,
( X1 = sz10
| X1 = sz00
| isPrime0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(210,plain,
( X1 = sz10
| X1 = sz00
| doDivides0(esk4_1(X1),X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(211,plain,
( X1 = sz10
| X1 = sz00
| aNaturalNumber0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[208]) ).
cnf(237,plain,
doDivides0(xp,xr),
inference(sr,[status(thm)],[75,166,theory(equality)]) ).
cnf(238,plain,
( sz00 != xp
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[199,55,theory(equality)]) ).
cnf(239,plain,
( sz00 != xp
| $false ),
inference(rw,[status(thm)],[238,107,theory(equality)]) ).
cnf(240,plain,
sz00 != xp,
inference(cn,[status(thm)],[239,theory(equality)]) ).
cnf(241,plain,
( sz10 != xp
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[198,55,theory(equality)]) ).
cnf(242,plain,
( sz10 != xp
| $false ),
inference(rw,[status(thm)],[241,107,theory(equality)]) ).
cnf(243,plain,
sz10 != xp,
inference(cn,[status(thm)],[242,theory(equality)]) ).
cnf(266,plain,
( sz10 = X1
| sz00 = X1
| sz10 != esk4_1(X1)
| ~ aNaturalNumber0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[198,209,theory(equality)]) ).
cnf(389,plain,
( sz10 = esk4_1(X1)
| X1 = esk4_1(X1)
| sz10 = X1
| sz00 = X1
| ~ isPrime0(X1)
| ~ aNaturalNumber0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[200,210,theory(equality)]) ).
cnf(439,plain,
( aNaturalNumber0(X1)
| xr != X1
| ~ sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[185,56,theory(equality)]) ).
cnf(440,plain,
( aNaturalNumber0(X1)
| xr != X1
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[439,103,theory(equality)]) ).
cnf(441,plain,
( aNaturalNumber0(X1)
| xr != X1
| $false
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[440,107,theory(equality)]) ).
cnf(442,plain,
( aNaturalNumber0(X1)
| xr != X1
| $false
| $false
| $false ),
inference(rw,[status(thm)],[441,109,theory(equality)]) ).
cnf(443,plain,
( aNaturalNumber0(X1)
| xr != X1 ),
inference(cn,[status(thm)],[442,theory(equality)]) ).
cnf(496,plain,
( doDivides0(X1,sdtpldt0(X2,X3))
| ~ doDivides0(X1,X4)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X4,X3)
| ~ doDivides0(X4,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[59,124,theory(equality)]) ).
cnf(516,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1
| ~ sdtlseqdt0(xp,xn)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(spm,[status(thm)],[184,56,theory(equality)]) ).
cnf(517,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1
| $false
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[516,103,theory(equality)]) ).
cnf(518,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1
| $false
| $false
| ~ aNaturalNumber0(xn) ),
inference(rw,[status(thm)],[517,107,theory(equality)]) ).
cnf(519,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1
| $false
| $false
| $false ),
inference(rw,[status(thm)],[518,109,theory(equality)]) ).
cnf(520,plain,
( sdtpldt0(xp,X1) = xn
| xr != X1 ),
inference(cn,[status(thm)],[519,theory(equality)]) ).
cnf(1044,plain,
( sz10 = X1
| sz00 = X1
| esk4_1(X1) != sz10
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[266,211]) ).
cnf(2743,plain,
( esk4_1(X1) = sz10
| esk4_1(X1) = X1
| sz10 = X1
| sz00 = X1
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[389,211]) ).
cnf(2744,plain,
( esk4_1(X1) = sz10
| esk4_1(X1) = X1
| sz10 = X1
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[2743,199]) ).
cnf(2745,plain,
( esk4_1(X1) = sz10
| esk4_1(X1) = X1
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[2744,198]) ).
cnf(2746,plain,
( esk4_1(xp) = sz10
| esk4_1(xp) = xp
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[2745,55,theory(equality)]) ).
cnf(2748,plain,
( esk4_1(xp) = sz10
| esk4_1(xp) = xp
| $false ),
inference(rw,[status(thm)],[2746,107,theory(equality)]) ).
cnf(2749,plain,
( esk4_1(xp) = sz10
| esk4_1(xp) = xp ),
inference(cn,[status(thm)],[2748,theory(equality)]) ).
cnf(2752,plain,
( sz10 = xp
| sz00 = xp
| doDivides0(xp,xp)
| esk4_1(xp) = sz10
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[210,2749,theory(equality)]) ).
cnf(2763,plain,
( sz10 = xp
| sz00 = xp
| doDivides0(xp,xp)
| esk4_1(xp) = sz10
| $false ),
inference(rw,[status(thm)],[2752,107,theory(equality)]) ).
cnf(2764,plain,
( sz10 = xp
| sz00 = xp
| doDivides0(xp,xp)
| esk4_1(xp) = sz10 ),
inference(cn,[status(thm)],[2763,theory(equality)]) ).
cnf(2765,plain,
( xp = sz00
| doDivides0(xp,xp)
| esk4_1(xp) = sz10 ),
inference(sr,[status(thm)],[2764,243,theory(equality)]) ).
cnf(2766,plain,
( doDivides0(xp,xp)
| esk4_1(xp) = sz10 ),
inference(sr,[status(thm)],[2765,240,theory(equality)]) ).
cnf(2788,plain,
( sz00 = xp
| sz10 = xp
| doDivides0(xp,xp)
| ~ aNaturalNumber0(xp) ),
inference(spm,[status(thm)],[1044,2766,theory(equality)]) ).
cnf(2808,plain,
( sz00 = xp
| sz10 = xp
| doDivides0(xp,xp)
| $false ),
inference(rw,[status(thm)],[2788,107,theory(equality)]) ).
cnf(2809,plain,
( sz00 = xp
| sz10 = xp
| doDivides0(xp,xp) ),
inference(cn,[status(thm)],[2808,theory(equality)]) ).
cnf(2810,plain,
( xp = sz10
| doDivides0(xp,xp) ),
inference(sr,[status(thm)],[2809,240,theory(equality)]) ).
cnf(2811,plain,
doDivides0(xp,xp),
inference(sr,[status(thm)],[2810,243,theory(equality)]) ).
cnf(5076,plain,
( doDivides0(X1,sdtpldt0(X2,X3))
| ~ doDivides0(X4,X3)
| ~ doDivides0(X4,X2)
| ~ doDivides0(X1,X4)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X4) ),
inference(csr,[status(thm)],[496,204]) ).
cnf(5080,plain,
( doDivides0(xp,sdtpldt0(X1,X2))
| ~ doDivides0(xp,X2)
| ~ doDivides0(xp,X1)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[5076,2811,theory(equality)]) ).
cnf(5110,plain,
( doDivides0(xp,sdtpldt0(X1,X2))
| ~ doDivides0(xp,X2)
| ~ doDivides0(xp,X1)
| $false
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[5080,107,theory(equality)]) ).
cnf(5111,plain,
( doDivides0(xp,sdtpldt0(X1,X2))
| ~ doDivides0(xp,X2)
| ~ doDivides0(xp,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[5110,theory(equality)]) ).
cnf(5153,plain,
( doDivides0(xp,xn)
| ~ doDivides0(xp,X1)
| ~ doDivides0(xp,xp)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xp)
| xr != X1 ),
inference(spm,[status(thm)],[5111,520,theory(equality)]) ).
cnf(5172,plain,
( doDivides0(xp,xn)
| ~ doDivides0(xp,X1)
| $false
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(xp)
| xr != X1 ),
inference(rw,[status(thm)],[5153,2811,theory(equality)]) ).
cnf(5173,plain,
( doDivides0(xp,xn)
| ~ doDivides0(xp,X1)
| $false
| ~ aNaturalNumber0(X1)
| $false
| xr != X1 ),
inference(rw,[status(thm)],[5172,107,theory(equality)]) ).
cnf(5174,plain,
( doDivides0(xp,xn)
| ~ doDivides0(xp,X1)
| ~ aNaturalNumber0(X1)
| xr != X1 ),
inference(cn,[status(thm)],[5173,theory(equality)]) ).
cnf(5175,plain,
( ~ doDivides0(xp,X1)
| ~ aNaturalNumber0(X1)
| xr != X1 ),
inference(sr,[status(thm)],[5174,167,theory(equality)]) ).
cnf(5184,plain,
( xr != X1
| ~ doDivides0(xp,X1) ),
inference(csr,[status(thm)],[5175,443]) ).
cnf(5186,plain,
$false,
inference(spm,[status(thm)],[5184,237,theory(equality)]) ).
cnf(5204,plain,
$false,
5186,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM496+1 : 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 : n096.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:54:00 CST 2018
% 0.06/0.23 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for []
% 0.06/0.44 -running prover on /export/starexec/sandbox/tmp/tmptr8l1A/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.44 -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/tmptr8l1A/sel_theBenchmark.p_1']
% 0.06/0.44 -prover status Theorem
% 0.06/0.44 Problem theBenchmark.p solved in phase 0.
% 0.06/0.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.44 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.44 Solved 1 out of 1.
% 0.06/0.44 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.44 # SZS status Theorem
% 0.06/0.44 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.45 # SZS output end CNFRefutation
%------------------------------------------------------------------------------