%------------------------------------------------------------------------------
% File : E-SAT---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 : n011.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:32 PM UTC 2026
% Result : Theorem 0.34s 15.83s
% Output : CNFRefutation 0.34s
% 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(esk14_0,szNzAzT0) )
& ( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSet0(sdtlpdtrp0(xN,xi))
| aElementOf0(esk14_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,
! [X45] :
( ( xi = sz00
| isCountable0(sdtlpdtrp0(xN,xi)) )
& ( xi = sz00
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
& ( xi = sz00
| aElementOf0(X45,szNzAzT0)
| ~ aElementOf0(X45,sdtlpdtrp0(xN,xi)) )
& ( xi = sz00
| aSet0(sdtlpdtrp0(xN,xi)) )
& ( xi = sz00
| szszuzczcdt0(esk13_0) = xi )
& ( xi = sz00
| aElementOf0(esk13_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,
! [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_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,
! [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_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.03 % Problem : NUM571+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/15.43 % CPULimit : 300
% 0.09/15.43 % WCLimit : 300
% 0.09/15.43 % DateTime : Mon Sep 21 02:40:52 UTC 2026
% 0.09/15.44 % CPUTime :
% 0.09/15.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/15.48 Running first-order theorem proving
% 0.09/15.48 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
% 0.34/15.83 % Version: 3.5.1
% 0.34/15.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.34/15.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/15.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.34/15.83 % Starting new_bool_3 with 300s (1) cores
% 0.34/15.83 % Starting new_bool_1 with 300s (1) cores
% 0.34/15.83 % Starting sh5l with 300s (1) cores
% 0.34/15.83 % new_bool_1 with pid 3969840 completed with status 0
% 0.34/15.83 % Result found by new_bool_1
% 0.34/15.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.34/15.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/15.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.34/15.83 % Starting new_bool_3 with 300s (1) cores
% 0.34/15.83 % Starting new_bool_1 with 300s (1) cores
% 0.34/15.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.34/15.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/15.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.34/15.83 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.34/15.83 % Starting SubtermCWHack with 28s (1) cores
% 0.34/15.83 % SubtermCWHack with pid 3969842 completed with status 0
% 0.34/15.83 % Result found by SubtermCWHack
% 0.34/15.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.34/15.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/15.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.34/15.83 % Starting new_bool_3 with 300s (1) cores
% 0.34/15.83 % Starting new_bool_1 with 300s (1) cores
% 0.34/15.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.34/15.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/15.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.34/15.83 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.34/15.83 % Starting SubtermCWHack with 28s (1) cores
% 0.34/15.83 % Preprocessing time : 0.053 s
% 0.34/15.83
% 0.34/15.83 % Proof found!
% 0.34/15.83 % SZS status Theorem
% 0.34/15.83 % SZS output start CNFRefutation
% See solution above
% 0.34/15.83 % Parsed axioms : 85
% 0.34/15.83 % Removed by relevancy pruning/SinE : 5
% 0.34/15.83 % Initial clauses : 4170
% 0.34/15.83 % Removed in clause preprocessing : 7
% 0.34/15.83 % Initial clauses in saturation : 4163
% 0.34/15.83 % Processed clauses : 111
% 0.34/15.83 % ...of these trivial : 0
% 0.34/15.83 % ...subsumed : 6
% 0.34/15.83 % ...remaining for further processing : 105
% 0.34/15.83 % Other redundant clauses eliminated : 7
% 0.34/15.83 % Clauses deleted for lack of memory : 0
% 0.34/15.83 % Backward-subsumed : 2
% 0.34/15.83 % Backward-rewritten : 20
% 0.34/15.83 % Generated clauses : 86
% 0.34/15.83 % ...of the previous two non-redundant : 72
% 0.34/15.83 % ...aggressively subsumed : 0
% 0.34/15.83 % Contextual simplify-reflections : 1
% 0.34/15.83 % Paramodulations : 79
% 0.34/15.83 % Factorizations : 0
% 0.34/15.83 % NegExts : 0
% 0.34/15.83 % Equation resolutions : 7
% 0.34/15.83 % Disequality decompositions : 0
% 0.34/15.83 % Total rewrite steps : 105
% 0.34/15.83 % ...of those cached : 83
% 0.34/15.83 % Propositional unsat checks : 0
% 0.34/15.83 % Propositional check models : 0
% 0.34/15.83 % Propositional check unsatisfiable : 0
% 0.34/15.83 % Propositional clauses : 0
% 0.34/15.83 % Propositional clauses after purity: 0
% 0.34/15.83 % Propositional unsat core size : 0
% 0.34/15.83 % Propositional preprocessing time : 0.000
% 0.34/15.83 % Propositional encoding time : 0.000
% 0.34/15.83 % Propositional solver time : 0.000
% 0.34/15.83 % Success case prop preproc time : 0.000
% 0.34/15.83 % Success case prop encoding time : 0.000
% 0.34/15.83 % Success case prop solver time : 0.000
% 0.34/15.83 % Current number of processed clauses : 77
% 0.34/15.83 % Positive orientable unit clauses : 34
% 0.34/15.83 % Positive unorientable unit clauses: 0
% 0.34/15.83 % Negative unit clauses : 10
% 0.34/15.83 % Non-unit-clauses : 33
% 0.34/15.83 % Current number of unprocessed clauses: 4123
% 0.34/15.83 % ...number of literals in the above : 51046
% 0.34/15.83 % Current number of archived formulas : 0
% 0.34/15.83 % Current number of archived clauses : 22
% 0.34/15.83 % Clause-clause subsumption calls (NU) : 341
% 0.34/15.83 % Rec. Clause-clause subsumption calls : 304
% 0.34/15.83 % Non-unit clause-clause subsumptions : 4
% 0.34/15.83 % Unit Clause-clause subsumption calls : 122
% 0.34/15.83 % Rewrite failures with RHS unbound : 0
% 0.34/15.83 % BW rewrite match attempts : 2
% 0.34/15.83 % BW rewrite match successes : 2
% 0.34/15.83 % Condensation attempts : 0
% 0.34/15.83 % Condensation successes : 0
% 0.34/15.83 % Termbank termtop insertions : 332605
% 0.34/15.83 % Search garbage collected termcells : 26324
% 0.34/15.83
% 0.34/15.83 % -------------------------------------------------
% 0.34/15.83 % User time : 0.289 s
% 0.34/15.83 % System time : 0.026 s
% 0.34/15.83 % Total time : 0.315 s
% 0.34/15.83 % Maximum resident set size: 15028 pages
% 0.34/15.83
% 0.34/15.83 % -------------------------------------------------
% 0.34/15.83 % User time : 0.295 s
% 0.34/15.83 % System time : 0.030 s
% 0.34/15.83 % Total time : 0.324 s
% 0.34/15.83 % Maximum resident set size: 4608 pages
% 0.34/15.83 % E exiting
%------------------------------------------------------------------------------