%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM609+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 : n013.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 1.34s 0.72s
% Output : Refutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 70 ( 22 unt; 3 def)
% Number of atoms : 279 ( 34 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 339 ( 130 ~; 129 |; 63 &)
% ( 12 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 2 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 93 ( 0 sgn 87 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
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(f16,axiom,
! [X0,X1] :
( ( aSet0(X0)
& aElement0(X1) )
=> ! [X2] :
( X2 = sdtmndt0(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aElement0(X3)
& aElementOf0(X3,X0)
& X3 != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
fof(f23,axiom,
( aSet0(szNzAzT0)
& isCountable0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(f101,axiom,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5106) ).
fof(f103,axiom,
xp = szmzizndt0(xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5147) ).
fof(f104,axiom,
( aSet0(xP)
& xP = sdtmndt0(xQ,szmzizndt0(xQ)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5164) ).
fof(f105,axiom,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5173) ).
fof(f107,conjecture,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f108,negated_conjecture,
~ aSubsetOf0(xP,xQ),
inference(negated_conjecture,[status(cth)],[f107]) ).
fof(f116,plain,
~ aSubsetOf0(xP,xQ),
inference(flattening,[],[f108]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f123,plain,
! [X0] :
( ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f133,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtmndt0(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aElement0(X3)
& aElementOf0(X3,X0)
& X3 != X1 ) ) ) )
| ~ aSet0(X0)
| ~ aElement0(X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f134,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtmndt0(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aElement0(X3)
& aElementOf0(X3,X0)
& X3 != X1 ) ) ) )
| ~ aSet0(X0)
| ~ aElement0(X1) ),
inference(flattening,[],[f133]) ).
fof(f243,definition,
! [X2,X0,X1] :
( sP2(X2,X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aElement0(X3)
& aElementOf0(X3,X0)
& X3 != X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f244,definition,
! [X1,X0] :
( ! [X2] :
( X2 = sdtmndt0(X0,X1)
<=> sP2(X2,X0,X1) )
| ~ sP3(X1,X0) ),
introduced(definition,[new_symbols(definition,[sP3])],[predicate_definition_introduction]) ).
fof(f245,plain,
! [X0,X1] :
( sP3(X1,X0)
| ~ aSet0(X0)
| ~ aElement0(X1) ),
inference(definition_folding,[],[f134,f244,f243]) ).
fof(f250,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) ) )
& ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f123]) ).
fof(f251,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) ) )
& ( ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(flattening,[],[f250]) ).
fof(f252,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) ) )
& ( ( aSet0(X1)
& ! [X3] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(rectify,[],[f251]) ).
fof(f253,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ~ aSet0(X1)
| ( ~ aElementOf0(sK5(X0,X1),X0)
& aElementOf0(sK5(X0,X1),X1) ) )
& ( ( aSet0(X1)
& ! [X3] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1) ) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f252]) ).
fof(f260,plain,
! [X1,X0] :
( ! [X2] :
( ( X2 = sdtmndt0(X0,X1)
| ~ sP2(X2,X0,X1) )
& ( sP2(X2,X0,X1)
| sdtmndt0(X0,X1) != X2 ) )
| ~ sP3(X1,X0) ),
inference(nnf_transformation,[],[f244]) ).
fof(f261,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtmndt0(X1,X0) = X2
| ~ sP2(X2,X1,X0) )
& ( sP2(X2,X1,X0)
| sdtmndt0(X1,X0) != X2 ) )
| ~ sP3(X0,X1) ),
inference(rectify,[],[f260]) ).
fof(f262,plain,
! [X2,X0,X1] :
( ( sP2(X2,X0,X1)
| ~ aSet0(X2)
| ? [X3] :
( ( ~ aElement0(X3)
| ~ aElementOf0(X3,X0)
| X1 = X3
| ~ aElementOf0(X3,X2) )
& ( ( aElement0(X3)
& aElementOf0(X3,X0)
& X3 != X1 )
| aElementOf0(X3,X2) ) ) )
& ( ( aSet0(X2)
& ! [X3] :
( ( aElementOf0(X3,X2)
| ~ aElement0(X3)
| ~ aElementOf0(X3,X0)
| X1 = X3 )
& ( ( aElement0(X3)
& aElementOf0(X3,X0)
& X3 != X1 )
| ~ aElementOf0(X3,X2) ) ) )
| ~ sP2(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f243]) ).
fof(f263,plain,
! [X2,X0,X1] :
( ( sP2(X2,X0,X1)
| ~ aSet0(X2)
| ? [X3] :
( ( ~ aElement0(X3)
| ~ aElementOf0(X3,X0)
| X1 = X3
| ~ aElementOf0(X3,X2) )
& ( ( aElement0(X3)
& aElementOf0(X3,X0)
& X3 != X1 )
| aElementOf0(X3,X2) ) ) )
& ( ( aSet0(X2)
& ! [X3] :
( ( aElementOf0(X3,X2)
| ~ aElement0(X3)
| ~ aElementOf0(X3,X0)
| X1 = X3 )
& ( ( aElement0(X3)
& aElementOf0(X3,X0)
& X3 != X1 )
| ~ aElementOf0(X3,X2) ) ) )
| ~ sP2(X2,X0,X1) ) ),
inference(flattening,[],[f262]) ).
fof(f264,plain,
! [X0,X1,X2] :
( ( sP2(X0,X1,X2)
| ~ aSet0(X0)
| ? [X3] :
( ( ~ aElement0(X3)
| ~ aElementOf0(X3,X1)
| X2 = X3
| ~ aElementOf0(X3,X0) )
& ( ( aElement0(X3)
& aElementOf0(X3,X1)
& X2 != X3 )
| aElementOf0(X3,X0) ) ) )
& ( ( aSet0(X0)
& ! [X4] :
( ( aElementOf0(X4,X0)
| ~ aElement0(X4)
| ~ aElementOf0(X4,X1)
| X2 = X4 )
& ( ( aElement0(X4)
& aElementOf0(X4,X1)
& X2 != X4 )
| ~ aElementOf0(X4,X0) ) ) )
| ~ sP2(X0,X1,X2) ) ),
inference(rectify,[],[f263]) ).
fof(f265,plain,
! [X0,X1,X2] :
( ( sP2(X0,X1,X2)
| ~ aSet0(X0)
| ( ( ~ aElement0(sK7(X0,X1,X2))
| ~ aElementOf0(sK7(X0,X1,X2),X1)
| sK7(X0,X1,X2) = X2
| ~ aElementOf0(sK7(X0,X1,X2),X0) )
& ( ( aElement0(sK7(X0,X1,X2))
& aElementOf0(sK7(X0,X1,X2),X1)
& sK7(X0,X1,X2) != X2 )
| aElementOf0(sK7(X0,X1,X2),X0) ) ) )
& ( ( aSet0(X0)
& ! [X4] :
( ( aElementOf0(X4,X0)
| ~ aElement0(X4)
| ~ aElementOf0(X4,X1)
| X2 = X4 )
& ( ( aElement0(X4)
& aElementOf0(X4,X1)
& X2 != X4 )
| ~ aElementOf0(X4,X0) ) ) )
| ~ sP2(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X3,sK7(X0,X1,X2))],[f264]) ).
fof(f309,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f317,plain,
! [X0,X1] :
( ~ aSubsetOf0(X1,X0)
| aSet0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f253]) ).
fof(f318,plain,
! [X0,X1] :
( aElementOf0(sK5(X0,X1),X1)
| ~ aSet0(X1)
| aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f253]) ).
fof(f319,plain,
! [X0,X1] :
( ~ aElementOf0(sK5(X0,X1),X0)
| ~ aSet0(X1)
| aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f253]) ).
fof(f336,plain,
! [X2,X0,X1] :
( sP2(X2,X1,X0)
| sdtmndt0(X1,X0) != X2
| ~ sP3(X0,X1) ),
inference(cnf_transformation,[],[f261]) ).
fof(f339,plain,
! [X2,X0,X1,X4] :
( ~ sP2(X0,X1,X2)
| ~ aElementOf0(X4,X0)
| aElementOf0(X4,X1) ),
inference(cnf_transformation,[],[f265]) ).
fof(f347,plain,
! [X0,X1] :
( sP3(X1,X0)
| ~ aSet0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f245]) ).
fof(f355,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f23]) ).
fof(f511,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f101]) ).
fof(f513,plain,
xp = szmzizndt0(xQ),
inference(cnf_transformation,[],[f103]) ).
fof(f514,plain,
xP = sdtmndt0(xQ,szmzizndt0(xQ)),
inference(cnf_transformation,[],[f104]) ).
fof(f515,plain,
aSet0(xP),
inference(cnf_transformation,[],[f104]) ).
fof(f516,plain,
aElementOf0(xp,xQ),
inference(cnf_transformation,[],[f105]) ).
fof(f518,plain,
~ aSubsetOf0(xP,xQ),
inference(cnf_transformation,[],[f116]) ).
fof(f524,plain,
! [X0,X1] :
( sP2(sdtmndt0(X1,X0),X1,X0)
| ~ sP3(X0,X1) ),
inference(equality_resolution,[],[f336]) ).
fof(f649,plain,
xP = sdtmndt0(xQ,xp),
inference(forward_demodulation,[],[f514,f513]) ).
fof(f1004,plain,
( aSet0(xQ)
| ~ aSet0(szNzAzT0) ),
inference(resolution,[],[f317,f511]) ).
fof(f1010,plain,
aSet0(xQ),
inference(forward_subsumption_resolution,[],[f1004,f355]) ).
fof(f5222,plain,
( aElement0(xp)
| ~ aSet0(xQ) ),
inference(resolution,[],[f309,f516]) ).
fof(f5224,plain,
aElement0(xp),
inference(forward_subsumption_resolution,[],[f5222,f1010]) ).
fof(f5332,plain,
( sP2(xP,xQ,xp)
| ~ sP3(xp,xQ) ),
inference(superposition,[],[f524,f649]) ).
fof(f5352,definition,
( spl29_93
<=> sP3(xp,xQ) ),
introduced(definition,[new_symbols(definition,[spl29_93])],[avatar_definition]) ).
fof(f5353,plain,
( sP3(xp,xQ)
| ~ spl29_93 ),
inference(avatar_component_clause,[],[f5352]) ).
fof(f5354,plain,
( ~ sP3(xp,xQ)
| spl29_93 ),
inference(avatar_component_clause,[],[f5352]) ).
fof(f5508,plain,
( ~ aSet0(xQ)
| ~ aElement0(xp)
| spl29_93 ),
inference(resolution,[],[f347,f5354]) ).
fof(f5509,plain,
( ~ aElement0(xp)
| spl29_93 ),
inference(forward_subsumption_resolution,[],[f5508,f1010]) ).
fof(f5510,plain,
( $false
| spl29_93 ),
inference(forward_subsumption_resolution,[],[f5509,f5224]) ).
fof(f5511,plain,
spl29_93,
inference(avatar_contradiction_clause,[],[f5510]) ).
fof(f6067,plain,
( sP2(xP,xQ,xp)
| ~ spl29_93 ),
inference(forward_subsumption_resolution,[],[f5332,f5353]) ).
fof(f6072,plain,
( ! [X0] :
( ~ aElementOf0(X0,xP)
| aElementOf0(X0,xQ) )
| ~ spl29_93 ),
inference(resolution,[],[f6067,f339]) ).
fof(f11313,plain,
( ! [X0] :
( ~ aSet0(xP)
| aSubsetOf0(xP,X0)
| ~ aSet0(X0)
| aElementOf0(sK5(X0,xP),xQ) )
| ~ spl29_93 ),
inference(resolution,[],[f318,f6072]) ).
fof(f11317,plain,
( ! [X0] :
( aElementOf0(sK5(X0,xP),xQ)
| ~ aSet0(X0)
| aSubsetOf0(xP,X0) )
| ~ spl29_93 ),
inference(forward_subsumption_resolution,[],[f11313,f515]) ).
fof(f12400,plain,
( ~ aSet0(xP)
| aSubsetOf0(xP,xQ)
| ~ aSet0(xQ)
| ~ aSet0(xQ)
| aSubsetOf0(xP,xQ)
| ~ spl29_93 ),
inference(resolution,[],[f319,f11317]) ).
fof(f12401,plain,
( ~ aSet0(xP)
| aSubsetOf0(xP,xQ)
| ~ aSet0(xQ)
| ~ spl29_93 ),
inference(duplicate_literal_removal,[],[f12400]) ).
fof(f12407,plain,
( aSubsetOf0(xP,xQ)
| ~ aSet0(xQ)
| ~ spl29_93 ),
inference(forward_subsumption_resolution,[],[f12401,f515]) ).
fof(f12415,plain,
( ~ aSet0(xQ)
| ~ spl29_93 ),
inference(forward_subsumption_resolution,[],[f12407,f518]) ).
fof(f12422,plain,
( $false
| ~ spl29_93 ),
inference(forward_subsumption_resolution,[],[f12415,f1010]) ).
fof(f12423,plain,
~ spl29_93,
inference(avatar_contradiction_clause,[],[f12422]) ).
cnf(s2792,plain,
spl29_93,
inference(sat_conversion,[],[f5511]) ).
cnf(s6707,plain,
~ spl29_93,
inference(sat_conversion,[],[f12423]) ).
cnf(s6735,plain,
$false,
inference(rat,[],[s2792,s6707]) ).
fof(f12430,plain,
$false,
inference(avatar_sat_refutation,[],[s6735]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM609+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.11/0.40 % Computer : n013.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Sun Sep 27 20:44:21 UTC 2026
% 0.11/0.41 % CPUTime :
% 0.11/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.44 Running first-order model finding
% 0.11/0.44 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
% 1.34/0.71 % (532635)Will run a generic schedule for satisfiability detection.
% 1.34/0.71 % (532649)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2746885386:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.34/0.71 % (532648)% WARNING: option uhcvi not known.
% 1.34/0.71 % (532647)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3962878829_2999 on theBenchmark for (2999ds/0Mi)
% 1.34/0.71 % (532651)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2410590643:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.34/0.71 % (532648)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2337365625:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.34/0.71 % (532650)dis+10_1_sil=32000:sp=arity:random_seed=832648901:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.34/0.71 % (532652)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3628995099:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.34/0.71 % (532653)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3715420473:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.34/0.71 % TRYING [1]
% 1.34/0.71 % TRYING [2]
% 1.34/0.71 % TRYING [3]
% 1.34/0.71 % TRYING [4]
% 1.34/0.71 % (532650)Instruction limit reached!
% 1.34/0.71 % (532650)------------------------------
% 1.34/0.71 % (532650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.34/0.71 % (532650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.34/0.71 % (532650)CaDiCaL version: 2.1.3
% 1.34/0.71 % (532650)Termination reason: Instruction limit
% 1.34/0.71 % (532650)Termination phase: Saturation
% 1.34/0.71 % (532650)Time elapsed: 0.068 s
% 1.34/0.71 % (532650)Peak memory usage: 13 MB
% 1.34/0.71 % (532650)Instructions burned: 104 (million)
% 1.34/0.71 % (532651)Instruction limit reached!
% 1.34/0.71 % (532651)------------------------------
% 1.34/0.71 % (532651)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.34/0.71 % (532651)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.34/0.71 % (532651)CaDiCaL version: 2.1.3
% 1.34/0.71 % (532651)Termination reason: Instruction limit
% 1.34/0.71 % (532651)Termination phase: Saturation
% 1.34/0.72 % (532651)Time elapsed: 0.076 s
% 1.34/0.72 % (532651)Peak memory usage: 13 MB
% 1.34/0.72 % (532651)Instructions burned: 117 (million)
% 1.34/0.72 % (532652)Instruction limit reached!
% 1.34/0.72 % (532652)------------------------------
% 1.34/0.72 % (532652)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.34/0.72 % (532652)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.34/0.72 % (532652)CaDiCaL version: 2.1.3
% 1.34/0.72 % (532652)Termination reason: Instruction limit
% 1.34/0.72 % (532652)Termination phase: Saturation
% 1.34/0.72 % (532652)Time elapsed: 0.087 s
% 1.34/0.72 % (532652)Peak memory usage: 13 MB
% 1.34/0.72 % (532652)Instructions burned: 131 (million)
% 1.34/0.72 % (532684)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=560331388:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.34/0.72 % (532686)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=865026329:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.34/0.72 % (532653)Instruction limit reached!
% 1.34/0.72 % (532653)------------------------------
% 1.34/0.72 % (532653)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.34/0.72 % (532653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.34/0.72 % (532653)CaDiCaL version: 2.1.3
% 1.34/0.72 % (532653)Termination reason: Instruction limit
% 1.34/0.72 % (532653)Termination phase: Saturation
% 1.34/0.72 % (532653)Time elapsed: 0.100 s
% 1.34/0.72 % (532653)Peak memory usage: 15 MB
% 1.34/0.72 % (532653)Instructions burned: 161 (million)
% 1.34/0.72 % (532690)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3580656455:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.34/0.72 % TRYING [1]
% 1.34/0.72 % TRYING [2]
% 1.34/0.72 % TRYING [3]
% 1.34/0.72 % (532696)ott-21_1_sil=16000:fs=off:random_seed=3826192543:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.34/0.72 % TRYING [5]
% 1.34/0.72 % TRYING [4]
% 1.34/0.72 % (532686)Instruction limit reached!
% 1.34/0.72 % (532686)------------------------------
% 1.34/0.72 % (532686)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.34/0.72 % (532686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.34/0.72 % (532686)CaDiCaL version: 2.1.3
% 1.34/0.72 % (532686)Termination reason: Instruction limit
% 1.34/0.72 % (532686)Termination phase: Saturation
% 1.34/0.72 % (532686)Time elapsed: 0.088 s
% 1.34/0.72 % (532686)Peak memory usage: 13 MB
% 1.34/0.72 % (532686)Instructions burned: 131 (million)
% 1.34/0.72 % (532722)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4270883459:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.34/0.72 % TRYING [5]
% 1.34/0.72 % (532649) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-532635-532649"...
% 1.34/0.72 % (532649)...printing done.
% 1.34/0.72 % (532649)Refutation found. Thanks to Tanya!
% 1.34/0.72 % SZS status Theorem for theBenchmark
% 1.34/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 1.34/0.72 % (532649)------------------------------
% 1.34/0.72 % (532649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.34/0.72 % (532649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.34/0.72 % (532649)CaDiCaL version: 2.1.3
% 1.34/0.72 % (532649)Termination reason: Refutation
% 1.34/0.72 % (532649)Time elapsed: 0.226 s
% 1.34/0.72 % (532649)Peak memory usage: 22 MB
% 1.34/0.72 % (532649)Instructions burned: 610 (million)
% 1.34/0.72 % (532635)Success in time 0.268 s
% 1.34/0.72 % Vampire exiting
%------------------------------------------------------------------------------