TSTP Solution File: NUM569+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM569+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:45 EDT 2023
% Result : Theorem 47.60s 6.73s
% Output : CNFRefutation 47.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 6 unt; 0 def)
% Number of atoms : 378 ( 39 equ)
% Maximal formula atoms : 181 ( 7 avg)
% Number of connectives : 537 ( 207 ~; 235 |; 74 &)
% ( 1 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 45 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn; 26 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ! [X2] :
( aElementOf0(X2,szNzAzT0)
=> ( iLess0(X2,X1)
=> ( aSet0(sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> aElementOf0(X3,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X2)) ) ) )
=> ( ( ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) ) )
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
& isCountable0(sdtlpdtrp0(xN,X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wEIcHkbAaP/E---3.1_15678.p',m__) ).
fof(mNatExtra,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( X1 = sz00
| ? [X2] :
( aElementOf0(X2,szNzAzT0)
& X1 = szszuzczcdt0(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wEIcHkbAaP/E---3.1_15678.p',mNatExtra) ).
fof(m__3623,hypothesis,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( ( ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) ) )
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X2) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( aElement0(X2)
& aElementOf0(X2,sdtlpdtrp0(xN,X1))
& X2 != szmzizndt0(sdtlpdtrp0(xN,X1)) ) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
=> aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.wEIcHkbAaP/E---3.1_15678.p',m__3623) ).
fof(mIH,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> iLess0(X1,szszuzczcdt0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.wEIcHkbAaP/E---3.1_15678.p',mIH) ).
fof(m__3435,hypothesis,
( aSet0(xS)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/tmp/tmp.wEIcHkbAaP/E---3.1_15678.p',m__3435) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ! [X2] :
( aElementOf0(X2,szNzAzT0)
=> ( iLess0(X2,X1)
=> ( aSet0(sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X2))
=> aElementOf0(X3,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X2)) ) ) )
=> ( ( ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) ) )
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
& isCountable0(sdtlpdtrp0(xN,X1)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X58] :
( ( aElementOf0(esk5_1(X58),szNzAzT0)
| X58 = sz00
| ~ aElementOf0(X58,szNzAzT0) )
& ( X58 = szszuzczcdt0(esk5_1(X58))
| X58 = sz00
| ~ aElementOf0(X58,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNatExtra])])])]) ).
fof(c_0_7,negated_conjecture,
! [X204,X205] :
( aElementOf0(esk32_0,szNzAzT0)
& ( aSet0(sdtlpdtrp0(xN,X204))
| ~ iLess0(X204,esk32_0)
| ~ aElementOf0(X204,szNzAzT0) )
& ( ~ aElementOf0(X205,sdtlpdtrp0(xN,X204))
| aElementOf0(X205,szNzAzT0)
| ~ iLess0(X204,esk32_0)
| ~ aElementOf0(X204,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,X204),szNzAzT0)
| ~ iLess0(X204,esk32_0)
| ~ aElementOf0(X204,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X204))
| ~ iLess0(X204,esk32_0)
| ~ aElementOf0(X204,szNzAzT0) )
& ( aElementOf0(esk33_0,sdtlpdtrp0(xN,esk32_0))
| ~ aSet0(sdtlpdtrp0(xN,esk32_0))
| ~ isCountable0(sdtlpdtrp0(xN,esk32_0)) )
& ( ~ aElementOf0(esk33_0,szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,esk32_0))
| ~ isCountable0(sdtlpdtrp0(xN,esk32_0)) )
& ( ~ aSubsetOf0(sdtlpdtrp0(xN,esk32_0),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,esk32_0)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,hypothesis,
! [X197,X199,X200,X201,X202] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X197)),sdtlpdtrp0(xN,X197))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( ~ aElementOf0(X199,sdtlpdtrp0(xN,X197))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X197)),X199)
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aElement0(X200)
| ~ aElementOf0(X200,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aElementOf0(X200,sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X200,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( X200 != szmzizndt0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X200,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( ~ aElement0(X201)
| ~ aElementOf0(X201,sdtlpdtrp0(xN,X197))
| X201 = szmzizndt0(sdtlpdtrp0(xN,X197))
| aElementOf0(X201,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X197)))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( ~ aElementOf0(X202,sdtlpdtrp0(xN,szszuzczcdt0(X197)))
| aElementOf0(X202,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X197)),sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X197)))
| aElementOf0(esk31_1(X197),sdtlpdtrp0(xN,X197))
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X197)),sdtlpdtrp0(xN,X197))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( ~ aElementOf0(X199,sdtlpdtrp0(xN,X197))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X197)),X199)
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aElement0(X200)
| ~ aElementOf0(X200,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aElementOf0(X200,sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X200,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( X200 != szmzizndt0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X200,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( ~ aElement0(X201)
| ~ aElementOf0(X201,sdtlpdtrp0(xN,X197))
| X201 = szmzizndt0(sdtlpdtrp0(xN,X197))
| aElementOf0(X201,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X197)))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( ~ aElementOf0(X202,sdtlpdtrp0(xN,szszuzczcdt0(X197)))
| aElementOf0(X202,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X197)),sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X197)))
| ~ aElementOf0(esk31_1(X197),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X197))
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X197)),sdtlpdtrp0(xN,X197))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( ~ aElementOf0(X199,sdtlpdtrp0(xN,X197))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X197)),X199)
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aSet0(sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aElement0(X200)
| ~ aElementOf0(X200,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aElementOf0(X200,sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X200,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( X200 != szmzizndt0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X200,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( ~ aElement0(X201)
| ~ aElementOf0(X201,sdtlpdtrp0(xN,X197))
| X201 = szmzizndt0(sdtlpdtrp0(xN,X197))
| aElementOf0(X201,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X197)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( ~ aElementOf0(X202,sdtlpdtrp0(xN,szszuzczcdt0(X197)))
| aElementOf0(X202,sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X197)),sdtmndt0(sdtlpdtrp0(xN,X197),szmzizndt0(sdtlpdtrp0(xN,X197))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X197)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X197),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X197))
| ~ aElementOf0(X197,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])])])]) ).
cnf(c_0_9,plain,
( X1 = szszuzczcdt0(esk5_1(X1))
| X1 = sz00
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
aElementOf0(esk32_0,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( aElementOf0(esk5_1(X1),szNzAzT0)
| X1 = sz00
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X74] :
( ~ aElementOf0(X74,szNzAzT0)
| iLess0(X74,szszuzczcdt0(X74)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIH])]) ).
cnf(c_0_13,hypothesis,
( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( szszuzczcdt0(esk5_1(esk32_0)) = esk32_0
| esk32_0 = sz00 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( esk32_0 = sz00
| aElementOf0(esk5_1(esk32_0),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,plain,
( iLess0(X1,szszuzczcdt0(X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,hypothesis,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,hypothesis,
( esk32_0 = sz00
| isCountable0(sdtlpdtrp0(xN,esk32_0))
| ~ aSubsetOf0(sdtlpdtrp0(xN,esk5_1(esk32_0)),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,esk5_1(esk32_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ iLess0(X1,esk32_0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
( esk32_0 = sz00
| iLess0(esk5_1(esk32_0),esk32_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_15]) ).
cnf(c_0_22,hypothesis,
( aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,X2))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( esk32_0 = sz00
| isCountable0(sdtlpdtrp0(xN,esk32_0))
| ~ aSubsetOf0(sdtlpdtrp0(xN,esk5_1(esk32_0)),szNzAzT0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_15]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ iLess0(X1,esk32_0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,hypothesis,
( esk32_0 = sz00
| aSet0(sdtlpdtrp0(xN,esk32_0))
| ~ aSubsetOf0(sdtlpdtrp0(xN,esk5_1(esk32_0)),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,esk5_1(esk32_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_15]) ).
cnf(c_0_27,negated_conjecture,
( esk32_0 = sz00
| aElementOf0(X1,sdtlpdtrp0(xN,esk5_1(esk32_0)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,esk5_1(esk32_0)),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,esk5_1(esk32_0)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,esk32_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_14]),c_0_15]) ).
cnf(c_0_28,negated_conjecture,
( aElementOf0(esk33_0,sdtlpdtrp0(xN,esk32_0))
| ~ aSet0(sdtlpdtrp0(xN,esk32_0))
| ~ isCountable0(sdtlpdtrp0(xN,esk32_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,negated_conjecture,
( esk32_0 = sz00
| isCountable0(sdtlpdtrp0(xN,esk32_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( esk32_0 = sz00
| aSet0(sdtlpdtrp0(xN,esk32_0))
| ~ aSubsetOf0(sdtlpdtrp0(xN,esk5_1(esk32_0)),szNzAzT0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_15]),c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( esk32_0 = sz00
| aElementOf0(X1,sdtlpdtrp0(xN,esk5_1(esk32_0)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,esk5_1(esk32_0)),szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,esk32_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_15]),c_0_21]) ).
cnf(c_0_32,negated_conjecture,
( esk32_0 = sz00
| aElementOf0(esk33_0,sdtlpdtrp0(xN,esk32_0))
| ~ aSet0(sdtlpdtrp0(xN,esk32_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( esk32_0 = sz00
| aSet0(sdtlpdtrp0(xN,esk32_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_15]),c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( ~ aElementOf0(esk33_0,szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,esk32_0))
| ~ isCountable0(sdtlpdtrp0(xN,esk32_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,negated_conjecture,
( esk32_0 = sz00
| aElementOf0(X1,sdtlpdtrp0(xN,esk5_1(esk32_0)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,esk32_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_15]),c_0_21]) ).
cnf(c_0_36,negated_conjecture,
( esk32_0 = sz00
| aElementOf0(esk33_0,sdtlpdtrp0(xN,esk32_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( esk32_0 = sz00
| ~ aElementOf0(esk33_0,szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,esk32_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,X2))
| ~ iLess0(X2,esk32_0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_39,negated_conjecture,
( esk32_0 = sz00
| aElementOf0(esk33_0,sdtlpdtrp0(xN,esk5_1(esk32_0))) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( esk32_0 = sz00
| ~ aElementOf0(esk33_0,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
fof(c_0_41,hypothesis,
! [X169] :
( aSet0(xS)
& ( ~ aElementOf0(X169,xS)
| aElementOf0(X169,szNzAzT0) )
& aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3435])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,esk32_0),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,esk32_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_43,negated_conjecture,
esk32_0 = sz00,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_15]),c_0_21]),c_0_40]) ).
cnf(c_0_44,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_45,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_44]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUM569+3 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 14:29:44 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.wEIcHkbAaP/E---3.1_15678.p
% 47.60/6.73 # Version: 3.1pre001
% 47.60/6.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 47.60/6.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.60/6.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 47.60/6.73 # Starting new_bool_3 with 300s (1) cores
% 47.60/6.73 # Starting new_bool_1 with 300s (1) cores
% 47.60/6.73 # Starting sh5l with 300s (1) cores
% 47.60/6.73 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 15761 completed with status 0
% 47.60/6.73 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 47.60/6.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 47.60/6.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.60/6.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 47.60/6.73 # No SInE strategy applied
% 47.60/6.73 # Search class: FGHSF-SMLM32-MFFFFFNN
% 47.60/6.73 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 47.60/6.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 47.60/6.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 47.60/6.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 47.60/6.73 # Starting new_bool_3 with 136s (1) cores
% 47.60/6.73 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 47.60/6.73 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 15772 completed with status 0
% 47.60/6.73 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 47.60/6.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 47.60/6.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.60/6.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 47.60/6.73 # No SInE strategy applied
% 47.60/6.73 # Search class: FGHSF-SMLM32-MFFFFFNN
% 47.60/6.73 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 47.60/6.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 47.60/6.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 47.60/6.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 47.60/6.73 # Starting new_bool_3 with 136s (1) cores
% 47.60/6.73 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 47.60/6.73 # Preprocessing time : 0.108 s
% 47.60/6.73 # Presaturation interreduction done
% 47.60/6.73
% 47.60/6.73 # Proof found!
% 47.60/6.73 # SZS status Theorem
% 47.60/6.73 # SZS output start CNFRefutation
% See solution above
% 47.60/6.73 # Parsed axioms : 82
% 47.60/6.73 # Removed by relevancy pruning/SinE : 0
% 47.60/6.73 # Initial clauses : 4183
% 47.60/6.73 # Removed in clause preprocessing : 7
% 47.60/6.73 # Initial clauses in saturation : 4176
% 47.60/6.73 # Processed clauses : 15264
% 47.60/6.73 # ...of these trivial : 11
% 47.60/6.73 # ...subsumed : 5844
% 47.60/6.73 # ...remaining for further processing : 9409
% 47.60/6.73 # Other redundant clauses eliminated : 1992
% 47.60/6.73 # Clauses deleted for lack of memory : 0
% 47.60/6.73 # Backward-subsumed : 236
% 47.60/6.73 # Backward-rewritten : 1381
% 47.60/6.73 # Generated clauses : 45732
% 47.60/6.73 # ...of the previous two non-redundant : 43052
% 47.60/6.73 # ...aggressively subsumed : 0
% 47.60/6.73 # Contextual simplify-reflections : 487
% 47.60/6.73 # Paramodulations : 43931
% 47.60/6.73 # Factorizations : 0
% 47.60/6.73 # NegExts : 0
% 47.60/6.73 # Equation resolutions : 1994
% 47.60/6.73 # Total rewrite steps : 20399
% 47.60/6.73 # Propositional unsat checks : 2
% 47.60/6.73 # Propositional check models : 2
% 47.60/6.73 # Propositional check unsatisfiable : 0
% 47.60/6.73 # Propositional clauses : 0
% 47.60/6.73 # Propositional clauses after purity: 0
% 47.60/6.73 # Propositional unsat core size : 0
% 47.60/6.73 # Propositional preprocessing time : 0.000
% 47.60/6.73 # Propositional encoding time : 0.028
% 47.60/6.73 # Propositional solver time : 0.001
% 47.60/6.73 # Success case prop preproc time : 0.000
% 47.60/6.73 # Success case prop encoding time : 0.000
% 47.60/6.73 # Success case prop solver time : 0.000
% 47.60/6.73 # Current number of processed clauses : 2438
% 47.60/6.73 # Positive orientable unit clauses : 97
% 47.60/6.73 # Positive unorientable unit clauses: 0
% 47.60/6.73 # Negative unit clauses : 26
% 47.60/6.73 # Non-unit-clauses : 2315
% 47.60/6.73 # Current number of unprocessed clauses: 34791
% 47.60/6.73 # ...number of literals in the above : 187674
% 47.60/6.73 # Current number of archived formulas : 0
% 47.60/6.73 # Current number of archived clauses : 5226
% 47.60/6.73 # Clause-clause subsumption calls (NU) : 12118052
% 47.60/6.73 # Rec. Clause-clause subsumption calls : 725305
% 47.60/6.73 # Non-unit clause-clause subsumptions : 5616
% 47.60/6.73 # Unit Clause-clause subsumption calls : 19036
% 47.60/6.73 # Rewrite failures with RHS unbound : 0
% 47.60/6.73 # BW rewrite match attempts : 37
% 47.60/6.73 # BW rewrite match successes : 24
% 47.60/6.73 # Condensation attempts : 0
% 47.60/6.73 # Condensation successes : 0
% 47.60/6.73 # Termbank termtop insertions : 1647628
% 47.60/6.73
% 47.60/6.73 # -------------------------------------------------
% 47.60/6.73 # User time : 5.930 s
% 47.60/6.73 # System time : 0.059 s
% 47.60/6.73 # Total time : 5.988 s
% 47.60/6.73 # Maximum resident set size: 13432 pages
% 47.60/6.73
% 47.60/6.73 # -------------------------------------------------
% 47.60/6.73 # User time : 29.182 s
% 47.60/6.73 # System time : 0.187 s
% 47.60/6.73 # Total time : 29.368 s
% 47.60/6.73 # Maximum resident set size: 1804 pages
% 47.60/6.73 % E---3.1 exiting
%------------------------------------------------------------------------------