%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUM604+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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 : Sun Sep 27 08:13:18 AM UTC 2026
% Result : Theorem 106.95s 31.60s
% Output : CNFRefutation 106.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 51 ( 19 unt; 3 def)
% Number of atoms : 118 ( 20 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 111 ( 44 ~; 41 |; 14 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 13 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefEmp,definition,
! [X0] :
( X0 = slcrc0
<=> ( ~ ? [X1] : aElementOf0(X1,X0)
& aSet0(X0) ) ) ).
fof(mCountNFin_01,axiom,
! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> X0 != slcrc0 ) ).
fof(mDefSub,definition,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) )
& aSet0(X1) ) ) ) ).
fof(mSubTrans,axiom,
! [X0,X1,X2] :
( ( aSet0(X2)
& aSet0(X1)
& aSet0(X0) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X0,X1) )
=> aSubsetOf0(X0,X2) ) ) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ) ).
fof(mDefMin,definition,
! [X0] :
( ( X0 != slcrc0
& aSubsetOf0(X0,szNzAzT0) )
=> ! [X1] :
( X1 = szmzizndt0(X0)
<=> ( ! [X2] :
( aElementOf0(X2,X0)
=> sdtlseqdt0(X1,X2) )
& aElementOf0(X1,X0) ) ) ) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ) ).
fof(m__3671,hypothesis,
! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X0))
& aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) ) ) ).
fof(m__4660,hypothesis,
( ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> sdtlpdtrp0(xe,X0) = szmzizndt0(sdtlpdtrp0(xN,X0)) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ) ).
fof(m__5034,hypothesis,
( sdtlpdtrp0(xe,xi) = xx
& aElementOf0(xi,szNzAzT0) ) ).
fof(m__5045,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ).
fof(m__,conjecture,
aElementOf0(xx,xS) ).
fof(negated_conjecture,negated_conjecture,
~ aElementOf0(xx,xS),
inference(negate_conjecture,[status(cth)],[m__]) ).
cnf(c1,plain,
( aSet0(X0)
| X0 != slcrc0 ),
inference(clausification,[status(esa)],[mDefEmp]) ).
cnf(c6,plain,
( X0 != slcrc0
| ~ aSet0(X0)
| ~ isCountable0(X0) ),
inference(clausification,[status(esa)],[mCountNFin_01]) ).
cnf(c7,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(clausification,[status(esa)],[mDefSub]) ).
cnf(c8,plain,
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(clausification,[status(esa)],[mDefSub]) ).
cnf(c14,plain,
( ~ aSubsetOf0(X2,X0)
| ~ aSet0(X2)
| ~ aSet0(X0)
| aSubsetOf0(X2,X1)
| ~ aSet0(X1)
| ~ aSubsetOf0(X0,X1) ),
inference(clausification,[status(esa)],[mSubTrans]) ).
cnf(c45,plain,
aSet0(szNzAzT0),
inference(clausification,[status(esa)],[mNATSet]) ).
cnf(c74,plain,
( aElementOf0(X1,X0)
| szmzizndt0(X0) != X1
| ~ aSubsetOf0(X0,szNzAzT0)
| X0 = slcrc0 ),
inference(clausification,[status(esa)],[mDefMin]) ).
cnf(c159,plain,
aSubsetOf0(xS,szNzAzT0),
inference(clausification,[status(esa)],[m__3435]) ).
cnf(c178,plain,
( isCountable0(sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ),
inference(clausification,[status(esa)],[m__3671]) ).
cnf(c196,plain,
( szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(clausification,[status(esa)],[m__4660]) ).
cnf(c212,plain,
aElementOf0(xi,szNzAzT0),
inference(clausification,[status(esa)],[m__5034]) ).
cnf(c213,plain,
sdtlpdtrp0(xe,xi) = xx,
inference(clausification,[status(esa)],[m__5034]) ).
cnf(c214,plain,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(clausification,[status(esa)],[m__5045]) ).
cnf(c215,plain,
~ aElementOf0(xx,xS),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xi))
| aElementOf0(X0,xS)
| ~ aSet0(xS) ),
inference(resolution,[status(thm)],[c214,c8]) ).
cnf(d1,plain,
( ~ aSet0(szNzAzT0)
| aSet0(xS) ),
inference(resolution,[status(thm)],[c159,c7]) ).
cnf(d2,plain,
aSet0(xS),
inference(resolution,[status(thm)],[c45,d1]) ).
cnf(d3,plain,
( aElementOf0(X0,xS)
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xi)) ),
inference(resolution,[status(thm)],[d2,d0]) ).
cnf(d4,plain,
( ~ aSubsetOf0(X0,szNzAzT0)
| aElementOf0(szmzizndt0(X0),X0)
| X0 = slcrc0 ),
inference(equality_resolution,[status(thm)],[c74]) ).
cnf(d5,plain,
szmzizndt0(sdtlpdtrp0(xN,xi)) = sdtlpdtrp0(xe,xi),
inference(resolution,[status(thm)],[c196,c212]) ).
cnf(d6,plain,
szmzizndt0(sdtlpdtrp0(xN,xi)) = xx,
inference(demodulation,[status(thm)],[d5,c213]) ).
cnf(d7,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| sdtlpdtrp0(xN,xi) = slcrc0
| aElementOf0(xx,sdtlpdtrp0(xN,xi)) ),
inference(superposition,[status(thm)],[d6,d4]) ).
cnf(d8,plain,
( ~ aSubsetOf0(X0,xS)
| aSubsetOf0(X0,szNzAzT0)
| ~ aSet0(xS)
| ~ aSet0(szNzAzT0)
| ~ aSet0(X0) ),
inference(resolution,[status(thm)],[c159,c14]) ).
cnf(d9,plain,
( ~ aSubsetOf0(X0,xS)
| aSubsetOf0(X0,szNzAzT0)
| ~ aSet0(xS)
| ~ aSet0(X0) ),
inference(resolution,[status(thm)],[c45,d8]) ).
cnf(d10,plain,
( ~ aSubsetOf0(X0,xS)
| aSubsetOf0(X0,szNzAzT0)
| ~ aSet0(X0) ),
inference(resolution,[status(thm)],[d2,d9]) ).
cnf(d11,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,xi)) ),
inference(resolution,[status(thm)],[d10,c214]) ).
cnf(d12,plain,
( ~ aSet0(xS)
| aSet0(sdtlpdtrp0(xN,xi)) ),
inference(resolution,[status(thm)],[c214,c7]) ).
cnf(d13,plain,
aSet0(sdtlpdtrp0(xN,xi)),
inference(resolution,[status(thm)],[d2,d12]) ).
cnf(d14,plain,
aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0),
inference(resolution,[status(thm)],[d13,d11]) ).
cnf(d15,plain,
( aElementOf0(xx,sdtlpdtrp0(xN,xi))
| sdtlpdtrp0(xN,xi) = slcrc0 ),
inference(resolution,[status(thm)],[d14,d7]) ).
cnf(d16,plain,
( aElementOf0(xx,xS)
| sdtlpdtrp0(xN,xi) = slcrc0 ),
inference(resolution,[status(thm)],[d15,d3]) ).
cnf(d17,plain,
sdtlpdtrp0(xN,xi) = slcrc0,
inference(resolution,[status(thm)],[c215,d16]) ).
cnf(d18,plain,
( ~ aElementOf0(xi,szNzAzT0)
| isCountable0(slcrc0) ),
inference(superposition,[status(thm)],[d17,c178]) ).
cnf(d19,plain,
isCountable0(slcrc0),
inference(resolution,[status(thm)],[c212,d18]) ).
cnf(d20,plain,
( ~ isCountable0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(equality_resolution,[status(thm)],[c6]) ).
cnf(d21,plain,
aSet0(slcrc0),
inference(equality_resolution,[status(thm)],[c1]) ).
cnf(d22,plain,
~ isCountable0(slcrc0),
inference(resolution,[status(thm)],[d21,d20]) ).
cnf(d23,plain,
$false,
inference(resolution,[status(thm)],[d22,d19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM604+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 03:25:18 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 106.95/31.60 % SZS status Theorem for theBenchmark.p
% 106.95/31.60 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------