%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LAT385+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 : Tue Sep 29 11:47:33 AM UTC 2026
% Result : Theorem 3.25s 1.33s
% Output : Refutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 8 unt; 5 def)
% Number of atoms : 438 ( 19 equ)
% Maximal formula atoms : 37 ( 8 avg)
% Number of connectives : 516 ( 127 ~; 116 |; 235 &)
% ( 1 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 2 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 125 ( 0 sgn 92 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f24,axiom,
( aSet0(xU)
& ! [X0] :
( ( ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xU) ) )
| aSubsetOf0(X0,xU) )
=> ? [X1] :
( aElementOf0(X1,xU)
& aElementOf0(X1,xU)
& ! [X2] :
( aElementOf0(X2,X0)
=> sdtlseqdt0(X1,X2) )
& aLowerBoundOfIn0(X1,X0,xU)
& ! [X2] :
( ( ( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X0)
=> sdtlseqdt0(X2,X3) ) )
| aLowerBoundOfIn0(X2,X0,xU) )
=> sdtlseqdt0(X2,X1) )
& aInfimumOfIn0(X1,X0,xU)
& ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X0)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,X0,xU)
& ! [X3] :
( ( ( aElementOf0(X3,xU)
& ! [X4] :
( aElementOf0(X4,X0)
=> sdtlseqdt0(X4,X3) ) )
| aUpperBoundOfIn0(X3,X0,xU) )
=> sdtlseqdt0(X2,X3) )
& aSupremumOfIn0(X2,X0,xU) ) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X0,X1] :
( ( aElementOf0(X0,szDzozmdt0(xf))
& aElementOf0(X1,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X0,X1)
=> sdtlseqdt0(sdtlpdtrp0(xf,X0),sdtlpdtrp0(xf,X1)) ) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1123) ).
fof(f27,axiom,
( aSet0(xP)
& ! [X0] :
( ( aElementOf0(X0,xP)
=> ( aElementOf0(X0,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aUpperBoundOfIn0(X0,xT,xU) ) )
& ( ( aElementOf0(X0,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
| aUpperBoundOfIn0(X0,xT,xU) ) )
=> aElementOf0(X0,xP) ) )
& xP = cS1241(xU,xf,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1244) ).
fof(f28,conjecture,
? [X0] :
( ( aElementOf0(X0,xU)
& ( ( aElementOf0(X0,xU)
& ! [X1] :
( aElementOf0(X1,xP)
=> sdtlseqdt0(X0,X1) ) )
| aLowerBoundOfIn0(X0,xP,xU) )
& ! [X1] :
( ( aElementOf0(X1,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) )
& aLowerBoundOfIn0(X1,xP,xU) )
=> sdtlseqdt0(X1,X0) ) )
| aInfimumOfIn0(X0,xP,xU) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f29,negated_conjecture,
~ ? [X0] :
( ( aElementOf0(X0,xU)
& ( ( aElementOf0(X0,xU)
& ! [X1] :
( aElementOf0(X1,xP)
=> sdtlseqdt0(X0,X1) ) )
| aLowerBoundOfIn0(X0,xP,xU) )
& ! [X1] :
( ( aElementOf0(X1,xU)
& ! [X2] :
( aElementOf0(X2,xP)
=> sdtlseqdt0(X1,X2) )
& aLowerBoundOfIn0(X1,xP,xU) )
=> sdtlseqdt0(X1,X0) ) )
| aInfimumOfIn0(X0,xP,xU) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f34,plain,
( aSet0(xU)
& ! [X0] :
( ( ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xU) ) )
| aSubsetOf0(X0,xU) )
=> ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,X0)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,X0,xU)
& ! [X4] :
( ( ( aElementOf0(X4,xU)
& ! [X5] :
( aElementOf0(X5,X0)
=> sdtlseqdt0(X4,X5) ) )
| aLowerBoundOfIn0(X4,X0,xU) )
=> sdtlseqdt0(X4,X2) )
& aInfimumOfIn0(X2,X0,xU)
& ? [X6] :
( aElementOf0(X6,xU)
& aElementOf0(X6,xU)
& ! [X7] :
( aElementOf0(X7,X0)
=> sdtlseqdt0(X7,X6) )
& aUpperBoundOfIn0(X6,X0,xU)
& ! [X8] :
( ( ( aElementOf0(X8,xU)
& ! [X9] :
( aElementOf0(X9,X0)
=> sdtlseqdt0(X9,X8) ) )
| aUpperBoundOfIn0(X8,X0,xU) )
=> sdtlseqdt0(X6,X8) )
& aSupremumOfIn0(X6,X0,xU) ) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X10,X11] :
( ( aElementOf0(X10,szDzozmdt0(xf))
& aElementOf0(X11,szDzozmdt0(xf)) )
=> ( sdtlseqdt0(X10,X11)
=> sdtlseqdt0(sdtlpdtrp0(xf,X10),sdtlpdtrp0(xf,X11)) ) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
inference(rectify,[],[f24]) ).
fof(f35,plain,
( aSet0(xP)
& ! [X0] :
( ( aElementOf0(X0,xP)
=> ( aElementOf0(X0,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aUpperBoundOfIn0(X0,xT,xU) ) )
& ( ( aElementOf0(X0,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& ( ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X0) )
| aUpperBoundOfIn0(X0,xT,xU) ) )
=> aElementOf0(X0,xP) ) )
& xP = cS1241(xU,xf,xT) ),
inference(rectify,[],[f27]) ).
fof(f36,plain,
~ ? [X0] :
( ( aElementOf0(X0,xU)
& ( ( aElementOf0(X0,xU)
& ! [X1] :
( aElementOf0(X1,xP)
=> sdtlseqdt0(X0,X1) ) )
| aLowerBoundOfIn0(X0,xP,xU) )
& ! [X2] :
( ( aElementOf0(X2,xU)
& ! [X3] :
( aElementOf0(X3,xP)
=> sdtlseqdt0(X2,X3) )
& aLowerBoundOfIn0(X2,xP,xU) )
=> sdtlseqdt0(X2,X0) ) )
| aInfimumOfIn0(X0,xP,xU) ),
inference(rectify,[],[f29]) ).
fof(f63,plain,
( aSet0(xU)
& ! [X0] :
( ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aElementOf0(X3,X0) )
& aLowerBoundOfIn0(X2,X0,xU)
& ! [X4] :
( sdtlseqdt0(X4,X2)
| ( ( ~ aElementOf0(X4,xU)
| ? [X5] :
( ~ sdtlseqdt0(X4,X5)
& aElementOf0(X5,X0) ) )
& ~ aLowerBoundOfIn0(X4,X0,xU) ) )
& aInfimumOfIn0(X2,X0,xU)
& ? [X6] :
( aElementOf0(X6,xU)
& aElementOf0(X6,xU)
& ! [X7] :
( sdtlseqdt0(X7,X6)
| ~ aElementOf0(X7,X0) )
& aUpperBoundOfIn0(X6,X0,xU)
& ! [X8] :
( sdtlseqdt0(X6,X8)
| ( ( ~ aElementOf0(X8,xU)
| ? [X9] :
( ~ sdtlseqdt0(X9,X8)
& aElementOf0(X9,X0) ) )
& ~ aUpperBoundOfIn0(X8,X0,xU) ) )
& aSupremumOfIn0(X6,X0,xU) ) )
| ( ( ~ aSet0(X0)
| ? [X1] :
( ~ aElementOf0(X1,xU)
& aElementOf0(X1,X0) ) )
& ~ aSubsetOf0(X0,xU) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X10,X11] :
( sdtlseqdt0(sdtlpdtrp0(xf,X10),sdtlpdtrp0(xf,X11))
| ~ sdtlseqdt0(X10,X11)
| ~ aElementOf0(X10,szDzozmdt0(xf))
| ~ aElementOf0(X11,szDzozmdt0(xf)) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
inference(ennf_transformation,[],[f34]) ).
fof(f64,plain,
( aSet0(xU)
& ! [X0] :
( ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aElementOf0(X3,X0) )
& aLowerBoundOfIn0(X2,X0,xU)
& ! [X4] :
( sdtlseqdt0(X4,X2)
| ( ( ~ aElementOf0(X4,xU)
| ? [X5] :
( ~ sdtlseqdt0(X4,X5)
& aElementOf0(X5,X0) ) )
& ~ aLowerBoundOfIn0(X4,X0,xU) ) )
& aInfimumOfIn0(X2,X0,xU)
& ? [X6] :
( aElementOf0(X6,xU)
& aElementOf0(X6,xU)
& ! [X7] :
( sdtlseqdt0(X7,X6)
| ~ aElementOf0(X7,X0) )
& aUpperBoundOfIn0(X6,X0,xU)
& ! [X8] :
( sdtlseqdt0(X6,X8)
| ( ( ~ aElementOf0(X8,xU)
| ? [X9] :
( ~ sdtlseqdt0(X9,X8)
& aElementOf0(X9,X0) ) )
& ~ aUpperBoundOfIn0(X8,X0,xU) ) )
& aSupremumOfIn0(X6,X0,xU) ) )
| ( ( ~ aSet0(X0)
| ? [X1] :
( ~ aElementOf0(X1,xU)
& aElementOf0(X1,X0) ) )
& ~ aSubsetOf0(X0,xU) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X10,X11] :
( sdtlseqdt0(sdtlpdtrp0(xf,X10),sdtlpdtrp0(xf,X11))
| ~ sdtlseqdt0(X10,X11)
| ~ aElementOf0(X10,szDzozmdt0(xf))
| ~ aElementOf0(X11,szDzozmdt0(xf)) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
inference(flattening,[],[f63]) ).
fof(f67,plain,
( aSet0(xP)
& ! [X0] :
( ( ( aElementOf0(X0,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& ! [X1] :
( sdtlseqdt0(X1,X0)
| ~ aElementOf0(X1,xT) )
& aUpperBoundOfIn0(X0,xT,xU) )
| ~ aElementOf0(X0,xP) )
& ( aElementOf0(X0,xP)
| ~ aElementOf0(X0,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
| ( ? [X2] :
( ~ sdtlseqdt0(X2,X0)
& aElementOf0(X2,xT) )
& ~ aUpperBoundOfIn0(X0,xT,xU) ) ) )
& xP = cS1241(xU,xf,xT) ),
inference(ennf_transformation,[],[f35]) ).
fof(f68,plain,
( aSet0(xP)
& ! [X0] :
( ( ( aElementOf0(X0,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& ! [X1] :
( sdtlseqdt0(X1,X0)
| ~ aElementOf0(X1,xT) )
& aUpperBoundOfIn0(X0,xT,xU) )
| ~ aElementOf0(X0,xP) )
& ( aElementOf0(X0,xP)
| ~ aElementOf0(X0,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
| ( ? [X2] :
( ~ sdtlseqdt0(X2,X0)
& aElementOf0(X2,xT) )
& ~ aUpperBoundOfIn0(X0,xT,xU) ) ) )
& xP = cS1241(xU,xf,xT) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
! [X0] :
( ( ~ aElementOf0(X0,xU)
| ( ( ~ aElementOf0(X0,xU)
| ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aElementOf0(X1,xP) ) )
& ~ aLowerBoundOfIn0(X0,xP,xU) )
| ? [X2] :
( ~ sdtlseqdt0(X2,X0)
& aElementOf0(X2,xU)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aElementOf0(X3,xP) )
& aLowerBoundOfIn0(X2,xP,xU) ) )
& ~ aInfimumOfIn0(X0,xP,xU) ),
inference(ennf_transformation,[],[f36]) ).
fof(f70,plain,
! [X0] :
( ( ~ aElementOf0(X0,xU)
| ( ( ~ aElementOf0(X0,xU)
| ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aElementOf0(X1,xP) ) )
& ~ aLowerBoundOfIn0(X0,xP,xU) )
| ? [X2] :
( ~ sdtlseqdt0(X2,X0)
& aElementOf0(X2,xU)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aElementOf0(X3,xP) )
& aLowerBoundOfIn0(X2,xP,xU) ) )
& ~ aInfimumOfIn0(X0,xP,xU) ),
inference(flattening,[],[f69]) ).
fof(f71,definition,
! [X0] :
( ? [X6] :
( aElementOf0(X6,xU)
& aElementOf0(X6,xU)
& ! [X7] :
( sdtlseqdt0(X7,X6)
| ~ aElementOf0(X7,X0) )
& aUpperBoundOfIn0(X6,X0,xU)
& ! [X8] :
( sdtlseqdt0(X6,X8)
| ( ( ~ aElementOf0(X8,xU)
| ? [X9] :
( ~ sdtlseqdt0(X9,X8)
& aElementOf0(X9,X0) ) )
& ~ aUpperBoundOfIn0(X8,X0,xU) ) )
& aSupremumOfIn0(X6,X0,xU) )
| ~ sP0(X0) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f72,definition,
! [X2,X0] :
( ! [X4] :
( sdtlseqdt0(X4,X2)
| ( ( ~ aElementOf0(X4,xU)
| ? [X5] :
( ~ sdtlseqdt0(X4,X5)
& aElementOf0(X5,X0) ) )
& ~ aLowerBoundOfIn0(X4,X0,xU) ) )
| ~ sP1(X2,X0) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f73,definition,
! [X0] :
( ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aElementOf0(X3,X0) )
& aLowerBoundOfIn0(X2,X0,xU)
& sP1(X2,X0)
& aInfimumOfIn0(X2,X0,xU)
& sP0(X0) )
| ~ sP2(X0) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f74,plain,
( aSet0(xU)
& ! [X0] :
( sP2(X0)
| ( ( ~ aSet0(X0)
| ? [X1] :
( ~ aElementOf0(X1,xU)
& aElementOf0(X1,X0) ) )
& ~ aSubsetOf0(X0,xU) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X10,X11] :
( sdtlseqdt0(sdtlpdtrp0(xf,X10),sdtlpdtrp0(xf,X11))
| ~ sdtlseqdt0(X10,X11)
| ~ aElementOf0(X10,szDzozmdt0(xf))
| ~ aElementOf0(X11,szDzozmdt0(xf)) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
inference(definition_folding,[],[f64,f73,f72,f71]) ).
fof(f75,definition,
! [X0] :
( ? [X2] :
( ~ sdtlseqdt0(X2,X0)
& aElementOf0(X2,xU)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aElementOf0(X3,xP) )
& aLowerBoundOfIn0(X2,xP,xU) )
| ~ sP3(X0) ),
introduced(definition,[new_symbols(definition,[sP3])],[predicate_definition_introduction]) ).
fof(f76,plain,
! [X0] :
( ( ~ aElementOf0(X0,xU)
| ( ( ~ aElementOf0(X0,xU)
| ? [X1] :
( ~ sdtlseqdt0(X0,X1)
& aElementOf0(X1,xP) ) )
& ~ aLowerBoundOfIn0(X0,xP,xU) )
| sP3(X0) )
& ~ aInfimumOfIn0(X0,xP,xU) ),
inference(definition_folding,[],[f70,f75]) ).
fof(f108,plain,
! [X0] :
( ? [X2] :
( aElementOf0(X2,xU)
& aElementOf0(X2,xU)
& ! [X3] :
( sdtlseqdt0(X2,X3)
| ~ aElementOf0(X3,X0) )
& aLowerBoundOfIn0(X2,X0,xU)
& sP1(X2,X0)
& aInfimumOfIn0(X2,X0,xU)
& sP0(X0) )
| ~ sP2(X0) ),
inference(nnf_transformation,[],[f73]) ).
fof(f109,plain,
! [X0] :
( ? [X1] :
( aElementOf0(X1,xU)
& aElementOf0(X1,xU)
& ! [X2] :
( sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,X0) )
& aLowerBoundOfIn0(X1,X0,xU)
& sP1(X1,X0)
& aInfimumOfIn0(X1,X0,xU)
& sP0(X0) )
| ~ sP2(X0) ),
inference(rectify,[],[f108]) ).
fof(f110,plain,
! [X0] :
( ( aElementOf0(sK14(X0),xU)
& aElementOf0(sK14(X0),xU)
& ! [X2] :
( sdtlseqdt0(sK14(X0),X2)
| ~ aElementOf0(X2,X0) )
& aLowerBoundOfIn0(sK14(X0),X0,xU)
& sP1(sK14(X0),X0)
& aInfimumOfIn0(sK14(X0),X0,xU)
& sP0(X0) )
| ~ sP2(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X1,sK14(X0))],[f109]) ).
fof(f117,plain,
( aSet0(xU)
& ! [X0] :
( sP2(X0)
| ( ( ~ aSet0(X0)
| ? [X1] :
( ~ aElementOf0(X1,xU)
& aElementOf0(X1,X0) ) )
& ~ aSubsetOf0(X0,xU) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X2,X3] :
( sdtlseqdt0(sdtlpdtrp0(xf,X2),sdtlpdtrp0(xf,X3))
| ~ sdtlseqdt0(X2,X3)
| ~ aElementOf0(X2,szDzozmdt0(xf))
| ~ aElementOf0(X3,szDzozmdt0(xf)) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
inference(rectify,[],[f74]) ).
fof(f118,plain,
( aSet0(xU)
& ! [X0] :
( sP2(X0)
| ( ( ~ aSet0(X0)
| ( ~ aElementOf0(sK18(X0),xU)
& aElementOf0(sK18(X0),X0) ) )
& ~ aSubsetOf0(X0,xU) ) )
& aCompleteLattice0(xU)
& aFunction0(xf)
& ! [X2,X3] :
( sdtlseqdt0(sdtlpdtrp0(xf,X2),sdtlpdtrp0(xf,X3))
| ~ sdtlseqdt0(X2,X3)
| ~ aElementOf0(X2,szDzozmdt0(xf))
| ~ aElementOf0(X3,szDzozmdt0(xf)) )
& isMonotone0(xf)
& szDzozmdt0(xf) = szRzazndt0(xf)
& szRzazndt0(xf) = xU
& isOn0(xf,xU) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18]),skolemize(X1,sK18(X0))],[f117]) ).
fof(f119,plain,
( aSet0(xP)
& ! [X0] :
( ( ( aElementOf0(X0,xU)
& sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
& ! [X1] :
( sdtlseqdt0(X1,X0)
| ~ aElementOf0(X1,xT) )
& aUpperBoundOfIn0(X0,xT,xU) )
| ~ aElementOf0(X0,xP) )
& ( aElementOf0(X0,xP)
| ~ aElementOf0(X0,xU)
| ~ sdtlseqdt0(sdtlpdtrp0(xf,X0),X0)
| ( ~ sdtlseqdt0(sK19(X0),X0)
& aElementOf0(sK19(X0),xT)
& ~ aUpperBoundOfIn0(X0,xT,xU) ) ) )
& xP = cS1241(xU,xf,xT) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19]),skolemize(X2,sK19(X0))],[f68]) ).
fof(f123,plain,
! [X0] :
( ( ~ aElementOf0(X0,xU)
| ( ( ~ aElementOf0(X0,xU)
| ( ~ sdtlseqdt0(X0,sK21(X0))
& aElementOf0(sK21(X0),xP) ) )
& ~ aLowerBoundOfIn0(X0,xP,xU) )
| sP3(X0) )
& ~ aInfimumOfIn0(X0,xP,xU) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(X1,sK21(X0))],[f76]) ).
fof(f172,plain,
! [X0] :
( ~ sP2(X0)
| aInfimumOfIn0(sK14(X0),X0,xU) ),
inference(cnf_transformation,[],[f110]) ).
fof(f197,plain,
! [X0] :
( sP2(X0)
| ~ aSet0(X0)
| aElementOf0(sK18(X0),X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f198,plain,
! [X0] :
( ~ aElementOf0(sK18(X0),xU)
| ~ aSet0(X0)
| sP2(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f217,plain,
! [X0] :
( aElementOf0(X0,xU)
| ~ aElementOf0(X0,xP) ),
inference(cnf_transformation,[],[f119]) ).
fof(f218,plain,
aSet0(xP),
inference(cnf_transformation,[],[f119]) ).
fof(f223,plain,
! [X0] : ~ aInfimumOfIn0(X0,xP,xU),
inference(cnf_transformation,[],[f123]) ).
fof(f238,plain,
! [X0] :
( ~ aElementOf0(sK18(X0),xP)
| sP2(X0)
| ~ aSet0(X0) ),
inference(resolution,[],[f198,f217]) ).
fof(f333,definition,
( spl22_7
<=> sP2(xP) ),
introduced(definition,[new_symbols(definition,[spl22_7])],[avatar_definition]) ).
fof(f334,plain,
( sP2(xP)
| ~ spl22_7 ),
inference(avatar_component_clause,[],[f333]) ).
fof(f335,plain,
( ~ sP2(xP)
| spl22_7 ),
inference(avatar_component_clause,[],[f333]) ).
fof(f343,plain,
( ~ aSet0(xP)
| aElementOf0(sK18(xP),xP)
| spl22_7 ),
inference(resolution,[],[f335,f197]) ).
fof(f344,plain,
( aElementOf0(sK18(xP),xP)
| spl22_7 ),
inference(forward_subsumption_resolution,[],[f343,f218]) ).
fof(f346,plain,
( sP2(xP)
| ~ aSet0(xP)
| spl22_7 ),
inference(resolution,[],[f344,f238]) ).
fof(f347,plain,
( ~ aSet0(xP)
| spl22_7 ),
inference(forward_subsumption_resolution,[],[f346,f335]) ).
fof(f348,plain,
( $false
| spl22_7 ),
inference(forward_subsumption_resolution,[],[f347,f218]) ).
fof(f349,plain,
spl22_7,
inference(avatar_contradiction_clause,[],[f348]) ).
fof(f350,plain,
( aInfimumOfIn0(sK14(xP),xP,xU)
| ~ spl22_7 ),
inference(resolution,[],[f334,f172]) ).
fof(f353,plain,
( $false
| ~ spl22_7 ),
inference(forward_subsumption_resolution,[],[f350,f223]) ).
fof(f354,plain,
~ spl22_7,
inference(avatar_contradiction_clause,[],[f353]) ).
cnf(s6,plain,
spl22_7,
inference(sat_conversion,[],[f349]) ).
cnf(s7,plain,
~ spl22_7,
inference(sat_conversion,[],[f354]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s6,s7]) ).
fof(f355,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT385+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n020.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 15:13:49 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.25/1.33 % (3514787)Detected formulas, will run a generic FOF schedule.
% 3.25/1.33 % (3514792)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2969540743:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.25/1.33 % (3514798)dis-21_1_sil=8000:lcm=predicate:random_seed=1767125114:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.25/1.33 % (3514793)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=659660268:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.25/1.33 % (3514796)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3853194825:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.25/1.33 % (3514794)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2140581120:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.25/1.33 % (3514795)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=640141495:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.25/1.33 % (3514797)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1327706175:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.25/1.33 % (3514797)First to succeed.
% 3.25/1.33 % (3514795)Also succeeded, but the first one will report.
% 3.25/1.33 % (3514797)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3514787"
% 3.25/1.33 % (3514796)Also succeeded, but the first one will report.
% 3.25/1.33 % (3514798)Instruction limit reached!
% 3.25/1.33 % (3514798)------------------------------
% 3.25/1.33 % (3514798)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.25/1.33 % (3514798)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.25/1.33 % (3514798)CaDiCaL version: 2.1.3
% 3.25/1.33 % (3514798)Termination reason: Instruction limit
% 3.25/1.33 % (3514798)Termination phase: Saturation
% 3.25/1.33 % (3514798)Time elapsed: 0.074 s
% 3.25/1.33 % (3514798)Peak memory usage: 89 MB
% 3.25/1.33 % (3514798)Instructions burned: 129 (million)
% 3.25/1.33 % (3514806)lrs+10_1_sil=8000:sp=occurrence:random_seed=2514774886:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.25/1.33 % (3514806)Also succeeded, but the first one will report.
% 3.25/1.33 % (3514797)Refutation found. Thanks to Tanya!
% 3.25/1.33 % SZS status Theorem for theBenchmark
% 3.25/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 3.71/1.42 % (3514797)------------------------------
% 3.71/1.42 % (3514797)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.71/1.42 % (3514797)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.71/1.42 % (3514797)CaDiCaL version: 2.1.3
% 3.71/1.42 % (3514797)Termination reason: Refutation
% 3.71/1.42 % (3514797)Time elapsed: 0.010 s
% 3.71/1.42 % (3514797)Peak memory usage: 89 MB
% 3.71/1.42 % (3514797)Instructions burned: 13 (million)
% 3.71/1.42 % (3514797)------------------------------
% 3.71/1.42 % (3514797)------------------------------
% 3.71/1.42 % (3514787)Success in time 0.45 s
% 3.71/1.42 % Vampire exiting
%------------------------------------------------------------------------------