%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU722^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:30:57 AM UTC 2026
% Result : Theorem 0.20s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 230 ( 55 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 333 ( 19 ~; 2 |; 20 &; 241 @)
% ( 0 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 8 con; 0-4 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 71 ( 18 ^; 41 !; 12 ?; 71 :)
% 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,
binintersect: $i > $i > $i ).
thf(func_def_3,type,
binintersectER: $o ).
thf(func_def_7,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
vIMP: $o > $o > $o ).
thf(func_def_9,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_17,type,
vNOT: $o > $o ).
thf(f1,axiom,
( binintersectER
= ( ! [X2: $i,X0: $i,X1: $i] :
( ( in @ X2 @ ( binintersect @ X0 @ X1 ) )
=> ( in @ X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectER) ).
thf(f2,conjecture,
( binintersectER
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ~ ( in @ X3 @ X2 )
=> ~ ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',binintersectTERcontra) ).
thf(f3,negated_conjecture,
~ ( binintersectER
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ~ ( in @ X3 @ X2 )
=> ~ ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
~ ( binintersectER
=> ! [X0: $i,X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ! [X2: $i] :
( ( in @ X2 @ ( powerset @ X0 ) )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ~ ( in @ X3 @ X2 )
=> ~ ( in @ X3 @ ( binintersect @ X1 @ X2 ) ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f5,plain,
~ ( ( binintersectER = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ( in @ X3 @ X2 )
!= $true )
=> ( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
!= $true ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
( binintersectER
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X0 @ ( binintersect @ X1 @ X2 ) )
=> ( in @ X0 @ X2 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( binintersectER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ ( binintersect @ Y1 @ Y0 ) )
=> ( in @ Y2 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
~ ( ( binintersectER = $true )
=> ! [X0: $i,X1: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
=> ! [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ( in @ X3 @ X2 )
!= $true )
=> ( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
!= $true ) ) ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f9,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
= $true )
& ( ( in @ X3 @ X2 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( in @ X2 @ ( powerset @ X0 ) )
= $true ) )
& ( ( in @ X1 @ ( powerset @ X0 ) )
= $true ) )
& ( binintersectER = $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f10,plain,
( ( binintersectER = $true )
& ? [X1: $i,X0: $i] :
( ( ( in @ X1 @ ( powerset @ X0 ) )
= $true )
& ? [X2: $i] :
( ( ( in @ X2 @ ( powerset @ X0 ) )
= $true )
& ? [X3: $i] :
( ( ( in @ X3 @ X2 )
!= $true )
& ( ( in @ X3 @ X0 )
= $true )
& ( ( in @ X3 @ ( binintersect @ X1 @ X2 ) )
= $true ) ) ) ) ),
inference(flattening,[],[f9]) ).
thf(f11,plain,
( ( binintersectER = $true )
& ? [X0: $i,X1: $i] :
( ( $true
= ( in @ X0 @ ( powerset @ X1 ) ) )
& ? [X2: $i] :
( ( $true
= ( in @ X2 @ ( powerset @ X1 ) ) )
& ? [X3: $i] :
( ( ( in @ X3 @ X2 )
!= $true )
& ( $true
= ( in @ X3 @ X1 ) )
& ( $true
= ( in @ X3 @ ( binintersect @ X0 @ X2 ) ) ) ) ) ) ),
inference(rectify,[],[f10]) ).
thf(f12,plain,
( ( binintersectER = $true )
& ( $true
= ( in @ sK0 @ ( powerset @ sK1 ) ) )
& ( $true
= ( in @ sK2 @ ( powerset @ sK1 ) ) )
& ( $true
!= ( in @ sK3 @ sK2 ) )
& ( $true
= ( in @ sK3 @ sK1 ) )
& ( $true
= ( in @ sK3 @ ( binintersect @ sK0 @ sK2 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f11]) ).
thf(f13,plain,
( $true
= ( in @ sK3 @ ( binintersect @ sK0 @ sK2 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f15,plain,
( $true
!= ( in @ sK3 @ sK2 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f18,plain,
binintersectER = $true,
inference(cnf_transformation,[],[f12]) ).
thf(f19,plain,
( binintersectER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ ( binintersect @ Y1 @ Y0 ) )
=> ( in @ Y2 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f22,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ ( binintersect @ Y1 @ Y0 ) )
=> ( in @ Y2 @ Y0 ) ) ) ) ) ),
inference(definition_unfolding,[],[f19,f18]) ).
thf(f23,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ ( binintersect @ Y1 @ Y0 ) )
=> ( in @ Y2 @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f22]) ).
thf(f24,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( binintersect @ Y0 @ X1 ) )
=> ( in @ Y1 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f25,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( binintersect @ Y0 @ X1 ) )
=> ( in @ Y1 @ X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f24]) ).
thf(f26,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( binintersect @ X2 @ X1 ) )
=> ( in @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( binintersect @ X2 @ X1 ) )
=> ( in @ Y0 @ X1 ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X3 @ ( binintersect @ X2 @ X1 ) )
=> ( in @ X3 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f29,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( in @ X3 @ ( binintersect @ X2 @ X1 ) ) )
| ( $true
= ( in @ X3 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f28]) ).
thf(f31,plain,
( ( $true = $false )
| ( $true
= ( in @ sK3 @ sK2 ) ) ),
inference(constrained_superposition,[],[f13,f29]) ).
thf(f32,plain,
( $true
= ( in @ sK3 @ sK2 ) ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f34,plain,
$false,
inference(forward_subsumption_resolution,[],[f32,f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU722^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n019.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.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 14:16:56 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.26 % (839299)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.26 % (839305)lrs+10_16_si=on:nwc=1.5:random_seed=1511691041:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.26 % (839305) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-839299-839305"...
% 0.20/0.26 % (839305)...printing done.
% 0.20/0.26 % (839305)Refutation found. Thanks to Tanya!
% 0.20/0.26 % SZS status Theorem for theBenchmark
% 0.20/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.26 % (839305)------------------------------
% 0.20/0.26 % (839305)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (839305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (839305)CaDiCaL version: 2.1.3
% 0.20/0.26 % (839305)Termination reason: Refutation
% 0.20/0.26 % (839305)Time elapsed: 0.002 s
% 0.20/0.26 % (839305)Peak memory usage: 12 MB
% 0.20/0.26 % (839305)Instructions burned: 4 (million)
% 0.20/0.26 % (839299)Success in time 0.027 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------