%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n008.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:48:45 AM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 57 ( 10 unt; 6 def)
% Number of atoms : 450 ( 20 equ)
% Maximal formula atoms : 37 ( 7 avg)
% Number of connectives : 525 ( 132 ~; 119 |; 235 &)
% ( 2 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 3 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 126 ( 0 sgn 93 !; 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] :
( ~ aSet0(X0)
| sP2(X0)
| aElementOf0(sK18(X0),X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f198,plain,
! [X0] :
( ~ aSet0(X0)
| sP2(X0)
| ~ aElementOf0(sK18(X0),xU) ),
inference(cnf_transformation,[],[f118]) ).
fof(f210,plain,
xP = cS1241(xU,xf,xT),
inference(cnf_transformation,[],[f119]) ).
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(f235,plain,
! [X0] :
( ~ aElementOf0(X0,cS1241(xU,xf,xT))
| aElementOf0(X0,xU) ),
inference(forward_demodulation,[],[f217,f210]) ).
fof(f236,plain,
aSet0(cS1241(xU,xf,xT)),
inference(forward_demodulation,[],[f218,f210]) ).
fof(f250,plain,
! [X0] : ~ aInfimumOfIn0(X0,cS1241(xU,xf,xT),xU),
inference(superposition,[],[f223,f210]) ).
fof(f263,plain,
( sP2(cS1241(xU,xf,xT))
| aElementOf0(sK18(cS1241(xU,xf,xT)),cS1241(xU,xf,xT)) ),
inference(resolution,[],[f197,f236]) ).
fof(f265,definition,
( spl22_1
<=> aElementOf0(sK18(cS1241(xU,xf,xT)),cS1241(xU,xf,xT)) ),
introduced(definition,[new_symbols(definition,[spl22_1])],[avatar_definition]) ).
fof(f267,plain,
( aElementOf0(sK18(cS1241(xU,xf,xT)),cS1241(xU,xf,xT))
| ~ spl22_1 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f269,definition,
( spl22_2
<=> sP2(cS1241(xU,xf,xT)) ),
introduced(definition,[new_symbols(definition,[spl22_2])],[avatar_definition]) ).
fof(f270,plain,
( ~ sP2(cS1241(xU,xf,xT))
| spl22_2 ),
inference(avatar_component_clause,[],[f269]) ).
fof(f271,plain,
( sP2(cS1241(xU,xf,xT))
| ~ spl22_2 ),
inference(avatar_component_clause,[],[f269]) ).
fof(f272,plain,
( spl22_1
| spl22_2 ),
inference(avatar_split_clause,[],[f263,f269,f265]) ).
fof(f306,plain,
( sP2(cS1241(xU,xf,xT))
| ~ aElementOf0(sK18(cS1241(xU,xf,xT)),xU) ),
inference(resolution,[],[f198,f236]) ).
fof(f863,plain,
( aInfimumOfIn0(sK14(cS1241(xU,xf,xT)),cS1241(xU,xf,xT),xU)
| ~ spl22_2 ),
inference(resolution,[],[f271,f172]) ).
fof(f869,plain,
( $false
| ~ spl22_2 ),
inference(forward_subsumption_resolution,[],[f863,f250]) ).
fof(f870,plain,
~ spl22_2,
inference(avatar_contradiction_clause,[],[f869]) ).
fof(f897,plain,
( ~ aElementOf0(sK18(cS1241(xU,xf,xT)),xU)
| spl22_2 ),
inference(forward_subsumption_resolution,[],[f306,f270]) ).
fof(f1105,plain,
( aElementOf0(sK18(cS1241(xU,xf,xT)),xU)
| ~ spl22_1 ),
inference(resolution,[],[f267,f235]) ).
fof(f1106,plain,
( $false
| ~ spl22_1
| spl22_2 ),
inference(forward_subsumption_resolution,[],[f1105,f897]) ).
fof(f1107,plain,
( ~ spl22_1
| spl22_2 ),
inference(avatar_contradiction_clause,[],[f1106]) ).
cnf(s1,plain,
( spl22_1
| spl22_2 ),
inference(sat_conversion,[],[f272]) ).
cnf(s36,plain,
~ spl22_2,
inference(sat_conversion,[],[f870]) ).
cnf(s53,plain,
( ~ spl22_1
| spl22_2 ),
inference(sat_conversion,[],[f1107]) ).
cnf(s54,plain,
~ spl22_1,
inference(rat,[],[s53,s36]) ).
cnf(s55,plain,
$false,
inference(rat,[],[s1,s36,s54]) ).
fof(f1108,plain,
$false,
inference(avatar_sat_refutation,[],[s55]) ).
%------------------------------------------------------------------------------
%----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 SAT
% 0.12/0.39 % Computer : n008.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 15:13:39 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.47 % (1355173)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (1355183)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2391024553:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % (1355179)% WARNING: option uhcvi not known.
% 0.16/0.47 % (1355178)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3421126708_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % (1355179)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3718575197:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (1355181)dis+10_1_sil=32000:sp=arity:random_seed=1798027131:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (1355180)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3712628187:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (1355182)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=344964879:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (1355184)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=640309723:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % (1355181) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1355173-1355181"...
% 0.16/0.47 % (1355183) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1355173-1355183"...
% 0.16/0.47 % (1355184) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1355173-1355184"...
% 0.16/0.47 % (1355183)...printing done.
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % (1355183)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (1355183)------------------------------
% 0.16/0.48 % (1355183)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48 % (1355183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48 % (1355183)CaDiCaL version: 2.1.3
% 0.16/0.48 % (1355183)Termination reason: Refutation
% 0.16/0.48 % (1355183)Time elapsed: 0.014 s
% 0.16/0.48 % (1355183)Peak memory usage: 13 MB
% 0.16/0.48 % (1355183)Instructions burned: 34 (million)
% 0.16/0.48 % (1355173)Success in time 0.042 s
% 0.16/0.48 % Vampire exiting
%------------------------------------------------------------------------------