%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU636^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:32:46 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 43 ( 30 unt; 0 typ; 0 def)
% Number of atoms : 238 ( 74 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 267 ( 8 ~; 9 |; 9 &; 196 @)
% ( 0 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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)
% ( 14 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 52 ( 18 ^; 32 !; 2 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
setadjoin: $i > $i > $i ).
thf(func_def_2,type,
setunion: $i > $i ).
thf(func_def_3,type,
subset: $i > $i > $o ).
thf(func_def_4,type,
setextsub: $o ).
thf(func_def_6,type,
setunionsingleton1: $o ).
thf(func_def_7,type,
setunionsingleton2: $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,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_13,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_17,type,
vNOT: $o > $o ).
thf(f1,axiom,
( setextsub
= ( ! [X0: $i,X1: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X0 )
=> ( X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setextsub) ).
thf(f2,axiom,
( setunionsingleton1
= ( ! [X0: $i] : ( subset @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionsingleton1) ).
thf(f3,axiom,
( setunionsingleton2
= ( ! [X0: $i] : ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionsingleton2) ).
thf(f4,conjecture,
( setextsub
=> ( setunionsingleton1
=> ( setunionsingleton2
=> ! [X0: $i] :
( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionsingleton) ).
thf(f5,negated_conjecture,
~ ( setextsub
=> ( setunionsingleton1
=> ( setunionsingleton2
=> ! [X0: $i] :
( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
( setextsub
= ( ! [X0: $i,X1: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X0 )
=> ( X0 = X1 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( setextsub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( setunionsingleton1
= ( ! [X0: $i] : ( subset @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
( setunionsingleton1
= ( !! @ $i
@ ^ [Y0: $i] : ( subset @ ( setunion @ ( setadjoin @ Y0 @ emptyset ) ) @ Y0 ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
( setunionsingleton2
= ( ! [X0: $i] : ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
( setunionsingleton2
= ( !! @ $i
@ ^ [Y0: $i] : ( subset @ Y0 @ ( setunion @ ( setadjoin @ Y0 @ emptyset ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
~ ( setextsub
=> ( setunionsingleton1
=> ( setunionsingleton2
=> ! [X0: $i] :
( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f13,plain,
~ ( ( setextsub = $true )
=> ( ( setunionsingleton1 = $true )
=> ( ( setunionsingleton2 = $true )
=> ! [X0: $i] :
( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( ? [X0: $i] :
( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
!= X0 )
& ( setunionsingleton2 = $true )
& ( setunionsingleton1 = $true )
& ( setextsub = $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f15,plain,
( ? [X0: $i] :
( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
!= X0 )
& ( setunionsingleton2 = $true )
& ( setunionsingleton1 = $true )
& ( setextsub = $true ) ),
inference(flattening,[],[f14]) ).
thf(f16,plain,
( ( sK0
!= ( setunion @ ( setadjoin @ sK0 @ emptyset ) ) )
& ( setunionsingleton2 = $true )
& ( setunionsingleton1 = $true )
& ( setextsub = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f15]) ).
thf(f17,plain,
( setextsub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f18,plain,
( setunionsingleton1
= ( !! @ $i
@ ^ [Y0: $i] : ( subset @ ( setunion @ ( setadjoin @ Y0 @ emptyset ) ) @ Y0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f19,plain,
( setunionsingleton2
= ( !! @ $i
@ ^ [Y0: $i] : ( subset @ Y0 @ ( setunion @ ( setadjoin @ Y0 @ emptyset ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f20,plain,
setextsub = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f21,plain,
setunionsingleton1 = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f22,plain,
setunionsingleton2 = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f23,plain,
( sK0
!= ( setunion @ ( setadjoin @ sK0 @ emptyset ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f26,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f17,f20]) ).
thf(f27,plain,
( ( !! @ $i
@ ^ [Y0: $i] : ( subset @ ( setunion @ ( setadjoin @ Y0 @ emptyset ) ) @ Y0 ) )
= $true ),
inference(definition_unfolding,[],[f18,f21]) ).
thf(f28,plain,
( ( !! @ $i
@ ^ [Y0: $i] : ( subset @ Y0 @ ( setunion @ ( setadjoin @ Y0 @ emptyset ) ) ) )
= $true ),
inference(definition_unfolding,[],[f19,f22]) ).
thf(f29,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] : ( subset @ Y0 @ ( setunion @ ( setadjoin @ Y0 @ emptyset ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X1: $i] :
( $true
= ( subset @ X1 @ ( setunion @ ( setadjoin @ X1 @ emptyset ) ) ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f31,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] : ( subset @ ( setunion @ ( setadjoin @ Y0 @ emptyset ) ) @ Y0 )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f27]) ).
thf(f32,plain,
! [X1: $i] :
( $true
= ( subset @ ( setunion @ ( setadjoin @ X1 @ emptyset ) ) @ X1 ) ),
inference(beta-eta_normalization,[],[f31]) ).
thf(f33,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f26]) ).
thf(f34,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ Y0 @ X1 )
=> ( ( subset @ X1 @ Y0 )
=> ( Y0 = X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f33]) ).
thf(f35,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( subset @ Y0 @ X1 )
=> ( ( subset @ X1 @ Y0 )
=> ( Y0 = X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f34]) ).
thf(f36,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( subset @ X2 @ X1 )
=> ( ( subset @ X1 @ X2 )
=> ( X2 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f35]) ).
thf(f37,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $true
= ( ( subset @ X1 @ X2 )
=> ( X2 = X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $false
= ( subset @ X1 @ X2 ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f37]) ).
thf(f39,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $false
= ( subset @ X1 @ X2 ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f38]) ).
thf(f43,plain,
! [X0: $i] :
( ( $true = $false )
| ( ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) )
= $false )
| ( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ),
inference(constrained_superposition,[],[f32,f39]) ).
thf(f46,plain,
! [X0: $i] :
( ( ( subset @ X0 @ ( setunion @ ( setadjoin @ X0 @ emptyset ) ) )
= $false )
| ( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f50,plain,
! [X0: $i] :
( ( $true = $false )
| ( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ),
inference(forward_demodulation,[],[f46,f30]) ).
thf(f51,plain,
! [X0: $i] :
( ( setunion @ ( setadjoin @ X0 @ emptyset ) )
= X0 ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f58,plain,
sK0 != sK0,
inference(constrained_superposition,[],[f23,f51]) ).
thf(f61,plain,
$false,
inference(trivial_inequality_removal,[],[f58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU636^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.08/0.19 % Computer : n020.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % 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:01:50 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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
% 0.20/0.28 % (1100135)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (1100146)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1572446585_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (1100147)% WARNING: option uhcvi not known.
% 0.20/0.28 % (1100147)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=774474042:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (1100150)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2437667440:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (1100148)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3270687143:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (1100149)dis+10_1_sil=32000:sp=arity:random_seed=2132662486:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (1100147)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (1100152)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1945802931:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (1100151)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4124158607:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % (1100150)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.28 % (1100147)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.28 % (1100150) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1100135-1100150"...
% 0.20/0.28 % (1100149) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1100135-1100149"...
% 0.20/0.28 % (1100147) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1100135-1100147"...
% 0.20/0.28 % (1100151) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1100135-1100151"...
% 0.20/0.28 % (1100152) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1100135-1100152"...
% 0.20/0.28 % (1100157)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3878142304:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.28 % (1100148) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1100135-1100148"...
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (1100150)...printing done.
% 0.20/0.28 % (1100149)...printing done.
% 0.20/0.28 % (1100147)...printing done.
% 0.20/0.28 % (1100151)...printing done.
% 0.20/0.28 % (1100152)...printing done.
% 0.20/0.28 % (1100150)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (1100150)------------------------------
% 0.20/0.28 % (1100150)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (1100150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (1100150)CaDiCaL version: 2.1.3
% 0.20/0.28 % (1100150)Termination reason: Refutation
% 0.20/0.28 % (1100150)Time elapsed: 0.004 s
% 0.20/0.28 % (1100150)Peak memory usage: 12 MB
% 0.20/0.28 % (1100150)Instructions burned: 4 (million)
% 0.20/0.28 % (1100135)Success in time 0.046 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------