%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LAT382+3 : 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 : n007.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 2.44s 1.21s
% Output : Refutation 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 150 ( 10 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 163 ( 47 ~; 42 |; 58 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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 : 38 ( 36 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(f8,axiom,
! [X0,X1] :
( ( aElement0(X0)
& aElement0(X1) )
=> ( ( sdtlseqdt0(X0,X1)
& sdtlseqdt0(X1,X0) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mASymm) ).
fof(f15,axiom,
aSet0(xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__773) ).
fof(f17,axiom,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(xu,X0) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X0] :
( ( ( aElementOf0(X0,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X0,X1) ) )
| aLowerBoundOfIn0(X0,xS,xT) )
=> sdtlseqdt0(X0,xu) )
& aInfimumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(xv,X0) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X0] :
( ( ( aElementOf0(X0,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X0,X1) ) )
| aLowerBoundOfIn0(X0,xS,xT) )
=> sdtlseqdt0(X0,xv) )
& aInfimumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__792) ).
fof(f18,conjecture,
xu = xv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f19,negated_conjecture,
xu != xv,
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [X0] :
( aElementOf0(X0,xS)
=> sdtlseqdt0(xu,X0) )
& 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)
& ! [X3] :
( aElementOf0(X3,xS)
=> sdtlseqdt0(xv,X3) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X4] :
( ( ( aElementOf0(X4,xT)
& ! [X5] :
( aElementOf0(X5,xS)
=> sdtlseqdt0(X4,X5) ) )
| aLowerBoundOfIn0(X4,xS,xT) )
=> sdtlseqdt0(X4,xv) )
& aInfimumOfIn0(xv,xS,xT) ),
inference(rectify,[],[f17]) ).
fof(f21,plain,
xu != xv,
inference(flattening,[],[f19]) ).
fof(f26,plain,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [X0] :
( sdtlseqdt0(xu,X0)
| ~ aElementOf0(X0,xS) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X1] :
( sdtlseqdt0(X1,xu)
| ( ( ~ aElementOf0(X1,xT)
| ? [X2] :
( ~ sdtlseqdt0(X1,X2)
& aElementOf0(X2,xS) ) )
& ~ aLowerBoundOfIn0(X1,xS,xT) ) )
& aInfimumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X3] :
( sdtlseqdt0(xv,X3)
| ~ aElementOf0(X3,xS) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X4] :
( sdtlseqdt0(X4,xv)
| ( ( ~ aElementOf0(X4,xT)
| ? [X5] :
( ~ sdtlseqdt0(X4,X5)
& aElementOf0(X5,xS) ) )
& ~ aLowerBoundOfIn0(X4,xS,xT) ) )
& aInfimumOfIn0(xv,xS,xT) ),
inference(ennf_transformation,[],[f20]) ).
fof(f30,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f31,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(flattening,[],[f30]) ).
fof(f35,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f36,plain,
( aElementOf0(xu,xT)
& aElementOf0(xu,xT)
& ! [X0] :
( sdtlseqdt0(xu,X0)
| ~ aElementOf0(X0,xS) )
& aLowerBoundOfIn0(xu,xS,xT)
& ! [X1] :
( sdtlseqdt0(X1,xu)
| ( ( ~ aElementOf0(X1,xT)
| ( ~ sdtlseqdt0(X1,sK0(X1))
& aElementOf0(sK0(X1),xS) ) )
& ~ aLowerBoundOfIn0(X1,xS,xT) ) )
& aInfimumOfIn0(xu,xS,xT)
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& ! [X3] :
( sdtlseqdt0(xv,X3)
| ~ aElementOf0(X3,xS) )
& aLowerBoundOfIn0(xv,xS,xT)
& ! [X4] :
( sdtlseqdt0(X4,xv)
| ( ( ~ aElementOf0(X4,xT)
| ( ~ sdtlseqdt0(X4,sK1(X4))
& aElementOf0(sK1(X4),xS) ) )
& ~ aLowerBoundOfIn0(X4,xS,xT) ) )
& aInfimumOfIn0(xv,xS,xT) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X1)),skolemize(X5,sK1(X4))],[f26]) ).
fof(f49,plain,
aSet0(xT),
inference(cnf_transformation,[],[f15]) ).
fof(f54,plain,
! [X4] :
( ~ aLowerBoundOfIn0(X4,xS,xT)
| sdtlseqdt0(X4,xv) ),
inference(cnf_transformation,[],[f36]) ).
fof(f57,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f36]) ).
fof(f59,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[],[f36]) ).
fof(f62,plain,
! [X1] :
( ~ aLowerBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(X1,xu) ),
inference(cnf_transformation,[],[f36]) ).
fof(f65,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f36]) ).
fof(f67,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f36]) ).
fof(f69,plain,
xu != xv,
inference(cnf_transformation,[],[f21]) ).
fof(f83,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f86,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f88,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[],[f54,f65]) ).
fof(f89,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[],[f62,f57]) ).
fof(f92,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[],[f86,f59]) ).
fof(f93,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[],[f86,f67]) ).
fof(f96,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[],[f93,f49]) ).
fof(f97,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[],[f92,f49]) ).
fof(f156,plain,
( ~ sdtlseqdt0(xu,xv)
| xu = xv
| ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(resolution,[],[f83,f89]) ).
fof(f165,plain,
( xu = xv
| ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(forward_subsumption_resolution,[],[f156,f88]) ).
fof(f170,plain,
( ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(forward_subsumption_resolution,[],[f165,f69]) ).
fof(f174,plain,
~ aElement0(xv),
inference(forward_subsumption_resolution,[],[f170,f96]) ).
fof(f176,plain,
$false,
inference(forward_subsumption_resolution,[],[f174,f97]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT382+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n007.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 15:10:25 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.41 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.44/1.21 % (1567243)Detected formulas, will run a generic FOF schedule.
% 2.44/1.21 % (1567252)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1008655520:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.44/1.21 % (1567252)First to succeed.
% 2.44/1.21 % (1567252)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1567243"
% 2.44/1.21 % (1567251)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=877268537:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.44/1.21 % (1567251)Refutation not found, incomplete strategy
% 2.44/1.21 % (1567251)------------------------------
% 2.44/1.21 % (1567251)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.44/1.21 % (1567251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/1.21 % (1567251)CaDiCaL version: 2.1.3
% 2.44/1.21 % (1567251)Termination reason: Refutation not found, incomplete strategy
% 2.44/1.21 % (1567251)Time elapsed: 0.004 s
% 2.44/1.21 % (1567251)Peak memory usage: 88 MB
% 2.44/1.21 % (1567251)Instructions burned: 4 (million)
% 2.44/1.21 % (1567249)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=3260751520:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.44/1.21 % (1567248)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=3434530069:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.44/1.21 % (1567250)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=3979641669:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.44/1.21 % (1567254)dis-21_1_sil=8000:lcm=predicate:random_seed=425516899: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.44/1.21 % (1567254)Also succeeded, but the first one will report.
% 2.44/1.21 % (1567253)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3378005940:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.44/1.21 % (1567253)Also succeeded, but the first one will report.
% 2.44/1.21 % (1567252)Refutation found. Thanks to Tanya!
% 2.44/1.21 % SZS status Theorem for theBenchmark
% 2.44/1.21 % SZS output start Proof for theBenchmark
% See solution above
% 2.44/1.21 % (1567252)------------------------------
% 2.44/1.21 % (1567252)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.44/1.21 % (1567252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/1.21 % (1567252)CaDiCaL version: 2.1.3
% 2.44/1.21 % (1567252)Termination reason: Refutation
% 2.44/1.21 % (1567252)Time elapsed: 0.002 s
% 2.44/1.21 % (1567252)Peak memory usage: 88 MB
% 2.44/1.21 % (1567252)Instructions burned: 4 (million)
% 2.44/1.21 % (1567252)------------------------------
% 2.44/1.21 % (1567252)------------------------------
% 2.44/1.21 % (1567243)Success in time 0.27 s
% 2.44/1.21 % Vampire exiting
%------------------------------------------------------------------------------