%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUM633+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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:24 AM UTC 2026
% Result : Theorem 19.96s 2.97s
% Output : CNFRefutation 19.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 59 ( 16 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 66 ( 27 ~; 19 |; 14 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__4854,hypothesis,
( isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(szDzizrdt0(xd),xT) ) ).
fof(m__4908,hypothesis,
( isCountable0(xO)
& aSet0(xO) ) ).
fof(m__4998,hypothesis,
aSubsetOf0(xO,xS) ).
fof(m__,conjecture,
( ! [X0] :
( aElementOf0(X0,slbdtsldtrb0(xO,xK))
=> ( sdtlpdtrp0(xc,X0) = szDzizrdt0(xd)
& aElementOf0(X0,szDzozmdt0(xc))
& aSubsetOf0(X0,szNzAzT0)
& X0 != slcrc0 ) )
=> ? [X0] :
( ? [X1] :
( ! [X2] :
( aElementOf0(X2,slbdtsldtrb0(X1,xK))
=> sdtlpdtrp0(xc,X2) = X0 )
& isCountable0(X1)
& aSubsetOf0(X1,xS) )
& aElementOf0(X0,xT) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ( ! [X0] :
( aElementOf0(X0,slbdtsldtrb0(xO,xK))
=> ( sdtlpdtrp0(xc,X0) = szDzizrdt0(xd)
& aElementOf0(X0,szDzozmdt0(xc))
& aSubsetOf0(X0,szNzAzT0)
& X0 != slcrc0 ) )
=> ? [X0] :
( ? [X1] :
( ! [X2] :
( aElementOf0(X2,slbdtsldtrb0(X1,xK))
=> sdtlpdtrp0(xc,X2) = X0 )
& isCountable0(X1)
& aSubsetOf0(X1,xS) )
& aElementOf0(X0,xT) ) ),
inference(negate_conjecture,[status(cth)],[m__]) ).
cnf(c218,plain,
aElementOf0(szDzizrdt0(xd),xT),
inference(clausification,[status(esa)],[m__4854]) ).
cnf(c223,plain,
isCountable0(xO),
inference(clausification,[status(esa)],[m__4908]) ).
cnf(c227,plain,
aSubsetOf0(xO,xS),
inference(clausification,[status(esa)],[m__4998]) ).
cnf(c231,plain,
( sdtlpdtrp0(xc,X0) = szDzizrdt0(xd)
| ~ aElementOf0(X0,slbdtsldtrb0(xO,xK)) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c232,plain,
( aElementOf0(sK195(X0,X1),slbdtsldtrb0(X1,xK))
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(X0,xT) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c233,plain,
( sdtlpdtrp0(xc,sK195(X0,X1)) != X0
| ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(X0,xT) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( sdtlpdtrp0(xc,sK195(X0,xO)) = szDzizrdt0(xd)
| ~ aSubsetOf0(xO,xS)
| ~ isCountable0(xO)
| ~ aElementOf0(X0,xT) ),
inference(resolution,[status(thm)],[c232,c231]) ).
cnf(d1,plain,
( ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(X0,xT)
| sdtlpdtrp0(xc,sK195(X0,xO)) = szDzizrdt0(xd) ),
inference(resolution,[status(thm)],[c223,d0]) ).
cnf(d2,plain,
( ~ aElementOf0(X0,xT)
| sdtlpdtrp0(xc,sK195(X0,xO)) = szDzizrdt0(xd) ),
inference(resolution,[status(thm)],[c227,d1]) ).
cnf(d3,plain,
sdtlpdtrp0(xc,sK195(szDzizrdt0(xd),xO)) = szDzizrdt0(xd),
inference(resolution,[status(thm)],[d2,c218]) ).
cnf(d4,plain,
( ~ aSubsetOf0(xO,xS)
| ~ isCountable0(xO)
| ~ aElementOf0(szDzizrdt0(xd),xT)
| szDzizrdt0(xd) != szDzizrdt0(xd) ),
inference(superposition,[status(thm)],[d3,c233]) ).
cnf(d5,plain,
( ~ aSubsetOf0(xO,xS)
| ~ aElementOf0(szDzizrdt0(xd),xT)
| szDzizrdt0(xd) != szDzizrdt0(xd) ),
inference(resolution,[status(thm)],[c223,d4]) ).
cnf(d6,plain,
( ~ aSubsetOf0(xO,xS)
| szDzizrdt0(xd) != szDzizrdt0(xd) ),
inference(resolution,[status(thm)],[c218,d5]) ).
cnf(d7,plain,
szDzizrdt0(xd) != szDzizrdt0(xd),
inference(resolution,[status(thm)],[c227,d6]) ).
cnf(d8,plain,
$false,
inference(equality_resolution,[status(thm)],[d7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM633+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n015.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 03:34:13 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.96/2.97 % SZS status Theorem for theBenchmark.p
% 19.96/2.97 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------