%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET611^3 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:21 AM UTC 2026
% Result : Theorem 0.21s 0.26s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 90 ( 18 unt; 0 typ; 5 def)
% Number of atoms : 491 ( 107 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 398 ( 79 ~; 103 |; 38 &; 170 @)
% ( 7 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 38 ( 35 usr; 9 con; 0-4 aty)
% Number of variables : 87 ( 14 sgn 14 !; 4 ?; 87 :)
% 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_17,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_18,type,
vNOT: $o > $o ).
thf(func_def_19,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_20,type,
vAND: $o > $o > $o ).
thf(func_def_21,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_22,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_23,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_24,type,
vOR: $o > $o > $o ).
thf(func_def_25,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_26,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_27,type,
vIMP: $o > $o > $o ).
thf(func_def_28,type,
sK0: $i > $o ).
thf(func_def_29,type,
sK1: $i > $o ).
thf(f3,axiom,
( ( ^ [X0: $i] : $false )
= emptyset ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',emptyset) ).
thf(f8,axiom,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',intersection) ).
thf(f9,axiom,
( setminus
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^0.ax',setminus) ).
thf(f15,conjecture,
! [X1: $i > $o,X0: $i > $o] :
( ( ( setminus @ X0 @ X1 )
= X0 )
<=> ( ( intersection @ X0 @ X1 )
= emptyset ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ! [X1: $i > $o,X0: $i > $o] :
( ( ( setminus @ X0 @ X1 )
= X0 )
<=> ( ( intersection @ X0 @ X1 )
= emptyset ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f17,plain,
( emptyset
= ( ^ [Y0: $i] : $false ) ),
inference(fool_elimination,[],[f3]) ).
thf(f24,plain,
( setminus
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f25,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f24]) ).
thf(f31,plain,
( intersection
= ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f32,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f31]) ).
thf(f39,plain,
? [X0: $i > $o,X1: $i > $o] :
( ( ( intersection @ X0 @ X1 )
= emptyset )
<~> ( ( setminus @ X0 @ X1 )
= X0 ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f40,plain,
? [X0: $i > $o,X1: $i > $o] :
( ( ( ( setminus @ X0 @ X1 )
!= X0 )
| ( emptyset
!= ( intersection @ X0 @ X1 ) ) )
& ( ( ( setminus @ X0 @ X1 )
= X0 )
| ( ( intersection @ X0 @ X1 )
= emptyset ) ) ),
inference(nnf_transformation,[],[f39]) ).
thf(f41,plain,
( ( ( sK0
!= ( setminus @ sK0 @ sK1 ) )
| ( emptyset
!= ( intersection @ sK0 @ sK1 ) ) )
& ( ( sK0
= ( setminus @ sK0 @ sK1 ) )
| ( emptyset
= ( intersection @ sK0 @ sK1 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f40]) ).
thf(f42,plain,
( emptyset
= ( ^ [Y0: $i] : $false ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f49,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f32]) ).
thf(f51,plain,
( setminus
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f53,plain,
( ( sK0
= ( setminus @ sK0 @ sK1 ) )
| ( emptyset
= ( intersection @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f54,plain,
( ( sK0
!= ( setminus @ sK0 @ sK1 ) )
| ( emptyset
!= ( intersection @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f41]) ).
thf(f61,plain,
( ( ( ^ [Y0: $i] : $false )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK0
@ sK1 ) )
| ( sK0
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f54,f51,f42,f49]) ).
thf(f62,plain,
( ( ( ^ [Y0: $i] : $false )
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK0
@ sK1 ) )
| ( sK0
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ~ ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f53,f51,f42,f49]) ).
thf(f63,plain,
( ( sK0
= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) )
| ( ( ^ [Y0: $i] : $false )
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f62]) ).
thf(f64,plain,
( ( sK0
!= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) )
| ( ( ^ [Y0: $i] : $false )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f61]) ).
thf(f66,definition,
( spl2_1
<=> ( ( ^ [Y0: $i] : $false )
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f67,plain,
( ( ( ^ [Y0: $i] : $false )
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f69,definition,
( spl2_2
<=> ( sK0
= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f70,plain,
( ( sK0
= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f71,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f63,f69,f66]) ).
thf(f72,plain,
( ( ( ^ [Y0: $i] : $false )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| spl2_1 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f73,plain,
( ( sK0
!= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) )
| spl2_2 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f74,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f64,f69,f66]) ).
thf(f75,plain,
( ( ( ^ [Y0: $i] : $false
@ sK3 )
!= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK3 ) )
| spl2_1 ),
inference(negative_extensionality,[],[f72]) ).
thf(f76,plain,
( ( $true
= ( ^ [Y0: $i] : $false
@ sK3 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK3 ) )
| spl2_1 ),
inference(xor_proxy_clausification,[],[f75]) ).
thf(f80,plain,
( ( $true
= ( ( sK0 @ sK3 )
& ( sK1 @ sK3 ) ) )
| ( $true = $false )
| spl2_1 ),
inference(beta-eta_normalization,[],[f76]) ).
thf(f81,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK3 ) )
| spl2_1 ),
inference(and_proxy_clausification,[],[f80]) ).
thf(f82,plain,
( ( $true
= ( sK0 @ sK3 ) )
| ( $true = $false )
| spl2_1 ),
inference(and_proxy_clausification,[],[f80]) ).
thf(f83,plain,
( ( $true
= ( sK0 @ sK3 ) )
| spl2_1 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f84,plain,
( ( $true
= ( sK1 @ sK3 ) )
| spl2_1 ),
inference(trivial_inequality_removal,[],[f81]) ).
thf(f85,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ X1 )
= ( sK0 @ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f70]) ).
thf(f87,plain,
( ! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ X1 ) )
| ( ( sK0 @ X1 )
= $false ) )
| ~ spl2_2 ),
inference(iff_proxy_clausification,[],[f85]) ).
thf(f92,plain,
( ! [X1: $i] :
( ( $true
= ( ~ ( sK1 @ X1 )
& ( sK0 @ X1 ) ) )
| ( ( sK0 @ X1 )
= $false ) )
| ~ spl2_2 ),
inference(beta-eta_normalization,[],[f87]) ).
thf(f94,plain,
( ! [X1: $i] :
( ( ( sK0 @ X1 )
= $false )
| ( $true
= ( ~ ( sK1 @ X1 ) ) ) )
| ~ spl2_2 ),
inference(and_proxy_clausification,[],[f92]) ).
thf(f95,plain,
( ! [X1: $i] :
( ( ( sK1 @ X1 )
= $false )
| ( ( sK0 @ X1 )
= $false ) )
| ~ spl2_2 ),
inference(not_proxy_clausification,[],[f94]) ).
thf(f118,plain,
( ( ( sK0 @ sK3 )
= $false )
| ( $true = $false )
| spl2_1
| ~ spl2_2 ),
inference(constrained_superposition,[],[f84,f95]) ).
thf(f119,plain,
( ( ( sK0 @ sK3 )
= $false )
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f118]) ).
thf(f121,plain,
( ( $true = $false )
| spl2_1
| ~ spl2_2 ),
inference(backward_demodulation,[],[f83,f119]) ).
thf(f122,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f121]) ).
thf(f123,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f122]) ).
thf(f128,plain,
( ! [X1: $i] :
( ( ^ [Y0: $i] : $false
@ X1 )
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[],[f67]) ).
thf(f129,plain,
( ! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] : $false
@ X1 ) )
| ( $false
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ X1 ) ) )
| ~ spl2_1 ),
inference(iff_proxy_clausification,[],[f128]) ).
thf(f134,plain,
( ! [X1: $i] :
( ( $true = $false )
| ( ( ( sK0 @ X1 )
& ( sK1 @ X1 ) )
= $false ) )
| ~ spl2_1 ),
inference(beta-eta_normalization,[],[f129]) ).
thf(f135,plain,
( ! [X1: $i] :
( ( ( sK1 @ X1 )
= $false )
| ( $true = $false )
| ( ( sK0 @ X1 )
= $false ) )
| ~ spl2_1 ),
inference(and_proxy_clausification,[],[f134]) ).
thf(f136,plain,
( ! [X1: $i] :
( ( ( sK1 @ X1 )
= $false )
| ( ( sK0 @ X1 )
= $false ) )
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f135]) ).
thf(f146,plain,
( ( ( sK0 @ sK6 )
!= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK6 ) )
| spl2_2 ),
inference(negative_extensionality,[],[f73]) ).
thf(f148,plain,
( ( $true
= ( sK0 @ sK6 ) )
| ( $true
= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK6 ) )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f146]) ).
thf(f149,plain,
( ( $false
= ( ^ [Y0: $i] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK6 ) )
| ( ( sK0 @ sK6 )
= $false )
| spl2_2 ),
inference(xor_proxy_clausification,[],[f146]) ).
thf(f150,plain,
( ( $false
= ( ~ ( sK1 @ sK6 )
& ( sK0 @ sK6 ) ) )
| ( ( sK0 @ sK6 )
= $false )
| spl2_2 ),
inference(beta-eta_normalization,[],[f149]) ).
thf(f151,plain,
( ( ( ~ ( sK1 @ sK6 ) )
= $false )
| ( ( sK0 @ sK6 )
= $false )
| ( ( sK0 @ sK6 )
= $false )
| spl2_2 ),
inference(and_proxy_clausification,[],[f150]) ).
thf(f152,plain,
( ( ( sK0 @ sK6 )
= $false )
| ( $true
= ( sK1 @ sK6 ) )
| ( ( sK0 @ sK6 )
= $false )
| spl2_2 ),
inference(not_proxy_clausification,[],[f151]) ).
thf(f153,plain,
( ( ( sK0 @ sK6 )
= $false )
| ( $true
= ( sK1 @ sK6 ) )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f152]) ).
thf(f154,plain,
( ( $true
= ( ~ ( sK1 @ sK6 )
& ( sK0 @ sK6 ) ) )
| ( $true
= ( sK0 @ sK6 ) )
| spl2_2 ),
inference(beta-eta_normalization,[],[f148]) ).
thf(f155,plain,
( ( $true
= ( sK0 @ sK6 ) )
| ( $true
= ( sK0 @ sK6 ) )
| spl2_2 ),
inference(and_proxy_clausification,[],[f154]) ).
thf(f158,plain,
( ( $true
= ( sK0 @ sK6 ) )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f155]) ).
thf(f160,definition,
( spl2_5
<=> ( ( sK0 @ sK6 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
thf(f161,plain,
( ( ( sK0 @ sK6 )
= $false )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f160]) ).
thf(f163,definition,
( spl2_6
<=> ( $true
= ( sK1 @ sK6 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
thf(f164,plain,
( ( $true
= ( sK1 @ sK6 ) )
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f163]) ).
thf(f165,plain,
( spl2_5
| spl2_6
| spl2_2 ),
inference(avatar_split_clause,[],[f153,f69,f163,f160]) ).
thf(f170,definition,
( spl2_8
<=> ( $true
= ( sK0 @ sK6 ) ) ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
thf(f171,plain,
( ( $true
= ( sK0 @ sK6 ) )
| ~ spl2_8 ),
inference(avatar_component_clause,[],[f170]) ).
thf(f173,plain,
( spl2_8
| spl2_2 ),
inference(avatar_split_clause,[],[f158,f69,f170]) ).
thf(f174,plain,
( ( $true = $false )
| ~ spl2_5
| ~ spl2_8 ),
inference(forward_demodulation,[],[f171,f161]) ).
thf(f175,plain,
( $false
| ~ spl2_5
| ~ spl2_8 ),
inference(trivial_inequality_removal,[],[f174]) ).
thf(f176,plain,
( ~ spl2_5
| ~ spl2_8 ),
inference(avatar_contradiction_clause,[],[f175]) ).
thf(f177,plain,
( ( ( sK0 @ sK6 )
= $false )
| ( $true = $false )
| ~ spl2_1
| ~ spl2_6 ),
inference(constrained_superposition,[],[f136,f164]) ).
thf(f179,plain,
( ( ( sK0 @ sK6 )
= $false )
| ~ spl2_1
| ~ spl2_6 ),
inference(trivial_inequality_removal,[],[f177]) ).
thf(f181,plain,
( spl2_5
| ~ spl2_1
| ~ spl2_6 ),
inference(avatar_split_clause,[],[f179,f163,f66,f160]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f71]) ).
cnf(s2,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f74]) ).
cnf(s4,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f123]) ).
cnf(s6,plain,
( spl2_2
| spl2_5
| spl2_6 ),
inference(sat_conversion,[],[f165]) ).
cnf(s8,plain,
( spl2_2
| spl2_8 ),
inference(sat_conversion,[],[f173]) ).
cnf(s9,plain,
( ~ spl2_5
| ~ spl2_8 ),
inference(sat_conversion,[],[f176]) ).
cnf(s10,plain,
( ~ spl2_1
| spl2_5
| ~ spl2_6 ),
inference(sat_conversion,[],[f181]) ).
cnf(s12,plain,
spl2_1,
inference(rat,[],[s1,s4]) ).
cnf(s13,plain,
~ spl2_2,
inference(rat,[],[s2,s12]) ).
cnf(s14,plain,
spl2_8,
inference(rat,[],[s8,s13]) ).
cnf(s15,plain,
~ spl2_5,
inference(rat,[],[s9,s14]) ).
cnf(s16,plain,
spl2_6,
inference(rat,[],[s6,s13,s15]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s10,s12,s15,s16]) ).
thf(f182,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET611^3 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n007.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 13:37:11 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/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.21/0.26 % (3367674)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.26 % (3367684)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2891668006:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.26 % (3367684) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3367674-3367684"...
% 0.21/0.26 % (3367685)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.26 % (3367685)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.21/0.26 % (3367684)...printing done.
% 0.21/0.26 % (3367684)Refutation found. Thanks to Tanya!
% 0.21/0.26 % SZS status Theorem for theBenchmark
% 0.21/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27 % (3367684)------------------------------
% 0.21/0.27 % (3367684)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27 % (3367684)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27 % (3367684)CaDiCaL version: 2.1.3
% 0.21/0.27 % (3367684)Termination reason: Refutation
% 0.21/0.27 % (3367684)Time elapsed: 0.004 s
% 0.21/0.27 % (3367684)Peak memory usage: 13 MB
% 0.21/0.27 % (3367684)Instructions burned: 9 (million)
% 0.21/0.27 % (3367674)Success in time 0.02 s
% 0.21/0.27 % Vampire exiting
%------------------------------------------------------------------------------