%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV444^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:38:38 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 102 ( 12 unt; 0 typ; 11 def)
% Number of atoms : 504 ( 114 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 486 ( 106 ~; 142 |; 3 &; 222 @)
% ( 12 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 21 ( 18 usr; 15 con; 0-3 aty)
% Number of variables : 61 ( 0 sgn 50 !; 11 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
sK1: sK0 > $o ).
thf(func_def_3,type,
sK2: sK0 > $o ).
thf(func_def_4,type,
sK3: sK0 ).
thf(func_def_7,type,
vNOT: $o > $o ).
thf(func_def_9,type,
sK5: sK0 ).
thf(f1,axiom,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_') ).
thf(f2,conjecture,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= ( X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/EXTENSION_') ).
thf(f3,negated_conjecture,
~ ! [X0: $tType,X2: X0 > $o,X1: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= ( X1 = X2 ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= ( X1 = X2 ) ),
inference(rectify,[],[f3]) ).
thf(f5,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
<=> ( X1 = X2 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
! [X0: $tType,X1: X0,X2: X0 > $o] :
( ( X2 @ X1 )
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( X1 = X2 )
<~> ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f8,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ? [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
!= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
| ( X1 != X2 ) )
& ( ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
| ( X1 = X2 ) ) ),
inference(nnf_transformation,[],[f7]) ).
thf(f9,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ? [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
!= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
| ( X1 != X2 ) )
& ( ! [X4: X0] :
( ( 'const/sets/IN' @ X0 @ X4 @ X2 )
= ( 'const/sets/IN' @ X0 @ X4 @ X1 ) )
| ( X1 = X2 ) ) ),
inference(rectify,[],[f8]) ).
thf(f10,plain,
( ( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ( sK2 != sK1 ) )
& ( ! [X4: sK0] :
( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) )
| ( sK2 = sK1 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f9]) ).
thf(f11,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( X2 @ X1 )
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f12,plain,
! [X4: sK0] :
( ( sK2 = sK1 )
| ( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f13,plain,
( ( sK2 != sK1 )
| ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f16,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
= $true )
| ( sK2 != sK1 )
| ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 )
= $true ) ),
inference(xor_proxy_clausification,[],[f13]) ).
thf(f17,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 )
= $false )
| ( sK2 != sK1 )
| ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
= $false ) ),
inference(xor_proxy_clausification,[],[f13]) ).
thf(f18,plain,
! [X4: sK0] :
( ( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= $true )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) )
| ( sK2 = sK1 ) ),
inference(iff_proxy_clausification,[],[f12]) ).
thf(f19,plain,
! [X4: sK0] :
( ( sK2 = sK1 )
| ( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ),
inference(iff_proxy_clausification,[],[f12]) ).
thf(f20,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(iff_proxy_clausification,[],[f11]) ).
thf(f21,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) )
| ( ( X2 @ X1 )
= $false ) ),
inference(iff_proxy_clausification,[],[f11]) ).
thf(f23,definition,
( spl4_1
<=> ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f25,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
= $false )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f27,definition,
( spl4_2
<=> ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f29,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 )
= $false )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f31,definition,
( spl4_3
<=> ( sK2 = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f32,plain,
( ( sK2 = sK1 )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f33,plain,
( ( sK2 != sK1 )
| spl4_3 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f34,plain,
( spl4_1
| spl4_2
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f17,f31,f27,f23]) ).
thf(f36,definition,
( spl4_4
<=> ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f37,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
!= $true )
| spl4_4 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f38,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
= $true )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f40,definition,
( spl4_5
<=> ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
thf(f42,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 )
= $true )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f43,plain,
( ~ spl4_3
| spl4_4
| spl4_5 ),
inference(avatar_split_clause,[],[f16,f40,f36,f31]) ).
thf(f45,definition,
( spl4_6
<=> ! [X4: sK0] :
( ( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
thf(f46,plain,
( ! [X4: sK0] :
( ( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f47,plain,
( spl4_6
| spl4_3 ),
inference(avatar_split_clause,[],[f19,f31,f45]) ).
thf(f49,definition,
( spl4_7
<=> ! [X4: sK0] :
( ( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= $true )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_7])],[avatar_definition]) ).
thf(f50,plain,
( ! [X4: sK0] :
( ( ( 'const/sets/IN' @ sK0 @ X4 @ sK1 )
= $true )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X4 @ sK2 ) ) )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f49]) ).
thf(f51,plain,
( spl4_7
| spl4_3 ),
inference(avatar_split_clause,[],[f18,f31,f49]) ).
thf(f57,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 )
= $true )
| ~ spl4_3
| ~ spl4_4 ),
inference(constrained_superposition,[],[f38,f32]) ).
thf(f58,plain,
( ( $true = $false )
| ~ spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(forward_demodulation,[],[f57,f29]) ).
thf(f59,plain,
( $false
| ~ spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f60,plain,
( ~ spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f59]) ).
thf(f61,plain,
( ( ( sK1 @ sK5 )
!= ( sK2 @ sK5 ) )
| spl4_3 ),
inference(negative_extensionality,[],[f33]) ).
thf(f62,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK2 @ sK5 ) )
| spl4_3 ),
inference(xor_proxy_clausification,[],[f61]) ).
thf(f63,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| spl4_3 ),
inference(xor_proxy_clausification,[],[f61]) ).
thf(f65,definition,
( spl4_8
<=> ( ( sK1 @ sK5 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_8])],[avatar_definition]) ).
thf(f67,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl4_8 ),
inference(avatar_component_clause,[],[f65]) ).
thf(f69,definition,
( spl4_9
<=> ( ( sK2 @ sK5 )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl4_9])],[avatar_definition]) ).
thf(f71,plain,
( ( ( sK2 @ sK5 )
= $false )
| ~ spl4_9 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f72,plain,
( spl4_8
| spl4_9
| spl4_3 ),
inference(avatar_split_clause,[],[f63,f31,f69,f65]) ).
thf(f74,definition,
( spl4_10
<=> ( ( sK1 @ sK5 )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl4_10])],[avatar_definition]) ).
thf(f76,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl4_10 ),
inference(avatar_component_clause,[],[f74]) ).
thf(f78,definition,
( spl4_11
<=> ( $true
= ( sK2 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_11])],[avatar_definition]) ).
thf(f79,plain,
( ( $true
!= ( sK2 @ sK5 ) )
| spl4_11 ),
inference(avatar_component_clause,[],[f78]) ).
thf(f80,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl4_11 ),
inference(avatar_component_clause,[],[f78]) ).
thf(f81,plain,
( spl4_10
| spl4_11
| spl4_3 ),
inference(avatar_split_clause,[],[f62,f31,f78,f74]) ).
thf(f82,plain,
( ( $true = $false )
| ~ spl4_9
| ~ spl4_11 ),
inference(forward_demodulation,[],[f71,f80]) ).
thf(f83,plain,
( $false
| ~ spl4_9
| ~ spl4_11 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f84,plain,
( ~ spl4_9
| ~ spl4_11 ),
inference(avatar_contradiction_clause,[],[f83]) ).
thf(f94,plain,
( ! [X0: sK0] :
( ( $true = $false )
| ( ( sK1 @ X0 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ X0 @ sK2 )
= $false ) )
| ~ spl4_7 ),
inference(constrained_superposition,[],[f20,f50]) ).
thf(f101,plain,
( ! [X0: sK0] :
( ( ( 'const/sets/IN' @ sK0 @ X0 @ sK2 )
= $false )
| ( ( sK1 @ X0 )
= $true ) )
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f94]) ).
thf(f109,plain,
( ! [X0: sK0] :
( ( ( sK1 @ X0 )
= $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X0 @ sK2 ) )
| ( $true = $false ) )
| ~ spl4_6 ),
inference(constrained_superposition,[],[f21,f46]) ).
thf(f113,plain,
( ! [X0: sK0] :
( ( ( sK1 @ X0 )
= $true )
| ( ( sK2 @ X0 )
= $false )
| ( $true = $false ) )
| ~ spl4_7 ),
inference(constrained_superposition,[],[f101,f21]) ).
thf(f115,plain,
( ! [X0: sK0] :
( ( $true
= ( 'const/sets/IN' @ sK0 @ X0 @ sK2 ) )
| ( ( sK1 @ X0 )
= $false ) )
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f109]) ).
thf(f116,plain,
( ! [X0: sK0] :
( ( ( sK1 @ X0 )
= $true )
| ( ( sK2 @ X0 )
= $false ) )
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f113]) ).
thf(f119,plain,
( ( ( sK2 @ sK5 )
= $false )
| ( $true = $false )
| ~ spl4_7
| ~ spl4_8 ),
inference(constrained_superposition,[],[f116,f67]) ).
thf(f122,plain,
( ( ( sK2 @ sK5 )
= $false )
| ~ spl4_7
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f119]) ).
thf(f126,plain,
( ( $true = $false )
| ~ spl4_7
| ~ spl4_8
| ~ spl4_11 ),
inference(forward_demodulation,[],[f122,f80]) ).
thf(f127,plain,
( $false
| ~ spl4_7
| ~ spl4_8
| ~ spl4_11 ),
inference(trivial_inequality_removal,[],[f126]) ).
thf(f128,plain,
( ~ spl4_7
| ~ spl4_8
| ~ spl4_11 ),
inference(avatar_contradiction_clause,[],[f127]) ).
thf(f138,plain,
( ! [X0: sK0] :
( ( $true = $false )
| ( ( sK1 @ X0 )
= $false )
| ( $true
= ( sK2 @ X0 ) ) )
| ~ spl4_6 ),
inference(constrained_superposition,[],[f20,f115]) ).
thf(f139,plain,
( ! [X0: sK0] :
( ( ( sK1 @ X0 )
= $false )
| ( $true
= ( sK2 @ X0 ) ) )
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f143,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $true = $false )
| ~ spl4_6
| ~ spl4_10 ),
inference(constrained_superposition,[],[f139,f76]) ).
thf(f149,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl4_6
| ~ spl4_10 ),
inference(trivial_inequality_removal,[],[f143]) ).
thf(f153,plain,
( $false
| ~ spl4_6
| ~ spl4_10
| spl4_11 ),
inference(forward_subsumption_resolution,[],[f149,f79]) ).
thf(f154,plain,
( ~ spl4_6
| ~ spl4_10
| spl4_11 ),
inference(avatar_contradiction_clause,[],[f153]) ).
thf(f155,plain,
( ( $true = $false )
| ~ spl4_1
| ~ spl4_4 ),
inference(forward_demodulation,[],[f25,f38]) ).
thf(f156,plain,
( $false
| ~ spl4_1
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f155]) ).
thf(f157,plain,
( ~ spl4_1
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f156]) ).
thf(f160,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 )
!= $true )
| ~ spl4_3
| spl4_4 ),
inference(forward_demodulation,[],[f37,f32]) ).
thf(f164,plain,
( $false
| ~ spl4_3
| spl4_4
| ~ spl4_5 ),
inference(forward_subsumption_resolution,[],[f160,f42]) ).
thf(f165,plain,
( ~ spl4_3
| spl4_4
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f164]) ).
cnf(s1,plain,
( spl4_1
| spl4_2
| ~ spl4_3 ),
inference(sat_conversion,[],[f34]) ).
cnf(s2,plain,
( ~ spl4_3
| spl4_4
| spl4_5 ),
inference(sat_conversion,[],[f43]) ).
cnf(s3,plain,
( spl4_3
| spl4_6 ),
inference(sat_conversion,[],[f47]) ).
cnf(s4,plain,
( spl4_3
| spl4_7 ),
inference(sat_conversion,[],[f51]) ).
cnf(s5,plain,
( ~ spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(sat_conversion,[],[f60]) ).
cnf(s6,plain,
( spl4_3
| spl4_8
| spl4_9 ),
inference(sat_conversion,[],[f72]) ).
cnf(s7,plain,
( spl4_3
| spl4_10
| spl4_11 ),
inference(sat_conversion,[],[f81]) ).
cnf(s8,plain,
( ~ spl4_9
| ~ spl4_11 ),
inference(sat_conversion,[],[f84]) ).
cnf(s12,plain,
( ~ spl4_7
| ~ spl4_8
| ~ spl4_11 ),
inference(sat_conversion,[],[f128]) ).
cnf(s17,plain,
( ~ spl4_6
| ~ spl4_10
| spl4_11 ),
inference(sat_conversion,[],[f154]) ).
cnf(s18,plain,
( ~ spl4_1
| ~ spl4_4 ),
inference(sat_conversion,[],[f157]) ).
cnf(s20,plain,
( ~ spl4_3
| spl4_4
| ~ spl4_5 ),
inference(sat_conversion,[],[f165]) ).
cnf(s21,plain,
( spl4_11
| spl4_3 ),
inference(rat,[],[s17,s7,s3]) ).
cnf(s22,plain,
spl4_3,
inference(rat,[],[s6,s12,s8,s21,s4]) ).
cnf(s23,plain,
spl4_4,
inference(rat,[],[s2,s20,s22]) ).
cnf(s24,plain,
~ spl4_1,
inference(rat,[],[s18,s23]) ).
cnf(s25,plain,
~ spl4_2,
inference(rat,[],[s5,s22,s23]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s1,s22,s24,s25]) ).
thf(f166,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV444^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n016.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 15:52:05 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/0.23 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.28 % (514029)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (514038)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=678870127:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28 % (514038)Refutation not found, incomplete strategy
% 0.21/0.28 % (514038)------------------------------
% 0.21/0.28 % (514038)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (514038)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (514038)CaDiCaL version: 2.1.3
% 0.21/0.28 % (514038)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.28 % (514038)Time elapsed: 0.003 s
% 0.21/0.28 % (514038)Peak memory usage: 12 MB
% 0.21/0.28 % (514038)Instructions burned: 9 (million)
% 0.21/0.28 % (514038)------------------------------
% 0.21/0.28 % (514038)------------------------------
% 0.21/0.28 % (514040)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.28 % (514040)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.28 % (514034)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3957997698:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.28 % (514039)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=99044098:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.28 % (514035)lrs+10_16_si=on:nwc=1.5:random_seed=3086515139:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.28 % (514037)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=2729935411: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.21/0.28 % (514036)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2555524467:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.28 % (514040)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=1314496769:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.28 % (514036)Refutation not found, incomplete strategy
% 0.21/0.28 % (514036)------------------------------
% 0.21/0.28 % (514036)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (514036)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (514036)CaDiCaL version: 2.1.3
% 0.21/0.28 % (514036)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.28 % (514036)Time elapsed: 0.001 s
% 0.21/0.28 % (514036)Peak memory usage: 12 MB
% 0.21/0.28 % (514036)Instructions burned: 1 (million)
% 0.21/0.28 % (514036)------------------------------
% 0.21/0.28 % (514036)------------------------------
% 0.21/0.28 % (514034) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-514029-514034"...
% 0.21/0.28 % (514039) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-514029-514039"...
% 0.21/0.28 % (514037) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-514029-514037"...
% 0.21/0.28 % (514042)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=955485490:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.28 % (514034)...printing done.
% 0.21/0.28 % (514039)...printing done.
% 0.21/0.28 % (514042)Instruction limit reached!
% 0.21/0.28 % (514042)------------------------------
% 0.21/0.28 % (514042)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (514042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (514042)CaDiCaL version: 2.1.3
% 0.21/0.28 % (514042)Termination reason: Instruction limit
% 0.21/0.28 % (514042)Termination phase: Saturation
% 0.21/0.28 % (514042)Time elapsed: 0.001 s
% 0.21/0.28 % (514042)Peak memory usage: 12 MB
% 0.21/0.28 % (514042)Instructions burned: 2 (million)
% 0.21/0.28 % (514037)...printing done.
% 0.21/0.28 % (514034)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (514034)------------------------------
% 0.21/0.28 % (514034)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (514034)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (514034)CaDiCaL version: 2.1.3
% 0.21/0.28 % (514034)Termination reason: Refutation
% 0.21/0.28 % (514034)Time elapsed: 0.006 s
% 0.21/0.28 % (514034)Peak memory usage: 13 MB
% 0.21/0.28 % (514034)Instructions burned: 8 (million)
% 0.21/0.28 % (514029)Success in time 0.038 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------