%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU598^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:32:36 AM UTC 2026
% Result : Theorem 2.80s 0.77s
% Output : Refutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 13
% Syntax : Number of formulae : 137 ( 61 unt; 0 typ; 7 def)
% Number of atoms : 1047 ( 276 equ; 0 cnn)
% Maximal formula atoms : 7 ( 7 avg)
% Number of connectives : 1242 ( 8 ~; 102 |; 18 &; 879 @)
% ( 0 <=>; 134 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 31 ( 27 usr; 17 con; 0-4 aty)
% ( 101 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 265 ( 114 ^; 147 !; 4 ?; 265 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
subset: $i > $i > $o ).
thf(func_def_2,type,
subsetI1: $o ).
thf(func_def_4,type,
subsetE: $o ).
thf(func_def_5,type,
setextsub: $o ).
thf(func_def_6,type,
binintersect: $i > $i > $i ).
thf(func_def_7,type,
binintersectI: $o ).
thf(func_def_8,type,
binintersectRsub: $o ).
thf(func_def_9,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
vIMP: $o > $o > $o ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_20,type,
sF2: $o ).
thf(func_def_21,type,
sF3: $o ).
thf(func_def_22,type,
sF4: $o ).
thf(func_def_23,type,
sF5: $o ).
thf(func_def_24,type,
sF6: $o ).
thf(func_def_26,type,
sF8: $o ).
thf(func_def_27,type,
vNOT: $o > $o ).
thf(func_def_30,type,
sK11: $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/sandbox/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/sandbox/benchmark/theBenchmark.p',subsetE) ).
thf(f3,axiom,
( setextsub
= ( ! [X0: $i,X1: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X0 )
=> ( X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setextsub) ).
thf(f4,axiom,
( binintersectI
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( binintersect @ X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectI) ).
thf(f5,axiom,
( binintersectRsub
= ( ! [X0: $i,X1: $i] : ( subset @ ( binintersect @ X0 @ X1 ) @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectRsub) ).
thf(f6,conjecture,
( subsetI1
=> ( subsetE
=> ( setextsub
=> ( binintersectI
=> ( binintersectRsub
=> ! [X0: $i,X1: $i] :
( ( subset @ X1 @ X0 )
=> ( ( binintersect @ X0 @ X1 )
= X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectSubset4) ).
thf(f7,negated_conjecture,
~ ( subsetI1
=> ( subsetE
=> ( setextsub
=> ( binintersectI
=> ( binintersectRsub
=> ! [X0: $i,X1: $i] :
( ( subset @ X1 @ X0 )
=> ( ( binintersect @ X0 @ X1 )
= X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
thf(f8,plain,
( subsetI1
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f9,plain,
( subsetI1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( subsetE
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f11,plain,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( setextsub
= ( ! [X0: $i,X1: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X0 )
=> ( X0 = X1 ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f13,plain,
( setextsub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( binintersectI
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( binintersect @ X0 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f15,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,[],[f14]) ).
thf(f16,plain,
( binintersectRsub
= ( ! [X0: $i,X1: $i] : ( subset @ ( binintersect @ X0 @ X1 ) @ X1 ) ) ),
inference(rectify,[],[f5]) ).
thf(f17,plain,
( binintersectRsub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ ( binintersect @ Y1 @ Y0 ) @ Y0 ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f18,plain,
~ ( subsetI1
=> ( subsetE
=> ( setextsub
=> ( binintersectI
=> ( binintersectRsub
=> ! [X0: $i,X1: $i] :
( ( subset @ X1 @ X0 )
=> ( ( binintersect @ X0 @ X1 )
= X1 ) ) ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f19,plain,
~ ( ( subsetI1 = $true )
=> ( ( subsetE = $true )
=> ( ( setextsub = $true )
=> ( ( binintersectI = $true )
=> ( ( binintersectRsub = $true )
=> ! [X0: $i,X1: $i] :
( ( ( subset @ X1 @ X0 )
= $true )
=> ( ( binintersect @ X0 @ X1 )
= X1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f20,plain,
( ? [X0: $i,X1: $i] :
( ( ( binintersect @ X0 @ X1 )
!= X1 )
& ( ( subset @ X1 @ X0 )
= $true ) )
& ( binintersectRsub = $true )
& ( binintersectI = $true )
& ( setextsub = $true )
& ( subsetE = $true )
& ( subsetI1 = $true ) ),
inference(ennf_transformation,[],[f19]) ).
thf(f21,plain,
( ? [X0: $i,X1: $i] :
( ( ( binintersect @ X0 @ X1 )
!= X1 )
& ( ( subset @ X1 @ X0 )
= $true ) )
& ( binintersectRsub = $true )
& ( binintersectI = $true )
& ( setextsub = $true )
& ( subsetE = $true )
& ( subsetI1 = $true ) ),
inference(flattening,[],[f20]) ).
thf(f22,plain,
( ( sK1
!= ( binintersect @ sK0 @ sK1 ) )
& ( $true
= ( subset @ sK1 @ sK0 ) )
& ( binintersectRsub = $true )
& ( binintersectI = $true )
& ( setextsub = $true )
& ( subsetE = $true )
& ( subsetI1 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f21]) ).
thf(f23,plain,
( subsetI1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f24,plain,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f25,plain,
( setextsub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f26,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,[],[f15]) ).
thf(f27,plain,
( binintersectRsub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ ( binintersect @ Y1 @ Y0 ) @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f28,plain,
subsetI1 = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f29,plain,
subsetE = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f30,plain,
setextsub = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f31,plain,
binintersectI = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f32,plain,
binintersectRsub = $true,
inference(cnf_transformation,[],[f22]) ).
thf(f33,plain,
( $true
= ( subset @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f34,plain,
( sK1
!= ( binintersect @ sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f37,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f23,f28]) ).
thf(f38,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f24,f29]) ).
thf(f39,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f25,f30]) ).
thf(f40,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binintersect @ Y2 @ Y1 ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f26,f31]) ).
thf(f41,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ ( binintersect @ Y1 @ Y0 ) @ Y0 ) ) )
= $true ),
inference(definition_unfolding,[],[f27,f32]) ).
thf(f42,definition,
( sF2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
thf(f43,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= sF2 ),
inference(reorient_equations,[],[f42]) ).
thf(f44,plain,
$true = sF2,
inference(definition_folding,[],[f37,f43]) ).
thf(f45,definition,
( sF3
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f46,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= sF3 ),
inference(reorient_equations,[],[f45]) ).
thf(f47,plain,
$true = sF3,
inference(definition_folding,[],[f38,f46]) ).
thf(f48,definition,
( sF4
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f49,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) )
= sF4 ),
inference(reorient_equations,[],[f48]) ).
thf(f50,plain,
$true = sF4,
inference(definition_folding,[],[f39,f49]) ).
thf(f51,definition,
( sF5
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binintersect @ Y2 @ Y1 ) ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
thf(f52,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binintersect @ Y2 @ Y1 ) ) ) ) ) ) )
= sF5 ),
inference(reorient_equations,[],[f51]) ).
thf(f53,plain,
$true = sF5,
inference(definition_folding,[],[f40,f52]) ).
thf(f54,definition,
( sF6
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ ( binintersect @ Y1 @ Y0 ) @ Y0 ) ) ) ),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
thf(f55,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ ( binintersect @ Y1 @ Y0 ) @ Y0 ) ) )
= sF6 ),
inference(reorient_equations,[],[f54]) ).
thf(f56,plain,
$true = sF6,
inference(definition_folding,[],[f41,f55]) ).
thf(f57,definition,
( sF7
= ( binintersect @ sK0 @ sK1 ) ),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
thf(f58,plain,
( ( binintersect @ sK0 @ sK1 )
= sF7 ),
inference(reorient_equations,[],[f57]) ).
thf(f59,plain,
sK1 != sF7,
inference(definition_folding,[],[f34,f58]) ).
thf(f60,definition,
( sF8
= ( subset @ sK1 @ sK0 ) ),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
thf(f61,plain,
( ( subset @ sK1 @ sK0 )
= sF8 ),
inference(reorient_equations,[],[f60]) ).
thf(f62,plain,
$true = sF8,
inference(definition_folding,[],[f33,f61]) ).
thf(f63,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= $true )
| ( $false = sF2 ) ),
inference(iff_proxy_clausification,[],[f43]) ).
thf(f74,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) )
@ X1 ) )
| ( $false = sF2 ) ),
inference(pi_proxy_clausification,[],[f63]) ).
thf(f75,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) ) ) )
| ( $false = sF2 ) ),
inference(beta-eta_normalization,[],[f74]) ).
thf(f76,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) )
@ X2 ) )
| ( $false = sF2 ) ),
inference(pi_proxy_clausification,[],[f75]) ).
thf(f77,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) )
=> ( subset @ X2 @ X1 ) ) )
| ( $false = sF2 ) ),
inference(beta-eta_normalization,[],[f76]) ).
thf(f78,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) ) )
| ( $false = sF2 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f77]) ).
thf(f79,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK11 @ X1 @ X2 ) ) )
| ( $false = sF2 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(sigma_proxy_clausification,[],[f78]) ).
thf(f80,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK11 @ X1 @ X2 ) @ X2 )
=> ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) ) )
| ( $false = sF2 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f79]) ).
thf(f81,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( $false = sF2 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f80]) ).
thf(f82,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( $false = sF2 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f80]) ).
thf(f83,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true )
| ( $false = sF3 ) ),
inference(iff_proxy_clausification,[],[f46]) ).
thf(f95,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) )
@ X1 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f83]) ).
thf(f96,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ X1 @ Y0 ) ) ) ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f95]) ).
thf(f97,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ X1 @ Y0 ) ) ) )
@ X2 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f96]) ).
thf(f98,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f97]) ).
thf(f99,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) )
@ X3 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f98]) ).
thf(f100,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ( subset @ X3 @ X2 )
=> ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f99]) ).
thf(f101,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false = sF3 )
| ( $true
= ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f100]) ).
thf(f102,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false = sF3 )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(imp_proxy_clausification,[],[f101]) ).
thf(f103,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) )
= $true )
| ( $false = sF4 ) ),
inference(iff_proxy_clausification,[],[f49]) ).
thf(f114,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) )
@ X1 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f103]) ).
thf(f115,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ Y0 @ X1 )
=> ( ( subset @ X1 @ Y0 )
=> ( Y0 = X1 ) ) ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f114]) ).
thf(f116,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( subset @ Y0 @ X1 )
=> ( ( subset @ X1 @ Y0 )
=> ( Y0 = X1 ) ) )
@ X2 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f115]) ).
thf(f117,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( subset @ X2 @ X1 )
=> ( ( subset @ X1 @ X2 )
=> ( X2 = X1 ) ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f116]) ).
thf(f118,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $false = sF4 )
| ( $true
= ( ( subset @ X1 @ X2 )
=> ( X2 = X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f117]) ).
thf(f119,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $false = sF4 )
| ( $false
= ( subset @ X1 @ X2 ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f118]) ).
thf(f120,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $false = sF4 )
| ( $false
= ( subset @ X1 @ X2 ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f119]) ).
thf(f121,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binintersect @ Y2 @ Y1 ) ) ) ) ) ) )
= $true )
| ( $false = sF5 ) ),
inference(iff_proxy_clausification,[],[f52]) ).
thf(f133,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binintersect @ Y2 @ Y1 ) ) ) ) ) )
@ X1 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f121]) ).
thf(f134,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binintersect @ Y1 @ Y0 ) ) ) ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f133]) ).
thf(f135,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binintersect @ Y1 @ Y0 ) ) ) ) )
@ X2 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f134]) ).
thf(f136,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binintersect @ Y0 @ X2 ) ) ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f135]) ).
thf(f137,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binintersect @ Y0 @ X2 ) ) ) )
@ X3 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f136]) ).
thf(f138,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X1 @ X3 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binintersect @ X3 @ X2 ) ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f137]) ).
thf(f139,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $false = sF5 )
| ( $true
= ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binintersect @ X3 @ X2 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f138]) ).
thf(f140,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $false = sF5 )
| ( $false
= ( in @ X1 @ X2 ) )
| ( $true
= ( in @ X1 @ ( binintersect @ X3 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f139]) ).
thf(f141,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ ( binintersect @ Y1 @ Y0 ) @ Y0 ) ) )
= $true )
| ( $false = sF6 ) ),
inference(iff_proxy_clausification,[],[f55]) ).
thf(f147,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ ( binintersect @ Y1 @ Y0 ) @ Y0 ) )
@ X1 ) )
| ( $false = sF6 ) ),
inference(pi_proxy_clausification,[],[f141]) ).
thf(f148,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( subset @ ( binintersect @ Y0 @ X1 ) @ X1 ) ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f147]) ).
thf(f149,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] : ( subset @ ( binintersect @ Y0 @ X1 ) @ X1 )
@ X2 ) )
| ( $false = sF6 ) ),
inference(pi_proxy_clausification,[],[f148]) ).
thf(f150,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( subset @ ( binintersect @ X2 @ X1 ) @ X1 ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f149]) ).
thf(f151,plain,
( ( $true
= ( subset @ sK1 @ sK0 ) )
| ( $false = sF8 ) ),
inference(iff_proxy_clausification,[],[f61]) ).
thf(f153,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(forward_demodulation,[],[f82,f44]) ).
thf(f154,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK11 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f153]) ).
thf(f155,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(forward_demodulation,[],[f81,f44]) ).
thf(f156,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK11 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f155]) ).
thf(f157,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( subset @ X3 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(forward_demodulation,[],[f102,f47]) ).
thf(f158,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f157]) ).
thf(f159,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( subset @ X2 @ X1 ) )
| ( $false
= ( subset @ X1 @ X2 ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f120,f50]) ).
thf(f160,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $false
= ( subset @ X1 @ X2 ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f159]) ).
thf(f161,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $false
= ( in @ X1 @ X2 ) )
| ( $true
= ( in @ X1 @ ( binintersect @ X3 @ X2 ) ) ) ),
inference(forward_demodulation,[],[f140,f53]) ).
thf(f162,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( binintersect @ X3 @ X2 ) ) )
| ( $false
= ( in @ X1 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f161]) ).
thf(f163,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( subset @ ( binintersect @ X2 @ X1 ) @ X1 ) ) ),
inference(forward_demodulation,[],[f150,f56]) ).
thf(f164,plain,
! [X2: $i,X1: $i] :
( $true
= ( subset @ ( binintersect @ X2 @ X1 ) @ X1 ) ),
inference(trivial_inequality_removal,[],[f163]) ).
thf(f165,plain,
( ( $true = $false )
| ( $true
= ( subset @ sK1 @ sK0 ) ) ),
inference(forward_demodulation,[],[f151,f62]) ).
thf(f166,plain,
( $true
= ( subset @ sK1 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f165]) ).
thf(f186,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( subset @ X1 @ ( binintersect @ X0 @ X1 ) ) )
| ( ( binintersect @ X0 @ X1 )
= X1 ) ),
inference(constrained_superposition,[],[f164,f160]) ).
thf(f193,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( subset @ X1 @ ( binintersect @ X0 @ X1 ) ) )
| ( ( binintersect @ X0 @ X1 )
= X1 ) ),
inference(trivial_inequality_removal,[],[f186]) ).
thf(f231,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f166,f158]) ).
thf(f235,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f231]) ).
thf(f246,plain,
! [X0: $i] :
( ( $true
= ( in @ X0 @ sF7 ) )
| ( $false
= ( in @ X0 @ sK1 ) )
| ( $false
= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f162,f58]) ).
thf(f323,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK11 @ ( binintersect @ X1 @ X0 ) @ X0 ) @ ( binintersect @ X1 @ X0 ) ) )
| ( ( binintersect @ X1 @ X0 )
= X0 ) ),
inference(constrained_superposition,[],[f156,f193]) ).
thf(f324,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK11 @ ( binintersect @ X1 @ X0 ) @ X0 ) @ X0 ) )
| ( ( binintersect @ X1 @ X0 )
= X0 ) ),
inference(constrained_superposition,[],[f154,f193]) ).
thf(f325,plain,
! [X0: $i,X1: $i] :
( ( $true
= ( in @ ( sK11 @ ( binintersect @ X1 @ X0 ) @ X0 ) @ X0 ) )
| ( ( binintersect @ X1 @ X0 )
= X0 ) ),
inference(trivial_inequality_removal,[],[f324]) ).
thf(f326,plain,
! [X0: $i,X1: $i] :
( ( $false
= ( in @ ( sK11 @ ( binintersect @ X1 @ X0 ) @ X0 ) @ ( binintersect @ X1 @ X0 ) ) )
| ( ( binintersect @ X1 @ X0 )
= X0 ) ),
inference(trivial_inequality_removal,[],[f323]) ).
thf(f1032,plain,
( ( $true
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK1 ) )
| ( sK1 = sF7 ) ),
inference(constrained_superposition,[],[f325,f58]) ).
thf(f1077,plain,
( $true
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK1 ) ),
inference(forward_subsumption_resolution,[],[f1032,f59]) ).
thf(f1091,plain,
( ( $true = $false )
| ( $true
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK0 ) ) ),
inference(constrained_superposition,[],[f235,f1077]) ).
thf(f1092,plain,
( $true
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK0 ) ),
inference(trivial_inequality_removal,[],[f1091]) ).
thf(f3081,plain,
( ( $false
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sF7 ) )
| ( sK1 = sF7 ) ),
inference(constrained_superposition,[],[f326,f58]) ).
thf(f3136,plain,
( $false
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sF7 ) ),
inference(forward_subsumption_resolution,[],[f3081,f59]) ).
thf(f3160,plain,
( ( $true = $false )
| ( $false
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK1 ) )
| ( $false
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK0 ) ) ),
inference(constrained_superposition,[],[f246,f3136]) ).
thf(f3165,plain,
( ( $false
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK1 ) )
| ( $false
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f3160]) ).
thf(f3189,plain,
( ( $true = $false )
| ( $false
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK0 ) ) ),
inference(forward_demodulation,[],[f3165,f1077]) ).
thf(f3190,plain,
( $false
= ( in @ ( sK11 @ sF7 @ sK1 ) @ sK0 ) ),
inference(trivial_inequality_removal,[],[f3189]) ).
thf(f3396,plain,
$true = $false,
inference(constrained_superposition,[],[f1092,f3190]) ).
thf(f3397,plain,
$false,
inference(trivial_inequality_removal,[],[f3396]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU598^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/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.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 13:58:57 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.25 Running first-order model finding
% 0.09/0.25 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
% 2.80/0.77 % (638545)Will run a generic schedule for satisfiability detection.
% 2.80/0.77 % (638560)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2898171199:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.80/0.77 % (638555)% WARNING: option uhcvi not known.
% 2.80/0.77 % (638554)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1754220218_2999 on theBenchmark for (2999ds/0Mi)
% 2.80/0.77 % (638555)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1257866635:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.80/0.77 % (638556)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2682358553:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.80/0.77 % (638557)dis+10_1_sil=32000:sp=arity:random_seed=1938299711:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.80/0.77 % (638558)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4217815551:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.80/0.77 % (638555)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.80/0.77 % (638558)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.80/0.77 % Exception at run slice level
% 2.80/0.77 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs% (638555)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.80/0.77
% 2.80/0.77 % (638559)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2070161286:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.80/0.77 % (638569)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1104200317:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.80/0.77 % Exception at run slice level
% 2.80/0.77 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.80/0.77 % (638560)Instruction limit reached!
% 2.80/0.77 % (638560)------------------------------
% 2.80/0.77 % (638560)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.77 % (638560)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.77 % (638560)CaDiCaL version: 2.1.3
% 2.80/0.77 % (638560)Termination reason: Instruction limit
% 2.80/0.77 % (638560)Termination phase: Saturation
% 2.80/0.77 % (638560)Time elapsed: 0.074 s
% 2.80/0.77 % (638560)Peak memory usage: 12 MB
% 2.80/0.77 % (638560)Instructions burned: 160 (million)
% 2.80/0.77 % (638557)Instruction limit reached!
% 2.80/0.77 % (638557)------------------------------
% 2.80/0.77 % (638557)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.77 % (638557)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.77 % (638557)CaDiCaL version: 2.1.3
% 2.80/0.77 % (638557)Termination reason: Instruction limit
% 2.80/0.77 % (638557)Termination phase: Saturation
% 2.80/0.77 % (638557)Time elapsed: 0.087 s
% 2.80/0.77 % (638557)Peak memory usage: 12 MB
% 2.80/0.77 % (638557)Instructions burned: 103 (million)
% 2.80/0.77 % (638558)Instruction limit reached!
% 2.80/0.77 % (638558)------------------------------
% 2.80/0.77 % (638558)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.77 % (638558)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.77 % (638558)CaDiCaL version: 2.1.3
% 2.80/0.77 % (638558)Termination reason: Instruction limit
% 2.80/0.77 % (638558)Termination phase: Saturation
% 2.80/0.77 % (638558)Time elapsed: 0.099 s
% 2.80/0.77 % (638558)Peak memory usage: 12 MB
% 2.80/0.77 % (638558)Instructions burned: 117 (million)
% 2.80/0.77 % (638572)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=254072890:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.80/0.77 % (638574)ott-21_1_sil=16000:fs=off:random_seed=2125512880:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.80/0.77 % (638573)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=3901924039:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.80/0.77 % (638573)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.80/0.77 % (638573)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 2.80/0.77 % (638575)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2868189474:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.80/0.77 % (638572)Instruction limit reached!
% 2.80/0.77 % (638572)------------------------------
% 2.80/0.77 % (638572)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.77 % (638572)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.77 % (638572)CaDiCaL version: 2.1.3
% 2.80/0.77 % (638572)Termination reason: Instruction limit
% 2.80/0.77 % (638572)Termination phase: Saturation
% 2.80/0.77 % (638572)Time elapsed: 0.060 s
% 2.80/0.77 % (638572)Peak memory usage: 12 MB
% 2.80/0.77 % (638572)Instructions burned: 133 (million)
% 2.80/0.77 % (638559)Instruction limit reached!
% 2.80/0.77 % (638559)------------------------------
% 2.80/0.77 % (638559)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.77 % (638559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.77 % (638559)CaDiCaL version: 2.1.3
% 2.80/0.77 % (638559)Termination reason: Instruction limit
% 2.80/0.77 % (638559)Termination phase: Saturation
% 2.80/0.77 % (638559)Time elapsed: 0.165 s
% 2.80/0.77 % (638559)Peak memory usage: 12 MB
% 2.80/0.77 % (638559)Instructions burned: 132 (million)
% 2.80/0.77 % (638581)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2351101978:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.80/0.77 % (638580)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1259974007:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.80/0.77 % Exception at run slice level
% 2.80/0.77 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.80/0.77 % (638584)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3654462645:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 2.80/0.77 % Exception at run slice level
% 2.80/0.77 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.80/0.77 % (638586)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=1452562976:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 2.80/0.77 % (638586)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.80/0.77 % (638574)Instruction limit reached!
% 2.80/0.77 % (638574)------------------------------
% 2.80/0.77 % (638574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.77 % (638574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.77 % (638574)CaDiCaL version: 2.1.3
% 2.80/0.77 % (638574)Termination reason: Instruction limit
% 2.80/0.77 % (638574)Termination phase: Saturation
% 2.80/0.77 % (638574)Time elapsed: 0.149 s
% 2.80/0.77 % (638574)Peak memory usage: 12 MB
% 2.80/0.77 % (638574)Instructions burned: 180 (million)
% 2.80/0.77 % (638588)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=593271821:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 2.80/0.77 % (638588)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 2.80/0.77 % (638581) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-638545-638581"...
% 2.80/0.77 % (638581)...printing done.
% 2.80/0.77 % (638581)Refutation found. Thanks to Tanya!
% 2.80/0.77 % SZS status Theorem for theBenchmark
% 2.80/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 2.80/0.77 % (638581)------------------------------
% 2.80/0.77 % (638581)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.80/0.77 % (638581)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/0.77 % (638581)CaDiCaL version: 2.1.3
% 2.80/0.77 % (638581)Termination reason: Refutation
% 2.80/0.77 % (638581)Time elapsed: 0.249 s
% 2.80/0.77 % (638581)Peak memory usage: 13 MB
% 2.80/0.77 % (638581)Instructions burned: 316 (million)
% 2.80/0.77 % (638545)Success in time 0.515 s
% 2.80/0.77 % Vampire exiting
%------------------------------------------------------------------------------