%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG086+1 : 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 : n019.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 12:35:59 PM UTC 2026
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 8 unt; 0 def)
% Number of atoms : 134 ( 25 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 162 ( 65 ~; 53 |; 25 &)
% ( 8 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 76 ( 66 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,axiom,
! [X0,X1] :
( ( aSet0(X0)
& aSet0(X1) )
=> ! [X2] :
( X2 = sdtpldt1(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSSum) ).
fof(f24,axiom,
! [X0] :
( aIdeal0(X0)
<=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).
fof(f25,axiom,
( aIdeal0(xI)
& aIdeal0(xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).
fof(f26,axiom,
( aElementOf0(xx,sdtpldt1(xI,xJ))
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__901) ).
fof(f27,conjecture,
? [X0,X1] :
( aElementOf0(X0,xI)
& aElementOf0(X1,xJ)
& xx = sdtpldt0(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ ? [X0,X1] :
( aElementOf0(X0,xI)
& aElementOf0(X1,xJ)
& xx = sdtpldt0(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f30,plain,
! [X0] :
( aIdeal0(X0)
<=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X1),X0) ) ) ) ) ),
inference(rectify,[],[f24]) ).
fof(f31,plain,
! [X0] :
( aIdeal0(X0)
=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X1),X0) ) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f30]) ).
fof(f59,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtpldt1(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 ) ) ) )
| ~ aSet0(X0)
| ~ aSet0(X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f60,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtpldt1(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 ) ) ) )
| ~ aSet0(X0)
| ~ aSet0(X1) ),
inference(flattening,[],[f59]) ).
fof(f63,plain,
! [X0] :
( ( aSet0(X0)
& ! [X1] :
( ( ! [X2] :
( aElementOf0(sdtpldt0(X1,X2),X0)
| ~ aElementOf0(X2,X0) )
& ! [X3] :
( aElementOf0(sdtasdt0(X3,X1),X0)
| ~ aElement0(X3) ) )
| ~ aElementOf0(X1,X0) ) )
| ~ aIdeal0(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f64,plain,
! [X0,X1] :
( ~ aElementOf0(X0,xI)
| ~ aElementOf0(X1,xJ)
| sdtpldt0(X0,X1) != xx ),
inference(ennf_transformation,[],[f28]) ).
fof(f93,plain,
! [X2,X3,X0,X1] :
( ~ aSet0(X1)
| ~ aSet0(X0)
| sdtpldt0(sK5(X0,X1,X3),sK6(X0,X1,X3)) = X3
| ~ aElementOf0(X3,X2)
| sdtpldt1(X0,X1) != X2 ),
inference(cnf_transformation,[],[f60]) ).
fof(f94,plain,
! [X2,X3,X0,X1] :
( ~ aSet0(X1)
| ~ aSet0(X0)
| aElementOf0(sK6(X0,X1,X3),X1)
| ~ aElementOf0(X3,X2)
| sdtpldt1(X0,X1) != X2 ),
inference(cnf_transformation,[],[f60]) ).
fof(f95,plain,
! [X2,X3,X0,X1] :
( ~ aSet0(X1)
| ~ aSet0(X0)
| aElementOf0(sK5(X0,X1,X3),X0)
| ~ aElementOf0(X3,X2)
| sdtpldt1(X0,X1) != X2 ),
inference(cnf_transformation,[],[f60]) ).
fof(f111,plain,
! [X0] :
( ~ aIdeal0(X0)
| aSet0(X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f112,plain,
aIdeal0(xJ),
inference(cnf_transformation,[],[f25]) ).
fof(f113,plain,
aIdeal0(xI),
inference(cnf_transformation,[],[f25]) ).
fof(f116,plain,
aElementOf0(xx,sdtpldt1(xI,xJ)),
inference(cnf_transformation,[],[f26]) ).
fof(f117,plain,
! [X0,X1] :
( ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI)
| sdtpldt0(X0,X1) != xx ),
inference(cnf_transformation,[],[f64]) ).
fof(f121,plain,
! [X3,X0,X1] :
( aElementOf0(sK5(X0,X1,X3),X0)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aElementOf0(X3,sdtpldt1(X0,X1)) ),
inference(equality_resolution,[],[f95]) ).
fof(f122,plain,
! [X3,X0,X1] :
( aElementOf0(sK6(X0,X1,X3),X1)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aElementOf0(X3,sdtpldt1(X0,X1)) ),
inference(equality_resolution,[],[f94]) ).
fof(f123,plain,
! [X3,X0,X1] :
( ~ aElementOf0(X3,sdtpldt1(X0,X1))
| ~ aSet0(X0)
| sdtpldt0(sK5(X0,X1,X3),sK6(X0,X1,X3)) = X3
| ~ aSet0(X1) ),
inference(equality_resolution,[],[f93]) ).
fof(f128,plain,
aSet0(xJ),
inference(resolution,[],[f111,f112]) ).
fof(f129,plain,
aSet0(xI),
inference(resolution,[],[f111,f113]) ).
fof(f286,plain,
! [X2,X0,X1] :
( ~ aSet0(xI)
| ~ aSet0(X0)
| ~ aElementOf0(X1,sdtpldt1(xI,X0))
| ~ aElementOf0(X2,xJ)
| xx != sdtpldt0(sK5(xI,X0,X1),X2) ),
inference(resolution,[],[f121,f117]) ).
fof(f291,plain,
! [X2,X0,X1] :
( ~ aElementOf0(X1,sdtpldt1(xI,X0))
| ~ aElementOf0(X2,xJ)
| ~ aSet0(X0)
| xx != sdtpldt0(sK5(xI,X0,X1),X2) ),
inference(forward_subsumption_resolution,[],[f286,f129]) ).
fof(f294,plain,
! [X0] :
( ~ aElementOf0(X0,xJ)
| ~ aSet0(xJ)
| xx != sdtpldt0(sK5(xI,xJ,xx),X0) ),
inference(resolution,[],[f291,f116]) ).
fof(f298,plain,
! [X0] :
( ~ aElementOf0(X0,xJ)
| xx != sdtpldt0(sK5(xI,xJ,xx),X0) ),
inference(forward_subsumption_resolution,[],[f294,f128]) ).
fof(f312,plain,
! [X0,X1] :
( xx != sdtpldt0(sK5(xI,xJ,xx),sK6(X0,xJ,X1))
| ~ aSet0(X0)
| ~ aSet0(xJ)
| ~ aElementOf0(X1,sdtpldt1(X0,xJ)) ),
inference(resolution,[],[f298,f122]) ).
fof(f313,plain,
! [X0,X1] :
( ~ aElementOf0(X1,sdtpldt1(X0,xJ))
| ~ aSet0(X0)
| xx != sdtpldt0(sK5(xI,xJ,xx),sK6(X0,xJ,X1)) ),
inference(forward_subsumption_resolution,[],[f312,f128]) ).
fof(f470,plain,
( ~ aSet0(xI)
| xx != sdtpldt0(sK5(xI,xJ,xx),sK6(xI,xJ,xx)) ),
inference(resolution,[],[f313,f116]) ).
fof(f476,plain,
xx != sdtpldt0(sK5(xI,xJ,xx),sK6(xI,xJ,xx)),
inference(forward_subsumption_resolution,[],[f470,f129]) ).
fof(f555,plain,
( ~ aSet0(xI)
| xx = sdtpldt0(sK5(xI,xJ,xx),sK6(xI,xJ,xx))
| ~ aSet0(xJ) ),
inference(resolution,[],[f123,f116]) ).
fof(f568,plain,
( xx = sdtpldt0(sK5(xI,xJ,xx),sK6(xI,xJ,xx))
| ~ aSet0(xJ) ),
inference(forward_subsumption_resolution,[],[f555,f129]) ).
fof(f570,plain,
~ aSet0(xJ),
inference(forward_subsumption_resolution,[],[f568,f476]) ).
fof(f572,plain,
$false,
inference(forward_subsumption_resolution,[],[f570,f128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG086+1 : 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.38 % Computer : n019.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 23:10:48 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.18/0.49 % (3513275)Will run a generic schedule for satisfiability detection.
% 0.18/0.49 % (3513282)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2290049475:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.49 % (3513281)% WARNING: option uhcvi not known.
% 0.18/0.49 % (3513284)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=700122996:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.49 % (3513283)dis+10_1_sil=32000:sp=arity:random_seed=1003620205:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.49 % (3513280)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3117755833_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.49 % (3513281)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=804081567:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.49 % (3513285)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3480580344:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.49 % (3513286)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2991536759:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.49 % TRYING [1]
% 0.18/0.49 % TRYING [2]
% 0.18/0.49 % TRYING [3]
% 0.18/0.49 % (3513284) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3513275-3513284"...
% 0.18/0.49 % (3513284)...printing done.
% 0.18/0.49 % (3513284)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (3513284)------------------------------
% 0.18/0.49 % (3513284)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49 % (3513284)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49 % (3513284)CaDiCaL version: 2.1.3
% 0.18/0.49 % (3513284)Termination reason: Refutation
% 0.18/0.49 % (3513284)Time elapsed: 0.019 s
% 0.18/0.49 % (3513284)Peak memory usage: 12 MB
% 0.18/0.49 % (3513284)Instructions burned: 31 (million)
% 0.18/0.49 % (3513275)Success in time 0.057 s
% 0.18/0.49 % Vampire exiting
%------------------------------------------------------------------------------