%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 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 : Thu Sep 24 08:48:29 AM UTC 2026
% Result : Theorem 0.13s 10.79s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 152 ( 4 equ)
% Maximal formula atoms : 22 ( 8 avg)
% Number of connectives : 200 ( 65 ~; 46 |; 80 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 55 ( 1 sgn 43 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1330,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('theBenchmark.p',m__1330) ).
fof(m__,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('theBenchmark.p',m__) ).
fof(f_30_1,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(fof_nnf,[status(thm)],[m__1330]) ).
fof(f_30_2,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [U_110] :
( sdtlseqdt0(xp,U_110)
| ( ~ aUpperBoundOfIn0(U_110,xT,xS)
& ( ? [U_109] :
( ~ sdtlseqdt0(U_109,U_110)
& aElementOf0(U_109,xT) )
| ~ aElementOf0(U_110,xS) ) ) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [U_108] :
( sdtlseqdt0(U_108,xp)
| ~ aElementOf0(U_108,xT) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(variable_rename,[status(thm)],[f_30_1]) ).
fof(f_30_3,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [U_110] :
( sdtlseqdt0(xp,U_110)
| ( ~ aUpperBoundOfIn0(U_110,xT,xS)
& ( ( ~ sdtlseqdt0(sK19(U_110),U_110)
& aElementOf0(sK19(U_110),xT) )
| ~ aElementOf0(U_110,xS) ) ) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [U_108] :
( sdtlseqdt0(U_108,xp)
| ~ aElementOf0(U_108,xT) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19]),skolemize(U_109,sK19(U_110))],[f_30_2]) ).
cnf(f_30_12,plain,
aSupremumOfIn0(xp,xT,xS),
inference(clausify,[status(thm)],[f_30_3]) ).
fof(f_31_1,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(negate,[status(cth)],[m__]) ).
fof(f_31_2,negated_conjecture,
! [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(fof_nnf,[status(thm)],[f_31_1]) ).
fof(f_31_3,negated_conjecture,
! [U_114] :
( ~ aSupremumOfIn0(U_114,xT,xS)
& ( ? [U_113] :
( ~ sdtlseqdt0(U_114,U_113)
& aUpperBoundOfIn0(U_113,xT,xS)
& ! [U_112] :
( sdtlseqdt0(U_112,U_113)
| ~ aElementOf0(U_112,xT) )
& aElementOf0(U_113,xS) )
| ( ~ aUpperBoundOfIn0(U_114,xT,xS)
& ( ? [U_111] :
( ~ sdtlseqdt0(U_111,U_114)
& aElementOf0(U_111,xT) )
| ~ aElementOf0(U_114,xS) ) )
| ~ aElementOf0(U_114,xS) ) ),
inference(variable_rename,[status(thm)],[f_31_2]) ).
fof(f_31_4,negated_conjecture,
( ! [U_116] : ~ aSupremumOfIn0(U_116,xT,xS)
& ! [U_115] :
( ? [U_113] :
( ~ sdtlseqdt0(U_115,U_113)
& aUpperBoundOfIn0(U_113,xT,xS)
& ! [U_112] :
( sdtlseqdt0(U_112,U_113)
| ~ aElementOf0(U_112,xT) )
& aElementOf0(U_113,xS) )
| ( ~ aUpperBoundOfIn0(U_115,xT,xS)
& ( ? [U_111] :
( ~ sdtlseqdt0(U_111,U_115)
& aElementOf0(U_111,xT) )
| ~ aElementOf0(U_115,xS) ) )
| ~ aElementOf0(U_115,xS) ) ),
inference(miniscope,[status(thm)],[f_31_3]) ).
fof(f_31_5,negated_conjecture,
( ! [U_116] : ~ aSupremumOfIn0(U_116,xT,xS)
& ! [U_115] :
( ? [U_113] :
( ~ sdtlseqdt0(U_115,U_113)
& aUpperBoundOfIn0(U_113,xT,xS)
& ! [U_112] :
( sdtlseqdt0(U_112,U_113)
| ~ aElementOf0(U_112,xT) )
& aElementOf0(U_113,xS) )
| ( ~ aUpperBoundOfIn0(U_115,xT,xS)
& ( ( ~ sdtlseqdt0(sK20(U_115),U_115)
& aElementOf0(sK20(U_115),xT) )
| ~ aElementOf0(U_115,xS) ) )
| ~ aElementOf0(U_115,xS) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(U_111,sK20(U_115))],[f_31_4]) ).
fof(f_31_6,negated_conjecture,
( ! [U_116] : ~ aSupremumOfIn0(U_116,xT,xS)
& ! [U_115] :
( ( ~ sdtlseqdt0(U_115,sK21(U_115))
& aUpperBoundOfIn0(sK21(U_115),xT,xS)
& ! [U_112] :
( sdtlseqdt0(U_112,sK21(U_115))
| ~ aElementOf0(U_112,xT) )
& aElementOf0(sK21(U_115),xS) )
| ( ~ aUpperBoundOfIn0(U_115,xT,xS)
& ( ( ~ sdtlseqdt0(sK20(U_115),U_115)
& aElementOf0(sK20(U_115),xT) )
| ~ aElementOf0(U_115,xS) ) )
| ~ aElementOf0(U_115,xS) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(U_113,sK21(U_115))],[f_31_5]) ).
fof(f_31_7,negated_conjecture,
( ! [U_112,U_115] :
( ~ sdtlseqdt0(U_115,sK21(U_115))
| ~ sP2(U_112,U_115) )
& ! [U_112,U_115] :
( aUpperBoundOfIn0(sK21(U_115),xT,xS)
| ~ sP2(U_112,U_115) )
& ! [U_112,U_115] :
( sdtlseqdt0(U_112,sK21(U_115))
| ~ aElementOf0(U_112,xT)
| ~ sP2(U_112,U_115) )
& ! [U_112,U_115] :
( aElementOf0(sK21(U_115),xS)
| ~ sP2(U_112,U_115) )
& ! [U_115] :
( ~ sdtlseqdt0(sK20(U_115),U_115)
| ~ sP0(U_115) )
& ! [U_115] :
( aElementOf0(sK20(U_115),xT)
| ~ sP0(U_115) )
& ! [U_115] :
( ~ aUpperBoundOfIn0(U_115,xT,xS)
| ~ sP1(U_115) )
& ! [U_115] :
( sP0(U_115)
| ~ aElementOf0(U_115,xS)
| ~ sP1(U_115) )
& ! [U_116] : ~ aSupremumOfIn0(U_116,xT,xS)
& ! [U_112,U_115] :
( sP2(U_112,U_115)
| sP1(U_115)
| ~ aElementOf0(U_115,xS) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2])],[f_31_6]) ).
cnf(f_31_9,negated_conjecture,
~ aSupremumOfIn0(U_116,xT,xS),
inference(clausify,[status(thm)],[f_31_7]) ).
cnf(t1,plain,
~ aSupremumOfIn0(xp,xT,xS),
inference(start,[status(thm),parent(0:0)],[f_31_9]) ).
cnf(t2,plain,
aSupremumOfIn0(xp,xT,xS),
inference(extension,[status(thm),parent(t1:1)],[f_30_12]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/10.58 % Computer : n002.cluster.edu
% 0.11/10.58 % Model : x86_64 x86_64
% 0.11/10.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.58 % Memory : 8046.5625MB
% 0.11/10.58 % OS : Linux 6.8.0-71-generic
% 0.11/10.58 % CPULimit : 300
% 0.11/10.58 % WCLimit : 300
% 0.11/10.58 % DateTime : Sat Sep 19 13:55:00 UTC 2026
% 0.11/10.58 % CPUTime :
% 0.13/10.79 % SZS status Theorem for theBenchmark
% 0.13/10.79 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------