%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG102+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 : n018.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:03 PM UTC 2026
% Result : Theorem 0.16s 0.50s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 50 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 50 ( 21 ~; 16 |; 8 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 18 !; 4 ?)
% 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/sandbox/benchmark/theBenchmark.p',mDefPrIdeal) ).
fof(f38,axiom,
aElement0(xc),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1905) ).
fof(f39,axiom,
( aElementOf0(xx,slsdtgt0(xc))
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1933) ).
fof(f41,conjecture,
? [X0] :
( aElement0(X0)
& sdtasdt0(xc,X0) = xy ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f42,negated_conjecture,
~ ? [X0] :
( aElement0(X0)
& sdtasdt0(xc,X0) = xy ),
inference(negated_conjecture,[status(cth)],[f41]) ).
fof(f100,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(f101,plain,
! [X0] :
( ~ aElement0(X0)
| xy != sdtasdt0(xc,X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f183,plain,
! [X2,X0,X1] :
( ~ aElement0(X0)
| sdtasdt0(X0,sK19(X0,X2)) = X2
| ~ aElementOf0(X2,X1)
| slsdtgt0(X0) != X1 ),
inference(cnf_transformation,[],[f100]) ).
fof(f184,plain,
! [X2,X0,X1] :
( ~ aElement0(X0)
| aElement0(sK19(X0,X2))
| ~ aElementOf0(X2,X1)
| slsdtgt0(X0) != X1 ),
inference(cnf_transformation,[],[f100]) ).
fof(f190,plain,
aElement0(xc),
inference(cnf_transformation,[],[f38]) ).
fof(f192,plain,
aElementOf0(xy,slsdtgt0(xc)),
inference(cnf_transformation,[],[f39]) ).
fof(f196,plain,
! [X0] :
( xy != sdtasdt0(xc,X0)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f211,plain,
! [X2,X0] :
( ~ aElementOf0(X2,slsdtgt0(X0))
| aElement0(sK19(X0,X2))
| ~ aElement0(X0) ),
inference(equality_resolution,[],[f184]) ).
fof(f212,plain,
! [X2,X0] :
( ~ aElementOf0(X2,slsdtgt0(X0))
| sdtasdt0(X0,sK19(X0,X2)) = X2
| ~ aElement0(X0) ),
inference(equality_resolution,[],[f183]) ).
fof(f392,plain,
( aElement0(sK19(xc,xy))
| ~ aElement0(xc) ),
inference(resolution,[],[f211,f192]) ).
fof(f397,plain,
aElement0(sK19(xc,xy)),
inference(forward_subsumption_resolution,[],[f392,f190]) ).
fof(f511,plain,
( xy = sdtasdt0(xc,sK19(xc,xy))
| ~ aElement0(xc) ),
inference(resolution,[],[f212,f192]) ).
fof(f520,plain,
xy = sdtasdt0(xc,sK19(xc,xy)),
inference(forward_subsumption_resolution,[],[f511,f190]) ).
fof(f2009,plain,
( xy != xy
| ~ aElement0(sK19(xc,xy)) ),
inference(superposition,[],[f196,f520]) ).
fof(f2013,plain,
~ aElement0(sK19(xc,xy)),
inference(trivial_inequality_removal,[],[f2009]) ).
fof(f2015,plain,
$false,
inference(forward_subsumption_resolution,[],[f2013,f397]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG102+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n018.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 23:18:24 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.16/0.50 % (2843874)Will run a generic schedule for satisfiability detection.
% 0.16/0.50 % (2843884)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=91746471:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.50 % (2843880)% WARNING: option uhcvi not known.
% 0.16/0.50 % (2843879)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1115735946_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.50 % (2843880)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2036257730:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.50 % (2843881)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2784762203:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.50 % (2843882)dis+10_1_sil=32000:sp=arity:random_seed=3386299284:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.50 % (2843883)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=463207761:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.50 % (2843885)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2758685354:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.50 % TRYING [1]
% 0.16/0.50 % TRYING [2]
% 0.16/0.50 % TRYING [3]
% 0.16/0.50 % TRYING [4]
% 0.16/0.50 % (2843884)Instruction limit reached!
% 0.16/0.50 % (2843884)------------------------------
% 0.16/0.50 % (2843884)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.50 % (2843884)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.50 % (2843884)CaDiCaL version: 2.1.3
% 0.16/0.50 % (2843884)Termination reason: Instruction limit
% 0.16/0.50 % (2843884)Termination phase: Saturation
% 0.16/0.50 % (2843884)Time elapsed: 0.038 s
% 0.16/0.50 % (2843884)Peak memory usage: 13 MB
% 0.16/0.50 % (2843884)Instructions burned: 132 (million)
% 0.16/0.50 % (2843880) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2843874-2843880"...
% 0.16/0.50 % (2843880)...printing done.
% 0.16/0.50 % (2843882) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2843874-2843882"...
% 0.16/0.50 % (2843893)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2112367020:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.16/0.50 % (2843880)Refutation found. Thanks to Tanya!
% 0.16/0.50 % SZS status Theorem for theBenchmark
% 0.16/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.51 % (2843880)------------------------------
% 0.16/0.51 % (2843880)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.51 % (2843880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.51 % (2843880)CaDiCaL version: 2.1.3
% 0.16/0.51 % (2843880)Termination reason: Refutation
% 0.16/0.51 % (2843880)Time elapsed: 0.041 s
% 0.16/0.51 % (2843880)Peak memory usage: 13 MB
% 0.16/0.51 % (2843880)Instructions burned: 61 (million)
% 0.16/0.51 % (2843874)Success in time 0.075 s
% 0.16/0.51 % Vampire exiting
%------------------------------------------------------------------------------