%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU775^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:31:17 AM UTC 2026
% Result : Theorem 0.12s 0.27s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 77 ( 36 unt; 0 typ; 9 def)
% Number of atoms : 309 ( 64 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 443 ( 38 ~; 34 |; 4 &; 339 @)
% ( 6 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 46 ( 46 >; 0 *; 0 +; 0 <<)
% Number of symbols : 32 ( 28 usr; 16 con; 0-4 aty)
% ( 14 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 144 ( 0 sgn 22 !; 2 ?; 144 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
subset: $i > $i > $o ).
thf(func_def_2,type,
kpair: $i > $i > $i ).
thf(func_def_3,type,
cartprod: $i > $i > $i ).
thf(func_def_4,type,
breln: $i > $i > $i > $o ).
thf(func_def_6,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_7,type,
breln1: $i > $i > $o ).
thf(func_def_8,type,
setOfPairsIsBReln1: $o ).
thf(func_def_9,type,
breln1invset: $i > $i > $i ).
thf(func_def_10,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_11,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_19,type,
sF2: $o ).
thf(func_def_21,type,
sF4: $o ).
thf(func_def_22,type,
sF5: $o ).
thf(func_def_24,type,
sK7: $i > $i > $o ).
thf(f1,axiom,
( ( ^ [X0: $i,X1: $i,X2: $i] : ( subset @ X2 @ ( cartprod @ X0 @ X1 ) ) )
= breln ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln) ).
thf(f2,axiom,
( ( ^ [X0: $i,X1: $i] : ( breln @ X0 @ X0 @ X1 ) )
= breln1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1) ).
thf(f3,axiom,
! [X1: $i > $i > $o,X0: $i] :
( ( breln1 @ X0
@ ( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ) )
= setOfPairsIsBReln1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setOfPairsIsBReln1) ).
thf(f4,axiom,
( ( ^ [X0: $i,X1: $i] :
( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( in @ ( kpair @ X3 @ X2 ) @ X1 ) ) )
= breln1invset ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1invset) ).
thf(f5,conjecture,
( setOfPairsIsBReln1
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ( breln1 @ X0 @ ( breln1invset @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1invprop) ).
thf(f6,negated_conjecture,
~ ( setOfPairsIsBReln1
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ( breln1 @ X0 @ ( breln1invset @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
! [X0: $i > $i > $o,X1: $i] :
( ( breln1 @ X1
@ ( dpsetconstr @ X1 @ X1
@ ^ [X2: $i,X3: $i] : ( X0 @ X2 @ X3 ) ) )
= setOfPairsIsBReln1 ),
inference(rectify,[],[f3]) ).
thf(f8,plain,
( setOfPairsIsBReln1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( breln1 @ Y0
@ ( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( Y1 @ Y2 @ Y3 ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( setOfPairsIsBReln1
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ( breln1 @ X0 @ ( breln1invset @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f10,plain,
~ ( ( setOfPairsIsBReln1 = $true )
=> ! [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
= $true )
=> ( ( breln1 @ X0 @ ( breln1invset @ X0 @ X1 ) )
= $true ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( breln1
= ( ^ [Y0: $i,Y1: $i] : ( breln @ Y0 @ Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f2]) ).
thf(f12,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f13,plain,
( ( ^ [X0: $i,X1: $i] :
( dpsetconstr @ X0 @ X0
@ ^ [X2: $i,X3: $i] : ( in @ ( kpair @ X3 @ X2 ) @ X1 ) ) )
= breln1invset ),
inference(rectify,[],[f4]) ).
thf(f14,plain,
( breln1invset
= ( ^ [Y0: $i,Y1: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( in @ ( kpair @ Y3 @ Y2 ) @ Y1 ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
( ( setOfPairsIsBReln1 = $true )
& ? [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ ( breln1invset @ X0 @ X1 ) )
!= $true )
& ( ( breln1 @ X0 @ X1 )
= $true ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f16,plain,
( ( setOfPairsIsBReln1 = $true )
& ( ( breln1 @ sK0 @ ( breln1invset @ sK0 @ sK1 ) )
!= $true )
& ( ( breln1 @ sK0 @ sK1 )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f15]) ).
thf(f17,plain,
( breln1invset
= ( ^ [Y0: $i,Y1: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( in @ ( kpair @ Y3 @ Y2 ) @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f18,plain,
( setOfPairsIsBReln1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( breln1 @ Y0
@ ( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( Y1 @ Y2 @ Y3 ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f19,plain,
( breln1
= ( ^ [Y0: $i,Y1: $i] : ( breln @ Y0 @ Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f21,plain,
( ( breln1 @ sK0 @ ( breln1invset @ sK0 @ sK1 ) )
!= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f22,plain,
setOfPairsIsBReln1 = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f23,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f26,plain,
( breln1
= ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 ) ) ),
inference(definition_unfolding,[],[f19,f23]) ).
thf(f27,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ^ [Y2: $i,Y3: $i] :
( ^ [Y4: $i,Y5: $i,Y6: $i] : ( subset @ Y6 @ ( cartprod @ Y4 @ Y5 ) )
@ Y2
@ Y2
@ Y3 )
@ Y0
@ ( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( Y1 @ Y2 @ Y3 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f18,f22,f26]) ).
thf(f28,plain,
( ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 )
@ sK0
@ ( ^ [Y0: $i,Y1: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( in @ ( kpair @ Y3 @ Y2 ) @ Y1 ) )
@ sK0
@ sK1 ) )
!= $true ),
inference(definition_unfolding,[],[f21,f26,f17]) ).
thf(f30,definition,
( sF2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ^ [Y2: $i,Y3: $i] :
( ^ [Y4: $i,Y5: $i,Y6: $i] : ( subset @ Y6 @ ( cartprod @ Y4 @ Y5 ) )
@ Y2
@ Y2
@ Y3 )
@ Y0
@ ( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( Y1 @ Y2 @ Y3 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
thf(f31,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ^ [Y2: $i,Y3: $i] :
( ^ [Y4: $i,Y5: $i,Y6: $i] : ( subset @ Y6 @ ( cartprod @ Y4 @ Y5 ) )
@ Y2
@ Y2
@ Y3 )
@ Y0
@ ( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( Y1 @ Y2 @ Y3 ) ) ) ) )
= sF2 ),
inference(reorient_equations,[],[f30]) ).
thf(f32,plain,
sF2 = $true,
inference(definition_folding,[],[f27,f31]) ).
thf(f33,definition,
( sF3
= ( ^ [Y0: $i,Y1: $i] :
( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( in @ ( kpair @ Y3 @ Y2 ) @ Y1 ) )
@ sK0
@ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f34,definition,
( sF4
= ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 )
@ sK0
@ sF3 ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f35,plain,
sF4 != $true,
inference(definition_folding,[],[f28,f34,f33]) ).
thf(f42,plain,
( sF3
= ( dpsetconstr @ sK0 @ sK0
@ ^ [Y0: $i,Y1: $i] : ( in @ ( kpair @ Y1 @ Y0 ) @ sK1 ) ) ),
inference(beta-eta_normalization,[],[f33]) ).
thf(f43,plain,
( ( $false
= ( ^ [Y0: $i,Y1: $i] :
( ^ [Y2: $i,Y3: $i,Y4: $i] : ( subset @ Y4 @ ( cartprod @ Y2 @ Y3 ) )
@ Y0
@ Y0
@ Y1 )
@ sK0
@ sF3 ) )
| ( sF4 = $true ) ),
inference(iff_proxy_clausification,[],[f34]) ).
thf(f46,plain,
( ( sF4 = $true )
| ( $false
= ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) ) ) ),
inference(beta-eta_normalization,[],[f43]) ).
thf(f47,plain,
( ( $false = sF2 )
| ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ^ [Y2: $i,Y3: $i] :
( ^ [Y4: $i,Y5: $i,Y6: $i] : ( subset @ Y6 @ ( cartprod @ Y4 @ Y5 ) )
@ Y2
@ Y2
@ Y3 )
@ Y0
@ ( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( Y1 @ Y2 @ Y3 ) ) ) ) )
= $true ) ),
inference(iff_proxy_clausification,[],[f31]) ).
thf(f53,plain,
! [X1: $i] :
( ( ( ^ [Y0: $i] :
( !! @ ( $i > $i > $o )
@ ^ [Y1: $i > $i > $o] :
( ^ [Y2: $i,Y3: $i] :
( ^ [Y4: $i,Y5: $i,Y6: $i] : ( subset @ Y6 @ ( cartprod @ Y4 @ Y5 ) )
@ Y2
@ Y2
@ Y3 )
@ Y0
@ ( dpsetconstr @ Y0 @ Y0
@ ^ [Y2: $i,Y3: $i] : ( Y1 @ Y2 @ Y3 ) ) ) )
@ X1 )
= $true )
| ( $false = sF2 ) ),
inference(pi_proxy_clausification,[],[f47]) ).
thf(f54,plain,
! [X1: $i] :
( ( $false = sF2 )
| ( ( !! @ ( $i > $i > $o )
@ ^ [Y0: $i > $i > $o] : ( subset @ ( dpsetconstr @ X1 @ X1 @ Y0 ) @ ( cartprod @ X1 @ X1 ) ) )
= $true ) ),
inference(beta-eta_normalization,[],[f53]) ).
thf(f55,plain,
! [X2: $i > $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i > $i > $o] : ( subset @ ( dpsetconstr @ X1 @ X1 @ Y0 ) @ ( cartprod @ X1 @ X1 ) )
@ X2 ) )
| ( $false = sF2 ) ),
inference(pi_proxy_clausification,[],[f54]) ).
thf(f56,plain,
! [X2: $i > $i > $o,X1: $i] :
( ( $false = sF2 )
| ( ( subset @ ( dpsetconstr @ X1 @ X1 @ X2 ) @ ( cartprod @ X1 @ X1 ) )
= $true ) ),
inference(beta-eta_normalization,[],[f55]) ).
thf(f76,definition,
( spl8_5
<=> ( ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl8_5])],[avatar_definition]) ).
thf(f77,plain,
( ( ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) )
!= $true )
| spl8_5 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f78,plain,
( ( ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) )
= $true )
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f76]) ).
thf(f85,definition,
( spl8_7
<=> ( $false
= ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl8_7])],[avatar_definition]) ).
thf(f87,plain,
( ( $false
= ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) ) )
| ~ spl8_7 ),
inference(avatar_component_clause,[],[f85]) ).
thf(f89,definition,
( spl8_8
<=> ( sF4 = $true ) ),
introduced(definition,[new_symbols(definition,[spl8_8])],[avatar_definition]) ).
thf(f92,plain,
( spl8_7
| spl8_8 ),
inference(avatar_split_clause,[],[f46,f89,f85]) ).
thf(f94,definition,
( spl8_9
<=> ( sF2 = $true ) ),
introduced(definition,[new_symbols(definition,[spl8_9])],[avatar_definition]) ).
thf(f96,plain,
( ( sF2 = $true )
| ~ spl8_9 ),
inference(avatar_component_clause,[],[f94]) ).
thf(f103,definition,
( spl8_11
<=> ! [X2: $i > $i > $o,X1: $i] :
( ( subset @ ( dpsetconstr @ X1 @ X1 @ X2 ) @ ( cartprod @ X1 @ X1 ) )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl8_11])],[avatar_definition]) ).
thf(f104,plain,
( ! [X2: $i > $i > $o,X1: $i] :
( ( subset @ ( dpsetconstr @ X1 @ X1 @ X2 ) @ ( cartprod @ X1 @ X1 ) )
= $true )
| ~ spl8_11 ),
inference(avatar_component_clause,[],[f103]) ).
thf(f106,definition,
( spl8_12
<=> ( $false = sF2 ) ),
introduced(definition,[new_symbols(definition,[spl8_12])],[avatar_definition]) ).
thf(f108,plain,
( ( $false = sF2 )
| ~ spl8_12 ),
inference(avatar_component_clause,[],[f106]) ).
thf(f109,plain,
( spl8_11
| spl8_12 ),
inference(avatar_split_clause,[],[f56,f106,f103]) ).
thf(f110,plain,
~ spl8_8,
inference(avatar_split_clause,[],[f35,f89]) ).
thf(f111,plain,
spl8_9,
inference(avatar_split_clause,[],[f32,f94]) ).
thf(f126,plain,
( ( $false = $true )
| ~ spl8_5
| ~ spl8_7 ),
inference(forward_demodulation,[],[f87,f78]) ).
thf(f127,plain,
( $false
| ~ spl8_5
| ~ spl8_7 ),
inference(trivial_inequality_removal,[],[f126]) ).
thf(f128,plain,
( ~ spl8_5
| ~ spl8_7 ),
inference(avatar_contradiction_clause,[],[f127]) ).
thf(f135,plain,
( ( ( subset @ sF3 @ ( cartprod @ sK0 @ sK0 ) )
= $true )
| ~ spl8_11 ),
inference(constrained_superposition,[],[f104,f42]) ).
thf(f136,plain,
( $false
| spl8_5
| ~ spl8_11 ),
inference(forward_subsumption_resolution,[],[f135,f77]) ).
thf(f137,plain,
( spl8_5
| ~ spl8_11 ),
inference(avatar_contradiction_clause,[],[f136]) ).
thf(f138,plain,
( ( $false = $true )
| ~ spl8_9
| ~ spl8_12 ),
inference(forward_demodulation,[],[f108,f96]) ).
thf(f139,plain,
( $false
| ~ spl8_9
| ~ spl8_12 ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f140,plain,
( ~ spl8_9
| ~ spl8_12 ),
inference(avatar_contradiction_clause,[],[f139]) ).
cnf(s4,plain,
( spl8_7
| spl8_8 ),
inference(sat_conversion,[],[f92]) ).
cnf(s6,plain,
( spl8_11
| spl8_12 ),
inference(sat_conversion,[],[f109]) ).
cnf(s7,plain,
~ spl8_8,
inference(sat_conversion,[],[f110]) ).
cnf(s8,plain,
spl8_9,
inference(sat_conversion,[],[f111]) ).
cnf(s11,plain,
( ~ spl8_5
| ~ spl8_7 ),
inference(sat_conversion,[],[f128]) ).
cnf(s13,plain,
( spl8_5
| ~ spl8_11 ),
inference(sat_conversion,[],[f137]) ).
cnf(s14,plain,
( ~ spl8_9
| ~ spl8_12 ),
inference(sat_conversion,[],[f140]) ).
cnf(s15,plain,
~ spl8_12,
inference(rat,[],[s14,s8]) ).
cnf(s17,plain,
spl8_11,
inference(rat,[],[s6,s15]) ).
cnf(s18,plain,
spl8_5,
inference(rat,[],[s13,s17]) ).
cnf(s19,plain,
~ spl8_7,
inference(rat,[],[s11,s18]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s4,s7,s19]) ).
thf(f141,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU775^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.17 % Computer : n009.cluster.edu
% 0.12/0.17 % Model : x86_64 x86_64
% 0.12/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.17 % Memory : 8046.5625MB
% 0.12/0.17 % OS : Linux 6.8.0-71-generic
% 0.12/0.17 % CPULimit : 300
% 0.12/0.17 % WCLimit : 300
% 0.12/0.17 % DateTime : Tue Sep 29 14:28:00 UTC 2026
% 0.12/0.17 % CPUTime :
% 0.12/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.21 Running higher-order theorem proving
% 0.12/0.22 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.12/0.27 % (4076641)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.12/0.27 % (4076664)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.12/0.27 % (4076664)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.12/0.27 % (4076664)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=946647917:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.12/0.27 % (4076664) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4076641-4076664"...
% 0.12/0.27 % (4076664)...printing done.
% 0.12/0.27 % (4076664)Refutation found. Thanks to Tanya!
% 0.12/0.27 % SZS status Theorem for theBenchmark
% 0.12/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.27 % (4076664)------------------------------
% 0.12/0.27 % (4076664)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.27 % (4076664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.27 % (4076664)CaDiCaL version: 2.1.3
% 0.12/0.27 % (4076664)Termination reason: Refutation
% 0.12/0.27 % (4076664)Time elapsed: 0.003 s
% 0.12/0.27 % (4076664)Peak memory usage: 13 MB
% 0.12/0.27 % (4076664)Instructions burned: 8 (million)
% 0.12/0.27 % (4076641)Success in time 0.04 s
% 0.12/0.27 % Vampire exiting
%------------------------------------------------------------------------------