%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM620+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:58:03 PM UTC 2026
% Result : Theorem 1.51s 1.77s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 11 unt; 0 def)
% Number of atoms : 142 ( 31 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 162 ( 66 ~; 62 |; 22 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 24 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(mDefMin,axiom,
! [X1] :
( ( aSubsetOf0(X1,szNzAzT0)
& X1 != slcrc0 )
=> ! [X2] :
( X2 = szmzizndt0(X1)
<=> ( aElementOf0(X2,X1)
& ! [X3] :
( aElementOf0(X3,X1)
=> sdtlseqdt0(X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefMin) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3671) ).
fof(mNATSet,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(m__5401,hypothesis,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5401) ).
fof(m__5389,hypothesis,
( aElementOf0(xm,szNzAzT0)
& xx = sdtlpdtrp0(xe,xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5389) ).
fof(mCountNFin_01,axiom,
! [X1] :
( ( aSet0(X1)
& isCountable0(X1) )
=> X1 != slcrc0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCountNFin_01) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
& szszuzczcdt0(X1) != sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccNum) ).
fof(m__5309,hypothesis,
( aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xn,szNzAzT0)
& sdtlpdtrp0(xe,xn) = xp ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5309) ).
fof(c_0_11,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_12,plain,
! [X186,X187,X188,X189] :
( ( aSet0(X187)
| ~ aSubsetOf0(X187,X186)
| ~ aSet0(X186) )
& ( ~ aElementOf0(X188,X187)
| aElementOf0(X188,X186)
| ~ aSubsetOf0(X187,X186)
| ~ aSet0(X186) )
& ( aElementOf0(esk2_2(X186,X189),X189)
| ~ aSet0(X189)
| aSubsetOf0(X189,X186)
| ~ aSet0(X186) )
& ( ~ aElementOf0(esk2_2(X186,X189),X186)
| ~ aSet0(X189)
| aSubsetOf0(X189,X186)
| ~ aSet0(X186) ) ),
inference(distribute,[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_13,negated_conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X257,X258,X259,X260] :
( ( aElementOf0(X258,X257)
| X258 != szmzizndt0(X257)
| ~ aSubsetOf0(X257,szNzAzT0)
| X257 = slcrc0 )
& ( ~ aElementOf0(X259,X257)
| sdtlseqdt0(X258,X259)
| X258 != szmzizndt0(X257)
| ~ aSubsetOf0(X257,szNzAzT0)
| X257 = slcrc0 )
& ( aElementOf0(esk7_2(X257,X260),X257)
| ~ aElementOf0(X260,X257)
| X260 = szmzizndt0(X257)
| ~ aSubsetOf0(X257,szNzAzT0)
| X257 = slcrc0 )
& ( ~ sdtlseqdt0(X260,esk7_2(X257,X260))
| ~ aElementOf0(X260,X257)
| X260 = szmzizndt0(X257)
| ~ aSubsetOf0(X257,szNzAzT0)
| X257 = slcrc0 ) ),
inference(distribute,[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)],[mDefMin])])])])])]) ).
cnf(c_0_15,plain,
( aElementOf0(X1,X3)
| ~ aElementOf0(X1,X2)
| ~ aSubsetOf0(X2,X3)
| ~ aSet0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,hypothesis,
! [X346] :
( ( aSubsetOf0(sdtlpdtrp0(xN,X346),szNzAzT0)
| ~ aElementOf0(X346,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X346))
| ~ aElementOf0(X346,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])]) ).
cnf(c_0_18,plain,
( aElementOf0(X1,X2)
| X2 = slcrc0
| X1 != szmzizndt0(X2)
| ~ aSubsetOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_24,plain,
( X1 = slcrc0
| aElementOf0(szmzizndt0(X1),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_25,hypothesis,
xx = szmzizndt0(sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[m__5401]) ).
cnf(c_0_26,negated_conjecture,
( ~ aElementOf0(xx,sdtlpdtrp0(xN,xm))
| ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,hypothesis,
( aSet0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_28,hypothesis,
( sdtlpdtrp0(xN,xm) = slcrc0
| aElementOf0(xx,sdtlpdtrp0(xN,xm))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5389]) ).
fof(c_0_30,plain,
! [X185] :
( ~ aSet0(X185)
| ~ isCountable0(X185)
| X185 != slcrc0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCountNFin_01])]) ).
fof(c_0_31,plain,
! [X180,X181,X182] :
( ( aSet0(X180)
| X180 != slcrc0 )
& ( ~ aElementOf0(X181,X180)
| X180 != slcrc0 )
& ( ~ aSet0(X182)
| aElementOf0(esk1_1(X182),X182)
| X182 = slcrc0 ) ),
inference(distribute,[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)],[mDefEmp])])])])])]) ).
cnf(c_0_32,negated_conjecture,
( ~ aElementOf0(xx,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,hypothesis,
( sdtlpdtrp0(xN,xm) = slcrc0
| aElementOf0(xx,sdtlpdtrp0(xN,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_22]),c_0_29])]) ).
fof(c_0_34,plain,
! [X225] :
( ( aElementOf0(szszuzczcdt0(X225),szNzAzT0)
| ~ aElementOf0(X225,szNzAzT0) )
& ( szszuzczcdt0(X225) != sz00
| ~ aElementOf0(X225,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccNum])])]) ).
cnf(c_0_35,plain,
( ~ aSet0(X1)
| ~ isCountable0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,hypothesis,
( sdtlpdtrp0(xN,xm) = slcrc0
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
cnf(c_0_40,plain,
( ~ isCountable0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_41,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_42,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_43,hypothesis,
sdtlpdtrp0(xN,xm) = slcrc0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_44,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_29])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUM620+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.32 % Computer : n017.cluster.edu
% 0.16/0.32 % Model : x86_64 x86_64
% 0.16/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32 % Memory : 8042.1875MB
% 0.16/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32 % CPULimit : 300
% 0.16/0.32 % WCLimit : 300
% 0.16/0.32 % DateTime : Tue May 5 00:50:27 EDT 2026
% 0.16/0.32 % CPUTime :
% 0.16/0.33 % start to proof: theBenchmark
% 1.51/1.77 % Version : CSE_E---1.7
% 1.51/1.77 % Problem : theBenchmark.p
% 1.51/1.77 % SZS status Theorem for theBenchmark.p
% 1.51/1.77 % SZS output start CNFRefutation
% See solution above
% 1.51/1.78 % Total time : 1.372s
%------------------------------------------------------------------------------