%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU572^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 : n016.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:30 AM UTC 2026
% Result : Theorem 0.22s 0.27s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of formulae : 39 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 241 ( 54 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 311 ( 8 ~; 7 |; 9 &; 229 @)
% ( 0 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 15 usr; 8 con; 0-4 aty)
% ( 23 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 82 ( 28 ^; 48 !; 6 ?; 82 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
setadjoin: $i > $i > $i ).
thf(func_def_1,type,
subset: $i > $i > $o ).
thf(func_def_2,type,
subsetTrans: $o ).
thf(func_def_4,type,
setadjoinSub: $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(f1,axiom,
( subsetTrans
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X2 )
=> ( subset @ X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetTrans) ).
thf(f2,axiom,
( setadjoinSub
= ( ! [X0: $i,X1: $i] : ( subset @ X1 @ ( setadjoin @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinSub) ).
thf(f3,conjecture,
( subsetTrans
=> ( setadjoinSub
=> ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X2 )
=> ( subset @ X0 @ ( setadjoin @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinSub2) ).
thf(f4,negated_conjecture,
~ ( subsetTrans
=> ( setadjoinSub
=> ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X2 )
=> ( subset @ X0 @ ( setadjoin @ X1 @ X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( subsetTrans
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X2 )
=> ( subset @ X0 @ X2 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( subsetTrans
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( subset @ Y1 @ Y0 )
=> ( subset @ Y2 @ Y0 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( setadjoinSub
= ( ! [X0: $i,X1: $i] : ( subset @ X1 @ ( setadjoin @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( setadjoinSub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ Y0 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( subsetTrans
=> ( setadjoinSub
=> ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X2 )
=> ( subset @ X0 @ ( setadjoin @ X1 @ X2 ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( subsetTrans = $true )
=> ( ( setadjoinSub = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X0 @ X2 )
= $true )
=> ( ( subset @ X0 @ ( setadjoin @ X1 @ X2 ) )
= $true ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X0 @ ( setadjoin @ X1 @ X2 ) )
!= $true )
& ( ( subset @ X0 @ X2 )
= $true ) )
& ( setadjoinSub = $true )
& ( subsetTrans = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ? [X0: $i,X1: $i,X2: $i] :
( ( ( subset @ X0 @ ( setadjoin @ X1 @ X2 ) )
!= $true )
& ( ( subset @ X0 @ X2 )
= $true ) )
& ( setadjoinSub = $true )
& ( subsetTrans = $true ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ( $true
!= ( subset @ sK0 @ ( setadjoin @ sK1 @ sK2 ) ) )
& ( $true
= ( subset @ sK0 @ sK2 ) )
& ( setadjoinSub = $true )
& ( subsetTrans = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12]) ).
thf(f14,plain,
( subsetTrans
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( subset @ Y1 @ Y0 )
=> ( subset @ Y2 @ Y0 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f15,plain,
( setadjoinSub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ Y0 @ ( setadjoin @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
subsetTrans = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
setadjoinSub = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
( $true
= ( subset @ sK0 @ sK2 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f19,plain,
( $true
!= ( subset @ sK0 @ ( setadjoin @ sK1 @ sK2 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f22,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( subset @ Y1 @ Y0 )
=> ( subset @ Y2 @ Y0 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f14,f16]) ).
thf(f23,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ Y0 @ ( setadjoin @ Y1 @ Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f15,f17]) ).
thf(f24,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] : ( subset @ Y0 @ ( setadjoin @ Y1 @ Y0 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f23]) ).
thf(f25,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] : ( subset @ X1 @ ( setadjoin @ Y0 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f24]) ).
thf(f26,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] : ( subset @ X1 @ ( setadjoin @ Y0 @ X1 ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f25]) ).
thf(f27,plain,
! [X2: $i,X1: $i] :
( $true
= ( subset @ X1 @ ( setadjoin @ X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f28,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( subset @ Y1 @ Y0 )
=> ( subset @ Y2 @ Y0 ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f22]) ).
thf(f29,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ X1 )
=> ( subset @ Y1 @ X1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f28]) ).
thf(f30,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ X1 )
=> ( subset @ Y1 @ X1 ) ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f29]) ).
thf(f31,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( subset @ X2 @ X1 )
=> ( subset @ Y0 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f32,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( subset @ X2 @ X1 )
=> ( subset @ Y0 @ X1 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f31]) ).
thf(f33,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( subset @ X3 @ X2 )
=> ( ( subset @ X2 @ X1 )
=> ( subset @ X3 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f32]) ).
thf(f34,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $true
= ( ( subset @ X2 @ X1 )
=> ( subset @ X3 @ X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f33]) ).
thf(f35,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $false
= ( subset @ X2 @ X1 ) )
| ( $true
= ( subset @ X3 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f34]) ).
thf(f47,plain,
! [X0: $i] :
( ( $true != $true )
| ( $false
= ( subset @ sK0 @ X0 ) )
| ( $false
= ( subset @ X0 @ ( setadjoin @ sK1 @ sK2 ) ) ) ),
inference(constrained_superposition,[],[f19,f35]) ).
thf(f50,plain,
! [X0: $i] :
( ( $false
= ( subset @ X0 @ ( setadjoin @ sK1 @ sK2 ) ) )
| ( $false
= ( subset @ sK0 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f93,plain,
( ( $true = $false )
| ( ( subset @ sK0 @ sK2 )
= $false ) ),
inference(constrained_superposition,[],[f27,f50]) ).
thf(f96,plain,
( ( subset @ sK0 @ sK2 )
= $false ),
inference(trivial_inequality_removal,[],[f93]) ).
thf(f104,plain,
$true = $false,
inference(constrained_superposition,[],[f18,f96]) ).
thf(f109,plain,
$false,
inference(trivial_inequality_removal,[],[f104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU572^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.09/0.19 % Computer : n016.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:56:04 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.22/0.27 % (389550)Will run a generic schedule for satisfiability detection.
% 0.22/0.27 % (389556)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2083761752_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.27 % Exception at run slice level
% 0.22/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.27 % (389557)% WARNING: option uhcvi not known.
% 0.22/0.27 % (389557)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1771284692:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.27 % (389558)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4031969951:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.27 % (389560)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2168204474:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.27 % (389559)dis+10_1_sil=32000:sp=arity:random_seed=2640051579:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.27 % (389557)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.27 % (389560)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.22/0.27 % (389557)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.22/0.27 % (389561)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4192059405:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.27 % (389562)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1689609384:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.27 % (389569)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=349934793:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.22/0.27 % Exception at run slice level
% 0.22/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.22/0.27 % (389559) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-389550-389559"...
% 0.22/0.27 % (389562) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-389550-389562"...
% 0.22/0.27 % (389560) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-389550-389560"...
% 0.22/0.27 % (389557) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-389550-389557"...
% 0.22/0.27 % (389561) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-389550-389561"...
% 0.22/0.27 % (389559)...printing done.
% 0.22/0.27 % (389562)...printing done.
% 0.22/0.27 % (389560)...printing done.
% 0.22/0.27 % (389559)Refutation found. Thanks to Tanya!
% 0.22/0.27 % SZS status Theorem for theBenchmark
% 0.22/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.27 % (389559)------------------------------
% 0.22/0.27 % (389559)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.27 % (389559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.27 % (389559)CaDiCaL version: 2.1.3
% 0.22/0.27 % (389559)Termination reason: Refutation
% 0.22/0.27 % (389559)Time elapsed: 0.005 s
% 0.22/0.27 % (389559)Peak memory usage: 12 MB
% 0.22/0.27 % (389559)Instructions burned: 8 (million)
% 0.22/0.27 % (389550)Success in time 0.036 s
% 0.22/0.27 % Vampire exiting
%------------------------------------------------------------------------------