%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n015.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.17s 0.47s
% Output : Refutation 0.17s
% 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(f23,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(f24,plain,
xu != xv,
inference(flattening,[],[f19]) ).
fof(f25,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f29,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f30,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(flattening,[],[f29]) ).
fof(f40,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,[],[f23]) ).
fof(f64,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,sK6(X1))
& aElementOf0(sK6(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,sK7(X4))
& aElementOf0(sK7(X4),xS) ) )
& ~ aLowerBoundOfIn0(X4,xS,xT) ) )
& aInfimumOfIn0(xv,xS,xT) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X2,sK6(X1)),skolemize(X5,sK7(X4))],[f40]) ).
fof(f65,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f73,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f94,plain,
aSet0(xT),
inference(cnf_transformation,[],[f15]) ).
fof(f99,plain,
! [X4] :
( ~ aLowerBoundOfIn0(X4,xS,xT)
| sdtlseqdt0(X4,xv) ),
inference(cnf_transformation,[],[f64]) ).
fof(f102,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f64]) ).
fof(f104,plain,
aElementOf0(xv,xT),
inference(cnf_transformation,[],[f64]) ).
fof(f107,plain,
! [X1] :
( ~ aLowerBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(X1,xu) ),
inference(cnf_transformation,[],[f64]) ).
fof(f110,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f64]) ).
fof(f112,plain,
aElementOf0(xu,xT),
inference(cnf_transformation,[],[f64]) ).
fof(f114,plain,
xu != xv,
inference(cnf_transformation,[],[f24]) ).
fof(f116,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[],[f99,f110]) ).
fof(f117,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[],[f107,f102]) ).
fof(f119,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[],[f65,f104]) ).
fof(f120,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[],[f65,f112]) ).
fof(f121,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[],[f120,f94]) ).
fof(f122,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[],[f119,f94]) ).
fof(f215,plain,
( ~ sdtlseqdt0(xu,xv)
| xu = xv
| ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(resolution,[],[f73,f117]) ).
fof(f223,plain,
( xu = xv
| ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(forward_subsumption_resolution,[],[f215,f116]) ).
fof(f247,plain,
( ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(forward_subsumption_resolution,[],[f223,f114]) ).
fof(f249,plain,
~ aElement0(xv),
inference(forward_subsumption_resolution,[],[f247,f121]) ).
fof(f251,plain,
$false,
inference(forward_subsumption_resolution,[],[f249,f122]) ).
%------------------------------------------------------------------------------
%----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 SAT
% 0.11/0.38 % Computer : n015.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:15:46 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/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.17/0.47 % (1770299)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (1770315)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2946381528:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (1770311)% WARNING: option uhcvi not known.
% 0.17/0.47 % (1770313)dis+10_1_sil=32000:sp=arity:random_seed=2740497734:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (1770312)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3166034491:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (1770310)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2981630689_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (1770311)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2563659773:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (1770314)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3772191405:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (1770316)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2263181257:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % (1770313) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1770299-1770313"...
% 0.17/0.47 % TRYING [1]
% 0.17/0.47 % TRYING [2]
% 0.17/0.47 % (1770316) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1770299-1770316"...
% 0.17/0.47 % (1770310) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1770299-1770310"...
% 0.17/0.47 % (1770313)...printing done.
% 0.17/0.47 % (1770315) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1770299-1770315"...
% 0.17/0.47 % (1770313)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (1770313)------------------------------
% 0.17/0.47 % (1770313)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (1770313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (1770313)CaDiCaL version: 2.1.3
% 0.17/0.47 % (1770313)Termination reason: Refutation
% 0.17/0.47 % (1770313)Time elapsed: 0.004 s
% 0.17/0.47 % (1770313)Peak memory usage: 11 MB
% 0.17/0.47 % (1770313)Instructions burned: 5 (million)
% 0.17/0.47 % (1770299)Success in time 0.043 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------