%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : RNG091+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:28 PM UTC 2026
% Result : Theorem 3.18s 1.34s
% Output : Refutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 14 unt; 2 def)
% Number of atoms : 254 ( 35 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 324 ( 128 ~; 114 |; 60 &)
% ( 11 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-3 aty)
% Number of variables : 141 ( 118 !; 23 ?)
% 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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).
fof(f25,axiom,
( aIdeal0(xI)
& aIdeal0(xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__870) ).
fof(f29,axiom,
( aElementOf0(sdtpldt0(xk,xm),xI)
& aElementOf0(sdtpldt0(xl,xn),xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__994) ).
fof(f30,axiom,
( aElementOf0(sdtasdt0(xz,xk),xI)
& aElementOf0(sdtasdt0(xz,xl),xJ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1021) ).
fof(f31,axiom,
sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1061) ).
fof(f32,axiom,
sdtasdt0(xz,xx) = sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1098) ).
fof(f33,conjecture,
( aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
& aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f34,negated_conjecture,
~ ( aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
& aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,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(f39,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,[],[f35]) ).
fof(f40,plain,
( ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
| ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ),
inference(ennf_transformation,[],[f34]) ).
fof(f41,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,[],[f39]) ).
fof(f42,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(f43,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,[],[f42]) ).
fof(f61,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(f62,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(f63,plain,
! [X0,X1] :
( sP1(X1,X0)
| ~ aSet0(X0)
| ~ aSet0(X1) ),
inference(definition_folding,[],[f43,f62,f61]) ).
fof(f64,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,[],[f62]) ).
fof(f65,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,[],[f64]) ).
fof(f66,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,[],[f61]) ).
fof(f67,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,[],[f66]) ).
fof(f68,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,[],[f67]) ).
fof(f69,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))],[f68]) ).
fof(f71,plain,
aIdeal0(xJ),
inference(cnf_transformation,[],[f25]) ).
fof(f72,plain,
aIdeal0(xI),
inference(cnf_transformation,[],[f25]) ).
fof(f82,plain,
aElementOf0(sdtpldt0(xl,xn),xJ),
inference(cnf_transformation,[],[f29]) ).
fof(f83,plain,
aElementOf0(sdtpldt0(xk,xm),xI),
inference(cnf_transformation,[],[f29]) ).
fof(f84,plain,
aElementOf0(sdtasdt0(xz,xl),xJ),
inference(cnf_transformation,[],[f30]) ).
fof(f85,plain,
aElementOf0(sdtasdt0(xz,xk),xI),
inference(cnf_transformation,[],[f30]) ).
fof(f86,plain,
sdtpldt0(xx,xy) = sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)),
inference(cnf_transformation,[],[f31]) ).
fof(f87,plain,
sdtasdt0(xz,xx) = sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)),
inference(cnf_transformation,[],[f32]) ).
fof(f88,plain,
( ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ))
| ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ)) ),
inference(cnf_transformation,[],[f40]) ).
fof(f91,plain,
! [X0] :
( aSet0(X0)
| ~ aIdeal0(X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f92,plain,
! [X2,X0,X1] :
( sP0(X2,X1,X0)
| sdtpldt1(X1,X0) != X2
| ~ sP1(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
fof(f93,plain,
! [X2,X0,X1] :
( sdtpldt1(X1,X0) = X2
| ~ sP0(X2,X1,X0)
| ~ sP1(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
fof(f97,plain,
! [X2,X10,X0,X1,X8,X9] :
( aElementOf0(X8,X0)
| ~ aElementOf0(X9,X1)
| ~ aElementOf0(X10,X2)
| sdtpldt0(X9,X10) != X8
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f69]) ).
fof(f103,plain,
! [X0,X1] :
( sP1(X1,X0)
| ~ aSet0(X0)
| ~ aSet0(X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f117,plain,
! [X0,X1] :
( sP0(sdtpldt1(X1,X0),X1,X0)
| ~ sP1(X0,X1) ),
inference(equality_resolution,[],[f92]) ).
fof(f118,plain,
! [X2,X10,X0,X1,X9] :
( aElementOf0(sdtpldt0(X9,X10),X0)
| ~ aElementOf0(X9,X1)
| ~ aElementOf0(X10,X2)
| ~ sP0(X0,X1,X2) ),
inference(equality_resolution,[],[f97]) ).
fof(f196,plain,
! [X0] :
( ~ aElementOf0(sdtasdt0(xz,xx),X0)
| ~ aElementOf0(sdtpldt0(xx,xy),X0)
| ~ sP0(X0,xI,xJ)
| ~ sP1(xJ,xI) ),
inference(superposition,[],[f88,f93]) ).
fof(f238,plain,
! [X2,X0,X1] :
( aElementOf0(sdtpldt0(xx,xy),X0)
| ~ aElementOf0(sdtpldt0(xk,xm),X1)
| ~ aElementOf0(sdtpldt0(xl,xn),X2)
| ~ sP0(X0,X1,X2) ),
inference(superposition,[],[f118,f86]) ).
fof(f239,plain,
! [X2,X0,X1] :
( aElementOf0(sdtasdt0(xz,xx),X0)
| ~ aElementOf0(sdtasdt0(xz,xk),X1)
| ~ aElementOf0(sdtasdt0(xz,xl),X2)
| ~ sP0(X0,X1,X2) ),
inference(superposition,[],[f118,f87]) ).
fof(f1920,plain,
! [X2,X0,X1] :
( ~ aElementOf0(sdtasdt0(xz,xl),X1)
| ~ aElementOf0(sdtasdt0(xz,xk),X0)
| ~ sP0(X2,X0,X1)
| ~ aElementOf0(sdtpldt0(xx,xy),X2)
| ~ sP0(X2,xI,xJ)
| ~ sP1(xJ,xI) ),
inference(resolution,[],[f239,f196]) ).
fof(f1936,plain,
! [X0,X1] :
( ~ aElementOf0(sdtasdt0(xz,xk),X0)
| ~ sP0(X1,X0,xJ)
| ~ aElementOf0(sdtpldt0(xx,xy),X1)
| ~ sP0(X1,xI,xJ)
| ~ sP1(xJ,xI) ),
inference(resolution,[],[f1920,f84]) ).
fof(f1984,plain,
! [X0] :
( ~ sP0(X0,xI,xJ)
| ~ aElementOf0(sdtpldt0(xx,xy),X0)
| ~ sP0(X0,xI,xJ)
| ~ sP1(xJ,xI) ),
inference(resolution,[],[f1936,f85]) ).
fof(f1989,plain,
! [X0] :
( ~ aElementOf0(sdtpldt0(xx,xy),X0)
| ~ sP0(X0,xI,xJ)
| ~ sP1(xJ,xI) ),
inference(duplicate_literal_removal,[],[f1984]) ).
fof(f1994,plain,
! [X2,X0,X1] :
( ~ aElementOf0(sdtpldt0(xl,xn),X2)
| ~ sP1(xJ,xI)
| ~ aElementOf0(sdtpldt0(xk,xm),X1)
| ~ sP0(X0,xI,xJ)
| ~ sP0(X0,X1,X2) ),
inference(resolution,[],[f1989,f238]) ).
fof(f2432,plain,
! [X0,X1] :
( ~ aElementOf0(sdtpldt0(xk,xm),X0)
| ~ sP1(xJ,xI)
| ~ sP0(X1,xI,xJ)
| ~ sP0(X1,X0,xJ) ),
inference(resolution,[],[f1994,f82]) ).
fof(f2552,plain,
! [X0] :
( ~ sP1(xJ,xI)
| ~ sP0(X0,xI,xJ)
| ~ sP0(X0,xI,xJ) ),
inference(resolution,[],[f2432,f83]) ).
fof(f2555,plain,
! [X0] :
( ~ sP0(X0,xI,xJ)
| ~ sP1(xJ,xI) ),
inference(duplicate_literal_removal,[],[f2552]) ).
fof(f2556,plain,
( ~ sP1(xJ,xI)
| ~ sP1(xJ,xI) ),
inference(resolution,[],[f2555,f117]) ).
fof(f2557,plain,
~ sP1(xJ,xI),
inference(duplicate_literal_removal,[],[f2556]) ).
fof(f2558,plain,
( ~ aSet0(xJ)
| ~ aSet0(xI) ),
inference(resolution,[],[f2557,f103]) ).
fof(f2677,plain,
( ~ aSet0(xI)
| ~ aIdeal0(xJ) ),
inference(resolution,[],[f2558,f91]) ).
fof(f2678,plain,
~ aSet0(xI),
inference(forward_subsumption_resolution,[],[f2677,f71]) ).
fof(f2679,plain,
~ aIdeal0(xI),
inference(resolution,[],[f2678,f91]) ).
fof(f2680,plain,
$false,
inference(forward_subsumption_resolution,[],[f2679,f72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG091+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n009.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:13:15 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.18/1.34 % (2515519)Detected formulas, will run a generic FOF schedule.
% 3.18/1.34 % (2515526)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=566720782:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.18/1.34 % (2515527)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=841573796:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.18/1.34 % (2515530)dis-21_1_sil=8000:lcm=predicate:random_seed=4040201158: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.18/1.34 % (2515525)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=1787086939:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.18/1.34 % (2515524)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=4117773100:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.18/1.34 % (2515529)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1654591044:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.18/1.34 % (2515528)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2226851462:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.18/1.34 % (2515527)Refutation not found, incomplete strategy
% 3.18/1.34 % (2515527)------------------------------
% 3.18/1.34 % (2515527)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.34 % (2515527)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.34 % (2515527)CaDiCaL version: 2.1.3
% 3.18/1.34 % (2515527)Termination reason: Refutation not found, incomplete strategy
% 3.18/1.34 % (2515527)Time elapsed: 0.008 s
% 3.18/1.34 % (2515527)Peak memory usage: 88 MB
% 3.18/1.34 % (2515527)Instructions burned: 10 (million)
% 3.18/1.34 % (2515528)First to succeed.
% 3.18/1.34 % (2515528)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2515519"
% 3.18/1.34 % (2515530)Instruction limit reached!
% 3.18/1.34 % (2515530)------------------------------
% 3.18/1.34 % (2515530)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.34 % (2515530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.34 % (2515530)CaDiCaL version: 2.1.3
% 3.18/1.34 % (2515530)Termination reason: Instruction limit
% 3.18/1.34 % (2515530)Termination phase: Saturation
% 3.18/1.34 % (2515530)Time elapsed: 0.073 s
% 3.18/1.34 % (2515530)Peak memory usage: 90 MB
% 3.18/1.34 % (2515530)Instructions burned: 130 (million)
% 3.18/1.34 % (2515529)Instruction limit reached!
% 3.18/1.34 % (2515529)------------------------------
% 3.18/1.34 % (2515529)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.34 % (2515529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.34 % (2515529)CaDiCaL version: 2.1.3
% 3.18/1.34 % (2515529)Termination reason: Instruction limit
% 3.18/1.34 % (2515529)Termination phase: Saturation
% 3.18/1.34 % (2515529)Time elapsed: 0.090 s
% 3.18/1.34 % (2515529)Peak memory usage: 90 MB
% 3.18/1.34 % (2515529)Instructions burned: 140 (million)
% 3.18/1.34 % (2515538)lrs+10_1_sil=8000:sp=occurrence:random_seed=1849487107:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.18/1.34 % (2515527)------------------------------
% 3.18/1.34 % (2515527)------------------------------
% 3.18/1.34 % (2515539)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2231329387:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.18/1.34 % (2515528)Refutation found. Thanks to Tanya!
% 3.18/1.34 % SZS status Theorem for theBenchmark
% 3.18/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 4.02/1.54 % (2515528)------------------------------
% 4.02/1.54 % (2515528)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.54 % (2515528)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.54 % (2515528)CaDiCaL version: 2.1.3
% 4.02/1.54 % (2515528)Termination reason: Refutation
% 4.02/1.54 % (2515528)Time elapsed: 0.055 s
% 4.02/1.54 % (2515528)Peak memory usage: 89 MB
% 4.02/1.54 % (2515528)Instructions burned: 91 (million)
% 4.02/1.54 % (2515528)------------------------------
% 4.02/1.54 % (2515528)------------------------------
% 4.02/1.54 % (2515519)Success in time 0.48 s
% 4.02/1.54 % Vampire exiting
%------------------------------------------------------------------------------