TSTP Solution File: NUM448+5 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM448+5 : TPTP v7.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n095.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:22 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 4
% Syntax : Number of formulae : 62 ( 5 unt; 0 def)
% Number of atoms : 547 ( 39 equ)
% Maximal formula atoms : 102 ( 8 avg)
% Number of connectives : 746 ( 261 ~; 262 |; 193 &)
% ( 10 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 41 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-2 aty)
% Number of variables : 120 ( 0 sgn 61 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(17,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox2/tmp/tmpeS9xqD/sel_theBenchmark.p_1',mIntOne) ).
fof(23,axiom,
! [X1] :
( aInteger0(X1)
=> ( ? [X2] :
( aDivisorOf0(X2,X1)
& isPrime0(X2) )
<=> ( ~ equal(X1,sz10)
& ~ equal(X1,smndt0(sz10)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpeS9xqD/sel_theBenchmark.p_1',mPrimeDivisor) ).
fof(26,conjecture,
( ! [X1] :
( aInteger0(X1)
=> ( ( ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) )
=> ? [X2] :
( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ? [X2] :
( ( ( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) ) )
| aDivisorOf0(X2,X1) )
& isPrime0(X2) )
=> ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
& aElementOf0(X1,sbsmnsldt0(xS)) ) ) ) )
=> ( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ( aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( equal(X1,sz10)
| equal(X1,smndt0(sz10)) ) )
| equal(stldt0(sbsmnsldt0(xS)),cS2076) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmpeS9xqD/sel_theBenchmark.p_1',m__) ).
fof(32,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmpeS9xqD/sel_theBenchmark.p_1',mIntNeg) ).
fof(44,negated_conjecture,
~ ( ! [X1] :
( aInteger0(X1)
=> ( ( ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) )
=> ? [X2] :
( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ? [X2] :
( ( ( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) ) )
| aDivisorOf0(X2,X1) )
& isPrime0(X2) )
=> ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
& aElementOf0(X1,sbsmnsldt0(xS)) ) ) ) )
=> ( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ( aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( equal(X1,sz10)
| equal(X1,smndt0(sz10)) ) )
| equal(stldt0(sbsmnsldt0(xS)),cS2076) ) ) ) ),
inference(assume_negation,[status(cth)],[26]) ).
fof(46,negated_conjecture,
~ ( ! [X1] :
( aInteger0(X1)
=> ( ( ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) )
=> ? [X2] :
( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ? [X2] :
( ( ( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) ) )
| aDivisorOf0(X2,X1) )
& isPrime0(X2) )
=> ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
& aElementOf0(X1,sbsmnsldt0(xS)) ) ) ) )
=> ( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ( aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( equal(X1,sz10)
| equal(X1,smndt0(sz10)) ) )
| equal(stldt0(sbsmnsldt0(xS)),cS2076) ) ) ) ),
inference(fof_simplification,[status(thm)],[44,theory(equality)]) ).
cnf(135,plain,
aInteger0(sz10),
inference(split_conjunct,[status(thm)],[17]) ).
fof(191,plain,
! [X1] :
( ~ aInteger0(X1)
| ( ( ! [X2] :
( ~ aDivisorOf0(X2,X1)
| ~ isPrime0(X2) )
| ( ~ equal(X1,sz10)
& ~ equal(X1,smndt0(sz10)) ) )
& ( equal(X1,sz10)
| equal(X1,smndt0(sz10))
| ? [X2] :
( aDivisorOf0(X2,X1)
& isPrime0(X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(192,plain,
! [X3] :
( ~ aInteger0(X3)
| ( ( ! [X4] :
( ~ aDivisorOf0(X4,X3)
| ~ isPrime0(X4) )
| ( ~ equal(X3,sz10)
& ~ equal(X3,smndt0(sz10)) ) )
& ( equal(X3,sz10)
| equal(X3,smndt0(sz10))
| ? [X5] :
( aDivisorOf0(X5,X3)
& isPrime0(X5) ) ) ) ),
inference(variable_rename,[status(thm)],[191]) ).
fof(193,plain,
! [X3] :
( ~ aInteger0(X3)
| ( ( ! [X4] :
( ~ aDivisorOf0(X4,X3)
| ~ isPrime0(X4) )
| ( ~ equal(X3,sz10)
& ~ equal(X3,smndt0(sz10)) ) )
& ( equal(X3,sz10)
| equal(X3,smndt0(sz10))
| ( aDivisorOf0(esk12_1(X3),X3)
& isPrime0(esk12_1(X3)) ) ) ) ),
inference(skolemize,[status(esa)],[192]) ).
fof(194,plain,
! [X3,X4] :
( ( ( ~ aDivisorOf0(X4,X3)
| ~ isPrime0(X4)
| ( ~ equal(X3,sz10)
& ~ equal(X3,smndt0(sz10)) ) )
& ( equal(X3,sz10)
| equal(X3,smndt0(sz10))
| ( aDivisorOf0(esk12_1(X3),X3)
& isPrime0(esk12_1(X3)) ) ) )
| ~ aInteger0(X3) ),
inference(shift_quantors,[status(thm)],[193]) ).
fof(195,plain,
! [X3,X4] :
( ( ~ equal(X3,sz10)
| ~ aDivisorOf0(X4,X3)
| ~ isPrime0(X4)
| ~ aInteger0(X3) )
& ( ~ equal(X3,smndt0(sz10))
| ~ aDivisorOf0(X4,X3)
| ~ isPrime0(X4)
| ~ aInteger0(X3) )
& ( aDivisorOf0(esk12_1(X3),X3)
| equal(X3,sz10)
| equal(X3,smndt0(sz10))
| ~ aInteger0(X3) )
& ( isPrime0(esk12_1(X3))
| equal(X3,sz10)
| equal(X3,smndt0(sz10))
| ~ aInteger0(X3) ) ),
inference(distribute,[status(thm)],[194]) ).
cnf(196,plain,
( X1 = smndt0(sz10)
| X1 = sz10
| isPrime0(esk12_1(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[195]) ).
cnf(197,plain,
( X1 = smndt0(sz10)
| X1 = sz10
| aDivisorOf0(esk12_1(X1),X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[195]) ).
cnf(198,plain,
( ~ aInteger0(X1)
| ~ isPrime0(X2)
| ~ aDivisorOf0(X2,X1)
| X1 != smndt0(sz10) ),
inference(split_conjunct,[status(thm)],[195]) ).
cnf(199,plain,
( ~ aInteger0(X1)
| ~ isPrime0(X2)
| ~ aDivisorOf0(X2,X1)
| X1 != sz10 ),
inference(split_conjunct,[status(thm)],[195]) ).
fof(217,negated_conjecture,
( ! [X1] :
( ~ aInteger0(X1)
| ( ( ( ! [X2] :
( ~ aElementOf0(X2,xS)
| ~ aElementOf0(X1,X2) )
& ~ aElementOf0(X1,sbsmnsldt0(xS)) )
| ? [X2] :
( aInteger0(X2)
& ~ equal(X2,sz00)
& ? [X3] :
( aInteger0(X3)
& equal(sdtasdt0(X2,X3),X1) )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ! [X2] :
( ( ( ~ aInteger0(X2)
| equal(X2,sz00)
| ! [X3] :
( ~ aInteger0(X3)
| ~ equal(sdtasdt0(X2,X3),X1) ) )
& ~ aDivisorOf0(X2,X1) )
| ~ isPrime0(X2) )
| ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
& aElementOf0(X1,sbsmnsldt0(xS)) ) ) ) )
& aSet0(sbsmnsldt0(xS))
& ! [X1] :
( ( ~ aElementOf0(X1,sbsmnsldt0(xS))
| ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) )
& ( ~ aInteger0(X1)
| ! [X2] :
( ~ aElementOf0(X2,xS)
| ~ aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) ) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( ( ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) )
& ( ~ aInteger0(X1)
| aElementOf0(X1,sbsmnsldt0(xS))
| aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ) )
& ? [X1] :
( ( ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| ( ~ equal(X1,sz10)
& ~ equal(X1,smndt0(sz10)) ) )
& ( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| equal(X1,sz10)
| equal(X1,smndt0(sz10)) ) )
& ~ equal(stldt0(sbsmnsldt0(xS)),cS2076) ),
inference(fof_nnf,[status(thm)],[46]) ).
fof(218,negated_conjecture,
( ! [X4] :
( ~ aInteger0(X4)
| ( ( ( ! [X5] :
( ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5) )
& ~ aElementOf0(X4,sbsmnsldt0(xS)) )
| ? [X6] :
( aInteger0(X6)
& ~ equal(X6,sz00)
& ? [X7] :
( aInteger0(X7)
& equal(sdtasdt0(X6,X7),X4) )
& aDivisorOf0(X6,X4)
& isPrime0(X6) ) )
& ( ! [X8] :
( ( ( ~ aInteger0(X8)
| equal(X8,sz00)
| ! [X9] :
( ~ aInteger0(X9)
| ~ equal(sdtasdt0(X8,X9),X4) ) )
& ~ aDivisorOf0(X8,X4) )
| ~ isPrime0(X8) )
| ( ? [X10] :
( aElementOf0(X10,xS)
& aElementOf0(X4,X10) )
& aElementOf0(X4,sbsmnsldt0(xS)) ) ) ) )
& aSet0(sbsmnsldt0(xS))
& ! [X11] :
( ( ~ aElementOf0(X11,sbsmnsldt0(xS))
| ( aInteger0(X11)
& ? [X12] :
( aElementOf0(X12,xS)
& aElementOf0(X11,X12) ) ) )
& ( ~ aInteger0(X11)
| ! [X13] :
( ~ aElementOf0(X13,xS)
| ~ aElementOf0(X11,X13) )
| aElementOf0(X11,sbsmnsldt0(xS)) ) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X14] :
( ( ~ aElementOf0(X14,stldt0(sbsmnsldt0(xS)))
| ( aInteger0(X14)
& ~ aElementOf0(X14,sbsmnsldt0(xS)) ) )
& ( ~ aInteger0(X14)
| aElementOf0(X14,sbsmnsldt0(xS))
| aElementOf0(X14,stldt0(sbsmnsldt0(xS))) ) )
& ? [X15] :
( ( ~ aElementOf0(X15,stldt0(sbsmnsldt0(xS)))
| ( ~ equal(X15,sz10)
& ~ equal(X15,smndt0(sz10)) ) )
& ( aElementOf0(X15,stldt0(sbsmnsldt0(xS)))
| equal(X15,sz10)
| equal(X15,smndt0(sz10)) ) )
& ~ equal(stldt0(sbsmnsldt0(xS)),cS2076) ),
inference(variable_rename,[status(thm)],[217]) ).
fof(219,negated_conjecture,
( ! [X4] :
( ~ aInteger0(X4)
| ( ( ( ! [X5] :
( ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5) )
& ~ aElementOf0(X4,sbsmnsldt0(xS)) )
| ( aInteger0(esk14_1(X4))
& ~ equal(esk14_1(X4),sz00)
& aInteger0(esk15_1(X4))
& equal(sdtasdt0(esk14_1(X4),esk15_1(X4)),X4)
& aDivisorOf0(esk14_1(X4),X4)
& isPrime0(esk14_1(X4)) ) )
& ( ! [X8] :
( ( ( ~ aInteger0(X8)
| equal(X8,sz00)
| ! [X9] :
( ~ aInteger0(X9)
| ~ equal(sdtasdt0(X8,X9),X4) ) )
& ~ aDivisorOf0(X8,X4) )
| ~ isPrime0(X8) )
| ( aElementOf0(esk16_1(X4),xS)
& aElementOf0(X4,esk16_1(X4))
& aElementOf0(X4,sbsmnsldt0(xS)) ) ) ) )
& aSet0(sbsmnsldt0(xS))
& ! [X11] :
( ( ~ aElementOf0(X11,sbsmnsldt0(xS))
| ( aInteger0(X11)
& aElementOf0(esk17_1(X11),xS)
& aElementOf0(X11,esk17_1(X11)) ) )
& ( ~ aInteger0(X11)
| ! [X13] :
( ~ aElementOf0(X13,xS)
| ~ aElementOf0(X11,X13) )
| aElementOf0(X11,sbsmnsldt0(xS)) ) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X14] :
( ( ~ aElementOf0(X14,stldt0(sbsmnsldt0(xS)))
| ( aInteger0(X14)
& ~ aElementOf0(X14,sbsmnsldt0(xS)) ) )
& ( ~ aInteger0(X14)
| aElementOf0(X14,sbsmnsldt0(xS))
| aElementOf0(X14,stldt0(sbsmnsldt0(xS))) ) )
& ( ~ aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS)))
| ( ~ equal(esk18_0,sz10)
& ~ equal(esk18_0,smndt0(sz10)) ) )
& ( aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS)))
| equal(esk18_0,sz10)
| equal(esk18_0,smndt0(sz10)) )
& ~ equal(stldt0(sbsmnsldt0(xS)),cS2076) ),
inference(skolemize,[status(esa)],[218]) ).
fof(220,negated_conjecture,
! [X4,X5,X8,X9,X11,X13,X14] :
( ( ~ aElementOf0(X14,stldt0(sbsmnsldt0(xS)))
| ( aInteger0(X14)
& ~ aElementOf0(X14,sbsmnsldt0(xS)) ) )
& ( ~ aInteger0(X14)
| aElementOf0(X14,sbsmnsldt0(xS))
| aElementOf0(X14,stldt0(sbsmnsldt0(xS))) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ( ~ aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS)))
| ( ~ equal(esk18_0,sz10)
& ~ equal(esk18_0,smndt0(sz10)) ) )
& ( aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS)))
| equal(esk18_0,sz10)
| equal(esk18_0,smndt0(sz10)) )
& ~ equal(stldt0(sbsmnsldt0(xS)),cS2076)
& ( ~ aElementOf0(X13,xS)
| ~ aElementOf0(X11,X13)
| ~ aInteger0(X11)
| aElementOf0(X11,sbsmnsldt0(xS)) )
& ( ~ aElementOf0(X11,sbsmnsldt0(xS))
| ( aInteger0(X11)
& aElementOf0(esk17_1(X11),xS)
& aElementOf0(X11,esk17_1(X11)) ) )
& aSet0(sbsmnsldt0(xS))
& ( ( ( ( ( ~ aInteger0(X9)
| ~ equal(sdtasdt0(X8,X9),X4)
| ~ aInteger0(X8)
| equal(X8,sz00) )
& ~ aDivisorOf0(X8,X4) )
| ~ isPrime0(X8)
| ( aElementOf0(esk16_1(X4),xS)
& aElementOf0(X4,esk16_1(X4))
& aElementOf0(X4,sbsmnsldt0(xS)) ) )
& ( ( ( ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5) )
& ~ aElementOf0(X4,sbsmnsldt0(xS)) )
| ( aInteger0(esk14_1(X4))
& ~ equal(esk14_1(X4),sz00)
& aInteger0(esk15_1(X4))
& equal(sdtasdt0(esk14_1(X4),esk15_1(X4)),X4)
& aDivisorOf0(esk14_1(X4),X4)
& isPrime0(esk14_1(X4)) ) ) )
| ~ aInteger0(X4) ) ),
inference(shift_quantors,[status(thm)],[219]) ).
fof(221,negated_conjecture,
! [X4,X5,X8,X9,X11,X13,X14] :
( ( aInteger0(X14)
| ~ aElementOf0(X14,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X14,sbsmnsldt0(xS))
| ~ aElementOf0(X14,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X14)
| aElementOf0(X14,sbsmnsldt0(xS))
| aElementOf0(X14,stldt0(sbsmnsldt0(xS))) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ( ~ equal(esk18_0,sz10)
| ~ aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS))) )
& ( ~ equal(esk18_0,smndt0(sz10))
| ~ aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS))) )
& ( aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS)))
| equal(esk18_0,sz10)
| equal(esk18_0,smndt0(sz10)) )
& ~ equal(stldt0(sbsmnsldt0(xS)),cS2076)
& ( ~ aElementOf0(X13,xS)
| ~ aElementOf0(X11,X13)
| ~ aInteger0(X11)
| aElementOf0(X11,sbsmnsldt0(xS)) )
& ( aInteger0(X11)
| ~ aElementOf0(X11,sbsmnsldt0(xS)) )
& ( aElementOf0(esk17_1(X11),xS)
| ~ aElementOf0(X11,sbsmnsldt0(xS)) )
& ( aElementOf0(X11,esk17_1(X11))
| ~ aElementOf0(X11,sbsmnsldt0(xS)) )
& aSet0(sbsmnsldt0(xS))
& ( aElementOf0(esk16_1(X4),xS)
| ~ aInteger0(X9)
| ~ equal(sdtasdt0(X8,X9),X4)
| ~ aInteger0(X8)
| equal(X8,sz00)
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(X4,esk16_1(X4))
| ~ aInteger0(X9)
| ~ equal(sdtasdt0(X8,X9),X4)
| ~ aInteger0(X8)
| equal(X8,sz00)
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X9)
| ~ equal(sdtasdt0(X8,X9),X4)
| ~ aInteger0(X8)
| equal(X8,sz00)
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(esk16_1(X4),xS)
| ~ aDivisorOf0(X8,X4)
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(X4,esk16_1(X4))
| ~ aDivisorOf0(X8,X4)
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(X4,sbsmnsldt0(xS))
| ~ aDivisorOf0(X8,X4)
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aInteger0(esk14_1(X4))
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( ~ equal(esk14_1(X4),sz00)
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( aInteger0(esk15_1(X4))
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( equal(sdtasdt0(esk14_1(X4),esk15_1(X4)),X4)
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( aDivisorOf0(esk14_1(X4),X4)
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( isPrime0(esk14_1(X4))
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( aInteger0(esk14_1(X4))
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( ~ equal(esk14_1(X4),sz00)
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( aInteger0(esk15_1(X4))
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( equal(sdtasdt0(esk14_1(X4),esk15_1(X4)),X4)
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( aDivisorOf0(esk14_1(X4),X4)
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( isPrime0(esk14_1(X4))
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) ) ),
inference(distribute,[status(thm)],[220]) ).
cnf(222,negated_conjecture,
( isPrime0(esk14_1(X1))
| ~ aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[221]) ).
cnf(223,negated_conjecture,
( aDivisorOf0(esk14_1(X1),X1)
| ~ aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[221]) ).
cnf(234,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1)
| ~ isPrime0(X2)
| ~ aDivisorOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[221]) ).
cnf(243,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[221]) ).
cnf(246,negated_conjecture,
( esk18_0 = smndt0(sz10)
| esk18_0 = sz10
| aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[221]) ).
cnf(247,negated_conjecture,
( ~ aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS)))
| esk18_0 != smndt0(sz10) ),
inference(split_conjunct,[status(thm)],[221]) ).
cnf(248,negated_conjecture,
( ~ aElementOf0(esk18_0,stldt0(sbsmnsldt0(xS)))
| esk18_0 != sz10 ),
inference(split_conjunct,[status(thm)],[221]) ).
cnf(250,negated_conjecture,
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[221]) ).
cnf(251,negated_conjecture,
( ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[221]) ).
cnf(252,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[221]) ).
fof(295,plain,
! [X1] :
( ~ aInteger0(X1)
| aInteger0(smndt0(X1)) ),
inference(fof_nnf,[status(thm)],[32]) ).
fof(296,plain,
! [X2] :
( ~ aInteger0(X2)
| aInteger0(smndt0(X2)) ),
inference(variable_rename,[status(thm)],[295]) ).
cnf(297,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[296]) ).
cnf(359,negated_conjecture,
( aInteger0(esk18_0)
| smndt0(sz10) = esk18_0
| esk18_0 = sz10 ),
inference(spm,[status(thm)],[252,246,theory(equality)]) ).
cnf(369,negated_conjecture,
( isPrime0(esk14_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[222,243]) ).
cnf(390,negated_conjecture,
( smndt0(sz10) = esk18_0
| esk18_0 = sz10
| ~ aElementOf0(esk18_0,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[251,246,theory(equality)]) ).
cnf(392,negated_conjecture,
( aElementOf0(esk18_0,sbsmnsldt0(xS))
| esk18_0 != sz10
| ~ aInteger0(esk18_0) ),
inference(spm,[status(thm)],[248,250,theory(equality)]) ).
cnf(393,negated_conjecture,
( aElementOf0(esk18_0,sbsmnsldt0(xS))
| smndt0(sz10) != esk18_0
| ~ aInteger0(esk18_0) ),
inference(spm,[status(thm)],[247,250,theory(equality)]) ).
cnf(395,negated_conjecture,
( aDivisorOf0(esk14_1(X1),X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[223,243]) ).
cnf(398,negated_conjecture,
( sz10 != X1
| ~ isPrime0(esk14_1(X1))
| ~ aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[199,395,theory(equality)]) ).
cnf(403,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(xS))
| smndt0(sz10) = X1
| sz10 = X1
| ~ isPrime0(esk12_1(X1))
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[234,197,theory(equality)]) ).
cnf(404,negated_conjecture,
( smndt0(sz10) != X1
| ~ isPrime0(esk14_1(X1))
| ~ aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[198,395,theory(equality)]) ).
cnf(1207,negated_conjecture,
( aInteger0(esk18_0)
| esk18_0 = sz10
| ~ aInteger0(sz10) ),
inference(spm,[status(thm)],[297,359,theory(equality)]) ).
cnf(1215,negated_conjecture,
( aInteger0(esk18_0)
| esk18_0 = sz10
| $false ),
inference(rw,[status(thm)],[1207,135,theory(equality)]) ).
cnf(1216,negated_conjecture,
( aInteger0(esk18_0)
| esk18_0 = sz10 ),
inference(cn,[status(thm)],[1215,theory(equality)]) ).
cnf(1293,negated_conjecture,
( sz10 != X1
| ~ isPrime0(esk14_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[398,243]) ).
cnf(1294,negated_conjecture,
( sz10 != X1
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[1293,369]) ).
cnf(1299,negated_conjecture,
( sz10 != esk18_0
| ~ aInteger0(esk18_0) ),
inference(spm,[status(thm)],[1294,392,theory(equality)]) ).
cnf(1351,negated_conjecture,
( smndt0(sz10) != X1
| ~ isPrime0(esk14_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[404,243]) ).
cnf(1352,negated_conjecture,
( smndt0(sz10) != X1
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[1351,369]) ).
cnf(1697,negated_conjecture,
( smndt0(sz10) = X1
| sz10 = X1
| aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[403,196]) ).
cnf(1709,negated_conjecture,
( smndt0(sz10) = esk18_0
| sz10 = esk18_0
| aElementOf0(esk18_0,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[1697,1216,theory(equality)]) ).
cnf(1750,negated_conjecture,
( smndt0(sz10) = esk18_0
| esk18_0 = sz10 ),
inference(csr,[status(thm)],[1709,390]) ).
cnf(1758,negated_conjecture,
( aElementOf0(esk18_0,sbsmnsldt0(xS))
| esk18_0 = sz10
| ~ aInteger0(esk18_0) ),
inference(spm,[status(thm)],[393,1750,theory(equality)]) ).
cnf(1797,negated_conjecture,
( esk18_0 = sz10
| aElementOf0(esk18_0,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[1758,1216]) ).
cnf(1805,negated_conjecture,
( esk18_0 = sz10
| smndt0(sz10) != esk18_0 ),
inference(spm,[status(thm)],[1352,1797,theory(equality)]) ).
cnf(1808,negated_conjecture,
esk18_0 = sz10,
inference(csr,[status(thm)],[1805,1750]) ).
cnf(1832,negated_conjecture,
( $false
| ~ aInteger0(esk18_0) ),
inference(rw,[status(thm)],[1299,1808,theory(equality)]) ).
cnf(1833,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1832,1808,theory(equality)]),135,theory(equality)]) ).
cnf(1834,negated_conjecture,
$false,
inference(cn,[status(thm)],[1833,theory(equality)]) ).
cnf(1835,negated_conjecture,
$false,
1834,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM448+5 : TPTP v7.0.0. Released v4.0.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.24 % Computer : n095.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.625MB
% 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Fri Jan 5 05:18:00 CST 2018
% 0.02/0.24 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.29 --creating new selector for []
% 0.06/0.41 -running prover on /export/starexec/sandbox2/tmp/tmpeS9xqD/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.41 -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/tmpeS9xqD/sel_theBenchmark.p_1']
% 0.06/0.41 -prover status Theorem
% 0.06/0.41 Problem theBenchmark.p solved in phase 0.
% 0.06/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.41 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.41 Solved 1 out of 1.
% 0.06/0.41 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.41 # SZS status Theorem
% 0.06/0.41 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.41 # SZS output end CNFRefutation
%------------------------------------------------------------------------------