%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU590^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:32:34 AM UTC 2026
% Result : Theorem 5.71s 1.06s
% Output : Refutation 5.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 12
% Syntax : Number of formulae : 122 ( 54 unt; 0 typ; 7 def)
% Number of atoms : 1011 ( 241 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 1152 ( 9 ~; 103 |; 15 &; 847 @)
% ( 0 <=>; 105 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 30 ( 26 usr; 16 con; 0-4 aty)
% ( 73 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 276 ( 135 ^; 135 !; 6 ?; 276 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_2,type,
subset: $i > $i > $o ).
thf(func_def_3,type,
subsetI1: $o ).
thf(func_def_5,type,
subsetE: $o ).
thf(func_def_6,type,
binintersect: $i > $i > $i ).
thf(func_def_7,type,
binintersectI: $o ).
thf(func_def_8,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_9,type,
vIMP: $o > $o > $o ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_19,type,
sF3: $o ).
thf(func_def_20,type,
sF4: $o ).
thf(func_def_21,type,
sF5: $o ).
thf(func_def_23,type,
sF7: $o ).
thf(func_def_24,type,
sF8: $o ).
thf(func_def_25,type,
sF9: $o ).
thf(func_def_26,type,
vNOT: $o > $o ).
thf(func_def_29,type,
sK12: $i > $i > $i ).
thf(f1,axiom,
( subsetI1
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI1) ).
thf(f2,axiom,
( subsetE
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE) ).
thf(f3,axiom,
( binintersect
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ X0
@ ^ [X2: $i] : ( in @ X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersect) ).
thf(f4,axiom,
( binintersectI
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( binintersect @ X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectI) ).
thf(f5,conjecture,
( subsetI1
=> ( subsetE
=> ( binintersectI
=> ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X2 @ X0 )
=> ( ( subset @ X2 @ X1 )
=> ( subset @ X2 @ ( binintersect @ X0 @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binintersectSubset5) ).
thf(f6,negated_conjecture,
~ ( subsetI1
=> ( subsetE
=> ( binintersectI
=> ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X2 @ X0 )
=> ( ( subset @ X2 @ X1 )
=> ( subset @ X2 @ ( binintersect @ X0 @ X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( subsetI1
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( subsetI1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( subsetE
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( binintersect
= ( ^ [X0: $i,X1: $i] :
( dsetconstr @ X0
@ ^ [X2: $i] : ( in @ X2 @ X1 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f12,plain,
( binintersect
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
( binintersectI
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( binintersect @ X0 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f14,plain,
( binintersectI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binintersect @ Y2 @ Y1 ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
~ ( subsetI1
=> ( subsetE
=> ( binintersectI
=> ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X2 @ X0 )
=> ( ( subset @ X2 @ X1 )
=> ( subset @ X2 @ ( binintersect @ X0 @ X1 ) ) ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f16,plain,
~ ( ( subsetI1 = $true )
=> ( ( subsetE = $true )
=> ( ( binintersectI = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X2 @ X0 )
= $true )
=> ( ( ( subset @ X2 @ X1 )
= $true )
=> ( ( subset @ X2 @ ( binintersect @ X0 @ X1 ) )
= $true ) ) ) ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X2 @ ( binintersect @ X0 @ X1 ) )
!= $true )
& ( ( subset @ X2 @ X1 )
= $true )
& ( ( subset @ X2 @ X0 )
= $true ) )
& ( binintersectI = $true )
& ( subsetE = $true )
& ( subsetI1 = $true ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f18,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X2 @ ( binintersect @ X0 @ X1 ) )
!= $true )
& ( ( subset @ X2 @ X1 )
= $true )
& ( ( subset @ X2 @ X0 )
= $true ) )
& ( binintersectI = $true )
& ( subsetE = $true )
& ( subsetI1 = $true ) ),
inference(flattening,[],[f17]) ).
thf(f19,plain,
( ( $true
!= ( subset @ sK2 @ ( binintersect @ sK0 @ sK1 ) ) )
& ( $true
= ( subset @ sK2 @ sK1 ) )
& ( $true
= ( subset @ sK2 @ sK0 ) )
& ( binintersectI = $true )
& ( subsetE = $true )
& ( subsetI1 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f18]) ).
thf(f20,plain,
( subsetI1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f21,plain,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f22,plain,
( binintersect
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f23,plain,
( binintersectI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binintersect @ Y2 @ Y1 ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f24,plain,
subsetI1 = $true,
inference(cnf_transformation,[],[f19]) ).
thf(f25,plain,
subsetE = $true,
inference(cnf_transformation,[],[f19]) ).
thf(f26,plain,
binintersectI = $true,
inference(cnf_transformation,[],[f19]) ).
thf(f27,plain,
( $true
= ( subset @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f28,plain,
( $true
= ( subset @ sK2 @ sK1 ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f29,plain,
( $true
!= ( subset @ sK2 @ ( binintersect @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f32,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f20,f24]) ).
thf(f33,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f21,f25]) ).
thf(f34,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0
@ ( ^ [Y3: $i,Y4: $i] :
( dsetconstr @ Y3
@ ^ [Y5: $i] : ( in @ Y5 @ Y4 ) )
@ Y2
@ Y1 ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f23,f26,f22]) ).
thf(f35,plain,
( $true
!= ( subset @ sK2
@ ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) )
@ sK0
@ sK1 ) ) ),
inference(definition_unfolding,[],[f29,f22]) ).
thf(f36,definition,
( sF3
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f37,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= sF3 ),
inference(reorient_equations,[],[f36]) ).
thf(f38,plain,
$true = sF3,
inference(definition_folding,[],[f32,f37]) ).
thf(f39,definition,
( sF4
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f40,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= sF4 ),
inference(reorient_equations,[],[f39]) ).
thf(f41,plain,
$true = sF4,
inference(definition_folding,[],[f33,f40]) ).
thf(f42,definition,
( sF5
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0
@ ( ^ [Y3: $i,Y4: $i] :
( dsetconstr @ Y3
@ ^ [Y5: $i] : ( in @ Y5 @ Y4 ) )
@ Y2
@ Y1 ) ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
thf(f43,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0
@ ( ^ [Y3: $i,Y4: $i] :
( dsetconstr @ Y3
@ ^ [Y5: $i] : ( in @ Y5 @ Y4 ) )
@ Y2
@ Y1 ) ) ) ) ) ) )
= sF5 ),
inference(reorient_equations,[],[f42]) ).
thf(f44,plain,
$true = sF5,
inference(definition_folding,[],[f34,f43]) ).
thf(f45,definition,
( sF6
= ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) )
@ sK0
@ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
thf(f46,plain,
( ( ^ [Y0: $i,Y1: $i] :
( dsetconstr @ Y0
@ ^ [Y2: $i] : ( in @ Y2 @ Y1 ) )
@ sK0
@ sK1 )
= sF6 ),
inference(reorient_equations,[],[f45]) ).
thf(f47,definition,
( sF7
= ( subset @ sK2 @ sF6 ) ),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
thf(f48,plain,
( ( subset @ sK2 @ sF6 )
= sF7 ),
inference(reorient_equations,[],[f47]) ).
thf(f49,plain,
$true != sF7,
inference(definition_folding,[],[f35,f48,f46]) ).
thf(f50,definition,
( sF8
= ( subset @ sK2 @ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
thf(f51,plain,
( ( subset @ sK2 @ sK1 )
= sF8 ),
inference(reorient_equations,[],[f50]) ).
thf(f52,plain,
$true = sF8,
inference(definition_folding,[],[f28,f51]) ).
thf(f53,definition,
( sF9
= ( subset @ sK2 @ sK0 ) ),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
thf(f54,plain,
( ( subset @ sK2 @ sK0 )
= sF9 ),
inference(reorient_equations,[],[f53]) ).
thf(f55,plain,
$true = sF9,
inference(definition_folding,[],[f27,f54]) ).
thf(f56,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= $true )
| ( $false = sF3 ) ),
inference(iff_proxy_clausification,[],[f37]) ).
thf(f67,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) )
@ X1 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f56]) ).
thf(f68,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f67]) ).
thf(f69,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) )
@ X2 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f68]) ).
thf(f70,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) )
=> ( subset @ X2 @ X1 ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f69]) ).
thf(f71,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) ) )
| ( $false = sF3 )
| ( ( subset @ X2 @ X1 )
= $true ) ),
inference(imp_proxy_clausification,[],[f70]) ).
thf(f72,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK12 @ X1 @ X2 ) ) )
| ( $false = sF3 )
| ( ( subset @ X2 @ X1 )
= $true ) ),
inference(sigma_proxy_clausification,[],[f71]) ).
thf(f73,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK12 @ X1 @ X2 ) @ X2 )
=> ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) ) )
| ( $false = sF3 )
| ( ( subset @ X2 @ X1 )
= $true ) ),
inference(beta-eta_normalization,[],[f72]) ).
thf(f74,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) )
| ( $false = sF3 )
| ( ( subset @ X2 @ X1 )
= $true ) ),
inference(imp_proxy_clausification,[],[f73]) ).
thf(f75,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) )
| ( $false = sF3 )
| ( ( subset @ X2 @ X1 )
= $true ) ),
inference(imp_proxy_clausification,[],[f73]) ).
thf(f76,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true )
| ( $false = sF4 ) ),
inference(iff_proxy_clausification,[],[f40]) ).
thf(f88,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) )
@ X1 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f76]) ).
thf(f89,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ X1 @ Y0 ) ) ) ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f88]) ).
thf(f90,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ X1 @ Y0 ) ) ) )
@ X2 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f89]) ).
thf(f91,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f90]) ).
thf(f92,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) )
@ X3 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f91]) ).
thf(f93,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ( subset @ X3 @ X2 )
=> ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f92]) ).
thf(f94,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false = sF4 )
| ( $true
= ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f93]) ).
thf(f95,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false = sF4 )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(imp_proxy_clausification,[],[f94]) ).
thf(f96,plain,
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0
@ ( ^ [Y3: $i,Y4: $i] :
( dsetconstr @ Y3
@ ^ [Y5: $i] : ( in @ Y5 @ Y4 ) )
@ Y2
@ Y1 ) ) ) ) ) ) ) )
| ( $false = sF5 ) ),
inference(iff_proxy_clausification,[],[f43]) ).
thf(f108,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0
@ ( ^ [Y3: $i,Y4: $i] :
( dsetconstr @ Y3
@ ^ [Y5: $i] : ( in @ Y5 @ Y4 ) )
@ Y2
@ Y1 ) ) ) ) ) )
@ X1 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f96]) ).
thf(f109,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1
@ ( dsetconstr @ Y1
@ ^ [Y2: $i] : ( in @ Y2 @ Y0 ) ) ) ) ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f108]) ).
thf(f110,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1
@ ( dsetconstr @ Y1
@ ^ [Y2: $i] : ( in @ Y2 @ Y0 ) ) ) ) ) )
@ X2 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f109]) ).
thf(f111,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1
@ ( dsetconstr @ Y0
@ ^ [Y1: $i] : ( in @ Y1 @ X2 ) ) ) ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f110]) ).
thf(f112,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1
@ ( dsetconstr @ Y0
@ ^ [Y1: $i] : ( in @ Y1 @ X2 ) ) ) ) )
@ X3 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f111]) ).
thf(f113,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X1 @ X3 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( in @ Y0 @ X2 ) ) ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f112]) ).
thf(f114,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $false = sF5 )
| ( $true
= ( ( in @ X1 @ X2 )
=> ( in @ X1
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( in @ Y0 @ X2 ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f113]) ).
thf(f115,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $false = sF5 )
| ( $false
= ( in @ X1 @ X2 ) )
| ( $true
= ( in @ X1
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( in @ Y0 @ X2 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f114]) ).
thf(f116,plain,
( sF6
= ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( in @ Y0 @ sK1 ) ) ),
inference(beta-eta_normalization,[],[f46]) ).
thf(f118,plain,
( ( $false
= ( subset @ sK2 @ sF6 ) )
| ( $true = sF7 ) ),
inference(iff_proxy_clausification,[],[f48]) ).
thf(f119,plain,
( ( $true
= ( subset @ sK2 @ sK1 ) )
| ( $false = sF8 ) ),
inference(iff_proxy_clausification,[],[f51]) ).
thf(f121,plain,
( ( $true
= ( subset @ sK2 @ sK0 ) )
| ( $false = sF9 ) ),
inference(iff_proxy_clausification,[],[f54]) ).
thf(f123,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) )
| ( ( subset @ X2 @ X1 )
= $true ) ),
inference(forward_demodulation,[],[f75,f38]) ).
thf(f124,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK12 @ X1 @ X2 ) @ X2 ) )
| ( ( subset @ X2 @ X1 )
= $true ) ),
inference(trivial_inequality_removal,[],[f123]) ).
thf(f125,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) )
| ( ( subset @ X2 @ X1 )
= $true ) ),
inference(forward_demodulation,[],[f74,f38]) ).
thf(f126,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK12 @ X1 @ X2 ) @ X1 ) )
| ( ( subset @ X2 @ X1 )
= $true ) ),
inference(trivial_inequality_removal,[],[f125]) ).
thf(f127,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( subset @ X3 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(forward_demodulation,[],[f95,f41]) ).
thf(f128,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f127]) ).
thf(f129,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $false
= ( in @ X1 @ X2 ) )
| ( $true
= ( in @ X1
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( in @ Y0 @ X2 ) ) ) ) ),
inference(forward_demodulation,[],[f115,f44]) ).
thf(f130,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( in @ X1
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( in @ Y0 @ X2 ) ) ) )
| ( $false
= ( in @ X1 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f129]) ).
thf(f131,plain,
( $false
= ( subset @ sK2 @ sF6 ) ),
inference(forward_subsumption_resolution,[],[f118,f49]) ).
thf(f132,plain,
( ( $true = $false )
| ( $true
= ( subset @ sK2 @ sK1 ) ) ),
inference(forward_demodulation,[],[f119,f52]) ).
thf(f133,plain,
( $true
= ( subset @ sK2 @ sK1 ) ),
inference(trivial_inequality_removal,[],[f132]) ).
thf(f134,plain,
( ( $true = $false )
| ( $true
= ( subset @ sK2 @ sK0 ) ) ),
inference(forward_demodulation,[],[f121,f55]) ).
thf(f135,plain,
( $true
= ( subset @ sK2 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f134]) ).
thf(f156,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK2 ) )
| ( $true
= ( in @ X0 @ sK1 ) ) ),
inference(constrained_superposition,[],[f133,f128]) ).
thf(f157,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK2 ) )
| ( $true
= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f135,f128]) ).
thf(f159,plain,
! [X0: $i] :
( ( $true
= ( in @ X0 @ sK0 ) )
| ( $false
= ( in @ X0 @ sK2 ) ) ),
inference(trivial_inequality_removal,[],[f157]) ).
thf(f160,plain,
! [X0: $i] :
( ( $true
= ( in @ X0 @ sK1 ) )
| ( $false
= ( in @ X0 @ sK2 ) ) ),
inference(trivial_inequality_removal,[],[f156]) ).
thf(f173,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( subset
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( in @ Y0 @ X2 ) )
@ X3 ) )
| ( $true
= ( in @ X0 @ X3 ) )
| ( $false
= ( in @ X0 @ X2 ) )
| ( $false
= ( in @ X0 @ X1 ) ) ),
inference(constrained_superposition,[],[f128,f130]) ).
thf(f174,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( $false
= ( subset
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( in @ Y0 @ X2 ) )
@ X3 ) )
| ( $true
= ( in @ X0 @ X3 ) )
| ( $false
= ( in @ X0 @ X2 ) )
| ( $false
= ( in @ X0 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f173]) ).
thf(f202,plain,
! [X0: $i] :
( ( $true = $false )
| ( $true
= ( subset @ X0 @ X0 ) )
| ( $true
= ( subset @ X0 @ X0 ) ) ),
inference(constrained_superposition,[],[f124,f126]) ).
thf(f203,plain,
! [X0: $i] :
( ( $true = $false )
| ( $true
= ( subset @ X0 @ X0 ) ) ),
inference(duplicate_literal_removal,[],[f202]) ).
thf(f204,plain,
! [X0: $i] :
( $true
= ( subset @ X0 @ X0 ) ),
inference(trivial_inequality_removal,[],[f203]) ).
thf(f371,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK2 ) )
| ( $false
= ( subset
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( in @ Y0 @ X1 ) )
@ X2 ) )
| ( $true
= ( in @ X0 @ X2 ) )
| ( $false
= ( in @ X0 @ X1 ) ) ),
inference(constrained_superposition,[],[f159,f174]) ).
thf(f384,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $false
= ( in @ X0 @ sK2 ) )
| ( $false
= ( subset
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( in @ Y0 @ X1 ) )
@ X2 ) )
| ( $true
= ( in @ X0 @ X2 ) )
| ( $false
= ( in @ X0 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f371]) ).
thf(f3020,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK2 ) )
| ( $false
= ( in @ X0 @ sK2 ) )
| ( $false
= ( subset
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( in @ Y0 @ sK1 ) )
@ X1 ) )
| ( $true
= ( in @ X0 @ X1 ) ) ),
inference(constrained_superposition,[],[f160,f384]) ).
thf(f3035,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK2 ) )
| ( $false
= ( subset
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( in @ Y0 @ sK1 ) )
@ X1 ) )
| ( $true
= ( in @ X0 @ X1 ) ) ),
inference(duplicate_literal_removal,[],[f3020]) ).
thf(f3036,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( in @ X0 @ sK2 ) )
| ( $false
= ( subset
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( in @ Y0 @ sK1 ) )
@ X1 ) )
| ( $true
= ( in @ X0 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f3035]) ).
thf(f3171,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( subset @ sF6 @ X1 ) )
| ( $false
= ( in @ X0 @ sK2 ) )
| ( $true
= ( in @ X0 @ X1 ) ) ),
inference(forward_demodulation,[],[f3036,f116]) ).
thf(f3216,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK2 ) )
| ( $true
= ( in @ X0 @ sF6 ) ) ),
inference(constrained_superposition,[],[f204,f3171]) ).
thf(f3300,plain,
! [X0: $i] :
( ( $true
= ( in @ X0 @ sF6 ) )
| ( $false
= ( in @ X0 @ sK2 ) ) ),
inference(trivial_inequality_removal,[],[f3216]) ).
thf(f3670,plain,
! [X0: $i] :
( ( $true = $false )
| ( $true
= ( subset @ X0 @ sF6 ) )
| ( $false
= ( in @ ( sK12 @ sF6 @ X0 ) @ sK2 ) ) ),
inference(constrained_superposition,[],[f126,f3300]) ).
thf(f3675,plain,
! [X0: $i] :
( ( $false
= ( in @ ( sK12 @ sF6 @ X0 ) @ sK2 ) )
| ( $true
= ( subset @ X0 @ sF6 ) ) ),
inference(trivial_inequality_removal,[],[f3670]) ).
thf(f4050,plain,
( ( $true = $false )
| ( $true
= ( subset @ sK2 @ sF6 ) )
| ( $true
= ( subset @ sK2 @ sF6 ) ) ),
inference(constrained_superposition,[],[f124,f3675]) ).
thf(f4057,plain,
( ( $true = $false )
| ( $true
= ( subset @ sK2 @ sF6 ) ) ),
inference(duplicate_literal_removal,[],[f4050]) ).
thf(f4058,plain,
( $true
= ( subset @ sK2 @ sF6 ) ),
inference(trivial_inequality_removal,[],[f4057]) ).
thf(f4087,plain,
$true = $false,
inference(forward_demodulation,[],[f4058,f131]) ).
thf(f4088,plain,
$false,
inference(trivial_inequality_removal,[],[f4087]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU590^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n009.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.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:53:45 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.75/0.89 % (4036423)Will run a generic schedule for satisfiability detection.
% 3.75/0.89 % (4036428)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2274525577_2999 on theBenchmark for (2999ds/0Mi)
% 3.75/0.89 % Exception at run slice level
% 3.75/0.89 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.75/0.89 % (4036429)% WARNING: option uhcvi not known.
% 3.75/0.89 % (4036429)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2323797983:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.75/0.89 % (4036431)dis+10_1_sil=32000:sp=arity:random_seed=1795633786:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.75/0.89 % (4036430)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3218198793:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.75/0.89 % (4036432)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=538986676:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.75/0.89 % (4036433)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2904536974:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.75/0.89 % (4036434)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4002002622:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.75/0.89 % (4036429)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.75/0.89 % (4036432)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.75/0.89 % (4036429)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.75/0.89 % (4036436)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2477368292:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.75/0.89 % Exception at run slice level
% 3.75/0.89 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 3.75/0.89 % (4036444)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2982682308:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 3.75/0.89 % (4036444)Instruction limit reached!
% 3.75/0.89 % (4036444)------------------------------
% 3.75/0.89 % (4036444)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.75/0.89 % (4036444)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/0.89 % (4036444)CaDiCaL version: 2.1.3
% 3.75/0.89 % (4036444)Termination reason: Instruction limit
% 3.75/0.89 % (4036444)Termination phase: Saturation
% 3.75/0.89 % (4036444)Time elapsed: 0.034 s
% 3.75/0.89 % (4036444)Peak memory usage: 12 MB
% 3.75/0.89 % (4036444)Instructions burned: 133 (million)
% 3.75/0.89 % (4036431)Instruction limit reached!
% 3.75/0.89 % (4036431)------------------------------
% 3.75/0.89 % (4036431)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.75/0.89 % (4036431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/0.89 % (4036431)CaDiCaL version: 2.1.3
% 3.75/0.89 % (4036431)Termination reason: Instruction limit
% 3.75/0.89 % (4036431)Termination phase: Saturation
% 3.75/0.89 % (4036431)Time elapsed: 0.049 s
% 3.75/0.89 % (4036431)Peak memory usage: 11 MB
% 3.75/0.89 % (4036431)Instructions burned: 105 (million)
% 3.75/0.89 % (4036432)Instruction limit reached!
% 3.75/0.89 % (4036432)------------------------------
% 3.75/0.89 % (4036432)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.75/0.89 % (4036432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/0.89 % (4036432)CaDiCaL version: 2.1.3
% 3.75/0.89 % (4036432)Termination reason: Instruction limit
% 3.75/0.89 % (4036432)Termination phase: Saturation
% 3.75/0.89 % (4036432)Time elapsed: 0.054 s
% 3.75/0.89 % (4036432)Peak memory usage: 12 MB
% 3.75/0.89 % (4036432)Instructions burned: 116 (million)
% 3.75/0.89 % (4036446)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=1094934833:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 3.75/0.89 % (4036446)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 3.75/0.89 % (4036446)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 3.75/0.89 % (4036433)Instruction limit reached!
% 3.75/0.89 % (4036433)------------------------------
% 3.75/0.89 % (4036433)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.71/1.06 % (4036433)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.71/1.06 % (4036433)CaDiCaL version: 2.1.3
% 5.71/1.06 % (4036433)Termination reason: Instruction limit
% 5.71/1.06 % (4036433)Termination phase: Saturation
% 5.71/1.06 % (4036433)Time elapsed: 0.061 s
% 5.71/1.06 % (4036433)Peak memory usage: 12 MB
% 5.71/1.06 % (4036433)Instructions burned: 132 (million)
% 5.71/1.06 % (4036447)ott-21_1_sil=16000:fs=off:random_seed=2667473124:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 5.71/1.06 % (4036448)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2077966542:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 5.71/1.06 % (4036434)Instruction limit reached!
% 5.71/1.06 % (4036434)------------------------------
% 5.71/1.06 % (4036434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.71/1.06 % (4036434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.71/1.06 % (4036434)CaDiCaL version: 2.1.3
% 5.71/1.06 % (4036434)Termination reason: Instruction limit
% 5.71/1.06 % (4036434)Termination phase: Saturation
% 5.71/1.06 % (4036434)Time elapsed: 0.074 s
% 5.71/1.06 % (4036434)Peak memory usage: 12 MB
% 5.71/1.06 % (4036434)Instructions burned: 159 (million)
% 5.71/1.06 % (4036450)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2316470819:fmbsr=1.3:i=865:ins=25_2999 on theBenchmark for (2999ds/865Mi)
% 5.71/1.06 % Exception at run slice level
% 5.71/1.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.71/1.06 % (4036453)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1855989998:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 5.71/1.06 % (4036455)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1973820656:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 5.71/1.06 % Exception at run slice level
% 5.71/1.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.71/1.06 % (4036458)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=1598058707: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)
% 5.71/1.06 % (4036458)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.71/1.06 % (4036447)Instruction limit reached!
% 5.71/1.06 % (4036447)------------------------------
% 5.71/1.06 % (4036447)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.71/1.06 % (4036447)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.71/1.06 % (4036447)CaDiCaL version: 2.1.3
% 5.71/1.06 % (4036447)Termination reason: Instruction limit
% 5.71/1.06 % (4036447)Termination phase: Saturation
% 5.71/1.06 % (4036447)Time elapsed: 0.081 s
% 5.71/1.06 % (4036447)Peak memory usage: 12 MB
% 5.71/1.06 % (4036447)Instructions burned: 181 (million)
% 5.71/1.06 % (4036460)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2836255191:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 5.71/1.06 % (4036460)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.71/1.06 % (4036446)Instruction limit reached!
% 5.71/1.06 % (4036446)------------------------------
% 5.71/1.06 % (4036446)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.71/1.06 % (4036446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.71/1.06 % (4036446)CaDiCaL version: 2.1.3
% 5.71/1.06 % (4036446)Termination reason: Instruction limit
% 5.71/1.06 % (4036446)Termination phase: Saturation
% 5.71/1.06 % (4036446)Time elapsed: 0.155 s
% 5.71/1.06 % (4036446)Peak memory usage: 13 MB
% 5.71/1.06 % (4036446)Instructions burned: 688 (million)
% 5.71/1.06 % (4036462)fmb+10_1_sil=64000:random_seed=2135561326:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 5.71/1.06 % (4036462)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 5.71/1.06 % Exception at run slice level
% 5.71/1.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.71/1.06 % (4036464)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3772198606:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 5.71/1.06 % Exception at run slice level
% 5.71/1.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.71/1.06 % (4036466)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2860009336:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 5.71/1.06 % Exception at run slice level
% 5.71/1.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.71/1.06 % (4036468)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2576252521:i=5131_2997 on theBenchmark for (2997ds/5131Mi)
% 5.71/1.06 % (4036468)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.71/1.06 % (4036448)Instruction limit reached!
% 5.71/1.06 % (4036448)------------------------------
% 5.71/1.06 % (4036448)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.71/1.06 % (4036448)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.71/1.06 % (4036448)CaDiCaL version: 2.1.3
% 5.71/1.06 % (4036448)Termination reason: Instruction limit
% 5.71/1.06 % (4036448)Termination phase: Saturation
% 5.71/1.06 % (4036448)Time elapsed: 0.217 s
% 5.71/1.06 % (4036448)Peak memory usage: 13 MB
% 5.71/1.06 % (4036448)Instructions burned: 478 (million)
% 5.71/1.06 % (4036470)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2563126146:i=1472:ins=7:fdi=8:gsp=on_2996 on theBenchmark for (2996ds/1472Mi)
% 5.71/1.06 % (4036470)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 5.71/1.06 % (4036470)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 5.71/1.06 % (4036458)Instruction limit reached!
% 5.71/1.06 % (4036458)------------------------------
% 5.71/1.06 % (4036458)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.71/1.06 % (4036458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.71/1.06 % (4036458)CaDiCaL version: 2.1.3
% 5.71/1.06 % (4036458)Termination reason: Instruction limit
% 5.71/1.06 % (4036458)Termination phase: Saturation
% 5.71/1.06 % (4036458)Time elapsed: 0.299 s
% 5.71/1.06 % (4036458)Peak memory usage: 13 MB
% 5.71/1.06 % (4036458)Instructions burned: 693 (million)
% 5.71/1.06 % (4036472)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1951480000:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 5.71/1.06 % Exception at run slice level
% 5.71/1.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.71/1.06 % (4036474)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1672798335:fmbsr=2.30978:i=2174_2995 on theBenchmark for (2995ds/2174Mi)
% 5.71/1.06 % Exception at run slice level
% 5.71/1.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.71/1.06 % (4036476)ott-2_1_sil=16000:newcnf=on:random_seed=1543277476:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2995 on theBenchmark for (2995ds/869Mi)
% 5.71/1.06 % (4036476)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.71/1.06 % (4036460)Instruction limit reached!
% 5.71/1.06 % (4036460)------------------------------
% 5.71/1.06 % (4036460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.71/1.06 % (4036460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.71/1.06 % (4036460)CaDiCaL version: 2.1.3
% 5.71/1.06 % (4036460)Termination reason: Instruction limit
% 5.71/1.06 % (4036460)Termination phase: Saturation
% 5.71/1.06 % (4036460)Time elapsed: 0.364 s
% 5.71/1.06 % (4036460)Peak memory usage: 13 MB
% 5.71/1.06 % (4036460)Instructions burned: 880 (million)
% 5.71/1.06 % (4036478)ott+10_1_sil=32000:tgt=ground:random_seed=1101000061:i=5114:av=off_2994 on theBenchmark for (2994ds/5114Mi)
% 5.71/1.06 % (4036453)Instruction limit reached!
% 5.71/1.06 % (4036453)------------------------------
% 5.71/1.06 % (4036453)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.71/1.06 % (4036453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.71/1.06 % (4036453)CaDiCaL version: 2.1.3
% 5.71/1.06 % (4036453)Termination reason: Instruction limit
% 5.71/1.06 % (4036453)Termination phase: Saturation
% 5.71/1.06 % (4036453)Time elapsed: 0.519 s
% 5.71/1.06 % (4036453)Peak memory usage: 14 MB
% 5.71/1.06 % (4036453)Instructions burned: 1180 (million)
% 5.71/1.06 % (4036480)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1818153735:i=54282_2993 on theBenchmark for (2993ds/54282Mi)
% 5.71/1.06 % Exception at run slice level
% 5.71/1.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.71/1.06 % (4036482)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=1214606082:i=3512:aac=none_2993 on theBenchmark for (2993ds/3512Mi)
% 5.71/1.06 % (4036482)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 5.71/1.06 % (4036478) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4036423-4036478"...
% 5.71/1.06 % (4036478)...printing done.
% 5.71/1.06 % (4036478)Refutation found. Thanks to Tanya!
% 5.71/1.06 % SZS status Theorem for theBenchmark
% 5.71/1.06 % SZS output start Proof for theBenchmark
% See solution above
% 5.71/1.06 % (4036478)------------------------------
% 5.71/1.06 % (4036478)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.71/1.06 % (4036478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.71/1.06 % (4036478)CaDiCaL version: 2.1.3
% 5.71/1.06 % (4036478)Termination reason: Refutation
% 5.71/1.06 % (4036478)Time elapsed: 0.245 s
% 5.71/1.06 % (4036478)Peak memory usage: 13 MB
% 5.71/1.06 % (4036478)Instructions burned: 560 (million)
% 5.71/1.06 % (4036423)Success in time 0.834 s
% 5.71/1.06 % Vampire exiting
%------------------------------------------------------------------------------