%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LAT381+3 : 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 : n002.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 07:48:34 AM UTC 2026
% Result : Theorem 12.67s 7.57s
% Output : CNFRefutation 12.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 15 unt; 0 def)
% Number of atoms : 70 ( 6 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 64 ( 21 ~; 18 |; 15 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mEOfElem,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ) ).
fof(mASymm,axiom,
! [X0,X1] :
( ( aElement0(X1)
& aElement0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ) ).
fof(m__725,hypothesis,
aSet0(xT) ).
fof(m__744,hypothesis,
( aSupremumOfIn0(xv,xS,xT)
& ! [X0] :
( ( aUpperBoundOfIn0(X0,xS,xT)
| ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xT) ) )
=> sdtlseqdt0(xv,X0) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(X0,xv) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X0] :
( ( aUpperBoundOfIn0(X0,xS,xT)
| ( ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xT) ) )
=> sdtlseqdt0(xu,X0) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(X0,xu) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ) ).
fof(m__,conjecture,
xu = xv ).
fof(negated_conjecture,negated_conjecture,
xu != xv,
inference(negate_conjecture,[status(cth)],[m__]) ).
cnf(c0,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(clausification,[status(esa)],[mEOfElem]) ).
cnf(c8,plain,
( ~ aElement0(X1)
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| X0 = X1 ),
inference(clausification,[status(esa)],[mASymm]) ).
cnf(c32,plain,
aSet0(xT),
inference(clausification,[status(esa)],[m__725]) ).
cnf(c36,plain,
aElementOf0(xu,xT),
inference(clausification,[status(esa)],[m__744]) ).
cnf(c39,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(clausification,[status(esa)],[m__744]) ).
cnf(c42,plain,
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(clausification,[status(esa)],[m__744]) ).
cnf(c44,plain,
aElementOf0(xv,xT),
inference(clausification,[status(esa)],[m__744]) ).
cnf(c47,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(clausification,[status(esa)],[m__744]) ).
cnf(c50,plain,
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(clausification,[status(esa)],[m__744]) ).
cnf(c52,plain,
xu != xv,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[status(thm)],[c42,c47]) ).
cnf(d1,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xu)
| ~ aElement0(xv)
| xu = xv ),
inference(resolution,[status(thm)],[d0,c8]) ).
cnf(d2,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xv)
| ~ aElement0(xu) ),
inference(resolution,[status(thm)],[c52,d1]) ).
cnf(d3,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c36,c0]) ).
cnf(d4,plain,
aElement0(xu),
inference(resolution,[status(thm)],[c32,d3]) ).
cnf(d5,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ aElement0(xv) ),
inference(resolution,[status(thm)],[d4,d2]) ).
cnf(d6,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[c44,c0]) ).
cnf(d7,plain,
aElement0(xv),
inference(resolution,[status(thm)],[c32,d6]) ).
cnf(d8,plain,
~ sdtlseqdt0(xv,xu),
inference(resolution,[status(thm)],[d7,d5]) ).
cnf(d9,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[status(thm)],[c50,c39]) ).
cnf(d10,plain,
$false,
inference(resolution,[status(thm)],[d9,d8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT381+3 : 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.09/5.95 % Computer : n002.cluster.edu
% 0.09/5.95 % Model : x86_64 x86_64
% 0.09/5.95 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.95 % Memory : 8046.5625MB
% 0.09/5.95 % OS : Linux 6.8.0-71-generic
% 0.09/5.95 % CPULimit : 300
% 0.09/5.95 % WCLimit : 300
% 0.09/5.95 % DateTime : Fri Sep 25 21:40:27 UTC 2026
% 0.09/5.95 % CPUTime :
% 0.09/5.95 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.67/7.57 % SZS status Theorem for theBenchmark.p
% 12.67/7.57 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------