%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU761^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 : n020.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:33:18 AM UTC 2026
% Result : Theorem 1.02s 0.44s
% Output : Refutation 1.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 11
% Syntax : Number of formulae : 109 ( 47 unt; 0 typ; 7 def)
% Number of atoms : 940 ( 222 equ; 0 cnn)
% Maximal formula atoms : 9 ( 8 avg)
% Number of connectives : 1073 ( 8 ~; 85 |; 24 &; 766 @)
% ( 0 <=>; 117 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 34 ( 30 usr; 20 con; 0-4 aty)
% ( 73 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 208 ( 82 ^; 118 !; 8 ?; 208 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
powerset: $i > $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_20,type,
sF4: $o ).
thf(func_def_21,type,
sF5: $o ).
thf(func_def_22,type,
sF6: $o ).
thf(func_def_24,type,
sF8: $o ).
thf(func_def_25,type,
sF9: $o ).
thf(func_def_26,type,
sF10: $o ).
thf(func_def_28,type,
sF12: $o ).
thf(func_def_29,type,
sF13: $o ).
thf(func_def_30,type,
sF14: $o ).
thf(func_def_31,type,
vNOT: $o > $o ).
thf(func_def_34,type,
sK17: $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,
( 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(f4,conjecture,
( subsetI1
=> ( subsetE
=> ( binintersectI
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X0 ) )
=> ( ( subset @ X1 @ X2 )
=> ( ( subset @ X1 @ X3 )
=> ( subset @ X1 @ ( binintersect @ X2 @ X3 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',woz13rule3) ).
thf(f5,negated_conjecture,
~ ( subsetI1
=> ( subsetE
=> ( binintersectI
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X0 ) )
=> ( ( subset @ X1 @ X2 )
=> ( ( subset @ X1 @ X3 )
=> ( subset @ X1 @ ( binintersect @ X2 @ X3 ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( subsetI1
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( subsetI1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( subsetE
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( binintersectI
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X2 @ X1 )
=> ( in @ X2 @ ( binintersect @ X0 @ X1 ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f11,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,[],[f10]) ).
thf(f12,plain,
~ ( subsetI1
=> ( subsetE
=> ( binintersectI
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X0 ) )
=> ( ( subset @ X1 @ X2 )
=> ( ( subset @ X1 @ X3 )
=> ( subset @ X1 @ ( binintersect @ X2 @ X3 ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
~ ( ( subsetI1 = $true )
=> ( ( subsetE = $true )
=> ( ( binintersectI = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ ( powerset @ X0 ) )
= $true )
=> ( ( ( subset @ X1 @ X2 )
= $true )
=> ( ( ( subset @ X1 @ X3 )
= $true )
=> ( ( subset @ X1 @ ( binintersect @ X2 @ X3 ) )
= $true ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( ( subset @ X1 @ ( binintersect @ X2 @ X3 ) )
!= $true )
& ( ( subset @ X1 @ X3 )
= $true )
& ( ( subset @ X1 @ X2 )
= $true )
& ( ( in @ X3 @ ( powerset @ X0 ) )
= $true ) )
& ( ( in @ X2 @ ( powerset @ X0 ) )
= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
& ( binintersectI = $true )
& ( subsetE = $true )
& ( subsetI1 = $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f15,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( ( subset @ X1 @ ( binintersect @ X2 @ X3 ) )
!= $true )
& ( ( subset @ X1 @ X3 )
= $true )
& ( ( subset @ X1 @ X2 )
= $true )
& ( ( in @ X3 @ ( powerset @ X0 ) )
= $true ) )
& ( ( in @ X2 @ ( powerset @ X0 ) )
= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
& ( binintersectI = $true )
& ( subsetE = $true )
& ( subsetI1 = $true ) ),
inference(flattening,[],[f14]) ).
thf(f16,plain,
( ( $true
!= ( subset @ sK1 @ ( binintersect @ sK2 @ sK3 ) ) )
& ( $true
= ( subset @ sK1 @ sK3 ) )
& ( $true
= ( subset @ sK1 @ sK2 ) )
& ( $true
= ( in @ sK3 @ ( powerset @ sK0 ) ) )
& ( $true
= ( in @ sK2 @ ( powerset @ sK0 ) ) )
& ( $true
= ( in @ sK1 @ ( powerset @ sK0 ) ) )
& ( binintersectI = $true )
& ( subsetE = $true )
& ( subsetI1 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f15]) ).
thf(f17,plain,
( subsetI1
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f18,plain,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f19,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,[],[f11]) ).
thf(f20,plain,
subsetI1 = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f21,plain,
subsetE = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f22,plain,
binintersectI = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f26,plain,
( $true
= ( subset @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f27,plain,
( $true
= ( subset @ sK1 @ sK3 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f28,plain,
( $true
!= ( subset @ sK1 @ ( binintersect @ sK2 @ sK3 ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f31,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f17,f20]) ).
thf(f32,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f18,f21]) ).
thf(f33,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,[],[f19,f22]) ).
thf(f34,definition,
( sF4
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f35,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= sF4 ),
inference(reorient_equations,[],[f34]) ).
thf(f36,plain,
$true = sF4,
inference(definition_folding,[],[f31,f35]) ).
thf(f37,definition,
( sF5
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
thf(f38,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= sF5 ),
inference(reorient_equations,[],[f37]) ).
thf(f39,plain,
$true = sF5,
inference(definition_folding,[],[f32,f38]) ).
thf(f40,definition,
( sF6
= ( !! @ $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,[sF6])],[function_definition]) ).
thf(f41,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binintersect @ Y2 @ Y1 ) ) ) ) ) ) )
= sF6 ),
inference(reorient_equations,[],[f40]) ).
thf(f42,plain,
$true = sF6,
inference(definition_folding,[],[f33,f41]) ).
thf(f43,definition,
( sF7
= ( binintersect @ sK2 @ sK3 ) ),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
thf(f44,plain,
( ( binintersect @ sK2 @ sK3 )
= sF7 ),
inference(reorient_equations,[],[f43]) ).
thf(f45,definition,
( sF8
= ( subset @ sK1 @ sF7 ) ),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
thf(f46,plain,
( ( subset @ sK1 @ sF7 )
= sF8 ),
inference(reorient_equations,[],[f45]) ).
thf(f47,plain,
$true != sF8,
inference(definition_folding,[],[f28,f46,f44]) ).
thf(f48,definition,
( sF9
= ( subset @ sK1 @ sK3 ) ),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
thf(f49,plain,
( ( subset @ sK1 @ sK3 )
= sF9 ),
inference(reorient_equations,[],[f48]) ).
thf(f50,plain,
$true = sF9,
inference(definition_folding,[],[f27,f49]) ).
thf(f51,definition,
( sF10
= ( subset @ sK1 @ sK2 ) ),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
thf(f52,plain,
( ( subset @ sK1 @ sK2 )
= sF10 ),
inference(reorient_equations,[],[f51]) ).
thf(f53,plain,
$true = sF10,
inference(definition_folding,[],[f26,f52]) ).
thf(f65,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= $true )
| ( $false = sF4 ) ),
inference(iff_proxy_clausification,[],[f35]) ).
thf(f76,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) )
@ X1 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f65]) ).
thf(f77,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f76]) ).
thf(f78,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) )
@ X2 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f77]) ).
thf(f79,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) )
=> ( subset @ X2 @ X1 ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f78]) ).
thf(f80,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) ) )
| ( $false = sF4 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f79]) ).
thf(f81,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK17 @ X1 @ X2 ) ) )
| ( $false = sF4 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(sigma_proxy_clausification,[],[f80]) ).
thf(f82,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK17 @ X1 @ X2 ) @ X2 )
=> ( in @ ( sK17 @ X1 @ X2 ) @ X1 ) ) )
| ( $false = sF4 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f81]) ).
thf(f83,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK17 @ X1 @ X2 ) @ X1 ) )
| ( $false = sF4 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f82]) ).
thf(f84,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK17 @ X1 @ X2 ) @ X2 ) )
| ( $false = sF4 )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f82]) ).
thf(f85,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true )
| ( $false = sF5 ) ),
inference(iff_proxy_clausification,[],[f38]) ).
thf(f97,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) )
@ X1 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f85]) ).
thf(f98,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ X1 @ Y0 ) ) ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f97]) ).
thf(f99,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ X1 @ Y0 ) ) ) )
@ X2 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f98]) ).
thf(f100,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f99]) ).
thf(f101,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) )
@ X3 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f100]) ).
thf(f102,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ( subset @ X3 @ X2 )
=> ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f101]) ).
thf(f103,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false = sF5 )
| ( $true
= ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f102]) ).
thf(f104,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false = sF5 )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(imp_proxy_clausification,[],[f103]) ).
thf(f105,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( in @ Y0 @ Y1 )
=> ( in @ Y0 @ ( binintersect @ Y2 @ Y1 ) ) ) ) ) ) )
= $true )
| ( $false = sF6 ) ),
inference(iff_proxy_clausification,[],[f41]) ).
thf(f117,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 = sF6 ) ),
inference(pi_proxy_clausification,[],[f105]) ).
thf(f118,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binintersect @ Y1 @ Y0 ) ) ) ) ) ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f117]) ).
thf(f119,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binintersect @ Y1 @ Y0 ) ) ) ) )
@ X2 ) )
| ( $false = sF6 ) ),
inference(pi_proxy_clausification,[],[f118]) ).
thf(f120,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binintersect @ Y0 @ X2 ) ) ) ) ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f119]) ).
thf(f121,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binintersect @ Y0 @ X2 ) ) ) )
@ X3 ) )
| ( $false = sF6 ) ),
inference(pi_proxy_clausification,[],[f120]) ).
thf(f122,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X1 @ X3 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binintersect @ X3 @ X2 ) ) ) ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f121]) ).
thf(f123,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $false = sF6 )
| ( $true
= ( ( in @ X1 @ X2 )
=> ( in @ X1 @ ( binintersect @ X3 @ X2 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f122]) ).
thf(f124,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $false = sF6 )
| ( $false
= ( in @ X1 @ X2 ) )
| ( $true
= ( in @ X1 @ ( binintersect @ X3 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f123]) ).
thf(f126,plain,
( ( $false
= ( subset @ sK1 @ sF7 ) )
| ( $true = sF8 ) ),
inference(iff_proxy_clausification,[],[f46]) ).
thf(f127,plain,
( ( $true
= ( subset @ sK1 @ sK3 ) )
| ( $false = sF9 ) ),
inference(iff_proxy_clausification,[],[f49]) ).
thf(f129,plain,
( ( $true
= ( subset @ sK1 @ sK2 ) )
| ( $false = sF10 ) ),
inference(iff_proxy_clausification,[],[f52]) ).
thf(f137,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK17 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(forward_demodulation,[],[f84,f36]) ).
thf(f138,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK17 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f137]) ).
thf(f139,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK17 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(forward_demodulation,[],[f83,f36]) ).
thf(f140,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK17 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f139]) ).
thf(f141,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( subset @ X3 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(forward_demodulation,[],[f104,f39]) ).
thf(f142,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f141]) ).
thf(f143,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,[],[f124,f42]) ).
thf(f144,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,[],[f143]) ).
thf(f145,plain,
( $false
= ( subset @ sK1 @ sF7 ) ),
inference(forward_subsumption_resolution,[],[f126,f47]) ).
thf(f155,plain,
( ( $true = $false )
| ( $true
= ( subset @ sK1 @ sK3 ) ) ),
inference(forward_demodulation,[],[f127,f50]) ).
thf(f156,plain,
( $true
= ( subset @ sK1 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f155]) ).
thf(f157,plain,
( ( $true = $false )
| ( $true
= ( subset @ sK1 @ sK2 ) ) ),
inference(forward_demodulation,[],[f129,f53]) ).
thf(f158,plain,
( $true
= ( subset @ sK1 @ sK2 ) ),
inference(trivial_inequality_removal,[],[f157]) ).
thf(f191,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sK3 ) ) ),
inference(constrained_superposition,[],[f156,f142]) ).
thf(f192,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sK2 ) ) ),
inference(constrained_superposition,[],[f158,f142]) ).
thf(f198,plain,
! [X0: $i] :
( ( $true
= ( in @ X0 @ sK2 ) )
| ( $false
= ( in @ X0 @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f192]) ).
thf(f199,plain,
! [X0: $i] :
( ( $true
= ( in @ X0 @ sK3 ) )
| ( $false
= ( in @ X0 @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f191]) ).
thf(f212,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sK3 ) )
| ( $true
= ( in @ X0 @ sF7 ) )
| ( $false
= ( in @ X0 @ sK2 ) ) ),
inference(constrained_superposition,[],[f144,f44]) ).
thf(f259,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sF7 ) )
| ( $false
= ( in @ X0 @ sK2 ) ) ),
inference(constrained_superposition,[],[f199,f212]) ).
thf(f260,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sK2 ) )
| ( $true
= ( in @ X0 @ sF7 ) )
| ( $false
= ( in @ X0 @ sK1 ) ) ),
inference(trivial_inequality_removal,[],[f259]) ).
thf(f643,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sF7 ) )
| ( $false
= ( in @ X0 @ sK1 ) ) ),
inference(constrained_superposition,[],[f198,f260]) ).
thf(f644,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sF7 ) ) ),
inference(duplicate_literal_removal,[],[f643]) ).
thf(f645,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sK1 ) )
| ( $true
= ( in @ X0 @ sF7 ) ) ),
inference(trivial_inequality_removal,[],[f644]) ).
thf(f745,plain,
! [X0: $i] :
( ( $true = $false )
| ( $true
= ( subset @ sK1 @ X0 ) )
| ( $true
= ( in @ ( sK17 @ X0 @ sK1 ) @ sF7 ) ) ),
inference(constrained_superposition,[],[f138,f645]) ).
thf(f752,plain,
! [X0: $i] :
( ( $true
= ( in @ ( sK17 @ X0 @ sK1 ) @ sF7 ) )
| ( $true
= ( subset @ sK1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f745]) ).
thf(f838,plain,
( ( $true = $false )
| ( $true
= ( subset @ sK1 @ sF7 ) )
| ( $true
= ( subset @ sK1 @ sF7 ) ) ),
inference(constrained_superposition,[],[f140,f752]) ).
thf(f847,plain,
( ( $true = $false )
| ( $true
= ( subset @ sK1 @ sF7 ) ) ),
inference(duplicate_literal_removal,[],[f838]) ).
thf(f848,plain,
( $true
= ( subset @ sK1 @ sF7 ) ),
inference(trivial_inequality_removal,[],[f847]) ).
thf(f855,plain,
$true = $false,
inference(forward_demodulation,[],[f848,f145]) ).
thf(f856,plain,
$false,
inference(trivial_inequality_removal,[],[f855]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU761^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17 % Computer : n020.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 14:23:49 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20 Running first-order model finding
% 0.07/0.20 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
% 1.02/0.44 % (1127284)Will run a generic schedule for satisfiability detection.
% 1.02/0.44 % (1127290)% WARNING: option uhcvi not known.
% 1.02/0.44 % (1127289)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=287009587_2999 on theBenchmark for (2999ds/0Mi)
% 1.02/0.44 % (1127292)dis+10_1_sil=32000:sp=arity:random_seed=2327744246:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.02/0.44 % (1127291)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4118156721:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.02/0.44 % (1127293)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=929617784:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.02/0.44 % (1127290)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=103363521:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.02/0.44 % (1127293)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.02/0.44 % (1127290)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.02/0.44 % (1127290)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.02/0.44 % Exception at run slice level
% 1.02/0.44 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.02/0.44 % (1127295)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1319114320:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.02/0.44 % (1127294)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1768448373:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.02/0.44 % (1127302)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=472184851:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.02/0.44 % Exception at run slice level
% 1.02/0.44 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.02/0.44 % (1127305)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1969067656:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.02/0.44 % (1127295)Instruction limit reached!
% 1.02/0.44 % (1127295)------------------------------
% 1.02/0.44 % (1127295)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.44 % (1127295)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.44 % (1127295)CaDiCaL version: 2.1.3
% 1.02/0.44 % (1127295)Termination reason: Instruction limit
% 1.02/0.44 % (1127295)Termination phase: Saturation
% 1.02/0.44 % (1127295)Time elapsed: 0.044 s
% 1.02/0.44 % (1127295)Peak memory usage: 12 MB
% 1.02/0.44 % (1127295)Instructions burned: 162 (million)
% 1.02/0.44 % (1127292)Instruction limit reached!
% 1.02/0.44 % (1127292)------------------------------
% 1.02/0.44 % (1127292)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.44 % (1127292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.44 % (1127292)CaDiCaL version: 2.1.3
% 1.02/0.44 % (1127292)Termination reason: Instruction limit
% 1.02/0.44 % (1127292)Termination phase: Saturation
% 1.02/0.44 % (1127292)Time elapsed: 0.051 s
% 1.02/0.44 % (1127292)Peak memory usage: 11 MB
% 1.02/0.44 % (1127292)Instructions burned: 108 (million)
% 1.02/0.44 % (1127293)Instruction limit reached!
% 1.02/0.44 % (1127293)------------------------------
% 1.02/0.44 % (1127293)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.44 % (1127293)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.44 % (1127293)CaDiCaL version: 2.1.3
% 1.02/0.44 % (1127293)Termination reason: Instruction limit
% 1.02/0.44 % (1127293)Termination phase: Saturation
% 1.02/0.44 % (1127293)Time elapsed: 0.055 s
% 1.02/0.44 % (1127293)Peak memory usage: 12 MB
% 1.02/0.44 % (1127293)Instructions burned: 117 (million)
% 1.02/0.44 % (1127307)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=2871480549:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.02/0.44 % (1127307)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.02/0.44 % (1127308)ott-21_1_sil=16000:fs=off:random_seed=3777796703:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 1.02/0.44 % (1127307)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.02/0.44 % (1127309)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2699406530:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 1.02/0.44 % (1127294)Instruction limit reached!
% 1.02/0.44 % (1127294)------------------------------
% 1.02/0.44 % (1127294)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.44 % (1127294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.44 % (1127294)CaDiCaL version: 2.1.3
% 1.02/0.44 % (1127294)Termination reason: Instruction limit
% 1.02/0.44 % (1127294)Termination phase: Saturation
% 1.02/0.44 % (1127294)Time elapsed: 0.082 s
% 1.02/0.44 % (1127294)Peak memory usage: 12 MB
% 1.02/0.44 % (1127294)Instructions burned: 131 (million)
% 1.02/0.44 % (1127305)Instruction limit reached!
% 1.02/0.44 % (1127305)------------------------------
% 1.02/0.44 % (1127305)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.44 % (1127305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.44 % (1127305)CaDiCaL version: 2.1.3
% 1.02/0.44 % (1127305)Termination reason: Instruction limit
% 1.02/0.44 % (1127305)Termination phase: Saturation
% 1.02/0.44 % (1127305)Time elapsed: 0.063 s
% 1.02/0.44 % (1127305)Peak memory usage: 12 MB
% 1.02/0.44 % (1127305)Instructions burned: 133 (million)
% 1.02/0.44 % (1127313)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=305307800:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.02/0.44 % Exception at run slice level
% 1.02/0.44 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.02/0.44 % (1127314)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1351911448:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 1.02/0.44 % (1127316)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1054817000:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 1.02/0.44 % Exception at run slice level
% 1.02/0.44 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.02/0.44 % (1127308)Instruction limit reached!
% 1.02/0.44 % (1127308)------------------------------
% 1.02/0.44 % (1127308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.44 % (1127308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.44 % (1127308)CaDiCaL version: 2.1.3
% 1.02/0.44 % (1127308)Termination reason: Instruction limit
% 1.02/0.44 % (1127308)Termination phase: Saturation
% 1.02/0.44 % (1127308)Time elapsed: 0.082 s
% 1.02/0.44 % (1127308)Peak memory usage: 12 MB
% 1.02/0.44 % (1127308)Instructions burned: 181 (million)
% 1.02/0.44 % (1127319)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=4038892907: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)
% 1.02/0.44 % (1127319)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.02/0.44 % (1127320)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3393445354:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 1.02/0.44 % (1127320)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.02/0.44 % (1127314) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1127284-1127314"...
% 1.02/0.44 % (1127314)...printing done.
% 1.02/0.44 % (1127314)Refutation found. Thanks to Tanya!
% 1.02/0.44 % SZS status Theorem for theBenchmark
% 1.02/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 1.02/0.45 % (1127314)------------------------------
% 1.02/0.45 % (1127314)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.45 % (1127314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.45 % (1127314)CaDiCaL version: 2.1.3
% 1.02/0.45 % (1127314)Termination reason: Refutation
% 1.02/0.45 % (1127314)Time elapsed: 0.044 s
% 1.02/0.45 % (1127314)Peak memory usage: 12 MB
% 1.02/0.45 % (1127314)Instructions burned: 79 (million)
% 1.02/0.45 % (1127284)Success in time 0.234 s
% 1.02/0.45 % Vampire exiting
%------------------------------------------------------------------------------