%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU723^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 : n017.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:30:58 AM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 70 ( 23 unt; 0 typ; 7 def)
% Number of atoms : 607 ( 152 equ; 0 cnn)
% Maximal formula atoms : 8 ( 8 avg)
% Number of connectives : 640 ( 112 ~; 86 |; 36 &; 348 @)
% ( 13 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 24 usr; 21 con; 0-2 aty)
% Number of variables : 116 ( 0 sgn 96 !; 20 ?; 116 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
powerset: $i > $i ).
thf(func_def_2,type,
subset: $i > $i > $o ).
thf(func_def_3,type,
subsetE: $o ).
thf(func_def_5,type,
setminus: $i > $i > $i ).
thf(func_def_6,type,
setminusER: $o ).
thf(f1,axiom,
! [X1: $i,X0: $i,X2: $i] :
( ( ( subset @ X0 @ X1 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) )
= subsetE ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE) ).
thf(f2,axiom,
! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ~ ( in @ X2 @ X1 ) )
= setminusER ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusER) ).
thf(f3,conjecture,
( subsetE
=> ( setminusER
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( subset @ X1 @ ( setminus @ X0 @ X2 ) )
=> ( ( in @ X3 @ X2 )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contrasubsetT) ).
thf(f4,negated_conjecture,
~ ( subsetE
=> ( setminusER
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( subset @ X1 @ ( setminus @ X0 @ X2 ) )
=> ( ( in @ X3 @ X2 )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
~ ( subsetE
=> ( setminusER
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( subset @ X1 @ ( setminus @ X0 @ X2 ) )
=> ( ( in @ X3 @ X2 )
=> ~ ( in @ X3 @ X1 ) ) ) ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f6,plain,
~ ( ( subsetE = $true )
=> ( ( setminusER = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ( subset @ X1 @ ( setminus @ X0 @ X2 ) )
= $true )
=> ( ( ( in @ X3 @ X2 )
= $true )
=> ( ( in @ X3 @ X1 )
!= $true ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X1 @ X0 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) ) )
= subsetE ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( ( subsetE = $true )
<=> ! [X1: $i,X2: $i,X0: $i] :
( ( $true
= ( subset @ X1 @ X0 ) )
=> ( ( ( in @ X2 @ X1 )
= $true )
=> ( ( in @ X2 @ X0 )
= $true ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X1 @ ( setminus @ X2 @ X0 ) )
=> ~ ( in @ X1 @ X0 ) )
= setminusER ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( ! [X0: $i,X1: $i,X2: $i] :
( ( $true
= ( in @ X1 @ ( setminus @ X2 @ X0 ) ) )
=> ( $true
!= ( in @ X1 @ X0 ) ) )
<=> ( setminusER = $true ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
~ ( ( subsetE = $true )
=> ( ( setminusER = $true )
=> ! [X1: $i,X0: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ( subset @ X1 @ ( setminus @ X0 @ X2 ) )
= $true )
=> ( ( ( in @ X3 @ X2 )
= $true )
=> ( ( in @ X3 @ X1 )
!= $true ) ) ) ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f12,plain,
( ! [X1: $i,X2: $i,X0: $i] :
( ( $true
= ( in @ X1 @ ( setminus @ X2 @ X0 ) ) )
=> ( $true
!= ( in @ X1 @ X0 ) ) )
<=> ( setminusER = $true ) ),
inference(flattening,[],[f10]) ).
thf(f13,plain,
( ( subsetE = $true )
<=> ! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X2 @ X0 )
= $true )
| ( ( in @ X2 @ X1 )
!= $true )
| ( $true
!= ( subset @ X1 @ X0 ) ) ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f14,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( $true
!= ( subset @ X1 @ X0 ) )
| ( ( in @ X2 @ X0 )
= $true )
| ( ( in @ X2 @ X1 )
!= $true ) )
<=> ( subsetE = $true ) ),
inference(flattening,[],[f13]) ).
thf(f15,plain,
( ( setminusER = $true )
<=> ! [X1: $i,X2: $i,X0: $i] :
( ( $true
!= ( in @ X1 @ ( setminus @ X2 @ X0 ) ) )
| ( $true
!= ( in @ X1 @ X0 ) ) ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f16,plain,
( ? [X1: $i,X0: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( ( in @ X3 @ X1 )
= $true )
& ( ( in @ X3 @ X2 )
= $true )
& ( ( subset @ X1 @ ( setminus @ X0 @ X2 ) )
= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( in @ X2 @ ( powerset @ X0 ) )
= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
& ( setminusER = $true )
& ( subsetE = $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f17,plain,
( ( subsetE = $true )
& ( setminusER = $true )
& ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
& ? [X3: $i] :
( ( ( subset @ X1 @ ( setminus @ X0 @ X2 ) )
= $true )
& ( ( in @ X3 @ X2 )
= $true )
& ( ( in @ X3 @ X1 )
= $true )
& ( ( in @ X3 @ X0 )
= $true ) ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) ) ),
inference(flattening,[],[f16]) ).
thf(f18,plain,
( ( ! [X2: $i,X0: $i,X1: $i] :
( ( $true
!= ( subset @ X1 @ X0 ) )
| ( ( in @ X2 @ X0 )
= $true )
| ( ( in @ X2 @ X1 )
!= $true ) )
| ( subsetE != $true ) )
& ( ( subsetE = $true )
| ? [X2: $i,X0: $i,X1: $i] :
( ( $true
= ( subset @ X1 @ X0 ) )
& ( ( in @ X2 @ X0 )
!= $true )
& ( ( in @ X2 @ X1 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f14]) ).
thf(f19,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X2 @ X1 )
!= $true )
| ( ( in @ X0 @ X1 )
= $true )
| ( ( in @ X0 @ X2 )
!= $true ) )
| ( subsetE != $true ) )
& ( ( subsetE = $true )
| ? [X3: $i,X4: $i,X5: $i] :
( ( $true
= ( subset @ X5 @ X4 ) )
& ( $true
!= ( in @ X3 @ X4 ) )
& ( ( in @ X3 @ X5 )
= $true ) ) ) ),
inference(rectify,[],[f18]) ).
thf(f20,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X2 @ X1 )
!= $true )
| ( ( in @ X0 @ X1 )
= $true )
| ( ( in @ X0 @ X2 )
!= $true ) )
| ( subsetE != $true ) )
& ( ( subsetE = $true )
| ( ( $true
= ( subset @ sK2 @ sK1 ) )
& ( ( in @ sK0 @ sK1 )
!= $true )
& ( $true
= ( in @ sK0 @ sK2 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0),skolemize(X4,sK1),skolemize(X5,sK2)],[f19]) ).
thf(f21,plain,
( ( subsetE = $true )
& ( setminusER = $true )
& ( $true
= ( in @ sK5 @ ( powerset @ sK3 ) ) )
& ( $true
= ( subset @ sK4 @ ( setminus @ sK3 @ sK5 ) ) )
& ( ( in @ sK6 @ sK5 )
= $true )
& ( $true
= ( in @ sK6 @ sK4 ) )
& ( ( in @ sK6 @ sK3 )
= $true )
& ( $true
= ( in @ sK4 @ ( powerset @ sK3 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f17]) ).
thf(f22,plain,
( ( ( setminusER = $true )
| ? [X1: $i,X2: $i,X0: $i] :
( ( $true
= ( in @ X1 @ ( setminus @ X2 @ X0 ) ) )
& ( $true
= ( in @ X1 @ X0 ) ) ) )
& ( ! [X1: $i,X2: $i,X0: $i] :
( ( $true
!= ( in @ X1 @ ( setminus @ X2 @ X0 ) ) )
| ( $true
!= ( in @ X1 @ X0 ) ) )
| ( setminusER != $true ) ) ),
inference(nnf_transformation,[],[f15]) ).
thf(f23,plain,
( ( ( setminusER = $true )
| ? [X0: $i,X1: $i,X2: $i] :
( ( $true
= ( in @ X0 @ ( setminus @ X1 @ X2 ) ) )
& ( ( in @ X0 @ X2 )
= $true ) ) )
& ( ! [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X3 @ ( setminus @ X4 @ X5 ) )
!= $true )
| ( ( in @ X3 @ X5 )
!= $true ) )
| ( setminusER != $true ) ) ),
inference(rectify,[],[f22]) ).
thf(f24,plain,
( ( ( setminusER = $true )
| ( ( $true
= ( in @ sK7 @ ( setminus @ sK8 @ sK9 ) ) )
& ( ( in @ sK7 @ sK9 )
= $true ) ) )
& ( ! [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X3 @ ( setminus @ X4 @ X5 ) )
!= $true )
| ( ( in @ X3 @ X5 )
!= $true ) )
| ( setminusER != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK9]),skolemize(X0,sK7),skolemize(X1,sK8),skolemize(X2,sK9)],[f23]) ).
thf(f28,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ X1 )
= $true )
| ( ( in @ X0 @ X2 )
!= $true )
| ( subsetE != $true )
| ( ( subset @ X2 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f31,plain,
( $true
= ( in @ sK6 @ sK4 ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f32,plain,
( ( in @ sK6 @ sK5 )
= $true ),
inference(cnf_transformation,[],[f21]) ).
thf(f33,plain,
( $true
= ( subset @ sK4 @ ( setminus @ sK3 @ sK5 ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f35,plain,
setminusER = $true,
inference(cnf_transformation,[],[f21]) ).
thf(f36,plain,
subsetE = $true,
inference(cnf_transformation,[],[f21]) ).
thf(f37,plain,
! [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X3 @ X5 )
!= $true )
| ( ( in @ X3 @ ( setminus @ X4 @ X5 ) )
!= $true )
| ( setminusER != $true ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f47,definition,
( spl10_2
<=> ( subsetE = $true ) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
thf(f51,definition,
( spl10_3
<=> ! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ X1 )
= $true )
| ( ( subset @ X2 @ X1 )
!= $true )
| ( ( in @ X0 @ X2 )
!= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
thf(f52,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ X1 )
= $true )
| ( ( in @ X0 @ X2 )
!= $true )
| ( ( subset @ X2 @ X1 )
!= $true ) )
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f51]) ).
thf(f53,plain,
( ~ spl10_2
| spl10_3 ),
inference(avatar_split_clause,[],[f28,f51,f47]) ).
thf(f60,definition,
( spl10_5
<=> ( setminusER = $true ) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
thf(f78,plain,
spl10_2,
inference(avatar_split_clause,[],[f36,f47]) ).
thf(f84,plain,
spl10_5,
inference(avatar_split_clause,[],[f35,f60]) ).
thf(f86,definition,
( spl10_10
<=> ( ( in @ sK6 @ sK5 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition]) ).
thf(f88,plain,
( ( ( in @ sK6 @ sK5 )
= $true )
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f86]) ).
thf(f89,plain,
spl10_10,
inference(avatar_split_clause,[],[f32,f86]) ).
thf(f91,definition,
( spl10_11
<=> ( $true
= ( in @ sK6 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl10_11])],[avatar_definition]) ).
thf(f93,plain,
( ( $true
= ( in @ sK6 @ sK4 ) )
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f94,plain,
spl10_11,
inference(avatar_split_clause,[],[f31,f91]) ).
thf(f106,definition,
( spl10_14
<=> ( $true
= ( subset @ sK4 @ ( setminus @ sK3 @ sK5 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl10_14])],[avatar_definition]) ).
thf(f108,plain,
( ( $true
= ( subset @ sK4 @ ( setminus @ sK3 @ sK5 ) ) )
| ~ spl10_14 ),
inference(avatar_component_clause,[],[f106]) ).
thf(f109,plain,
spl10_14,
inference(avatar_split_clause,[],[f33,f106]) ).
thf(f111,definition,
( spl10_15
<=> ! [X4: $i,X5: $i,X3: $i] :
( ( ( in @ X3 @ X5 )
!= $true )
| ( ( in @ X3 @ ( setminus @ X4 @ X5 ) )
!= $true ) ) ),
introduced(definition,[new_symbols(definition,[spl10_15])],[avatar_definition]) ).
thf(f112,plain,
( ! [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X3 @ ( setminus @ X4 @ X5 ) )
!= $true )
| ( ( in @ X3 @ X5 )
!= $true ) )
| ~ spl10_15 ),
inference(avatar_component_clause,[],[f111]) ).
thf(f113,plain,
( ~ spl10_5
| spl10_15 ),
inference(avatar_split_clause,[],[f37,f111,f60]) ).
thf(f116,plain,
( ! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( subset @ X3 @ ( setminus @ X1 @ X2 ) )
!= $true )
| ( ( in @ X0 @ X2 )
!= $true )
| ( $true
!= ( in @ X0 @ X3 ) )
| ( $true != $true ) )
| ~ spl10_3
| ~ spl10_15 ),
inference(superposition,[],[f112,f52]) ).
thf(f117,plain,
( ! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( subset @ X3 @ ( setminus @ X1 @ X2 ) )
!= $true )
| ( $true
!= ( in @ X0 @ X3 ) )
| ( ( in @ X0 @ X2 )
!= $true ) )
| ~ spl10_3
| ~ spl10_15 ),
inference(trivial_inequality_removal,[],[f116]) ).
thf(f118,plain,
( ! [X0: $i] :
( ( $true != $true )
| ( $true
!= ( in @ X0 @ sK4 ) )
| ( $true
!= ( in @ X0 @ sK5 ) ) )
| ~ spl10_3
| ~ spl10_14
| ~ spl10_15 ),
inference(superposition,[],[f117,f108]) ).
thf(f119,plain,
( ! [X0: $i] :
( ( $true
!= ( in @ X0 @ sK5 ) )
| ( $true
!= ( in @ X0 @ sK4 ) ) )
| ~ spl10_3
| ~ spl10_14
| ~ spl10_15 ),
inference(trivial_inequality_removal,[],[f118]) ).
thf(f121,plain,
( ( $true
!= ( in @ sK6 @ sK4 ) )
| ( $true != $true )
| ~ spl10_3
| ~ spl10_10
| ~ spl10_14
| ~ spl10_15 ),
inference(superposition,[],[f119,f88]) ).
thf(f122,plain,
( ( $true
!= ( in @ sK6 @ sK4 ) )
| ~ spl10_3
| ~ spl10_10
| ~ spl10_14
| ~ spl10_15 ),
inference(trivial_inequality_removal,[],[f121]) ).
thf(f124,plain,
( $false
| ~ spl10_3
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14
| ~ spl10_15 ),
inference(forward_subsumption_resolution,[],[f122,f93]) ).
thf(f125,plain,
( ~ spl10_3
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14
| ~ spl10_15 ),
inference(avatar_contradiction_clause,[],[f124]) ).
cnf(s2,plain,
( ~ spl10_2
| spl10_3 ),
inference(sat_conversion,[],[f53]) ).
cnf(s7,plain,
spl10_2,
inference(sat_conversion,[],[f78]) ).
cnf(s9,plain,
spl10_5,
inference(sat_conversion,[],[f84]) ).
cnf(s10,plain,
spl10_10,
inference(sat_conversion,[],[f89]) ).
cnf(s11,plain,
spl10_11,
inference(sat_conversion,[],[f94]) ).
cnf(s14,plain,
spl10_14,
inference(sat_conversion,[],[f109]) ).
cnf(s15,plain,
( ~ spl10_5
| spl10_15 ),
inference(sat_conversion,[],[f113]) ).
cnf(s16,plain,
( ~ spl10_3
| ~ spl10_10
| ~ spl10_11
| ~ spl10_14
| ~ spl10_15 ),
inference(sat_conversion,[],[f125]) ).
cnf(s17,plain,
spl10_15,
inference(rat,[],[s15,s9]) ).
cnf(s18,plain,
~ spl10_3,
inference(rat,[],[s16,s10,s14,s11,s17]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s2,s18,s7]) ).
thf(f126,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU723^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n017.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 14:12:22 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/0.24 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.22/0.29 % (399436)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.29 % (399444)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=4214985560: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.22/0.29 % (399444) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-399436-399444"...
% 0.22/0.29 % (399444)...printing done.
% 0.22/0.29 % (399447)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.29 % (399447)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.22/0.29 % (399444)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.29 % (399444)------------------------------
% 0.22/0.29 % (399444)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (399444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (399444)CaDiCaL version: 2.1.3
% 0.22/0.29 % (399444)Termination reason: Refutation
% 0.22/0.29 % (399444)Time elapsed: 0.003 s
% 0.22/0.29 % (399444)Peak memory usage: 13 MB
% 0.22/0.29 % (399444)Instructions burned: 7 (million)
% 0.22/0.29 % (399436)Success in time 0.036 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------