TSTP Solution File: NUM449+6 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM449+6 : 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.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 334 ( 54 equ)
% Maximal formula atoms : 102 ( 12 avg)
% Number of connectives : 442 ( 135 ~; 171 |; 108 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 5 con; 0-3 aty)
% Number of variables : 64 ( 6 sgn 38 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mArSeqClosed,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2)
& X2 != sz00 )
=> ( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X1,X2),cS1395)
& isClosed0(szAzrzSzezqlpdtcmdtrp0(X1,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mArSeqClosed) ).
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',m__2046) ).
fof(m__,conjecture,
( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) )
=> ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(X1,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(X1)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(X1)))
& sdteqdtlpzmzozddtrp0(X3,X1,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(X1)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(X1)))
| sdteqdtlpzmzozddtrp0(X3,X1,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2)) ) ) )
=> ( ! [X3] :
( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2))
=> aElementOf0(X3,stldt0(sbsmnsldt0(xS))) )
| aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X1,X2),stldt0(sbsmnsldt0(xS))) ) ) ) )
| isOpen0(stldt0(sbsmnsldt0(xS))) ) )
| isClosed0(sbsmnsldt0(xS)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).
fof(mUnionSClosed,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( aSubsetOf0(X2,cS1395)
& isClosed0(X2) ) ) )
=> isClosed0(sbsmnsldt0(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mUnionSClosed) ).
fof(mIntZero,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mIntZero) ).
fof(m__2117,hypothesis,
isFinite0(xS),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__2117) ).
fof(c_0_6,plain,
! [X3,X4] :
( ( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X3,X4),cS1395)
| ~ aInteger0(X3)
| ~ aInteger0(X4)
| X4 = sz00 )
& ( isClosed0(szAzrzSzezqlpdtcmdtrp0(X3,X4))
| ~ aInteger0(X3)
| ~ aInteger0(X4)
| X4 = sz00 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArSeqClosed])])]) ).
fof(c_0_7,hypothesis,
! [X5,X7,X7,X9,X5,X10,X11,X11,X13] :
( aSet0(xS)
& ( aInteger0(esk16_1(X5))
| ~ aElementOf0(X5,xS) )
& ( esk16_1(X5) != sz00
| ~ aElementOf0(X5,xS) )
& ( isPrime0(esk16_1(X5))
| ~ aElementOf0(X5,xS) )
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aInteger0(X7)
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aInteger0(esk17_2(X5,X7))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( sdtasdt0(esk16_1(X5),esk17_2(X5,X7)) = sdtpldt0(X7,smndt0(sz00))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( aDivisorOf0(esk16_1(X5),sdtpldt0(X7,smndt0(sz00)))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( sdteqdtlpzmzozddtrp0(X7,sz00,esk16_1(X5))
| ~ aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ aInteger0(X9)
| sdtasdt0(esk16_1(X5),X9) != sdtpldt0(X7,smndt0(sz00))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ aDivisorOf0(esk16_1(X5),sdtpldt0(X7,smndt0(sz00)))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( ~ sdteqdtlpzmzozddtrp0(X7,sz00,esk16_1(X5))
| ~ aInteger0(X7)
| aElementOf0(X7,szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X5)))
| ~ aElementOf0(X5,xS) )
& ( szAzrzSzezqlpdtcmdtrp0(sz00,esk16_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(esk18_3(X5,X10,X11))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(sz00,X10))
| ~ aInteger0(X10)
| X10 = sz00
| ~ isPrime0(X10)
| aElementOf0(X5,xS) )
& ( sdtasdt0(X10,esk18_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])])])])])])]) ).
fof(c_0_8,negated_conjecture,
~ ( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) )
=> ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ( ( aSet0(szAzrzSzezqlpdtcmdtrp0(X1,X2))
& ! [X3] :
( ( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2))
=> ( aInteger0(X3)
& ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(X1)) )
& aDivisorOf0(X2,sdtpldt0(X3,smndt0(X1)))
& sdteqdtlpzmzozddtrp0(X3,X1,X2) ) )
& ( ( aInteger0(X3)
& ( ? [X4] :
( aInteger0(X4)
& sdtasdt0(X2,X4) = sdtpldt0(X3,smndt0(X1)) )
| aDivisorOf0(X2,sdtpldt0(X3,smndt0(X1)))
| sdteqdtlpzmzozddtrp0(X3,X1,X2) ) )
=> aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2)) ) ) )
=> ( ! [X3] :
( aElementOf0(X3,szAzrzSzezqlpdtcmdtrp0(X1,X2))
=> aElementOf0(X3,stldt0(sbsmnsldt0(xS))) )
| aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X1,X2),stldt0(sbsmnsldt0(xS))) ) ) ) )
| isOpen0(stldt0(sbsmnsldt0(xS))) ) )
| isClosed0(sbsmnsldt0(xS)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,plain,
! [X3] :
( ( aElementOf0(esk15_1(X3),X3)
| ~ aSet0(X3)
| ~ isFinite0(X3)
| isClosed0(sbsmnsldt0(X3)) )
& ( ~ aSubsetOf0(esk15_1(X3),cS1395)
| ~ isClosed0(esk15_1(X3))
| ~ aSet0(X3)
| ~ isFinite0(X3)
| isClosed0(sbsmnsldt0(X3)) ) ),
inference(distribute,[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)],[mUnionSClosed])])])])])]) ).
cnf(c_0_10,plain,
( X1 = sz00
| isClosed0(szAzrzSzezqlpdtcmdtrp0(X2,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( szAzrzSzezqlpdtcmdtrp0(sz00,esk16_1(X1)) = X1
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
aInteger0(sz00),
inference(split_conjunct,[status(thm)],[mIntZero]) ).
cnf(c_0_13,hypothesis,
( aInteger0(esk16_1(X1))
| ~ aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X1,xS)
| esk16_1(X1) != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( X1 = sz00
| aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X2,X1),cS1395)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_16,negated_conjecture,
! [X5,X5,X7,X8,X8,X10,X11,X11,X13] :
( aSet0(sbsmnsldt0(xS))
& ( aInteger0(X5)
| ~ aElementOf0(X5,sbsmnsldt0(xS)) )
& ( aElementOf0(esk20_1(X5),xS)
| ~ aElementOf0(X5,sbsmnsldt0(xS)) )
& ( aElementOf0(X5,esk20_1(X5))
| ~ aElementOf0(X5,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X5)
| ~ aElementOf0(X7,xS)
| ~ aElementOf0(X5,X7)
| aElementOf0(X5,sbsmnsldt0(xS)) )
& ( aInteger0(X8)
| ~ aElementOf0(X8,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X8,sbsmnsldt0(xS))
| ~ aElementOf0(X8,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X8)
| aElementOf0(X8,sbsmnsldt0(xS))
| aElementOf0(X8,stldt0(sbsmnsldt0(xS))) )
& aElementOf0(esk21_0,stldt0(sbsmnsldt0(xS)))
& ( aSet0(szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( aInteger0(X11)
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( aInteger0(esk22_2(X10,X11))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( sdtasdt0(X10,esk22_2(X10,X11)) = sdtpldt0(X11,smndt0(esk21_0))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( aDivisorOf0(X10,sdtpldt0(X11,smndt0(esk21_0)))
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( sdteqdtlpzmzozddtrp0(X11,esk21_0,X10)
| ~ aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( ~ aInteger0(X13)
| sdtasdt0(X10,X13) != sdtpldt0(X11,smndt0(esk21_0))
| ~ aInteger0(X11)
| aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( ~ aDivisorOf0(X10,sdtpldt0(X11,smndt0(esk21_0)))
| ~ aInteger0(X11)
| aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( ~ sdteqdtlpzmzozddtrp0(X11,esk21_0,X10)
| ~ aInteger0(X11)
| aElementOf0(X11,szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( aElementOf0(esk23_1(X10),szAzrzSzezqlpdtcmdtrp0(esk21_0,X10))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( ~ aElementOf0(esk23_1(X10),stldt0(sbsmnsldt0(xS)))
| ~ aInteger0(X10)
| X10 = sz00 )
& ( ~ aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(esk21_0,X10),stldt0(sbsmnsldt0(xS)))
| ~ aInteger0(X10)
| X10 = sz00 )
& ~ isOpen0(stldt0(sbsmnsldt0(xS)))
& ~ isClosed0(sbsmnsldt0(xS)) ),
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_8])])])])])])])]) ).
cnf(c_0_17,plain,
( isClosed0(sbsmnsldt0(X1))
| ~ isFinite0(X1)
| ~ aSet0(X1)
| ~ isClosed0(esk15_1(X1))
| ~ aSubsetOf0(esk15_1(X1),cS1395) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,hypothesis,
( isClosed0(X1)
| ~ aElementOf0(X1,xS) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),c_0_14]) ).
cnf(c_0_19,hypothesis,
( aSubsetOf0(X1,cS1395)
| ~ aElementOf0(X1,xS) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_12])]),c_0_13]),c_0_14]) ).
cnf(c_0_20,plain,
( isClosed0(sbsmnsldt0(X1))
| aElementOf0(esk15_1(X1),X1)
| ~ isFinite0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,hypothesis,
isFinite0(xS),
inference(split_conjunct,[status(thm)],[m__2117]) ).
cnf(c_0_22,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
~ isClosed0(sbsmnsldt0(xS)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,hypothesis,
( isClosed0(sbsmnsldt0(X1))
| ~ isFinite0(X1)
| ~ aElementOf0(esk15_1(X1),xS)
| ~ aSet0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,hypothesis,
aElementOf0(esk15_1(xS),xS),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]),c_0_25]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM449+6 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jul 8 01:04:00 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.26/1.44 # Preprocessing time : 0.025 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 27
% 0.26/1.44 # Proof object clause steps : 16
% 0.26/1.44 # Proof object formula steps : 11
% 0.26/1.44 # Proof object conjectures : 5
% 0.26/1.44 # Proof object clause conjectures : 2
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 11
% 0.26/1.44 # Proof object initial formulas used : 6
% 0.26/1.44 # Proof object generating inferences : 5
% 0.26/1.44 # Proof object simplifying inferences : 16
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 45
% 0.26/1.44 # Removed by relevancy pruning/SinE : 0
% 0.26/1.44 # Initial clauses : 174
% 0.26/1.44 # Removed in clause preprocessing : 5
% 0.26/1.44 # Initial clauses in saturation : 169
% 0.26/1.44 # Processed clauses : 3577
% 0.26/1.44 # ...of these trivial : 54
% 0.26/1.44 # ...subsumed : 2019
% 0.26/1.44 # ...remaining for further processing : 1504
% 0.26/1.44 # Other redundant clauses eliminated : 24
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 194
% 0.26/1.44 # Backward-rewritten : 48
% 0.26/1.44 # Generated clauses : 26697
% 0.26/1.44 # ...of the previous two non-trivial : 24261
% 0.26/1.44 # Contextual simplify-reflections : 2149
% 0.26/1.44 # Paramodulations : 26602
% 0.26/1.44 # Factorizations : 7
% 0.26/1.44 # Equation resolutions : 86
% 0.26/1.44 # Current number of processed clauses : 1260
% 0.26/1.44 # Positive orientable unit clauses : 67
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 7
% 0.26/1.44 # Non-unit-clauses : 1186
% 0.26/1.44 # Current number of unprocessed clauses: 18972
% 0.26/1.44 # ...number of literals in the above : 117430
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 244
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 584964
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 136722
% 0.26/1.44 # Non-unit clause-clause subsumptions : 3762
% 0.26/1.44 # Unit Clause-clause subsumption calls : 5081
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 21
% 0.26/1.44 # BW rewrite match successes : 5
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 587316
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.695 s
% 0.26/1.44 # System time : 0.019 s
% 0.26/1.44 # Total time : 0.714 s
% 0.26/1.44 # Maximum resident set size: 25712 pages
% 0.26/23.43 eprover: CPU time limit exceeded, terminating
% 0.26/23.44 eprover: CPU time limit exceeded, terminating
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------