%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LAT388+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 : 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:47:34 AM UTC 2026
% Result : Theorem 2.54s 1.32s
% Output : Refutation 2.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 3 unt; 1 def)
% Number of atoms : 126 ( 4 equ)
% Maximal formula atoms : 12 ( 8 avg)
% Number of connectives : 149 ( 38 ~; 30 |; 66 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 28 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f30,axiom,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X0] :
( aElementOf0(X0,xT)
=> sdtlseqdt0(X0,xp) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X0] :
( ( ( aElementOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) ) )
| aUpperBoundOfIn0(X0,xT,xS) )
=> sdtlseqdt0(xp,X0) )
& aSupremumOfIn0(xp,xT,xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1330) ).
fof(f31,conjecture,
? [X0] :
( ( aElementOf0(X0,xS)
& ( ( aElementOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) ) )
| aUpperBoundOfIn0(X0,xT,xS) )
& ! [X1] :
( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aUpperBoundOfIn0(X1,xT,xS) )
=> sdtlseqdt0(X0,X1) ) )
| aSupremumOfIn0(X0,xT,xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f32,negated_conjecture,
~ ? [X0] :
( ( aElementOf0(X0,xS)
& ( ( aElementOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) ) )
| aUpperBoundOfIn0(X0,xT,xS) )
& ! [X1] :
( ( aElementOf0(X1,xS)
& ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aUpperBoundOfIn0(X1,xT,xS) )
=> sdtlseqdt0(X0,X1) ) )
| aSupremumOfIn0(X0,xT,xS) ),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f37,plain,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X0] :
( aElementOf0(X0,xT)
=> sdtlseqdt0(X0,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) ),
inference(rectify,[],[f30]) ).
fof(f38,plain,
~ ? [X0] :
( ( aElementOf0(X0,xS)
& ( ( aElementOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) ) )
| aUpperBoundOfIn0(X0,xT,xS) )
& ! [X2] :
( ( aElementOf0(X2,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aUpperBoundOfIn0(X2,xT,xS) )
=> sdtlseqdt0(X0,X2) ) )
| aSupremumOfIn0(X0,xT,xS) ),
inference(rectify,[],[f32]) ).
fof(f50,plain,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X0] :
( sdtlseqdt0(X0,xp)
| ~ aElementOf0(X0,xT) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X1] :
( sdtlseqdt0(xp,X1)
| ( ( ~ aElementOf0(X1,xS)
| ? [X2] :
( ~ sdtlseqdt0(X2,X1)
& aElementOf0(X2,xT) ) )
& ~ aUpperBoundOfIn0(X1,xT,xS) ) )
& aSupremumOfIn0(xp,xT,xS) ),
inference(ennf_transformation,[],[f37]) ).
fof(f51,plain,
! [X0] :
( ( ~ aElementOf0(X0,xS)
| ( ( ~ aElementOf0(X0,xS)
| ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) ) )
& ~ aUpperBoundOfIn0(X0,xT,xS) )
| ? [X2] :
( ~ sdtlseqdt0(X0,X2)
& aElementOf0(X2,xS)
& ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aElementOf0(X3,xT) )
& aUpperBoundOfIn0(X2,xT,xS) ) )
& ~ aSupremumOfIn0(X0,xT,xS) ),
inference(ennf_transformation,[],[f38]) ).
fof(f52,plain,
! [X0] :
( ( ~ aElementOf0(X0,xS)
| ( ( ~ aElementOf0(X0,xS)
| ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) ) )
& ~ aUpperBoundOfIn0(X0,xT,xS) )
| ? [X2] :
( ~ sdtlseqdt0(X0,X2)
& aElementOf0(X2,xS)
& ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aElementOf0(X3,xT) )
& aUpperBoundOfIn0(X2,xT,xS) ) )
& ~ aSupremumOfIn0(X0,xT,xS) ),
inference(flattening,[],[f51]) ).
fof(f75,definition,
! [X0] :
( ? [X2] :
( ~ sdtlseqdt0(X0,X2)
& aElementOf0(X2,xS)
& ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aElementOf0(X3,xT) )
& aUpperBoundOfIn0(X2,xT,xS) )
| ~ sP3(X0) ),
introduced(definition,[new_symbols(definition,[sP3])],[predicate_definition_introduction]) ).
fof(f76,plain,
! [X0] :
( ( ~ aElementOf0(X0,xS)
| ( ( ~ aElementOf0(X0,xS)
| ? [X1] :
( ~ sdtlseqdt0(X1,X0)
& aElementOf0(X1,xT) ) )
& ~ aUpperBoundOfIn0(X0,xT,xS) )
| sP3(X0) )
& ~ aSupremumOfIn0(X0,xT,xS) ),
inference(definition_folding,[],[f52,f75]) ).
fof(f90,plain,
( aElementOf0(xp,szDzozmdt0(xf))
& sdtlpdtrp0(xf,xp) = xp
& aFixedPointOf0(xp,xf)
& ! [X0] :
( sdtlseqdt0(X0,xp)
| ~ aElementOf0(X0,xT) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X1] :
( sdtlseqdt0(xp,X1)
| ( ( ~ aElementOf0(X1,xS)
| ( ~ sdtlseqdt0(sK11(X1),X1)
& aElementOf0(sK11(X1),xT) ) )
& ~ aUpperBoundOfIn0(X1,xT,xS) ) )
& aSupremumOfIn0(xp,xT,xS) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X2,sK11(X1))],[f50]) ).
fof(f94,plain,
! [X0] :
( ( ~ aElementOf0(X0,xS)
| ( ( ~ aElementOf0(X0,xS)
| ( ~ sdtlseqdt0(sK13(X0),X0)
& aElementOf0(sK13(X0),xT) ) )
& ~ aUpperBoundOfIn0(X0,xT,xS) )
| sP3(X0) )
& ~ aSupremumOfIn0(X0,xT,xS) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X1,sK13(X0))],[f76]) ).
fof(f183,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnf_transformation,[],[f90]) ).
fof(f196,plain,
! [X0] : ~ aSupremumOfIn0(X0,xT,xS),
inference(cnf_transformation,[],[f94]) ).
fof(f244,plain,
$false,
inference(forward_subsumption_resolution,[],[f183,f196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT388+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.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:14:25 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 2.54/1.32 % (1356437)Detected formulas, will run a generic FOF schedule.
% 2.54/1.32 % (1356446)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3160253195:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.54/1.32 % (1356446)First to succeed.
% 2.54/1.32 % (1356446)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1356437"
% 2.54/1.32 % (1356443)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=1454382908:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.54/1.32 % (1356442)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=3730970160:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.54/1.32 % (1356444)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=1579660590:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.54/1.32 % (1356445)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1256340674:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.54/1.32 % (1356447)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1469621209:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.54/1.32 % (1356445)Also succeeded, but the first one will report.
% 2.54/1.32 % (1356447)Also succeeded, but the first one will report.
% 2.54/1.32 % (1356448)dis-21_1_sil=8000:lcm=predicate:random_seed=2142672218: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)
% 2.54/1.32 % (1356448)Also succeeded, but the first one will report.
% 2.54/1.32 % (1356446)Refutation found. Thanks to Tanya!
% 2.54/1.32 % SZS status Theorem for theBenchmark
% 2.54/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 2.54/1.32 % (1356446)------------------------------
% 2.54/1.32 % (1356446)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.32 % (1356446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.32 % (1356446)CaDiCaL version: 2.1.3
% 2.54/1.32 % (1356446)Termination reason: Refutation
% 2.54/1.32 % (1356446)Time elapsed: 0.002 s
% 2.54/1.32 % (1356446)Peak memory usage: 88 MB
% 2.54/1.32 % (1356446)Instructions burned: 5 (million)
% 2.54/1.32 % (1356446)------------------------------
% 2.54/1.32 % (1356446)------------------------------
% 2.54/1.32 % (1356437)Success in time 0.273 s
% 2.54/1.32 % Vampire exiting
%------------------------------------------------------------------------------