%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO035^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:46:19 AM UTC 2026
% Result : Theorem 0.24s 0.33s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 74 ( 23 unt; 0 typ; 5 def)
% Number of atoms : 359 ( 115 equ; 14 cnn)
% Maximal formula atoms : 5 ( 4 avg)
% Number of connectives : 398 ( 62 ~; 72 |; 3 &; 208 @)
% ( 5 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 102 ( 102 >; 0 *; 0 +; 0 <<)
% Number of symbols : 25 ( 20 usr; 11 con; 0-4 aty)
% ( 18 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 129 ( 0 sgn 55 !; 4 ?; 129 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
leibeq1: $i > $i > $o ).
thf(func_def_2,type,
leibeq2: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_3,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
vIMP: $o > $o > $o ).
thf(func_def_5,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_9,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_14,type,
vNOT: $o > $o ).
thf(func_def_16,type,
sK3: $i > $i > $i > $o ).
thf(func_def_17,type,
sK4: ( $i > $o ) > ( $i > $o ) > ( $i > $o ) > $o ).
thf(f1,axiom,
( leibeq1
= ( ^ [X0: $i,X1: $i] :
! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq1) ).
thf(f2,axiom,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: ( $i > $o ) > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq2) ).
thf(f3,conjecture,
! [X0: $i,X1: $i] :
( ( leibeq2
@ ^ [X2: $i] : ( X2 = X0 )
@ ^ [X2: $i] : ( X2 = X1 ) )
=> ( leibeq1 @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f4,negated_conjecture,
~ ! [X0: $i,X1: $i] :
( ( leibeq2
@ ^ [X2: $i] : ( X2 = X0 )
@ ^ [X2: $i] : ( X2 = X1 ) )
=> ( leibeq1 @ X0 @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( leibeq1
= ( ^ [X0: $i,X1: $i] :
! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( leibeq1
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: ( $i > $o ) > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq2 ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( leibeq2
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ! [X0: $i,X1: $i] :
( ( leibeq2
@ ^ [X2: $i] : ( X2 = X0 )
@ ^ [X3: $i] : ( X1 = X3 ) )
=> ( leibeq1 @ X0 @ X1 ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ! [X1: $i,X0: $i] :
( ( $true
= ( leibeq2
@ ^ [Y0: $i] : ( X0 = Y0 )
@ ^ [Y0: $i] : ( X1 = Y0 ) ) )
=> ( ( leibeq1 @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
? [X1: $i,X0: $i] :
( ( $true
= ( leibeq2
@ ^ [Y0: $i] : ( X0 = Y0 )
@ ^ [Y0: $i] : ( X1 = Y0 ) ) )
& ( ( leibeq1 @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
? [X0: $i,X1: $i] :
( ( $true
= ( leibeq2
@ ^ [Y0: $i] : ( X1 = Y0 )
@ ^ [Y0: $i] : ( X0 = Y0 ) ) )
& ( $true
!= ( leibeq1 @ X1 @ X0 ) ) ),
inference(rectify,[],[f11]) ).
thf(f13,plain,
( ( ( leibeq2
@ ^ [Y0: $i] : ( sK1 = Y0 )
@ ^ [Y0: $i] : ( sK0 = Y0 ) )
= $true )
& ( $true
!= ( leibeq1 @ sK1 @ sK0 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).
thf(f14,plain,
( $true
!= ( leibeq1 @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f15,plain,
( ( leibeq2
@ ^ [Y0: $i] : ( sK1 = Y0 )
@ ^ [Y0: $i] : ( sK0 = Y0 ) )
= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f16,plain,
( leibeq2
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f17,plain,
( leibeq1
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f19,plain,
( $true
= ( leibeq2 @ ( (=) @ sK1 ) @ ( (=) @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f15]) ).
thf(f21,definition,
( spl2_1
<=> ( $true
= ( leibeq1 @ sK1 @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f23,plain,
( ( $true
!= ( leibeq1 @ sK1 @ sK0 ) )
| spl2_1 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f24,plain,
~ spl2_1,
inference(avatar_split_clause,[],[f14,f21]) ).
thf(f26,definition,
( spl2_2
<=> ( leibeq1
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f28,plain,
( ( leibeq1
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f26]) ).
thf(f29,plain,
spl2_2,
inference(avatar_split_clause,[],[f17,f26]) ).
thf(f31,definition,
( spl2_3
<=> ( leibeq2
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f33,plain,
( ( leibeq2
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f34,plain,
spl2_3,
inference(avatar_split_clause,[],[f16,f31]) ).
thf(f36,definition,
( spl2_4
<=> ( $true
= ( leibeq2 @ ( (=) @ sK1 ) @ ( (=) @ sK0 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f38,plain,
( ( $true
= ( leibeq2 @ ( (=) @ sK1 ) @ ( (=) @ sK0 ) ) )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f39,plain,
spl2_4,
inference(avatar_split_clause,[],[f19,f36]) ).
thf(f40,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ X1 )
= ( leibeq1 @ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f28]) ).
thf(f41,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) ) )
= ( leibeq1 @ X1 ) )
| ~ spl2_2 ),
inference(beta-eta_normalization,[],[f40]) ).
thf(f42,plain,
( ! [X2: $i,X1: $i] :
( ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) )
@ X2 )
= ( leibeq1 @ X1 @ X2 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f41]) ).
thf(f44,plain,
( ! [X2: $i,X1: $i] :
( ( $true
= ( leibeq1 @ X1 @ X2 ) )
| ( ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) )
@ X2 )
= $false ) )
| ~ spl2_2 ),
inference(iff_proxy_clausification,[],[f42]) ).
thf(f45,plain,
( ! [X2: $i,X1: $i] :
( ( $true
= ( leibeq1 @ X1 @ X2 ) )
| ( ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( Y0 @ X1 )
=> ( Y0 @ X2 ) ) )
= $false ) )
| ~ spl2_2 ),
inference(beta-eta_normalization,[],[f44]) ).
thf(f46,plain,
( ! [X2: $i,X1: $i] :
( ( $true
= ( leibeq1 @ X1 @ X2 ) )
| ( $false
= ( ^ [Y0: $i > $o] :
( ( Y0 @ X1 )
=> ( Y0 @ X2 ) )
@ ( sK3 @ X1 @ X2 ) ) ) )
| ~ spl2_2 ),
inference(sigma_proxy_clausification,[],[f45]) ).
thf(f47,plain,
( ! [X2: $i,X1: $i] :
( ( $true
= ( leibeq1 @ X1 @ X2 ) )
| ( ( ( sK3 @ X1 @ X2 @ X1 )
=> ( sK3 @ X1 @ X2 @ X2 ) )
= $false ) )
| ~ spl2_2 ),
inference(beta-eta_normalization,[],[f46]) ).
thf(f48,plain,
( ! [X2: $i,X1: $i] :
( ( $false
= ( sK3 @ X1 @ X2 @ X2 ) )
| ( $true
= ( leibeq1 @ X1 @ X2 ) ) )
| ~ spl2_2 ),
inference(imp_proxy_clausification,[],[f47]) ).
thf(f49,plain,
( ! [X2: $i,X1: $i] :
( ( $true
= ( sK3 @ X1 @ X2 @ X1 ) )
| ( $true
= ( leibeq1 @ X1 @ X2 ) ) )
| ~ spl2_2 ),
inference(imp_proxy_clausification,[],[f47]) ).
thf(f54,plain,
( ! [X0: $i] :
( ( $true
= ( leibeq1 @ X0 @ X0 ) )
| ( $true
= ( leibeq1 @ X0 @ X0 ) )
| ( $true = $false ) )
| ~ spl2_2 ),
inference(superposition,[],[f49,f48]) ).
thf(f56,plain,
( ! [X0: $i] :
( ( $true = $false )
| ( $true
= ( leibeq1 @ X0 @ X0 ) ) )
| ~ spl2_2 ),
inference(duplicate_literal_removal,[],[f54]) ).
thf(f57,plain,
( ! [X0: $i] :
( $true
= ( leibeq1 @ X0 @ X0 ) )
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f60,plain,
( ! [X1: $i > $o] :
( ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ X1 )
= ( leibeq2 @ X1 ) )
| ~ spl2_3 ),
inference(argument_congruence,[],[f33]) ).
thf(f61,plain,
( ! [X1: $i > $o] :
( ( ^ [Y0: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y1: ( $i > $o ) > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) ) )
= ( leibeq2 @ X1 ) )
| ~ spl2_3 ),
inference(beta-eta_normalization,[],[f60]) ).
thf(f62,plain,
( ! [X2: $i > $o,X1: $i > $o] :
( ( ^ [Y0: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y1: ( $i > $o ) > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) )
@ X2 )
= ( leibeq2 @ X1 @ X2 ) )
| ~ spl2_3 ),
inference(argument_congruence,[],[f61]) ).
thf(f63,plain,
( ! [X2: $i > $o,X1: $i > $o] :
( ( $true
= ( ^ [Y0: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y1: ( $i > $o ) > $o] :
( ( Y1 @ X1 )
=> ( Y1 @ Y0 ) ) )
@ X2 ) )
| ( ( leibeq2 @ X1 @ X2 )
= $false ) )
| ~ spl2_3 ),
inference(iff_proxy_clausification,[],[f62]) ).
thf(f70,plain,
( ! [X2: $i > $o,X1: $i > $o] :
( ( $true
= ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y0: ( $i > $o ) > $o] :
( ( Y0 @ X1 )
=> ( Y0 @ X2 ) ) ) )
| ( ( leibeq2 @ X1 @ X2 )
= $false ) )
| ~ spl2_3 ),
inference(beta-eta_normalization,[],[f63]) ).
thf(f71,plain,
( ! [X2: $i > $o,X3: ( $i > $o ) > $o,X1: $i > $o] :
( ( ( leibeq2 @ X1 @ X2 )
= $false )
| ( $true
= ( ^ [Y0: ( $i > $o ) > $o] :
( ( Y0 @ X1 )
=> ( Y0 @ X2 ) )
@ X3 ) ) )
| ~ spl2_3 ),
inference(pi_proxy_clausification,[],[f70]) ).
thf(f72,plain,
( ! [X2: $i > $o,X3: ( $i > $o ) > $o,X1: $i > $o] :
( ( ( leibeq2 @ X1 @ X2 )
= $false )
| ( $true
= ( ( X3 @ X1 )
=> ( X3 @ X2 ) ) ) )
| ~ spl2_3 ),
inference(beta-eta_normalization,[],[f71]) ).
thf(f73,plain,
( ! [X2: $i > $o,X3: ( $i > $o ) > $o,X1: $i > $o] :
( ( ( leibeq2 @ X1 @ X2 )
= $false )
| ( $true
= ( X3 @ X2 ) )
| ( ( X3 @ X1 )
= $false ) )
| ~ spl2_3 ),
inference(imp_proxy_clausification,[],[f72]) ).
thf(f88,plain,
( ! [X0: $i > $o,X1: $i > $o] :
( ( ( leibeq2 @ X0 @ X1 )
= $false )
| ( X0 = X1 ) )
| ~ spl2_3 ),
inference(leibniz_equality_elimination,[],[f73]) ).
thf(f99,plain,
( ( $true = $false )
| ( ( (=) @ sK1 )
= ( (=) @ sK0 ) )
| ~ spl2_3
| ~ spl2_4 ),
inference(superposition,[],[f38,f88]) ).
thf(f100,plain,
( ( ( (=) @ sK1 )
= ( (=) @ sK0 ) )
| ~ spl2_3
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f99]) ).
thf(f103,definition,
( spl2_5
<=> ( ( (=) @ sK1 )
= ( (=) @ sK0 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
thf(f105,plain,
( ( ( (=) @ sK1 )
= ( (=) @ sK0 ) )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f103]) ).
thf(f106,plain,
( spl2_5
| ~ spl2_3
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f100,f36,f31,f103]) ).
thf(f107,plain,
( ! [X1: $i] :
( ( sK0 = X1 )
= ( sK1 = X1 ) )
| ~ spl2_5 ),
inference(argument_congruence,[],[f105]) ).
thf(f110,plain,
( ! [X1: $i] :
( ( ( sK0 = X1 )
= $false )
| ( $true
= ( sK1 = X1 ) ) )
| ~ spl2_5 ),
inference(iff_proxy_clausification,[],[f107]) ).
thf(f111,plain,
( ! [X1: $i] :
( ( $true
= ( sK1 = X1 ) )
| ( sK0 != X1 ) )
| ~ spl2_5 ),
inference(equality_proxy_clausification,[],[f110]) ).
thf(f112,plain,
( ! [X1: $i] :
( ( sK1 = X1 )
| ( sK0 != X1 ) )
| ~ spl2_5 ),
inference(equality_proxy_clausification,[],[f111]) ).
thf(f117,plain,
( ! [X0: $i] :
( ( $true
!= ( leibeq1 @ X0 @ sK0 ) )
| ( sK0 != X0 ) )
| spl2_1
| ~ spl2_5 ),
inference(superposition,[],[f23,f112]) ).
thf(f124,plain,
( ( $true != $true )
| ( sK0 != sK0 )
| spl2_1
| ~ spl2_2
| ~ spl2_5 ),
inference(superposition,[],[f117,f57]) ).
thf(f127,plain,
( $false
| spl2_1
| ~ spl2_2
| ~ spl2_5 ),
inference(trivial_inequality_removal,[],[f124]) ).
thf(f128,plain,
( spl2_1
| ~ spl2_2
| ~ spl2_5 ),
inference(avatar_contradiction_clause,[],[f127]) ).
cnf(s1,plain,
~ spl2_1,
inference(sat_conversion,[],[f24]) ).
cnf(s2,plain,
spl2_2,
inference(sat_conversion,[],[f29]) ).
cnf(s3,plain,
spl2_3,
inference(sat_conversion,[],[f34]) ).
cnf(s4,plain,
spl2_4,
inference(sat_conversion,[],[f39]) ).
cnf(s5,plain,
( ~ spl2_3
| ~ spl2_4
| spl2_5 ),
inference(sat_conversion,[],[f106]) ).
cnf(s7,plain,
( spl2_1
| ~ spl2_2
| ~ spl2_5 ),
inference(sat_conversion,[],[f128]) ).
cnf(s8,plain,
spl2_5,
inference(rat,[],[s5,s4,s3]) ).
cnf(s9,plain,
spl2_1,
inference(rat,[],[s7,s8,s2]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s9]) ).
thf(f129,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO035^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n004.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 16:23:22 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.25 Running higher-order theorem proving
% 0.09/0.27 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.33 % (1505149)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.24/0.33 % (1505157)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=3262096233: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.24/0.33 % (1505157) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1505149-1505157"...
% 0.24/0.33 % (1505157)...printing done.
% 0.24/0.33 % (1505160)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.24/0.33 % (1505160)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.24/0.33 % (1505157)Refutation found. Thanks to Tanya!
% 0.24/0.33 % SZS status Theorem for theBenchmark
% 0.24/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.34 % (1505157)------------------------------
% 0.24/0.34 % (1505157)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.34 % (1505157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.34 % (1505157)CaDiCaL version: 2.1.3
% 0.24/0.34 % (1505157)Termination reason: Refutation
% 0.24/0.34 % (1505157)Time elapsed: 0.007 s
% 0.24/0.34 % (1505157)Peak memory usage: 13 MB
% 0.24/0.34 % (1505157)Instructions burned: 10 (million)
% 0.24/0.34 % (1505149)Success in time 0.047 s
% 0.24/0.34 % Vampire exiting
%------------------------------------------------------------------------------