%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR022+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 : n013.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 6.12s 1.84s
% Output : Refutation 6.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 57 ( 14 unt; 8 def)
% Number of atoms : 249 ( 101 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 293 ( 101 ~; 102 |; 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 : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 110 ( 110 !; 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(f26,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).
fof(f31,axiom,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f48,conjecture,
~ holdsAt(forwards,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_forwards_3) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(forwards,n3),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(forwards,n3),
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(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(f118,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X0,X1) )
& ( sP9(X0,X1)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f131,plain,
holdsAt(forwards,n3),
inference(cnf_transformation,[],[f50]) ).
fof(f143,plain,
! [X2,X0,X1] :
( ~ sP3(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f144,plain,
! [X2,X0,X1] :
( ~ sP4(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f149,plain,
! [X2,X0,X1] :
( sP4(X0,X1,X2)
| pull != X0
| forwards != X1
| happens(push,X2) ),
inference(cnf_transformation,[],[f90]) ).
fof(f153,plain,
! [X2,X0,X1] :
( sP3(X0,X1,X2)
| pull != X0
| forwards != X1
| ~ happens(push,X2) ),
inference(cnf_transformation,[],[f92]) ).
fof(f167,plain,
! [X2,X0,X1] :
( ~ sP5(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
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(f217,plain,
! [X0,X1] :
( sP9(X0,X1)
| pull != X0
| n2 != X1 ),
inference(cnf_transformation,[],[f115]) ).
fof(f224,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f225,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1)
| ~ terminates(X0,X2,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f248,plain,
! [X2,X1] :
( sP4(pull,X1,X2)
| forwards != X1
| happens(push,X2) ),
inference(equality_resolution,[],[f149]) ).
fof(f249,plain,
! [X2] :
( sP4(pull,forwards,X2)
| happens(push,X2) ),
inference(equality_resolution,[],[f248]) ).
fof(f250,plain,
! [X2,X1] :
( sP3(pull,X1,X2)
| forwards != X1
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f153]) ).
fof(f251,plain,
! [X2] :
( sP3(pull,forwards,X2)
| ~ happens(push,X2) ),
inference(equality_resolution,[],[f250]) ).
fof(f269,plain,
! [X1] :
( sP9(pull,X1)
| n2 != X1 ),
inference(equality_resolution,[],[f217]) ).
fof(f270,plain,
sP9(pull,n2),
inference(equality_resolution,[],[f269]) ).
fof(f298,plain,
happens(pull,n2),
inference(resolution,[],[f224,f270]) ).
fof(f402,plain,
! [X0] :
( sP5(pull,forwards,X0)
| ~ happens(push,X0) ),
inference(resolution,[],[f143,f251]) ).
fof(f406,plain,
! [X0] :
( sP5(pull,forwards,X0)
| happens(push,X0) ),
inference(resolution,[],[f144,f249]) ).
fof(f407,plain,
! [X0] : sP5(pull,forwards,X0),
inference(forward_subsumption_resolution,[],[f406,f402]) ).
fof(f508,plain,
! [X2,X0,X1] :
( ~ holdsAt(X1,plus(n1,X0))
| ~ happens(X2,X0)
| ~ terminates(X2,X1,X0) ),
inference(superposition,[],[f225,f206]) ).
fof(f649,plain,
! [X0] : terminates(pull,forwards,X0),
inference(resolution,[],[f407,f167]) ).
fof(f850,plain,
! [X0,X1] :
( ~ terminates(X1,X0,n2)
| ~ happens(X1,n2)
| ~ holdsAt(X0,n3) ),
inference(superposition,[],[f508,f201]) ).
fof(f1120,plain,
( ~ happens(pull,n2)
| ~ holdsAt(forwards,n3) ),
inference(resolution,[],[f850,f649]) ).
fof(f1124,plain,
~ holdsAt(forwards,n3),
inference(forward_subsumption_resolution,[],[f1120,f298]) ).
fof(f1127,plain,
$false,
inference(forward_subsumption_resolution,[],[f1124,f131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : CSR022+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.26 % Computer : n013.cluster.edu
% 0.11/0.26 % Model : x86_64 x86_64
% 0.11/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.26 % Memory : 8046.5625MB
% 0.11/0.26 % OS : Linux 6.8.0-71-generic
% 0.11/0.27 % CPULimit : 300
% 0.11/0.27 % WCLimit : 300
% 0.11/0.27 % DateTime : Mon Sep 28 22:05:06 UTC 2026
% 0.11/0.27 % CPUTime :
% 0.11/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.31 Running first-order theorem proving
% 0.26/0.31 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.68/1.60 % (1637726)Detected formulas, will run a generic FOF schedule.
% 3.68/1.60 % (1637737)dis-21_1_sil=8000:lcm=predicate:random_seed=911799189: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.68/1.60 % (1637737)Instruction limit reached!
% 3.68/1.60 % (1637737)------------------------------
% 3.68/1.60 % (1637737)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.60 % (1637737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.60 % (1637737)CaDiCaL version: 2.1.3
% 3.68/1.60 % (1637737)Termination reason: Instruction limit
% 3.68/1.60 % (1637737)Termination phase: Saturation
% 3.68/1.60 % (1637737)Time elapsed: 0.062 s
% 3.68/1.60 % (1637737)Peak memory usage: 89 MB
% 3.68/1.60 % (1637737)Instructions burned: 131 (million)
% 3.68/1.60 % (1637733)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=2600507972:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.68/1.60 % (1637736)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2799614146:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.68/1.60 % (1637734)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=436305399:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.68/1.60 % (1637735)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=278092330:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.68/1.60 % (1637731)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=1262159977:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.68/1.60 % (1637732)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=2402615558:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.68/1.60 % (1637734)Refutation not found, incomplete strategy
% 3.68/1.60 % (1637734)------------------------------
% 3.68/1.60 % (1637734)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.60 % (1637734)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.60 % (1637734)CaDiCaL version: 2.1.3
% 3.68/1.60 % (1637734)Termination reason: Refutation not found, incomplete strategy
% 3.68/1.60 % (1637734)Time elapsed: 0.003 s
% 3.68/1.60 % (1637734)Peak memory usage: 88 MB
% 3.68/1.60 % (1637734)Instructions burned: 1 (million)
% 3.68/1.60 % (1637735)Refutation not found, incomplete strategy
% 3.68/1.60 % (1637735)------------------------------
% 3.68/1.60 % (1637735)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.60 % (1637735)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.60 % (1637735)CaDiCaL version: 2.1.3
% 3.68/1.60 % (1637735)Termination reason: Refutation not found, incomplete strategy
% 3.68/1.60 % (1637735)Time elapsed: 0.012 s
% 3.68/1.60 % (1637735)Peak memory usage: 88 MB
% 3.68/1.60 % (1637735)Instructions burned: 10 (million)
% 3.68/1.60 % (1637736)Instruction limit reached!
% 3.68/1.60 % (1637736)------------------------------
% 3.68/1.60 % (1637736)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.68/1.60 % (1637736)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.68/1.60 % (1637736)CaDiCaL version: 2.1.3
% 3.68/1.60 % (1637736)Termination reason: Instruction limit
% 3.68/1.60 % (1637736)Termination phase: Saturation
% 3.68/1.60 % (1637736)Time elapsed: 0.145 s
% 3.68/1.60 % (1637736)Peak memory usage: 90 MB
% 3.68/1.60 % (1637736)Instructions burned: 139 (million)
% 3.68/1.60 % (1637739)lrs+10_1_sil=8000:sp=occurrence:random_seed=934440481:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.68/1.60 % (1637739)First to succeed.
% 3.68/1.60 % (1637739)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1637726"
% 3.68/1.60 % (1637734)------------------------------
% 3.68/1.60 % (1637734)------------------------------
% 3.68/1.60 % (1637735)------------------------------
% 3.68/1.60 % (1637735)------------------------------
% 3.68/1.60 % (1637746)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2624584019:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 3.68/1.60 % (1637746)Refutation not found, incomplete strategy
% 3.68/1.60 % (1637746)------------------------------
% 3.68/1.60 % (1637746)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.12/1.84 % (1637746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.12/1.84 % (1637746)CaDiCaL version: 2.1.3
% 6.12/1.84 % (1637746)Termination reason: Refutation not found, incomplete strategy
% 6.12/1.84 % (1637746)Time elapsed: 0.003 s
% 6.12/1.84 % (1637746)Peak memory usage: 88 MB
% 6.12/1.84 % (1637746)Instructions burned: 1 (million)
% 6.12/1.84 % (1637739)Refutation found. Thanks to Tanya!
% 6.12/1.84 % SZS status Theorem for theBenchmark
% 6.12/1.84 % SZS output start Proof for theBenchmark
% See solution above
% 6.12/1.84 % (1637739)------------------------------
% 6.12/1.84 % (1637739)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.12/1.84 % (1637739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.12/1.84 % (1637739)CaDiCaL version: 2.1.3
% 6.12/1.84 % (1637739)Termination reason: Refutation
% 6.12/1.84 % (1637739)Time elapsed: 0.024 s
% 6.12/1.84 % (1637739)Peak memory usage: 89 MB
% 6.12/1.84 % (1637739)Instructions burned: 31 (million)
% 6.12/1.84 % (1637739)------------------------------
% 6.12/1.84 % (1637739)------------------------------
% 6.12/1.84 % (1637726)Success in time 0.737 s
% 6.12/1.84 % Vampire exiting
%------------------------------------------------------------------------------