%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT388+4 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:38:26 PM UTC 2026
% Result : Theorem 0.30s 1.63s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 100 ( 2 equ)
% Maximal formula atoms : 48 ( 12 avg)
% Number of connectives : 134 ( 42 ~; 46 |; 37 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 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 : 17 ( 1 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( aElementOf0(X1,xS)
& ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
& ! [X2] :
( ( aElementOf0(X2,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS) )
=> sdtlseqdt0(X1,X2) ) )
| aSupremumOfIn0(X1,xT,xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__1330,hypothesis,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X1] :
( ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
=> sdtlseqdt0(xp,X1) )
& aSupremumOfIn0(xp,xT,xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1330) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] :
( ( aElementOf0(X1,xS)
& ( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) ) )
| aUpperBoundOfIn0(X1,xT,xS) )
& ! [X2] :
( ( aElementOf0(X2,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS) )
=> sdtlseqdt0(X1,X2) ) )
| aSupremumOfIn0(X1,xT,xS) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,hypothesis,
! [X176,X177] :
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ( ~ aElementOf0(X176,xT)
| sdtlseqdt0(X176,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ( aElementOf0(esk15_1(X177),xT)
| ~ aElementOf0(X177,xS)
| sdtlseqdt0(xp,X177) )
& ( ~ sdtlseqdt0(esk15_1(X177),X177)
| ~ aElementOf0(X177,xS)
| sdtlseqdt0(xp,X177) )
& ( ~ aUpperBoundOfIn0(X177,xT,xS)
| sdtlseqdt0(xp,X177) )
& aSupremumOfIn0(xp,xT,xS) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1330])])])])]) ).
fof(c_0_4,negated_conjecture,
! [X179,X182,X183] :
( ( aElementOf0(esk17_1(X179),xS)
| aElementOf0(esk16_1(X179),xT)
| ~ aElementOf0(X179,xS)
| ~ aElementOf0(X179,xS) )
& ( ~ aElementOf0(X182,xT)
| sdtlseqdt0(X182,esk17_1(X179))
| aElementOf0(esk16_1(X179),xT)
| ~ aElementOf0(X179,xS)
| ~ aElementOf0(X179,xS) )
& ( aUpperBoundOfIn0(esk17_1(X179),xT,xS)
| aElementOf0(esk16_1(X179),xT)
| ~ aElementOf0(X179,xS)
| ~ aElementOf0(X179,xS) )
& ( ~ sdtlseqdt0(X179,esk17_1(X179))
| aElementOf0(esk16_1(X179),xT)
| ~ aElementOf0(X179,xS)
| ~ aElementOf0(X179,xS) )
& ( aElementOf0(esk17_1(X179),xS)
| ~ sdtlseqdt0(esk16_1(X179),X179)
| ~ aElementOf0(X179,xS)
| ~ aElementOf0(X179,xS) )
& ( ~ aElementOf0(X182,xT)
| sdtlseqdt0(X182,esk17_1(X179))
| ~ sdtlseqdt0(esk16_1(X179),X179)
| ~ aElementOf0(X179,xS)
| ~ aElementOf0(X179,xS) )
& ( aUpperBoundOfIn0(esk17_1(X179),xT,xS)
| ~ sdtlseqdt0(esk16_1(X179),X179)
| ~ aElementOf0(X179,xS)
| ~ aElementOf0(X179,xS) )
& ( ~ sdtlseqdt0(X179,esk17_1(X179))
| ~ sdtlseqdt0(esk16_1(X179),X179)
| ~ aElementOf0(X179,xS)
| ~ aElementOf0(X179,xS) )
& ( aElementOf0(esk17_1(X179),xS)
| ~ aUpperBoundOfIn0(X179,xT,xS)
| ~ aElementOf0(X179,xS) )
& ( ~ aElementOf0(X182,xT)
| sdtlseqdt0(X182,esk17_1(X179))
| ~ aUpperBoundOfIn0(X179,xT,xS)
| ~ aElementOf0(X179,xS) )
& ( aUpperBoundOfIn0(esk17_1(X179),xT,xS)
| ~ aUpperBoundOfIn0(X179,xT,xS)
| ~ aElementOf0(X179,xS) )
& ( ~ sdtlseqdt0(X179,esk17_1(X179))
| ~ aUpperBoundOfIn0(X179,xT,xS)
| ~ aElementOf0(X179,xS) )
& ~ aSupremumOfIn0(X183,xT,xS) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
cnf(c_0_5,hypothesis,
aSupremumOfIn0(xp,xT,xS),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
~ aSupremumOfIn0(X1,xT,xS),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT388+4 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n021.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 21:50:40 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.30/1.63 % Version : CSE_E---1.7
% 0.30/1.63 % Problem : theBenchmark.p
% 0.30/1.63 % SZS status Theorem for theBenchmark.p
% 0.30/1.63 % SZS output start CNFRefutation
% See solution above
% 0.30/1.63 % Total time : 1.273s
%------------------------------------------------------------------------------