%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM629+1 : 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 : n019.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:50 PM UTC 2026
% Result : Theorem 1.57s 0.74s
% Output : CNFRefutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 64 ( 26 unt; 0 def)
% Number of atoms : 275 ( 50 equ)
% Maximal formula atoms : 52 ( 4 avg)
% Number of connectives : 348 ( 137 ~; 140 |; 51 &)
% ( 7 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 13 con; 0-3 aty)
% Number of variables : 76 ( 0 sgn 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__4660,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4660) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__5106,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5106) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(m__,conjecture,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefSel,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aSet0(X1) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( sbrdtbr0(X4) = X2
& aSubsetOf0(X4,X1) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSel) ).
fof(m__3623,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3623) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3671) ).
fof(m__5585,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5585) ).
fof(m__5309,hypothesis,
( sdtlpdtrp0(xe,xn) = xp
& aElementOf0(xn,szNzAzT0)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5309) ).
fof(m__5173,hypothesis,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5173) ).
fof(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X3)
& aSet0(X2)
& aSet0(X1) )
=> ( ( aSubsetOf0(X2,X3)
& aSubsetOf0(X1,X2) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubTrans) ).
fof(m__5217,hypothesis,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5217) ).
fof(m__3533,hypothesis,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).
fof(m__5334,hypothesis,
aSubsetOf0(xP,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5334) ).
fof(c_0_17,plain,
! [X1,X2] :
( ( aElement0(X2)
& aSet0(X1) )
=> ! [X3] :
( X3 = sdtmndt0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( X4 != X2
& aElementOf0(X4,X1)
& aElement0(X4) ) )
& aSet0(X3) ) ) ),
inference(fof_simplification,[status(thm)],[mDefDiff]) ).
fof(c_0_18,plain,
! [X19,X20,X21,X22] :
( ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| ~ aElementOf0(esk2_2(X19,X22),X19) )
& ( ~ aSet0(X19)
| aSubsetOf0(X22,X19)
| ~ aSet0(X22)
| aElementOf0(esk2_2(X19,X22),X22) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aElementOf0(X21,X19)
| ~ aElementOf0(X21,X20) )
& ( ~ aSet0(X19)
| ~ aSubsetOf0(X20,X19)
| aSet0(X20) ) ),
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])])])])])])]) ).
fof(c_0_19,plain,
! [X39,X40,X41,X42,X43,X44] :
( ( ~ aElement0(X40)
| ~ aSet0(X39)
| X44 = sdtmndt0(X39,X40)
| ~ aSet0(X44)
| aElementOf0(esk4_3(X39,X40,X44),X44)
| esk4_3(X39,X40,X44) != X40 )
& ( ~ aElement0(X40)
| ~ aSet0(X39)
| X44 = sdtmndt0(X39,X40)
| ~ aSet0(X44)
| aElementOf0(esk4_3(X39,X40,X44),X44)
| aElementOf0(esk4_3(X39,X40,X44),X39) )
& ( ~ aElement0(X40)
| ~ aSet0(X39)
| X44 = sdtmndt0(X39,X40)
| ~ aSet0(X44)
| aElementOf0(esk4_3(X39,X40,X44),X44)
| aElement0(esk4_3(X39,X40,X44)) )
& ( ~ aElement0(X40)
| ~ aSet0(X39)
| X44 = sdtmndt0(X39,X40)
| ~ aSet0(X44)
| esk4_3(X39,X40,X44) = X40
| ~ aElementOf0(esk4_3(X39,X40,X44),X39)
| ~ aElement0(esk4_3(X39,X40,X44))
| ~ aElementOf0(esk4_3(X39,X40,X44),X44) )
& ( ~ aElement0(X40)
| ~ aSet0(X39)
| X41 != sdtmndt0(X39,X40)
| aElementOf0(X43,X41)
| X43 = X40
| ~ aElementOf0(X43,X39)
| ~ aElement0(X43) )
& ( ~ aElement0(X40)
| ~ aSet0(X39)
| X41 != sdtmndt0(X39,X40)
| ~ aElementOf0(X42,X41)
| X42 != X40 )
& ( ~ aElement0(X40)
| ~ aSet0(X39)
| X41 != sdtmndt0(X39,X40)
| ~ aElementOf0(X42,X41)
| aElementOf0(X42,X39) )
& ( ~ aElement0(X40)
| ~ aSet0(X39)
| X41 != sdtmndt0(X39,X40)
| ~ aElementOf0(X42,X41)
| aElement0(X42) )
& ( ~ aElement0(X40)
| ~ aSet0(X39)
| X41 != sdtmndt0(X39,X40)
| aSet0(X41) ) ),
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_17])])])])])])]) ).
fof(c_0_20,hypothesis,
! [X204] :
( ( sdtlpdtrp0(xe,X204) = szmzizndt0(sdtlpdtrp0(xN,X204))
| ~ aElementOf0(X204,szNzAzT0) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4660])])])]) ).
fof(c_0_21,plain,
! [X9,X10] :
( aElement0(X10)
| ~ aElementOf0(X10,X9)
| ~ aSet0(X9) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_22,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5106]) ).
cnf(c_0_24,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
fof(c_0_25,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xD,xk)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_26,plain,
! [X120,X121,X122,X123,X124,X125] :
( ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| aSubsetOf0(esk11_3(X120,X121,X125),X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) != X121
| ~ aSubsetOf0(esk11_3(X120,X121,X125),X120)
| ~ aElementOf0(esk11_3(X120,X121,X125),X125) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aElementOf0(X124,X122)
| sbrdtbr0(X124) != X121
| ~ aSubsetOf0(X124,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| sbrdtbr0(X123) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| aSubsetOf0(X123,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aSet0(X122) ) ),
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)],[mDefSel])])])])])])]) ).
fof(c_0_27,hypothesis,
! [X183] :
( ( ~ aElementOf0(X183,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X183))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X183),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X183))) )
& ( ~ aElementOf0(X183,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X183))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X183),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X183)),sdtmndt0(sdtlpdtrp0(xN,X183),szmzizndt0(sdtlpdtrp0(xN,X183)))) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
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__3623])])])])]) ).
fof(c_0_28,hypothesis,
! [X184] :
( ( ~ aElementOf0(X184,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X184)) )
& ( ~ aElementOf0(X184,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X184),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])])]) ).
cnf(c_0_29,plain,
( ~ aElement0(X3)
| ~ aSet0(X2)
| X1 != sdtmndt0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,hypothesis,
xD = sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),
inference(split_conjunct,[status(thm)],[m__5585]) ).
cnf(c_0_31,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,hypothesis,
sdtlpdtrp0(xe,xn) = xp,
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_33,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_34,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_35,hypothesis,
aElementOf0(xp,xQ),
inference(split_conjunct,[status(thm)],[m__5173]) ).
cnf(c_0_36,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
fof(c_0_37,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xD,xk)),
inference(fof_simplification,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2)
| X4 != slbdtsldtrb0(X2,X3)
| sbrdtbr0(X1) != X3
| ~ aSubsetOf0(X1,X2)
| aElementOf0(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_39,plain,
! [X29,X30,X31] :
( aSubsetOf0(X29,X31)
| ~ aSubsetOf0(X30,X31)
| ~ aSubsetOf0(X29,X30)
| ~ aSet0(X31)
| ~ aSet0(X30)
| ~ aSet0(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])])]) ).
cnf(c_0_40,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X1))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_41,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_42,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_43,plain,
( ~ aSet0(X1)
| ~ aElement0(X2)
| aSet0(sdtmndt0(X1,X2)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_44,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xn),xp) = xD,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_45,hypothesis,
aElement0(xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
fof(c_0_46,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xD,xk)),
inference(fof_nnf,[status(thm)],[c_0_37]) ).
cnf(c_0_47,plain,
( ~ aSet0(X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSubsetOf0(X1,X2)
| aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1))) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_38])]) ).
cnf(c_0_48,hypothesis,
sbrdtbr0(xP) = xk,
inference(split_conjunct,[status(thm)],[m__5217]) ).
cnf(c_0_49,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_50,plain,
( ~ aSubsetOf0(X2,X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X3)
| ~ aSet0(X2)
| ~ aSet0(X1)
| aSubsetOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_51,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_52,hypothesis,
( ~ aSet0(sdtlpdtrp0(xN,xn))
| aSet0(xD) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_53,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSet0(sdtlpdtrp0(xN,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_42]),c_0_24])]) ).
cnf(c_0_54,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xD,xk)),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_55,hypothesis,
( ~ aSet0(X1)
| ~ aSubsetOf0(xP,X1)
| aElementOf0(xP,slbdtsldtrb0(X1,xk)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_56,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSubsetOf0(X3,X2)
| aSubsetOf0(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_50,c_0_22]),c_0_22]) ).
cnf(c_0_57,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(xn)),xD),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_30]),c_0_33])]) ).
cnf(c_0_58,hypothesis,
aSet0(xD),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_33])]) ).
cnf(c_0_59,negated_conjecture,
( ~ aSet0(xD)
| ~ aSubsetOf0(xP,xD) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,hypothesis,
( ~ aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| aSubsetOf0(X1,xD) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_61,hypothesis,
aSubsetOf0(xP,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[m__5334]) ).
cnf(c_0_62,negated_conjecture,
~ aSubsetOf0(xP,xD),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_58])]) ).
cnf(c_0_63,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM629+1 : 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.38 % Computer : n019.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 02:45:50 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 1.57/0.74 % Version: 3.5.1
% 1.57/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.57/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.57/0.74 % Starting new_bool_3 with 300s (1) cores
% 1.57/0.74 % Starting new_bool_1 with 300s (1) cores
% 1.57/0.74 % Starting sh5l with 300s (1) cores
% 1.57/0.74 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1525008 completed with status 0
% 1.57/0.74 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.57/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.57/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.57/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.57/0.74 % No SInE strategy applied
% 1.57/0.74 % Search class: FGHSF-FSLM31-MFFFFFNN
% 1.57/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.57/0.74 % Starting SubtermCWHack with 136s (1) cores
% 1.57/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.57/0.74 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.57/0.74 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.57/0.74 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 1.57/0.74 % SAT001_MinMin_p005000_rr_RG with pid 1525015 completed with status 0
% 1.57/0.74 % Result found by SAT001_MinMin_p005000_rr_RG
% 1.57/0.74 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.57/0.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.57/0.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.57/0.74 % No SInE strategy applied
% 1.57/0.74 % Search class: FGHSF-FSLM31-MFFFFFNN
% 1.57/0.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.57/0.74 % Starting SubtermCWHack with 136s (1) cores
% 1.57/0.74 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.57/0.74 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.57/0.74 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.57/0.74 % Preprocessing time : 0.007 s
% 1.57/0.74 % Presaturation interreduction done
% 1.57/0.74
% 1.57/0.74 % Proof found!
% 1.57/0.74 % SZS status Theorem
% 1.57/0.74 % SZS output start CNFRefutation
% See solution above
% 1.57/0.74 % Parsed axioms : 115
% 1.57/0.74 % Removed by relevancy pruning/SinE : 0
% 1.57/0.74 % Initial clauses : 221
% 1.57/0.74 % Removed in clause preprocessing : 7
% 1.57/0.74 % Initial clauses in saturation : 214
% 1.57/0.74 % Processed clauses : 1488
% 1.57/0.74 % ...of these trivial : 13
% 1.57/0.74 % ...subsumed : 501
% 1.57/0.74 % ...remaining for further processing : 974
% 1.57/0.74 % Other redundant clauses eliminated : 59
% 1.57/0.74 % Clauses deleted for lack of memory : 0
% 1.57/0.74 % Backward-subsumed : 91
% 1.57/0.74 % Backward-rewritten : 30
% 1.57/0.74 % Generated clauses : 2908
% 1.57/0.74 % ...of the previous two non-redundant : 2616
% 1.57/0.74 % ...aggressively subsumed : 0
% 1.57/0.74 % Contextual simplify-reflections : 74
% 1.57/0.74 % Paramodulations : 2851
% 1.57/0.74 % Factorizations : 0
% 1.57/0.74 % NegExts : 0
% 1.57/0.74 % Equation resolutions : 62
% 1.57/0.74 % Disequality decompositions : 0
% 1.57/0.74 % Total rewrite steps : 2131
% 1.57/0.74 % ...of those cached : 2036
% 1.57/0.74 % Propositional unsat checks : 0
% 1.57/0.74 % Propositional check models : 0
% 1.57/0.74 % Propositional check unsatisfiable : 0
% 1.57/0.74 % Propositional clauses : 0
% 1.57/0.74 % Propositional clauses after purity: 0
% 1.57/0.74 % Propositional unsat core size : 0
% 1.57/0.74 % Propositional preprocessing time : 0.000
% 1.57/0.74 % Propositional encoding time : 0.000
% 1.57/0.74 % Propositional solver time : 0.000
% 1.57/0.74 % Success case prop preproc time : 0.000
% 1.57/0.74 % Success case prop encoding time : 0.000
% 1.57/0.74 % Success case prop solver time : 0.000
% 1.57/0.74 % Current number of processed clauses : 601
% 1.57/0.74 % Positive orientable unit clauses : 118
% 1.57/0.74 % Positive unorientable unit clauses: 0
% 1.57/0.74 % Negative unit clauses : 55
% 1.57/0.74 % Non-unit-clauses : 428
% 1.57/0.74 % Current number of unprocessed clauses: 1517
% 1.57/0.74 % ...number of literals in the above : 8170
% 1.57/0.74 % Current number of archived formulas : 0
% 1.57/0.74 % Current number of archived clauses : 333
% 1.57/0.74 % Clause-clause subsumption calls (NU) : 29254
% 1.57/0.74 % Rec. Clause-clause subsumption calls : 10087
% 1.57/0.74 % Non-unit clause-clause subsumptions : 322
% 1.57/0.74 % Unit Clause-clause subsumption calls : 2444
% 1.57/0.74 % Rewrite failures with RHS unbound : 0
% 1.57/0.74 % BW rewrite match attempts : 18
% 1.57/0.74 % BW rewrite match successes : 18
% 1.57/0.74 % Condensation attempts : 0
% 1.57/0.74 % Condensation successes : 0
% 1.57/0.74 % Termbank termtop insertions : 67197
% 1.57/0.74 % Search garbage collected termcells : 3737
% 1.57/0.74
% 1.57/0.74 % -------------------------------------------------
% 1.57/0.74 % User time : 0.234 s
% 1.57/0.74 % System time : 0.015 s
% 1.57/0.74 % Total time : 0.249 s
% 1.57/0.74 % Maximum resident set size: 4288 pages
% 1.57/0.74
% 1.57/0.74 % -------------------------------------------------
% 1.57/0.74 % User time : 0.847 s
% 1.57/0.74 % System time : 0.060 s
% 1.57/0.74 % Total time : 0.907 s
% 1.57/0.74 % Maximum resident set size: 4864 pages
% 1.57/0.74 % E exiting
%------------------------------------------------------------------------------