%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR023+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:41:59 AM UTC 2026
% Result : Theorem 3.12s 0.83s
% Output : Refutation 3.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 51 ( 15 unt; 4 def)
% Number of atoms : 199 ( 89 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 230 ( 82 ~; 83 |; 56 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 80 ( 80 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( ( happens(X0,X1)
& initiates(X0,X2,X1) )
=> holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f26,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_2) ).
fof(f31,axiom,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f48,conjecture,
holdsAt(spinning,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',spinning_3) ).
fof(f49,negated_conjecture,
~ holdsAt(spinning,n3),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
~ holdsAt(spinning,n3),
inference(flattening,[],[f49]) ).
fof(f72,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ initiates(X0,X2,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f73,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ initiates(X0,X2,X1) ),
inference(flattening,[],[f72]) ).
fof(f81,definition,
! [X0,X1,X2] :
( sP6(X0,X1,X2)
<=> ( X0 = pull
& X1 = spinning
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP6])],[predicate_definition_introduction]) ).
fof(f82,definition,
! [X0,X1,X2] :
( sP7(X0,X1,X2)
<=> ( X0 = pull
& X1 = backwards
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP7])],[predicate_definition_introduction]) ).
fof(f83,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| sP7(X0,X1,X2)
| sP6(X0,X1,X2) ) ),
inference(definition_folding,[],[f13,f82,f81]) ).
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(f102,plain,
! [X0,X1,X2] :
( ( sP6(X0,X1,X2)
| pull != X0
| spinning != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = spinning
& happens(push,X2) )
| ~ sP6(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f81]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ( sP6(X0,X1,X2)
| pull != X0
| spinning != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = spinning
& happens(push,X2) )
| ~ sP6(X0,X1,X2) ) ),
inference(flattening,[],[f102]) ).
fof(f104,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( push != X0
| forwards != X1
| happens(pull,X2) )
& ~ sP7(X0,X1,X2)
& ~ sP6(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| sP7(X0,X1,X2)
| sP6(X0,X1,X2)
| ~ initiates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f105,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( push != X0
| forwards != X1
| happens(pull,X2) )
& ~ sP7(X0,X1,X2)
& ~ sP6(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = forwards
& ~ happens(pull,X2) )
| sP7(X0,X1,X2)
| sP6(X0,X1,X2)
| ~ initiates(X0,X1,X2) ) ),
inference(flattening,[],[f104]) ).
fof(f114,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(f115,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,[],[f114]) ).
fof(f116,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f117,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| push != X0
| n2 != X1 )
& ( ( X0 = push
& X1 = n2 )
| ~ sP8(X0,X1) ) ),
inference(flattening,[],[f116]) ).
fof(f118,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X0,X1) )
& ( sP9(X0,X1)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f131,plain,
~ holdsAt(spinning,n3),
inference(cnf_transformation,[],[f50]) ).
fof(f175,plain,
! [X2,X0,X1] :
( sP6(X0,X1,X2)
| pull != X0
| spinning != X1
| ~ happens(push,X2) ),
inference(cnf_transformation,[],[f103]) ).
fof(f179,plain,
! [X2,X0,X1] :
( ~ sP6(X0,X1,X2)
| initiates(X0,X1,X2) ),
inference(cnf_transformation,[],[f105]) ).
fof(f201,plain,
n3 = plus(n1,n2),
inference(cnf_transformation,[],[f26]) ).
fof(f206,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f31]) ).
fof(f216,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f217,plain,
! [X0,X1] :
( sP9(X0,X1)
| pull != X0
| n2 != X1 ),
inference(cnf_transformation,[],[f115]) ).
fof(f222,plain,
! [X0,X1] :
( sP8(X0,X1)
| push != X0
| n2 != X1 ),
inference(cnf_transformation,[],[f117]) ).
fof(f224,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f226,plain,
! [X2,X0,X1] :
( ~ initiates(X0,X2,X1)
| ~ happens(X0,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f73]) ).
fof(f260,plain,
! [X2,X1] :
( sP6(pull,X1,X2)
| spinning != X1
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f175]) ).
fof(f261,plain,
! [X2] :
( sP6(pull,spinning,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f260]) ).
fof(f269,plain,
! [X1] :
( sP9(pull,X1)
| n2 != X1 ),
inference(equality_resolution,[],[f217]) ).
fof(f270,plain,
sP9(pull,n2),
inference(equality_resolution,[],[f269]) ).
fof(f271,plain,
! [X1] :
( sP8(push,X1)
| n2 != X1 ),
inference(equality_resolution,[],[f222]) ).
fof(f272,plain,
sP8(push,n2),
inference(equality_resolution,[],[f271]) ).
fof(f292,plain,
sP9(push,n2),
inference(resolution,[],[f216,f272]) ).
fof(f296,plain,
happens(push,n2),
inference(resolution,[],[f224,f292]) ).
fof(f298,plain,
happens(pull,n2),
inference(resolution,[],[f224,f270]) ).
fof(f411,plain,
! [X0] :
( initiates(pull,spinning,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f179,f261]) ).
fof(f744,plain,
! [X0] :
( holdsAt(spinning,plus(X0,n1))
| ~ happens(pull,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f411,f226]) ).
fof(f1384,plain,
! [X0] :
( holdsAt(spinning,plus(n1,X0))
| ~ happens(pull,X0)
| ~ happens(push,X0) ),
inference(superposition,[],[f744,f206]) ).
fof(f2682,plain,
( holdsAt(spinning,n3)
| ~ happens(pull,n2)
| ~ happens(push,n2) ),
inference(superposition,[],[f1384,f201]) ).
fof(f2687,plain,
( ~ happens(pull,n2)
| ~ happens(push,n2) ),
inference(forward_subsumption_resolution,[],[f2682,f131]) ).
fof(f2688,plain,
~ happens(push,n2),
inference(forward_subsumption_resolution,[],[f2687,f298]) ).
fof(f2689,plain,
$false,
inference(forward_subsumption_resolution,[],[f2688,f296]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : CSR023+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Mon Sep 28 22:05:34 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.12 Running first-order theorem proving
% 0.08/0.12 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.56/0.73 % (3841042)Detected formulas, will run a generic FOF schedule.
% 2.56/0.73 % (3841048)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2305367924:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.56/0.73 % (3841049)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=258178197:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.56/0.73 % (3841050)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=71513830:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.56/0.73 % (3841047)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1775151701:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.56/0.73 % (3841050)Refutation not found, incomplete strategy
% 2.56/0.73 % (3841050)------------------------------
% 2.56/0.73 % (3841050)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/0.73 % (3841050)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.73 % (3841050)CaDiCaL version: 2.1.3
% 2.56/0.73 % (3841050)Termination reason: Refutation not found, incomplete strategy
% 2.56/0.73 % (3841050)Time elapsed: 0.001 s
% 2.56/0.73 % (3841050)Peak memory usage: 88 MB
% 2.56/0.73 % (3841050)Instructions burned: 1 (million)
% 2.56/0.73 % (3841051)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4129304783:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.56/0.73 % (3841053)dis-21_1_sil=8000:lcm=predicate:random_seed=3696895121:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.56/0.73 % (3841052)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2266903751:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.56/0.73 % (3841051)Refutation not found, incomplete strategy
% 2.56/0.73 % (3841051)------------------------------
% 2.56/0.73 % (3841051)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/0.73 % (3841051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.73 % (3841051)CaDiCaL version: 2.1.3
% 2.56/0.73 % (3841051)Termination reason: Refutation not found, incomplete strategy
% 2.56/0.73 % (3841051)Time elapsed: 0.004 s
% 2.56/0.73 % (3841051)Peak memory usage: 88 MB
% 2.56/0.73 % (3841051)Instructions burned: 10 (million)
% 2.56/0.73 % (3841053)Instruction limit reached!
% 2.56/0.73 % (3841053)------------------------------
% 2.56/0.73 % (3841053)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/0.73 % (3841053)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.73 % (3841053)CaDiCaL version: 2.1.3
% 2.56/0.73 % (3841053)Termination reason: Instruction limit
% 2.56/0.73 % (3841053)Termination phase: Saturation
% 2.56/0.73 % (3841053)Time elapsed: 0.037 s
% 2.56/0.73 % (3841053)Peak memory usage: 89 MB
% 2.56/0.73 % (3841053)Instructions burned: 132 (million)
% 2.56/0.73 % (3841052)Instruction limit reached!
% 2.56/0.73 % (3841052)------------------------------
% 2.56/0.73 % (3841052)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/0.73 % (3841052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.73 % (3841052)CaDiCaL version: 2.1.3
% 2.56/0.73 % (3841052)Termination reason: Instruction limit
% 2.56/0.73 % (3841052)Termination phase: Saturation
% 2.56/0.73 % (3841052)Time elapsed: 0.048 s
% 2.56/0.73 % (3841052)Peak memory usage: 90 MB
% 2.56/0.73 % (3841052)Instructions burned: 140 (million)
% 2.56/0.73 % (3841061)lrs+10_1_sil=8000:sp=occurrence:random_seed=181294868:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.56/0.73 % (3841062)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1914675393:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 2.56/0.73 % (3841062)Refutation not found, incomplete strategy
% 2.56/0.73 % (3841062)------------------------------
% 2.56/0.73 % (3841062)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.56/0.73 % (3841062)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.56/0.73 % (3841062)CaDiCaL version: 2.1.3
% 2.56/0.73 % (3841062)Termination reason: Refutation not found, incomplete strategy
% 3.12/0.83 % (3841062)Time elapsed: 0.001 s
% 3.12/0.83 % (3841062)Peak memory usage: 88 MB
% 3.12/0.83 % (3841062)Instructions burned: 1 (million)
% 3.12/0.83 % (3841050)------------------------------
% 3.12/0.83 % (3841050)------------------------------
% 3.12/0.83 % (3841061)First to succeed.
% 3.12/0.83 % (3841061)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3841042"
% 3.12/0.83 % (3841051)------------------------------
% 3.12/0.83 % (3841051)------------------------------
% 3.12/0.83 % (3841065)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2732452380:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.12/0.83 % (3841066)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=3415214483:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.12/0.83 % (3841062)------------------------------
% 3.12/0.83 % (3841062)------------------------------
% 3.12/0.83 % (3841061)Refutation found. Thanks to Tanya!
% 3.12/0.83 % SZS status Theorem for theBenchmark
% 3.12/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 3.12/0.83 % (3841061)------------------------------
% 3.12/0.83 % (3841061)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.12/0.83 % (3841061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.12/0.83 % (3841061)CaDiCaL version: 2.1.3
% 3.12/0.83 % (3841061)Termination reason: Refutation
% 3.12/0.83 % (3841061)Time elapsed: 0.026 s
% 3.12/0.83 % (3841061)Peak memory usage: 89 MB
% 3.12/0.83 % (3841061)Instructions burned: 75 (million)
% 3.12/0.83 % (3841061)------------------------------
% 3.12/0.83 % (3841061)------------------------------
% 3.12/0.83 % (3841042)Success in time 0.417 s
% 3.12/0.83 % Vampire exiting
%------------------------------------------------------------------------------