%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n015.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.46s 0.29s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 61 ( 23 unt; 2 def)
% Number of atoms : 140 ( 49 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 133 ( 54 ~; 52 |; 18 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?)
% 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(f34,axiom,
! [X0] :
( less(X0,n1)
<=> less_or_equal(X0,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(f35,axiom,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(f43,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( ~ less(X1,X0)
& X1 != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
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(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(f83,plain,
! [X2,X0,X1] :
( ~ terminates(X0,X2,X1)
| ~ happens(X0,X1)
| ~ holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f68]) ).
fof(f118,plain,
! [X2,X0,X1] :
( happens(pull,X2)
| spinning != X1
| push != X0
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f14]) ).
fof(f134,plain,
! [X0,X1] :
( n0 != X1
| push != X0
| sP9(X1,X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f136,plain,
! [X0,X1] :
( ~ sP9(X1,X0)
| push = X0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f144,plain,
! [X0,X1] :
( push = X0
| n2 = X1
| n1 = X1
| sP9(X1,X0)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f148,plain,
! [X0,X1] :
( ~ sP9(X1,X0)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f149,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f154,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f165,plain,
! [X0,X1] :
( X0 != X1
| less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f168,plain,
! [X0] :
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f170,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f35]) ).
fof(f187,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ less(X1,X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f191,plain,
~ holdsAt(spinning,n0),
inference(cnf_transformation,[],[f46]) ).
fof(f193,plain,
holdsAt(spinning,n1),
inference(cnf_transformation,[],[f50]) ).
fof(f202,plain,
! [X2,X0] :
( happens(pull,X2)
| push != X0
| terminates(X0,spinning,X2) ),
inference(equality_resolution,[],[f118]) ).
fof(f203,plain,
! [X2] :
( terminates(push,spinning,X2)
| happens(pull,X2) ),
inference(equality_resolution,[],[f202]) ).
fof(f218,plain,
! [X0] :
( push != X0
| sP9(n0,X0) ),
inference(equality_resolution,[],[f134]) ).
fof(f219,plain,
sP9(n0,push),
inference(equality_resolution,[],[f218]) ).
fof(f220,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f165]) ).
fof(f253,plain,
happens(push,n0),
inference(resolution,[],[f148,f219]) ).
fof(f254,plain,
less(n0,n1),
inference(resolution,[],[f168,f220]) ).
fof(f255,plain,
less(n1,n2),
inference(resolution,[],[f170,f220]) ).
fof(f274,plain,
~ less(n2,n1),
inference(resolution,[],[f187,f255]) ).
fof(f371,plain,
! [X0] :
( ~ happens(push,X0)
| ~ holdsAt(spinning,plus(X0,n1))
| happens(pull,X0) ),
inference(resolution,[],[f83,f203]) ).
fof(f425,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| n2 = X1
| n1 = X1
| push = X0 ),
inference(forward_subsumption_resolution,[],[f144,f136]) ).
fof(f878,plain,
( ~ holdsAt(spinning,plus(n0,n1))
| happens(pull,n0) ),
inference(resolution,[],[f371,f253]) ).
fof(f881,plain,
( ~ holdsAt(spinning,n1)
| happens(pull,n0) ),
inference(forward_demodulation,[],[f878,f154]) ).
fof(f882,plain,
happens(pull,n0),
inference(forward_subsumption_resolution,[],[f881,f193]) ).
fof(f894,plain,
( n0 = n2
| n0 = n1
| push = pull ),
inference(resolution,[],[f882,f425]) ).
fof(f896,plain,
( n0 = n2
| n0 = n1 ),
inference(forward_subsumption_resolution,[],[f894,f149]) ).
fof(f900,definition,
( spl10_37
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl10_37])],[avatar_definition]) ).
fof(f902,plain,
( n0 = n1
| ~ spl10_37 ),
inference(avatar_component_clause,[],[f900]) ).
fof(f904,definition,
( spl10_38
<=> n0 = n2 ),
introduced(definition,[new_symbols(definition,[spl10_38])],[avatar_definition]) ).
fof(f906,plain,
( n0 = n2
| ~ spl10_38 ),
inference(avatar_component_clause,[],[f904]) ).
fof(f907,plain,
( spl10_37
| spl10_38 ),
inference(avatar_split_clause,[],[f896,f904,f900]) ).
fof(f953,plain,
( ~ holdsAt(spinning,n1)
| ~ spl10_37 ),
inference(superposition,[],[f191,f902]) ).
fof(f968,plain,
( $false
| ~ spl10_37 ),
inference(forward_subsumption_resolution,[],[f953,f193]) ).
fof(f969,plain,
~ spl10_37,
inference(avatar_contradiction_clause,[],[f968]) ).
fof(f981,plain,
( less(n2,n1)
| ~ spl10_38 ),
inference(superposition,[],[f254,f906]) ).
fof(f995,plain,
( $false
| ~ spl10_38 ),
inference(forward_subsumption_resolution,[],[f981,f274]) ).
fof(f996,plain,
~ spl10_38,
inference(avatar_contradiction_clause,[],[f995]) ).
cnf(s51,plain,
( spl10_37
| spl10_38 ),
inference(sat_conversion,[],[f907]) ).
cnf(s64,plain,
~ spl10_37,
inference(sat_conversion,[],[f969]) ).
cnf(s67,plain,
~ spl10_38,
inference(sat_conversion,[],[f996]) ).
cnf(s71,plain,
$false,
inference(rat,[],[s51,s67,s64]) ).
fof(f1000,plain,
$false,
inference(avatar_sat_refutation,[],[s71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % 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 SAT
% 0.10/0.18 % Computer : n015.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Mon Sep 28 22:09:02 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/0.21 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.46/0.29 % (3084262)Will run a generic schedule for satisfiability detection.
% 0.46/0.29 % (3084273)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4111213430:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.46/0.29 % (3084268)% WARNING: option uhcvi not known.
% 0.46/0.29 % (3084267)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=701262115_2999 on theBenchmark for (2999ds/0Mi)
% 0.46/0.29 % (3084268)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1961877083:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.46/0.29 % (3084269)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2042208111:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.46/0.29 % (3084270)dis+10_1_sil=32000:sp=arity:random_seed=331396650:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.46/0.29 % (3084271)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1523265797:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.46/0.29 % Detected minimum model sizes of [3]
% 0.46/0.29 % Detected maximum model sizes of [max]
% 0.46/0.29 % TRYING [3]
% 0.46/0.29 % (3084272)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3629926654:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.46/0.29 % TRYING [4]
% 0.46/0.29 % (3084268) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3084262-3084268"...
% 0.46/0.29 % (3084270) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3084262-3084270"...
% 0.46/0.29 % (3084268)...printing done.
% 0.46/0.29 % TRYING [5]
% 0.46/0.29 % (3084270)...printing done.
% 0.46/0.29 % (3084268)Refutation found. Thanks to Tanya!
% 0.46/0.29 % SZS status Theorem for theBenchmark
% 0.46/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.46/0.29 % (3084268)------------------------------
% 0.46/0.29 % (3084268)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.46/0.29 % (3084268)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.46/0.29 % (3084268)CaDiCaL version: 2.1.3
% 0.46/0.29 % (3084268)Termination reason: Refutation
% 0.46/0.29 % (3084268)Time elapsed: 0.021 s
% 0.46/0.29 % (3084268)Peak memory usage: 13 MB
% 0.46/0.29 % (3084268)Instructions burned: 29 (million)
% 0.46/0.29 % (3084262)Success in time 0.061 s
% 0.46/0.29 % Vampire exiting
%------------------------------------------------------------------------------