%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWX221+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:46:13 PM UTC 2026
% Result : Theorem 3.53s 1.26s
% Output : Refutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 11
% Syntax : Number of formulae : 60 ( 18 unt; 0 def)
% Number of atoms : 144 ( 33 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 159 ( 75 ~; 59 |; 16 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 143 ( 141 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0,X1,X2,X3] : app(X0,X1,X2) != lam(X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_021) ).
fof(f23,axiom,
! [X0,X1] : lam(X0) != var(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_023) ).
fof(f24,axiom,
! [X0,X1,X2] :
( X0 != lam(proj1Lam(X0))
=> ( nf(app(X0,X1,X2))
<=> ( nf(X0)
& nf(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_024) ).
fof(f26,axiom,
! [X0] :
( nf(lam(X0))
<=> nf(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_026) ).
fof(f27,axiom,
! [X0] : nf(var(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_027) ).
fof(f29,axiom,
! [X0,X1] : index(cons(X0,X1),zero) = just(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_029) ).
fof(f30,axiom,
! [X0,X1,X2] : index(cons(X0,X1),suc(X2)) = index(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_030) ).
fof(f31,axiom,
! [X0,X1,X2,X3,X4] :
( tc(X0,app(X2,X3,X4),X1)
<=> ( tc(X0,X2,arr(X4,X1))
& tc(X0,X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_031) ).
fof(f33,axiom,
! [X0,X1,X2,X3] :
( tc(X0,lam(X1),arr(X2,X3))
<=> tc(cons(X2,X0),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_033) ).
fof(f35,axiom,
! [X0,X1,X2,X3] :
( index(X0,X2) = just(X3)
=> ( tc(X0,var(X2),X1)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_035) ).
fof(f36,conjecture,
? [X0] :
( nf(X0)
& tc(nil,X0,arr(arr(a,arr(b,c)),arr(b,arr(a,c)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_036) ).
fof(f37,negated_conjecture,
~ ? [X0] :
( nf(X0)
& tc(nil,X0,arr(arr(a,arr(b,c)),arr(b,arr(a,c)))) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f38,plain,
! [X0] :
( ~ nf(X0)
| ~ tc(nil,X0,arr(arr(a,arr(b,c)),arr(b,arr(a,c)))) ),
inference(ennf_transformation,[],[f37]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( nf(app(X0,X1,X2))
<=> ( nf(X0)
& nf(X1) ) )
| lam(proj1Lam(X0)) = X0 ),
inference(ennf_transformation,[],[f24]) ).
fof(f40,plain,
! [X0,X1,X2,X3] :
( ( tc(X0,var(X2),X1)
<=> X3 = X1 )
| index(X0,X2) != just(X3) ),
inference(ennf_transformation,[],[f35]) ).
fof(f43,plain,
! [X0] :
( ( nf(lam(X0))
| ~ nf(X0) )
& ( nf(X0)
| ~ nf(lam(X0)) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( ( nf(app(X0,X1,X2))
| ~ nf(X0)
| ~ nf(X1) )
& ( ( nf(X0)
& nf(X1) )
| ~ nf(app(X0,X1,X2)) ) )
| lam(proj1Lam(X0)) = X0 ),
inference(nnf_transformation,[],[f39]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( ( nf(app(X0,X1,X2))
| ~ nf(X0)
| ~ nf(X1) )
& ( ( nf(X0)
& nf(X1) )
| ~ nf(app(X0,X1,X2)) ) )
| lam(proj1Lam(X0)) = X0 ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1,X2,X3] :
( ( ( tc(X0,var(X2),X1)
| X1 != X3 )
& ( X3 = X1
| ~ tc(X0,var(X2),X1) ) )
| index(X0,X2) != just(X3) ),
inference(nnf_transformation,[],[f40]) ).
fof(f47,plain,
! [X0,X1,X2,X3] :
( ( tc(X0,lam(X1),arr(X2,X3))
| ~ tc(cons(X2,X0),X1,X3) )
& ( tc(cons(X2,X0),X1,X3)
| ~ tc(X0,lam(X1),arr(X2,X3)) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f48,plain,
! [X0,X1,X2,X3,X4] :
( ( tc(X0,app(X2,X3,X4),X1)
| ~ tc(X0,X2,arr(X4,X1))
| ~ tc(X0,X3,X4) )
& ( ( tc(X0,X2,arr(X4,X1))
& tc(X0,X3,X4) )
| ~ tc(X0,app(X2,X3,X4),X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f49,plain,
! [X0,X1,X2,X3,X4] :
( ( tc(X0,app(X2,X3,X4),X1)
| ~ tc(X0,X2,arr(X4,X1))
| ~ tc(X0,X3,X4) )
& ( ( tc(X0,X2,arr(X4,X1))
& tc(X0,X3,X4) )
| ~ tc(X0,app(X2,X3,X4),X1) ) ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0] :
( ~ tc(nil,X0,arr(arr(a,arr(b,c)),arr(b,arr(a,c))))
| ~ nf(X0) ),
inference(cnf_transformation,[],[f38]) ).
fof(f51,plain,
! [X0] : nf(var(X0)),
inference(cnf_transformation,[],[f27]) ).
fof(f53,plain,
! [X0] :
( nf(lam(X0))
| ~ nf(X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f57,plain,
! [X2,X0,X1] :
( nf(app(X0,X1,X2))
| ~ nf(X0)
| ~ nf(X1)
| lam(proj1Lam(X0)) = X0 ),
inference(cnf_transformation,[],[f45]) ).
fof(f59,plain,
! [X2,X3,X0,X1] :
( tc(X0,var(X2),X1)
| X1 != X3
| index(X0,X2) != just(X3) ),
inference(cnf_transformation,[],[f46]) ).
fof(f62,plain,
! [X2,X3,X0,X1] :
( tc(X0,lam(X1),arr(X2,X3))
| ~ tc(cons(X2,X0),X1,X3) ),
inference(cnf_transformation,[],[f47]) ).
fof(f66,plain,
! [X2,X3,X0,X1,X4] :
( tc(X0,app(X2,X3,X4),X1)
| ~ tc(X0,X2,arr(X4,X1))
| ~ tc(X0,X3,X4) ),
inference(cnf_transformation,[],[f49]) ).
fof(f75,plain,
! [X0,X1] : lam(X0) != var(X1),
inference(cnf_transformation,[],[f23]) ).
fof(f78,plain,
! [X2,X3,X0,X1] : app(X0,X1,X2) != lam(X3),
inference(cnf_transformation,[],[f21]) ).
fof(f83,plain,
! [X0,X1] : just(X0) = index(cons(X0,X1),zero),
inference(cnf_transformation,[],[f29]) ).
fof(f86,plain,
! [X2,X0,X1] : index(cons(X0,X1),suc(X2)) = index(X1,X2),
inference(cnf_transformation,[],[f30]) ).
fof(f93,plain,
! [X2,X3,X0] :
( index(X0,X2) != just(X3)
| tc(X0,var(X2),X3) ),
inference(equality_resolution,[],[f59]) ).
fof(f100,plain,
! [X2,X0,X1] :
( just(X0) != just(X2)
| tc(cons(X0,X1),var(zero),X2) ),
inference(superposition,[],[f93,f83]) ).
fof(f101,plain,
! [X2,X3,X0,X1] :
( just(X3) != index(X0,X1)
| tc(cons(X2,X0),var(suc(X1)),X3) ),
inference(superposition,[],[f93,f86]) ).
fof(f102,plain,
! [X0,X1] : tc(cons(X0,X1),var(zero),X0),
inference(equality_resolution,[],[f100]) ).
fof(f103,plain,
! [X0] :
( ~ tc(cons(arr(a,arr(b,c)),nil),X0,arr(b,arr(a,c)))
| ~ nf(lam(X0)) ),
inference(resolution,[],[f62,f50]) ).
fof(f107,plain,
! [X0] :
( ~ tc(cons(b,cons(arr(a,arr(b,c)),nil)),X0,arr(a,c))
| ~ nf(lam(lam(X0))) ),
inference(resolution,[],[f103,f62]) ).
fof(f108,plain,
! [X0] :
( ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X0,c)
| ~ nf(lam(lam(lam(X0)))) ),
inference(resolution,[],[f107,f62]) ).
fof(f126,plain,
! [X2,X0,X1] :
( ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X0,arr(X1,c))
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X2,X1)
| ~ nf(lam(lam(lam(app(X0,X2,X1))))) ),
inference(resolution,[],[f66,f108]) ).
fof(f130,plain,
! [X2,X3,X0,X1] :
( just(X0) != just(X1)
| tc(cons(X3,cons(X0,X2)),var(suc(zero)),X1) ),
inference(superposition,[],[f101,f83]) ).
fof(f131,plain,
! [X2,X3,X0,X1,X4] :
( index(X0,X1) != just(X2)
| tc(cons(X4,cons(X3,X0)),var(suc(suc(X1))),X2) ),
inference(superposition,[],[f101,f86]) ).
fof(f151,plain,
! [X2,X0,X1] : tc(cons(X0,cons(X1,X2)),var(suc(zero)),X1),
inference(equality_resolution,[],[f130]) ).
fof(f162,plain,
! [X2,X3,X0,X1,X4] :
( just(X0) != just(X2)
| tc(cons(X3,cons(X4,cons(X0,X1))),var(suc(suc(zero))),X2) ),
inference(superposition,[],[f131,f83]) ).
fof(f190,plain,
! [X2,X3,X0,X1] : tc(cons(X0,cons(X1,cons(X2,X3))),var(suc(suc(zero))),X2),
inference(equality_resolution,[],[f162]) ).
fof(f205,plain,
! [X2,X3,X0,X1,X4] :
( ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X2,arr(X4,arr(X1,c)))
| ~ nf(lam(lam(lam(app(app(X2,X3,X4),X0,X1)))))
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X0,X1)
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X3,X4) ),
inference(resolution,[],[f126,f66]) ).
fof(f329,plain,
! [X0,X1] :
( ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1,b)
| ~ nf(lam(lam(lam(app(app(var(suc(suc(zero))),X0,a),X1,b)))))
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X0,a) ),
inference(resolution,[],[f205,f190]) ).
fof(f332,plain,
! [X0] :
( ~ nf(lam(lam(lam(app(app(var(suc(suc(zero))),X0,a),var(suc(zero)),b)))))
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X0,a) ),
inference(resolution,[],[f329,f151]) ).
fof(f337,plain,
! [X0] :
( ~ nf(lam(lam(app(app(var(suc(suc(zero))),X0,a),var(suc(zero)),b))))
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X0,a) ),
inference(resolution,[],[f332,f53]) ).
fof(f340,plain,
! [X0] :
( ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X0,a)
| ~ nf(lam(app(app(var(suc(suc(zero))),X0,a),var(suc(zero)),b))) ),
inference(resolution,[],[f337,f53]) ).
fof(f344,plain,
~ nf(lam(app(app(var(suc(suc(zero))),var(zero),a),var(suc(zero)),b))),
inference(resolution,[],[f340,f102]) ).
fof(f349,plain,
~ nf(app(app(var(suc(suc(zero))),var(zero),a),var(suc(zero)),b)),
inference(resolution,[],[f344,f53]) ).
fof(f353,plain,
( ~ nf(app(var(suc(suc(zero))),var(zero),a))
| ~ nf(var(suc(zero)))
| app(var(suc(suc(zero))),var(zero),a) = lam(proj1Lam(app(var(suc(suc(zero))),var(zero),a))) ),
inference(resolution,[],[f349,f57]) ).
fof(f354,plain,
( ~ nf(app(var(suc(suc(zero))),var(zero),a))
| app(var(suc(suc(zero))),var(zero),a) = lam(proj1Lam(app(var(suc(suc(zero))),var(zero),a))) ),
inference(forward_subsumption_resolution,[],[f353,f51]) ).
fof(f355,plain,
~ nf(app(var(suc(suc(zero))),var(zero),a)),
inference(forward_subsumption_resolution,[],[f354,f78]) ).
fof(f357,plain,
( ~ nf(var(suc(suc(zero))))
| ~ nf(var(zero))
| var(suc(suc(zero))) = lam(proj1Lam(var(suc(suc(zero))))) ),
inference(resolution,[],[f355,f57]) ).
fof(f358,plain,
( ~ nf(var(suc(suc(zero))))
| var(suc(suc(zero))) = lam(proj1Lam(var(suc(suc(zero))))) ),
inference(forward_subsumption_resolution,[],[f357,f51]) ).
fof(f359,plain,
var(suc(suc(zero))) = lam(proj1Lam(var(suc(suc(zero))))),
inference(forward_subsumption_resolution,[],[f358,f51]) ).
fof(f360,plain,
$false,
inference(forward_subsumption_resolution,[],[f359,f75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX221+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n002.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 15:15:22 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 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
% 3.09/1.06 % (436380)Detected formulas, will run a generic FOF schedule.
% 3.09/1.06 % (436438)dis-21_1_sil=8000:lcm=predicate:random_seed=573357354: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.09/1.06 % (436432)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=1268267448:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.09/1.06 % (436433)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=1511001015:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.09/1.06 % (436435)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=524287585:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.09/1.06 % (436434)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=1386802635:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.09/1.06 % (436438)Instruction limit reached!
% 3.09/1.06 % (436438)------------------------------
% 3.09/1.06 % (436438)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.06 % (436438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.06 % (436438)CaDiCaL version: 2.1.3
% 3.09/1.06 % (436438)Termination reason: Instruction limit
% 3.09/1.06 % (436438)Termination phase: Saturation
% 3.09/1.06 % (436438)Time elapsed: 0.045 s
% 3.09/1.06 % (436438)Peak memory usage: 89 MB
% 3.09/1.06 % (436438)Instructions burned: 132 (million)
% 3.09/1.06 % (436436)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2658801651:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.09/1.06 % (436437)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3271772189:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.09/1.06 % (436435)Instruction limit reached!
% 3.09/1.06 % (436435)------------------------------
% 3.09/1.06 % (436435)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.06 % (436435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.06 % (436435)CaDiCaL version: 2.1.3
% 3.09/1.06 % (436435)Termination reason: Instruction limit
% 3.09/1.06 % (436435)Termination phase: Saturation
% 3.09/1.06 % (436435)Time elapsed: 0.067 s
% 3.09/1.06 % (436435)Peak memory usage: 89 MB
% 3.09/1.06 % (436435)Instructions burned: 110 (million)
% 3.09/1.06 % (436436)Instruction limit reached!
% 3.09/1.06 % (436436)------------------------------
% 3.09/1.06 % (436436)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.06 % (436436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.06 % (436436)CaDiCaL version: 2.1.3
% 3.09/1.06 % (436436)Termination reason: Instruction limit
% 3.09/1.06 % (436436)Termination phase: Saturation
% 3.09/1.06 % (436436)Time elapsed: 0.069 s
% 3.09/1.06 % (436436)Peak memory usage: 88 MB
% 3.09/1.06 % (436436)Instructions burned: 120 (million)
% 3.09/1.06 % (436444)lrs+10_1_sil=8000:sp=occurrence:random_seed=1767575713:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.09/1.06 % (436437)Instruction limit reached!
% 3.09/1.06 % (436437)------------------------------
% 3.09/1.06 % (436437)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.06 % (436437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.06 % (436437)CaDiCaL version: 2.1.3
% 3.09/1.06 % (436437)Termination reason: Instruction limit
% 3.09/1.06 % (436437)Termination phase: Saturation
% 3.09/1.06 % (436437)Time elapsed: 0.087 s
% 3.09/1.06 % (436437)Peak memory usage: 89 MB
% 3.09/1.06 % (436437)Instructions burned: 139 (million)
% 3.09/1.06 % (436444)First to succeed.
% 3.09/1.06 % (436444)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-436380"
% 3.09/1.06 % (436449)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2157284777:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.09/1.06 % (436447)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1219491791:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.09/1.06 % (436451)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=1569125784:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.53/1.26 % (436444)Refutation found. Thanks to Tanya!
% 3.53/1.26 % SZS status Theorem for theBenchmark
% 3.53/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.53/1.26 % (436444)------------------------------
% 3.53/1.26 % (436444)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.26 % (436444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.26 % (436444)CaDiCaL version: 2.1.3
% 3.53/1.26 % (436444)Termination reason: Refutation
% 3.53/1.26 % (436444)Time elapsed: 0.015 s
% 3.53/1.26 % (436444)Peak memory usage: 89 MB
% 3.53/1.26 % (436444)Instructions burned: 40 (million)
% 3.53/1.26 % (436444)------------------------------
% 3.53/1.26 % (436444)------------------------------
% 3.53/1.26 % (436380)Success in time 0.403 s
% 3.53/1.26 % Vampire exiting
%------------------------------------------------------------------------------