%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LAT382+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 56 ( 20 unt; 0 def)
% Number of atoms : 177 ( 9 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 216 ( 95 ~; 89 |; 23 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 57 ( 54 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(f8,axiom,
! [X0,X1] :
( ( aElement0(X0)
& aElement0(X1) )
=> ( ( sdtlseqdt0(X0,X1)
& sdtlseqdt0(X1,X0) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
fof(f12,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
=> ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X3] :
( aLowerBoundOfIn0(X3,X1,X0)
=> sdtlseqdt0(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefInf) ).
fof(f15,axiom,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773) ).
fof(f16,axiom,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773_01) ).
fof(f17,axiom,
( aInfimumOfIn0(xu,xS,xT)
& aInfimumOfIn0(xv,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__792) ).
fof(f18,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f19,negated_conjecture,
xu != xv,
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f23,plain,
xu != xv,
inference(flattening,[],[f19]) ).
fof(f24,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f28,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f29,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(flattening,[],[f28]) ).
fof(f34,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( aInfimumOfIn0(X2,X1,X0)
<=> ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aLowerBoundOfIn0(X3,X1,X0) ) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f53,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) ) )
& ( ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aLowerBoundOfIn0(X3,X1,X0) ) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f34]) ).
fof(f54,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) ) )
& ( ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X3] :
( sdtlseqdt0(X3,X2)
| ~ aLowerBoundOfIn0(X3,X1,X0) ) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(flattening,[],[f53]) ).
fof(f55,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ? [X3] :
( ~ sdtlseqdt0(X3,X2)
& aLowerBoundOfIn0(X3,X1,X0) ) )
& ( ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X4] :
( sdtlseqdt0(X4,X2)
| ~ aLowerBoundOfIn0(X4,X1,X0) ) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(rectify,[],[f54]) ).
fof(f56,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( aInfimumOfIn0(X2,X1,X0)
| ~ aElementOf0(X2,X0)
| ~ aLowerBoundOfIn0(X2,X1,X0)
| ( ~ sdtlseqdt0(sK4(X0,X1,X2),X2)
& aLowerBoundOfIn0(sK4(X0,X1,X2),X1,X0) ) )
& ( ( aElementOf0(X2,X0)
& aLowerBoundOfIn0(X2,X1,X0)
& ! [X4] :
( sdtlseqdt0(X4,X2)
| ~ aLowerBoundOfIn0(X4,X1,X0) ) )
| ~ aInfimumOfIn0(X2,X1,X0) ) )
| ~ aSubsetOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f55]) ).
fof(f61,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f69,plain,
! [X0,X1] :
( ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aElement0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f79,plain,
! [X2,X0,X1,X4] :
( ~ aInfimumOfIn0(X2,X1,X0)
| ~ aLowerBoundOfIn0(X4,X1,X0)
| sdtlseqdt0(X4,X2)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f80,plain,
! [X2,X0,X1] :
( ~ aInfimumOfIn0(X2,X1,X0)
| aLowerBoundOfIn0(X2,X1,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f81,plain,
! [X2,X0,X1] :
( ~ aInfimumOfIn0(X2,X1,X0)
| aElementOf0(X2,X0)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f90,plain,
aSet0(xT),
inference(cnf_transformation,[],[f15]) ).
fof(f91,plain,
aSubsetOf0(xS,xT),
inference(cnf_transformation,[],[f16]) ).
fof(f92,plain,
aInfimumOfIn0(xv,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f93,plain,
aInfimumOfIn0(xu,xS,xT),
inference(cnf_transformation,[],[f17]) ).
fof(f94,plain,
xu != xv,
inference(cnf_transformation,[],[f23]) ).
fof(f130,plain,
( aElementOf0(xv,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f81,f92]) ).
fof(f131,plain,
( aElementOf0(xu,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f81,f93]) ).
fof(f132,plain,
( aElementOf0(xu,xT)
| ~ aSet0(xT) ),
inference(forward_subsumption_resolution,[],[f131,f91]) ).
fof(f133,plain,
( aElementOf0(xv,xT)
| ~ aSet0(xT) ),
inference(forward_subsumption_resolution,[],[f130,f91]) ).
fof(f134,plain,
aElementOf0(xu,xT),
inference(forward_subsumption_resolution,[],[f132,f90]) ).
fof(f135,plain,
aElementOf0(xv,xT),
inference(forward_subsumption_resolution,[],[f133,f90]) ).
fof(f137,plain,
( aElement0(xu)
| ~ aSet0(xT) ),
inference(resolution,[],[f134,f61]) ).
fof(f138,plain,
aElement0(xu),
inference(forward_subsumption_resolution,[],[f137,f90]) ).
fof(f142,plain,
( aElement0(xv)
| ~ aSet0(xT) ),
inference(resolution,[],[f135,f61]) ).
fof(f143,plain,
aElement0(xv),
inference(forward_subsumption_resolution,[],[f142,f90]) ).
fof(f144,plain,
( aLowerBoundOfIn0(xv,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f80,f92]) ).
fof(f145,plain,
( aLowerBoundOfIn0(xu,xS,xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f80,f93]) ).
fof(f146,plain,
( aLowerBoundOfIn0(xu,xS,xT)
| ~ aSet0(xT) ),
inference(forward_subsumption_resolution,[],[f145,f91]) ).
fof(f147,plain,
( aLowerBoundOfIn0(xv,xS,xT)
| ~ aSet0(xT) ),
inference(forward_subsumption_resolution,[],[f144,f91]) ).
fof(f148,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(forward_subsumption_resolution,[],[f146,f90]) ).
fof(f149,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(forward_subsumption_resolution,[],[f147,f90]) ).
fof(f169,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f79,f92]) ).
fof(f170,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu)
| ~ aSubsetOf0(xS,xT)
| ~ aSet0(xT) ),
inference(resolution,[],[f79,f93]) ).
fof(f171,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu)
| ~ aSet0(xT) ),
inference(forward_subsumption_resolution,[],[f170,f91]) ).
fof(f172,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv)
| ~ aSet0(xT) ),
inference(forward_subsumption_resolution,[],[f169,f91]) ).
fof(f173,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xu) ),
inference(forward_subsumption_resolution,[],[f171,f90]) ).
fof(f174,plain,
! [X0] :
( ~ aLowerBoundOfIn0(X0,xS,xT)
| sdtlseqdt0(X0,xv) ),
inference(forward_subsumption_resolution,[],[f172,f90]) ).
fof(f179,plain,
sdtlseqdt0(xv,xu),
inference(resolution,[],[f173,f149]) ).
fof(f196,plain,
( ~ sdtlseqdt0(xu,xv)
| xu = xv
| ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(resolution,[],[f179,f69]) ).
fof(f197,plain,
( ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(forward_subsumption_resolution,[],[f196,f94]) ).
fof(f199,plain,
( ~ sdtlseqdt0(xu,xv)
| ~ aElement0(xv) ),
inference(forward_subsumption_resolution,[],[f197,f138]) ).
fof(f201,plain,
~ sdtlseqdt0(xu,xv),
inference(forward_subsumption_resolution,[],[f199,f143]) ).
fof(f213,plain,
sdtlseqdt0(xu,xv),
inference(resolution,[],[f174,f148]) ).
fof(f215,plain,
$false,
inference(forward_subsumption_resolution,[],[f213,f201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT382+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n005.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:12:02 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 % (4119897)Will run a generic schedule for satisfiability detection.
% 0.19/0.46 % (4119907)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=271087151:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.46 % (4119903)% WARNING: option uhcvi not known.
% 0.19/0.46 % (4119902)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=38097740_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.46 % (4119903)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3422238451:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.46 % (4119904)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3250941224:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.46 % (4119905)dis+10_1_sil=32000:sp=arity:random_seed=4135492184:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.46 % (4119906)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2188098212:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.46 % (4119908)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1746229739:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.46 % TRYING [1]
% 0.19/0.46 % TRYING [2]
% 0.19/0.46 % (4119902) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4119897-4119902"...
% 0.19/0.46 % (4119905) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4119897-4119905"...
% 0.19/0.46 % (4119905)...printing done.
% 0.19/0.46 % (4119902)...printing done.
% 0.19/0.46 % (4119905)Refutation found. Thanks to Tanya!
% 0.19/0.46 % SZS status Theorem for theBenchmark
% 0.19/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46 % (4119905)------------------------------
% 0.19/0.46 % (4119905)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.46 % (4119905)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.46 % (4119905)CaDiCaL version: 2.1.3
% 0.19/0.46 % (4119905)Termination reason: Refutation
% 0.19/0.46 % (4119905)Time elapsed: 0.005 s
% 0.19/0.46 % (4119905)Peak memory usage: 11 MB
% 0.19/0.46 % (4119905)Instructions burned: 5 (million)
% 0.19/0.46 % (4119897)Success in time 0.041 s
% 0.19/0.46 % Vampire exiting
%------------------------------------------------------------------------------