%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LAT381+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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:03:03 PM UTC 2026
% Result : Theorem 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 53 ( 19 unt; 1 def)
% Number of atoms : 159 ( 10 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 186 ( 80 ~; 78 |; 19 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 52 ( 50 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aElementOf0(W1,W0)
=> aElement0(W1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [W0,W1] :
( ( aElement0(W1)
& aElement0(W0) )
=> ( ( sdtlseqdt0(W1,W0)
& sdtlseqdt0(W0,W1) )
=> W0 = W1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,definition,
! [W0] :
( aSet0(W0)
=> ! [W1] :
( aSubsetOf0(W1,W0)
=> ! [W2] :
( aSupremumOfIn0(W2,W1,W0)
<=> ( ! [W3] :
( aUpperBoundOfIn0(W3,W1,W0)
=> sdtlseqdt0(W2,W3) )
& aUpperBoundOfIn0(W2,W1,W0)
& aElementOf0(W2,W0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,hypothesis,
( aSupremumOfIn0(xv,xS,xT)
& aSupremumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
xu != xv,
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f25,plain,
! [W0] :
( ! [W1] :
( aElement0(W1)
| ~ aElementOf0(W1,W0) )
| ~ aSet0(W0) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f26,plain,
! [X0,X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[status(thm)],[f25]) ).
fof(f44,plain,
! [W0,W1] :
( W0 = W1
| ~ sdtlseqdt0(W1,W0)
| ~ sdtlseqdt0(W0,W1)
| ~ aElement0(W1)
| ~ aElement0(W0) ),
inference(pre_NNF_transformation,[status(thm)],[f8]) ).
fof(f45,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElement0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f73,plain,
! [W0] :
( ! [W1] :
( ! [W2] :
( aSupremumOfIn0(W2,W1,W0)
<=> ( ! [W3] :
( sdtlseqdt0(W2,W3)
| ~ aUpperBoundOfIn0(W3,W1,W0) )
& aUpperBoundOfIn0(W2,W1,W0)
& aElementOf0(W2,W0) ) )
| ~ aSubsetOf0(W1,W0) )
| ~ aSet0(W0) ),
inference(pre_NNF_transformation,[status(thm)],[f13]) ).
fof(f74,plain,
! [W0] :
( ! [W1] :
( ! [W2] :
( ( ? [W3] :
( ~ sdtlseqdt0(W2,W3)
& aUpperBoundOfIn0(W3,W1,W0) )
| ~ aUpperBoundOfIn0(W2,W1,W0)
| ~ aElementOf0(W2,W0)
| aSupremumOfIn0(W2,W1,W0) )
& ( ( ! [W3] :
( sdtlseqdt0(W2,W3)
| ~ aUpperBoundOfIn0(W3,W1,W0) )
& aUpperBoundOfIn0(W2,W1,W0)
& aElementOf0(W2,W0) )
| ~ aSupremumOfIn0(W2,W1,W0) ) )
| ~ aSubsetOf0(W1,W0) )
| ~ aSet0(W0) ),
inference(NNF_transformation,[status(thm)],[f73]) ).
fof(f75,plain,
! [W0] :
( ! [W1] :
( ( ! [W2] :
( ? [W3] :
( ~ sdtlseqdt0(W2,W3)
& aUpperBoundOfIn0(W3,W1,W0) )
| ~ aUpperBoundOfIn0(W2,W1,W0)
| ~ aElementOf0(W2,W0)
| aSupremumOfIn0(W2,W1,W0) )
& ! [W2] :
( ( ! [W3] :
( sdtlseqdt0(W2,W3)
| ~ aUpperBoundOfIn0(W3,W1,W0) )
& aUpperBoundOfIn0(W2,W1,W0)
& aElementOf0(W2,W0) )
| ~ aSupremumOfIn0(W2,W1,W0) ) )
| ~ aSubsetOf0(W1,W0) )
| ~ aSet0(W0) ),
inference(miniscoping,[status(thm)],[f74]) ).
fof(f76,plain,
! [W0] :
( ! [W1] :
( ( ! [W2] :
( ( ~ sdtlseqdt0(W2,sK5_skl(W2,W1,W0))
& aUpperBoundOfIn0(sK5_skl(W2,W1,W0),W1,W0) )
| ~ aUpperBoundOfIn0(W2,W1,W0)
| ~ aElementOf0(W2,W0)
| aSupremumOfIn0(W2,W1,W0) )
& ! [W2] :
( ( ! [W3] :
( sdtlseqdt0(W2,W3)
| ~ aUpperBoundOfIn0(W3,W1,W0) )
& aUpperBoundOfIn0(W2,W1,W0)
& aElementOf0(W2,W0) )
| ~ aSupremumOfIn0(W2,W1,W0) ) )
| ~ aSubsetOf0(W1,W0) )
| ~ aSet0(W0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl]),skolemize(W3,sK5_skl(W2,W1,W0))],[f75]) ).
fof(f77,plain,
! [X0,X1,X2] :
( aElementOf0(X2,X0)
| ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[status(thm)],[f76]) ).
fof(f78,plain,
! [X0,X1,X2] :
( aUpperBoundOfIn0(X2,X1,X0)
| ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[status(thm)],[f76]) ).
fof(f79,plain,
! [X0,X1,X2,X3] :
( sdtlseqdt0(X2,X3)
| ~ aUpperBoundOfIn0(X3,X1,X0)
| ~ aSupremumOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[status(thm)],[f76]) ).
fof(f82,plain,
aSet0(xT),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f83,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[status(thm)],[f15]) ).
fof(f84,plain,
aSupremumOfIn0(xu,xS,xT),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f85,plain,
aSupremumOfIn0(xv,xS,xT),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f86,plain,
xu != xv,
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f109,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[f77,f85]) ).
fof(f110,plain,
( aElementOf0(xu,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[f77,f84]) ).
fof(f111,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(forward_subsumption_resolution,[status(thm)],[f109,f82]) ).
fof(f112,plain,
( aElementOf0(xu,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(forward_subsumption_resolution,[status(thm)],[f110,f82]) ).
fof(f113,plain,
aElementOf0(xv,xT),
inference(forward_subsumption_resolution,[status(thm)],[f111,f83]) ).
fof(f115,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[f113,f26]) ).
fof(f117,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[status(thm)],[f115,f82]) ).
fof(f127,plain,
aElementOf0(xu,xT),
inference(forward_subsumption_resolution,[status(thm)],[f112,f83]) ).
fof(f129,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[f127,f26]) ).
fof(f130,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[status(thm)],[f129,f82]) ).
fof(f169,plain,
( aUpperBoundOfIn0(xv,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[f78,f85]) ).
fof(f170,plain,
( aUpperBoundOfIn0(xu,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[f78,f84]) ).
fof(f171,plain,
( aUpperBoundOfIn0(xv,xS,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(forward_subsumption_resolution,[status(thm)],[f169,f82]) ).
fof(f172,plain,
( aUpperBoundOfIn0(xu,xS,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(forward_subsumption_resolution,[status(thm)],[f170,f82]) ).
fof(f173,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(forward_subsumption_resolution,[status(thm)],[f171,f83]) ).
fof(f175,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(forward_subsumption_resolution,[status(thm)],[f172,f83]) ).
fof(f195,plain,
! [X0] :
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[f79,f85]) ).
fof(f196,plain,
! [X0] :
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[status(thm)],[f79,f84]) ).
fof(f197,plain,
! [X0] :
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(forward_subsumption_resolution,[status(thm)],[f195,f82]) ).
fof(f198,plain,
! [X0] :
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT)
| ~ aSubsetOf0(xS,xT) ),
inference(forward_subsumption_resolution,[status(thm)],[f196,f82]) ).
fof(f199,plain,
! [X0] :
( sdtlseqdt0(xv,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(forward_subsumption_resolution,[status(thm)],[f197,f83]) ).
fof(f200,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[status(thm)],[f199,f175]) ).
fof(f203,plain,
( xv = xu
| ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(resolution,[status(thm)],[f200,f45]) ).
fof(f205,plain,
( xv = xu
| ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xu) ),
inference(forward_subsumption_resolution,[status(thm)],[f203,f117]) ).
fof(f206,plain,
( xv = xu
| ~ sdtlseqdt0(xu,xv) ),
inference(forward_subsumption_resolution,[status(thm)],[f205,f130]) ).
fof(f209,plain,
! [X0] :
( sdtlseqdt0(xu,X0)
| ~ aUpperBoundOfIn0(X0,xS,xT) ),
inference(forward_subsumption_resolution,[status(thm)],[f198,f83]) ).
fof(f211,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[status(thm)],[f209,f173]) ).
fof(f212,plain,
xv = xu,
inference(backward_subsumption_resolution,[status(thm)],[f206,f211]) ).
fof(f216,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f212,f86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LAT381+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 % Computer : n010.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 20 23:56:55 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.46 % Drodi V4.1.1
% 0.18/0.49 % Refutation found
% 0.18/0.49 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.51 % Elapsed time: 0.060928 seconds
% 0.18/0.51 % CPU time: 0.187745 seconds
% 0.18/0.51 % Total memory used: 54.153 MB
% 0.18/0.51 % Net memory used: 53.950 MB
%------------------------------------------------------------------------------