%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG101+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 : n001.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:36:02 PM UTC 2026
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 118 ( 39 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 150 ( 57 ~; 56 |; 32 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 38 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,axiom,
! [X0] :
( aElement0(X0)
=> ! [X1] :
( X1 = slsdtgt0(X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(X0,X3) = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(f38,axiom,
aElement0(xc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1905) ).
fof(f39,axiom,
( aElementOf0(xx,slsdtgt0(xc))
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1933) ).
fof(f40,conjecture,
? [X0] :
( aElement0(X0)
& sdtasdt0(xc,X0) = xx ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f41,negated_conjecture,
~ ? [X0] :
( aElement0(X0)
& sdtasdt0(xc,X0) = xx ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f98,plain,
! [X0] :
( ! [X1] :
( X1 = slsdtgt0(X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(X0,X3) = X2 ) ) ) )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f99,plain,
! [X0] :
( ~ aElement0(X0)
| xx != sdtasdt0(xc,X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ( X1 = slsdtgt0(X0)
| ~ aSet0(X1)
| ? [X2] :
( ( ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(X0,X3) != X2 )
| ~ aElementOf0(X2,X1) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(X0,X3) = X2 )
| aElementOf0(X2,X1) ) ) )
& ( ( aSet0(X1)
& ! [X2] :
( ( aElementOf0(X2,X1)
| ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(X0,X3) != X2 ) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(X0,X3) = X2 )
| ~ aElementOf0(X2,X1) ) ) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(nnf_transformation,[],[f98]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ( X1 = slsdtgt0(X0)
| ~ aSet0(X1)
| ? [X2] :
( ( ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(X0,X3) != X2 )
| ~ aElementOf0(X2,X1) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(X0,X3) = X2 )
| aElementOf0(X2,X1) ) ) )
& ( ( aSet0(X1)
& ! [X2] :
( ( aElementOf0(X2,X1)
| ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(X0,X3) != X2 ) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(X0,X3) = X2 )
| ~ aElementOf0(X2,X1) ) ) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(flattening,[],[f132]) ).
fof(f134,plain,
! [X0] :
( ! [X1] :
( ( X1 = slsdtgt0(X0)
| ~ aSet0(X1)
| ? [X2] :
( ( ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(X0,X3) != X2 )
| ~ aElementOf0(X2,X1) )
& ( ? [X4] :
( aElement0(X4)
& sdtasdt0(X0,X4) = X2 )
| aElementOf0(X2,X1) ) ) )
& ( ( aSet0(X1)
& ! [X5] :
( ( aElementOf0(X5,X1)
| ! [X6] :
( ~ aElement0(X6)
| sdtasdt0(X0,X6) != X5 ) )
& ( ? [X7] :
( aElement0(X7)
& sdtasdt0(X0,X7) = X5 )
| ~ aElementOf0(X5,X1) ) ) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(rectify,[],[f133]) ).
fof(f135,plain,
! [X0] :
( ! [X1] :
( ( X1 = slsdtgt0(X0)
| ~ aSet0(X1)
| ( ( ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(X0,X3) != sK19(X0,X1) )
| ~ aElementOf0(sK19(X0,X1),X1) )
& ( ( aElement0(sK20(X0,X1))
& sK19(X0,X1) = sdtasdt0(X0,sK20(X0,X1)) )
| aElementOf0(sK19(X0,X1),X1) ) ) )
& ( ( aSet0(X1)
& ! [X5] :
( ( aElementOf0(X5,X1)
| ! [X6] :
( ~ aElement0(X6)
| sdtasdt0(X0,X6) != X5 ) )
& ( ( aElement0(sK21(X0,X5))
& sdtasdt0(X0,sK21(X0,X5)) = X5 )
| ~ aElementOf0(X5,X1) ) ) )
| slsdtgt0(X0) != X1 ) )
| ~ aElement0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20,sK21]),skolemize(X2,sK19(X0,X1)),skolemize(X4,sK20(X0,X1)),skolemize(X7,sK21(X0,X5))],[f134]) ).
fof(f218,plain,
! [X0,X1,X5] :
( sdtasdt0(X0,sK21(X0,X5)) = X5
| ~ aElementOf0(X5,X1)
| slsdtgt0(X0) != X1
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f219,plain,
! [X0,X1,X5] :
( aElement0(sK21(X0,X5))
| ~ aElementOf0(X5,X1)
| slsdtgt0(X0) != X1
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f225,plain,
aElement0(xc),
inference(cnf_transformation,[],[f38]) ).
fof(f228,plain,
aElementOf0(xx,slsdtgt0(xc)),
inference(cnf_transformation,[],[f39]) ).
fof(f229,plain,
! [X0] :
( xx != sdtasdt0(xc,X0)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f240,plain,
! [X0,X5] :
( ~ aElementOf0(X5,slsdtgt0(X0))
| aElement0(sK21(X0,X5))
| ~ aElement0(X0) ),
inference(equality_resolution,[],[f219]) ).
fof(f241,plain,
! [X0,X5] :
( ~ aElementOf0(X5,slsdtgt0(X0))
| sdtasdt0(X0,sK21(X0,X5)) = X5
| ~ aElement0(X0) ),
inference(equality_resolution,[],[f218]) ).
fof(f1927,plain,
( aElement0(sK21(xc,xx))
| ~ aElement0(xc) ),
inference(resolution,[],[f240,f228]) ).
fof(f1936,plain,
aElement0(sK21(xc,xx)),
inference(forward_subsumption_resolution,[],[f1927,f225]) ).
fof(f3890,plain,
( xx = sdtasdt0(xc,sK21(xc,xx))
| ~ aElement0(xc) ),
inference(resolution,[],[f241,f228]) ).
fof(f3960,plain,
xx = sdtasdt0(xc,sK21(xc,xx)),
inference(forward_subsumption_resolution,[],[f3890,f225]) ).
fof(f4042,plain,
( xx != xx
| ~ aElement0(sK21(xc,xx)) ),
inference(superposition,[],[f229,f3960]) ).
fof(f4053,plain,
~ aElement0(sK21(xc,xx)),
inference(trivial_inequality_removal,[],[f4042]) ).
fof(f4067,plain,
$false,
inference(global_subsumption,[],[f4053,f1936]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG101+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.13/0.39 % Computer : n001.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 23:21:32 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/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.19/0.52 % (4080413)Will run a generic schedule for satisfiability detection.
% 0.19/0.52 % (4080420)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2718623767:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.52 % (4080419)% WARNING: option uhcvi not known.
% 0.19/0.52 % (4080418)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=27324617_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.52 % (4080419)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3215727685:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.52 % (4080421)dis+10_1_sil=32000:sp=arity:random_seed=190243353:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.52 % (4080422)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1500994758:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.52 % (4080424)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2677186699:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.52 % (4080423)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1206765336:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.52 % TRYING [1]
% 0.19/0.52 % TRYING [2]
% 0.19/0.52 % TRYING [3]
% 0.19/0.52 % TRYING [4]
% 0.19/0.52 % (4080420) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4080413-4080420"...
% 0.19/0.52 % (4080420)...printing done.
% 0.19/0.52 % (4080421) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4080413-4080421"...
% 0.19/0.52 % (4080420)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (4080420)------------------------------
% 0.19/0.52 % (4080420)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.52 % (4080420)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.52 % (4080420)CaDiCaL version: 2.1.3
% 0.19/0.52 % (4080420)Termination reason: Refutation
% 0.19/0.52 % (4080420)Time elapsed: 0.045 s
% 0.19/0.52 % (4080420)Peak memory usage: 13 MB
% 0.19/0.52 % (4080420)Instructions burned: 123 (million)
% 0.19/0.52 % (4080413)Success in time 0.084 s
% 0.19/0.52 % Vampire exiting
%------------------------------------------------------------------------------