%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR019+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 : n008.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.43s 0.29s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 54 ( 12 unt; 8 def)
% Number of atoms : 244 ( 99 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 288 ( 98 ~; 100 |; 77 &)
% ( 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 : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 103 ( 103 !; 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(f25,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1) ).
fof(f48,conjecture,
~ holdsAt(forwards,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_forwards_2) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(forwards,n2),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(forwards,n2),
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(f99,plain,
! [X0,X1,X2] :
( ( sP6(X0,X1,X2)
| pull != X0
| forwards != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) )
| ~ sP6(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f81]) ).
fof(f100,plain,
! [X0,X1,X2] :
( ( sP6(X0,X1,X2)
| pull != X0
| forwards != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) )
| ~ sP6(X0,X1,X2) ) ),
inference(flattening,[],[f99]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| pull != X0
| forwards != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = forwards
& happens(push,X2) )
| ~ sP5(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f80]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| pull != X0
| forwards != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = forwards
& happens(push,X2) )
| ~ sP5(X0,X1,X2) ) ),
inference(flattening,[],[f101]) ).
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(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(f161,plain,
! [X2,X0,X1] :
( ~ sP5(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f98]) ).
fof(f162,plain,
! [X2,X0,X1] :
( ~ sP6(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f98]) ).
fof(f167,plain,
! [X2,X0,X1] :
( sP6(X0,X1,X2)
| pull != X0
| forwards != X1
| happens(push,X2) ),
inference(cnf_transformation,[],[f100]) ).
fof(f171,plain,
! [X2,X0,X1] :
( sP5(X0,X1,X2)
| pull != X0
| forwards != X1
| ~ happens(push,X2) ),
inference(cnf_transformation,[],[f102]) ).
fof(f185,plain,
! [X2,X0,X1] :
( ~ sP7(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f109]) ).
fof(f197,plain,
! [X0,X1] :
( sP9(X0,X1)
| pull != X0
| n1 != X1 ),
inference(cnf_transformation,[],[f111]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f212,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f248,plain,
holdsAt(forwards,n2),
inference(cnf_transformation,[],[f50]) ).
fof(f257,plain,
! [X2,X1] :
( sP6(pull,X1,X2)
| forwards != X1
| happens(push,X2) ),
inference(equality_resolution,[],[f167]) ).
fof(f258,plain,
! [X2] :
( sP6(pull,forwards,X2)
| happens(push,X2) ),
inference(equality_resolution,[],[f257]) ).
fof(f259,plain,
! [X2,X1] :
( sP5(pull,X1,X2)
| forwards != X1
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f171]) ).
fof(f260,plain,
! [X2] :
( sP5(pull,forwards,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f259]) ).
fof(f269,plain,
! [X1] :
( sP9(pull,X1)
| n1 != X1 ),
inference(equality_resolution,[],[f197]) ).
fof(f270,plain,
sP9(pull,n1),
inference(equality_resolution,[],[f269]) ).
fof(f284,plain,
happens(pull,n1),
inference(resolution,[],[f203,f270]) ).
fof(f400,plain,
! [X0] :
( sP7(pull,forwards,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f161,f260]) ).
fof(f404,plain,
! [X0] :
( sP7(pull,forwards,X0)
| happens(push,X0) ),
inference(resolution,[],[f162,f258]) ).
fof(f498,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n1)
| ~ happens(X1,n1)
| ~ holdsAt(X0,n2) ),
inference(superposition,[],[f137,f212]) ).
fof(f733,plain,
! [X0] : sP7(pull,forwards,X0),
inference(forward_subsumption_resolution,[],[f404,f400]) ).
fof(f738,plain,
! [X0] : terminates(pull,forwards,X0),
inference(resolution,[],[f733,f185]) ).
fof(f845,plain,
( ~ happens(pull,n1)
| ~ holdsAt(forwards,n2) ),
inference(resolution,[],[f738,f498]) ).
fof(f846,plain,
~ holdsAt(forwards,n2),
inference(forward_subsumption_resolution,[],[f845,f284]) ).
fof(f852,plain,
$false,
inference(forward_subsumption_resolution,[],[f846,f248]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR019+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.10/0.19 % Computer : n008.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Mon Sep 28 22:06:24 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/0.22 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.10/0.29 % (2710088)Will run a generic schedule for satisfiability detection.
% 0.10/0.29 % (2710104)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=69062467:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.29 % (2710107)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=452454416:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.29 % (2710106)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=372423497:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.29 % (2710105)dis+10_1_sil=32000:sp=arity:random_seed=434173056:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.29 % (2710103)% WARNING: option uhcvi not known.
% 0.10/0.29 % (2710102)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2708313482_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.29 % (2710103)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3475043082:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.29 % (2710108)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=458256186:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.43/0.29 % (2710105) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2710088-2710105"...
% 0.43/0.29 % (2710105)...printing done.
% 0.43/0.29 % Detected minimum model sizes of [3]
% 0.43/0.29 % Detected maximum model sizes of [max]
% 0.43/0.29 % TRYING [3]
% 0.43/0.29 % (2710105)Refutation found. Thanks to Tanya!
% 0.43/0.29 % SZS status Theorem for theBenchmark
% 0.43/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.43/0.30 % (2710105)------------------------------
% 0.43/0.30 % (2710105)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.43/0.30 % (2710105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.43/0.30 % (2710105)CaDiCaL version: 2.1.3
% 0.43/0.30 % (2710105)Termination reason: Refutation
% 0.43/0.30 % (2710105)Time elapsed: 0.014 s
% 0.43/0.30 % (2710105)Peak memory usage: 12 MB
% 0.43/0.30 % (2710105)Instructions burned: 26 (million)
% 0.43/0.30 % (2710088)Success in time 0.061 s
% 0.43/0.30 % Vampire exiting
%------------------------------------------------------------------------------