%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM571+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 : n026.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:49:36 PM UTC 2026
% Result : Theorem 2.80s 6.30s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 294 ( 30 equ)
% Maximal formula atoms : 181 ( 14 avg)
% Number of connectives : 424 ( 150 ~; 165 |; 90 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 45 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( isCountable0(sdtlpdtrp0(xN,xi))
& ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,xi)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__3702_02,hypothesis,
( xi != sz00
=> ( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,xi))
& ? [X1] :
( szszuzczcdt0(X1) = xi
& aElementOf0(X1,szNzAzT0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3702_02) ).
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__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(c_0_4,negated_conjecture,
~ ( isCountable0(sdtlpdtrp0(xN,xi))
& ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,xi)) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,hypothesis,
( xi != sz00
=> ( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,xi))
& ? [X1] :
( szszuzczcdt0(X1) = xi
& aElementOf0(X1,szNzAzT0) ) ) ),
inference(fof_simplification,[status(thm)],[m__3702_02]) ).
fof(c_0_6,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_7,negated_conjecture,
( ( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
& ( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSet0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(esk33_0,szNzAzT0) )
& ( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSet0(sdtlpdtrp0(xN,xi))
| aElementOf0(esk33_0,sdtlpdtrp0(xN,xi)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_8,hypothesis,
! [X215] :
( ( xi = sz00
| isCountable0(sdtlpdtrp0(xN,xi)) )
& ( xi = sz00
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
& ( xi = sz00
| aElementOf0(X215,szNzAzT0)
| ~ aElementOf0(X215,sdtlpdtrp0(xN,xi)) )
& ( xi = sz00
| aSet0(sdtlpdtrp0(xN,xi)) )
& ( xi = sz00
| szszuzczcdt0(esk32_0) = xi )
& ( xi = sz00
| aElementOf0(esk32_0,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)],[c_0_5])])])])])]) ).
fof(c_0_9,hypothesis,
! [X206,X208,X209,X210,X211] :
( ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X206))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X206)),sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206)))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| aElementOf0(X211,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| ~ aElementOf0(X211,sdtlpdtrp0(xN,szszuzczcdt0(X206))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X206))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| aElementOf0(X210,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| X210 = szmzizndt0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(X210,sdtlpdtrp0(xN,X206))
| ~ aElement0(X210) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| ~ aElementOf0(X209,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| X209 != szmzizndt0(sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| ~ aElementOf0(X209,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| aElementOf0(X209,sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| ~ aElementOf0(X209,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| aElement0(X209) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206)))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X206)),X208)
| ~ aElementOf0(X208,sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X206),szNzAzT0)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X206)),sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X206))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X206)),sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206)))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| aElementOf0(X211,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| ~ aElementOf0(X211,sdtlpdtrp0(xN,szszuzczcdt0(X206))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X206))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| aElementOf0(X210,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| X210 = szmzizndt0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(X210,sdtlpdtrp0(xN,X206))
| ~ aElement0(X210) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| ~ aElementOf0(X209,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| X209 != szmzizndt0(sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| ~ aElementOf0(X209,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| aElementOf0(X209,sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| ~ aElementOf0(X209,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| aElement0(X209) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206)))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X206)),X208)
| ~ aElementOf0(X208,sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(esk31_1(X206),szNzAzT0)
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X206)),sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X206))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X206)),sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206)))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| aElementOf0(X211,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| ~ aElementOf0(X211,sdtlpdtrp0(xN,szszuzczcdt0(X206))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| aSet0(sdtlpdtrp0(xN,szszuzczcdt0(X206))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| aElementOf0(X210,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| X210 = szmzizndt0(sdtlpdtrp0(xN,X206))
| ~ aElementOf0(X210,sdtlpdtrp0(xN,X206))
| ~ aElement0(X210) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| ~ aElementOf0(X209,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| X209 != szmzizndt0(sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| ~ aElementOf0(X209,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| aElementOf0(X209,sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| ~ aElementOf0(X209,sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206))))
| aElement0(X209) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| aSet0(sdtmndt0(sdtlpdtrp0(xN,X206),szmzizndt0(sdtlpdtrp0(xN,X206)))) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,X206)),X208)
| ~ aElementOf0(X208,sdtlpdtrp0(xN,X206)) )
& ( ~ aElementOf0(X206,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X206))
| ~ aSet0(sdtlpdtrp0(xN,X206))
| aElementOf0(esk31_1(X206),sdtlpdtrp0(xN,X206))
| aElementOf0(szmzizndt0(sdtlpdtrp0(xN,X206)),sdtlpdtrp0(xN,X206)) )
& 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_6])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
( xi = sz00
| isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
( xi = sz00
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
sz00 = xi,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
fof(c_0_15,hypothesis,
! [X178] :
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0)
& ( aElementOf0(X178,szNzAzT0)
| ~ aElementOf0(X178,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_16,hypothesis,
sdtlpdtrp0(xN,xi) = xS,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_16]),c_0_17]),c_0_16]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM571+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.44 % Computer : n026.cluster.edu
% 0.18/5.44 % Model : x86_64 x86_64
% 0.18/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.44 % Memory : 8046.5625MB
% 0.18/5.44 % OS : Linux 6.8.0-71-generic
% 0.18/5.44 % CPULimit : 300
% 0.18/5.44 % WCLimit : 300
% 0.18/5.44 % DateTime : Mon Sep 21 02:43:57 UTC 2026
% 0.18/5.44 % CPUTime :
% 0.18/5.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/5.51 Running first-order theorem proving
% 0.21/5.51 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
% 2.80/6.30 % Version: 3.5.1
% 2.80/6.30 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.80/6.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.80/6.30 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.80/6.30 % Starting new_bool_3 with 300s (1) cores
% 2.80/6.30 % Starting new_bool_1 with 300s (1) cores
% 2.80/6.30 % Starting sh5l with 300s (1) cores
% 2.80/6.30 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1195950 completed with status 0
% 2.80/6.30 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.80/6.30 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.80/6.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.80/6.30 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.80/6.30 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.80/6.30 % No SInE strategy applied
% 2.80/6.30 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.80/6.30 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.80/6.30 % Starting SubtermCWHack with 136s (1) cores
% 2.80/6.30 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.80/6.30 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 2.80/6.30 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.80/6.30 % Starting new_bool_3 with 136s (1) cores
% 2.80/6.30 % SubtermCWHack with pid 1195954 completed with status 0
% 2.80/6.30 % Result found by SubtermCWHack
% 2.80/6.30 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.80/6.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.80/6.30 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.80/6.30 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.80/6.30 % No SInE strategy applied
% 2.80/6.30 % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.80/6.30 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.80/6.30 % Starting SubtermCWHack with 136s (1) cores
% 2.80/6.30 % Preprocessing time : 0.146 s
% 2.80/6.30
% 2.80/6.30 % Proof found!
% 2.80/6.30 % SZS status Theorem
% 2.80/6.30 % SZS output start CNFRefutation
% See solution above
% 2.80/6.30 % Parsed axioms : 85
% 2.80/6.30 % Removed by relevancy pruning/SinE : 0
% 2.80/6.30 % Initial clauses : 4189
% 2.80/6.30 % Removed in clause preprocessing : 7
% 2.80/6.30 % Initial clauses in saturation : 4182
% 2.80/6.30 % Processed clauses : 111
% 2.80/6.30 % ...of these trivial : 0
% 2.80/6.30 % ...subsumed : 6
% 2.80/6.30 % ...remaining for further processing : 105
% 2.80/6.30 % Other redundant clauses eliminated : 7
% 2.80/6.30 % Clauses deleted for lack of memory : 0
% 2.80/6.30 % Backward-subsumed : 2
% 2.80/6.30 % Backward-rewritten : 20
% 2.80/6.30 % Generated clauses : 86
% 2.80/6.30 % ...of the previous two non-redundant : 72
% 2.80/6.30 % ...aggressively subsumed : 0
% 2.80/6.30 % Contextual simplify-reflections : 1
% 2.80/6.30 % Paramodulations : 79
% 2.80/6.30 % Factorizations : 0
% 2.80/6.30 % NegExts : 0
% 2.80/6.30 % Equation resolutions : 7
% 2.80/6.30 % Disequality decompositions : 0
% 2.80/6.30 % Total rewrite steps : 105
% 2.80/6.30 % ...of those cached : 83
% 2.80/6.30 % Propositional unsat checks : 0
% 2.80/6.30 % Propositional check models : 0
% 2.80/6.30 % Propositional check unsatisfiable : 0
% 2.80/6.30 % Propositional clauses : 0
% 2.80/6.30 % Propositional clauses after purity: 0
% 2.80/6.30 % Propositional unsat core size : 0
% 2.80/6.30 % Propositional preprocessing time : 0.000
% 2.80/6.30 % Propositional encoding time : 0.000
% 2.80/6.30 % Propositional solver time : 0.000
% 2.80/6.30 % Success case prop preproc time : 0.000
% 2.80/6.30 % Success case prop encoding time : 0.000
% 2.80/6.30 % Success case prop solver time : 0.000
% 2.80/6.30 % Current number of processed clauses : 77
% 2.80/6.30 % Positive orientable unit clauses : 34
% 2.80/6.30 % Positive unorientable unit clauses: 0
% 2.80/6.30 % Negative unit clauses : 10
% 2.80/6.30 % Non-unit-clauses : 33
% 2.80/6.30 % Current number of unprocessed clauses: 4142
% 2.80/6.30 % ...number of literals in the above : 51144
% 2.80/6.30 % Current number of archived formulas : 0
% 2.80/6.30 % Current number of archived clauses : 22
% 2.80/6.30 % Clause-clause subsumption calls (NU) : 329
% 2.80/6.30 % Rec. Clause-clause subsumption calls : 282
% 2.80/6.30 % Non-unit clause-clause subsumptions : 4
% 2.80/6.30 % Unit Clause-clause subsumption calls : 192
% 2.80/6.30 % Rewrite failures with RHS unbound : 0
% 2.80/6.30 % BW rewrite match attempts : 2
% 2.80/6.30 % BW rewrite match successes : 2
% 2.80/6.30 % Condensation attempts : 0
% 2.80/6.30 % Condensation successes : 0
% 2.80/6.30 % Termbank termtop insertions : 334168
% 2.80/6.30 % Search garbage collected termcells : 26841
% 2.80/6.30
% 2.80/6.30 % -------------------------------------------------
% 2.80/6.30 % User time : 0.578 s
% 2.80/6.30 % System time : 0.040 s
% 2.80/6.30 % Total time : 0.618 s
% 2.80/6.30 % Maximum resident set size: 15028 pages
% 2.80/6.30
% 2.80/6.30 % -------------------------------------------------
% 2.80/6.30 % User time : 1.424 s
% 2.80/6.30 % System time : 0.106 s
% 2.80/6.30 % Total time : 1.530 s
% 2.80/6.30 % Maximum resident set size: 4608 pages
% 2.80/6.30 % E exiting
%------------------------------------------------------------------------------