%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV435^4 : TPTP v9.3.1. Released v3.6.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 : Wed Sep 30 08:39:59 AM UTC 2026
% Result : Theorem 0.11s 0.21s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 59 ( 54 unt; 0 typ; 0 def)
% Number of atoms : 225 ( 57 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 185 ( 7 ~; 14 |; 0 &; 141 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 56 ( 56 >; 0 *; 0 +; 0 <<)
% Number of symbols : 49 ( 45 usr; 5 con; 0-4 aty)
% ( 12 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 97 ( 89 ^; 8 !; 0 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
individuals: $tType ).
thf(func_def_1,type,
prop_a: $i > $o ).
thf(func_def_2,type,
prop_b: $i > $o ).
thf(func_def_3,type,
prop_c: $i > $o ).
thf(func_def_4,type,
mfalse: $i > $o ).
thf(func_def_5,type,
mtrue: $i > $o ).
thf(func_def_6,type,
mnot: ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
miff: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_12,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_13,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_14,type,
mall: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_15,type,
mexists: ( individuals > $i > $o ) > $i > $o ).
thf(func_def_16,type,
mvalid: ( $i > $o ) > $o ).
thf(func_def_17,type,
msatisfiable: ( $i > $o ) > $o ).
thf(func_def_18,type,
mcountersatisfiable: ( $i > $o ) > $o ).
thf(func_def_19,type,
minvalid: ( $i > $o ) > $o ).
thf(func_def_20,type,
rel: $i > $i > $o ).
thf(func_def_21,type,
icl_atom: ( $i > $o ) > $i > $o ).
thf(func_def_22,type,
icl_princ: ( $i > $o ) > $i > $o ).
thf(func_def_23,type,
icl_and: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_24,type,
icl_or: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_25,type,
icl_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_26,type,
icl_true: $i > $o ).
thf(func_def_27,type,
icl_false: $i > $o ).
thf(func_def_28,type,
icl_says: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_29,type,
iclval: ( $i > $o ) > $o ).
thf(func_def_30,type,
a: $i > $o ).
thf(func_def_33,type,
vAND: $o > $o > $o ).
thf(func_def_34,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_35,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_36,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_38,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_39,type,
vIMP: $o > $o > $o ).
thf(func_def_40,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_41,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_42,type,
vNOT: $o > $o ).
thf(func_def_43,type,
vOR: $o > $o > $o ).
thf(func_def_44,type,
sK0: $i > ( $i > $o ) > $i ).
thf(func_def_45,type,
sK1: $i > ( $i > $o ) > $i ).
thf(f1,axiom,
( mfalse
= ( ^ [X0: $i] : $false ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mfalse) ).
thf(f2,axiom,
( ( ^ [X0: $i] : $true )
= mtrue ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mtrue) ).
thf(f4,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= mor ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mor) ).
thf(f8,axiom,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mbox) ).
thf(f12,axiom,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax',mvalid) ).
thf(f17,axiom,
( ( ^ [X0: $i > $o] : X0 )
= icl_princ ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV008^0.ax',icl_princ) ).
thf(f21,axiom,
icl_true = mtrue,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV008^0.ax',icl_true) ).
thf(f22,axiom,
icl_false = mfalse,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV008^0.ax',icl_false) ).
thf(f23,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] : ( mbox @ rel @ ( mor @ X0 @ X1 ) ) )
= icl_says ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV008^0.ax',icl_says) ).
thf(f24,axiom,
( iclval
= ( ^ [X0: $i > $o] : ( mvalid @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV008^0.ax',icl_s4_valid) ).
thf(f27,axiom,
( ( icl_princ @ a )
= icl_true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
thf(f28,conjecture,
iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',untrust) ).
thf(f29,negated_conjecture,
~ ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
thf(f35,plain,
( icl_princ
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(fool_elimination,[],[f17]) ).
thf(f36,plain,
( mbox
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i] :
! [X3: $i] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f37,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f36]) ).
thf(f38,plain,
( icl_says
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mbox @ rel @ ( mor @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f23]) ).
thf(f40,plain,
( mfalse
= ( ^ [Y0: $i] : $false ) ),
inference(fool_elimination,[],[f1]) ).
thf(f48,plain,
~ ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) ),
inference(rectify,[],[f29]) ).
thf(f49,plain,
( ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) )
!= $true ),
inference(fool_elimination,[],[f48]) ).
thf(f52,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= mor ),
inference(rectify,[],[f4]) ).
thf(f53,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f52]) ).
thf(f58,plain,
( mvalid
= ( ^ [X0: $i > $o] :
! [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f12]) ).
thf(f59,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f58]) ).
thf(f62,plain,
( mtrue
= ( ^ [Y0: $i] : $true ) ),
inference(fool_elimination,[],[f2]) ).
thf(f67,plain,
( iclval
= ( ^ [Y0: $i > $o] : ( mvalid @ Y0 ) ) ),
inference(fool_elimination,[],[f24]) ).
thf(f69,plain,
( ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) )
!= $true ),
inference(flattening,[],[f49]) ).
thf(f73,plain,
mfalse = icl_false,
inference(cnf_transformation,[],[f22]) ).
thf(f74,plain,
( icl_says
= ( ^ [Y0: $i > $o,Y1: $i > $o] : ( mbox @ rel @ ( mor @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f38]) ).
thf(f75,plain,
mtrue = icl_true,
inference(cnf_transformation,[],[f21]) ).
thf(f77,plain,
( icl_princ
= ( ^ [Y0: $i > $o] : Y0 ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f80,plain,
( mtrue
= ( ^ [Y0: $i] : $true ) ),
inference(cnf_transformation,[],[f62]) ).
thf(f81,plain,
( mbox
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i] :
( !! @ $i
@ ^ [Y3: $i] :
( ( Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f82,plain,
( icl_true
= ( icl_princ @ a ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f89,plain,
( mfalse
= ( ^ [Y0: $i] : $false ) ),
inference(cnf_transformation,[],[f40]) ).
thf(f93,plain,
( mvalid
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f59]) ).
thf(f94,plain,
( ( iclval @ ( icl_says @ ( icl_princ @ a ) @ icl_false ) )
!= $true ),
inference(cnf_transformation,[],[f69]) ).
thf(f95,plain,
( mor
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
| ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f53]) ).
thf(f96,plain,
( iclval
= ( ^ [Y0: $i > $o] : ( mvalid @ Y0 ) ) ),
inference(cnf_transformation,[],[f67]) ).
thf(f106,plain,
( icl_true
= ( ^ [Y0: $i] : $true ) ),
inference(definition_unfolding,[],[f75,f80]) ).
thf(f107,plain,
( icl_false
= ( ^ [Y0: $i] : $false ) ),
inference(definition_unfolding,[],[f73,f89]) ).
thf(f108,plain,
( icl_says
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ( Y2 @ Y4 @ Y5 )
=> ( Y3 @ Y5 ) ) )
@ rel
@ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ Y0
@ Y1 ) ) ) ),
inference(definition_unfolding,[],[f74,f81,f95]) ).
thf(f109,plain,
( iclval
= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
@ Y0 ) ) ),
inference(definition_unfolding,[],[f96,f93]) ).
thf(f111,plain,
( ( ^ [Y0: $i > $o] : Y0
@ a )
= ( ^ [Y0: $i] : $true ) ),
inference(definition_unfolding,[],[f82,f106,f77]) ).
thf(f113,plain,
( $true
!= ( ^ [Y0: $i > $o] :
( ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] : ( Y1 @ Y2 ) )
@ Y0 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o] :
( ^ [Y2: $i > $i > $o,Y3: $i > $o,Y4: $i] :
( !! @ $i
@ ^ [Y5: $i] :
( ( Y2 @ Y4 @ Y5 )
=> ( Y3 @ Y5 ) ) )
@ rel
@ ( ^ [Y2: $i > $o,Y3: $i > $o,Y4: $i] :
( ( Y2 @ Y4 )
| ( Y3 @ Y4 ) )
@ Y0
@ Y1 ) )
@ ( ^ [Y0: $i > $o] : Y0
@ a )
@ ^ [Y0: $i] : $false ) ) ),
inference(definition_unfolding,[],[f94,f109,f108,f77,f107]) ).
thf(f141,plain,
( $true
!= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel @ Y0 @ Y1 )
=> ( ( a @ Y1 )
| $false ) ) ) ) ),
inference(beta-eta_normalization,[],[f113]) ).
thf(f142,plain,
( ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( rel @ Y0 @ Y1 )
=> ( ( a @ Y1 )
| $false ) ) )
@ sK2 )
= $false ),
inference(sigma_proxy_clausification,[],[f141]) ).
thf(f143,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( ( rel @ sK2 @ Y0 )
=> ( ( a @ Y0 )
| $false ) ) )
= $false ),
inference(beta-eta_normalization,[],[f142]) ).
thf(f144,plain,
( ( ^ [Y0: $i] :
( ( rel @ sK2 @ Y0 )
=> ( ( a @ Y0 )
| $false ) )
@ sK3 )
= $false ),
inference(sigma_proxy_clausification,[],[f143]) ).
thf(f145,plain,
( ( ( rel @ sK2 @ sK3 )
=> ( ( a @ sK3 )
| $false ) )
= $false ),
inference(beta-eta_normalization,[],[f144]) ).
thf(f146,plain,
( ( ( a @ sK3 )
| $false )
= $false ),
inference(imp_proxy_clausification,[],[f145]) ).
thf(f149,plain,
( ( a @ sK3 )
= $false ),
inference(or_proxy_clausification,[],[f146]) ).
thf(f150,plain,
( a
= ( ^ [Y0: $i] : $true ) ),
inference(beta-eta_normalization,[],[f111]) ).
thf(f151,plain,
! [X1: $i] :
( ( a @ X1 )
= ( ^ [Y0: $i] : $true
@ X1 ) ),
inference(argument_congruence,[],[f150]) ).
thf(f152,plain,
! [X1: $i] :
( ( $false
= ( ^ [Y0: $i] : $true
@ X1 ) )
| ( $true
= ( a @ X1 ) ) ),
inference(iff_proxy_clausification,[],[f151]) ).
thf(f155,plain,
! [X1: $i] :
( ( $true = $false )
| ( $true
= ( a @ X1 ) ) ),
inference(beta-eta_normalization,[],[f152]) ).
thf(f156,plain,
! [X1: $i] :
( $true
= ( a @ X1 ) ),
inference(trivial_inequality_removal,[],[f155]) ).
thf(f157,plain,
$true = $false,
inference(constrained_superposition,[],[f156,f149]) ).
thf(f159,plain,
$false,
inference(trivial_inequality_removal,[],[f157]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV435^4 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.14 % Computer : n012.cluster.edu
% 0.11/0.14 % Model : x86_64 x86_64
% 0.11/0.14 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.14 % Memory : 8046.5625MB
% 0.11/0.14 % OS : Linux 6.8.0-71-generic
% 0.11/0.14 % CPULimit : 300
% 0.11/0.14 % WCLimit : 300
% 0.11/0.14 % DateTime : Tue Sep 29 16:03:18 UTC 2026
% 0.11/0.14 % CPUTime :
% 0.11/0.14 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.17 Running higher-order theorem proving
% 0.11/0.18 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.21 % (293211)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.11/0.21 % (293220)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=736937115:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.11/0.21 % (293216)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=25408520:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.11/0.21 % (293217)lrs+10_16_si=on:nwc=1.5:random_seed=3957937698:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.11/0.21 % (293222)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.11/0.21 % (293222)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.11/0.21 % (293218)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3256068521:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.11/0.21 % (293219)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=597258558:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.11/0.21 % (293221)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=522003849:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.11/0.21 % (293218)Instruction limit reached!
% 0.11/0.21 % (293218)------------------------------
% 0.11/0.21 % (293218)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.21 % (293218)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.21 % (293218)CaDiCaL version: 2.1.3
% 0.11/0.21 % (293218)Termination reason: Instruction limit
% 0.11/0.21 % (293218)Termination phase: Saturation
% 0.11/0.21 % (293218)Time elapsed: 0.002 s
% 0.11/0.21 % (293218)Peak memory usage: 11 MB
% 0.11/0.21 % (293218)Instructions burned: 4 (million)
% 0.11/0.21 % (293222)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2097456328:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.11/0.21 % (293217) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-293211-293217"...
% 0.11/0.21 % (293216) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-293211-293216"...
% 0.11/0.21 % (293220)Instruction limit reached!
% 0.11/0.21 % (293220)------------------------------
% 0.11/0.21 % (293220)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.21 % (293220)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.21 % (293220)CaDiCaL version: 2.1.3
% 0.11/0.21 % (293220)Termination reason: Instruction limit
% 0.11/0.21 % (293220)Termination phase: Saturation
% 0.11/0.21 % (293220)Time elapsed: 0.008 s
% 0.11/0.21 % (293220)Peak memory usage: 12 MB
% 0.11/0.21 % (293220)Instructions burned: 24 (million)
% 0.11/0.21 % (293216)...printing done.
% 0.11/0.21 % (293217)...printing done.
% 0.11/0.21 % (293216)Refutation found. Thanks to Tanya!
% 0.11/0.21 % SZS status Theorem for theBenchmark
% 0.11/0.21 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.21 % (293216)------------------------------
% 0.11/0.21 % (293216)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.21 % (293216)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.21 % (293216)CaDiCaL version: 2.1.3
% 0.11/0.21 % (293216)Termination reason: Refutation
% 0.11/0.21 % (293216)Time elapsed: 0.005 s
% 0.11/0.21 % (293216)Peak memory usage: 12 MB
% 0.11/0.21 % (293216)Instructions burned: 9 (million)
% 0.11/0.21 % (293211)Success in time 0.026 s
% 0.11/0.21 % Vampire exiting
%------------------------------------------------------------------------------