%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV444^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:39:30 AM UTC 2026
% Result : Theorem 0.09s 0.15s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of formulae : 109 ( 14 unt; 0 typ; 11 def)
% Number of atoms : 592 ( 135 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 534 ( 106 ~; 150 |; 0 &; 259 @)
% ( 11 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 26 ( 22 usr; 16 con; 0-4 aty)
% ( 8 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 53 ( 0 sgn 40 !; 3 ?; 53 :)
% 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,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_3,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_5,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_6,type,
sK1: sK0 > $o ).
thf(func_def_7,type,
sK2: sK0 > $o ).
thf(func_def_10,type,
vNOT: $o > $o ).
thf(func_def_11,type,
sK3: sK0 ).
thf(func_def_13,type,
sK5: sK0 ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_') ).
thf(f2,conjecture,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( X1 = X2 )
= ( ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/EXTENSION_') ).
thf(f3,negated_conjecture,
~ ! [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(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( X1 = X2 )
= ( !! @ X0
@ ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
= ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( X1 = X2 )
!= ( !! @ X0
@ ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
= ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( sK1 = sK2 )
!= ( !! @ sK0
@ ^ [Y0: sK0] :
( ( 'const/sets/IN' @ sK0 @ Y0 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ Y0 @ sK2 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f5]) ).
thf(f7,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f8,plain,
( ( sK1 = sK2 )
!= ( !! @ sK0
@ ^ [Y0: sK0] :
( ( 'const/sets/IN' @ sK0 @ Y0 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ Y0 @ sK2 ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f11,plain,
( ( ( sK1 = sK2 )
= $true )
| ( ( !! @ sK0
@ ^ [Y0: sK0] :
( ( 'const/sets/IN' @ sK0 @ Y0 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ Y0 @ sK2 ) ) )
= $true ) ),
inference(xor_proxy_clausification,[],[f8]) ).
thf(f12,plain,
( ( ( sK1 = sK2 )
= $false )
| ( ( !! @ sK0
@ ^ [Y0: sK0] :
( ( 'const/sets/IN' @ sK0 @ Y0 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ Y0 @ sK2 ) ) )
= $false ) ),
inference(xor_proxy_clausification,[],[f8]) ).
thf(f13,plain,
( ( sK1 != sK2 )
| ( ( !! @ sK0
@ ^ [Y0: sK0] :
( ( 'const/sets/IN' @ sK0 @ Y0 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ Y0 @ sK2 ) ) )
= $false ) ),
inference(equality_proxy_clausification,[],[f12]) ).
thf(f14,plain,
( ( sK1 != sK2 )
| ( $false
= ( ^ [Y0: sK0] :
( ( 'const/sets/IN' @ sK0 @ Y0 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ Y0 @ sK2 ) )
@ sK3 ) ) ),
inference(sigma_proxy_clausification,[],[f13]) ).
thf(f15,plain,
( ( sK1 != sK2 )
| ( $false
= ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f14]) ).
thf(f16,plain,
( ( sK1 != sK2 )
| ( ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 )
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
inference(equality_proxy_clausification,[],[f15]) ).
thf(f17,plain,
( ( sK1 != sK2 )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f16]) ).
thf(f18,plain,
( ( sK1 != sK2 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f16]) ).
thf(f19,plain,
( ( sK1 = sK2 )
| ( ( !! @ sK0
@ ^ [Y0: sK0] :
( ( 'const/sets/IN' @ sK0 @ Y0 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ Y0 @ sK2 ) ) )
= $true ) ),
inference(equality_proxy_clausification,[],[f11]) ).
thf(f20,plain,
! [X1: sK0] :
( ( sK1 = sK2 )
| ( $true
= ( ^ [Y0: sK0] :
( ( 'const/sets/IN' @ sK0 @ Y0 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ Y0 @ sK2 ) )
@ X1 ) ) ),
inference(pi_proxy_clausification,[],[f19]) ).
thf(f21,plain,
! [X1: sK0] :
( ( sK1 = sK2 )
| ( $true
= ( ( 'const/sets/IN' @ sK0 @ X1 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ X1 @ sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f20]) ).
thf(f22,plain,
! [X1: sK0] :
( ( sK1 = sK2 )
| ( ( 'const/sets/IN' @ sK0 @ X1 @ sK1 )
= ( 'const/sets/IN' @ sK0 @ X1 @ sK2 ) ) ),
inference(equality_proxy_clausification,[],[f21]) ).
thf(f23,plain,
! [X1: sK0] :
( ( sK1 = sK2 )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X1 @ sK1 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X1 @ sK2 ) ) ),
inference(iff_proxy_clausification,[],[f22]) ).
thf(f24,plain,
! [X1: sK0] :
( ( sK1 = sK2 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X1 @ sK1 ) )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X1 @ sK2 ) ) ),
inference(iff_proxy_clausification,[],[f22]) ).
thf(f25,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
| ( ( X1 @ X2 )
= $false ) ),
inference(iff_proxy_clausification,[],[f7]) ).
thf(f26,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( ( X1 @ X2 )
= $true ) ),
inference(iff_proxy_clausification,[],[f7]) ).
thf(f28,definition,
( spl4_1
<=> ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f30,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f32,definition,
( spl4_2
<=> ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f34,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f36,definition,
( spl4_3
<=> ( sK1 = sK2 ) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
thf(f37,plain,
( ( sK1 = sK2 )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f38,plain,
( ( sK1 != sK2 )
| spl4_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f39,plain,
( spl4_1
| spl4_2
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f18,f36,f32,f28]) ).
thf(f41,definition,
( spl4_4
<=> ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
thf(f42,plain,
( ( $true
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| spl4_4 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f43,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK2 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f45,definition,
( spl4_5
<=> ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
thf(f47,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f48,plain,
( spl4_4
| spl4_5
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f17,f36,f45,f41]) ).
thf(f50,definition,
( spl4_6
<=> ! [X1: sK0] :
( ( $false
= ( 'const/sets/IN' @ sK0 @ X1 @ sK1 ) )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X1 @ sK2 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).
thf(f51,plain,
( ! [X1: sK0] :
( ( $true
= ( 'const/sets/IN' @ sK0 @ X1 @ sK2 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X1 @ sK1 ) ) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f52,plain,
( spl4_6
| spl4_3 ),
inference(avatar_split_clause,[],[f24,f36,f50]) ).
thf(f54,definition,
( spl4_7
<=> ! [X1: sK0] :
( ( $true
= ( 'const/sets/IN' @ sK0 @ X1 @ sK1 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X1 @ sK2 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl4_7])],[avatar_definition]) ).
thf(f55,plain,
( ! [X1: sK0] :
( ( $false
= ( 'const/sets/IN' @ sK0 @ X1 @ sK2 ) )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X1 @ sK1 ) ) )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f56,plain,
( spl4_7
| spl4_3 ),
inference(avatar_split_clause,[],[f23,f36,f54]) ).
thf(f95,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ~ spl4_3
| ~ spl4_4 ),
inference(forward_demodulation,[],[f43,f37]) ).
thf(f96,plain,
( ( $true = $false )
| ~ spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(forward_demodulation,[],[f95,f34]) ).
thf(f97,plain,
( $false
| ~ spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f96]) ).
thf(f98,plain,
( ~ spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f97]) ).
thf(f99,plain,
( ( ( sK1 @ sK5 )
!= ( sK2 @ sK5 ) )
| spl4_3 ),
inference(negative_extensionality,[],[f38]) ).
thf(f100,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| spl4_3 ),
inference(xor_proxy_clausification,[],[f99]) ).
thf(f101,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| spl4_3 ),
inference(xor_proxy_clausification,[],[f99]) ).
thf(f103,definition,
( spl4_8
<=> ( $false
= ( sK2 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_8])],[avatar_definition]) ).
thf(f104,plain,
( ( $false
!= ( sK2 @ sK5 ) )
| spl4_8 ),
inference(avatar_component_clause,[],[f103]) ).
thf(f105,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl4_8 ),
inference(avatar_component_clause,[],[f103]) ).
thf(f107,definition,
( spl4_9
<=> ( $false
= ( sK1 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_9])],[avatar_definition]) ).
thf(f109,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ~ spl4_9 ),
inference(avatar_component_clause,[],[f107]) ).
thf(f110,plain,
( spl4_8
| spl4_9
| spl4_3 ),
inference(avatar_split_clause,[],[f101,f36,f107,f103]) ).
thf(f112,definition,
( spl4_10
<=> ( $true
= ( sK2 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_10])],[avatar_definition]) ).
thf(f114,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl4_10 ),
inference(avatar_component_clause,[],[f112]) ).
thf(f116,definition,
( spl4_11
<=> ( $true
= ( sK1 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_11])],[avatar_definition]) ).
thf(f118,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl4_11 ),
inference(avatar_component_clause,[],[f116]) ).
thf(f119,plain,
( spl4_10
| spl4_11
| spl4_3 ),
inference(avatar_split_clause,[],[f100,f36,f116,f112]) ).
thf(f125,plain,
( ! [X0: sK0] :
( ( $true = $false )
| ( $true
= ( sK2 @ X0 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ X0 @ sK1 ) ) )
| ~ spl4_6 ),
inference(constrained_superposition,[],[f26,f51]) ).
thf(f126,plain,
( ! [X0: sK0] :
( ( $false
= ( 'const/sets/IN' @ sK0 @ X0 @ sK1 ) )
| ( $true
= ( sK2 @ X0 ) ) )
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f125]) ).
thf(f132,plain,
( ! [X0: sK0] :
( ( $true = $false )
| ( $false
= ( sK2 @ X0 ) )
| ( $true
= ( 'const/sets/IN' @ sK0 @ X0 @ sK1 ) ) )
| ~ spl4_7 ),
inference(constrained_superposition,[],[f25,f55]) ).
thf(f137,plain,
( ! [X0: sK0] :
( ( $true
= ( 'const/sets/IN' @ sK0 @ X0 @ sK1 ) )
| ( $false
= ( sK2 @ X0 ) ) )
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f132]) ).
thf(f163,plain,
( ! [X0: sK0] :
( ( $true = $false )
| ( $false
= ( sK1 @ X0 ) )
| ( $true
= ( sK2 @ X0 ) ) )
| ~ spl4_6 ),
inference(constrained_superposition,[],[f25,f126]) ).
thf(f168,plain,
( ! [X0: sK0] :
( ( $true
= ( sK2 @ X0 ) )
| ( $false
= ( sK1 @ X0 ) ) )
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f163]) ).
thf(f172,plain,
( ( $true = $false )
| ~ spl4_9
| ~ spl4_11 ),
inference(forward_demodulation,[],[f118,f109]) ).
thf(f173,plain,
( $false
| ~ spl4_9
| ~ spl4_11 ),
inference(trivial_inequality_removal,[],[f172]) ).
thf(f174,plain,
( ~ spl4_9
| ~ spl4_11 ),
inference(avatar_contradiction_clause,[],[f173]) ).
thf(f178,plain,
( ! [X0: sK0] :
( ( $true = $false )
| ( $true
= ( sK1 @ X0 ) )
| ( $false
= ( sK2 @ X0 ) ) )
| ~ spl4_7 ),
inference(constrained_superposition,[],[f26,f137]) ).
thf(f182,plain,
( ! [X0: sK0] :
( ( $false
= ( sK2 @ X0 ) )
| ( $true
= ( sK1 @ X0 ) ) )
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f178]) ).
thf(f187,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK5 ) )
| ~ spl4_7
| ~ spl4_10 ),
inference(constrained_superposition,[],[f182,f114]) ).
thf(f196,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl4_7
| ~ spl4_10 ),
inference(trivial_inequality_removal,[],[f187]) ).
thf(f202,plain,
( ( $true = $false )
| ~ spl4_7
| ~ spl4_9
| ~ spl4_10 ),
inference(forward_demodulation,[],[f196,f109]) ).
thf(f203,plain,
( $false
| ~ spl4_7
| ~ spl4_9
| ~ spl4_10 ),
inference(trivial_inequality_removal,[],[f202]) ).
thf(f204,plain,
( ~ spl4_7
| ~ spl4_9
| ~ spl4_10 ),
inference(avatar_contradiction_clause,[],[f203]) ).
thf(f207,plain,
( ( $true = $false )
| ( $false
= ( sK1 @ sK5 ) )
| ~ spl4_6
| ~ spl4_8 ),
inference(constrained_superposition,[],[f168,f105]) ).
thf(f208,plain,
( ( $false
= ( sK1 @ sK5 ) )
| ~ spl4_6
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f207]) ).
thf(f211,plain,
( spl4_9
| ~ spl4_6
| ~ spl4_8 ),
inference(avatar_split_clause,[],[f208,f103,f50,f107]) ).
thf(f219,plain,
( ( $false != $false )
| ( $true
= ( sK1 @ sK5 ) )
| ~ spl4_7
| spl4_8 ),
inference(constrained_superposition,[],[f104,f182]) ).
thf(f221,plain,
( ( $true
= ( sK1 @ sK5 ) )
| ~ spl4_7
| spl4_8 ),
inference(trivial_inequality_removal,[],[f219]) ).
thf(f222,plain,
( spl4_11
| ~ spl4_7
| spl4_8 ),
inference(avatar_split_clause,[],[f221,f103,f54,f116]) ).
thf(f223,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ~ spl4_1
| ~ spl4_3 ),
inference(forward_demodulation,[],[f30,f37]) ).
thf(f229,plain,
( ( $true
!= ( 'const/sets/IN' @ sK0 @ sK3 @ sK1 ) )
| ~ spl4_3
| spl4_4 ),
inference(forward_demodulation,[],[f42,f37]) ).
thf(f230,plain,
( spl4_2
| ~ spl4_1
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f223,f36,f28,f32]) ).
thf(f231,plain,
( $false
| ~ spl4_3
| spl4_4
| ~ spl4_5 ),
inference(forward_subsumption_resolution,[],[f229,f47]) ).
thf(f232,plain,
( ~ spl4_3
| spl4_4
| ~ spl4_5 ),
inference(avatar_contradiction_clause,[],[f231]) ).
cnf(s1,plain,
( spl4_1
| spl4_2
| ~ spl4_3 ),
inference(sat_conversion,[],[f39]) ).
cnf(s2,plain,
( ~ spl4_3
| spl4_4
| spl4_5 ),
inference(sat_conversion,[],[f48]) ).
cnf(s3,plain,
( spl4_3
| spl4_6 ),
inference(sat_conversion,[],[f52]) ).
cnf(s4,plain,
( spl4_3
| spl4_7 ),
inference(sat_conversion,[],[f56]) ).
cnf(s5,plain,
( ~ spl4_2
| ~ spl4_3
| ~ spl4_4 ),
inference(sat_conversion,[],[f98]) ).
cnf(s6,plain,
( spl4_3
| spl4_8
| spl4_9 ),
inference(sat_conversion,[],[f110]) ).
cnf(s7,plain,
( spl4_3
| spl4_10
| spl4_11 ),
inference(sat_conversion,[],[f119]) ).
cnf(s12,plain,
( ~ spl4_9
| ~ spl4_11 ),
inference(sat_conversion,[],[f174]) ).
cnf(s14,plain,
( ~ spl4_7
| ~ spl4_9
| ~ spl4_10 ),
inference(sat_conversion,[],[f204]) ).
cnf(s15,plain,
( ~ spl4_6
| ~ spl4_8
| spl4_9 ),
inference(sat_conversion,[],[f211]) ).
cnf(s17,plain,
( ~ spl4_7
| spl4_8
| spl4_11 ),
inference(sat_conversion,[],[f222]) ).
cnf(s19,plain,
( ~ spl4_1
| spl4_2
| ~ spl4_3 ),
inference(sat_conversion,[],[f230]) ).
cnf(s20,plain,
( ~ spl4_3
| spl4_4
| ~ spl4_5 ),
inference(sat_conversion,[],[f232]) ).
cnf(s21,plain,
( spl4_8
| spl4_3 ),
inference(rat,[],[s12,s6,s17,s4]) ).
cnf(s22,plain,
spl4_3,
inference(rat,[],[s7,s12,s14,s15,s21,s3,s4]) ).
cnf(s23,plain,
spl4_4,
inference(rat,[],[s2,s20,s22]) ).
cnf(s24,plain,
~ spl4_2,
inference(rat,[],[s5,s22,s23]) ).
cnf(s25,plain,
~ spl4_1,
inference(rat,[],[s19,s22,s24]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s1,s22,s25,s24]) ).
thf(f233,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEV444^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Sep 29 15:46:48 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.12 Running first-order model finding
% 0.09/0.12 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.15 % (274968)Will run a generic schedule for satisfiability detection.
% 0.09/0.15 % (274974)% WARNING: option uhcvi not known.
% 0.09/0.15 % (274974)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3512756470:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.15 % (274977)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3375007072:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.15 % (274979)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3534818314:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.15 % (274973)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1614284896_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.15 % (274978)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1273316975:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.15 % (274975)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=342861212:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.15 % (274976)dis+10_1_sil=32000:sp=arity:random_seed=3939394715:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.15 % (274977)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.15 % (274974)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.15 % (274974)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.09/0.15 % Exception at run slice level
% 0.09/0.15 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.09/0.15 % (274977) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-274968-274977"...
% 0.09/0.15 % (274978) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-274968-274978"...
% 0.09/0.15 % (274976) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-274968-274976"...
% 0.09/0.15 % (274974) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-274968-274974"...
% 0.09/0.15 % (274978)...printing done.
% 0.09/0.15 % (274977)...printing done.
% 0.09/0.15 % (274976)...printing done.
% 0.09/0.15 % (274974)...printing done.
% 0.09/0.15 % (274976)Refutation found. Thanks to Tanya!
% 0.09/0.15 % SZS status Theorem for theBenchmark
% 0.09/0.15 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.15 % (274976)------------------------------
% 0.09/0.15 % (274976)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.15 % (274976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.15 % (274976)CaDiCaL version: 2.1.3
% 0.09/0.15 % (274976)Termination reason: Refutation
% 0.09/0.15 % (274976)Time elapsed: 0.005 s
% 0.09/0.15 % (274976)Peak memory usage: 12 MB
% 0.09/0.15 % (274976)Instructions burned: 13 (million)
% 0.09/0.15 % (274968)Success in time 0.026 s
% 0.09/0.15 % Vampire exiting
%------------------------------------------------------------------------------