%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM610+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 : 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:25:00 PM UTC 2026
% Result : Theorem 0.15s 0.51s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 68 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 81 ( 38 ~; 29 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mSubTrans) ).
fof(f96,axiom,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4908) ).
fof(f100,axiom,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5093) ).
fof(f104,axiom,
( aSet0(xP)
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5164) ).
fof(f107,axiom,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5195) ).
fof(f108,conjecture,
aSubsetOf0(xP,xO),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f109,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(negated_conjecture,[status(cth)],[f108]) ).
fof(f110,plain,
~ aSubsetOf0(xP,xO),
inference(flattening,[],[f109]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f129,plain,
! [X0,X1,X2] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f130,plain,
! [X0,X1,X2] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
inference(flattening,[],[f129]) ).
fof(f255,plain,
! [X0,X1] :
( ~ aSubsetOf0(X1,X0)
| aSet0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f259,plain,
! [X2,X0,X1] :
( ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1)
| aSubsetOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f433,plain,
aSet0(xO),
inference(cnf_transformation,[],[f96]) ).
fof(f440,plain,
aSubsetOf0(xQ,xO),
inference(cnf_transformation,[],[f100]) ).
fof(f445,plain,
aSet0(xP),
inference(cnf_transformation,[],[f104]) ).
fof(f448,plain,
aSubsetOf0(xP,xQ),
inference(cnf_transformation,[],[f107]) ).
fof(f449,plain,
~ aSubsetOf0(xP,xO),
inference(cnf_transformation,[],[f110]) ).
fof(f1910,plain,
! [X0] :
( ~ aSubsetOf0(X0,xO)
| ~ aSubsetOf0(xP,X0)
| ~ aSet0(xO)
| ~ aSet0(X0)
| ~ aSet0(xP) ),
inference(resolution,[],[f259,f449]) ).
fof(f1929,plain,
! [X0] :
( ~ aSubsetOf0(X0,xO)
| ~ aSubsetOf0(xP,X0)
| ~ aSet0(xO)
| ~ aSet0(xP) ),
inference(forward_subsumption_resolution,[],[f1910,f255]) ).
fof(f1973,plain,
! [X0] :
( ~ aSubsetOf0(X0,xO)
| ~ aSubsetOf0(xP,X0)
| ~ aSet0(xP) ),
inference(forward_subsumption_resolution,[],[f1929,f433]) ).
fof(f2010,plain,
! [X0] :
( ~ aSubsetOf0(X0,xO)
| ~ aSubsetOf0(xP,X0) ),
inference(forward_subsumption_resolution,[],[f1973,f445]) ).
fof(f2032,plain,
~ aSubsetOf0(xQ,xO),
inference(resolution,[],[f2010,f448]) ).
fof(f2041,plain,
$false,
inference(forward_subsumption_resolution,[],[f2032,f440]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM610+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n018.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 20:46:54 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/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.15/0.51 % (2705904)Will run a generic schedule for satisfiability detection.
% 0.15/0.51 % (2705912)dis+10_1_sil=32000:sp=arity:random_seed=679226063:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.51 % (2705910)% WARNING: option uhcvi not known.
% 0.15/0.51 % (2705909)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3485134054_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.51 % (2705910)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=169128030:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.51 % (2705911)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=438882326:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.51 % (2705913)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2505651123:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.51 % (2705914)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=874102796:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.51 % (2705915)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3405475560:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.51 % TRYING [1]
% 0.15/0.51 % TRYING [2]
% 0.15/0.51 % (2705912)Instruction limit reached!
% 0.15/0.51 % (2705912)------------------------------
% 0.15/0.51 % (2705912)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.51 % (2705912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.51 % (2705912)CaDiCaL version: 2.1.3
% 0.15/0.51 % (2705912)Termination reason: Instruction limit
% 0.15/0.51 % (2705912)Termination phase: Saturation
% 0.15/0.51 % (2705912)Time elapsed: 0.038 s
% 0.15/0.51 % (2705912)Peak memory usage: 13 MB
% 0.15/0.51 % (2705912)Instructions burned: 104 (million)
% 0.15/0.51 % TRYING [3]
% 0.15/0.51 % (2705913) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2705904-2705913"...
% 0.15/0.51 % (2705913)...printing done.
% 0.15/0.51 % (2705913)Refutation found. Thanks to Tanya!
% 0.15/0.51 % SZS status Theorem for theBenchmark
% 0.15/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.52 % (2705913)------------------------------
% 0.15/0.52 % (2705913)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.52 % (2705913)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.52 % (2705913)CaDiCaL version: 2.1.3
% 0.15/0.52 % (2705913)Termination reason: Refutation
% 0.15/0.52 % (2705913)Time elapsed: 0.040 s
% 0.15/0.52 % (2705913)Peak memory usage: 13 MB
% 0.15/0.52 % (2705913)Instructions burned: 61 (million)
% 0.15/0.52 % (2705904)Success in time 0.088 s
% 0.15/0.52 % Vampire exiting
%------------------------------------------------------------------------------