%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n014.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.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of formulae : 83 ( 26 unt; 7 def)
% Number of atoms : 261 ( 100 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 276 ( 98 ~; 107 |; 56 &)
% ( 14 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 4 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 85 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( ( happens(X0,X1)
& initiates(X0,X2,X1) )
=> holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',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/Axioms/CSR001+2.ax',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/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(f22,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).
fof(f32,axiom,
! [X0,X1] :
( less_or_equal(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).
fof(f33,axiom,
~ ? [X0] : less(X0,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less0) ).
fof(f34,axiom,
! [X0] :
( less(X0,n1)
<=> less_or_equal(X0,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).
fof(f35,axiom,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).
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(f65,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ initiates(X0,X2,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f66,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ initiates(X0,X2,X1) ),
inference(flattening,[],[f65]) ).
fof(f73,plain,
! [X0] : ~ less(X0,n0),
inference(ennf_transformation,[],[f33]) ).
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 = pull
& X1 = backwards
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f76,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| sP1(X0,X1,X2)
| sP0(X0,X1,X2) ) ),
inference(definition_folding,[],[f13,f75,f74]) ).
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(f95,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( push != X0
| forwards != X1
| happens(pull,X2) )
& ~ sP1(X0,X1,X2)
& ~ sP0(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| sP1(X0,X1,X2)
| sP0(X0,X1,X2)
| ~ initiates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( push != X0
| forwards != X1
| happens(pull,X2) )
& ~ sP1(X0,X1,X2)
& ~ sP0(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| sP1(X0,X1,X2)
| sP0(X0,X1,X2)
| ~ initiates(X0,X1,X2) ) ),
inference(flattening,[],[f95]) ).
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(f117,plain,
! [X0] :
( ( less(X0,n1)
| ~ less_or_equal(X0,n0) )
& ( less_or_equal(X0,n0)
| ~ less(X0,n1) ) ),
inference(nnf_transformation,[],[f34]) ).
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(f136,plain,
! [X2,X0,X1] :
( ~ initiates(X0,X2,X1)
| ~ happens(X0,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f66]) ).
fof(f154,plain,
! [X2,X0,X1] :
( initiates(X0,X1,X2)
| push != X0
| forwards != X1
| happens(pull,X2) ),
inference(cnf_transformation,[],[f96]) ).
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(f224,plain,
! [X0] :
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f226,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f118]) ).
fof(f248,plain,
~ holdsAt(forwards,n1),
inference(cnf_transformation,[],[f50]) ).
fof(f253,plain,
! [X2,X1] :
( initiates(push,X1,X2)
| forwards != X1
| happens(pull,X2) ),
inference(equality_resolution,[],[f154]) ).
fof(f254,plain,
! [X2] :
( initiates(push,forwards,X2)
| happens(pull,X2) ),
inference(equality_resolution,[],[f253]) ).
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(f288,plain,
less(n0,n1),
inference(resolution,[],[f224,f275]) ).
fof(f292,plain,
less(n1,n2),
inference(resolution,[],[f226,f275]) ).
fof(f492,plain,
! [X0] :
( holdsAt(forwards,plus(X0,n1))
| ~ happens(push,X0)
| happens(pull,X0) ),
inference(resolution,[],[f136,f254]) ).
fof(f555,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| n1 = X1
| n2 = X1
| push = X0 ),
inference(forward_subsumption_resolution,[],[f191,f200]) ).
fof(f825,definition,
( spl14_7
<=> happens(pull,n0) ),
introduced(definition,[new_symbols(definition,[spl14_7])],[avatar_definition]) ).
fof(f827,plain,
( happens(pull,n0)
| ~ spl14_7 ),
inference(avatar_component_clause,[],[f825]) ).
fof(f864,plain,
( holdsAt(forwards,n1)
| ~ happens(push,n0)
| happens(pull,n0) ),
inference(superposition,[],[f492,f209]) ).
fof(f866,plain,
( ~ happens(push,n0)
| happens(pull,n0) ),
inference(forward_subsumption_resolution,[],[f864,f248]) ).
fof(f867,plain,
happens(pull,n0),
inference(forward_subsumption_resolution,[],[f866,f282]) ).
fof(f868,plain,
spl14_7,
inference(avatar_split_clause,[],[f867,f825]) ).
fof(f869,plain,
( sP9(pull,n0)
| ~ spl14_7 ),
inference(resolution,[],[f827,f202]) ).
fof(f877,plain,
( n0 = n1
| n0 = n2
| push = pull
| ~ spl14_7 ),
inference(resolution,[],[f869,f555]) ).
fof(f882,plain,
( n0 = n1
| n0 = n2
| ~ spl14_7 ),
inference(forward_subsumption_resolution,[],[f877,f204]) ).
fof(f884,definition,
( spl14_9
<=> n0 = n2 ),
introduced(definition,[new_symbols(definition,[spl14_9])],[avatar_definition]) ).
fof(f886,plain,
( n0 = n2
| ~ spl14_9 ),
inference(avatar_component_clause,[],[f884]) ).
fof(f888,definition,
( spl14_10
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl14_10])],[avatar_definition]) ).
fof(f890,plain,
( n0 = n1
| ~ spl14_10 ),
inference(avatar_component_clause,[],[f888]) ).
fof(f891,plain,
( spl14_9
| spl14_10
| ~ spl14_7 ),
inference(avatar_split_clause,[],[f882,f825,f888,f884]) ).
fof(f903,plain,
( less(n1,n0)
| ~ spl14_9 ),
inference(superposition,[],[f292,f886]) ).
fof(f935,plain,
( $false
| ~ spl14_9 ),
inference(forward_subsumption_resolution,[],[f903,f222]) ).
fof(f936,plain,
~ spl14_9,
inference(avatar_contradiction_clause,[],[f935]) ).
fof(f965,plain,
( less(n0,n0)
| ~ spl14_10 ),
inference(superposition,[],[f288,f890]) ).
fof(f1001,plain,
( $false
| ~ spl14_10 ),
inference(forward_subsumption_resolution,[],[f965,f222]) ).
fof(f1002,plain,
~ spl14_10,
inference(avatar_contradiction_clause,[],[f1001]) ).
cnf(s11,plain,
spl14_7,
inference(sat_conversion,[],[f868]) ).
cnf(s12,plain,
( ~ spl14_7
| spl14_9
| spl14_10 ),
inference(sat_conversion,[],[f891]) ).
cnf(s15,plain,
~ spl14_9,
inference(sat_conversion,[],[f936]) ).
cnf(s16,plain,
~ spl14_10,
inference(sat_conversion,[],[f1002]) ).
cnf(s18,plain,
~ spl14_7,
inference(rat,[],[s12,s16,s15]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s11,s18]) ).
fof(f1008,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % 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 SAT
% 0.09/0.17 % Computer : n014.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 22:05:31 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 Running first-order model finding
% 0.09/0.20 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.09/0.26 % (2236138)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (2236143)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3471663020_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.26 % (2236144)% WARNING: option uhcvi not known.
% 0.09/0.26 % (2236145)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3563166145:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26 % (2236146)dis+10_1_sil=32000:sp=arity:random_seed=3905887562:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.26 % (2236147)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2178298537:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.26 % (2236148)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4263176046:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.26 % (2236149)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=362184233:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.26 % Detected minimum model sizes of [3]
% 0.09/0.26 % Detected maximum model sizes of [max]
% 0.09/0.26 % TRYING [3]
% 0.09/0.26 % (2236144)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3550556479:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26 % TRYING [4]
% 0.09/0.26 % (2236146) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2236138-2236146"...
% 0.09/0.26 % (2236146)...printing done.
% 0.09/0.26 % (2236146)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (2236146)------------------------------
% 0.09/0.26 % (2236146)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (2236146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (2236146)CaDiCaL version: 2.1.3
% 0.09/0.26 % (2236146)Termination reason: Refutation
% 0.09/0.26 % (2236146)Time elapsed: 0.019 s
% 0.09/0.26 % (2236146)Peak memory usage: 13 MB
% 0.09/0.26 % (2236146)Instructions burned: 29 (million)
% 0.09/0.26 % (2236138)Success in time 0.052 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------