%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV486+3 : 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 01:16:01 PM UTC 2026
% Result : Theorem 0.62s 0.94s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 10
% Syntax : Number of formulae : 81 ( 19 unt; 4 def)
% Number of atoms : 299 ( 52 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 378 ( 160 ~; 147 |; 50 &)
% ( 6 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn 97 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( int_less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( int_less(X0,X1)
& int_less(X1,X2) )
=> int_less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive) ).
fof(f9,axiom,
! [X0,X1] :
( int_less(X0,X1)
<=> ? [X2] :
( plus(X0,X2) = X1
& int_less(int_zero,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(f10,axiom,
! [X0] :
( int_less(int_zero,X0)
<=> int_leq(int_one,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,n) )
=> ( ! [X2] :
( ( int_less(int_zero,X2)
& X0 = plus(X1,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(plus(X3,X2),X3) = real_zero ) )
& ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,X3) = real_one )
& ! [X2] :
( ( int_less(int_zero,X2)
& X1 = plus(X0,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X0) )
=> a(X3,plus(X3,X2)) = real_zero ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qii) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) )
=> a(X0,X1) = real_zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lt) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) )
=> a(X0,X1) = real_zero ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,n) )
=> ( ! [X2] :
( ( int_less(int_zero,X2)
& X0 = plus(X1,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(plus(X3,X2),X3) = real_zero ) )
& ! [X4] :
( ( int_leq(int_one,X4)
& int_leq(X4,X1) )
=> real_one = a(X4,X4) )
& ! [X5] :
( ( int_less(int_zero,X5)
& plus(X0,X5) = X1 )
=> ! [X6] :
( ( int_leq(int_one,X6)
& int_leq(X6,X0) )
=> real_zero = a(X6,plus(X6,X5)) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f16,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(plus(X3,X2),X3) = real_zero
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) )
& ! [X5] :
( ! [X6] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0) )
| ~ int_less(int_zero,X5)
| plus(X0,X5) != X1 ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(plus(X3,X2),X3) = real_zero
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) )
& ! [X5] :
( ! [X6] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0) )
| ~ int_less(int_zero,X5)
| plus(X0,X5) != X1 ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) ),
inference(ennf_transformation,[],[f14]) ).
fof(f19,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) ),
inference(flattening,[],[f18]) ).
fof(f21,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f22,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(flattening,[],[f21]) ).
fof(f25,plain,
( real_zero != a(sK0,sK1)
& int_leq(int_one,sK0)
& int_less(sK0,sK1)
& int_leq(sK1,n) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f19]) ).
fof(f26,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ? [X2] :
( plus(X0,X2) = X1
& int_less(int_zero,X2) )
| ~ int_less(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f27,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ? [X3] :
( plus(X0,X3) = X1
& int_less(int_zero,X3) )
| ~ int_less(X0,X1) ) ),
inference(rectify,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ( plus(X0,sK2(X0,X1)) = X1
& int_less(int_zero,sK2(X0,X1)) )
| ~ int_less(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1))],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( ~ int_less(X0,X1)
& X0 != X1 ) )
& ( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f30,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( ~ int_less(X0,X1)
& X0 != X1 ) )
& ( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) )
& ( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f32,plain,
! [X0,X1,X6,X5] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0)
| ~ int_less(int_zero,X5)
| plus(X0,X5) != X1
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(cnf_transformation,[],[f17]) ).
fof(f35,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
int_less(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
int_leq(int_one,sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f38,plain,
real_zero != a(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f41,plain,
! [X0,X1] :
( plus(X0,sK2(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f45,plain,
! [X0,X1] :
( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f47,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f48,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f49,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f55,definition,
~ sP3(real_zero),
introduced(definition,[new_symbols(definition,[sP3])],[inequality_splitting_name_introduction]) ).
fof(f56,plain,
sP3(a(sK0,sK1)),
inference(inequality_splitting,[],[f38,f55]) ).
fof(f60,plain,
! [X0,X6,X5] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0)
| ~ int_less(int_zero,X5)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,plus(X0,X5))
| ~ int_leq(plus(X0,X5),n) ),
inference(equality_resolution,[],[f32]) ).
fof(f63,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f46]) ).
fof(f78,plain,
( n = sK1
| int_less(sK1,n) ),
inference(resolution,[],[f35,f45]) ).
fof(f80,definition,
( spl6_4
<=> int_less(sK1,n) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f82,plain,
( int_less(sK1,n)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f84,definition,
( spl6_5
<=> n = sK1 ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f86,plain,
( n = sK1
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f87,plain,
( spl6_4
| spl6_5 ),
inference(avatar_split_clause,[],[f78,f84,f80]) ).
fof(f88,plain,
! [X0] :
( ~ int_less(X0,sK0)
| int_less(X0,sK1) ),
inference(resolution,[],[f36,f51]) ).
fof(f89,plain,
int_leq(sK0,sK1),
inference(resolution,[],[f36,f47]) ).
fof(f90,plain,
int_less(int_zero,sK0),
inference(resolution,[],[f37,f49]) ).
fof(f101,plain,
( ! [X0] :
( ~ int_less(X0,sK1)
| int_less(X0,n) )
| ~ spl6_4 ),
inference(resolution,[],[f82,f51]) ).
fof(f116,plain,
! [X2,X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_less(int_zero,sK2(X1,X0))
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,plus(X2,sK2(X1,X0)))
| ~ int_leq(plus(X2,sK2(X1,X0)),n)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f60,f41]) ).
fof(f120,plain,
! [X2,X0,X1] :
( ~ int_leq(plus(X2,sK2(X1,X0)),n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,plus(X2,sK2(X1,X0)))
| real_zero = a(X1,X0)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f116,f40]) ).
fof(f123,plain,
int_less(int_zero,sK1),
inference(resolution,[],[f88,f90]) ).
fof(f125,plain,
int_leq(int_one,sK1),
inference(resolution,[],[f123,f48]) ).
fof(f133,plain,
( int_less(sK0,n)
| ~ spl6_4 ),
inference(resolution,[],[f101,f36]) ).
fof(f162,plain,
( int_leq(sK0,n)
| ~ spl6_4 ),
inference(resolution,[],[f133,f47]) ).
fof(f170,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| real_zero = a(X1,X0)
| ~ int_less(X1,X0)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f120,f41]) ).
fof(f173,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| real_zero = a(X1,X0)
| ~ int_less(X1,X0) ),
inference(duplicate_literal_removal,[],[f170]) ).
fof(f174,plain,
! [X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f173,f63]) ).
fof(f198,plain,
( sP3(real_zero)
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(superposition,[],[f56,f174]) ).
fof(f202,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f198,f55]) ).
fof(f203,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f202,f37]) ).
fof(f204,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1)
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f203,f162]) ).
fof(f205,plain,
( ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1)
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f204,f125]) ).
fof(f206,plain,
( ~ int_less(sK0,sK1)
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f205,f35]) ).
fof(f207,plain,
( $false
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f206,f36]) ).
fof(f208,plain,
~ spl6_4,
inference(avatar_contradiction_clause,[],[f207]) ).
fof(f210,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f203,f125]) ).
fof(f212,plain,
( ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f210,f35]) ).
fof(f214,definition,
( spl6_10
<=> int_leq(sK0,n) ),
introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).
fof(f216,plain,
( ~ int_leq(sK0,n)
| spl6_10 ),
inference(avatar_component_clause,[],[f214]) ).
fof(f222,plain,
~ int_leq(sK0,n),
inference(forward_subsumption_resolution,[],[f212,f36]) ).
fof(f223,plain,
~ spl6_10,
inference(avatar_split_clause,[],[f222,f214]) ).
fof(f230,plain,
( int_leq(sK0,n)
| ~ spl6_5 ),
inference(superposition,[],[f89,f86]) ).
fof(f236,plain,
( $false
| ~ spl6_5
| spl6_10 ),
inference(forward_subsumption_resolution,[],[f230,f216]) ).
fof(f237,plain,
( ~ spl6_5
| spl6_10 ),
inference(avatar_contradiction_clause,[],[f236]) ).
cnf(s3,plain,
( spl6_4
| spl6_5 ),
inference(sat_conversion,[],[f87]) ).
cnf(s7,plain,
~ spl6_4,
inference(sat_conversion,[],[f208]) ).
cnf(s9,plain,
~ spl6_10,
inference(sat_conversion,[],[f223]) ).
cnf(s10,plain,
( ~ spl6_5
| spl6_10 ),
inference(sat_conversion,[],[f237]) ).
cnf(s11,plain,
~ spl6_5,
inference(rat,[],[s10,s9]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s3,s11,s7]) ).
fof(f238,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV486+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n009.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 11:14:15 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running first-order theorem proving
% 0.09/0.21 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
% 0.62/0.94 % (2970632)Detected formulas, will run a generic FOF schedule.
% 0.62/0.94 % (2970640)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4027530999:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.62/0.94 % (2970640)First to succeed.
% 0.62/0.94 % (2970640)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2970632"
% 0.62/0.94 % (2970639)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=2959849860:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.62/0.94 % (2970638)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=961625342:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.62/0.94 % (2970642)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4154482356:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.62/0.94 % (2970641)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3841042677:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.62/0.94 % (2970637)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=1208246635:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.62/0.94 % (2970643)dis-21_1_sil=8000:lcm=predicate:random_seed=2861499611: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)
% 0.62/0.94 % (2970641)Also succeeded, but the first one will report.
% 0.62/0.94 % (2970642)Instruction limit reached!
% 0.62/0.94 % (2970642)------------------------------
% 0.62/0.94 % (2970642)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.62/0.94 % (2970642)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.62/0.94 % (2970642)CaDiCaL version: 2.1.3
% 0.62/0.94 % (2970642)Termination reason: Instruction limit
% 0.62/0.94 % (2970642)Termination phase: Saturation
% 0.62/0.94 % (2970642)Time elapsed: 0.097 s
% 0.62/0.94 % (2970642)Peak memory usage: 90 MB
% 0.62/0.94 % (2970642)Instructions burned: 140 (million)
% 0.62/0.94 % (2970643)Instruction limit reached!
% 0.62/0.94 % (2970643)------------------------------
% 0.62/0.94 % (2970643)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.62/0.94 % (2970643)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.62/0.94 % (2970643)CaDiCaL version: 2.1.3
% 0.62/0.94 % (2970643)Termination reason: Instruction limit
% 0.62/0.94 % (2970643)Termination phase: Saturation
% 0.62/0.94 % (2970643)Time elapsed: 0.080 s
% 0.62/0.94 % (2970643)Peak memory usage: 88 MB
% 0.62/0.94 % (2970643)Instructions burned: 130 (million)
% 0.62/0.94 % (2970640)Refutation found. Thanks to Tanya!
% 0.62/0.94 % SZS status Theorem for theBenchmark
% 0.62/0.94 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/1.14 % (2970640)------------------------------
% 0.17/1.14 % (2970640)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.14 % (2970640)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.14 % (2970640)CaDiCaL version: 2.1.3
% 0.17/1.14 % (2970640)Termination reason: Refutation
% 0.17/1.14 % (2970640)Time elapsed: 0.005 s
% 0.17/1.14 % (2970640)Peak memory usage: 89 MB
% 0.17/1.14 % (2970640)Instructions burned: 9 (million)
% 0.17/1.14 % (2970640)------------------------------
% 0.17/1.14 % (2970640)------------------------------
% 0.17/1.14 % (2970632)Success in time 0.295 s
% 0.17/1.14 % Vampire exiting
%------------------------------------------------------------------------------