%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR020+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 09:41:58 AM UTC 2026
% Result : Theorem 4.45s 1.36s
% Output : Refutation 5.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 21
% Syntax : Number of formulae : 96 ( 24 unt; 11 def)
% Number of atoms : 342 ( 126 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 381 ( 135 ~; 140 |; 86 &)
% ( 19 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 4 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 122 ( 0 sgn 122 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1,X2] :
( ( happens(X0,X1)
& terminates(X0,X2,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_terminates_not_holds) ).
fof(f14,axiom,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) )
| ( X0 = pull
& X1 = forwards
& happens(push,X2) )
| ( X0 = pull
& X1 = backwards
& happens(push,X2) )
| ( X0 = push
& X1 = spinning
& ~ happens(pull,X2) )
| ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',terminates_all_defn) ).
fof(f16,axiom,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| ( X0 = push
& X1 = n2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',push_not_pull) ).
fof(f25,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(f32,axiom,
! [X0,X1] :
( less_or_equal(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(f34,axiom,
! [X0] :
( less(X0,n1)
<=> less_or_equal(X0,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(f35,axiom,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(f43,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( ~ less(X1,X0)
& X1 != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(f48,conjecture,
~ holdsAt(spinning,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_spinning_2) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(spinning,n2),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(spinning,n2),
inference(flattening,[],[f49]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(flattening,[],[f70]) ).
fof(f74,definition,
! [X0,X1,X2] :
( sP0(X0,X1,X2)
<=> ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f75,definition,
! [X0,X1,X2] :
( sP1(X0,X1,X2)
<=> ( X0 = push
& X1 = spinning
& ~ happens(pull,X2) ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f76,definition,
! [X0,X1,X2] :
( sP2(X0,X1,X2)
<=> ( X0 = pull
& X1 = backwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f77,definition,
! [X0,X1,X2] :
( sP3(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP3])],[predicate_definition_introduction]) ).
fof(f78,definition,
! [X0,X1,X2] :
( sP4(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP4])],[predicate_definition_introduction]) ).
fof(f79,definition,
! [X0,X1,X2] :
( sP5(X0,X1,X2)
<=> ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| sP1(X0,X1,X2)
| sP0(X0,X1,X2) ) ),
introduced(definition,[new_symbols(definition,[sP5])],[predicate_definition_introduction]) ).
fof(f80,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP5(X0,X1,X2) ),
inference(definition_folding,[],[f14,f79,f78,f77,f76,f75,f74]) ).
fof(f84,definition,
! [X0,X1] :
( sP8(X0,X1)
<=> ( X0 = push
& X1 = n2 ) ),
introduced(definition,[new_symbols(definition,[sP8])],[predicate_definition_introduction]) ).
fof(f85,definition,
! [X0,X1] :
( sP9(X0,X1)
<=> ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| sP8(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[sP9])],[predicate_definition_introduction]) ).
fof(f86,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP9(X0,X1) ),
inference(definition_folding,[],[f16,f85,f84]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ~ sP0(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| sP1(X0,X1,X2)
| sP0(X0,X1,X2)
| ~ sP5(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f88,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ~ sP0(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| sP1(X0,X1,X2)
| sP0(X0,X1,X2)
| ~ sP5(X0,X1,X2) ) ),
inference(flattening,[],[f87]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| pull != X0
| spinning != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) )
| ~ sP0(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f74]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| pull != X0
| spinning != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) )
| ~ sP0(X0,X1,X2) ) ),
inference(flattening,[],[f97]) ).
fof(f99,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP5(X0,X1,X2) )
& ( sP5(X0,X1,X2)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f80]) ).
fof(f110,plain,
! [X0] :
( ( less(X0,n2)
| ~ less_or_equal(X0,n1) )
& ( less_or_equal(X0,n1)
| ~ less(X0,n2) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f111,plain,
! [X0,X1] :
( ( less(X0,X1)
| less(X1,X0)
| X0 = X1 )
& ( ( ~ less(X1,X0)
& X1 != X0 )
| ~ less(X0,X1) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f112,plain,
! [X0,X1] :
( ( less(X0,X1)
| less(X1,X0)
| X0 = X1 )
& ( ( ~ less(X1,X0)
& X1 != X0 )
| ~ less(X0,X1) ) ),
inference(flattening,[],[f111]) ).
fof(f113,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( push != X0
| n0 != X1 )
& ( pull != X0
| n1 != X1 )
& ( pull != X0
| n2 != X1 )
& ~ sP8(X0,X1) ) )
& ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(nnf_transformation,[],[f85]) ).
fof(f114,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( push != X0
| n0 != X1 )
& ( pull != X0
| n1 != X1 )
& ( pull != X0
| n2 != X1 )
& ~ sP8(X0,X1) ) )
& ( ( X0 = push
& X1 = n0 )
| ( X0 = pull
& X1 = n1 )
| ( X0 = pull
& X1 = n2 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(flattening,[],[f113]) ).
fof(f115,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f116,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(flattening,[],[f115]) ).
fof(f117,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X0,X1) )
& ( sP9(X0,X1)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f118,plain,
! [X0] :
( ( less(X0,n1)
| ~ less_or_equal(X0,n0) )
& ( less_or_equal(X0,n0)
| ~ less(X0,n1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f119,plain,
! [X0,X1] :
( ( less_or_equal(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ less_or_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f120,plain,
! [X0,X1] :
( ( less_or_equal(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ less_or_equal(X0,X1) ) ),
inference(flattening,[],[f119]) ).
fof(f125,plain,
holdsAt(spinning,n2),
inference(cnf_transformation,[],[f50]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f159,plain,
! [X2,X0,X1] :
( sP0(X0,X1,X2)
| pull != X0
| spinning != X1
| happens(push,X2) ),
inference(cnf_transformation,[],[f98]) ).
fof(f161,plain,
! [X2,X0,X1] :
( ~ sP5(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f189,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f110]) ).
fof(f190,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f192,plain,
! [X0,X1] :
( X0 != X1
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f196,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f199,plain,
! [X0,X1] :
( n0 = X1
| pull = X0
| n2 = X1
| sP8(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f207,plain,
! [X0,X1] :
( sP9(X0,X1)
| pull != X0
| n1 != X1 ),
inference(cnf_transformation,[],[f114]) ).
fof(f209,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| n2 = X1 ),
inference(cnf_transformation,[],[f116]) ).
fof(f212,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f213,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f214,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f218,plain,
! [X0] :
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f220,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f120]) ).
fof(f232,plain,
! [X2,X1] :
( sP0(pull,X1,X2)
| spinning != X1
| happens(push,X2) ),
inference(equality_resolution,[],[f159]) ).
fof(f233,plain,
! [X2] :
( sP0(pull,spinning,X2)
| happens(push,X2) ),
inference(equality_resolution,[],[f232]) ).
fof(f240,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f192]) ).
fof(f243,plain,
! [X1] :
( sP9(pull,X1)
| n1 != X1 ),
inference(equality_resolution,[],[f207]) ).
fof(f244,plain,
sP9(pull,n1),
inference(equality_resolution,[],[f243]) ).
fof(f249,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f220]) ).
fof(f253,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| pull = X0
| n2 = X1
| n0 = X1 ),
inference(forward_subsumption_resolution,[],[f199,f209]) ).
fof(f262,plain,
less(n1,n2),
inference(resolution,[],[f189,f249]) ).
fof(f270,plain,
happens(pull,n1),
inference(resolution,[],[f213,f244]) ).
fof(f274,plain,
less(n0,n1),
inference(resolution,[],[f218,f249]) ).
fof(f306,plain,
! [X0] :
( sP5(pull,spinning,X0)
| happens(push,X0) ),
inference(resolution,[],[f134,f233]) ).
fof(f314,plain,
! [X0] :
( terminates(pull,spinning,X0)
| happens(push,X0) ),
inference(resolution,[],[f161,f306]) ).
fof(f363,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n1)
| ~ happens(X1,n1)
| ~ holdsAt(X0,n2) ),
inference(superposition,[],[f214,f190]) ).
fof(f548,plain,
( ~ happens(pull,n1)
| ~ holdsAt(spinning,n2)
| happens(push,n1) ),
inference(resolution,[],[f363,f314]) ).
fof(f555,plain,
( ~ holdsAt(spinning,n2)
| happens(push,n1) ),
inference(forward_subsumption_resolution,[],[f548,f270]) ).
fof(f560,definition,
( spl14_5
<=> happens(push,n1) ),
introduced(definition,[new_symbols(definition,[spl14_5])],[avatar_definition]) ).
fof(f561,plain,
( happens(push,n1)
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f560]) ).
fof(f568,plain,
happens(push,n1),
inference(forward_subsumption_resolution,[],[f555,f125]) ).
fof(f570,plain,
spl14_5,
inference(avatar_split_clause,[],[f568,f560]) ).
fof(f584,plain,
( sP9(push,n1)
| ~ spl14_5 ),
inference(resolution,[],[f561,f212]) ).
fof(f597,plain,
( push = pull
| n1 = n2
| n0 = n1
| ~ spl14_5 ),
inference(resolution,[],[f584,f253]) ).
fof(f602,plain,
( n1 = n2
| n0 = n1
| ~ spl14_5 ),
inference(forward_subsumption_resolution,[],[f597,f196]) ).
fof(f605,definition,
( spl14_7
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl14_7])],[avatar_definition]) ).
fof(f607,plain,
( n0 = n1
| ~ spl14_7 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f609,definition,
( spl14_8
<=> n1 = n2 ),
introduced(definition,[new_symbols(definition,[spl14_8])],[avatar_definition]) ).
fof(f611,plain,
( n1 = n2
| ~ spl14_8 ),
inference(avatar_component_clause,[],[f609]) ).
fof(f612,plain,
( spl14_7
| spl14_8
| ~ spl14_5 ),
inference(avatar_split_clause,[],[f602,f560,f609,f605]) ).
fof(f635,plain,
( less(n0,n0)
| ~ spl14_7 ),
inference(superposition,[],[f274,f607]) ).
fof(f654,plain,
( $false
| ~ spl14_7 ),
inference(forward_subsumption_resolution,[],[f635,f240]) ).
fof(f655,plain,
~ spl14_7,
inference(avatar_contradiction_clause,[],[f654]) ).
fof(f669,plain,
( less(n1,n1)
| ~ spl14_8 ),
inference(superposition,[],[f262,f611]) ).
fof(f683,plain,
( $false
| ~ spl14_8 ),
inference(forward_subsumption_resolution,[],[f669,f240]) ).
fof(f684,plain,
~ spl14_8,
inference(avatar_contradiction_clause,[],[f683]) ).
cnf(s7,plain,
spl14_5,
inference(sat_conversion,[],[f570]) ).
cnf(s8,plain,
( ~ spl14_5
| spl14_7
| spl14_8 ),
inference(sat_conversion,[],[f612]) ).
cnf(s10,plain,
~ spl14_7,
inference(sat_conversion,[],[f655]) ).
cnf(s13,plain,
~ spl14_8,
inference(sat_conversion,[],[f684]) ).
cnf(s16,plain,
~ spl14_5,
inference(rat,[],[s8,s13,s10]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s7,s16]) ).
fof(f687,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR020+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n019.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 22:05:48 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running first-order theorem proving
% 0.08/0.23 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
% 4.45/1.36 % (326439)Detected formulas, will run a generic FOF schedule.
% 4.45/1.36 % (326574)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=731142682:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.45/1.36 % (326574)Refutation not found, incomplete strategy
% 4.45/1.36 % (326574)------------------------------
% 4.45/1.36 % (326574)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.36 % (326574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.36 % (326574)CaDiCaL version: 2.1.3
% 4.45/1.36 % (326574)Termination reason: Refutation not found, incomplete strategy
% 4.45/1.36 % (326574)Time elapsed: 0.003 s
% 4.45/1.36 % (326574)Peak memory usage: 88 MB
% 4.45/1.36 % (326574)Instructions burned: 6 (million)
% 4.45/1.36 % (326579)dis-21_1_sil=8000:lcm=predicate:random_seed=1292922764: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)
% 4.45/1.36 % (326573)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=81857910:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.45/1.36 % (326569)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=2851644102:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.45/1.36 % (326572)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=126217086:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.45/1.36 % (326576)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2774650347:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.45/1.36 % (326573)Refutation not found, incomplete strategy
% 4.45/1.36 % (326573)------------------------------
% 4.45/1.36 % (326573)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.36 % (326573)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.36 % (326573)CaDiCaL version: 2.1.3
% 4.45/1.36 % (326573)Termination reason: Refutation not found, incomplete strategy
% 4.45/1.36 % (326573)Time elapsed: 0.002 s
% 4.45/1.36 % (326573)Peak memory usage: 88 MB
% 4.45/1.36 % (326573)Instructions burned: 1 (million)
% 4.45/1.36 % (326570)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=2842147257:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.45/1.36 % (326579)Instruction limit reached!
% 4.45/1.36 % (326579)------------------------------
% 4.45/1.36 % (326579)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.36 % (326579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.36 % (326579)CaDiCaL version: 2.1.3
% 4.45/1.36 % (326579)Termination reason: Instruction limit
% 4.45/1.36 % (326579)Termination phase: Saturation
% 4.45/1.36 % (326579)Time elapsed: 0.071 s
% 4.45/1.36 % (326579)Peak memory usage: 88 MB
% 4.45/1.36 % (326579)Instructions burned: 130 (million)
% 4.45/1.36 % (326576)Instruction limit reached!
% 4.45/1.36 % (326576)------------------------------
% 4.45/1.36 % (326576)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.36 % (326576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.36 % (326576)CaDiCaL version: 2.1.3
% 4.45/1.36 % (326576)Termination reason: Instruction limit
% 4.45/1.36 % (326576)Termination phase: Saturation
% 4.45/1.36 % (326576)Time elapsed: 0.086 s
% 4.45/1.36 % (326576)Peak memory usage: 89 MB
% 4.45/1.36 % (326576)Instructions burned: 141 (million)
% 4.45/1.36 % (326574)------------------------------
% 4.45/1.36 % (326574)------------------------------
% 4.45/1.36 % (326588)lrs+10_1_sil=8000:sp=occurrence:random_seed=1219329323:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.45/1.36 % (326590)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1834620642:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.45/1.36 % (326589)lrs+10_1_sil=32000:urr=on:br=off:random_seed=849628403:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.45/1.36 % (326588)First to succeed.
% 4.45/1.36 % (326573)------------------------------
% 4.45/1.36 % (326573)------------------------------
% 4.45/1.36 % (326589)Refutation not found, incomplete strategy
% 4.45/1.36 % (326589)------------------------------
% 4.45/1.36 % (326589)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.36 % (326589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.36 % (326589)CaDiCaL version: 2.1.3
% 4.45/1.36 % (326589)Termination reason: Refutation not found, incomplete strategy
% 4.45/1.36 % (326589)Time elapsed: 0.001 s
% 4.45/1.36 % (326589)Peak memory usage: 88 MB
% 4.45/1.36 % (326589)Instructions burned: 1 (million)
% 4.45/1.36 % (326588)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-326439"
% 4.45/1.36 % (326590)Instruction limit reached!
% 4.45/1.36 % (326590)------------------------------
% 4.45/1.36 % (326590)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.36 % (326590)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.36 % (326590)CaDiCaL version: 2.1.3
% 4.45/1.36 % (326590)Termination reason: Instruction limit
% 4.45/1.36 % (326590)Termination phase: Saturation
% 4.45/1.36 % (326590)Time elapsed: 0.104 s
% 4.45/1.36 % (326590)Peak memory usage: 90 MB
% 4.45/1.36 % (326590)Instructions burned: 327 (million)
% 4.45/1.36 % (326594)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=3073482344:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 4.45/1.36 % (326594)Also succeeded, but the first one will report.
% 4.45/1.36 % (326595)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=524255345:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 4.45/1.36 % (326595)Refutation not found, incomplete strategy
% 4.45/1.36 % (326595)------------------------------
% 4.45/1.36 % (326595)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.45/1.36 % (326595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.45/1.36 % (326595)CaDiCaL version: 2.1.3
% 4.45/1.36 % (326595)Termination reason: Refutation not found, incomplete strategy
% 4.45/1.36 % (326595)Time elapsed: 0.002 s
% 4.45/1.36 % (326595)Peak memory usage: 89 MB
% 4.45/1.36 % (326595)Instructions burned: 5 (million)
% 4.45/1.36 % (326589)------------------------------
% 4.45/1.36 % (326589)------------------------------
% 4.45/1.36 % (326588)Refutation found. Thanks to Tanya!
% 4.45/1.36 % SZS status Theorem for theBenchmark
% 4.45/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 5.44/1.65 % (326588)------------------------------
% 5.44/1.65 % (326588)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.65 % (326588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.65 % (326588)CaDiCaL version: 2.1.3
% 5.44/1.65 % (326588)Termination reason: Refutation
% 5.44/1.65 % (326588)Time elapsed: 0.013 s
% 5.44/1.65 % (326588)Peak memory usage: 90 MB
% 5.44/1.65 % (326588)Instructions burned: 18 (million)
% 5.44/1.65 % (326588)------------------------------
% 5.44/1.65 % (326588)------------------------------
% 5.44/1.65 % (326439)Success in time 0.67 s
% 5.44/1.65 % Vampire exiting
%------------------------------------------------------------------------------