%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : RNG086+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 : 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:35:27 PM UTC 2026
% Result : Theorem 2.68s 1.28s
% Output : Refutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 7 unt; 2 def)
% Number of atoms : 249 ( 36 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 328 ( 129 ~; 115 |; 62 &)
% ( 11 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 152 ( 125 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,axiom,
! [X0,X1] :
( ( aSet0(X0)
& aSet0(X1) )
=> ! [X2] :
( X2 = sdtpldt1(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSSum) ).
fof(f24,axiom,
! [X0] :
( aIdeal0(X0)
<=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefIdeal) ).
fof(f25,axiom,
( aIdeal0(xI)
& aIdeal0(xJ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__870) ).
fof(f26,axiom,
( aElementOf0(xx,sdtpldt1(xI,xJ))
& aElementOf0(xy,sdtpldt1(xI,xJ))
& aElement0(xz) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__901) ).
fof(f27,conjecture,
? [X0,X1] :
( aElementOf0(X0,xI)
& aElementOf0(X1,xJ)
& xx = sdtpldt0(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f28,negated_conjecture,
~ ? [X0,X1] :
( aElementOf0(X0,xI)
& aElementOf0(X1,xJ)
& xx = sdtpldt0(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f29,plain,
! [X0] :
( aIdeal0(X0)
<=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X1),X0) ) ) ) ) ),
inference(rectify,[],[f24]) ).
fof(f33,plain,
! [X0] :
( aIdeal0(X0)
=> ( aSet0(X0)
& ! [X1] :
( aElementOf0(X1,X0)
=> ( ! [X2] :
( aElementOf0(X2,X0)
=> aElementOf0(sdtpldt0(X1,X2),X0) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X1),X0) ) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f29]) ).
fof(f34,plain,
! [X0,X1] :
( ~ aElementOf0(X0,xI)
| ~ aElementOf0(X1,xJ)
| sdtpldt0(X0,X1) != xx ),
inference(ennf_transformation,[],[f28]) ).
fof(f35,plain,
! [X0] :
( ( aSet0(X0)
& ! [X1] :
( ( ! [X2] :
( aElementOf0(sdtpldt0(X1,X2),X0)
| ~ aElementOf0(X2,X0) )
& ! [X3] :
( aElementOf0(sdtasdt0(X3,X1),X0)
| ~ aElement0(X3) ) )
| ~ aElementOf0(X1,X0) ) )
| ~ aIdeal0(X0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f36,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtpldt1(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 ) ) ) )
| ~ aSet0(X0)
| ~ aSet0(X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f37,plain,
! [X0,X1] :
( ! [X2] :
( X2 = sdtpldt1(X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 ) ) ) )
| ~ aSet0(X0)
| ~ aSet0(X1) ),
inference(flattening,[],[f36]) ).
fof(f55,definition,
! [X2,X0,X1] :
( sP0(X2,X0,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f56,definition,
! [X1,X0] :
( ! [X2] :
( X2 = sdtpldt1(X0,X1)
<=> sP0(X2,X0,X1) )
| ~ sP1(X1,X0) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f57,plain,
! [X0,X1] :
( sP1(X1,X0)
| ~ aSet0(X0)
| ~ aSet0(X1) ),
inference(definition_folding,[],[f37,f56,f55]) ).
fof(f58,plain,
! [X1,X0] :
( ! [X2] :
( ( X2 = sdtpldt1(X0,X1)
| ~ sP0(X2,X0,X1) )
& ( sP0(X2,X0,X1)
| sdtpldt1(X0,X1) != X2 ) )
| ~ sP1(X1,X0) ),
inference(nnf_transformation,[],[f56]) ).
fof(f59,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtpldt1(X1,X0) = X2
| ~ sP0(X2,X1,X0) )
& ( sP0(X2,X1,X0)
| sdtpldt1(X1,X0) != X2 ) )
| ~ sP1(X0,X1) ),
inference(rectify,[],[f58]) ).
fof(f60,plain,
! [X2,X0,X1] :
( ( sP0(X2,X0,X1)
| ~ aSet0(X2)
| ? [X3] :
( ( ! [X4,X5] :
( ~ aElementOf0(X4,X0)
| ~ aElementOf0(X5,X1)
| sdtpldt0(X4,X5) != X3 )
| ~ aElementOf0(X3,X2) )
& ( ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 )
| aElementOf0(X3,X2) ) ) )
& ( ( aSet0(X2)
& ! [X3] :
( ( aElementOf0(X3,X2)
| ! [X4,X5] :
( ~ aElementOf0(X4,X0)
| ~ aElementOf0(X5,X1)
| sdtpldt0(X4,X5) != X3 ) )
& ( ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 )
| ~ aElementOf0(X3,X2) ) ) )
| ~ sP0(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f55]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ( sP0(X2,X0,X1)
| ~ aSet0(X2)
| ? [X3] :
( ( ! [X4,X5] :
( ~ aElementOf0(X4,X0)
| ~ aElementOf0(X5,X1)
| sdtpldt0(X4,X5) != X3 )
| ~ aElementOf0(X3,X2) )
& ( ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 )
| aElementOf0(X3,X2) ) ) )
& ( ( aSet0(X2)
& ! [X3] :
( ( aElementOf0(X3,X2)
| ! [X4,X5] :
( ~ aElementOf0(X4,X0)
| ~ aElementOf0(X5,X1)
| sdtpldt0(X4,X5) != X3 ) )
& ( ? [X4,X5] :
( aElementOf0(X4,X0)
& aElementOf0(X5,X1)
& sdtpldt0(X4,X5) = X3 )
| ~ aElementOf0(X3,X2) ) ) )
| ~ sP0(X2,X0,X1) ) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ~ aSet0(X0)
| ? [X3] :
( ( ! [X4,X5] :
( ~ aElementOf0(X4,X1)
| ~ aElementOf0(X5,X2)
| sdtpldt0(X4,X5) != X3 )
| ~ aElementOf0(X3,X0) )
& ( ? [X6,X7] :
( aElementOf0(X6,X1)
& aElementOf0(X7,X2)
& sdtpldt0(X6,X7) = X3 )
| aElementOf0(X3,X0) ) ) )
& ( ( aSet0(X0)
& ! [X8] :
( ( aElementOf0(X8,X0)
| ! [X9,X10] :
( ~ aElementOf0(X9,X1)
| ~ aElementOf0(X10,X2)
| sdtpldt0(X9,X10) != X8 ) )
& ( ? [X11,X12] :
( aElementOf0(X11,X1)
& aElementOf0(X12,X2)
& sdtpldt0(X11,X12) = X8 )
| ~ aElementOf0(X8,X0) ) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f61]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ~ aSet0(X0)
| ( ( ! [X4,X5] :
( ~ aElementOf0(X4,X1)
| ~ aElementOf0(X5,X2)
| sdtpldt0(X4,X5) != sK2(X0,X1,X2) )
| ~ aElementOf0(sK2(X0,X1,X2),X0) )
& ( ( aElementOf0(sK3(X0,X1,X2),X1)
& aElementOf0(sK4(X0,X1,X2),X2)
& sK2(X0,X1,X2) = sdtpldt0(sK3(X0,X1,X2),sK4(X0,X1,X2)) )
| aElementOf0(sK2(X0,X1,X2),X0) ) ) )
& ( ( aSet0(X0)
& ! [X8] :
( ( aElementOf0(X8,X0)
| ! [X9,X10] :
( ~ aElementOf0(X9,X1)
| ~ aElementOf0(X10,X2)
| sdtpldt0(X9,X10) != X8 ) )
& ( ( aElementOf0(sK5(X1,X2,X8),X1)
& aElementOf0(sK6(X1,X2,X8),X2)
& sdtpldt0(sK5(X1,X2,X8),sK6(X1,X2,X8)) = X8 )
| ~ aElementOf0(X8,X0) ) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6]),skolemize(X3,sK2(X0,X1,X2)),skolemize(X6,sK3(X0,X1,X2)),skolemize(X7,sK4(X0,X1,X2)),skolemize(X11,sK5(X1,X2,X8)),skolemize(X12,sK6(X1,X2,X8))],[f62]) ).
fof(f65,plain,
aIdeal0(xJ),
inference(cnf_transformation,[],[f25]) ).
fof(f66,plain,
aIdeal0(xI),
inference(cnf_transformation,[],[f25]) ).
fof(f69,plain,
aElementOf0(xx,sdtpldt1(xI,xJ)),
inference(cnf_transformation,[],[f26]) ).
fof(f70,plain,
! [X0,X1] :
( sdtpldt0(X0,X1) != xx
| ~ aElementOf0(X1,xJ)
| ~ aElementOf0(X0,xI) ),
inference(cnf_transformation,[],[f34]) ).
fof(f73,plain,
! [X0] :
( aSet0(X0)
| ~ aIdeal0(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f74,plain,
! [X2,X0,X1] :
( sP0(X2,X1,X0)
| sdtpldt1(X1,X0) != X2
| ~ sP1(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f75,plain,
! [X2,X0,X1] :
( sdtpldt1(X1,X0) = X2
| ~ sP0(X2,X1,X0)
| ~ sP1(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f76,plain,
! [X2,X0,X1,X8] :
( sdtpldt0(sK5(X1,X2,X8),sK6(X1,X2,X8)) = X8
| ~ aElementOf0(X8,X0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f63]) ).
fof(f77,plain,
! [X2,X0,X1,X8] :
( aElementOf0(sK6(X1,X2,X8),X2)
| ~ aElementOf0(X8,X0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f63]) ).
fof(f78,plain,
! [X2,X0,X1,X8] :
( aElementOf0(sK5(X1,X2,X8),X1)
| ~ aElementOf0(X8,X0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f63]) ).
fof(f85,plain,
! [X0,X1] :
( sP1(X1,X0)
| ~ aSet0(X0)
| ~ aSet0(X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f99,plain,
! [X0,X1] :
( sP0(sdtpldt1(X1,X0),X1,X0)
| ~ sP1(X0,X1) ),
inference(equality_resolution,[],[f74]) ).
fof(f135,plain,
! [X0] :
( ~ sP0(X0,xI,xJ)
| aElementOf0(xx,X0)
| ~ sP1(xJ,xI) ),
inference(superposition,[],[f69,f75]) ).
fof(f333,plain,
! [X2,X3,X0,X1] :
( xx != X0
| ~ aElementOf0(sK6(X1,X2,X0),xJ)
| ~ aElementOf0(sK5(X1,X2,X0),xI)
| ~ aElementOf0(X0,X3)
| ~ sP0(X3,X1,X2) ),
inference(superposition,[],[f70,f76]) ).
fof(f578,plain,
! [X2,X0,X1] :
( ~ aElementOf0(sK6(X0,X1,xx),xJ)
| ~ aElementOf0(sK5(X0,X1,xx),xI)
| ~ aElementOf0(xx,X2)
| ~ sP0(X2,X0,X1) ),
inference(equality_resolution,[],[f333]) ).
fof(f579,plain,
! [X2,X0,X1] :
( ~ aElementOf0(sK5(X0,xJ,xx),xI)
| ~ aElementOf0(xx,X1)
| ~ sP0(X1,X0,xJ)
| ~ aElementOf0(xx,X2)
| ~ sP0(X2,X0,xJ) ),
inference(resolution,[],[f578,f77]) ).
fof(f601,plain,
! [X2,X0,X1] :
( ~ sP0(X2,xI,xJ)
| ~ sP0(X0,xI,xJ)
| ~ aElementOf0(xx,X1)
| ~ sP0(X1,xI,xJ)
| ~ aElementOf0(xx,X2)
| ~ aElementOf0(xx,X0) ),
inference(resolution,[],[f579,f78]) ).
fof(f731,plain,
! [X0,X1] :
( ~ sP0(X0,xI,xJ)
| ~ aElementOf0(xx,X1)
| ~ sP0(X1,xI,xJ)
| ~ aElementOf0(xx,sdtpldt1(xI,xJ))
| ~ aElementOf0(xx,X0)
| ~ sP1(xJ,xI) ),
inference(resolution,[],[f601,f99]) ).
fof(f736,plain,
! [X0,X1] :
( ~ sP0(X0,xI,xJ)
| ~ aElementOf0(xx,X1)
| ~ sP0(X1,xI,xJ)
| ~ aElementOf0(xx,X0)
| ~ sP1(xJ,xI) ),
inference(forward_subsumption_resolution,[],[f731,f69]) ).
fof(f737,plain,
! [X0,X1] :
( ~ sP0(X0,xI,xJ)
| ~ sP0(X1,xI,xJ)
| ~ aElementOf0(xx,X0)
| ~ sP1(xJ,xI) ),
inference(forward_subsumption_resolution,[],[f736,f135]) ).
fof(f738,plain,
! [X0,X1] :
( ~ sP0(X1,xI,xJ)
| ~ sP0(X0,xI,xJ)
| ~ sP1(xJ,xI) ),
inference(forward_subsumption_resolution,[],[f737,f135]) ).
fof(f740,plain,
! [X0] :
( ~ sP0(X0,xI,xJ)
| ~ sP1(xJ,xI) ),
inference(factoring,[],[f738]) ).
fof(f761,plain,
( ~ sP1(xJ,xI)
| ~ sP1(xJ,xI) ),
inference(resolution,[],[f740,f99]) ).
fof(f762,plain,
~ sP1(xJ,xI),
inference(duplicate_literal_removal,[],[f761]) ).
fof(f784,plain,
( ~ aSet0(xJ)
| ~ aSet0(xI) ),
inference(resolution,[],[f762,f85]) ).
fof(f785,plain,
( ~ aSet0(xI)
| ~ aIdeal0(xJ) ),
inference(resolution,[],[f784,f73]) ).
fof(f786,plain,
~ aSet0(xI),
inference(forward_subsumption_resolution,[],[f785,f65]) ).
fof(f787,plain,
~ aIdeal0(xI),
inference(resolution,[],[f786,f73]) ).
fof(f788,plain,
$false,
inference(forward_subsumption_resolution,[],[f787,f66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG086+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.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:12:54 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 2.68/1.28 % (2841388)Detected formulas, will run a generic FOF schedule.
% 2.68/1.28 % (2841394)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=3311555627:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.68/1.28 % (2841398)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3002328519:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.68/1.28 % (2841397)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2939540203:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.68/1.28 % (2841399)dis-21_1_sil=8000:lcm=predicate:random_seed=2970942931: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)
% 2.68/1.28 % (2841395)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=693506897:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.68/1.28 % (2841393)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=4287607743:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.68/1.28 % (2841396)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2389259212:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.68/1.28 % (2841397)First to succeed.
% 2.68/1.28 % (2841397)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2841388"
% 2.68/1.28 % (2841396)Also succeeded, but the first one will report.
% 2.68/1.28 % (2841399)Instruction limit reached!
% 2.68/1.28 % (2841399)------------------------------
% 2.68/1.28 % (2841399)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.28 % (2841399)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.28 % (2841399)CaDiCaL version: 2.1.3
% 2.68/1.28 % (2841399)Termination reason: Instruction limit
% 2.68/1.28 % (2841399)Termination phase: Saturation
% 2.68/1.28 % (2841399)Time elapsed: 0.075 s
% 2.68/1.28 % (2841399)Peak memory usage: 89 MB
% 2.68/1.28 % (2841399)Instructions burned: 129 (million)
% 2.68/1.28 % (2841398)Instruction limit reached!
% 2.68/1.28 % (2841398)------------------------------
% 2.68/1.28 % (2841398)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.28 % (2841398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.28 % (2841398)CaDiCaL version: 2.1.3
% 2.68/1.28 % (2841398)Termination reason: Instruction limit
% 2.68/1.28 % (2841398)Termination phase: Saturation
% 2.68/1.28 % (2841398)Time elapsed: 0.090 s
% 2.68/1.28 % (2841398)Peak memory usage: 90 MB
% 2.68/1.28 % (2841398)Instructions burned: 140 (million)
% 2.68/1.28 % (2841407)lrs+10_1_sil=8000:sp=occurrence:random_seed=212539029:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.68/1.28 % (2841408)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2686276351:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.68/1.28 % (2841407)Also succeeded, but the first one will report.
% 2.68/1.28 % (2841397)Refutation found. Thanks to Tanya!
% 2.68/1.28 % SZS status Theorem for theBenchmark
% 2.68/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 3.50/1.37 % (2841397)------------------------------
% 3.50/1.37 % (2841397)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.37 % (2841397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.37 % (2841397)CaDiCaL version: 2.1.3
% 3.50/1.37 % (2841397)Termination reason: Refutation
% 3.50/1.37 % (2841397)Time elapsed: 0.019 s
% 3.50/1.37 % (2841397)Peak memory usage: 88 MB
% 3.50/1.37 % (2841397)Instructions burned: 29 (million)
% 3.50/1.37 % (2841397)------------------------------
% 3.50/1.37 % (2841397)------------------------------
% 3.50/1.37 % (2841388)Success in time 0.43 s
% 3.50/1.37 % Vampire exiting
%------------------------------------------------------------------------------