%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU570^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 : n012.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:29 AM UTC 2026
% Result : Theorem 0.09s 0.17s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 3
% Syntax : Number of formulae : 52 ( 28 unt; 0 typ; 0 def)
% Number of atoms : 396 ( 95 equ; 0 cnn)
% Maximal formula atoms : 5 ( 7 avg)
% Number of connectives : 490 ( 8 ~; 31 |; 12 &; 348 @)
% ( 0 <=>; 60 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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)
% ( 31 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 124 ( 37 ^; 81 !; 6 ?; 124 :)
% 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,
subsetE: $o ).
thf(func_def_5,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
vIMP: $o > $o > $o ).
thf(func_def_7,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_16,type,
vNOT: $o > $o ).
thf(func_def_17,type,
sK3: $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,
( subsetE
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetE) ).
thf(f3,conjecture,
( subsetI2
=> ( subsetE
=> ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X2 )
=> ( subset @ X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetTrans) ).
thf(f4,negated_conjecture,
~ ( subsetI2
=> ( subsetE
=> ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X2 )
=> ( subset @ X0 @ X2 ) ) ) ) ),
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,
( subsetE
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( subsetI2
=> ( subsetE
=> ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X2 )
=> ( subset @ X0 @ X2 ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( subsetI2 = $true )
=> ( ( subsetE = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X0 @ X1 )
= $true )
=> ( ( ( subset @ X1 @ X2 )
= $true )
=> ( ( subset @ X0 @ X2 )
= $true ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X0 @ X2 )
!= $true )
& ( ( subset @ X1 @ X2 )
= $true )
& ( ( subset @ X0 @ X1 )
= $true ) )
& ( subsetE = $true )
& ( subsetI2 = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X0 @ X2 )
!= $true )
& ( ( subset @ X1 @ X2 )
= $true )
& ( ( subset @ X0 @ X1 )
= $true ) )
& ( subsetE = $true )
& ( subsetI2 = $true ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ( $true
!= ( subset @ sK0 @ sK2 ) )
& ( $true
= ( subset @ sK1 @ sK2 ) )
& ( $true
= ( subset @ sK0 @ sK1 ) )
& ( subsetE = $true )
& ( subsetI2 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[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,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
subsetI2 = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
subsetE = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
( $true
= ( subset @ sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f19,plain,
( $true
= ( subset @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f20,plain,
( $true
!= ( subset @ sK0 @ sK2 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f23,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(f24,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f15,f17]) ).
thf(f25,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f24]) ).
thf(f26,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ X1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ X1 @ Y0 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f29,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( subset @ X3 @ X2 )
=> ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f31,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $true
= ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f30]) ).
thf(f32,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $true
= ( in @ X1 @ X2 ) ) ),
inference(imp_proxy_clausification,[],[f31]) ).
thf(f33,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,[],[f23]) ).
thf(f34,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( subset @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f33]) ).
thf(f35,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,[],[f34]) ).
thf(f36,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) )
=> ( subset @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK3 @ X1 @ X2 ) ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(sigma_proxy_clausification,[],[f37]) ).
thf(f39,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK3 @ X1 @ X2 ) @ X2 )
=> ( in @ ( sK3 @ X1 @ X2 ) @ X1 ) ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f38]) ).
thf(f40,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK3 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f39]) ).
thf(f41,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK3 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( subset @ X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f39]) ).
thf(f65,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( subset @ X2 @ X0 ) )
| ( $false
= ( in @ ( sK3 @ X0 @ X1 ) @ X2 ) )
| ( $true
= ( subset @ X1 @ X0 ) ) ),
inference(constrained_superposition,[],[f32,f40]) ).
thf(f66,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $false
= ( in @ ( sK3 @ X0 @ X1 ) @ X2 ) )
| ( $false
= ( subset @ X2 @ X0 ) )
| ( $true
= ( subset @ X1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f71,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( ( subset @ X1 @ X2 )
= $false )
| ( $true
= ( in @ ( sK3 @ X0 @ X1 ) @ X2 ) )
| ( $true
= ( subset @ X1 @ X0 ) ) ),
inference(constrained_superposition,[],[f32,f41]) ).
thf(f75,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true
= ( in @ ( sK3 @ X0 @ X1 ) @ X2 ) )
| ( ( subset @ X1 @ X2 )
= $false )
| ( $true
= ( subset @ X1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f71]) ).
thf(f145,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( subset @ X2 @ X0 ) )
| ( $true
= ( subset @ X1 @ X0 ) )
| ( ( subset @ X1 @ X2 )
= $false )
| ( $true
= ( subset @ X1 @ X0 ) ) ),
inference(constrained_superposition,[],[f66,f75]) ).
thf(f146,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( subset @ X2 @ X0 ) )
| ( $true
= ( subset @ X1 @ X0 ) )
| ( ( subset @ X1 @ X2 )
= $false ) ),
inference(duplicate_literal_removal,[],[f145]) ).
thf(f147,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X0 ) )
| ( $true
= ( subset @ X1 @ X0 ) )
| ( ( subset @ X1 @ X2 )
= $false ) ),
inference(trivial_inequality_removal,[],[f146]) ).
thf(f253,plain,
! [X0: $i] :
( ( $true != $true )
| ( $false
= ( subset @ X0 @ sK2 ) )
| ( $false
= ( subset @ sK0 @ X0 ) ) ),
inference(constrained_superposition,[],[f20,f147]) ).
thf(f272,plain,
! [X0: $i] :
( ( $false
= ( subset @ X0 @ sK2 ) )
| ( $false
= ( subset @ sK0 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f253]) ).
thf(f302,plain,
( ( $true = $false )
| ( ( subset @ sK0 @ sK1 )
= $false ) ),
inference(constrained_superposition,[],[f19,f272]) ).
thf(f309,plain,
( ( subset @ sK0 @ sK1 )
= $false ),
inference(trivial_inequality_removal,[],[f302]) ).
thf(f408,plain,
$true = $false,
inference(constrained_superposition,[],[f18,f309]) ).
thf(f411,plain,
$false,
inference(trivial_inequality_removal,[],[f408]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU570^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 13:50:34 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.13 Running first-order model finding
% 0.09/0.13 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.09/0.17 % (136853)Will run a generic schedule for satisfiability detection.
% 0.09/0.17 % (136860)% WARNING: option uhcvi not known.
% 0.09/0.17 % (136860)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=784422982:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.09/0.17 % (136860)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.17 % (136860)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.09/0.17 % (136859)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=201919785_3000 on theBenchmark for (3000ds/0Mi)
% 0.09/0.17 % (136863)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3668899100:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.09/0.17 % (136862)dis+10_1_sil=32000:sp=arity:random_seed=2038497135:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.09/0.17 % (136864)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2749043320:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.09/0.17 % (136863)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.17 % (136861)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1865642024:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.09/0.17 % Exception at run slice level
% 0.09/0.17 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.09/0.17 % (136865)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=100648434:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.09/0.17 % (136860) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-136853-136860"...
% 0.09/0.17 % (136860)...printing done.
% 0.09/0.17 % (136865) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-136853-136865"...
% 0.09/0.17 % (136860)Refutation found. Thanks to Tanya!
% 0.09/0.17 % SZS status Theorem for theBenchmark
% 0.09/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.17 % (136860)------------------------------
% 0.09/0.17 % (136860)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.17 % (136860)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.17 % (136860)CaDiCaL version: 2.1.3
% 0.09/0.17 % (136860)Termination reason: Refutation
% 0.09/0.17 % (136860)Time elapsed: 0.012 s
% 0.09/0.17 % (136860)Peak memory usage: 12 MB
% 0.09/0.17 % (136860)Instructions burned: 41 (million)
% 0.09/0.17 % (136853)Success in time 0.026 s
% 0.09/0.17 % Vampire exiting
%------------------------------------------------------------------------------