%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM601+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:55:39 PM UTC 2026
% Result : Theorem 1.33s 0.96s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 7 unt; 0 def)
% Number of atoms : 358 ( 31 equ)
% Maximal formula atoms : 181 ( 10 avg)
% Number of connectives : 513 ( 190 ~; 201 |; 97 &)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 45 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__3623,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( isCountable0(sdtlpdtrp0(xN,X1))
& ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ( ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
=> aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& ! [X2] :
( aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X2 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X2,sdtlpdtrp0(xN,X1))
& aElement0(X2) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X2) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3623) ).
fof(m__3754,hypothesis,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> aElementOf0(X3,sdtlpdtrp0(xN,X2)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3754) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroLess) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSet0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(m__4660,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
& aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1)) ) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4660) ).
fof(m__4982,hypothesis,
! [X1] :
( ( aElementOf0(X1,xO)
| ? [X2] :
( sdtlpdtrp0(xe,X2) = X1
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) )
=> ? [X2] :
( sdtlpdtrp0(xe,X2) = X1
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xd,X2) = szDzizrdt0(xd)
& aElementOf0(X2,szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4982) ).
fof(m__,conjecture,
( aSubsetOf0(xO,xS)
| ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(c_0_9,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( isCountable0(sdtlpdtrp0(xN,X1))
& ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ( ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,X1)) ) ) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1)))
=> aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) )
& aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& ! [X2] :
( aElementOf0(X2,sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
<=> ( X2 != szmzizndt0(sdtlpdtrp0(xN,X1))
& aElementOf0(X2,sdtlpdtrp0(xN,X1))
& aElement0(X2) ) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X1)),X2) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X1)),sdtlpdtrp0(xN,X1)) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
inference(fof_simplification,[status(thm)],[m__3623]) ).
fof(c_0_10,hypothesis,
! [X44,X45,X46] :
( ( ~ aElementOf0(X45,szNzAzT0)
| ~ aElementOf0(X44,szNzAzT0)
| ~ sdtlseqdt0(X45,X44)
| aSubsetOf0(sdtlpdtrp0(xN,X44),sdtlpdtrp0(xN,X45)) )
& ( ~ aElementOf0(X45,szNzAzT0)
| ~ aElementOf0(X44,szNzAzT0)
| ~ sdtlseqdt0(X45,X44)
| aElementOf0(X46,sdtlpdtrp0(xN,X45))
| ~ aElementOf0(X46,sdtlpdtrp0(xN,X44)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])])])])]) ).
fof(c_0_11,plain,
! [X158] :
( sdtlseqdt0(sz00,X158)
| ~ aElementOf0(X158,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])])]) ).
fof(c_0_12,hypothesis,
! [X36,X38,X39,X40,X41] :
( ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X36))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X36)),sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36)))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| aElementOf0(X41,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| ~ aElementOf0(X41,sdtlpdtrp0(xN,szszuzczcdt0(X36))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X36))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| aElementOf0(X40,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| X40 = szmzizndt0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(X40,sdtlpdtrp0(xN,X36))
| ~ aElement0(X40) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| ~ aElementOf0(X39,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| X39 != szmzizndt0(sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| ~ aElementOf0(X39,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| aElementOf0(X39,sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| ~ aElementOf0(X39,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| aElement0(X39) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36)))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X36)),X38)
| ~ aElementOf0(X38,sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X36),szNzAzT0)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X36)),sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X36))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X36)),sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36)))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| aElementOf0(X41,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| ~ aElementOf0(X41,sdtlpdtrp0(xN,szszuzczcdt0(X36))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X36))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| aElementOf0(X40,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| X40 = szmzizndt0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(X40,sdtlpdtrp0(xN,X36))
| ~ aElement0(X40) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| ~ aElementOf0(X39,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| X39 != szmzizndt0(sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| ~ aElementOf0(X39,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| aElementOf0(X39,sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| ~ aElementOf0(X39,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| aElement0(X39) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36)))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X36)),X38)
| ~ aElementOf0(X38,sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(esk12_1(X36),szNzAzT0)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X36)),sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X36))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X36)),sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36)))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| aElementOf0(X41,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| ~ aElementOf0(X41,sdtlpdtrp0(xN,szszuzczcdt0(X36))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X36))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| aElementOf0(X40,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| X40 = szmzizndt0(sdtlpdtrp0(xN,X36))
| ~ aElementOf0(X40,sdtlpdtrp0(xN,X36))
| ~ aElement0(X40) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| ~ aElementOf0(X39,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| X39 != szmzizndt0(sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| ~ aElementOf0(X39,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| aElementOf0(X39,sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| ~ aElementOf0(X39,sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36))))
| aElement0(X39) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X36),szmzizndt0(sdtlpdtrp0(xN,X36)))) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X36)),X38)
| ~ aElementOf0(X38,sdtlpdtrp0(xN,X36)) )
& ( ~ aElementOf0(X36,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X36))
| ~ aSet0(sdtlpdtrp0(xN,X36))
| aElementOf0(esk12_1(X36),sdtlpdtrp0(xN,X36))
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X36)),sdtlpdtrp0(xN,X36)) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[c_0_9])])])])])])]) ).
fof(c_0_13,plain,
! [X107,X108,X109,X110] :
( ( ~ aSet0(X107)
| aSubsetOf0(X110,X107)
| ~ aSet0(X110)
| ~ aElementOf0(esk24_2(X107,X110),X107) )
& ( ~ aSet0(X107)
| aSubsetOf0(X110,X107)
| ~ aSet0(X110)
| aElementOf0(esk24_2(X107,X110),X110) )
& ( ~ aSet0(X107)
| ~ aSubsetOf0(X108,X107)
| aElementOf0(X109,X107)
| ~ aElementOf0(X109,X108) )
& ( ~ aSet0(X107)
| ~ aSubsetOf0(X108,X107)
| aSet0(X108) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefSub])])])])])])]) ).
cnf(c_0_14,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(X2,X1)
| aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
fof(c_0_18,hypothesis,
! [X8] :
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0)
& ( aElementOf0(X8,szNzAzT0)
| ~ aElementOf0(X8,xS) )
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3435])])])]) ).
cnf(c_0_19,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_21,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_22,hypothesis,
! [X65,X66] :
( ( ~ aElementOf0(X65,szNzAzT0)
| sdtlpdtrp0(xe,X65) = szmzizndt0(sdtlpdtrp0(xN,X65)) )
& ( ~ aElementOf0(X65,szNzAzT0)
| sdtlseqdt0(sdtlpdtrp0(xe,X65),X66)
| ~ aElementOf0(X66,sdtlpdtrp0(xN,X65)) )
& ( ~ aElementOf0(X65,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X65),sdtlpdtrp0(xN,X65)) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])])])]) ).
cnf(c_0_23,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,X2))
| aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_25,hypothesis,
! [X81,X82] :
( ( ~ aElementOf0(X81,xO)
| sdtlpdtrp0(xe,esk20_1(X81)) = X81 )
& ( ~ aElementOf0(X81,xO)
| aElementOf0(esk20_1(X81),sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( ~ aElementOf0(X81,xO)
| sdtlpdtrp0(xd,esk20_1(X81)) = szDzizrdt0(xd) )
& ( ~ aElementOf0(X81,xO)
| aElementOf0(esk20_1(X81),szNzAzT0) )
& ( sdtlpdtrp0(xe,X82) != X81
| ~ aElementOf0(X82,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,esk20_1(X81)) = X81 )
& ( sdtlpdtrp0(xe,X82) != X81
| ~ aElementOf0(X82,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(esk20_1(X81),sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( sdtlpdtrp0(xe,X82) != X81
| ~ aElementOf0(X82,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,esk20_1(X81)) = szDzizrdt0(xd) )
& ( sdtlpdtrp0(xe,X82) != X81
| ~ aElementOf0(X82,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(esk20_1(X81),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4982])])])])])]) ).
fof(c_0_26,negated_conjecture,
~ ( aSubsetOf0(xO,xS)
| ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_27,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X1),xS) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,hypothesis,
( ~ aElementOf0(X1,xO)
| sdtlpdtrp0(xe,esk20_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,hypothesis,
( ~ aElementOf0(X1,xO)
| aElementOf0(esk20_1(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_30,negated_conjecture,
( ~ aSubsetOf0(xO,xS)
& ~ aElementOf0(esk21_0,xS)
& aElementOf0(esk21_0,xO) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
cnf(c_0_31,hypothesis,
( ~ aElementOf0(X1,xO)
| aElementOf0(X1,xS) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
aElementOf0(esk21_0,xO),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ aElementOf0(esk21_0,xS),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM601+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n013.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 02:43:35 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.33/0.96 % Version: 3.5.1
% 1.33/0.96 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.33/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.96 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.33/0.96 % Starting new_bool_3 with 300s (1) cores
% 1.33/0.96 % Starting new_bool_1 with 300s (1) cores
% 1.33/0.96 % Starting sh5l with 300s (1) cores
% 1.33/0.96 % new_bool_1 with pid 3974256 completed with status 0
% 1.33/0.96 % Result found by new_bool_1
% 1.33/0.96 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.33/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.96 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.33/0.96 % Starting new_bool_3 with 300s (1) cores
% 1.33/0.96 % Starting new_bool_1 with 300s (1) cores
% 1.33/0.96 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.33/0.96 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.33/0.96 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.33/0.96 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.33/0.96 % Starting SubtermCWHack with 28s (1) cores
% 1.33/0.96 % SubtermCWHack with pid 3974284 completed with status 0
% 1.33/0.96 % Result found by SubtermCWHack
% 1.33/0.96 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.33/0.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/0.96 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.33/0.96 % Starting new_bool_3 with 300s (1) cores
% 1.33/0.96 % Starting new_bool_1 with 300s (1) cores
% 1.33/0.96 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.33/0.96 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.33/0.96 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.33/0.96 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.33/0.96 % Starting SubtermCWHack with 28s (1) cores
% 1.33/0.96 % Preprocessing time : 0.088 s
% 1.33/0.96
% 1.33/0.96 % Proof found!
% 1.33/0.96 % SZS status Theorem
% 1.33/0.96 % SZS output start CNFRefutation
% See solution above
% 1.33/0.96 % Parsed axioms : 98
% 1.33/0.96 % Removed by relevancy pruning/SinE : 2
% 1.33/0.96 % Initial clauses : 4868
% 1.33/0.96 % Removed in clause preprocessing : 7
% 1.33/0.96 % Initial clauses in saturation : 4861
% 1.33/0.96 % Processed clauses : 1096
% 1.33/0.96 % ...of these trivial : 25
% 1.33/0.96 % ...subsumed : 355
% 1.33/0.96 % ...remaining for further processing : 716
% 1.33/0.96 % Other redundant clauses eliminated : 48
% 1.33/0.96 % Clauses deleted for lack of memory : 0
% 1.33/0.96 % Backward-subsumed : 23
% 1.33/0.96 % Backward-rewritten : 22
% 1.33/0.96 % Generated clauses : 3151
% 1.33/0.96 % ...of the previous two non-redundant : 2624
% 1.33/0.96 % ...aggressively subsumed : 0
% 1.33/0.96 % Contextual simplify-reflections : 20
% 1.33/0.96 % Paramodulations : 3104
% 1.33/0.96 % Factorizations : 0
% 1.33/0.96 % NegExts : 0
% 1.33/0.96 % Equation resolutions : 50
% 1.33/0.96 % Disequality decompositions : 0
% 1.33/0.96 % Total rewrite steps : 2148
% 1.33/0.96 % ...of those cached : 2032
% 1.33/0.96 % Propositional unsat checks : 0
% 1.33/0.96 % Propositional check models : 0
% 1.33/0.96 % Propositional check unsatisfiable : 0
% 1.33/0.96 % Propositional clauses : 0
% 1.33/0.96 % Propositional clauses after purity: 0
% 1.33/0.96 % Propositional unsat core size : 0
% 1.33/0.96 % Propositional preprocessing time : 0.000
% 1.33/0.96 % Propositional encoding time : 0.000
% 1.33/0.96 % Propositional solver time : 0.000
% 1.33/0.96 % Success case prop preproc time : 0.000
% 1.33/0.96 % Success case prop encoding time : 0.000
% 1.33/0.96 % Success case prop solver time : 0.000
% 1.33/0.96 % Current number of processed clauses : 631
% 1.33/0.96 % Positive orientable unit clauses : 123
% 1.33/0.96 % Positive unorientable unit clauses: 0
% 1.33/0.96 % Negative unit clauses : 24
% 1.33/0.96 % Non-unit-clauses : 484
% 1.33/0.96 % Current number of unprocessed clauses: 6028
% 1.33/0.96 % ...number of literals in the above : 61569
% 1.33/0.96 % Current number of archived formulas : 0
% 1.33/0.96 % Current number of archived clauses : 47
% 1.33/0.96 % Clause-clause subsumption calls (NU) : 41372
% 1.33/0.96 % Rec. Clause-clause subsumption calls : 26659
% 1.33/0.96 % Non-unit clause-clause subsumptions : 268
% 1.33/0.96 % Unit Clause-clause subsumption calls : 3444
% 1.33/0.96 % Rewrite failures with RHS unbound : 0
% 1.33/0.96 % BW rewrite match attempts : 45
% 1.33/0.96 % BW rewrite match successes : 17
% 1.33/0.96 % Condensation attempts : 0
% 1.33/0.96 % Condensation successes : 0
% 1.33/0.96 % Termbank termtop insertions : 427291
% 1.33/0.96 % Search garbage collected termcells : 31592
% 1.33/0.96
% 1.33/0.96 % -------------------------------------------------
% 1.33/0.96 % User time : 0.420 s
% 1.33/0.96 % System time : 0.038 s
% 1.33/0.96 % Total time : 0.458 s
% 1.33/0.96 % Maximum resident set size: 16096 pages
% 1.33/0.96
% 1.33/0.96 % -------------------------------------------------
% 1.33/0.96 % User time : 0.426 s
% 1.33/0.96 % System time : 0.045 s
% 1.33/0.96 % Total time : 0.471 s
% 1.33/0.96 % Maximum resident set size: 5120 pages
% 1.33/0.96 % E exiting
%------------------------------------------------------------------------------