TSTP Solution File: NUM448+5 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM448+5 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 09:32:32 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 51 ( 6 unt; 0 def)
% Number of atoms : 433 ( 95 equ)
% Maximal formula atoms : 102 ( 8 avg)
% Number of connectives : 587 ( 205 ~; 233 |; 121 &)
% ( 7 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 42 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 6 con; 0-3 aty)
% Number of variables : 81 ( 5 sgn 34 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1] :
( aInteger0(X1)
=> ( ( ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) )
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ? [X2] :
( ( ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& 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)))
<=> ( X1 = sz10
| X1 = smndt0(sz10) ) )
| stldt0(sbsmnsldt0(xS)) = cS2076 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__2046,hypothesis,
( aSet0(xS)
& ! [X1] :
( ( aElementOf0(X1,xS)
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& isPrime0(X2)
& aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
& sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
| sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2)) ) )
& szAzrzSzezqlpdtcmdtrp0(sz00,X2) = X1 ) )
& ( ? [X2] :
( aInteger0(X2)
& X2 != sz00
& isPrime0(X2)
& ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
& sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(sz00)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(sz00)))
| sdteqdtlpzmzozddtrp0(X3,sz00,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(sz00,X2)) ) ) )
=> szAzrzSzezqlpdtcmdtrp0(sz00,X2) = X1 ) )
=> aElementOf0(X1,xS) ) )
& xS = cS2043 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2046) ).
fof(mPrimeDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ( ? [X2] :
( aDivisorOf0(X2,X1)
& isPrime0(X2) )
<=> ( X1 != sz10
& X1 != smndt0(sz10) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mPrimeDivisor) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntNeg) ).
fof(mIntOne,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntOne) ).
fof(c_0_5,negated_conjecture,
~ ( ! [X1] :
( aInteger0(X1)
=> ( ( ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) )
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ? [X2] :
( ( ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& 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)))
<=> ( X1 = sz10
| X1 = smndt0(sz10) ) )
| stldt0(sbsmnsldt0(xS)) = cS2076 ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X4,X5,X8,X9,X11,X11,X13,X14,X14] :
( ( aInteger0(esk4_1(X4))
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( esk4_1(X4) != sz00
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( aInteger0(esk5_1(X4))
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( sdtasdt0(esk4_1(X4),esk5_1(X4)) = X4
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( aDivisorOf0(esk4_1(X4),X4)
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( isPrime0(esk4_1(X4))
| ~ aElementOf0(X5,xS)
| ~ aElementOf0(X4,X5)
| ~ aInteger0(X4) )
& ( aInteger0(esk4_1(X4))
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( esk4_1(X4) != sz00
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( aInteger0(esk5_1(X4))
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( sdtasdt0(esk4_1(X4),esk5_1(X4)) = X4
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( aDivisorOf0(esk4_1(X4),X4)
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( isPrime0(esk4_1(X4))
| ~ aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X4) )
& ( aElementOf0(esk6_1(X4),xS)
| ~ aInteger0(X8)
| X8 = sz00
| ~ aInteger0(X9)
| sdtasdt0(X8,X9) != X4
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(X4,esk6_1(X4))
| ~ aInteger0(X8)
| X8 = sz00
| ~ aInteger0(X9)
| sdtasdt0(X8,X9) != X4
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(X4,sbsmnsldt0(xS))
| ~ aInteger0(X8)
| X8 = sz00
| ~ aInteger0(X9)
| sdtasdt0(X8,X9) != X4
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(esk6_1(X4),xS)
| ~ aDivisorOf0(X8,X4)
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(X4,esk6_1(X4))
| ~ aDivisorOf0(X8,X4)
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& ( aElementOf0(X4,sbsmnsldt0(xS))
| ~ aDivisorOf0(X8,X4)
| ~ isPrime0(X8)
| ~ aInteger0(X4) )
& aSet0(sbsmnsldt0(xS))
& ( aInteger0(X11)
| ~ aElementOf0(X11,sbsmnsldt0(xS)) )
& ( aElementOf0(esk7_1(X11),xS)
| ~ aElementOf0(X11,sbsmnsldt0(xS)) )
& ( aElementOf0(X11,esk7_1(X11))
| ~ aElementOf0(X11,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X11)
| ~ aElementOf0(X13,xS)
| ~ aElementOf0(X11,X13)
| aElementOf0(X11,sbsmnsldt0(xS)) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ( 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))) )
& ( esk8_0 != sz10
| ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS))) )
& ( esk8_0 != smndt0(sz10)
| ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS))) )
& ( aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS)))
| esk8_0 = sz10
| esk8_0 = smndt0(sz10) )
& stldt0(sbsmnsldt0(xS)) != cS2076 ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])])])])]) ).
fof(c_0_7,hypothesis,
! [X5,X7,X7,X9,X5,X10,X11,X11,X13] :
( aSet0(xS)
& ( aInteger0(esk1_1(X5))
| ~ aElementOf0(X5,xS) )
& ( esk1_1(X5) != sz00
| ~ aElementOf0(X5,xS) )
& ( isPrime0(esk1_1(X5))
| ~ aElementOf0(X5,xS) )
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aInteger0(X7)
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aInteger0(esk2_2(X5,X7))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( sdtasdt0(esk1_1(X5),esk2_2(X5,X7)) = sdtpldt0(X7,smndt0(sz00))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aDivisorOf0(esk1_1(X5),sdtpldt0(X7,smndt0(sz00)))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( sdteqdtlpzmzozddtrp0(X7,sz00,esk1_1(X5))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ aInteger0(X9)
| sdtasdt0(esk1_1(X5),X9) != sdtpldt0(X7,smndt0(sz00))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ aDivisorOf0(esk1_1(X5),sdtpldt0(X7,smndt0(sz00)))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ sdteqdtlpzmzozddtrp0(X7,sz00,esk1_1(X5))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( szAzrzSzezqlpdtcmdtrp0(sz00,esk1_1(X5)) = X5
| ~ aElementOf0(X5,xS) )
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( aInteger0(X11)
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( aInteger0(esk3_3(X5,X10,X11))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( sdtasdt0(X10,esk3_3(X5,X10,X11)) = sdtpldt0(X11,smndt0(sz00))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( aDivisorOf0(X10,sdtpldt0(X11,smndt0(sz00)))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( sdteqdtlpzmzozddtrp0(X11,sz00,X10)
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( ~ aInteger0(X13)
| sdtasdt0(X10,X13) != sdtpldt0(X11,smndt0(sz00))
| ~ aInteger0(X11)
| aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( ~ aDivisorOf0(X10,sdtpldt0(X11,smndt0(sz00)))
| ~ aInteger0(X11)
| aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( ~ sdteqdtlpzmzozddtrp0(X11,sz00,X10)
| ~ aInteger0(X11)
| aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( szAzrzSzezqlpdtcmdtrp0(sz00,X10) != X5
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& xS = cS2043 ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2046])])])])])])]) ).
cnf(c_0_8,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
xS = cS2043,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( esk8_0 = smndt0(sz10)
| esk8_0 = sz10
| aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1)
| ~ isPrime0(X2)
| ~ aDivisorOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ( X3 != sz10
| ~ aDivisorOf0(X4,X3)
| ~ isPrime0(X4)
| ~ aInteger0(X3) )
& ( X3 != smndt0(sz10)
| ~ aDivisorOf0(X4,X3)
| ~ isPrime0(X4)
| ~ aInteger0(X3) )
& ( aDivisorOf0(esk14_1(X3),X3)
| X3 = sz10
| X3 = smndt0(sz10)
| ~ aInteger0(X3) )
& ( isPrime0(esk14_1(X3))
| X3 = sz10
| X3 = smndt0(sz10)
| ~ aInteger0(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mPrimeDivisor])])])])])])]) ).
fof(c_0_13,plain,
! [X2] :
( ~ aInteger0(X2)
| aInteger0(smndt0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
cnf(c_0_14,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(cS2043))) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( smndt0(sz10) = esk8_0
| sz10 = esk8_0
| aElementOf0(esk8_0,stldt0(sbsmnsldt0(cS2043))) ),
inference(rw,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS)))
| esk8_0 != smndt0(sz10) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(cS2043))
| ~ isPrime0(X2)
| ~ aDivisorOf0(X2,X1)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_21,plain,
( X1 = smndt0(sz10)
| X1 = sz10
| aDivisorOf0(esk14_1(X1),X1)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( X1 = smndt0(sz10)
| X1 = sz10
| isPrime0(esk14_1(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( smndt0(sz10) = esk8_0
| sz10 = esk8_0
| aInteger0(esk8_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_25,plain,
aInteger0(sz10),
inference(split_conjunct,[status(thm)],[mIntOne]) ).
cnf(c_0_26,negated_conjecture,
( ~ aElementOf0(X1,stldt0(sbsmnsldt0(cS2043)))
| ~ aElementOf0(X1,sbsmnsldt0(cS2043)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_9]),c_0_9]) ).
cnf(c_0_27,negated_conjecture,
( aDivisorOf0(esk4_1(X1),X1)
| ~ aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(cS2043)) ),
inference(rw,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_29,negated_conjecture,
( isPrime0(esk4_1(X1))
| ~ aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
( smndt0(sz10) != esk8_0
| ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(cS2043))) ),
inference(rw,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_31,negated_conjecture,
( aElementOf0(X1,stldt0(sbsmnsldt0(cS2043)))
| aElementOf0(X1,sbsmnsldt0(cS2043))
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_9]),c_0_9]) ).
cnf(c_0_32,negated_conjecture,
( X1 = smndt0(sz10)
| X1 = sz10
| aElementOf0(X1,sbsmnsldt0(cS2043))
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_33,negated_conjecture,
( sz10 = esk8_0
| aInteger0(esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_34,negated_conjecture,
( smndt0(sz10) = esk8_0
| sz10 = esk8_0
| ~ aElementOf0(esk8_0,sbsmnsldt0(cS2043)) ),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS)))
| esk8_0 != sz10 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_36,plain,
( ~ aInteger0(X1)
| ~ isPrime0(X2)
| ~ aDivisorOf0(X2,X1)
| X1 != smndt0(sz10) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,negated_conjecture,
( aDivisorOf0(esk4_1(X1),X1)
| ~ aElementOf0(X1,sbsmnsldt0(cS2043)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_9]),c_0_28]) ).
cnf(c_0_38,negated_conjecture,
( isPrime0(esk4_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(cS2043)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_9]),c_0_28]) ).
cnf(c_0_39,negated_conjecture,
( aElementOf0(esk8_0,sbsmnsldt0(cS2043))
| smndt0(sz10) != esk8_0
| ~ aInteger0(esk8_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,negated_conjecture,
( smndt0(sz10) = esk8_0
| sz10 = esk8_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_41,plain,
( ~ aInteger0(X1)
| ~ isPrime0(X2)
| ~ aDivisorOf0(X2,X1)
| X1 != sz10 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_42,negated_conjecture,
( sz10 != esk8_0
| ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(cS2043))) ),
inference(rw,[status(thm)],[c_0_35,c_0_9]) ).
cnf(c_0_43,negated_conjecture,
( X1 != smndt0(sz10)
| ~ aElementOf0(X1,sbsmnsldt0(cS2043)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_28]),c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( sz10 = esk8_0
| aElementOf0(esk8_0,sbsmnsldt0(cS2043)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( X1 != sz10
| ~ aElementOf0(X1,sbsmnsldt0(cS2043)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_37]),c_0_28]),c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( aElementOf0(esk8_0,sbsmnsldt0(cS2043))
| sz10 != esk8_0
| ~ aInteger0(esk8_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_31]) ).
cnf(c_0_47,negated_conjecture,
sz10 = esk8_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( sz10 != esk8_0
| ~ aInteger0(esk8_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
aInteger0(esk8_0),
inference(rw,[status(thm)],[c_0_25,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_47])]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM448+5 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 18:04:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.035 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 51
% 0.22/1.41 # Proof object clause steps : 41
% 0.22/1.41 # Proof object formula steps : 10
% 0.22/1.41 # Proof object conjectures : 36
% 0.22/1.41 # Proof object clause conjectures : 33
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 17
% 0.22/1.41 # Proof object initial formulas used : 5
% 0.22/1.41 # Proof object generating inferences : 12
% 0.22/1.41 # Proof object simplifying inferences : 29
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 43
% 0.22/1.41 # Removed by relevancy pruning/SinE : 6
% 0.22/1.41 # Initial clauses : 145
% 0.22/1.41 # Removed in clause preprocessing : 4
% 0.22/1.41 # Initial clauses in saturation : 141
% 0.22/1.41 # Processed clauses : 311
% 0.22/1.41 # ...of these trivial : 2
% 0.22/1.41 # ...subsumed : 83
% 0.22/1.41 # ...remaining for further processing : 225
% 0.22/1.41 # Other redundant clauses eliminated : 28
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 10
% 0.22/1.41 # Backward-rewritten : 65
% 0.22/1.41 # Generated clauses : 1215
% 0.22/1.41 # ...of the previous two non-trivial : 1115
% 0.22/1.41 # Contextual simplify-reflections : 78
% 0.22/1.41 # Paramodulations : 1173
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 42
% 0.22/1.41 # Current number of processed clauses : 150
% 0.22/1.41 # Positive orientable unit clauses : 9
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 1
% 0.22/1.41 # Non-unit-clauses : 140
% 0.22/1.41 # Current number of unprocessed clauses: 499
% 0.22/1.41 # ...number of literals in the above : 2977
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 75
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 8752
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 2070
% 0.22/1.41 # Non-unit clause-clause subsumptions : 171
% 0.22/1.41 # Unit Clause-clause subsumption calls : 105
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 3
% 0.22/1.41 # BW rewrite match successes : 3
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 31665
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.169 s
% 0.22/1.41 # System time : 0.003 s
% 0.22/1.41 # Total time : 0.172 s
% 0.22/1.41 # Maximum resident set size: 4604 pages
% 0.22/23.42 eprover: CPU time limit exceeded, terminating
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.49 eprover: No such file or directory
% 0.22/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------