%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU587^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 : n008.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 0.10s 0.24s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of formulae : 43 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 256 ( 59 equ; 0 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 395 ( 8 ~; 12 |; 6 &; 298 @)
% ( 0 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 7 con; 0-4 aty)
% ( 31 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 104 ( 37 ^; 63 !; 4 ?; 104 :)
% 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,
subsetI2: $o ).
thf(func_def_4,type,
binunion: $i > $i > $i ).
thf(func_def_5,type,
binunionIL: $o ).
thf(func_def_6,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_7,type,
vIMP: $o > $o > $o ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_16,type,
vNOT: $o > $o ).
thf(func_def_17,type,
sK2: $i > $i > $i ).
thf(f1,axiom,
( subsetI2
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetI2) ).
thf(f2,axiom,
( binunionIL
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ ( binunion @ X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL) ).
thf(f3,conjecture,
( subsetI2
=> ( binunionIL
=> ! [X0: $i,X1: $i] : ( subset @ X0 @ ( binunion @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionLsub) ).
thf(f4,negated_conjecture,
~ ( subsetI2
=> ( binunionIL
=> ! [X0: $i,X1: $i] : ( subset @ X0 @ ( binunion @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( subsetI2
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( subset @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( subsetI2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( binunionIL
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ ( binunion @ X0 @ X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( binunionIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( subsetI2
=> ( binunionIL
=> ! [X0: $i,X1: $i] : ( subset @ X0 @ ( binunion @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( subsetI2 = $true )
=> ( ( binunionIL = $true )
=> ! [X0: $i,X1: $i] :
( ( subset @ X0 @ ( binunion @ X0 @ X1 ) )
= $true ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X0: $i,X1: $i] :
( ( subset @ X0 @ ( binunion @ X0 @ X1 ) )
!= $true )
& ( binunionIL = $true )
& ( subsetI2 = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ? [X0: $i,X1: $i] :
( ( subset @ X0 @ ( binunion @ X0 @ X1 ) )
!= $true )
& ( binunionIL = $true )
& ( subsetI2 = $true ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ( $true
!= ( subset @ sK0 @ ( binunion @ sK0 @ sK1 ) ) )
& ( binunionIL = $true )
& ( subsetI2 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f12]) ).
thf(f14,plain,
( subsetI2
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f15,plain,
( binunionIL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
subsetI2 = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
binunionIL = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
( $true
!= ( subset @ sK0 @ ( binunion @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f21,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f14,f16]) ).
thf(f22,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f15,f17]) ).
thf(f23,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ ( binunion @ Y2 @ Y1 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f22]) ).
thf(f24,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( in @ X1 @ ( binunion @ Y1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f25,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( in @ X1 @ ( binunion @ Y1 @ Y0 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f24]) ).
thf(f26,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binunion @ Y0 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( in @ X1 @ ( binunion @ Y0 @ X2 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ X3 )
=> ( in @ X1 @ ( binunion @ X3 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f29,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( binunion @ X3 @ X2 ) ) )
| ( $false
= ( in @ X1 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( subset @ Y1 @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f21]) ).
thf(f31,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f32,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f31]) ).
thf(f33,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) )
=> ( subset @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f34,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK2 @ X1 @ X2 ) ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(sigma_proxy_clausification,[],[f34]) ).
thf(f36,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK2 @ X1 @ X2 ) @ X2 )
=> ( in @ ( sK2 @ X1 @ X2 ) @ X1 ) ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK2 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK2 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f36]) ).
thf(f53,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK2 @ ( binunion @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $true
= ( subset @ X2 @ ( binunion @ X0 @ X1 ) ) ) ),
inference(constrained_superposition,[],[f29,f37]) ).
thf(f54,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $false
= ( in @ ( sK2 @ ( binunion @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $true
= ( subset @ X2 @ ( binunion @ X0 @ X1 ) ) ) ),
inference(trivial_inequality_removal,[],[f53]) ).
thf(f67,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( ( subset @ X0 @ ( binunion @ X0 @ X1 ) )
= $true )
| ( ( subset @ X0 @ ( binunion @ X0 @ X1 ) )
= $true ) ),
inference(constrained_superposition,[],[f38,f54]) ).
thf(f68,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( ( subset @ X0 @ ( binunion @ X0 @ X1 ) )
= $true ) ),
inference(duplicate_literal_removal,[],[f67]) ).
thf(f69,plain,
! [X0: $i,X1: $i] :
( ( subset @ X0 @ ( binunion @ X0 @ X1 ) )
= $true ),
inference(trivial_inequality_removal,[],[f68]) ).
thf(f77,plain,
$true != $true,
inference(constrained_superposition,[],[f18,f69]) ).
thf(f78,plain,
$false,
inference(trivial_inequality_removal,[],[f77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU587^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.10/0.16 % Computer : n008.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 13:53:39 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20 Running first-order model finding
% 0.10/0.20 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
% 0.10/0.24 % (3191448)Will run a generic schedule for satisfiability detection.
% 0.10/0.24 % (3191454)% WARNING: option uhcvi not known.
% 0.10/0.24 % (3191453)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1442254854_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.24 % (3191455)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=459512725:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.24 % (3191456)dis+10_1_sil=32000:sp=arity:random_seed=164670077:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.24 % (3191457)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1532524664:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.24 % (3191458)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2535758360:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.24 % (3191459)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2066332227:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.24 % Exception at run slice level
% 0.10/0.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.10/0.24 % (3191457)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.24 % (3191457) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3191448-3191457"...
% 0.10/0.24 % (3191456) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3191448-3191456"...
% 0.10/0.24 % (3191454)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3437460024:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.24 % (3191459) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3191448-3191459"...
% 0.10/0.24 % (3191458) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3191448-3191458"...
% 0.10/0.24 % (3191454)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.24 % (3191454)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.10/0.24 % (3191455) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3191448-3191455"...
% 0.10/0.24 % (3191456)...printing done.
% 0.10/0.24 % (3191457)...printing done.
% 0.10/0.24 % (3191459)...printing done.
% 0.10/0.24 % (3191458)...printing done.
% 0.10/0.24 % (3191457)Refutation found. Thanks to Tanya!
% 0.10/0.24 % SZS status Theorem for theBenchmark
% 0.10/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.24 % (3191457)------------------------------
% 0.10/0.24 % (3191457)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.24 % (3191457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.24 % (3191457)CaDiCaL version: 2.1.3
% 0.10/0.24 % (3191457)Termination reason: Refutation
% 0.10/0.24 % (3191457)Time elapsed: 0.005 s
% 0.10/0.24 % (3191457)Peak memory usage: 12 MB
% 0.10/0.24 % (3191457)Instructions burned: 6 (million)
% 0.10/0.24 % (3191448)Success in time 0.04 s
% 0.10/0.24 % Vampire exiting
%------------------------------------------------------------------------------