%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR016+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 : 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 09:41:58 AM UTC 2026
% Result : Theorem 2.94s 1.30s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 18
% Syntax : Number of formulae : 111 ( 27 unt; 8 def)
% Number of atoms : 343 ( 126 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 370 ( 138 ~; 157 |; 62 &)
% ( 12 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 5 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 105 ( 0 sgn 105 !; 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(f22,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).
fof(f25,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1) ).
fof(f45,axiom,
~ holdsAt(backwards,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_0) ).
fof(f46,axiom,
~ holdsAt(spinning,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_splinning_0) ).
fof(f48,conjecture,
holdsAt(forwards,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forwards_1) ).
fof(f49,negated_conjecture,
~ holdsAt(forwards,n1),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
~ holdsAt(forwards,n1),
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(f112,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(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(flattening,[],[f112]) ).
fof(f114,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f115,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(flattening,[],[f114]) ).
fof(f116,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X0,X1) )
& ( sP9(X0,X1)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f120,plain,
~ holdsAt(backwards,n0),
inference(cnf_transformation,[],[f45]) ).
fof(f121,plain,
~ holdsAt(spinning,n0),
inference(cnf_transformation,[],[f46]) ).
fof(f123,plain,
~ holdsAt(forwards,n1),
inference(cnf_transformation,[],[f50]) ).
fof(f125,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f126,plain,
n0 = plus(n0,n0),
inference(cnf_transformation,[],[f21]) ).
fof(f163,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| pull != X0
| backwards != X1
| happens(push,X2) ),
inference(cnf_transformation,[],[f101]) ).
fof(f167,plain,
! [X2,X0,X1] :
( sP6(X0,X1,X2)
| pull != X0
| spinning != X1
| ~ happens(push,X2) ),
inference(cnf_transformation,[],[f103]) ).
fof(f171,plain,
! [X2,X0,X1] :
( ~ sP6(X0,X1,X2)
| initiates(X0,X1,X2) ),
inference(cnf_transformation,[],[f105]) ).
fof(f172,plain,
! [X2,X0,X1] :
( ~ sP7(X0,X1,X2)
| initiates(X0,X1,X2) ),
inference(cnf_transformation,[],[f105]) ).
fof(f173,plain,
! [X2,X0,X1] :
( initiates(X0,X1,X2)
| push != X0
| forwards != X1
| happens(pull,X2) ),
inference(cnf_transformation,[],[f105]) ).
fof(f190,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f195,plain,
! [X0,X1] :
( push = X0
| n1 = X1
| n2 = X1
| sP8(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f113]) ).
fof(f201,plain,
! [X0,X1] :
( sP9(X0,X1)
| pull != X0
| n1 != X1 ),
inference(cnf_transformation,[],[f113]) ).
fof(f202,plain,
! [X0,X1] :
( sP9(X0,X1)
| push != X0
| n0 != X1 ),
inference(cnf_transformation,[],[f113]) ).
fof(f204,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| push = X0 ),
inference(cnf_transformation,[],[f115]) ).
fof(f206,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f207,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f209,plain,
! [X2,X0,X1] :
( ~ initiates(X0,X2,X1)
| ~ happens(X0,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f73]) ).
fof(f218,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f232,plain,
! [X2,X1] :
( sP7(pull,X1,X2)
| backwards != X1
| happens(push,X2) ),
inference(equality_resolution,[],[f163]) ).
fof(f233,plain,
! [X2] :
( sP7(pull,backwards,X2)
| happens(push,X2) ),
inference(equality_resolution,[],[f232]) ).
fof(f234,plain,
! [X2,X1] :
( sP6(pull,X1,X2)
| spinning != X1
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f167]) ).
fof(f235,plain,
! [X2] :
( sP6(pull,spinning,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f234]) ).
fof(f236,plain,
! [X2,X1] :
( initiates(push,X1,X2)
| forwards != X1
| happens(pull,X2) ),
inference(equality_resolution,[],[f173]) ).
fof(f237,plain,
! [X2] :
( initiates(push,forwards,X2)
| happens(pull,X2) ),
inference(equality_resolution,[],[f236]) ).
fof(f239,plain,
! [X1] :
( sP9(push,X1)
| n0 != X1 ),
inference(equality_resolution,[],[f202]) ).
fof(f240,plain,
sP9(push,n0),
inference(equality_resolution,[],[f239]) ).
fof(f241,plain,
! [X1] :
( sP9(pull,X1)
| n1 != X1 ),
inference(equality_resolution,[],[f201]) ).
fof(f242,plain,
sP9(pull,n1),
inference(equality_resolution,[],[f241]) ).
fof(f251,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| n1 = X1
| n2 = X1
| push = X0 ),
inference(forward_subsumption_resolution,[],[f195,f204]) ).
fof(f262,plain,
happens(push,n0),
inference(resolution,[],[f207,f240]) ).
fof(f264,plain,
happens(pull,n1),
inference(resolution,[],[f207,f242]) ).
fof(f303,plain,
! [X0] :
( initiates(pull,spinning,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f171,f235]) ).
fof(f305,plain,
! [X0] :
( initiates(pull,backwards,X0)
| happens(push,X0) ),
inference(resolution,[],[f172,f233]) ).
fof(f335,definition,
( spl14_4
<=> n0 = n2 ),
introduced(definition,[new_symbols(definition,[spl14_4])],[avatar_definition]) ).
fof(f336,plain,
( n0 != n2
| spl14_4 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f337,plain,
( n0 = n2
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f362,plain,
! [X0] :
( holdsAt(forwards,plus(X0,n1))
| ~ happens(push,X0)
| happens(pull,X0) ),
inference(resolution,[],[f209,f237]) ).
fof(f363,plain,
! [X0] :
( holdsAt(spinning,plus(X0,n1))
| ~ happens(pull,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f303,f209]) ).
fof(f368,plain,
! [X0] :
( holdsAt(backwards,plus(X0,n1))
| ~ happens(pull,X0)
| happens(push,X0) ),
inference(resolution,[],[f305,f209]) ).
fof(f418,definition,
( spl14_5
<=> happens(pull,n0) ),
introduced(definition,[new_symbols(definition,[spl14_5])],[avatar_definition]) ).
fof(f420,plain,
( happens(pull,n0)
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f418]) ).
fof(f452,definition,
( spl14_8
<=> happens(push,n1) ),
introduced(definition,[new_symbols(definition,[spl14_8])],[avatar_definition]) ).
fof(f453,plain,
( happens(push,n1)
| ~ spl14_8 ),
inference(avatar_component_clause,[],[f452]) ).
fof(f454,plain,
( ~ happens(push,n1)
| spl14_8 ),
inference(avatar_component_clause,[],[f452]) ).
fof(f533,plain,
( holdsAt(forwards,n1)
| ~ happens(push,n0)
| happens(pull,n0) ),
inference(superposition,[],[f362,f125]) ).
fof(f535,plain,
( ~ happens(push,n0)
| happens(pull,n0) ),
inference(forward_subsumption_resolution,[],[f533,f123]) ).
fof(f537,plain,
happens(pull,n0),
inference(forward_subsumption_resolution,[],[f535,f262]) ).
fof(f538,plain,
spl14_5,
inference(avatar_split_clause,[],[f537,f418]) ).
fof(f546,plain,
( sP9(pull,n0)
| ~ spl14_5 ),
inference(resolution,[],[f420,f206]) ).
fof(f558,plain,
( n0 = n1
| n0 = n2
| push = pull
| ~ spl14_5 ),
inference(resolution,[],[f546,f251]) ).
fof(f562,plain,
( n0 = n1
| n0 = n2
| ~ spl14_5 ),
inference(forward_subsumption_resolution,[],[f558,f190]) ).
fof(f564,definition,
( spl14_11
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl14_11])],[avatar_definition]) ).
fof(f566,plain,
( n0 = n1
| ~ spl14_11 ),
inference(avatar_component_clause,[],[f564]) ).
fof(f567,plain,
( spl14_4
| spl14_11
| ~ spl14_5 ),
inference(avatar_split_clause,[],[f562,f418,f564,f335]) ).
fof(f637,plain,
( n2 = plus(n0,n0)
| ~ spl14_11 ),
inference(superposition,[],[f218,f566]) ).
fof(f655,plain,
( n0 = n2
| ~ spl14_11 ),
inference(forward_demodulation,[],[f637,f126]) ).
fof(f658,plain,
( $false
| spl14_4
| ~ spl14_11 ),
inference(forward_subsumption_resolution,[],[f655,f336]) ).
fof(f659,plain,
( spl14_4
| ~ spl14_11 ),
inference(avatar_contradiction_clause,[],[f658]) ).
fof(f832,plain,
( holdsAt(spinning,n2)
| ~ happens(pull,n1)
| ~ happens(push,n1) ),
inference(superposition,[],[f363,f218]) ).
fof(f845,plain,
( holdsAt(backwards,n2)
| ~ happens(pull,n1)
| happens(push,n1) ),
inference(superposition,[],[f368,f218]) ).
fof(f846,plain,
( holdsAt(backwards,n2)
| happens(push,n1) ),
inference(forward_subsumption_resolution,[],[f845,f264]) ).
fof(f850,plain,
( holdsAt(backwards,n2)
| spl14_8 ),
inference(forward_subsumption_resolution,[],[f846,f454]) ).
fof(f853,plain,
( holdsAt(backwards,n0)
| ~ spl14_4
| spl14_8 ),
inference(forward_demodulation,[],[f850,f337]) ).
fof(f855,plain,
( $false
| ~ spl14_4
| spl14_8 ),
inference(forward_subsumption_resolution,[],[f853,f120]) ).
fof(f856,plain,
( ~ spl14_4
| spl14_8 ),
inference(avatar_contradiction_clause,[],[f855]) ).
fof(f890,plain,
( holdsAt(spinning,n2)
| ~ happens(push,n1) ),
inference(forward_subsumption_resolution,[],[f832,f264]) ).
fof(f894,plain,
( holdsAt(spinning,n2)
| ~ spl14_8 ),
inference(forward_subsumption_resolution,[],[f890,f453]) ).
fof(f895,plain,
( holdsAt(spinning,n0)
| ~ spl14_4
| ~ spl14_8 ),
inference(forward_demodulation,[],[f894,f337]) ).
fof(f896,plain,
( $false
| ~ spl14_4
| ~ spl14_8 ),
inference(forward_subsumption_resolution,[],[f895,f121]) ).
fof(f897,plain,
( ~ spl14_4
| ~ spl14_8 ),
inference(avatar_contradiction_clause,[],[f896]) ).
cnf(s8,plain,
spl14_5,
inference(sat_conversion,[],[f538]) ).
cnf(s9,plain,
( spl14_4
| ~ spl14_5
| spl14_11 ),
inference(sat_conversion,[],[f567]) ).
cnf(s12,plain,
( spl14_4
| ~ spl14_11 ),
inference(sat_conversion,[],[f659]) ).
cnf(s16,plain,
( ~ spl14_4
| spl14_8 ),
inference(sat_conversion,[],[f856]) ).
cnf(s26,plain,
( ~ spl14_4
| ~ spl14_8 ),
inference(sat_conversion,[],[f897]) ).
cnf(s29,plain,
~ spl14_4,
inference(rat,[],[s16,s26]) ).
cnf(s30,plain,
~ spl14_11,
inference(rat,[],[s12,s29]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s9,s8,s30,s29]) ).
fof(f898,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR016+1 : TPTP v9.3.1. Bugfixed v3.1.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 22:05:37 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
% 2.94/1.30 % (842169)Detected formulas, will run a generic FOF schedule.
% 2.94/1.30 % (842177)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3680304630:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.94/1.30 % (842177)Refutation not found, incomplete strategy
% 2.94/1.30 % (842177)------------------------------
% 2.94/1.30 % (842177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.30 % (842177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.30 % (842177)CaDiCaL version: 2.1.3
% 2.94/1.30 % (842177)Termination reason: Refutation not found, incomplete strategy
% 2.94/1.30 % (842177)Time elapsed: 0.001 s
% 2.94/1.30 % (842177)Peak memory usage: 88 MB
% 2.94/1.30 % (842174)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=3486157058:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.94/1.30 % (842175)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=4217005833:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.94/1.30 % (842178)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3495566605:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.94/1.30 % (842180)dis-21_1_sil=8000:lcm=predicate:random_seed=3725204433: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)
% 2.94/1.30 % (842179)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3990881984:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.94/1.30 % (842176)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=3312484991:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.94/1.30 % (842178)Refutation not found, incomplete strategy
% 2.94/1.30 % (842178)------------------------------
% 2.94/1.30 % (842178)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.30 % (842178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.30 % (842178)CaDiCaL version: 2.1.3
% 2.94/1.30 % (842178)Termination reason: Refutation not found, incomplete strategy
% 2.94/1.30 % (842178)Time elapsed: 0.003 s
% 2.94/1.30 % (842178)Peak memory usage: 88 MB
% 2.94/1.30 % (842178)Instructions burned: 3 (million)
% 2.94/1.30 % (842180)Instruction limit reached!
% 2.94/1.30 % (842180)------------------------------
% 2.94/1.30 % (842180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.30 % (842180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.30 % (842180)CaDiCaL version: 2.1.3
% 2.94/1.30 % (842180)Termination reason: Instruction limit
% 2.94/1.30 % (842180)Termination phase: Saturation
% 2.94/1.30 % (842180)Time elapsed: 0.070 s
% 2.94/1.30 % (842180)Peak memory usage: 88 MB
% 2.94/1.30 % (842180)Instructions burned: 130 (million)
% 2.94/1.30 % (842179)Instruction limit reached!
% 2.94/1.30 % (842179)------------------------------
% 2.94/1.30 % (842179)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.30 % (842179)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.30 % (842179)CaDiCaL version: 2.1.3
% 2.94/1.30 % (842179)Termination reason: Instruction limit
% 2.94/1.30 % (842179)Termination phase: Saturation
% 2.94/1.30 % (842179)Time elapsed: 0.085 s
% 2.94/1.30 % (842179)Peak memory usage: 89 MB
% 2.94/1.30 % (842179)Instructions burned: 139 (million)
% 2.94/1.30 % (842177)------------------------------
% 2.94/1.30 % (842177)------------------------------
% 2.94/1.30 % (842188)lrs+10_1_sil=8000:sp=occurrence:random_seed=1956438154:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.94/1.30 % (842190)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2136571740:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.94/1.30 % (842189)lrs+10_1_sil=32000:urr=on:br=off:random_seed=980443911:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.94/1.30 % (842189)Refutation not found, incomplete strategy
% 2.94/1.30 % (842189)------------------------------
% 2.94/1.30 % (842189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.30 % (842189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.30 % (842189)CaDiCaL version: 2.1.3
% 2.94/1.30 % (842189)Termination reason: Refutation not found, incomplete strategy
% 2.94/1.30 % (842189)Time elapsed: 0.001 s
% 2.94/1.30 % (842189)Peak memory usage: 88 MB
% 2.94/1.30 % (842188)First to succeed.
% 2.94/1.30 % (842188)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-842169"
% 2.94/1.30 % (842178)------------------------------
% 2.94/1.30 % (842178)------------------------------
% 2.94/1.30 % (842190)Refutation not found, incomplete strategy
% 2.94/1.30 % (842190)------------------------------
% 2.94/1.30 % (842190)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.94/1.30 % (842190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.94/1.30 % (842190)CaDiCaL version: 2.1.3
% 2.94/1.30 % (842190)Termination reason: Refutation not found, incomplete strategy
% 2.94/1.30 % (842190)Time elapsed: 0.090 s
% 2.94/1.30 % (842190)Peak memory usage: 90 MB
% 2.94/1.30 % (842190)Instructions burned: 281 (million)
% 2.94/1.30 % (842194)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=2276329962:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 2.94/1.30 % (842190)------------------------------
% 2.94/1.30 % (842190)------------------------------
% 2.94/1.30 % (842189)------------------------------
% 2.94/1.30 % (842189)------------------------------
% 2.94/1.30 % (842188)Refutation found. Thanks to Tanya!
% 2.94/1.30 % SZS status Theorem for theBenchmark
% 2.94/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.51 % (842188)------------------------------
% 0.18/1.51 % (842188)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.51 % (842188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.51 % (842188)CaDiCaL version: 2.1.3
% 0.18/1.51 % (842188)Termination reason: Refutation
% 0.18/1.51 % (842188)Time elapsed: 0.019 s
% 0.18/1.51 % (842188)Peak memory usage: 90 MB
% 0.18/1.51 % (842188)Instructions burned: 25 (million)
% 0.18/1.51 % (842188)------------------------------
% 0.18/1.51 % (842188)------------------------------
% 0.18/1.51 % (842169)Success in time 0.657 s
% 0.18/1.51 % Vampire exiting
%------------------------------------------------------------------------------