%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET683^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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:23:48 AM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 216 ( 58 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 287 ( 16 ~; 9 |; 24 &; 198 @)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 64 ( 64 >; 0 *; 0 +; 0 <<)
% Number of symbols : 60 ( 55 usr; 6 con; 0-4 aty)
% ( 10 !!; 8 ??; 0 @@+; 0 @@-)
% Number of variables : 111 ( 55 ^; 40 !; 16 ?; 111 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_15,type,
cartesian_product: ( $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(func_def_16,type,
pair_rel: $i > $i > $i > $i > $o ).
thf(func_def_17,type,
id_rel: ( $i > $o ) > $i > $i > $o ).
thf(func_def_18,type,
sub_rel: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
thf(func_def_19,type,
is_rel_on: ( $i > $i > $o ) > ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_20,type,
restrict_rel_domain: ( $i > $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(func_def_21,type,
rel_diagonal: $i > $i > $o ).
thf(func_def_22,type,
rel_composition: ( $i > $i > $o ) > ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_23,type,
reflexive: ( $i > $i > $o ) > $o ).
thf(func_def_24,type,
irreflexive: ( $i > $i > $o ) > $o ).
thf(func_def_25,type,
symmetric: ( $i > $i > $o ) > $o ).
thf(func_def_26,type,
transitive: ( $i > $i > $o ) > $o ).
thf(func_def_27,type,
equiv_rel: ( $i > $i > $o ) > $o ).
thf(func_def_28,type,
rel_codomain: ( $i > $i > $o ) > $i > $o ).
thf(func_def_29,type,
rel_domain: ( $i > $i > $o ) > $i > $o ).
thf(func_def_30,type,
rel_inverse: ( $i > $i > $o ) > $i > $i > $o ).
thf(func_def_31,type,
equiv_classes: ( $i > $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_32,type,
restrict_rel_codomain: ( $i > $i > $o ) > ( $i > $o ) > $i > $i > $o ).
thf(func_def_33,type,
rel_field: ( $i > $i > $o ) > $i > $o ).
thf(func_def_34,type,
well_founded: ( $i > $i > $o ) > $o ).
thf(func_def_35,type,
upwards_well_founded: ( $i > $i > $o ) > $o ).
thf(func_def_36,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_38,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_41,type,
vOR: $o > $o > $o ).
thf(func_def_42,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_43,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_44,type,
vAND: $o > $o > $o ).
thf(func_def_45,type,
vNOT: $o > $o ).
thf(func_def_46,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_47,type,
vIMP: $o > $o > $o ).
thf(func_def_48,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_49,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_50,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
vIFF: $o > $o > $o ).
thf(func_def_52,type,
sK0: $i > $i > $o ).
thf(func_def_53,type,
sK1: $i > $o ).
thf(func_def_54,type,
sK2: $i > $o ).
thf(f19,axiom,
( is_rel_on
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
! [X3: $i,X4: $i] :
( ( X0 @ X3 @ X4 )
=> ( ( X2 @ X4 )
& ( X1 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',is_rel_on) ).
thf(f28,axiom,
( rel_codomain
= ( ^ [X0: $i > $i > $o,X1: $i] :
? [X2: $i] : ( X0 @ X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',rel_codomain) ).
thf(f29,axiom,
( rel_domain
= ( ^ [X0: $i > $i > $o,X1: $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',rel_domain) ).
thf(f36,conjecture,
! [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ( is_rel_on @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( X2 @ X3 )
=> ( ( rel_codomain @ X0 @ X3 )
=> ? [X4: $i] :
( ( rel_domain @ X0 @ X4 )
& ( X1 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f37,negated_conjecture,
~ ! [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ( is_rel_on @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( X2 @ X3 )
=> ( ( rel_codomain @ X0 @ X3 )
=> ? [X4: $i] :
( ( rel_domain @ X0 @ X4 )
& ( X1 @ X4 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
thf(f67,plain,
( is_rel_on
= ( ^ [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
! [X3: $i,X4: $i] :
( ( X0 @ X3 @ X4 )
=> ( ( X2 @ X4 )
& ( X1 @ X3 ) ) ) ) ),
inference(rectify,[],[f19]) ).
thf(f68,plain,
( is_rel_on
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y0 @ Y4 @ Y3 )
=> ( ( Y1 @ Y4 )
& ( Y2 @ Y3 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f67]) ).
thf(f84,plain,
( rel_codomain
= ( ^ [X0: $i > $i > $o,X1: $i] :
? [X2: $i] : ( X0 @ X2 @ X1 ) ) ),
inference(rectify,[],[f28]) ).
thf(f85,plain,
( rel_codomain
= ( ^ [Y0: $i > $i > $o,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f84]) ).
thf(f86,plain,
( rel_domain
= ( ^ [X0: $i > $i > $o,X1: $i] :
? [X2: $i] : ( X0 @ X1 @ X2 ) ) ),
inference(rectify,[],[f29]) ).
thf(f87,plain,
( rel_domain
= ( ^ [Y0: $i > $i > $o,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f86]) ).
thf(f99,plain,
~ ! [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ( is_rel_on @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( X2 @ X3 )
=> ( ( rel_codomain @ X0 @ X3 )
=> ? [X4: $i] :
( ( rel_domain @ X0 @ X4 )
& ( X1 @ X4 ) ) ) ) ),
inference(rectify,[],[f37]) ).
thf(f100,plain,
~ ! [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ( ( is_rel_on @ X0 @ X1 @ X2 )
= $true )
=> ! [X3: $i] :
( ( ( X2 @ X3 )
= $true )
=> ( ( ( rel_codomain @ X0 @ X3 )
= $true )
=> ? [X4: $i] :
( ( ( rel_domain @ X0 @ X4 )
= $true )
& ( ( X1 @ X4 )
= $true ) ) ) ) ),
inference(fool_elimination,[],[f99]) ).
thf(f101,plain,
? [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ? [X3: $i] :
( ! [X4: $i] :
( ( ( rel_domain @ X0 @ X4 )
!= $true )
| ( ( X1 @ X4 )
!= $true ) )
& ( ( rel_codomain @ X0 @ X3 )
= $true )
& ( ( X2 @ X3 )
= $true ) )
& ( ( is_rel_on @ X0 @ X1 @ X2 )
= $true ) ),
inference(ennf_transformation,[],[f100]) ).
thf(f102,plain,
? [X0: $i > $i > $o,X1: $i > $o,X2: $i > $o] :
( ? [X3: $i] :
( ! [X4: $i] :
( ( ( rel_domain @ X0 @ X4 )
!= $true )
| ( ( X1 @ X4 )
!= $true ) )
& ( ( rel_codomain @ X0 @ X3 )
= $true )
& ( ( X2 @ X3 )
= $true ) )
& ( ( is_rel_on @ X0 @ X1 @ X2 )
= $true ) ),
inference(flattening,[],[f101]) ).
thf(f103,plain,
( ! [X4: $i] :
( ( $true
!= ( rel_domain @ sK0 @ X4 ) )
| ( $true
!= ( sK1 @ X4 ) ) )
& ( $true
= ( rel_codomain @ sK0 @ sK3 ) )
& ( $true
= ( sK2 @ sK3 ) )
& ( $true
= ( is_rel_on @ sK0 @ sK1 @ sK2 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f102]) ).
thf(f122,plain,
( is_rel_on
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y0 @ Y4 @ Y3 )
=> ( ( Y1 @ Y4 )
& ( Y2 @ Y3 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f68]) ).
thf(f131,plain,
( rel_codomain
= ( ^ [Y0: $i > $i > $o,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f85]) ).
thf(f132,plain,
( rel_domain
= ( ^ [Y0: $i > $i > $o,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f87]) ).
thf(f139,plain,
( $true
= ( is_rel_on @ sK0 @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f103]) ).
thf(f141,plain,
( $true
= ( rel_codomain @ sK0 @ sK3 ) ),
inference(cnf_transformation,[],[f103]) ).
thf(f142,plain,
! [X4: $i] :
( ( $true
!= ( rel_domain @ sK0 @ X4 ) )
| ( $true
!= ( sK1 @ X4 ) ) ),
inference(cnf_transformation,[],[f103]) ).
thf(f148,plain,
! [X4: $i] :
( ( $true
!= ( ^ [Y0: $i > $i > $o,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y1 @ Y2 ) )
@ sK0
@ X4 ) )
| ( $true
!= ( sK1 @ X4 ) ) ),
inference(definition_unfolding,[],[f142,f132]) ).
thf(f149,plain,
( $true
= ( ^ [Y0: $i > $i > $o,Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] : ( Y0 @ Y2 @ Y1 ) )
@ sK0
@ sK3 ) ),
inference(definition_unfolding,[],[f141,f131]) ).
thf(f150,plain,
( $true
= ( ^ [Y0: $i > $i > $o,Y1: $i > $o,Y2: $i > $o] :
( !! @ $i
@ ^ [Y3: $i] :
( !! @ $i
@ ^ [Y4: $i] :
( ( Y0 @ Y4 @ Y3 )
=> ( ( Y1 @ Y4 )
& ( Y2 @ Y3 ) ) ) ) )
@ sK0
@ sK1
@ sK2 ) ),
inference(definition_unfolding,[],[f139,f122]) ).
thf(f151,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 @ Y0 )
=> ( ( sK1 @ Y1 )
& ( sK2 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f150]) ).
thf(f152,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 @ Y0 )
=> ( ( sK1 @ Y1 )
& ( sK2 @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f151]) ).
thf(f153,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 @ X1 )
=> ( ( sK1 @ Y0 )
& ( sK2 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f152]) ).
thf(f154,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 @ X1 )
=> ( ( sK1 @ Y0 )
& ( sK2 @ X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f153]) ).
thf(f155,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( sK0 @ X2 @ X1 )
=> ( ( sK1 @ X2 )
& ( sK2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f154]) ).
thf(f156,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( ( sK1 @ X2 )
& ( sK2 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f155]) ).
thf(f158,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( sK0 @ X2 @ X1 ) )
| ( $true
= ( sK1 @ X2 ) ) ),
inference(and_proxy_clausification,[],[f156]) ).
thf(f159,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] : ( sK0 @ Y0 @ sK3 ) ) ),
inference(beta-eta_normalization,[],[f149]) ).
thf(f160,plain,
( $true
= ( ^ [Y0: $i] : ( sK0 @ Y0 @ sK3 )
@ sK4 ) ),
inference(sigma_proxy_clausification,[],[f159]) ).
thf(f161,plain,
( $true
= ( sK0 @ sK4 @ sK3 ) ),
inference(beta-eta_normalization,[],[f160]) ).
thf(f162,plain,
! [X4: $i] :
( ( $true
!= ( ?? @ $i @ ( sK0 @ X4 ) ) )
| ( $true
!= ( sK1 @ X4 ) ) ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f163,plain,
! [X4: $i,X5: $i] :
( ( $false
= ( sK0 @ X4 @ X5 ) )
| ( $true
!= ( sK1 @ X4 ) ) ),
inference(pi_proxy_clausification,[],[f162]) ).
thf(f164,plain,
! [X4: $i,X5: $i] :
( $false
= ( sK0 @ X4 @ X5 ) ),
inference(forward_subsumption_resolution,[],[f163,f158]) ).
thf(f166,plain,
$false = $true,
inference(constrained_superposition,[],[f161,f164]) ).
thf(f167,plain,
$false,
inference(trivial_inequality_removal,[],[f166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET683^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n015.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 13:44:03 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.23 Running first-order model finding
% 0.07/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.28 % (3542863)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (3542871)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2593040634_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28 % Exception at run slice level
% 0.19/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.28 % (3542872)% WARNING: option uhcvi not known.
% 0.19/0.28 % (3542875)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1657384113:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28 % (3542876)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=66567705:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28 % (3542872)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=723316631:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28 % (3542873)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3096868799:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (3542874)dis+10_1_sil=32000:sp=arity:random_seed=387037357:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28 % (3542877)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2008917822:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.28 % (3542875)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.28 % (3542872)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.28 % (3542872)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.28 % (3542876) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3542863-3542876"...
% 0.19/0.28 % (3542875) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3542863-3542875"...
% 0.19/0.28 % (3542879)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3317079055:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.28 % (3542872) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3542863-3542872"...
% 0.19/0.28 % (3542874) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3542863-3542874"...
% 0.19/0.28 % (3542877) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3542863-3542877"...
% 0.19/0.28 % (3542873) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3542863-3542873"...
% 0.19/0.28 % (3542876)...printing done.
% 0.19/0.28 % (3542875)...printing done.
% 0.19/0.28 % Exception at run slice level
% 0.19/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.28 % (3542872)...printing done.
% 0.19/0.28 % (3542874)...printing done.
% 0.19/0.28 % (3542876)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.29 % (3542876)------------------------------
% 0.19/0.29 % (3542876)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.29 % (3542876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.29 % (3542876)CaDiCaL version: 2.1.3
% 0.19/0.29 % (3542876)Termination reason: Refutation
% 0.19/0.29 % (3542876)Time elapsed: 0.006 s
% 0.19/0.29 % (3542876)Peak memory usage: 12 MB
% 0.19/0.29 % (3542876)Instructions burned: 10 (million)
% 0.19/0.29 % (3542863)Success in time 0.046 s
% 0.19/0.29 % Vampire exiting
%------------------------------------------------------------------------------