%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV460^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:32 AM UTC 2026
% Result : Theorem 3.95s 0.96s
% Output : Refutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 12
% Syntax : Number of formulae : 144 ( 21 unt; 0 typ; 8 def)
% Number of atoms : 784 ( 180 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 934 ( 111 ~; 176 |; 12 &; 627 @)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 59 ( 59 >; 0 *; 0 +; 0 <<)
% Number of symbols : 50 ( 47 usr; 12 con; 0-4 aty)
% Number of variables : 160 ( 0 sgn 156 !; 4 ?; 160 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/INTER':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/DELETE':
!>[X0: $tType] : ( ( X0 > $o ) > X0 > X0 > $o ) ).
thf(func_def_4,type,
vAND: $o > $o > $o ).
thf(func_def_5,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_6,type,
vNOT: $o > $o ).
thf(func_def_7,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_10,type,
sK1: sK0 > $o ).
thf(func_def_11,type,
sK2: sK0 > $o ).
thf(func_def_12,type,
sK3: sK0 ).
thf(func_def_15,type,
sK4:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_16,type,
sK5: sK0 ).
thf(func_def_18,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
sK7: ( sK0 > $o ) > sK0 ).
thf(func_def_20,type,
sK8: ( sK0 > $o ) > sK0 ).
thf(func_def_21,type,
sK9:
!>[X0: $tType] : ( ( X0 > $o ) > X0 > ( X0 > $o ) > X0 ) ).
thf(func_def_22,type,
sK10: ( sK0 > $o ) > sK0 ).
thf(func_def_23,type,
sK11: ( sK0 > $o ) > sK0 ).
thf(func_def_24,type,
sK12:
!>[X0: $tType] : ( ( X0 > $o ) > X0 > ( X0 > $o ) > X0 ) ).
thf(func_def_25,type,
sK13:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_26,type,
sK14:
!>[X0: $tType] : ( ( X0 > $o ) > X0 > ( X0 > $o ) > X0 ) ).
thf(func_def_27,type,
sK15:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_28,type,
sK16:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_29,type,
sK17:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_30,type,
sK18:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_31,type,
sK19: ( sK0 > $o ) > sK0 ).
thf(func_def_32,type,
sK20: ( sK0 > $o ) > sK0 ).
thf(func_def_33,type,
sK21: ( sK0 > $o ) > sK0 ).
thf(func_def_34,type,
sK22: ( sK0 > $o ) > sK0 ).
thf(func_def_35,type,
sK23: ( sK0 > $o ) > sK0 ).
thf(func_def_36,type,
sK24: ( sK0 > $o ) > sK0 ).
thf(func_def_37,type,
sK25: ( sK0 > $o ) > sK0 ).
thf(func_def_38,type,
sK26: ( sK0 > $o ) > sK0 ).
thf(func_def_39,type,
sK27: ( sK0 > $o ) > sK0 ).
thf(func_def_40,type,
sK28: ( sK0 > $o ) > sK0 ).
thf(func_def_41,type,
sK29: ( sK0 > $o ) > sK0 ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_') ).
thf(f2,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_INTER_') ).
thf(f3,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( X2 != X3 ) )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_DELETE_') ).
thf(f5,conjecture,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/INTER' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) @ X2 )
= ( 'const/sets/DELETE' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/DELETE_INTER_') ).
thf(f6,negated_conjecture,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/INTER' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) @ X2 )
= ( 'const/sets/DELETE' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( X2 != X3 ) )
& ( 'const/sets/IN' @ X0 @ X2 @ X1 ) ),
inference(rectify,[],[f3]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > $o,X2: X0,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
& ( X2 != X3 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f12,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/INTER' @ X0 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) @ X2 )
!= ( 'const/sets/DELETE' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f13,plain,
( ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 )
!= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f12]) ).
thf(f14,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f15,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
& ( X2 != X3 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f18,plain,
( ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 )
!= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f35,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true )
| ( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
& ( X2 != X3 ) )
= $false ) ),
inference(iff_proxy_clausification,[],[f16]) ).
thf(f36,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
& ( X2 != X3 ) )
= $true ) ),
inference(iff_proxy_clausification,[],[f16]) ).
thf(f37,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( ( X2 != X3 )
= $true ) ),
inference(and_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true ) ),
inference(and_proxy_clausification,[],[f36]) ).
thf(f39,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( ( X2 = X3 )
= $false ) ),
inference(not_proxy_clausification,[],[f37]) ).
thf(f40,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $false )
| ( X2 != X3 ) ),
inference(equality_proxy_clausification,[],[f39]) ).
thf(f41,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true )
| ( ( X2 != X3 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false ) ),
inference(and_proxy_clausification,[],[f35]) ).
thf(f42,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true )
| ( ( X2 = X3 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false ) ),
inference(not_proxy_clausification,[],[f41]) ).
thf(f43,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ ( 'const/sets/DELETE' @ X0 @ X1 @ X3 ) )
= $true )
| ( X2 = X3 )
| ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false ) ),
inference(equality_proxy_clausification,[],[f42]) ).
thf(f44,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $true )
| ( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= $false ) ),
inference(iff_proxy_clausification,[],[f15]) ).
thf(f45,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $false )
| ( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= $true ) ),
inference(iff_proxy_clausification,[],[f15]) ).
thf(f46,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true ) ),
inference(and_proxy_clausification,[],[f45]) ).
thf(f47,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $true ) ),
inference(and_proxy_clausification,[],[f45]) ).
thf(f48,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $false ) ),
inference(and_proxy_clausification,[],[f44]) ).
thf(f49,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $true )
| ( ( X1 @ X2 )
= $false ) ),
inference(iff_proxy_clausification,[],[f14]) ).
thf(f50,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= $false )
| ( ( X1 @ X2 )
= $true ) ),
inference(iff_proxy_clausification,[],[f14]) ).
thf(f58,plain,
( ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK5 )
!= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK5 ) ),
inference(negative_extensionality,[],[f18]) ).
thf(f59,plain,
( ( $true
= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK5 ) )
| ( $true
= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK5 ) ) ),
inference(xor_proxy_clausification,[],[f58]) ).
thf(f60,plain,
( ( $false
= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK5 ) )
| ( $false
= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK5 ) ) ),
inference(xor_proxy_clausification,[],[f58]) ).
thf(f62,definition,
( spl6_1
<=> ( $false
= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
thf(f63,plain,
( ( $false
!= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK5 ) )
| spl6_1 ),
inference(avatar_component_clause,[],[f62]) ).
thf(f64,plain,
( ( $false
= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK5 ) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f62]) ).
thf(f66,definition,
( spl6_2
<=> ( $false
= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
thf(f67,plain,
( ( $false
!= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK5 ) )
| spl6_2 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f68,plain,
( ( $false
= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK5 ) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f69,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f60,f66,f62]) ).
thf(f71,definition,
( spl6_3
<=> ( $true
= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
thf(f73,plain,
( ( $true
= ( 'const/sets/DELETE' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 @ sK5 ) )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f71]) ).
thf(f75,definition,
( spl6_4
<=> ( $true
= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK5 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
thf(f77,plain,
( ( $true
= ( 'const/sets/INTER' @ sK0 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) @ sK2 @ sK5 ) )
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f75]) ).
thf(f78,plain,
( spl6_3
| spl6_4 ),
inference(avatar_split_clause,[],[f59,f75,f71]) ).
thf(f97,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( $true = $false )
| ( $false
= ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 ) )
| ( X1 != X3 ) ),
inference(constrained_superposition,[],[f49,f40]) ).
thf(f98,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( $false
= ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 ) )
| ( X1 != X3 ) ),
inference(trivial_inequality_removal,[],[f97]) ).
thf(f103,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( $true = $false )
| ( $true
= ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 ) )
| ( X1 = X3 )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(constrained_superposition,[],[f50,f43]) ).
thf(f105,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( $true
= ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 ) )
| ( X1 = X3 )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f103]) ).
thf(f114,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true = $false )
| ( $true
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(constrained_superposition,[],[f50,f48]) ).
thf(f115,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) )
| ( $false
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f114]) ).
thf(f152,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( $true = $false )
| ( $false
= ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(constrained_superposition,[],[f49,f38]) ).
thf(f155,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0] :
( ( $false
= ( 'const/sets/DELETE' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f152]) ).
thf(f166,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true = $false )
| ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) ) ),
inference(constrained_superposition,[],[f49,f46]) ).
thf(f169,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f166]) ).
thf(f180,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $true = $false )
| ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(constrained_superposition,[],[f49,f47]) ).
thf(f183,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
( ( $false
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 @ X1 ) )
| ( $true
= ( 'const/sets/IN' @ X0 @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f180]) ).
thf(f276,definition,
( spl6_5
<=> ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) ) ) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
thf(f277,plain,
( ( $false
!= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) ) )
| spl6_5 ),
inference(avatar_component_clause,[],[f276]) ).
thf(f278,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) ) )
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f276]) ).
thf(f280,definition,
( spl6_6
<=> ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
thf(f282,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f280]) ).
thf(f286,plain,
( ( $true = $false )
| ~ spl6_1
| ~ spl6_3 ),
inference(constrained_superposition,[],[f64,f73]) ).
thf(f287,plain,
( ( $true = $false )
| ( sK3 = sK5 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) ) )
| ~ spl6_1 ),
inference(constrained_superposition,[],[f64,f105]) ).
thf(f294,plain,
( $false
| ~ spl6_1
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f286]) ).
thf(f295,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f294]) ).
thf(f310,plain,
( ( $true = $false )
| ( sK3 = sK5 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl6_5 ),
inference(constrained_superposition,[],[f278,f43]) ).
thf(f349,plain,
( ( $false != $false )
| ( sK3 != sK5 )
| spl6_1 ),
inference(constrained_superposition,[],[f63,f98]) ).
thf(f353,plain,
( ( sK3 != sK5 )
| spl6_1 ),
inference(trivial_inequality_removal,[],[f349]) ).
thf(f355,plain,
( ( $true = $false )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) ) )
| ~ spl6_2 ),
inference(constrained_superposition,[],[f68,f115]) ).
thf(f358,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f355]) ).
thf(f634,plain,
( ( $true = $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) ) )
| ~ spl6_3 ),
inference(constrained_superposition,[],[f73,f155]) ).
thf(f637,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f634]) ).
thf(f2391,plain,
( ( $true = $false )
| ~ spl6_2
| ~ spl6_4 ),
inference(forward_demodulation,[],[f77,f68]) ).
thf(f2392,plain,
( $false
| ~ spl6_2
| ~ spl6_4 ),
inference(trivial_inequality_removal,[],[f2391]) ).
thf(f2393,plain,
( ~ spl6_2
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f2392]) ).
thf(f2395,definition,
( spl6_12
<=> ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) ) ),
introduced(definition,[new_symbols(definition,[spl6_12])],[avatar_definition]) ).
thf(f2397,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl6_12 ),
inference(avatar_component_clause,[],[f2395]) ).
thf(f2399,definition,
( spl6_13
<=> ( sK3 = sK5 ) ),
introduced(definition,[new_symbols(definition,[spl6_13])],[avatar_definition]) ).
thf(f2400,plain,
( ( sK3 != sK5 )
| spl6_13 ),
inference(avatar_component_clause,[],[f2399]) ).
thf(f2404,plain,
( ~ spl6_13
| spl6_1 ),
inference(avatar_split_clause,[],[f353,f62,f2399]) ).
thf(f2420,plain,
( spl6_5
| spl6_6
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f358,f66,f280,f276]) ).
thf(f2448,plain,
( ( $true = $false )
| ( $false
= ( sK2 @ sK5 ) )
| ~ spl6_6 ),
inference(constrained_superposition,[],[f49,f282]) ).
thf(f2453,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f2448]) ).
thf(f2485,plain,
( ( $false != $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| spl6_5 ),
inference(constrained_superposition,[],[f277,f38]) ).
thf(f2487,plain,
( ( $false != $false )
| ( sK3 != sK5 )
| spl6_5 ),
inference(constrained_superposition,[],[f277,f40]) ).
thf(f2488,plain,
( ( sK3 != sK5 )
| spl6_5 ),
inference(trivial_inequality_removal,[],[f2487]) ).
thf(f2489,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| spl6_5 ),
inference(trivial_inequality_removal,[],[f2485]) ).
thf(f2499,plain,
( ~ spl6_13
| spl6_5 ),
inference(avatar_split_clause,[],[f2488,f276,f2399]) ).
thf(f5691,plain,
( ( $true = $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl6_3 ),
inference(constrained_superposition,[],[f637,f47]) ).
thf(f5692,plain,
( ( $true = $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| ~ spl6_3 ),
inference(constrained_superposition,[],[f637,f46]) ).
thf(f5714,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f5692]) ).
thf(f5715,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f5691]) ).
thf(f5729,plain,
( ( $true = $false )
| ~ spl6_3
| ~ spl6_6 ),
inference(forward_demodulation,[],[f5714,f282]) ).
thf(f5730,plain,
( $false
| ~ spl6_3
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f5729]) ).
thf(f5731,plain,
( ~ spl6_3
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f5730]) ).
thf(f5733,plain,
( ( sK3 = sK5 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) ) )
| ~ spl6_1 ),
inference(trivial_inequality_removal,[],[f287]) ).
thf(f5735,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) ) )
| ~ spl6_1
| spl6_13 ),
inference(forward_subsumption_resolution,[],[f5733,f2400]) ).
thf(f5772,plain,
( ( $false != $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) ) )
| spl6_2 ),
inference(constrained_superposition,[],[f67,f183]) ).
thf(f5773,plain,
( ( $false != $false )
| ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| spl6_2 ),
inference(constrained_superposition,[],[f67,f169]) ).
thf(f5775,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| spl6_2 ),
inference(trivial_inequality_removal,[],[f5773]) ).
thf(f5776,plain,
( ( $true
= ( 'const/sets/IN' @ sK0 @ sK5 @ ( 'const/sets/DELETE' @ sK0 @ sK1 @ sK3 ) ) )
| spl6_2 ),
inference(trivial_inequality_removal,[],[f5772]) ).
thf(f5825,plain,
( ( $true = $false )
| ( $true
= ( sK2 @ sK5 ) )
| spl6_2 ),
inference(constrained_superposition,[],[f50,f5775]) ).
thf(f5830,plain,
( ( $true
= ( sK2 @ sK5 ) )
| spl6_2 ),
inference(trivial_inequality_removal,[],[f5825]) ).
thf(f5864,plain,
( ( $true = $false )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl6_1
| spl6_13 ),
inference(constrained_superposition,[],[f48,f5735]) ).
thf(f5865,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl6_1
| spl6_13 ),
inference(trivial_inequality_removal,[],[f5864]) ).
thf(f5888,plain,
( ( $true = $false )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| ~ spl6_1
| spl6_5
| spl6_13 ),
inference(forward_demodulation,[],[f5865,f2489]) ).
thf(f5889,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK2 ) )
| ~ spl6_1
| spl6_5
| spl6_13 ),
inference(trivial_inequality_removal,[],[f5888]) ).
thf(f5892,plain,
( spl6_6
| ~ spl6_1
| spl6_5
| spl6_13 ),
inference(avatar_split_clause,[],[f5889,f2399,f276,f62,f280]) ).
thf(f5897,plain,
( ( sK3 = sK5 )
| ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl6_5 ),
inference(trivial_inequality_removal,[],[f310]) ).
thf(f5945,plain,
( ( $false
= ( 'const/sets/IN' @ sK0 @ sK5 @ sK1 ) )
| ~ spl6_5
| spl6_13 ),
inference(forward_subsumption_resolution,[],[f5897,f2400]) ).
thf(f5955,plain,
( spl6_12
| ~ spl6_5
| spl6_13 ),
inference(avatar_split_clause,[],[f5945,f2399,f276,f2395]) ).
thf(f6144,plain,
( ( $true = $false )
| spl6_2
| ~ spl6_5 ),
inference(forward_demodulation,[],[f5776,f278]) ).
thf(f6145,plain,
( $false
| spl6_2
| ~ spl6_5 ),
inference(trivial_inequality_removal,[],[f6144]) ).
thf(f6146,plain,
( spl6_2
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f6145]) ).
thf(f7442,plain,
( ( $true = $false )
| ~ spl6_3
| ~ spl6_12 ),
inference(forward_demodulation,[],[f5715,f2397]) ).
thf(f7443,plain,
( $false
| ~ spl6_3
| ~ spl6_12 ),
inference(trivial_inequality_removal,[],[f7442]) ).
thf(f7444,plain,
( ~ spl6_3
| ~ spl6_12 ),
inference(avatar_contradiction_clause,[],[f7443]) ).
thf(f7877,plain,
( ( $true = $false )
| spl6_2
| ~ spl6_6 ),
inference(forward_demodulation,[],[f5830,f2453]) ).
thf(f7878,plain,
( $false
| spl6_2
| ~ spl6_6 ),
inference(trivial_inequality_removal,[],[f7877]) ).
thf(f7879,plain,
( spl6_2
| ~ spl6_6 ),
inference(avatar_contradiction_clause,[],[f7878]) ).
cnf(s1,plain,
( spl6_1
| spl6_2 ),
inference(sat_conversion,[],[f69]) ).
cnf(s2,plain,
( spl6_3
| spl6_4 ),
inference(sat_conversion,[],[f78]) ).
cnf(s6,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(sat_conversion,[],[f295]) ).
cnf(s14,plain,
( ~ spl6_2
| ~ spl6_4 ),
inference(sat_conversion,[],[f2393]) ).
cnf(s17,plain,
( spl6_1
| ~ spl6_13 ),
inference(sat_conversion,[],[f2404]) ).
cnf(s24,plain,
( ~ spl6_2
| spl6_5
| spl6_6 ),
inference(sat_conversion,[],[f2420]) ).
cnf(s27,plain,
( spl6_5
| ~ spl6_13 ),
inference(sat_conversion,[],[f2499]) ).
cnf(s29,plain,
( ~ spl6_3
| ~ spl6_6 ),
inference(sat_conversion,[],[f5731]) ).
cnf(s30,plain,
( ~ spl6_1
| spl6_5
| spl6_6
| spl6_13 ),
inference(sat_conversion,[],[f5892]) ).
cnf(s34,plain,
( ~ spl6_5
| spl6_12
| spl6_13 ),
inference(sat_conversion,[],[f5955]) ).
cnf(s44,plain,
( spl6_2
| ~ spl6_5 ),
inference(sat_conversion,[],[f6146]) ).
cnf(s106,plain,
( ~ spl6_3
| ~ spl6_12 ),
inference(sat_conversion,[],[f7444]) ).
cnf(s141,plain,
( spl6_2
| ~ spl6_6 ),
inference(sat_conversion,[],[f7879]) ).
cnf(s142,plain,
spl6_1,
inference(rat,[],[s24,s34,s29,s106,s2,s14,s1,s17]) ).
cnf(s143,plain,
~ spl6_3,
inference(rat,[],[s6,s142]) ).
cnf(s144,plain,
spl6_4,
inference(rat,[],[s2,s143]) ).
cnf(s145,plain,
~ spl6_2,
inference(rat,[],[s14,s144]) ).
cnf(s146,plain,
~ spl6_6,
inference(rat,[],[s141,s145]) ).
cnf(s147,plain,
~ spl6_5,
inference(rat,[],[s44,s145]) ).
cnf(s148,plain,
~ spl6_13,
inference(rat,[],[s27,s147]) ).
cnf(s149,plain,
$false,
inference(rat,[],[s30,s146,s142,s148,s147]) ).
thf(f7880,plain,
$false,
inference(avatar_sat_refutation,[],[s149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV460^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n026.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 15:51:42 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.95/0.96 % (771377)Will run a generic schedule for satisfiability detection.
% 3.95/0.96 % (771393)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2666486334:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.95/0.96 % (771393)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.95/0.96 % (771389)% WARNING: option uhcvi not known.
% 3.95/0.96 % (771391)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1771617528:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.95/0.96 % (771388)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2782411979_2999 on theBenchmark for (2999ds/0Mi)
% 3.95/0.96 % (771389)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1100363977:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.95/0.96 % (771392)dis+10_1_sil=32000:sp=arity:random_seed=787552700:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.95/0.96 % (771394)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1370172075:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.95/0.96 % (771389)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.95/0.96 % (771395)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=81115933:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.95/0.96 % Exception at run slice level
% 3.95/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.95/0.96 % (771389)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.95/0.96 % (771415)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4177144166:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.95/0.96 % Exception at run slice level
% 3.95/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.95/0.96 % (771393)Instruction limit reached!
% 3.95/0.96 % (771393)------------------------------
% 3.95/0.96 % (771393)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771393)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771393)Termination reason: Instruction limit
% 3.95/0.96 % (771393)Termination phase: Saturation
% 3.95/0.96 % (771393)Time elapsed: 0.035 s
% 3.95/0.96 % (771393)Peak memory usage: 12 MB
% 3.95/0.96 % (771393)Instructions burned: 119 (million)
% 3.95/0.96 % (771434)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=385914819:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 3.95/0.96 % (771434)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.95/0.96 % (771434)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.95/0.96 % (771429)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=910849124:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.95/0.96 % (771392)Instruction limit reached!
% 3.95/0.96 % (771392)------------------------------
% 3.95/0.96 % (771392)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771392)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771392)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771392)Termination reason: Instruction limit
% 3.95/0.96 % (771392)Termination phase: Saturation
% 3.95/0.96 % (771392)Time elapsed: 0.057 s
% 3.95/0.96 % (771392)Peak memory usage: 12 MB
% 3.95/0.96 % (771392)Instructions burned: 104 (million)
% 3.95/0.96 % (771394)Instruction limit reached!
% 3.95/0.96 % (771394)------------------------------
% 3.95/0.96 % (771394)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771394)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771394)Termination reason: Instruction limit
% 3.95/0.96 % (771394)Termination phase: Saturation
% 3.95/0.96 % (771394)Time elapsed: 0.070 s
% 3.95/0.96 % (771394)Peak memory usage: 12 MB
% 3.95/0.96 % (771394)Instructions burned: 133 (million)
% 3.95/0.96 % (771444)ott-21_1_sil=16000:fs=off:random_seed=3247576918:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 3.95/0.96 % (771395)Instruction limit reached!
% 3.95/0.96 % (771395)------------------------------
% 3.95/0.96 % (771395)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771395)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771395)Termination reason: Instruction limit
% 3.95/0.96 % (771395)Termination phase: Saturation
% 3.95/0.96 % (771395)Time elapsed: 0.083 s
% 3.95/0.96 % (771395)Peak memory usage: 12 MB
% 3.95/0.96 % (771395)Instructions burned: 159 (million)
% 3.95/0.96 % (771445)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3029424462:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 3.95/0.96 % (771447)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2316351732:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 3.95/0.96 % Exception at run slice level
% 3.95/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.95/0.96 % (771429)Instruction limit reached!
% 3.95/0.96 % (771429)------------------------------
% 3.95/0.96 % (771429)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771429)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771429)Termination reason: Instruction limit
% 3.95/0.96 % (771429)Termination phase: Saturation
% 3.95/0.96 % (771429)Time elapsed: 0.070 s
% 3.95/0.96 % (771429)Peak memory usage: 12 MB
% 3.95/0.96 % (771429)Instructions burned: 131 (million)
% 3.95/0.96 % (771450)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=448223577:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 3.95/0.96 % (771451)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3577811455:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 3.95/0.96 % Exception at run slice level
% 3.95/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.95/0.96 % (771454)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2963106462:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 3.95/0.96 % (771454)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.95/0.96 % (771444)Instruction limit reached!
% 3.95/0.96 % (771444)------------------------------
% 3.95/0.96 % (771444)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771444)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771444)Termination reason: Instruction limit
% 3.95/0.96 % (771444)Termination phase: Saturation
% 3.95/0.96 % (771444)Time elapsed: 0.089 s
% 3.95/0.96 % (771444)Peak memory usage: 12 MB
% 3.95/0.96 % (771444)Instructions burned: 181 (million)
% 3.95/0.96 % (771456)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3166405790:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 3.95/0.96 % (771456)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.95/0.96 % (771434)Instruction limit reached!
% 3.95/0.96 % (771434)------------------------------
% 3.95/0.96 % (771434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771434)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771434)Termination reason: Instruction limit
% 3.95/0.96 % (771434)Termination phase: Saturation
% 3.95/0.96 % (771434)Time elapsed: 0.178 s
% 3.95/0.96 % (771434)Peak memory usage: 15 MB
% 3.95/0.96 % (771434)Instructions burned: 688 (million)
% 3.95/0.96 % (771458)fmb+10_1_sil=64000:random_seed=609927532:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 3.95/0.96 % (771458)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.95/0.96 % Exception at run slice level
% 3.95/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.95/0.96 % (771460)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1744568633:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 3.95/0.96 % Exception at run slice level
% 3.95/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.95/0.96 % (771462)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2367538850:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 3.95/0.96 % Exception at run slice level
% 3.95/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.95/0.96 % (771464)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=155465589:i=5131_2997 on theBenchmark for (2997ds/5131Mi)
% 3.95/0.96 % (771464)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.95/0.96 % (771445)Instruction limit reached!
% 3.95/0.96 % (771445)------------------------------
% 3.95/0.96 % (771445)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771445)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771445)Termination reason: Instruction limit
% 3.95/0.96 % (771445)Termination phase: Saturation
% 3.95/0.96 % (771445)Time elapsed: 0.253 s
% 3.95/0.96 % (771445)Peak memory usage: 14 MB
% 3.95/0.96 % (771445)Instructions burned: 481 (million)
% 3.95/0.96 % (771466)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1198346427:i=1472:ins=7:fdi=8:gsp=on_2996 on theBenchmark for (2996ds/1472Mi)
% 3.95/0.96 % (771466)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.95/0.96 % (771466)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.95/0.96 % (771454)Instruction limit reached!
% 3.95/0.96 % (771454)------------------------------
% 3.95/0.96 % (771454)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771454)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771454)Termination reason: Instruction limit
% 3.95/0.96 % (771454)Termination phase: Saturation
% 3.95/0.96 % (771454)Time elapsed: 0.352 s
% 3.95/0.96 % (771454)Peak memory usage: 15 MB
% 3.95/0.96 % (771454)Instructions burned: 693 (million)
% 3.95/0.96 % (771468)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2716675607:i=6324_2994 on theBenchmark for (2994ds/6324Mi)
% 3.95/0.96 % Exception at run slice level
% 3.95/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.95/0.96 % (771470)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2736065515:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 3.95/0.96 % Exception at run slice level
% 3.95/0.96 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.95/0.96 % (771472)ott-2_1_sil=16000:newcnf=on:random_seed=4156788058:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2994 on theBenchmark for (2994ds/869Mi)
% 3.95/0.96 % (771472)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.95/0.96 % (771456)Instruction limit reached!
% 3.95/0.96 % (771456)------------------------------
% 3.95/0.96 % (771456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771456)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771456)Termination reason: Instruction limit
% 3.95/0.96 % (771456)Termination phase: Saturation
% 3.95/0.96 % (771456)Time elapsed: 0.451 s
% 3.95/0.96 % (771456)Peak memory usage: 15 MB
% 3.95/0.96 % (771456)Instructions burned: 879 (million)
% 3.95/0.96 % (771474)ott+10_1_sil=32000:tgt=ground:random_seed=1127435599:i=5114:av=off_2993 on theBenchmark for (2993ds/5114Mi)
% 3.95/0.96 % (771389) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-771377-771389"...
% 3.95/0.96 % (771389)...printing done.
% 3.95/0.96 % (771389)Refutation found. Thanks to Tanya!
% 3.95/0.96 % SZS status Theorem for theBenchmark
% 3.95/0.96 % SZS output start Proof for theBenchmark
% See solution above
% 3.95/0.96 % (771389)------------------------------
% 3.95/0.96 % (771389)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.95/0.96 % (771389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.95/0.96 % (771389)CaDiCaL version: 2.1.3
% 3.95/0.96 % (771389)Termination reason: Refutation
% 3.95/0.96 % (771389)Time elapsed: 0.667 s
% 3.95/0.96 % (771389)Peak memory usage: 15 MB
% 3.95/0.96 % (771389)Instructions burned: 1394 (million)
% 3.95/0.96 % (771377)Success in time 0.711 s
% 3.95/0.96 % Vampire exiting
%------------------------------------------------------------------------------