%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG115+4 : 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 : n016.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:06 PM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 93 ( 36 equ)
% Maximal formula atoms : 11 ( 5 avg)
% Number of connectives : 116 ( 39 ~; 27 |; 48 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 18 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f45,axiom,
( ? [X0,X1] :
( aElementOf0(X0,slsdtgt0(xa))
& aElementOf0(X1,slsdtgt0(xb))
& sdtpldt0(X0,X1) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X0] :
( ( ( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = X0 )
| aElementOf0(X0,xI) )
& X0 != sz00 )
=> ~ iLess0(sbrdtbr0(X0),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(f47,conjecture,
? [X0,X1] :
( ( ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X0 )
| aElementOf0(X0,slsdtgt0(xa)) )
& ( ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 )
| aElementOf0(X1,slsdtgt0(xb)) )
& xu = sdtpldt0(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f48,negated_conjecture,
~ ? [X0,X1] :
( ( ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X0 )
| aElementOf0(X0,slsdtgt0(xa)) )
& ( ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 )
| aElementOf0(X1,slsdtgt0(xb)) )
& xu = sdtpldt0(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f47]) ).
fof(f60,plain,
( ? [X0,X1] :
( aElementOf0(X0,slsdtgt0(xa))
& aElementOf0(X1,slsdtgt0(xb))
& sdtpldt0(X0,X1) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X2] :
( ( ( ? [X3,X4] :
( aElementOf0(X3,slsdtgt0(xa))
& aElementOf0(X4,slsdtgt0(xb))
& sdtpldt0(X3,X4) = X2 )
| aElementOf0(X2,xI) )
& sz00 != X2 )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ) ),
inference(rectify,[],[f45]) ).
fof(f62,plain,
~ ? [X0,X1] :
( ( ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X0 )
| aElementOf0(X0,slsdtgt0(xa)) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X1 )
| aElementOf0(X1,slsdtgt0(xb)) )
& xu = sdtpldt0(X0,X1) ),
inference(rectify,[],[f48]) ).
fof(f116,plain,
( ? [X0,X1] :
( aElementOf0(X0,slsdtgt0(xa))
& aElementOf0(X1,slsdtgt0(xb))
& sdtpldt0(X0,X1) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X2] :
( ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu))
| ( ! [X3,X4] :
( ~ aElementOf0(X3,slsdtgt0(xa))
| ~ aElementOf0(X4,slsdtgt0(xb))
| sdtpldt0(X3,X4) != X2 )
& ~ aElementOf0(X2,xI) )
| sz00 = X2 ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f117,plain,
( ? [X0,X1] :
( aElementOf0(X0,slsdtgt0(xa))
& aElementOf0(X1,slsdtgt0(xb))
& sdtpldt0(X0,X1) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X2] :
( ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu))
| ( ! [X3,X4] :
( ~ aElementOf0(X3,slsdtgt0(xa))
| ~ aElementOf0(X4,slsdtgt0(xb))
| sdtpldt0(X3,X4) != X2 )
& ~ aElementOf0(X2,xI) )
| sz00 = X2 ) ),
inference(flattening,[],[f116]) ).
fof(f119,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ aElement0(X2)
| sdtasdt0(xa,X2) != X0 )
& ~ aElementOf0(X0,slsdtgt0(xa)) )
| ( ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(xb,X3) != X1 )
& ~ aElementOf0(X1,slsdtgt0(xb)) )
| sdtpldt0(X0,X1) != xu ),
inference(ennf_transformation,[],[f62]) ).
fof(f174,plain,
( aElementOf0(sK41,slsdtgt0(xa))
& aElementOf0(sK42,slsdtgt0(xb))
& xu = sdtpldt0(sK41,sK42)
& aElementOf0(xu,xI)
& xu != sz00
& ! [X2] :
( ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu))
| ( ! [X3,X4] :
( ~ aElementOf0(X3,slsdtgt0(xa))
| ~ aElementOf0(X4,slsdtgt0(xb))
| sdtpldt0(X3,X4) != X2 )
& ~ aElementOf0(X2,xI) )
| sz00 = X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK41,sK42]),skolemize(X0,sK41),skolemize(X1,sK42)],[f117]) ).
fof(f333,plain,
xu = sdtpldt0(sK41,sK42),
inference(cnf_transformation,[],[f174]) ).
fof(f334,plain,
aElementOf0(sK42,slsdtgt0(xb)),
inference(cnf_transformation,[],[f174]) ).
fof(f335,plain,
aElementOf0(sK41,slsdtgt0(xa)),
inference(cnf_transformation,[],[f174]) ).
fof(f342,plain,
! [X0,X1] :
( ~ aElementOf0(X0,slsdtgt0(xa))
| ~ aElementOf0(X1,slsdtgt0(xb))
| sdtpldt0(X0,X1) != xu ),
inference(cnf_transformation,[],[f119]) ).
fof(f530,plain,
! [X0] :
( ~ aElementOf0(X0,slsdtgt0(xb))
| xu != sdtpldt0(sK41,X0) ),
inference(resolution,[],[f335,f342]) ).
fof(f669,plain,
xu != sdtpldt0(sK41,sK42),
inference(resolution,[],[f530,f334]) ).
fof(f670,plain,
$false,
inference(forward_subsumption_resolution,[],[f669,f333]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG115+4 : 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 : n016.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:25:17 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.17/0.46 % (3106768)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (3106778)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4195523795:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % (3106774)% WARNING: option uhcvi not known.
% 0.17/0.46 % (3106776)dis+10_1_sil=32000:sp=arity:random_seed=142541539:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (3106773)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2349458011_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % (3106775)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4273191940:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % (3106774)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3814458714:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (3106777)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2840715766:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % (3106779)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2494210378:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46 % (3106778) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3106768-3106778"...
% 0.17/0.46 % (3106778)...printing done.
% 0.17/0.46 % (3106778)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Theorem for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (3106778)------------------------------
% 0.17/0.46 % (3106778)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (3106778)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (3106778)CaDiCaL version: 2.1.3
% 0.17/0.46 % (3106778)Termination reason: Refutation
% 0.17/0.46 % (3106778)Time elapsed: 0.008 s
% 0.17/0.46 % (3106778)Peak memory usage: 12 MB
% 0.17/0.46 % (3106778)Instructions burned: 23 (million)
% 0.17/0.46 % (3106768)Success in time 0.044 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------