%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC420+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 01:03:54 PM UTC 2026
% Result : Theorem 3.18s 1.05s
% Output : Refutation 3.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 9
% Syntax : Number of formulae : 62 ( 11 unt; 0 def)
% Number of atoms : 256 ( 90 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 336 ( 142 ~; 132 |; 43 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 104 ( 84 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) != X2
& app(cons(X7,nil),X8) = X3 ) )
| ( nil != X2
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) != X2
& app(cons(X7,nil),X8) = X3 ) )
| ( nil != X2
& nil = X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) = X2
| app(cons(X7,nil),X8) != X3 ) )
& ( nil = X2
| nil != X3 ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f100,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f101,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f100]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f106,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f114,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f116,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
( ssList(sK3)
& sK1 = sK3
& sK0 = sK2
& neq(sK1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK1
| app(app(X6,cons(X4,nil)),X5) != sK0 ) ) )
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) = sK2
| app(cons(X7,nil),X8) != sK3 ) )
& ( nil = sK2
| nil != sK3 )
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f98]) ).
fof(f121,plain,
! [X0] :
( nil = X0
| ( ssList(sK6(X0))
& ssItem(sK7(X0))
& cons(sK7(X0),sK6(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X1,sK6(X0)),skolemize(X2,sK7(X0))],[f101]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f117]) ).
fof(f130,plain,
! [X8,X7] :
( app(cons(X7,nil),X8) != sK3
| ~ ssList(X8)
| app(X8,cons(X7,nil)) = sK2
| ~ ssItem(X7) ),
inference(cnf_transformation,[],[f119]) ).
fof(f131,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK1
| app(app(X6,cons(X4,nil)),X5) != sK0 ),
inference(cnf_transformation,[],[f119]) ).
fof(f132,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f119]) ).
fof(f133,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f119]) ).
fof(f134,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f119]) ).
fof(f135,plain,
ssList(sK3),
inference(cnf_transformation,[],[f119]) ).
fof(f140,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f141,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f142,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f146,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f147,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f152,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f155,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f157,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f158,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f162,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f163,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f132,f134]) ).
fof(f164,plain,
! [X6,X4,X5] :
( app(app(X6,cons(X4,nil)),X5) != sK2
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK3
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f131,f134,f133]) ).
fof(f169,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f158]) ).
fof(f172,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f169]) ).
fof(f175,plain,
! [X0,X1] :
( sK2 != app(X0,cons(X1,nil))
| ~ ssList(nil)
| ~ ssList(X0)
| sK3 != app(app(nil,cons(X1,nil)),X0)
| ~ ssItem(X1)
| ~ ssList(app(X0,cons(X1,nil))) ),
inference(superposition,[],[f164,f147]) ).
fof(f176,plain,
! [X0,X1] :
( sK3 != app(app(nil,cons(X1,nil)),X0)
| ~ ssList(X0)
| sK2 != app(X0,cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(app(X0,cons(X1,nil))) ),
inference(forward_subsumption_resolution,[],[f175,f162]) ).
fof(f186,plain,
! [X0,X1] :
( sK3 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| sK2 != app(X1,cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(app(X1,cons(X0,nil)))
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f176,f155]) ).
fof(f190,plain,
! [X0,X1] :
( sK3 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(app(X1,cons(X0,nil)))
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f186,f130]) ).
fof(f223,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(app(X1,cons(X0,nil)))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f190,f152]) ).
fof(f241,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(app(X1,cons(X0,nil)))
| ~ ssList(cons(X0,nil)) ),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f242,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(forward_subsumption_resolution,[],[f241,f157]) ).
fof(f261,plain,
! [X0] :
( sK3 != X0
| ~ ssList(sK6(X0))
| ~ ssItem(sK7(X0))
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f242,f140]) ).
fof(f262,plain,
! [X0] :
( sK3 != X0
| ~ ssItem(sK7(X0))
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f261,f142]) ).
fof(f263,plain,
! [X0] :
( sK3 != X0
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f262,f141]) ).
fof(f282,plain,
( ~ ssList(cons(sK7(sK3),nil))
| nil = sK3
| ~ ssList(sK3) ),
inference(equality_resolution,[],[f263]) ).
fof(f283,plain,
( ~ ssList(cons(sK7(sK3),nil))
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f282,f135]) ).
fof(f284,plain,
( nil = sK3
| ~ ssItem(sK7(sK3))
| ~ ssList(nil) ),
inference(resolution,[],[f283,f146]) ).
fof(f285,plain,
( ~ ssItem(sK7(sK3))
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f284,f162]) ).
fof(f341,plain,
( nil = sK3
| nil = sK3
| ~ ssList(sK3) ),
inference(resolution,[],[f285,f141]) ).
fof(f342,plain,
( nil = sK3
| ~ ssList(sK3) ),
inference(duplicate_literal_removal,[],[f341]) ).
fof(f343,plain,
nil = sK3,
inference(forward_subsumption_resolution,[],[f342,f135]) ).
fof(f410,plain,
neq(sK3,sK3),
inference(superposition,[],[f163,f343]) ).
fof(f424,plain,
~ ssList(sK3),
inference(resolution,[],[f410,f172]) ).
fof(f426,plain,
$false,
inference(forward_subsumption_resolution,[],[f424,f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC420+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.16 % Computer : n003.cluster.edu
% 0.08/0.16 % Model : x86_64 x86_64
% 0.08/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16 % Memory : 8046.5625MB
% 0.08/0.16 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Mon Sep 28 09:35:42 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20 Running first-order theorem proving
% 0.08/0.20 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.18/1.05 % (1463349)Detected formulas, will run a generic FOF schedule.
% 3.18/1.05 % (1463354)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=4094333523:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.18/1.05 % (1463359)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4151031581:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.18/1.05 % (1463357)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4112667530:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.18/1.05 % (1463356)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=2870796565:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.18/1.05 % (1463355)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=116090185:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.18/1.05 % (1463358)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3923437843:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.18/1.05 % (1463358)First to succeed.
% 3.18/1.05 % (1463360)dis-21_1_sil=8000:lcm=predicate:random_seed=719302978: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.18/1.05 % (1463358)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1463349"
% 3.18/1.05 % (1463357)Instruction limit reached!
% 3.18/1.05 % (1463357)------------------------------
% 3.18/1.05 % (1463357)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.05 % (1463357)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.05 % (1463357)CaDiCaL version: 2.1.3
% 3.18/1.05 % (1463357)Termination reason: Instruction limit
% 3.18/1.05 % (1463357)Termination phase: Saturation
% 3.18/1.05 % (1463357)Time elapsed: 0.068 s
% 3.18/1.05 % (1463357)Peak memory usage: 89 MB
% 3.18/1.05 % (1463357)Instructions burned: 111 (million)
% 3.18/1.05 % (1463360)Instruction limit reached!
% 3.18/1.05 % (1463360)------------------------------
% 3.18/1.05 % (1463360)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.05 % (1463360)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.05 % (1463360)CaDiCaL version: 2.1.3
% 3.18/1.05 % (1463360)Termination reason: Instruction limit
% 3.18/1.05 % (1463360)Termination phase: Saturation
% 3.18/1.05 % (1463360)Time elapsed: 0.075 s
% 3.18/1.05 % (1463360)Peak memory usage: 90 MB
% 3.18/1.05 % (1463360)Instructions burned: 129 (million)
% 3.18/1.05 % (1463359)Instruction limit reached!
% 3.18/1.05 % (1463359)------------------------------
% 3.18/1.05 % (1463359)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.18/1.05 % (1463359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.18/1.05 % (1463359)CaDiCaL version: 2.1.3
% 3.18/1.05 % (1463359)Termination reason: Instruction limit
% 3.18/1.05 % (1463359)Termination phase: Saturation
% 3.18/1.05 % (1463359)Time elapsed: 0.115 s
% 3.18/1.05 % (1463359)Peak memory usage: 90 MB
% 3.18/1.05 % (1463359)Instructions burned: 139 (million)
% 3.18/1.05 % (1463368)lrs+10_1_sil=8000:sp=occurrence:random_seed=2881324708:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.18/1.05 % (1463369)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1779627083:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.18/1.05 % (1463370)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1617776532:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.18/1.05 % (1463358)Refutation found. Thanks to Tanya!
% 3.18/1.05 % SZS status Theorem for theBenchmark
% 3.18/1.05 % SZS output start Proof for theBenchmark
% See solution above
% 3.52/1.25 % (1463358)------------------------------
% 3.52/1.25 % (1463358)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.52/1.25 % (1463358)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.52/1.25 % (1463358)CaDiCaL version: 2.1.3
% 3.52/1.25 % (1463358)Termination reason: Refutation
% 3.52/1.25 % (1463358)Time elapsed: 0.008 s
% 3.52/1.25 % (1463358)Peak memory usage: 88 MB
% 3.52/1.25 % (1463358)Instructions burned: 12 (million)
% 3.52/1.25 % (1463358)------------------------------
% 3.52/1.25 % (1463358)------------------------------
% 3.52/1.25 % (1463349)Success in time 0.413 s
% 3.52/1.25 % Vampire exiting
%------------------------------------------------------------------------------