%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM582+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:39 PM UTC 2026
% Result : Theorem 0.14s 1.01s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 268 ( 15 equ)
% Maximal formula atoms : 181 ( 13 avg)
% Number of connectives : 401 ( 153 ~; 162 |; 68 &)
% ( 2 <=>; 16 =>; 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 : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 25 !; 0 ?)
% 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/sandbox2/benchmark/theBenchmark.p',m__3623) ).
fof(m__,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
| ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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/sandbox2/benchmark/theBenchmark.p',m__3754) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroLess) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroNum) ).
fof(m__3989,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3989) ).
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,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
| ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,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_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])])])])])])]) ).
fof(c_0_10,plain,
! [X130] :
( sdtlseqdt0(sz00,X130)
| ~ aElementOf0(X130,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])])]) ).
fof(c_0_11,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
& ~ aElementOf0(esk14_0,xS)
& aElementOf0(esk14_0,sdtlpdtrp0(xN,xi)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(X2,X1)
| aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ),
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,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),xS) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_18,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3989]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM582+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.55 % Computer : n005.cluster.edu
% 0.11/0.55 % Model : x86_64 x86_64
% 0.11/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.55 % Memory : 8046.5625MB
% 0.11/0.55 % OS : Linux 6.8.0-71-generic
% 0.11/0.55 % CPULimit : 300
% 0.11/0.55 % WCLimit : 300
% 0.11/0.55 % DateTime : Mon Sep 21 02:42:04 UTC 2026
% 0.11/0.55 % CPUTime :
% 0.11/0.55 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.61 Running first-order theorem proving
% 0.14/0.61 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/1.01 % Version: 3.5.1
% 0.14/1.01 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/1.01 % Starting new_bool_3 with 300s (1) cores
% 0.14/1.01 % Starting new_bool_1 with 300s (1) cores
% 0.14/1.01 % Starting sh5l with 300s (1) cores
% 0.14/1.01 % new_bool_1 with pid 2378795 completed with status 0
% 0.14/1.01 % Result found by new_bool_1
% 0.14/1.01 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/1.01 % Starting new_bool_3 with 300s (1) cores
% 0.14/1.01 % Starting new_bool_1 with 300s (1) cores
% 0.14/1.01 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/1.01 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/1.01 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.14/1.01 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/1.01 % Starting SubtermCWHack with 28s (1) cores
% 0.14/1.01 % SubtermCWHack with pid 2378797 completed with status 0
% 0.14/1.01 % Result found by SubtermCWHack
% 0.14/1.01 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/1.01 % Starting new_bool_3 with 300s (1) cores
% 0.14/1.01 % Starting new_bool_1 with 300s (1) cores
% 0.14/1.01 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/1.01 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/1.01 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.14/1.01 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/1.01 % Starting SubtermCWHack with 28s (1) cores
% 0.14/1.01 % Preprocessing time : 0.081 s
% 0.14/1.01
% 0.14/1.01 % Proof found!
% 0.14/1.01 % SZS status Theorem
% 0.14/1.01 % SZS output start CNFRefutation
% See solution above
% 0.14/1.01 % Parsed axioms : 88
% 0.14/1.01 % Removed by relevancy pruning/SinE : 5
% 0.14/1.01 % Initial clauses : 4191
% 0.14/1.01 % Removed in clause preprocessing : 7
% 0.14/1.01 % Initial clauses in saturation : 4184
% 0.14/1.01 % Processed clauses : 637
% 0.14/1.01 % ...of these trivial : 1
% 0.14/1.01 % ...subsumed : 189
% 0.14/1.01 % ...remaining for further processing : 447
% 0.14/1.01 % Other redundant clauses eliminated : 35
% 0.14/1.01 % Clauses deleted for lack of memory : 0
% 0.14/1.01 % Backward-subsumed : 30
% 0.14/1.01 % Backward-rewritten : 9
% 0.14/1.01 % Generated clauses : 1368
% 0.14/1.01 % ...of the previous two non-redundant : 1119
% 0.14/1.01 % ...aggressively subsumed : 0
% 0.14/1.01 % Contextual simplify-reflections : 18
% 0.14/1.01 % Paramodulations : 1332
% 0.14/1.01 % Factorizations : 0
% 0.14/1.01 % NegExts : 0
% 0.14/1.01 % Equation resolutions : 36
% 0.14/1.01 % Disequality decompositions : 0
% 0.14/1.01 % Total rewrite steps : 1012
% 0.14/1.01 % ...of those cached : 955
% 0.14/1.01 % Propositional unsat checks : 0
% 0.14/1.01 % Propositional check models : 0
% 0.14/1.01 % Propositional check unsatisfiable : 0
% 0.14/1.01 % Propositional clauses : 0
% 0.14/1.01 % Propositional clauses after purity: 0
% 0.14/1.01 % Propositional unsat core size : 0
% 0.14/1.01 % Propositional preprocessing time : 0.000
% 0.14/1.01 % Propositional encoding time : 0.000
% 0.14/1.01 % Propositional solver time : 0.000
% 0.14/1.01 % Success case prop preproc time : 0.000
% 0.14/1.01 % Success case prop encoding time : 0.000
% 0.14/1.01 % Success case prop solver time : 0.000
% 0.14/1.01 % Current number of processed clauses : 378
% 0.14/1.01 % Positive orientable unit clauses : 68
% 0.14/1.01 % Positive unorientable unit clauses: 0
% 0.14/1.01 % Negative unit clauses : 22
% 0.14/1.01 % Non-unit-clauses : 288
% 0.14/1.01 % Current number of unprocessed clauses: 4627
% 0.14/1.01 % ...number of literals in the above : 53548
% 0.14/1.01 % Current number of archived formulas : 0
% 0.14/1.01 % Current number of archived clauses : 42
% 0.14/1.01 % Clause-clause subsumption calls (NU) : 10853
% 0.14/1.01 % Rec. Clause-clause subsumption calls : 6816
% 0.14/1.01 % Non-unit clause-clause subsumptions : 158
% 0.14/1.01 % Unit Clause-clause subsumption calls : 1242
% 0.14/1.01 % Rewrite failures with RHS unbound : 0
% 0.14/1.01 % BW rewrite match attempts : 12
% 0.14/1.01 % BW rewrite match successes : 12
% 0.14/1.01 % Condensation attempts : 0
% 0.14/1.01 % Condensation successes : 0
% 0.14/1.01 % Termbank termtop insertions : 354369
% 0.14/1.01 % Search garbage collected termcells : 26563
% 0.14/1.01
% 0.14/1.01 % -------------------------------------------------
% 0.14/1.01 % User time : 0.334 s
% 0.14/1.01 % System time : 0.028 s
% 0.14/1.01 % Total time : 0.362 s
% 0.14/1.01 % Maximum resident set size: 15036 pages
% 0.14/1.01
% 0.14/1.01 % -------------------------------------------------
% 0.14/1.01 % User time : 0.341 s
% 0.14/1.01 % System time : 0.038 s
% 0.14/1.01 % Total time : 0.379 s
% 0.14/1.01 % Maximum resident set size: 4608 pages
% 0.14/1.01 % E exiting
%------------------------------------------------------------------------------