%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n019.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:58 AM UTC 2026
% Result : Theorem 5.19s 1.65s
% Output : Refutation 5.19s
% 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/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',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(f70,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(flattening,[],[f70]) ).
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 = push
& X1 = spinning
& ~ happens(pull,X2) ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f76,definition,
! [X0,X1,X2] :
( sP2(X0,X1,X2)
<=> ( X0 = pull
& X1 = backwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f77,definition,
! [X0,X1,X2] :
( sP3(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP3])],[predicate_definition_introduction]) ).
fof(f78,definition,
! [X0,X1,X2] :
( sP4(X0,X1,X2)
<=> ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) ) ),
introduced(definition,[new_symbols(definition,[sP4])],[predicate_definition_introduction]) ).
fof(f79,definition,
! [X0,X1,X2] :
( sP5(X0,X1,X2)
<=> ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| sP1(X0,X1,X2)
| sP0(X0,X1,X2) ) ),
introduced(definition,[new_symbols(definition,[sP5])],[predicate_definition_introduction]) ).
fof(f80,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP5(X0,X1,X2) ),
inference(definition_folding,[],[f14,f79,f78,f77,f76,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(f87,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ~ sP0(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| sP1(X0,X1,X2)
| sP0(X0,X1,X2)
| ~ sP5(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f79]) ).
fof(f88,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| ( ( push != X0
| backwards != X1
| happens(pull,X2) )
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ~ sP0(X0,X1,X2) ) )
& ( ( X0 = push
& X1 = backwards
& ~ happens(pull,X2) )
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| sP1(X0,X1,X2)
| sP0(X0,X1,X2)
| ~ sP5(X0,X1,X2) ) ),
inference(flattening,[],[f87]) ).
fof(f89,plain,
! [X0,X1,X2] :
( ( sP4(X0,X1,X2)
| pull != X0
| forwards != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) )
| ~ sP4(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ( sP4(X0,X1,X2)
| pull != X0
| forwards != X1
| happens(push,X2) )
& ( ( X0 = pull
& X1 = forwards
& ~ happens(push,X2) )
| ~ sP4(X0,X1,X2) ) ),
inference(flattening,[],[f89]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ( sP3(X0,X1,X2)
| pull != X0
| forwards != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = forwards
& happens(push,X2) )
| ~ sP3(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f77]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( sP3(X0,X1,X2)
| pull != X0
| forwards != X1
| ~ happens(push,X2) )
& ( ( X0 = pull
& X1 = forwards
& happens(push,X2) )
| ~ sP3(X0,X1,X2) ) ),
inference(flattening,[],[f91]) ).
fof(f99,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP5(X0,X1,X2) )
& ( sP5(X0,X1,X2)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f80]) ).
fof(f113,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(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(flattening,[],[f113]) ).
fof(f117,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X0,X1) )
& ( sP9(X0,X1)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f125,plain,
holdsAt(forwards,n2),
inference(cnf_transformation,[],[f50]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ sP3(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f138,plain,
! [X2,X0,X1] :
( ~ sP4(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f143,plain,
! [X2,X0,X1] :
( sP4(X0,X1,X2)
| pull != X0
| forwards != X1
| happens(push,X2) ),
inference(cnf_transformation,[],[f90]) ).
fof(f147,plain,
! [X2,X0,X1] :
( sP3(X0,X1,X2)
| pull != X0
| forwards != X1
| ~ happens(push,X2) ),
inference(cnf_transformation,[],[f92]) ).
fof(f161,plain,
! [X2,X0,X1] :
( ~ sP5(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f190,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f207,plain,
! [X0,X1] :
( sP9(X0,X1)
| pull != X0
| n1 != X1 ),
inference(cnf_transformation,[],[f114]) ).
fof(f213,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f214,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f224,plain,
! [X2,X1] :
( sP4(pull,X1,X2)
| forwards != X1
| happens(push,X2) ),
inference(equality_resolution,[],[f143]) ).
fof(f225,plain,
! [X2] :
( sP4(pull,forwards,X2)
| happens(push,X2) ),
inference(equality_resolution,[],[f224]) ).
fof(f226,plain,
! [X2,X1] :
( sP3(pull,X1,X2)
| forwards != X1
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f147]) ).
fof(f227,plain,
! [X2] :
( sP3(pull,forwards,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f226]) ).
fof(f243,plain,
! [X1] :
( sP9(pull,X1)
| n1 != X1 ),
inference(equality_resolution,[],[f207]) ).
fof(f244,plain,
sP9(pull,n1),
inference(equality_resolution,[],[f243]) ).
fof(f270,plain,
happens(pull,n1),
inference(resolution,[],[f213,f244]) ).
fof(f309,plain,
! [X0] :
( sP5(pull,forwards,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f137,f227]) ).
fof(f310,plain,
! [X0] :
( sP5(pull,forwards,X0)
| happens(push,X0) ),
inference(resolution,[],[f138,f225]) ).
fof(f311,plain,
! [X0] : sP5(pull,forwards,X0),
inference(forward_subsumption_resolution,[],[f310,f309]) ).
fof(f316,plain,
! [X0] : terminates(pull,forwards,X0),
inference(resolution,[],[f161,f311]) ).
fof(f363,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n1)
| ~ happens(X1,n1)
| ~ holdsAt(X0,n2) ),
inference(superposition,[],[f214,f190]) ).
fof(f547,plain,
( ~ happens(pull,n1)
| ~ holdsAt(forwards,n2) ),
inference(resolution,[],[f363,f316]) ).
fof(f556,plain,
~ holdsAt(forwards,n2),
inference(forward_subsumption_resolution,[],[f547,f270]) ).
fof(f573,plain,
$false,
inference(forward_subsumption_resolution,[],[f556,f125]) ).
%------------------------------------------------------------------------------
%----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 THM
% 0.08/0.18 % Computer : n019.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:05:48 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.66/1.46 % (326575)Detected formulas, will run a generic FOF schedule.
% 3.66/1.46 % (326599)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=2250976150:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.66/1.46 % (326604)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1111685893:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.66/1.46 % (326601)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=2845327656:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.66/1.46 % (326602)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1921700126:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.66/1.46 % (326603)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1987776617:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.66/1.46 % (326602)Refutation not found, incomplete strategy
% 3.66/1.46 % (326602)------------------------------
% 3.66/1.46 % (326602)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.46 % (326602)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.46 % (326602)CaDiCaL version: 2.1.3
% 3.66/1.46 % (326602)Termination reason: Refutation not found, incomplete strategy
% 3.66/1.46 % (326602)Time elapsed: 0.002 s
% 3.66/1.46 % (326602)Peak memory usage: 88 MB
% 3.66/1.46 % (326602)Instructions burned: 1 (million)
% 3.66/1.46 % (326603)Refutation not found, incomplete strategy
% 3.66/1.46 % (326603)------------------------------
% 3.66/1.46 % (326603)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.46 % (326603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.46 % (326603)CaDiCaL version: 2.1.3
% 3.66/1.46 % (326603)Termination reason: Refutation not found, incomplete strategy
% 3.66/1.46 % (326603)Time elapsed: 0.005 s
% 3.66/1.46 % (326603)Peak memory usage: 88 MB
% 3.66/1.46 % (326603)Instructions burned: 6 (million)
% 3.66/1.46 % (326605)dis-21_1_sil=8000:lcm=predicate:random_seed=3876040374: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)
% 3.66/1.46 % (326600)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=884285272:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.66/1.46 % (326605)Instruction limit reached!
% 3.66/1.46 % (326605)------------------------------
% 3.66/1.46 % (326605)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.46 % (326605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.46 % (326605)CaDiCaL version: 2.1.3
% 3.66/1.46 % (326605)Termination reason: Instruction limit
% 3.66/1.46 % (326605)Termination phase: Saturation
% 3.66/1.46 % (326605)Time elapsed: 0.071 s
% 3.66/1.46 % (326605)Peak memory usage: 89 MB
% 3.66/1.46 % (326605)Instructions burned: 129 (million)
% 3.66/1.46 % (326604)Instruction limit reached!
% 3.66/1.46 % (326604)------------------------------
% 3.66/1.46 % (326604)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.46 % (326604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.46 % (326604)CaDiCaL version: 2.1.3
% 3.66/1.46 % (326604)Termination reason: Instruction limit
% 3.66/1.46 % (326604)Termination phase: Saturation
% 3.66/1.46 % (326604)Time elapsed: 0.095 s
% 3.66/1.46 % (326604)Peak memory usage: 90 MB
% 3.66/1.46 % (326604)Instructions burned: 140 (million)
% 3.66/1.46 % (326613)lrs+10_1_sil=8000:sp=occurrence:random_seed=19262603:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.66/1.46 % (326613)First to succeed.
% 3.66/1.46 % (326613)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-326575"
% 3.66/1.46 % (326614)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1776225639:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.66/1.46 % (326614)Refutation not found, incomplete strategy
% 3.66/1.46 % (326614)------------------------------
% 3.66/1.46 % (326614)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.66/1.46 % (326614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.66/1.46 % (326614)CaDiCaL version: 2.1.3
% 5.19/1.65 % (326614)Termination reason: Refutation not found, incomplete strategy
% 5.19/1.65 % (326614)Time elapsed: 0.001 s
% 5.19/1.65 % (326614)Peak memory usage: 88 MB
% 5.19/1.65 % (326614)Instructions burned: 1 (million)
% 5.19/1.65 % (326602)------------------------------
% 5.19/1.65 % (326602)------------------------------
% 5.19/1.65 % (326603)------------------------------
% 5.19/1.65 % (326603)------------------------------
% 5.19/1.65 % (326619)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=3671688018:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 5.19/1.65 % (326618)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1982300435:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 5.19/1.65 % (326618)Also succeeded, but the first one will report.
% 5.19/1.65 % (326619)Also succeeded, but the first one will report.
% 5.19/1.65 % (326599)Also succeeded, but the first one will report.
% 5.19/1.65 % (326614)------------------------------
% 5.19/1.65 % (326614)------------------------------
% 5.19/1.65 % (326613)Refutation found. Thanks to Tanya!
% 5.19/1.65 % SZS status Theorem for theBenchmark
% 5.19/1.65 % SZS output start Proof for theBenchmark
% See solution above
% 5.19/1.65 % (326613)------------------------------
% 5.19/1.65 % (326613)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.19/1.65 % (326613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.19/1.65 % (326613)CaDiCaL version: 2.1.3
% 5.19/1.65 % (326613)Termination reason: Refutation
% 5.19/1.65 % (326613)Time elapsed: 0.011 s
% 5.19/1.65 % (326613)Peak memory usage: 89 MB
% 5.19/1.65 % (326613)Instructions burned: 14 (million)
% 5.19/1.65 % (326613)------------------------------
% 5.19/1.65 % (326613)------------------------------
% 5.19/1.65 % (326575)Success in time 0.63 s
% 5.19/1.65 % Vampire exiting
%------------------------------------------------------------------------------