%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR021+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:44:21 AM UTC 2026
% Result : Theorem 0.18s 0.29s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 58 ( 15 unt; 8 def)
% Number of atoms : 245 ( 101 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 290 ( 103 ~; 99 |; 75 &)
% ( 12 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 102 ( 102 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1,X2] :
( ( happens(X0,X1)
& terminates(X0,X2,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',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/sandbox/benchmark/Axioms/CSR001+2.ax',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/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(f26,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).
fof(f31,axiom,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f48,conjecture,
~ holdsAt(backwards,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_3) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n3),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(backwards,n3),
inference(flattening,[],[f49]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(flattening,[],[f67]) ).
fof(f77,definition,
! [X0,X1,X2] :
( sP2(X0,X1,X2)
<=> ( X0 = pull
& X1 = spinning
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f78,definition,
! [X0,X1,X2] :
( sP3(X0,X1,X2)
<=> ( X0 = push
& X1 = spinning
& ~ happens(pull,X2) ) ),
introduced(definition,[new_symbols(definition,[sP3])],[predicate_definition_introduction]) ).
fof(f79,definition,
! [X0,X1,X2] :
( sP4(X0,X1,X2)
<=> ( X0 = pull
& X1 = backwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP4])],[predicate_definition_introduction]) ).
fof(f80,definition,
! [X0,X1,X2] :
( sP5(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP5])],[predicate_definition_introduction]) ).
fof(f81,definition,
! [X0,X1,X2] :
( sP6(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP6])],[predicate_definition_introduction]) ).
fof(f82,definition,
! [X0,X1,X2] :
( sP7(X0,X1,X2)
<=> ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2) ) ),
introduced(definition,[new_symbols(definition,[sP7])],[predicate_definition_introduction]) ).
fof(f83,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP7(X0,X1,X2) ),
inference(definition_folding,[],[f14,f82,f81,f80,f79,f78,f77]) ).
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(f97,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP6(X0,X1,X2)
& ~ sP5(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| ~ sP7(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f82]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP6(X0,X1,X2)
& ~ sP5(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| ~ sP7(X0,X1,X2) ) ),
inference(flattening,[],[f97]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ( sP4(X0,X1,X2)
| pull != X0
| backwards != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = backwards
& happens(push,X2) )
| ~ sP4(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f104,plain,
! [X0,X1,X2] :
( ( sP4(X0,X1,X2)
| pull != X0
| backwards != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = backwards
& happens(push,X2) )
| ~ sP4(X0,X1,X2) ) ),
inference(flattening,[],[f103]) ).
fof(f109,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP7(X0,X1,X2) )
& ( sP7(X0,X1,X2)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f110,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(f111,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,[],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f113,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(flattening,[],[f112]) ).
fof(f114,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X0,X1) )
& ( sP9(X0,X1)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f160,plain,
! [X2,X0,X1] :
( ~ sP4(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f98]) ).
fof(f175,plain,
! [X2,X0,X1] :
( sP4(X0,X1,X2)
| pull != X0
| backwards != X1
| ~ happens(push,X2) ),
inference(cnf_transformation,[],[f104]) ).
fof(f185,plain,
! [X2,X0,X1] :
( ~ sP7(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f109]) ).
fof(f195,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f196,plain,
! [X0,X1] :
( sP9(X0,X1)
| pull != X0
| n2 != X1 ),
inference(cnf_transformation,[],[f111]) ).
fof(f201,plain,
! [X0,X1] :
( sP8(X0,X1)
| push != X0
| n2 != X1 ),
inference(cnf_transformation,[],[f113]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f213,plain,
n3 = plus(n1,n2),
inference(cnf_transformation,[],[f26]) ).
fof(f218,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f31]) ).
fof(f248,plain,
holdsAt(backwards,n3),
inference(cnf_transformation,[],[f50]) ).
fof(f261,plain,
! [X2,X1] :
( sP4(pull,X1,X2)
| backwards != X1
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f175]) ).
fof(f262,plain,
! [X2] :
( sP4(pull,backwards,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f261]) ).
fof(f271,plain,
! [X1] :
( sP9(pull,X1)
| n2 != X1 ),
inference(equality_resolution,[],[f196]) ).
fof(f272,plain,
sP9(pull,n2),
inference(equality_resolution,[],[f271]) ).
fof(f273,plain,
! [X1] :
( sP8(push,X1)
| n2 != X1 ),
inference(equality_resolution,[],[f201]) ).
fof(f274,plain,
sP8(push,n2),
inference(equality_resolution,[],[f273]) ).
fof(f279,plain,
sP9(push,n2),
inference(resolution,[],[f195,f274]) ).
fof(f283,plain,
happens(push,n2),
inference(resolution,[],[f203,f279]) ).
fof(f285,plain,
happens(pull,n2),
inference(resolution,[],[f203,f272]) ).
fof(f396,plain,
! [X0] :
( sP7(pull,backwards,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f160,f262]) ).
fof(f495,plain,
! [X2,X0,X1] :
( ~ holdsAt(X1,plus(n1,X0))
| ~ happens(X2,X0)
| ~ terminates(X2,X1,X0) ),
inference(superposition,[],[f137,f218]) ).
fof(f722,plain,
! [X0] :
( terminates(pull,backwards,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f396,f185]) ).
fof(f868,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n2)
| ~ happens(X1,n2)
| ~ holdsAt(X0,n3) ),
inference(superposition,[],[f495,f213]) ).
fof(f1154,plain,
( ~ happens(pull,n2)
| ~ holdsAt(backwards,n3)
| ~ happens(push,n2) ),
inference(resolution,[],[f868,f722]) ).
fof(f1155,plain,
( ~ holdsAt(backwards,n3)
| ~ happens(push,n2) ),
inference(forward_subsumption_resolution,[],[f1154,f285]) ).
fof(f1158,plain,
~ happens(push,n2),
inference(forward_subsumption_resolution,[],[f1155,f248]) ).
fof(f1160,plain,
$false,
inference(forward_subsumption_resolution,[],[f1158,f283]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR021+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n010.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:06:03 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.29 % (2416089)Will run a generic schedule for satisfiability detection.
% 0.18/0.29 % (2416097)dis+10_1_sil=32000:sp=arity:random_seed=2569403489:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.29 % (2416095)% WARNING: option uhcvi not known.
% 0.18/0.29 % (2416094)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=826199203_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.29 % (2416095)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3677789105:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.29 % (2416096)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=522075726:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.29 % (2416098)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2737459713:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.29 % (2416099)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1324310287:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.29 % (2416100)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2399263140:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.29 % (2416097) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2416089-2416097"...
% 0.18/0.29 % (2416097)...printing done.
% 0.18/0.29 % (2416097)Refutation found. Thanks to Tanya!
% 0.18/0.29 % SZS status Theorem for theBenchmark
% 0.18/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.29 % (2416097)------------------------------
% 0.18/0.29 % (2416097)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.29 % (2416097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.29 % (2416097)CaDiCaL version: 2.1.3
% 0.18/0.29 % (2416097)Termination reason: Refutation
% 0.18/0.29 % (2416097)Time elapsed: 0.012 s
% 0.18/0.29 % (2416097)Peak memory usage: 12 MB
% 0.18/0.29 % (2416097)Instructions burned: 35 (million)
% 0.18/0.29 % (2416089)Success in time 0.049 s
% 0.18/0.29 % Vampire exiting
%------------------------------------------------------------------------------