%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR015+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:20 AM UTC 2026
% Result : Theorem 0.21s 0.26s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of formulae : 83 ( 25 unt; 10 def)
% Number of atoms : 288 ( 112 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 315 ( 110 ~; 114 |; 74 &)
% ( 16 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 3 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 102 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1,X2] :
( ( happens(X0,X1)
& terminates(X0,X2,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(f22,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_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(f33,axiom,
~ ? [X0] : less(X0,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less0) ).
fof(f35,axiom,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(f45,axiom,
~ holdsAt(backwards,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_0) ).
fof(f48,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_1) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n1),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(backwards,n1),
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(f73,plain,
! [X0] : ~ less(X0,n0),
inference(ennf_transformation,[],[f33]) ).
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(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(f115,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(f116,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,[],[f115]) ).
fof(f118,plain,
! [X0] :
( ( less(X0,n2)
| ~ less_or_equal(X0,n1) )
& ( less_or_equal(X0,n1)
| ~ less(X0,n2) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f163,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| push != X0
| backwards != X1
| happens(pull,X2) ),
inference(cnf_transformation,[],[f98]) ).
fof(f185,plain,
! [X2,X0,X1] :
( ~ sP7(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f109]) ).
fof(f191,plain,
! [X0,X1] :
( push = X0
| n1 = X1
| n2 = X1
| sP8(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f198,plain,
! [X0,X1] :
( sP9(X0,X1)
| push != X0
| n0 != X1 ),
inference(cnf_transformation,[],[f111]) ).
fof(f200,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| push = X0 ),
inference(cnf_transformation,[],[f113]) ).
fof(f202,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f204,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f209,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f220,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f116]) ).
fof(f222,plain,
! [X0] : ~ less(X0,n0),
inference(cnf_transformation,[],[f73]) ).
fof(f226,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f118]) ).
fof(f245,plain,
~ holdsAt(backwards,n0),
inference(cnf_transformation,[],[f45]) ).
fof(f248,plain,
holdsAt(backwards,n1),
inference(cnf_transformation,[],[f50]) ).
fof(f255,plain,
! [X2,X1] :
( sP7(push,X1,X2)
| backwards != X1
| happens(pull,X2) ),
inference(equality_resolution,[],[f163]) ).
fof(f256,plain,
! [X2] :
( sP7(push,backwards,X2)
| happens(pull,X2) ),
inference(equality_resolution,[],[f255]) ).
fof(f267,plain,
! [X1] :
( sP9(push,X1)
| n0 != X1 ),
inference(equality_resolution,[],[f198]) ).
fof(f268,plain,
sP9(push,n0),
inference(equality_resolution,[],[f267]) ).
fof(f275,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f220]) ).
fof(f282,plain,
happens(push,n0),
inference(resolution,[],[f203,f268]) ).
fof(f292,plain,
less(n1,n2),
inference(resolution,[],[f226,f275]) ).
fof(f411,plain,
! [X0] :
( terminates(push,backwards,X0)
| happens(pull,X0) ),
inference(resolution,[],[f185,f256]) ).
fof(f497,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n0)
| ~ happens(X1,n0)
| ~ holdsAt(X0,n1) ),
inference(superposition,[],[f137,f209]) ).
fof(f555,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| n1 = X1
| n2 = X1
| push = X0 ),
inference(forward_subsumption_resolution,[],[f191,f200]) ).
fof(f821,plain,
( ~ happens(push,n0)
| ~ holdsAt(backwards,n1)
| happens(pull,n0) ),
inference(resolution,[],[f497,f411]) ).
fof(f822,plain,
( ~ holdsAt(backwards,n1)
| happens(pull,n0) ),
inference(forward_subsumption_resolution,[],[f821,f282]) ).
fof(f824,plain,
happens(pull,n0),
inference(forward_subsumption_resolution,[],[f822,f248]) ).
fof(f826,plain,
sP9(pull,n0),
inference(resolution,[],[f824,f202]) ).
fof(f831,plain,
( n0 = n1
| n0 = n2
| push = pull ),
inference(resolution,[],[f826,f555]) ).
fof(f836,plain,
( n0 = n1
| n0 = n2 ),
inference(forward_subsumption_resolution,[],[f831,f204]) ).
fof(f838,definition,
( spl14_7
<=> n0 = n2 ),
introduced(definition,[new_symbols(definition,[spl14_7])],[avatar_definition]) ).
fof(f840,plain,
( n0 = n2
| ~ spl14_7 ),
inference(avatar_component_clause,[],[f838]) ).
fof(f842,definition,
( spl14_8
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl14_8])],[avatar_definition]) ).
fof(f844,plain,
( n0 = n1
| ~ spl14_8 ),
inference(avatar_component_clause,[],[f842]) ).
fof(f845,plain,
( spl14_7
| spl14_8 ),
inference(avatar_split_clause,[],[f836,f842,f838]) ).
fof(f858,plain,
( less(n1,n0)
| ~ spl14_7 ),
inference(superposition,[],[f292,f840]) ).
fof(f889,plain,
( $false
| ~ spl14_7 ),
inference(forward_subsumption_resolution,[],[f858,f222]) ).
fof(f890,plain,
~ spl14_7,
inference(avatar_contradiction_clause,[],[f889]) ).
fof(f904,plain,
( holdsAt(backwards,n0)
| ~ spl14_8 ),
inference(superposition,[],[f248,f844]) ).
fof(f938,plain,
( $false
| ~ spl14_8 ),
inference(forward_subsumption_resolution,[],[f904,f245]) ).
fof(f939,plain,
~ spl14_8,
inference(avatar_contradiction_clause,[],[f938]) ).
cnf(s10,plain,
( spl14_7
| spl14_8 ),
inference(sat_conversion,[],[f845]) ).
cnf(s13,plain,
~ spl14_7,
inference(sat_conversion,[],[f890]) ).
cnf(s15,plain,
~ spl14_8,
inference(sat_conversion,[],[f939]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s10,s15,s13]) ).
fof(f945,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR015+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n007.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:03:26 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.26 % (2906687)Will run a generic schedule for satisfiability detection.
% 0.21/0.26 % (2906695)dis+10_1_sil=32000:sp=arity:random_seed=1446118338:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.26 % (2906693)% WARNING: option uhcvi not known.
% 0.21/0.26 % (2906692)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3940895991_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.26 % (2906693)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2751682507:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.26 % (2906694)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=532706770:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.26 % (2906696)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3095488294:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.26 % (2906698)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3801066937:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.26 % (2906697)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2328342689:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.26 % (2906695) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2906687-2906695"...
% 0.21/0.26 % (2906695)...printing done.
% 0.21/0.26 % (2906695)Refutation found. Thanks to Tanya!
% 0.21/0.26 % SZS status Theorem for theBenchmark
% 0.21/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27 % (2906695)------------------------------
% 0.21/0.27 % (2906695)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27 % (2906695)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27 % (2906695)CaDiCaL version: 2.1.3
% 0.21/0.27 % (2906695)Termination reason: Refutation
% 0.21/0.27 % (2906695)Time elapsed: 0.010 s
% 0.21/0.27 % (2906695)Peak memory usage: 13 MB
% 0.21/0.27 % (2906695)Instructions burned: 27 (million)
% 0.21/0.27 % (2906687)Success in time 0.039 s
% 0.21/0.27 % Vampire exiting
%------------------------------------------------------------------------------