%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR017+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 : 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 09:41:58 AM UTC 2026
% Result : Theorem 2.12s 1.13s
% Output : Refutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 25
% Syntax : Number of formulae : 127 ( 27 unt; 14 def)
% Number of atoms : 457 ( 161 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 514 ( 184 ~; 198 |; 110 &)
% ( 20 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 5 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 165 ( 0 sgn 165 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( ( happens(X0,X1)
& initiates(X0,X2,X1) )
=> holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_holds) ).
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(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/sandbox2/benchmark/theBenchmark.p',initiates_all_defn) ).
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(f22,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(f25,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(f45,axiom,
~ holdsAt(backwards,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_0) ).
fof(f46,axiom,
~ holdsAt(spinning,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_splinning_0) ).
fof(f48,conjecture,
~ holdsAt(spinning,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_spinning_1) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(spinning,n1),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(spinning,n1),
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(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(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(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(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(f95,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| push != X0
| spinning != X1
| happens(pull,X2) )
& ( ( X0 = push
& X1 = spinning
& ~ happens(pull,X2) )
| ~ sP1(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f75]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| push != X0
| spinning != X1
| happens(pull,X2) )
& ( ( X0 = push
& X1 = spinning
& ~ happens(pull,X2) )
| ~ sP1(X0,X1,X2) ) ),
inference(flattening,[],[f95]) ).
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(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(spinning,n1),
inference(cnf_transformation,[],[f50]) ).
fof(f125,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f133,plain,
! [X2,X0,X1] :
( ~ sP1(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f153,plain,
! [X2,X0,X1] :
( sP1(X0,X1,X2)
| push != X0
| spinning != X1
| happens(pull,X2) ),
inference(cnf_transformation,[],[f96]) ).
fof(f159,plain,
! [X2,X0,X1] :
( ~ sP5(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
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(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(f208,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(cnf_transformation,[],[f71]) ).
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(f228,plain,
! [X2,X1] :
( sP1(push,X1,X2)
| spinning != X1
| happens(pull,X2) ),
inference(equality_resolution,[],[f153]) ).
fof(f229,plain,
! [X2] :
( sP1(push,spinning,X2)
| happens(pull,X2) ),
inference(equality_resolution,[],[f228]) ).
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(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(f292,plain,
! [X0] :
( sP5(push,spinning,X0)
| happens(pull,X0) ),
inference(resolution,[],[f133,f229]) ).
fof(f298,plain,
! [X0] :
( terminates(push,spinning,X0)
| happens(pull,X0) ),
inference(resolution,[],[f159,f292]) ).
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(f337,plain,
( n0 = n2
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f358,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n0)
| ~ happens(X1,n0)
| ~ holdsAt(X0,n1) ),
inference(superposition,[],[f208,f125]) ).
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(f413,plain,
( ~ happens(push,n0)
| ~ holdsAt(spinning,n1)
| happens(pull,n0) ),
inference(resolution,[],[f358,f298]) ).
fof(f414,plain,
( ~ holdsAt(spinning,n1)
| happens(pull,n0) ),
inference(forward_subsumption_resolution,[],[f413,f262]) ).
fof(f422,definition,
( spl14_6
<=> happens(pull,n0) ),
introduced(definition,[new_symbols(definition,[spl14_6])],[avatar_definition]) ).
fof(f423,plain,
( happens(pull,n0)
| ~ spl14_6 ),
inference(avatar_component_clause,[],[f422]) ).
fof(f427,plain,
happens(pull,n0),
inference(forward_subsumption_resolution,[],[f414,f123]) ).
fof(f435,plain,
spl14_6,
inference(avatar_split_clause,[],[f427,f422]) ).
fof(f445,plain,
( sP9(pull,n0)
| ~ spl14_6 ),
inference(resolution,[],[f423,f206]) ).
fof(f455,plain,
( n0 = n1
| n0 = n2
| push = pull
| ~ spl14_6 ),
inference(resolution,[],[f445,f251]) ).
fof(f459,plain,
( n0 = n1
| n0 = n2
| ~ spl14_6 ),
inference(forward_subsumption_resolution,[],[f455,f190]) ).
fof(f461,definition,
( spl14_8
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl14_8])],[avatar_definition]) ).
fof(f463,plain,
( n0 = n1
| ~ spl14_8 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f464,plain,
( spl14_4
| spl14_8
| ~ spl14_6 ),
inference(avatar_split_clause,[],[f459,f422,f461,f335]) ).
fof(f535,plain,
( holdsAt(spinning,n0)
| ~ spl14_8 ),
inference(superposition,[],[f123,f463]) ).
fof(f556,plain,
( $false
| ~ spl14_8 ),
inference(forward_subsumption_resolution,[],[f535,f121]) ).
fof(f557,plain,
~ spl14_8,
inference(avatar_contradiction_clause,[],[f556]) ).
fof(f818,plain,
( holdsAt(spinning,n2)
| ~ happens(pull,n1)
| ~ happens(push,n1) ),
inference(superposition,[],[f363,f218]) ).
fof(f819,plain,
( holdsAt(spinning,n2)
| ~ happens(push,n1) ),
inference(forward_subsumption_resolution,[],[f818,f264]) ).
fof(f822,plain,
( holdsAt(spinning,n0)
| ~ happens(push,n1)
| ~ spl14_4 ),
inference(forward_demodulation,[],[f819,f337]) ).
fof(f827,definition,
( spl14_10
<=> happens(push,n1) ),
introduced(definition,[new_symbols(definition,[spl14_10])],[avatar_definition]) ).
fof(f829,plain,
( ~ happens(push,n1)
| spl14_10 ),
inference(avatar_component_clause,[],[f827]) ).
fof(f831,plain,
( ~ happens(push,n1)
| ~ spl14_4 ),
inference(forward_subsumption_resolution,[],[f822,f121]) ).
fof(f832,plain,
( ~ spl14_10
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f831,f335,f827]) ).
fof(f840,plain,
( holdsAt(backwards,n2)
| ~ happens(pull,n1)
| happens(push,n1) ),
inference(superposition,[],[f368,f218]) ).
fof(f841,plain,
( holdsAt(backwards,n2)
| happens(push,n1) ),
inference(forward_subsumption_resolution,[],[f840,f264]) ).
fof(f845,plain,
( holdsAt(backwards,n2)
| spl14_10 ),
inference(forward_subsumption_resolution,[],[f841,f829]) ).
fof(f848,plain,
( holdsAt(backwards,n0)
| ~ spl14_4
| spl14_10 ),
inference(forward_demodulation,[],[f845,f337]) ).
fof(f850,plain,
( $false
| ~ spl14_4
| spl14_10 ),
inference(forward_subsumption_resolution,[],[f848,f120]) ).
fof(f851,plain,
( ~ spl14_4
| spl14_10 ),
inference(avatar_contradiction_clause,[],[f850]) ).
cnf(s7,plain,
spl14_6,
inference(sat_conversion,[],[f435]) ).
cnf(s8,plain,
( spl14_4
| ~ spl14_6
| spl14_8 ),
inference(sat_conversion,[],[f464]) ).
cnf(s10,plain,
~ spl14_8,
inference(sat_conversion,[],[f557]) ).
cnf(s15,plain,
( ~ spl14_4
| ~ spl14_10 ),
inference(sat_conversion,[],[f832]) ).
cnf(s16,plain,
( ~ spl14_4
| spl14_10 ),
inference(sat_conversion,[],[f851]) ).
cnf(s17,plain,
( spl14_4
| ~ spl14_6 ),
inference(rat,[],[s8,s10]) ).
cnf(s18,plain,
spl14_4,
inference(rat,[],[s17,s7]) ).
cnf(s19,plain,
spl14_10,
inference(rat,[],[s16,s18]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s15,s19,s18]) ).
fof(f852,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR017+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 % Computer : n009.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Mon Sep 28 22:05:45 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running first-order theorem proving
% 0.08/0.24 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
% 2.12/1.13 % (3546581)Detected formulas, will run a generic FOF schedule.
% 2.12/1.13 % (3546592)dis-21_1_sil=8000:lcm=predicate:random_seed=4199682875: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.12/1.13 % (3546592)Instruction limit reached!
% 2.12/1.13 % (3546592)------------------------------
% 2.12/1.13 % (3546592)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/1.13 % (3546592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/1.13 % (3546592)CaDiCaL version: 2.1.3
% 2.12/1.13 % (3546592)Termination reason: Instruction limit
% 2.12/1.13 % (3546592)Termination phase: Saturation
% 2.12/1.13 % (3546592)Time elapsed: 0.038 s
% 2.12/1.13 % (3546592)Peak memory usage: 89 MB
% 2.12/1.13 % (3546592)Instructions burned: 132 (million)
% 2.12/1.13 % (3546586)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=4063909638:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.12/1.13 % (3546590)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2506828117:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.12/1.13 % (3546589)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2203570026:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.12/1.13 % (3546588)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=86667401:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.12/1.13 % (3546591)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1807491343:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.12/1.13 % (3546587)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=1268745922:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.12/1.13 % (3546589)Refutation not found, incomplete strategy
% 2.12/1.13 % (3546589)------------------------------
% 2.12/1.13 % (3546589)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/1.13 % (3546589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/1.13 % (3546589)CaDiCaL version: 2.1.3
% 2.12/1.13 % (3546589)Termination reason: Refutation not found, incomplete strategy
% 2.12/1.13 % (3546589)Time elapsed: 0.001 s
% 2.12/1.13 % (3546589)Peak memory usage: 88 MB
% 2.12/1.13 % (3546589)Instructions burned: 1 (million)
% 2.12/1.13 % (3546590)Refutation not found, incomplete strategy
% 2.12/1.13 % (3546590)------------------------------
% 2.12/1.13 % (3546590)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/1.13 % (3546590)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/1.13 % (3546590)CaDiCaL version: 2.1.3
% 2.12/1.13 % (3546590)Termination reason: Refutation not found, incomplete strategy
% 2.12/1.13 % (3546590)Time elapsed: 0.003 s
% 2.12/1.13 % (3546590)Peak memory usage: 88 MB
% 2.12/1.13 % (3546590)Instructions burned: 3 (million)
% 2.12/1.13 % (3546591)Instruction limit reached!
% 2.12/1.13 % (3546591)------------------------------
% 2.12/1.13 % (3546591)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/1.13 % (3546591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/1.13 % (3546591)CaDiCaL version: 2.1.3
% 2.12/1.13 % (3546591)Termination reason: Instruction limit
% 2.12/1.13 % (3546591)Termination phase: Saturation
% 2.12/1.13 % (3546591)Time elapsed: 0.089 s
% 2.12/1.13 % (3546591)Peak memory usage: 90 MB
% 2.12/1.13 % (3546591)Instructions burned: 140 (million)
% 2.12/1.13 % (3546600)lrs+10_1_sil=8000:sp=occurrence:random_seed=3378530729:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.12/1.13 % (3546600)First to succeed.
% 2.12/1.13 % (3546600)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3546581"
% 2.12/1.13 % (3546590)------------------------------
% 2.12/1.13 % (3546590)------------------------------
% 2.12/1.13 % (3546589)------------------------------
% 2.12/1.13 % (3546589)------------------------------
% 2.12/1.13 % (3546601)lrs+10_1_sil=32000:urr=on:br=off:random_seed=873005426:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.12/1.13 % (3546601)Refutation not found, incomplete strategy
% 2.12/1.13 % (3546601)------------------------------
% 2.12/1.13 % (3546601)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.12/1.13 % (3546601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.12/1.13 % (3546601)CaDiCaL version: 2.1.3
% 2.12/1.13 % (3546601)Termination reason: Refutation not found, incomplete strategy
% 2.12/1.13 % (3546601)Time elapsed: 0.001 s
% 2.12/1.13 % (3546601)Peak memory usage: 88 MB
% 2.12/1.13 % (3546600)Refutation found. Thanks to Tanya!
% 2.12/1.13 % SZS status Theorem for theBenchmark
% 2.12/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 3.91/1.33 % (3546600)------------------------------
% 3.91/1.33 % (3546600)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.91/1.33 % (3546600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.91/1.33 % (3546600)CaDiCaL version: 2.1.3
% 3.91/1.33 % (3546600)Termination reason: Refutation
% 3.91/1.33 % (3546600)Time elapsed: 0.010 s
% 3.91/1.33 % (3546600)Peak memory usage: 90 MB
% 3.91/1.33 % (3546600)Instructions burned: 25 (million)
% 3.91/1.33 % (3546600)------------------------------
% 3.91/1.33 % (3546600)------------------------------
% 3.91/1.33 % (3546581)Success in time 0.464 s
% 3.91/1.33 % Vampire exiting
%------------------------------------------------------------------------------