%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n017.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 : Fri Sep 25 01:57:06 PM UTC 2026
% Result : Theorem 7.61s 1.49s
% Output : Proof 7.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 83 ( 3 equ)
% Maximal formula atoms : 12 ( 8 avg)
% Number of connectives : 97 ( 24 ~; 19 |; 45 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 1 sgn 16 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f30,conjecture,
? [W0] :
( aSupremumOfIn0(W0,xT,xS)
| ( ! [W1] :
( ( aUpperBoundOfIn0(W1,xT,xS)
& ! [W2] :
( aElementOf0(W2,xT)
=> sdtlseqdt0(W2,W1) )
& aElementOf0(W1,xS) )
=> sdtlseqdt0(W0,W1) )
& ( aUpperBoundOfIn0(W0,xT,xS)
| ( ! [W1] :
( aElementOf0(W1,xT)
=> sdtlseqdt0(W1,W0) )
& aElementOf0(W0,xS) ) )
& aElementOf0(W0,xS) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f30_neg,negated_conjecture,
~ ? [W0] :
( aSupremumOfIn0(W0,xT,xS)
| ( ! [W1] :
( ( aUpperBoundOfIn0(W1,xT,xS)
& ! [W2] :
( aElementOf0(W2,xT)
=> sdtlseqdt0(W2,W1) )
& aElementOf0(W1,xS) )
=> sdtlseqdt0(W0,W1) )
& ( aUpperBoundOfIn0(W0,xT,xS)
| ( ! [W1] :
( aElementOf0(W1,xT)
=> sdtlseqdt0(W1,W0) )
& aElementOf0(W0,xS) ) )
& aElementOf0(W0,xS) ) ),
inference(negated_conjecture,[status(cth)],[f30]) ).
fof(f30_nnf,plain,
! [W0] :
( ~ aSupremumOfIn0(W0,xT,xS)
& ( ? [W1] :
( ~ sdtlseqdt0(W0,W1)
& aUpperBoundOfIn0(W1,xT,xS)
& ! [W2] :
( sdtlseqdt0(W2,W1)
| ~ aElementOf0(W2,xT) )
& aElementOf0(W1,xS) )
| ( ~ aUpperBoundOfIn0(W0,xT,xS)
& ( ? [W1] :
( ~ sdtlseqdt0(W1,W0)
& aElementOf0(W1,xT) )
| ~ aElementOf0(W0,xS) ) )
| ~ aElementOf0(W0,xS) ) ),
inference(nnf_transformation,[status(thm)],[f30_neg]) ).
fof(f30_sk,plain,
! [W0,W2] :
( ~ aSupremumOfIn0(W0,xT,xS)
& ( ( ~ sdtlseqdt0(W0,sk20(W0))
& aUpperBoundOfIn0(sk20(W0),xT,xS)
& ( sdtlseqdt0(W2,sk20(W0))
| ~ aElementOf0(W2,xT) )
& aElementOf0(sk20(W0),xS) )
| ( ~ aUpperBoundOfIn0(W0,xT,xS)
& ( ( ~ sdtlseqdt0(sk19(W0),W0)
& aElementOf0(sk19(W0),xT) )
| ~ aElementOf0(W0,xS) ) )
| ~ aElementOf0(W0,xS) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk19,sk20])],[f30_nnf]) ).
cnf(c161,plain,
~ aSupremumOfIn0(X0,xT,xS),
inference(cnf_transformation,[status(esa)],[f30_sk]) ).
fof(f29,hypothesis,
( aSupremumOfIn0(xp,xT,xS)
& ! [W0] :
( ( aUpperBoundOfIn0(W0,xT,xS)
| ( ! [W1] :
( aElementOf0(W1,xT)
=> sdtlseqdt0(W1,W0) )
& aElementOf0(W0,xS) ) )
=> sdtlseqdt0(xp,W0) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [W0] :
( aElementOf0(W0,xT)
=> sdtlseqdt0(W0,xp) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1330) ).
fof(f29_nnf,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [W0] :
( sdtlseqdt0(xp,W0)
| ( ~ aUpperBoundOfIn0(W0,xT,xS)
& ( ? [W1] :
( ~ sdtlseqdt0(W1,W0)
& aElementOf0(W1,xT) )
| ~ aElementOf0(W0,xS) ) ) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [W0] :
( sdtlseqdt0(W0,xp)
| ~ aElementOf0(W0,xT) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(nnf_transformation,[status(thm)],[f29]) ).
fof(f29_sk,plain,
! [W0] :
( aSupremumOfIn0(xp,xT,xS)
& ( sdtlseqdt0(xp,W0)
| ( ~ aUpperBoundOfIn0(W0,xT,xS)
& ( ( ~ sdtlseqdt0(sk18(W0),W0)
& aElementOf0(sk18(W0),xT) )
| ~ aElementOf0(W0,xS) ) ) )
& aUpperBoundOfIn0(xp,xT,xS)
& ( sdtlseqdt0(W0,xp)
| ~ aElementOf0(W0,xT) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk18])],[f29_nnf]) ).
cnf(c148,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnf_transformation,[status(esa)],[f29_sk]) ).
cnf(p179,plain,
$false,
inference(resolution,[status(thm)],[c161,c148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.12/0.37 % Computer : n017.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Wed Sep 23 21:27:00 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.61/1.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.61/1.49 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------