%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR018+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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.52s 1.32s
% Output : Refutation 5.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of formulae : 113 ( 26 unt; 8 def)
% Number of atoms : 362 ( 134 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 399 ( 150 ~; 161 |; 72 &)
% ( 15 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 5 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 116 ( 0 sgn 116 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( ( happens(X0,X1)
& initiates(X0,X2,X1) )
=> holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_holds) ).
fof(f13,axiom,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| ( X0 = pull
& X1 = backwards
& ~ happens(push,X2) )
| ( X0 = pull
& X1 = spinning
& happens(push,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initiates_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/sandbox/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',push_not_pull) ).
fof(f21,axiom,
plus(n0,n0) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_0) ).
fof(f25,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1) ).
fof(f32,axiom,
! [X0,X1] :
( less_or_equal(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).
fof(f35,axiom,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).
fof(f43,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( ~ less(X1,X0)
& X1 != X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).
fof(f46,axiom,
~ holdsAt(spinning,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_splinning_0) ).
fof(f48,conjecture,
holdsAt(backwards,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',backwards_2) ).
fof(f49,negated_conjecture,
~ holdsAt(backwards,n2),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
~ holdsAt(backwards,n2),
inference(flattening,[],[f49]) ).
fof(f72,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ initiates(X0,X2,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f73,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ initiates(X0,X2,X1) ),
inference(flattening,[],[f72]) ).
fof(f81,definition,
! [X0,X1,X2] :
( sP6(X0,X1,X2)
<=> ( X0 = pull
& X1 = spinning
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP6])],[predicate_definition_introduction]) ).
fof(f82,definition,
! [X0,X1,X2] :
( sP7(X0,X1,X2)
<=> ( X0 = pull
& X1 = backwards
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP7])],[predicate_definition_introduction]) ).
fof(f83,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| sP7(X0,X1,X2)
| sP6(X0,X1,X2) ) ),
inference(definition_folding,[],[f13,f82,f81]) ).
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(f100,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| pull != X0
| backwards != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = backwards
& ~ happens(push,X2) )
| ~ sP7(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f82]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| pull != X0
| backwards != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = backwards
& ~ happens(push,X2) )
| ~ sP7(X0,X1,X2) ) ),
inference(flattening,[],[f100]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ( sP6(X0,X1,X2)
| pull != X0
| spinning != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = spinning
& happens(push,X2) )
| ~ sP6(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f81]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ( sP6(X0,X1,X2)
| pull != X0
| spinning != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = spinning
& happens(push,X2) )
| ~ sP6(X0,X1,X2) ) ),
inference(flattening,[],[f102]) ).
fof(f104,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( push != X0
| forwards != X1
| happens(pull,X2) )
& ~ sP7(X0,X1,X2)
& ~ sP6(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| sP7(X0,X1,X2)
| sP6(X0,X1,X2)
| ~ initiates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f105,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( push != X0
| forwards != X1
| happens(pull,X2) )
& ~ sP7(X0,X1,X2)
& ~ sP6(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| sP7(X0,X1,X2)
| sP6(X0,X1,X2)
| ~ initiates(X0,X1,X2) ) ),
inference(flattening,[],[f104]) ).
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(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(f123,plain,
~ holdsAt(spinning,n0),
inference(cnf_transformation,[],[f46]) ).
fof(f125,plain,
~ holdsAt(backwards,n2),
inference(cnf_transformation,[],[f50]) ).
fof(f128,plain,
n0 = plus(n0,n0),
inference(cnf_transformation,[],[f21]) ).
fof(f165,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| pull != X0
| backwards != X1
| happens(push,X2) ),
inference(cnf_transformation,[],[f101]) ).
fof(f169,plain,
! [X2,X0,X1] :
( sP6(X0,X1,X2)
| pull != X0
| spinning != X1
| ~ happens(push,X2) ),
inference(cnf_transformation,[],[f103]) ).
fof(f173,plain,
! [X2,X0,X1] :
( ~ sP6(X0,X1,X2)
| initiates(X0,X1,X2) ),
inference(cnf_transformation,[],[f105]) ).
fof(f174,plain,
! [X2,X0,X1] :
( ~ sP7(X0,X1,X2)
| initiates(X0,X1,X2) ),
inference(cnf_transformation,[],[f105]) ).
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(f215,plain,
! [X2,X0,X1] :
( ~ initiates(X0,X2,X1)
| ~ happens(X0,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f73]) ).
fof(f220,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f120]) ).
fof(f234,plain,
! [X2,X1] :
( sP7(pull,X1,X2)
| backwards != X1
| happens(push,X2) ),
inference(equality_resolution,[],[f165]) ).
fof(f235,plain,
! [X2] :
( sP7(pull,backwards,X2)
| happens(push,X2) ),
inference(equality_resolution,[],[f234]) ).
fof(f236,plain,
! [X2,X1] :
( sP6(pull,X1,X2)
| spinning != X1
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f169]) ).
fof(f237,plain,
! [X2] :
( sP6(pull,spinning,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f236]) ).
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(f318,plain,
! [X0] :
( initiates(pull,spinning,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f173,f237]) ).
fof(f320,plain,
! [X0] :
( initiates(pull,backwards,X0)
| happens(push,X0) ),
inference(resolution,[],[f174,f235]) ).
fof(f368,plain,
! [X0] :
( holdsAt(spinning,plus(X0,n1))
| ~ happens(pull,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f215,f318]) ).
fof(f369,plain,
! [X0] :
( holdsAt(backwards,plus(X0,n1))
| ~ happens(pull,X0)
| happens(push,X0) ),
inference(resolution,[],[f215,f320]) ).
fof(f559,definition,
( spl14_5
<=> happens(push,n1) ),
introduced(definition,[new_symbols(definition,[spl14_5])],[avatar_definition]) ).
fof(f560,plain,
( ~ happens(push,n1)
| spl14_5 ),
inference(avatar_component_clause,[],[f559]) ).
fof(f561,plain,
( happens(push,n1)
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f559]) ).
fof(f631,definition,
( spl14_7
<=> n0 = n2 ),
introduced(definition,[new_symbols(definition,[spl14_7])],[avatar_definition]) ).
fof(f633,plain,
( n0 = n2
| ~ spl14_7 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f635,definition,
( spl14_8
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl14_8])],[avatar_definition]) ).
fof(f636,plain,
( n0 != n1
| spl14_8 ),
inference(avatar_component_clause,[],[f635]) ).
fof(f637,plain,
( n0 = n1
| ~ spl14_8 ),
inference(avatar_component_clause,[],[f635]) ).
fof(f670,definition,
( spl14_9
<=> n1 = n2 ),
introduced(definition,[new_symbols(definition,[spl14_9])],[avatar_definition]) ).
fof(f671,plain,
( n1 != n2
| spl14_9 ),
inference(avatar_component_clause,[],[f670]) ).
fof(f672,plain,
( n1 = n2
| ~ spl14_9 ),
inference(avatar_component_clause,[],[f670]) ).
fof(f699,plain,
( n2 = plus(n0,n0)
| ~ spl14_8 ),
inference(superposition,[],[f190,f637]) ).
fof(f737,plain,
( n0 = n2
| ~ spl14_8 ),
inference(forward_demodulation,[],[f699,f128]) ).
fof(f739,plain,
( spl14_7
| ~ spl14_8 ),
inference(avatar_split_clause,[],[f737,f635,f631]) ).
fof(f752,plain,
( less(n1,n1)
| ~ spl14_9 ),
inference(superposition,[],[f262,f672]) ).
fof(f768,plain,
( $false
| ~ spl14_9 ),
inference(forward_subsumption_resolution,[],[f752,f240]) ).
fof(f769,plain,
~ spl14_9,
inference(avatar_contradiction_clause,[],[f768]) ).
fof(f821,plain,
( holdsAt(spinning,n2)
| ~ happens(pull,n1)
| ~ happens(push,n1) ),
inference(superposition,[],[f368,f190]) ).
fof(f845,plain,
( holdsAt(backwards,n2)
| ~ happens(pull,n1)
| happens(push,n1) ),
inference(superposition,[],[f369,f190]) ).
fof(f848,plain,
( ~ happens(pull,n1)
| happens(push,n1) ),
inference(forward_subsumption_resolution,[],[f845,f125]) ).
fof(f852,plain,
happens(push,n1),
inference(forward_subsumption_resolution,[],[f848,f270]) ).
fof(f855,plain,
( $false
| spl14_5 ),
inference(forward_subsumption_resolution,[],[f852,f560]) ).
fof(f856,plain,
spl14_5,
inference(avatar_contradiction_clause,[],[f855]) ).
fof(f859,plain,
( holdsAt(spinning,n2)
| ~ happens(push,n1) ),
inference(forward_subsumption_resolution,[],[f821,f270]) ).
fof(f862,plain,
( holdsAt(spinning,n2)
| ~ spl14_5 ),
inference(forward_subsumption_resolution,[],[f859,f561]) ).
fof(f863,plain,
( holdsAt(spinning,n0)
| ~ spl14_5
| ~ spl14_7 ),
inference(forward_demodulation,[],[f862,f633]) ).
fof(f864,plain,
( $false
| ~ spl14_5
| ~ spl14_7 ),
inference(forward_subsumption_resolution,[],[f863,f123]) ).
fof(f865,plain,
( ~ spl14_5
| ~ spl14_7 ),
inference(avatar_contradiction_clause,[],[f864]) ).
fof(f866,plain,
( sP9(push,n1)
| ~ spl14_5 ),
inference(resolution,[],[f561,f212]) ).
fof(f898,plain,
( push = pull
| n1 = n2
| n0 = n1
| ~ spl14_5 ),
inference(resolution,[],[f866,f253]) ).
fof(f903,plain,
( n1 = n2
| n0 = n1
| ~ spl14_5 ),
inference(forward_subsumption_resolution,[],[f898,f196]) ).
fof(f905,plain,
( n0 = n1
| ~ spl14_5
| spl14_9 ),
inference(forward_subsumption_resolution,[],[f903,f671]) ).
fof(f907,plain,
( $false
| ~ spl14_5
| spl14_8
| spl14_9 ),
inference(forward_subsumption_resolution,[],[f905,f636]) ).
fof(f908,plain,
( ~ spl14_5
| spl14_8
| spl14_9 ),
inference(avatar_contradiction_clause,[],[f907]) ).
cnf(s14,plain,
( spl14_7
| ~ spl14_8 ),
inference(sat_conversion,[],[f739]) ).
cnf(s17,plain,
~ spl14_9,
inference(sat_conversion,[],[f769]) ).
cnf(s23,plain,
spl14_5,
inference(sat_conversion,[],[f856]) ).
cnf(s25,plain,
( ~ spl14_5
| ~ spl14_7 ),
inference(sat_conversion,[],[f865]) ).
cnf(s26,plain,
( ~ spl14_5
| spl14_8
| spl14_9 ),
inference(sat_conversion,[],[f908]) ).
cnf(s27,plain,
~ spl14_7,
inference(rat,[],[s25,s23]) ).
cnf(s33,plain,
spl14_8,
inference(rat,[],[s26,s23,s17]) ).
cnf(s34,plain,
$false,
inference(rat,[],[s14,s33,s27]) ).
fof(f909,plain,
$false,
inference(avatar_sat_refutation,[],[s34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR018+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n026.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 22:08:27 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.23 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
% 4.52/1.32 % (139589)Detected formulas, will run a generic FOF schedule.
% 4.52/1.32 % (139598)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1240340501:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.52/1.32 % (139598)Refutation not found, incomplete strategy
% 4.52/1.32 % (139598)------------------------------
% 4.52/1.32 % (139598)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.32 % (139598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.32 % (139598)CaDiCaL version: 2.1.3
% 4.52/1.32 % (139598)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.32 % (139598)Time elapsed: 0.003 s
% 4.52/1.32 % (139598)Peak memory usage: 88 MB
% 4.52/1.32 % (139598)Instructions burned: 6 (million)
% 4.52/1.32 % (139595)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=2000871645:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.52/1.32 % (139594)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=2442937091:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.52/1.32 % (139597)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2661074180:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.52/1.32 % (139596)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=2923191973:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.52/1.32 % (139597)Refutation not found, incomplete strategy
% 4.52/1.32 % (139597)------------------------------
% 4.52/1.32 % (139597)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.32 % (139597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.32 % (139597)CaDiCaL version: 2.1.3
% 4.52/1.32 % (139597)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.32 % (139597)Time elapsed: 0.001 s
% 4.52/1.32 % (139597)Peak memory usage: 88 MB
% 4.52/1.32 % (139597)Instructions burned: 1 (million)
% 4.52/1.32 % (139599)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4147657848:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.52/1.32 % (139600)dis-21_1_sil=8000:lcm=predicate:random_seed=78283130: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.52/1.32 % (139600)Instruction limit reached!
% 4.52/1.32 % (139600)------------------------------
% 4.52/1.32 % (139600)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.32 % (139600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.32 % (139600)CaDiCaL version: 2.1.3
% 4.52/1.32 % (139600)Termination reason: Instruction limit
% 4.52/1.32 % (139600)Termination phase: Saturation
% 4.52/1.32 % (139600)Time elapsed: 0.071 s
% 4.52/1.32 % (139600)Peak memory usage: 88 MB
% 4.52/1.32 % (139600)Instructions burned: 129 (million)
% 4.52/1.32 % (139599)Instruction limit reached!
% 4.52/1.32 % (139599)------------------------------
% 4.52/1.32 % (139599)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.32 % (139599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.32 % (139599)CaDiCaL version: 2.1.3
% 4.52/1.32 % (139599)Termination reason: Instruction limit
% 4.52/1.32 % (139599)Termination phase: Saturation
% 4.52/1.32 % (139599)Time elapsed: 0.087 s
% 4.52/1.32 % (139599)Peak memory usage: 89 MB
% 4.52/1.32 % (139599)Instructions burned: 140 (million)
% 4.52/1.32 % (139598)------------------------------
% 4.52/1.32 % (139598)------------------------------
% 4.52/1.32 % (139609)lrs+10_1_sil=32000:urr=on:br=off:random_seed=765683384:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.52/1.32 % (139608)lrs+10_1_sil=8000:sp=occurrence:random_seed=40920543:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.52/1.32 % (139610)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3379740060:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.52/1.32 % (139609)Refutation not found, incomplete strategy
% 4.52/1.32 % (139609)------------------------------
% 4.52/1.32 % (139609)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.32 % (139609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.32 % (139609)CaDiCaL version: 2.1.3
% 4.52/1.32 % (139609)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.32 % (139609)Time elapsed: 0.001 s
% 4.52/1.32 % (139609)Peak memory usage: 88 MB
% 4.52/1.32 % (139609)Instructions burned: 1 (million)
% 4.52/1.32 % (139608)First to succeed.
% 4.52/1.32 % (139608)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-139589"
% 4.52/1.32 % (139597)------------------------------
% 4.52/1.32 % (139597)------------------------------
% 4.52/1.32 % (139610)Instruction limit reached!
% 4.52/1.32 % (139610)------------------------------
% 4.52/1.32 % (139610)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.32 % (139610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.32 % (139610)CaDiCaL version: 2.1.3
% 4.52/1.32 % (139610)Termination reason: Instruction limit
% 4.52/1.32 % (139610)Termination phase: Saturation
% 4.52/1.32 % (139610)Time elapsed: 0.102 s
% 4.52/1.32 % (139610)Peak memory usage: 90 MB
% 4.52/1.32 % (139610)Instructions burned: 328 (million)
% 4.52/1.32 % (139614)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=3624590662:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 4.52/1.32 % (139615)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3912119981:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.52/1.32 % (139615)Refutation not found, incomplete strategy
% 4.52/1.32 % (139615)------------------------------
% 4.52/1.32 % (139615)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.52/1.32 % (139615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.52/1.32 % (139615)CaDiCaL version: 2.1.3
% 4.52/1.32 % (139615)Termination reason: Refutation not found, incomplete strategy
% 4.52/1.32 % (139615)Time elapsed: 0.002 s
% 4.52/1.32 % (139615)Peak memory usage: 89 MB
% 4.52/1.32 % (139615)Instructions burned: 5 (million)
% 4.52/1.32 % (139609)------------------------------
% 4.52/1.32 % (139609)------------------------------
% 4.52/1.32 % (139608)Refutation found. Thanks to Tanya!
% 4.52/1.32 % SZS status Theorem for theBenchmark
% 4.52/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 5.26/1.51 % (139608)------------------------------
% 5.26/1.51 % (139608)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.26/1.51 % (139608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.26/1.51 % (139608)CaDiCaL version: 2.1.3
% 5.26/1.51 % (139608)Termination reason: Refutation
% 5.26/1.51 % (139608)Time elapsed: 0.018 s
% 5.26/1.51 % (139608)Peak memory usage: 89 MB
% 5.26/1.51 % (139608)Instructions burned: 26 (million)
% 5.26/1.51 % (139608)------------------------------
% 5.26/1.51 % (139608)------------------------------
% 5.26/1.51 % (139589)Success in time 0.651 s
% 5.26/1.51 % Vampire exiting
%------------------------------------------------------------------------------