%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM606+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 : n020.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:24:59 PM UTC 2026
% Result : Theorem 0.36s 0.49s
% Output : Refutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 14 unt; 0 def)
% Number of atoms : 89 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 109 ( 54 ~; 40 |; 9 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 28 ( 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(f14,axiom,
! [X0,X1,X2] :
( ( aSet0(X0)
& aSet0(X1)
& aSet0(X2) )
=> ( ( aSubsetOf0(X0,X1)
& aSubsetOf0(X1,X2) )
=> aSubsetOf0(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
fof(f23,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(f75,axiom,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(f96,axiom,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4908) ).
fof(f98,axiom,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
fof(f100,axiom,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
fof(f101,conjecture,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f102,negated_conjecture,
~ aSubsetOf0(xQ,szNzAzT0),
inference(negated_conjecture,[status(cth)],[f101]) ).
fof(f103,plain,
~ aSubsetOf0(xQ,szNzAzT0),
inference(flattening,[],[f102]) ).
fof(f116,plain,
! [X0] :
( ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f122,plain,
! [X0,X1,X2] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f123,plain,
! [X0,X1,X2] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(flattening,[],[f122]) ).
fof(f248,plain,
! [X0,X1] :
( ~ aSubsetOf0(X1,X0)
| aSet0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f252,plain,
! [X2,X0,X1] :
( ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1)
| aSubsetOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f278,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f23]) ).
fof(f379,plain,
aSubsetOf0(xS,szNzAzT0),
inference(cnf_transformation,[],[f75]) ).
fof(f426,plain,
aSet0(xO),
inference(cnf_transformation,[],[f96]) ).
fof(f430,plain,
aSubsetOf0(xO,xS),
inference(cnf_transformation,[],[f98]) ).
fof(f433,plain,
aSubsetOf0(xQ,xO),
inference(cnf_transformation,[],[f100]) ).
fof(f434,plain,
~ aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f103]) ).
fof(f529,plain,
( aSet0(xQ)
| ~ aSet0(xO) ),
inference(resolution,[],[f248,f433]) ).
fof(f531,plain,
aSet0(xQ),
inference(forward_subsumption_resolution,[],[f529,f426]) ).
fof(f1781,plain,
! [X0] :
( ~ aSubsetOf0(X0,szNzAzT0)
| ~ aSubsetOf0(xQ,X0)
| ~ aSet0(szNzAzT0)
| ~ aSet0(X0)
| ~ aSet0(xQ) ),
inference(resolution,[],[f252,f434]) ).
fof(f1798,plain,
! [X0] :
( ~ aSubsetOf0(X0,szNzAzT0)
| ~ aSubsetOf0(xQ,X0)
| ~ aSet0(szNzAzT0)
| ~ aSet0(xQ) ),
inference(forward_subsumption_resolution,[],[f1781,f248]) ).
fof(f1838,plain,
! [X0] :
( ~ aSubsetOf0(X0,szNzAzT0)
| ~ aSubsetOf0(xQ,X0)
| ~ aSet0(xQ) ),
inference(forward_subsumption_resolution,[],[f1798,f278]) ).
fof(f1871,plain,
! [X0] :
( ~ aSubsetOf0(X0,szNzAzT0)
| ~ aSubsetOf0(xQ,X0) ),
inference(forward_subsumption_resolution,[],[f1838,f531]) ).
fof(f1894,plain,
~ aSubsetOf0(xO,szNzAzT0),
inference(resolution,[],[f1871,f433]) ).
fof(f1957,plain,
! [X0] :
( ~ aSubsetOf0(X0,szNzAzT0)
| ~ aSubsetOf0(xO,X0)
| ~ aSet0(szNzAzT0)
| ~ aSet0(X0)
| ~ aSet0(xO) ),
inference(resolution,[],[f1894,f252]) ).
fof(f1964,plain,
! [X0] :
( ~ aSubsetOf0(X0,szNzAzT0)
| ~ aSubsetOf0(xO,X0)
| ~ aSet0(szNzAzT0)
| ~ aSet0(xO) ),
inference(forward_subsumption_resolution,[],[f1957,f248]) ).
fof(f1967,plain,
! [X0] :
( ~ aSubsetOf0(X0,szNzAzT0)
| ~ aSubsetOf0(xO,X0)
| ~ aSet0(xO) ),
inference(forward_subsumption_resolution,[],[f1964,f278]) ).
fof(f1968,plain,
! [X0] :
( ~ aSubsetOf0(X0,szNzAzT0)
| ~ aSubsetOf0(xO,X0) ),
inference(forward_subsumption_resolution,[],[f1967,f426]) ).
fof(f2010,plain,
~ aSubsetOf0(xO,xS),
inference(resolution,[],[f1968,f379]) ).
fof(f2019,plain,
$false,
inference(forward_subsumption_resolution,[],[f2010,f430]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM606+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 : n020.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 20:44:20 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.36/0.49 % (3727916)Will run a generic schedule for satisfiability detection.
% 0.36/0.49 % (3727927)dis+10_1_sil=32000:sp=arity:random_seed=3311787597:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.36/0.49 % (3727925)% WARNING: option uhcvi not known.
% 0.36/0.49 % (3727928)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2078873780:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.36/0.49 % (3727926)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2136055904:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.36/0.49 % (3727924)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=998503550_2999 on theBenchmark for (2999ds/0Mi)
% 0.36/0.49 % (3727925)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1961490990:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.36/0.49 % (3727929)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3882068934:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.36/0.49 % (3727930)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1058530102:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.36/0.49 % TRYING [1]
% 0.36/0.49 % TRYING [2]
% 0.36/0.49 % (3727927)Instruction limit reached!
% 0.36/0.49 % (3727927)------------------------------
% 0.36/0.49 % (3727927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.49 % (3727927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.49 % (3727927)CaDiCaL version: 2.1.3
% 0.36/0.49 % (3727927)Termination reason: Instruction limit
% 0.36/0.49 % (3727927)Termination phase: Saturation
% 0.36/0.49 % (3727927)Time elapsed: 0.038 s
% 0.36/0.49 % (3727927)Peak memory usage: 13 MB
% 0.36/0.49 % (3727927)Instructions burned: 104 (million)
% 0.36/0.49 % TRYING [3]
% 0.36/0.49 % (3727928) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3727916-3727928"...
% 0.36/0.49 % (3727928)...printing done.
% 0.36/0.49 % (3727928)Refutation found. Thanks to Tanya!
% 0.36/0.49 % SZS status Theorem for theBenchmark
% 0.36/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.36/0.49 % (3727928)------------------------------
% 0.36/0.49 % (3727928)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.49 % (3727928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.49 % (3727928)CaDiCaL version: 2.1.3
% 0.36/0.49 % (3727928)Termination reason: Refutation
% 0.36/0.49 % (3727928)Time elapsed: 0.042 s
% 0.36/0.49 % (3727928)Peak memory usage: 13 MB
% 0.36/0.49 % (3727928)Instructions burned: 63 (million)
% 0.36/0.49 % (3727916)Success in time 0.07 s
% 0.36/0.49 % Vampire exiting
%------------------------------------------------------------------------------