%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV487+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 : n004.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.66s 0.98s
% Output : Refutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 11
% Syntax : Number of formulae : 89 ( 19 unt; 5 def)
% Number of atoms : 304 ( 43 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 384 ( 169 ~; 151 |; 44 &)
% ( 7 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(f10,axiom,
! [X0] :
( int_less(int_zero,X0)
<=> int_leq(int_one,X0) ),
file('/export/starexec/sandbox/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 ) )
& ! [X2] :
( ( int_leq(int_zero,X2)
& X1 = plus(X0,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X0) )
=> a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qiu) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(int_one,X1)
& int_less(X1,X0)
& int_leq(X0,n) )
=> a(X0,X1) = real_zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ut) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(int_one,X1)
& int_less(X1,X0)
& int_leq(X0,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_zero,X4)
& plus(X0,X4) = X1 )
=> ! [X5] :
( ( int_leq(int_one,X5)
& int_leq(X5,X0) )
=> a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4)) ) ) ) ),
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] :
( ! [X5] :
( a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0) )
| ~ int_leq(int_zero,X4)
| plus(X0,X4) != 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] :
( ! [X5] :
( a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0) )
| ~ int_leq(int_zero,X4)
| plus(X0,X4) != 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,X1)
& int_less(X1,X0)
& int_leq(X0,n) ),
inference(ennf_transformation,[],[f14]) ).
fof(f19,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X1)
& int_less(X1,X0)
& int_leq(X0,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,sK1)
& int_less(sK1,sK0)
& int_leq(sK0,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(f33,plain,
! [X2,X3,X0,X1] :
( real_zero = a(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1)
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
int_less(sK1,sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
real_zero != a(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f39,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f40,plain,
! [X0,X1] :
( plus(X0,sK2(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f44,plain,
! [X0,X1] :
( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f45,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f47,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f48,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f53,definition,
~ sP3(real_zero),
introduced(definition,[new_symbols(definition,[sP3])],[inequality_splitting_name_introduction]) ).
fof(f54,plain,
sP3(a(sK0,sK1)),
inference(inequality_splitting,[],[f37,f53]) ).
fof(f55,plain,
! [X2,X3,X1] :
( real_zero = a(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1)
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,plus(X1,X2))
| ~ int_leq(plus(X1,X2),n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(equality_resolution,[],[f33]) ).
fof(f59,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f45]) ).
fof(f60,plain,
( n = sK0
| int_less(sK0,n) ),
inference(resolution,[],[f34,f44]) ).
fof(f62,definition,
( spl4_1
<=> int_less(sK0,n) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f64,plain,
( int_less(sK0,n)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f62]) ).
fof(f66,definition,
( spl4_2
<=> n = sK0 ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f68,plain,
( n = sK0
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f69,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f60,f66,f62]) ).
fof(f70,plain,
! [X0] :
( ~ int_less(X0,sK1)
| int_less(X0,sK0) ),
inference(resolution,[],[f35,f50]) ).
fof(f71,plain,
int_leq(sK1,sK0),
inference(resolution,[],[f35,f46]) ).
fof(f72,plain,
( int_leq(sK1,n)
| ~ spl4_2 ),
inference(forward_demodulation,[],[f71,f68]) ).
fof(f73,plain,
( ! [X0] :
( ~ int_less(X0,sK1)
| int_less(X0,n) )
| ~ spl4_2 ),
inference(forward_demodulation,[],[f70,f68]) ).
fof(f74,plain,
int_less(int_zero,sK1),
inference(resolution,[],[f36,f48]) ).
fof(f94,plain,
! [X2,X0,X1] :
( ~ sP3(a(plus(X0,X1),X0))
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,X2)
| ~ int_less(int_zero,X1)
| ~ int_leq(int_one,plus(X2,X1))
| ~ int_leq(plus(X2,X1),n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n) ),
inference(superposition,[],[f53,f55]) ).
fof(f111,plain,
( int_less(int_zero,n)
| ~ spl4_2 ),
inference(resolution,[],[f73,f74]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ sP3(a(X0,X1))
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_less(int_zero,sK2(X1,X0))
| ~ int_leq(int_one,plus(X2,sK2(X1,X0)))
| ~ int_leq(plus(X2,sK2(X1,X0)),n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f94,f40]) ).
fof(f121,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,plus(X2,sK2(X1,X0)))
| ~ sP3(a(X0,X1))
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f115,f39]) ).
fof(f123,plain,
( int_leq(int_one,n)
| ~ spl4_2 ),
inference(resolution,[],[f111,f47]) ).
fof(f223,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(int_one,X0)
| ~ sP3(a(X0,X1))
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_less(X1,X0)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f121,f40]) ).
fof(f226,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(int_one,X0)
| ~ sP3(a(X0,X1))
| ~ int_leq(X1,n)
| ~ int_less(X1,X0) ),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f227,plain,
! [X0,X1] :
( ~ sP3(a(X0,X1))
| ~ int_leq(int_one,X1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(X1,n)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f226,f59]) ).
fof(f691,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK0) ),
inference(resolution,[],[f227,f54]) ).
fof(f728,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f691,f36]) ).
fof(f730,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK1,n)
| ~ int_less(sK1,sK0) ),
inference(forward_subsumption_resolution,[],[f728,f34]) ).
fof(f732,plain,
( ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f730,f72]) ).
fof(f734,plain,
( ~ int_leq(int_one,sK0)
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f732,f35]) ).
fof(f737,plain,
( ~ int_leq(int_one,n)
| ~ spl4_2 ),
inference(forward_demodulation,[],[f734,f68]) ).
fof(f738,plain,
( $false
| ~ spl4_2 ),
inference(forward_subsumption_resolution,[],[f737,f123]) ).
fof(f739,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f738]) ).
fof(f745,definition,
( spl4_15
<=> int_leq(sK1,n) ),
introduced(definition,[new_symbols(definition,[spl4_15])],[avatar_definition]) ).
fof(f747,plain,
( ~ int_leq(sK1,n)
| spl4_15 ),
inference(avatar_component_clause,[],[f745]) ).
fof(f753,definition,
( spl4_17
<=> int_leq(int_one,sK0) ),
introduced(definition,[new_symbols(definition,[spl4_17])],[avatar_definition]) ).
fof(f755,plain,
( ~ int_leq(int_one,sK0)
| spl4_17 ),
inference(avatar_component_clause,[],[f753]) ).
fof(f762,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK1,n) ),
inference(forward_subsumption_resolution,[],[f730,f35]) ).
fof(f763,plain,
( ~ spl4_15
| ~ spl4_17 ),
inference(avatar_split_clause,[],[f762,f753,f745]) ).
fof(f764,plain,
( ! [X0] :
( ~ int_less(X0,sK0)
| int_less(X0,n) )
| ~ spl4_1 ),
inference(resolution,[],[f64,f50]) ).
fof(f770,plain,
int_less(int_zero,sK0),
inference(resolution,[],[f70,f74]) ).
fof(f773,plain,
int_leq(int_one,sK0),
inference(resolution,[],[f770,f47]) ).
fof(f776,plain,
( $false
| spl4_17 ),
inference(forward_subsumption_resolution,[],[f773,f755]) ).
fof(f777,plain,
spl4_17,
inference(avatar_contradiction_clause,[],[f776]) ).
fof(f787,plain,
( int_less(sK1,n)
| ~ spl4_1 ),
inference(resolution,[],[f764,f35]) ).
fof(f809,plain,
( int_leq(sK1,n)
| ~ spl4_1 ),
inference(resolution,[],[f787,f46]) ).
fof(f810,plain,
( $false
| ~ spl4_1
| spl4_15 ),
inference(forward_subsumption_resolution,[],[f809,f747]) ).
fof(f811,plain,
( ~ spl4_1
| spl4_15 ),
inference(avatar_contradiction_clause,[],[f810]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f69]) ).
cnf(s11,plain,
~ spl4_2,
inference(sat_conversion,[],[f739]) ).
cnf(s14,plain,
( ~ spl4_15
| ~ spl4_17 ),
inference(sat_conversion,[],[f763]) ).
cnf(s15,plain,
spl4_17,
inference(sat_conversion,[],[f777]) ).
cnf(s18,plain,
( ~ spl4_1
| spl4_15 ),
inference(sat_conversion,[],[f811]) ).
cnf(s19,plain,
~ spl4_15,
inference(rat,[],[s14,s15]) ).
cnf(s20,plain,
~ spl4_1,
inference(rat,[],[s18,s19]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s1,s11,s20]) ).
fof(f812,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV487+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.08/0.18 % Computer : n004.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 11:14:07 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 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
% 0.66/0.98 % (288365)Detected formulas, will run a generic FOF schedule.
% 0.66/0.98 % (288373)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=722715085:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.66/0.98 % (288373)First to succeed.
% 0.66/0.98 % (288373)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-288365"
% 0.66/0.98 % (288376)dis-21_1_sil=8000:lcm=predicate:random_seed=1886620128: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.66/0.98 % (288371)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=333527652:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.66/0.98 % (288372)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=1135592916:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.66/0.98 % (288370)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=537534095:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.66/0.98 % (288374)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4126310344:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.66/0.98 % (288375)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2077746305:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.66/0.98 % (288374)Also succeeded, but the first one will report.
% 0.66/0.98 % (288376)Instruction limit reached!
% 0.66/0.98 % (288376)------------------------------
% 0.66/0.98 % (288376)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.66/0.98 % (288376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.98 % (288376)CaDiCaL version: 2.1.3
% 0.66/0.98 % (288376)Termination reason: Instruction limit
% 0.66/0.98 % (288376)Termination phase: Saturation
% 0.66/0.98 % (288376)Time elapsed: 0.080 s
% 0.66/0.98 % (288376)Peak memory usage: 88 MB
% 0.66/0.98 % (288376)Instructions burned: 130 (million)
% 0.66/0.98 % (288375)Instruction limit reached!
% 0.66/0.98 % (288375)------------------------------
% 0.66/0.98 % (288375)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.66/0.98 % (288375)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.98 % (288375)CaDiCaL version: 2.1.3
% 0.66/0.98 % (288375)Termination reason: Instruction limit
% 0.66/0.98 % (288375)Termination phase: Saturation
% 0.66/0.98 % (288375)Time elapsed: 0.112 s
% 0.66/0.98 % (288375)Peak memory usage: 90 MB
% 0.66/0.98 % (288375)Instructions burned: 139 (million)
% 0.66/0.98 % (288373)Refutation found. Thanks to Tanya!
% 0.66/0.98 % SZS status Theorem for theBenchmark
% 0.66/0.98 % SZS output start Proof for theBenchmark
% See solution above
% 2.93/1.18 % (288373)------------------------------
% 2.93/1.18 % (288373)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.93/1.18 % (288373)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.93/1.18 % (288373)CaDiCaL version: 2.1.3
% 2.93/1.18 % (288373)Termination reason: Refutation
% 2.93/1.18 % (288373)Time elapsed: 0.027 s
% 2.93/1.18 % (288373)Peak memory usage: 90 MB
% 2.93/1.18 % (288373)Instructions burned: 96 (million)
% 2.93/1.18 % (288373)------------------------------
% 2.93/1.18 % (288373)------------------------------
% 2.93/1.18 % (288365)Success in time 0.323 s
% 2.93/1.18 % Vampire exiting
%------------------------------------------------------------------------------