%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT382+3 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n025.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:25 PM UTC 2026
% Result : Theorem 1.26s 1.71s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 112 ( 6 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 114 ( 27 ~; 30 |; 41 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__792,hypothesis,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(xu,X1) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(X1,xu) )
& aInfimumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(xv,X1) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(X1,xv) )
& aInfimumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__792) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(mASymm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
fof(m__773,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773) ).
fof(m__,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(c_0_5,hypothesis,
( aElementOf0(xu,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(xu,X1) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(X1,xu) )
& aInfimumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(xv,X1) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X1] :
( ( ( aElementOf0(X1,xT)
& ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X1,X2) ) )
| aLowerBoundOfIn0(X1,xS,xT) )
=> sdtlseqdt0(X1,xv) )
& aInfimumOfIn0(xv,xS,xT) ),
inference(fof_simplification,[status(thm)],[m__792]) ).
fof(c_0_6,hypothesis,
! [X94,X95,X97,X98] :
( aElementOf0(xu,xT)
& ( ~ aElementOf0(X94,xS)
| sdtlseqdt0(xu,X94) )
& aLowerBoundOfIn0(xu,xS,xT)
& ( aElementOf0(esk7_1(X95),xS)
| ~ aElementOf0(X95,xT)
| sdtlseqdt0(X95,xu) )
& ( ~ sdtlseqdt0(X95,esk7_1(X95))
| ~ aElementOf0(X95,xT)
| sdtlseqdt0(X95,xu) )
& ( ~ aLowerBoundOfIn0(X95,xS,xT)
| sdtlseqdt0(X95,xu) )
& aInfimumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ( ~ aElementOf0(X97,xS)
| sdtlseqdt0(xv,X97) )
& aLowerBoundOfIn0(xv,xS,xT)
& ( aElementOf0(esk8_1(X98),xS)
| ~ aElementOf0(X98,xT)
| sdtlseqdt0(X98,xv) )
& ( ~ sdtlseqdt0(X98,esk8_1(X98))
| ~ aElementOf0(X98,xT)
| sdtlseqdt0(X98,xv) )
& ( ~ aLowerBoundOfIn0(X98,xS,xT)
| sdtlseqdt0(X98,xv) )
& aInfimumOfIn0(xv,xS,xT) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_7,plain,
! [X49,X50] :
( ~ aSet0(X49)
| ~ aElementOf0(X50,X49)
| aElement0(X50) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
fof(c_0_8,plain,
! [X60,X61] :
( ~ aElement0(X60)
| ~ aElement0(X61)
| ~ sdtlseqdt0(X60,X61)
| ~ sdtlseqdt0(X61,X60)
| X60 = X61 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mASymm])]) ).
cnf(c_0_9,hypothesis,
( sdtlseqdt0(X1,xu)
| ~ aLowerBoundOfIn0(X1,xS,xT) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aLowerBoundOfIn0(xv,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xv,xT),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__773]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xu,xT),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_15,negated_conjecture,
xu != xv,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,hypothesis,
sdtlseqdt0(xv,xu),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_18,hypothesis,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_19,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
xu != xv,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,hypothesis,
( sdtlseqdt0(X1,xv)
| ~ aLowerBoundOfIn0(X1,xS,xT) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,hypothesis,
aLowerBoundOfIn0(xu,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,hypothesis,
~ sdtlseqdt0(xu,xv),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT382+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n025.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 21:48:28 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.26/1.71 % Version : CSE_E---1.7
% 1.26/1.71 % Problem : theBenchmark.p
% 1.26/1.71 % SZS status Theorem for theBenchmark.p
% 1.26/1.71 % SZS output start CNFRefutation
% See solution above
% 1.26/1.71 % Total time : 1.372s
%------------------------------------------------------------------------------