%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM538+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:15:39 PM UTC 2026
% Result : Theorem 4.40s 6.65s
% Output : Refutation 4.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 11 unt; 2 def)
% Number of atoms : 259 ( 44 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 341 ( 140 ~; 132 |; 50 &)
% ( 9 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 99 ( 96 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> aElement0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
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(f17,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aElementOf0(X1,X0)
=> sdtpldt0(sdtmndt0(X0,X1),X1) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mConsDiff) ).
fof(f22,axiom,
! [X0] :
( aElement0(X0)
=> ! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> isFinite0(sdtmndt0(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mFDiffSet) ).
fof(f43,axiom,
! [X0] :
( ( aSet0(X0)
& isFinite0(X0) )
=> ! [X1] :
( aElement0(X1)
=> ( ~ aElementOf0(X1,X0)
=> sbrdtbr0(sdtpldt0(X0,X1)) = szszuzczcdt0(sbrdtbr0(X0)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardCons) ).
fof(f44,axiom,
aSet0(xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1522) ).
fof(f45,axiom,
( isFinite0(xS)
& aElementOf0(xx,xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1522_02) ).
fof(f46,conjecture,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) = sbrdtbr0(xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f47,negated_conjecture,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f48,plain,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS),
inference(flattening,[],[f47]) ).
fof(f53,plain,
! [X0] :
( ! [X1] :
( isFinite0(sdtmndt0(X1,X0))
| ~ aSet0(X1)
| ~ isFinite0(X1) )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f54,plain,
! [X0] :
( ! [X1] :
( isFinite0(sdtmndt0(X1,X0))
| ~ aSet0(X1)
| ~ isFinite0(X1) )
| ~ aElement0(X0) ),
inference(flattening,[],[f53]) ).
fof(f59,plain,
! [X0] :
( ! [X1] :
( sdtpldt0(sdtmndt0(X0,X1),X1) = X0
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f60,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(f61,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,[],[f60]) ).
fof(f65,plain,
! [X0] :
( ! [X1] :
( sbrdtbr0(sdtpldt0(X0,X1)) = szszuzczcdt0(sbrdtbr0(X0))
| aElementOf0(X1,X0)
| ~ aElement0(X1) )
| ~ aSet0(X0)
| ~ isFinite0(X0) ),
inference(ennf_transformation,[],[f43]) ).
fof(f66,plain,
! [X0] :
( ! [X1] :
( sbrdtbr0(sdtpldt0(X0,X1)) = szszuzczcdt0(sbrdtbr0(X0))
| aElementOf0(X1,X0)
| ~ aElement0(X1) )
| ~ aSet0(X0)
| ~ isFinite0(X0) ),
inference(flattening,[],[f65]) ).
fof(f69,plain,
! [X0] :
( ! [X1] :
( aElement0(X1)
| ~ aElementOf0(X1,X0) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f78,definition,
! [X2,X0,X1] :
( sP0(X2,X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aElement0(X3)
& aElementOf0(X3,X0)
& X3 != X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f79,definition,
! [X1,X0] :
( ! [X2] :
( X2 = sdtmndt0(X0,X1)
<=> sP0(X2,X0,X1) )
| ~ sP1(X1,X0) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f80,plain,
! [X0,X1] :
( sP1(X1,X0)
| ~ aSet0(X0)
| ~ aElement0(X1) ),
inference(definition_folding,[],[f61,f79,f78]) ).
fof(f84,plain,
! [X1,X0] :
( ! [X2] :
( ( X2 = sdtmndt0(X0,X1)
| ~ sP0(X2,X0,X1) )
& ( sP0(X2,X0,X1)
| sdtmndt0(X0,X1) != X2 ) )
| ~ sP1(X1,X0) ),
inference(nnf_transformation,[],[f79]) ).
fof(f85,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtmndt0(X1,X0) = X2
| ~ sP0(X2,X1,X0) )
& ( sP0(X2,X1,X0)
| sdtmndt0(X1,X0) != X2 ) )
| ~ sP1(X0,X1) ),
inference(rectify,[],[f84]) ).
fof(f86,plain,
! [X2,X0,X1] :
( ( sP0(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) ) ) )
| ~ sP0(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ( sP0(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) ) ) )
| ~ sP0(X2,X0,X1) ) ),
inference(flattening,[],[f86]) ).
fof(f88,plain,
! [X0,X1,X2] :
( ( sP0(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) ) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f87]) ).
fof(f89,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ~ aSet0(X0)
| ( ( ~ aElement0(sK4(X0,X1,X2))
| ~ aElementOf0(sK4(X0,X1,X2),X1)
| sK4(X0,X1,X2) = X2
| ~ aElementOf0(sK4(X0,X1,X2),X0) )
& ( ( aElement0(sK4(X0,X1,X2))
& aElementOf0(sK4(X0,X1,X2),X1)
& sK4(X0,X1,X2) != X2 )
| aElementOf0(sK4(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) ) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f88]) ).
fof(f97,plain,
aSet0(xS),
inference(cnf_transformation,[],[f44]) ).
fof(f98,plain,
aElementOf0(xx,xS),
inference(cnf_transformation,[],[f45]) ).
fof(f99,plain,
isFinite0(xS),
inference(cnf_transformation,[],[f45]) ).
fof(f100,plain,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS),
inference(cnf_transformation,[],[f48]) ).
fof(f101,plain,
! [X0,X1] :
( isFinite0(sdtmndt0(X1,X0))
| ~ aSet0(X1)
| ~ isFinite0(X1)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f104,plain,
! [X0,X1] :
( sdtpldt0(sdtmndt0(X0,X1),X1) = X0
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f105,plain,
! [X2,X0,X1] :
( sP0(X2,X1,X0)
| sdtmndt0(X1,X0) != X2
| ~ sP1(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f107,plain,
! [X2,X0,X1,X4] :
( X2 != X4
| ~ aElementOf0(X4,X0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f89]) ).
fof(f111,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| aSet0(X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f116,plain,
! [X0,X1] :
( sP1(X1,X0)
| ~ aSet0(X0)
| ~ aElement0(X1) ),
inference(cnf_transformation,[],[f80]) ).
fof(f119,plain,
! [X0,X1] :
( sbrdtbr0(sdtpldt0(X0,X1)) = szszuzczcdt0(sbrdtbr0(X0))
| aElementOf0(X1,X0)
| ~ aElement0(X1)
| ~ aSet0(X0)
| ~ isFinite0(X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f123,plain,
! [X0,X1] :
( ~ aElementOf0(X1,X0)
| aElement0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f141,plain,
! [X0,X1] :
( sP0(sdtmndt0(X1,X0),X1,X0)
| ~ sP1(X0,X1) ),
inference(equality_resolution,[],[f105]) ).
fof(f142,plain,
! [X0,X1,X4] :
( ~ sP0(X0,X1,X4)
| ~ aElementOf0(X4,X0) ),
inference(equality_resolution,[],[f107]) ).
fof(f147,plain,
( aElement0(xx)
| ~ aSet0(xS) ),
inference(resolution,[],[f123,f98]) ).
fof(f148,plain,
aElement0(xx),
inference(forward_subsumption_resolution,[],[f147,f97]) ).
fof(f153,plain,
! [X0,X1] :
( ~ aElementOf0(X0,sdtmndt0(X1,X0))
| ~ sP1(X0,X1) ),
inference(resolution,[],[f141,f142]) ).
fof(f154,plain,
! [X0,X1] :
( aSet0(sdtmndt0(X1,X0))
| ~ sP1(X0,X1) ),
inference(resolution,[],[f141,f111]) ).
fof(f242,plain,
! [X0,X1] :
( sbrdtbr0(X0) = szszuzczcdt0(sbrdtbr0(sdtmndt0(X0,X1)))
| aElementOf0(X1,sdtmndt0(X0,X1))
| ~ aElement0(X1)
| ~ aSet0(sdtmndt0(X0,X1))
| ~ isFinite0(sdtmndt0(X0,X1))
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(superposition,[],[f119,f104]) ).
fof(f250,plain,
! [X0,X1] :
( sbrdtbr0(X0) = szszuzczcdt0(sbrdtbr0(sdtmndt0(X0,X1)))
| aElementOf0(X1,sdtmndt0(X0,X1))
| ~ aSet0(sdtmndt0(X0,X1))
| ~ isFinite0(sdtmndt0(X0,X1))
| ~ aElementOf0(X1,X0)
| ~ aSet0(X0) ),
inference(forward_subsumption_resolution,[],[f242,f123]) ).
fof(f853,plain,
( sbrdtbr0(xS) != sbrdtbr0(xS)
| aElementOf0(xx,sdtmndt0(xS,xx))
| ~ aSet0(sdtmndt0(xS,xx))
| ~ isFinite0(sdtmndt0(xS,xx))
| ~ aElementOf0(xx,xS)
| ~ aSet0(xS) ),
inference(superposition,[],[f100,f250]) ).
fof(f890,plain,
( aElementOf0(xx,sdtmndt0(xS,xx))
| ~ aSet0(sdtmndt0(xS,xx))
| ~ isFinite0(sdtmndt0(xS,xx))
| ~ aElementOf0(xx,xS)
| ~ aSet0(xS) ),
inference(trivial_inequality_removal,[],[f853]) ).
fof(f898,plain,
( aElementOf0(xx,sdtmndt0(xS,xx))
| ~ aSet0(sdtmndt0(xS,xx))
| ~ isFinite0(sdtmndt0(xS,xx))
| ~ aSet0(xS) ),
inference(forward_subsumption_resolution,[],[f890,f98]) ).
fof(f902,plain,
( aElementOf0(xx,sdtmndt0(xS,xx))
| ~ aSet0(sdtmndt0(xS,xx))
| ~ isFinite0(sdtmndt0(xS,xx)) ),
inference(forward_subsumption_resolution,[],[f898,f97]) ).
fof(f905,plain,
( ~ aSet0(sdtmndt0(xS,xx))
| ~ isFinite0(sdtmndt0(xS,xx))
| ~ sP1(xx,xS) ),
inference(resolution,[],[f902,f153]) ).
fof(f915,plain,
( ~ isFinite0(sdtmndt0(xS,xx))
| ~ sP1(xx,xS) ),
inference(forward_subsumption_resolution,[],[f905,f154]) ).
fof(f917,plain,
( ~ sP1(xx,xS)
| ~ aSet0(xS)
| ~ isFinite0(xS)
| ~ aElement0(xx) ),
inference(resolution,[],[f915,f101]) ).
fof(f922,plain,
( ~ aSet0(xS)
| ~ isFinite0(xS)
| ~ aElement0(xx) ),
inference(forward_subsumption_resolution,[],[f917,f116]) ).
fof(f923,plain,
( ~ isFinite0(xS)
| ~ aElement0(xx) ),
inference(forward_subsumption_resolution,[],[f922,f97]) ).
fof(f924,plain,
~ aElement0(xx),
inference(forward_subsumption_resolution,[],[f923,f99]) ).
fof(f925,plain,
$false,
inference(forward_subsumption_resolution,[],[f924,f148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM538+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.38 % Computer : n002.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Sun Sep 27 20:26:29 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.86/6.46 % (3853296)Detected formulas, will run a generic FOF schedule.
% 3.86/6.46 % (3853306)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2454961710:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.86/6.46 % (3853304)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4242807177:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.86/6.46 % (3853303)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=891753700:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.86/6.46 % (3853301)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1961410465:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.86/6.46 % (3853302)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1955782715:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.86/6.46 % (3853304)Refutation not found, incomplete strategy
% 3.86/6.46 % (3853304)------------------------------
% 3.86/6.46 % (3853304)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/6.46 % (3853304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/6.46 % (3853304)CaDiCaL version: 2.1.3
% 3.86/6.46 % (3853304)Termination reason: Refutation not found, incomplete strategy
% 3.86/6.46 % (3853304)Time elapsed: 0.003 s
% 3.86/6.46 % (3853304)Peak memory usage: 88 MB
% 3.86/6.46 % (3853304)Instructions burned: 2 (million)
% 3.86/6.46 % (3853307)dis-21_1_sil=8000:lcm=predicate:random_seed=1018907026:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.86/6.46 % (3853305)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=667935409:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.86/6.46 % (3853306)Instruction limit reached!
% 3.86/6.46 % (3853306)------------------------------
% 3.86/6.46 % (3853306)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/6.46 % (3853306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/6.46 % (3853306)CaDiCaL version: 2.1.3
% 3.86/6.46 % (3853306)Termination reason: Instruction limit
% 3.86/6.46 % (3853306)Termination phase: Saturation
% 3.86/6.46 % (3853306)Time elapsed: 0.051 s
% 3.86/6.46 % (3853306)Peak memory usage: 90 MB
% 3.86/6.46 % (3853306)Instructions burned: 139 (million)
% 3.86/6.46 % (3853305)First to succeed.
% 3.86/6.46 % (3853305)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3853296"
% 3.86/6.46 % (3853307)Instruction limit reached!
% 3.86/6.46 % (3853307)------------------------------
% 3.86/6.46 % (3853307)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/6.46 % (3853307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/6.46 % (3853307)CaDiCaL version: 2.1.3
% 3.86/6.46 % (3853307)Termination reason: Instruction limit
% 3.86/6.46 % (3853307)Termination phase: Saturation
% 3.86/6.46 % (3853307)Time elapsed: 0.067 s
% 3.86/6.46 % (3853307)Peak memory usage: 89 MB
% 3.86/6.46 % (3853307)Instructions burned: 129 (million)
% 3.86/6.46 % (3853315)lrs+10_1_sil=8000:sp=occurrence:random_seed=3604094027:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.86/6.46 % (3853316)lrs+10_1_sil=32000:urr=on:br=off:random_seed=441790184:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.86/6.46 % (3853315)Instruction limit reached!
% 3.86/6.46 % (3853315)------------------------------
% 3.86/6.46 % (3853315)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/6.46 % (3853315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/6.46 % (3853315)CaDiCaL version: 2.1.3
% 3.86/6.46 % (3853315)Termination reason: Instruction limit
% 3.86/6.46 % (3853315)Termination phase: Saturation
% 3.86/6.46 % (3853315)Time elapsed: 0.099 s
% 3.86/6.46 % (3853315)Peak memory usage: 91 MB
% 3.86/6.46 % (3853315)Instructions burned: 286 (million)
% 3.86/6.46 % (3853304)------------------------------
% 3.86/6.46 % (3853304)------------------------------
% 3.86/6.46 % (3853316)Instruction limit reached!
% 3.86/6.46 % (3853316)------------------------------
% 3.86/6.46 % (3853316)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.40/6.65 % (3853316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.40/6.65 % (3853316)CaDiCaL version: 2.1.3
% 4.40/6.65 % (3853316)Termination reason: Instruction limit
% 4.40/6.65 % (3853316)Termination phase: Saturation
% 4.40/6.65 % (3853316)Time elapsed: 0.088 s
% 4.40/6.65 % (3853316)Peak memory usage: 90 MB
% 4.40/6.65 % (3853316)Instructions burned: 157 (million)
% 4.40/6.65 % (3853319)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2272575112:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 4.40/6.65 % (3853305)Refutation found. Thanks to Tanya!
% 4.40/6.65 % SZS status Theorem for theBenchmark
% 4.40/6.65 % SZS output start Proof for theBenchmark
% See solution above
% 4.40/6.65 % (3853305)------------------------------
% 4.40/6.65 % (3853305)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.40/6.65 % (3853305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.40/6.65 % (3853305)CaDiCaL version: 2.1.3
% 4.40/6.65 % (3853305)Termination reason: Refutation
% 4.40/6.65 % (3853305)Time elapsed: 0.028 s
% 4.40/6.65 % (3853305)Peak memory usage: 88 MB
% 4.40/6.65 % (3853305)Instructions burned: 45 (million)
% 4.40/6.65 % (3853305)------------------------------
% 4.40/6.65 % (3853305)------------------------------
% 4.40/6.65 % (3853296)Success in time 0.596 s
% 4.40/6.65 % Vampire exiting
%------------------------------------------------------------------------------