%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU635^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:32:46 AM UTC 2026
% Result : Theorem 0.33s 0.42s
% Output : Refutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 4
% Syntax : Number of formulae : 56 ( 36 unt; 0 typ; 0 def)
% Number of atoms : 366 ( 84 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 519 ( 8 ~; 20 |; 9 &; 387 @)
% ( 0 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 18 usr; 8 con; 0-4 aty)
% ( 39 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 121 ( 47 ^; 72 !; 2 ?; 121 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
setadjoin: $i > $i > $i ).
thf(func_def_3,type,
setunion: $i > $i ).
thf(func_def_4,type,
setadjoinIL: $o ).
thf(func_def_6,type,
setunionI: $o ).
thf(func_def_7,type,
subset: $i > $i > $o ).
thf(func_def_8,type,
subsetI2: $o ).
thf(func_def_9,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_13,type,
vIMP: $o > $o > $o ).
thf(func_def_14,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
vNOT: $o > $o ).
thf(func_def_19,type,
sK1: $i > $i > $i ).
thf(f1,axiom,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinIL) ).
thf(f2,axiom,
( setunionI
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ X2 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X1 @ ( setunion @ X0 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionI) ).
thf(f3,axiom,
( subsetI2
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI2) ).
thf(f4,conjecture,
( setadjoinIL
=> ( setunionI
=> ( subsetI2
=> ! [X0: $i] : ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionsingleton2) ).
thf(f5,negated_conjecture,
~ ( setadjoinIL
=> ( setunionI
=> ( subsetI2
=> ! [X0: $i] : ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( setadjoinIL
= ( ! [X0: $i,X1: $i] : ( in @ X0 @ ( setadjoin @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( setunionI
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ X2 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X1 @ ( setunion @ X0 ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
( setunionI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ Y0 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y1 @ ( setunion @ Y2 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( subsetI2
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
( subsetI2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ( setadjoinIL
=> ( setunionI
=> ( subsetI2
=> ! [X0: $i] : ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
~ ( ( setadjoinIL = $true )
=> ( ( setunionI = $true )
=> ( ( subsetI2 = $true )
=> ! [X0: $i] :
( ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) )
= $true ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ? [X0: $i] :
( ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) )
!= $true )
& ( subsetI2 = $true )
& ( setunionI = $true )
& ( setadjoinIL = $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f15,plain,
( ? [X0: $i] :
( ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) )
!= $true )
& ( subsetI2 = $true )
& ( setunionI = $true )
& ( setadjoinIL = $true ) ),
inference(flattening,[],[f14]) ).
thf(f16,plain,
( ( $true
!= ( subset @ sK0 @ ( setunion @ ( setadjoin @ sK0 @ emptyset ) ) ) )
& ( subsetI2 = $true )
& ( setunionI = $true )
& ( setadjoinIL = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f15]) ).
thf(f17,plain,
( setadjoinIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f18,plain,
( setunionI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ Y0 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y1 @ ( setunion @ Y2 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f19,plain,
( subsetI2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f20,plain,
setadjoinIL = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f21,plain,
setunionI = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f22,plain,
subsetI2 = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f23,plain,
( $true
!= ( subset @ sK0 @ ( setunion @ ( setadjoin @ sK0 @ emptyset ) ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f26,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f17,f20]) ).
thf(f27,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ Y0 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y1 @ ( setunion @ Y2 ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f18,f21]) ).
thf(f28,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f19,f22]) ).
thf(f29,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f31,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f30]) ).
thf(f32,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) )
=> ( subset @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f31]) ).
thf(f33,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f32]) ).
thf(f34,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK1 @ X1 @ X2 ) ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(sigma_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK1 @ X1 @ X2 ) @ X2 )
=> ( in @ ( sK1 @ X1 @ X2 ) @ X1 ) ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f34]) ).
thf(f36,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK1 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK1 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f35]) ).
thf(f38,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y1 @ Y0 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y1 @ ( setunion @ Y2 ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f27]) ).
thf(f39,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ X1 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ Y0 @ ( setunion @ Y1 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f38]) ).
thf(f40,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y0 @ X1 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ Y0 @ ( setunion @ Y1 ) ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f39]) ).
thf(f41,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X2 @ X1 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X2 @ ( setunion @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f40]) ).
thf(f42,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X2 @ X1 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X2 @ ( setunion @ Y0 ) ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f41]) ).
thf(f43,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X2 @ X1 )
=> ( ( in @ X1 @ X3 )
=> ( in @ X2 @ ( setunion @ X3 ) ) ) ) ),
inference(beta-eta_normalization,[],[f42]) ).
thf(f44,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( in @ X2 @ X1 )
= $false )
| ( $true
= ( ( in @ X1 @ X3 )
=> ( in @ X2 @ ( setunion @ X3 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f43]) ).
thf(f45,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( ( in @ X2 @ X1 )
= $false )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X2 @ ( setunion @ X3 ) ) ) ),
inference(imp_proxy_clausification,[],[f44]) ).
thf(f46,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( in @ Y1 @ ( setadjoin @ Y1 @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f26]) ).
thf(f47,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f46]) ).
thf(f48,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] : ( in @ Y0 @ ( setadjoin @ Y0 @ X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f47]) ).
thf(f49,plain,
! [X2: $i,X1: $i] :
( $true
= ( in @ X2 @ ( setadjoin @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f48]) ).
thf(f64,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( subset @ X1 @ X0 ) )
| ( ( in @ X1 @ X2 )
= $false )
| ( $true
= ( in @ ( sK1 @ X0 @ X1 ) @ ( setunion @ X2 ) ) ) ),
inference(constrained_superposition,[],[f37,f45]) ).
thf(f72,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true
= ( subset @ X1 @ X0 ) )
| ( $true
= ( in @ ( sK1 @ X0 @ X1 ) @ ( setunion @ X2 ) ) )
| ( ( in @ X1 @ X2 )
= $false ) ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f102,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( subset @ X1 @ ( setunion @ X0 ) ) )
| ( $true
= ( subset @ X1 @ ( setunion @ X0 ) ) )
| ( $false
= ( in @ X1 @ X0 ) ) ),
inference(constrained_superposition,[],[f36,f72]) ).
thf(f103,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( subset @ X1 @ ( setunion @ X0 ) ) )
| ( $false
= ( in @ X1 @ X0 ) ) ),
inference(duplicate_literal_removal,[],[f102]) ).
thf(f104,plain,
! [X0: $i,X1: $i] :
( ( $true
= ( subset @ X1 @ ( setunion @ X0 ) ) )
| ( $false
= ( in @ X1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f103]) ).
thf(f111,plain,
( ( $true != $true )
| ( $false
= ( in @ sK0 @ ( setadjoin @ sK0 @ emptyset ) ) ) ),
inference(constrained_superposition,[],[f23,f104]) ).
thf(f112,plain,
( $false
= ( in @ sK0 @ ( setadjoin @ sK0 @ emptyset ) ) ),
inference(trivial_inequality_removal,[],[f111]) ).
thf(f114,plain,
$true = $false,
inference(constrained_superposition,[],[f49,f112]) ).
thf(f115,plain,
$false,
inference(trivial_inequality_removal,[],[f114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU635^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.29 % Computer : n001.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8046.5625MB
% 0.11/0.29 % OS : Linux 6.8.0-71-generic
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue Sep 29 14:06:36 UTC 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.29 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.29/0.35 Running first-order model finding
% 0.29/0.35 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.33/0.42 % (1290973)Will run a generic schedule for satisfiability detection.
% 0.33/0.42 % (1290982)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4125921478:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.33/0.42 % (1290982)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.33/0.42 % (1290979)% WARNING: option uhcvi not known.
% 0.33/0.42 % (1290981)dis+10_1_sil=32000:sp=arity:random_seed=3355230341:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.33/0.42 % (1290979)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3747931626:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.33/0.42 % (1290978)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2650167416_2999 on theBenchmark for (2999ds/0Mi)
% 0.33/0.42 % (1290980)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2846821953:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.33/0.42 % (1290984)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1221613551:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.33/0.42 % (1290979)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.33/0.42 % (1290983)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2667612556:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.33/0.42 % Exception at run slice level% (1290979)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.33/0.42
% 0.33/0.42 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.33/0.42 % (1290984) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1290973-1290984"...
% 0.33/0.42 % (1290984)...printing done.
% 0.33/0.42 % (1290984)Refutation found. Thanks to Tanya!
% 0.33/0.42 % SZS status Theorem for theBenchmark
% 0.33/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.33/0.43 % (1290984)------------------------------
% 0.33/0.43 % (1290984)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.33/0.43 % (1290984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.33/0.43 % (1290984)CaDiCaL version: 2.1.3
% 0.33/0.43 % (1290984)Termination reason: Refutation
% 0.33/0.43 % (1290984)Time elapsed: 0.014 s
% 0.33/0.43 % (1290984)Peak memory usage: 12 MB
% 0.33/0.43 % (1290984)Instructions burned: 13 (million)
% 0.33/0.43 % (1290973)Success in time 0.063 s
% 0.33/0.43 % Vampire exiting
%------------------------------------------------------------------------------