%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU575^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 : n013.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:31 AM UTC 2026
% Result : Theorem 0.25s 0.32s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 217 ( 65 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 175 ( 7 ~; 8 |; 9 &; 109 @)
% ( 0 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 13 usr; 7 con; 0-4 aty)
% ( 11 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 40 ( 14 ^; 24 !; 2 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
subset: $i > $i > $o ).
thf(func_def_2,type,
emptysetsubset: $o ).
thf(func_def_4,type,
setextsub: $o ).
thf(func_def_5,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_8,type,
vIMP: $o > $o > $o ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_14,type,
vNOT: $o > $o ).
thf(f1,axiom,
( emptysetsubset
= ( ! [X0: $i] : ( subset @ emptyset @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptysetsubset) ).
thf(f2,axiom,
( setextsub
= ( ! [X0: $i,X1: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X0 )
=> ( X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setextsub) ).
thf(f3,conjecture,
( emptysetsubset
=> ( setextsub
=> ! [X0: $i] :
( ( subset @ X0 @ emptyset )
=> ( X0 = emptyset ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetemptysetimpeq) ).
thf(f4,negated_conjecture,
~ ( emptysetsubset
=> ( setextsub
=> ! [X0: $i] :
( ( subset @ X0 @ emptyset )
=> ( X0 = emptyset ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( emptysetsubset
= ( ! [X0: $i] : ( subset @ emptyset @ X0 ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( emptysetsubset
= ( !! @ $i
@ ^ [Y0: $i] : ( subset @ emptyset @ Y0 ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( setextsub
= ( ! [X0: $i,X1: $i] :
( ( subset @ X0 @ X1 )
=> ( ( subset @ X1 @ X0 )
=> ( X0 = X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( setextsub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( emptysetsubset
=> ( setextsub
=> ! [X0: $i] :
( ( subset @ X0 @ emptyset )
=> ( X0 = emptyset ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( emptysetsubset = $true )
=> ( ( setextsub = $true )
=> ! [X0: $i] :
( ( ( subset @ X0 @ emptyset )
= $true )
=> ( emptyset = X0 ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X0: $i] :
( ( emptyset != X0 )
& ( ( subset @ X0 @ emptyset )
= $true ) )
& ( setextsub = $true )
& ( emptysetsubset = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ? [X0: $i] :
( ( emptyset != X0 )
& ( ( subset @ X0 @ emptyset )
= $true ) )
& ( setextsub = $true )
& ( emptysetsubset = $true ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ( emptyset != sK0 )
& ( $true
= ( subset @ sK0 @ emptyset ) )
& ( setextsub = $true )
& ( emptysetsubset = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f12]) ).
thf(f14,plain,
( emptysetsubset
= ( !! @ $i
@ ^ [Y0: $i] : ( subset @ emptyset @ Y0 ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f15,plain,
( setextsub
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
emptysetsubset = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
setextsub = $true,
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
( $true
= ( subset @ sK0 @ emptyset ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f19,plain,
emptyset != sK0,
inference(cnf_transformation,[],[f13]) ).
thf(f22,plain,
( ( !! @ $i
@ ^ [Y0: $i] : ( subset @ emptyset @ Y0 ) )
= $true ),
inference(definition_unfolding,[],[f14,f16]) ).
thf(f23,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f15,f17]) ).
thf(f24,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( subset @ Y0 @ Y1 )
=> ( Y1 = Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f23]) ).
thf(f25,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ Y0 @ X1 )
=> ( ( subset @ X1 @ Y0 )
=> ( Y0 = X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f24]) ).
thf(f26,plain,
! [X2: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( subset @ Y0 @ X1 )
=> ( ( subset @ X1 @ Y0 )
=> ( Y0 = X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f25]) ).
thf(f27,plain,
! [X2: $i,X1: $i] :
( $true
= ( ( subset @ X2 @ X1 )
=> ( ( subset @ X1 @ X2 )
=> ( X2 = X1 ) ) ) ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f28,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $true
= ( ( subset @ X1 @ X2 )
=> ( X2 = X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f27]) ).
thf(f29,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $false
= ( subset @ X1 @ X2 ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( subset @ X2 @ X1 ) )
| ( $false
= ( subset @ X1 @ X2 ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f29]) ).
thf(f31,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] : ( subset @ emptyset @ Y0 )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f22]) ).
thf(f32,plain,
! [X1: $i] :
( $true
= ( subset @ emptyset @ X1 ) ),
inference(beta-eta_normalization,[],[f31]) ).
thf(f45,plain,
( ( $true = $false )
| ( $false
= ( subset @ emptyset @ sK0 ) )
| ( emptyset = sK0 ) ),
inference(constrained_superposition,[],[f18,f30]) ).
thf(f50,plain,
( ( $false
= ( subset @ emptyset @ sK0 ) )
| ( emptyset = sK0 ) ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f57,plain,
( $false
= ( subset @ emptyset @ sK0 ) ),
inference(forward_subsumption_resolution,[],[f50,f19]) ).
thf(f61,plain,
$true = $false,
inference(forward_demodulation,[],[f57,f32]) ).
thf(f62,plain,
$false,
inference(trivial_inequality_removal,[],[f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU575^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.10/0.22 % Computer : n013.cluster.edu
% 0.10/0.22 % Model : x86_64 x86_64
% 0.10/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.22 % Memory : 8046.5625MB
% 0.10/0.22 % OS : Linux 6.8.0-71-generic
% 0.10/0.23 % CPULimit : 300
% 0.10/0.23 % WCLimit : 300
% 0.10/0.23 % DateTime : Tue Sep 29 13:50:51 UTC 2026
% 0.10/0.23 % CPUTime :
% 0.10/0.23 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.28 Running first-order model finding
% 0.25/0.28 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.25/0.32 % (2149045)Will run a generic schedule for satisfiability detection.
% 0.25/0.32 % (2149052)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=202636852:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.25/0.32 % (2149052) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2149045-2149052"...
% 0.25/0.32 % (2149050)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1307247925_3000 on theBenchmark for (3000ds/0Mi)
% 0.25/0.32 % Exception at run slice level
% 0.25/0.32 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.25/0.32 % (2149052)...printing done.
% 0.25/0.32 % (2149052)Refutation found. Thanks to Tanya!
% 0.25/0.32 % SZS status Theorem for theBenchmark
% 0.25/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.32 % (2149052)------------------------------
% 0.25/0.32 % (2149052)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.32 % (2149052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.32 % (2149052)CaDiCaL version: 2.1.3
% 0.25/0.32 % (2149052)Termination reason: Refutation
% 0.25/0.32 % (2149052)Time elapsed: 0.003 s
% 0.25/0.32 % (2149052)Peak memory usage: 12 MB
% 0.25/0.32 % (2149052)Instructions burned: 3 (million)
% 0.25/0.32 % (2149045)Success in time 0.026 s
% 0.25/0.32 % Vampire exiting
%------------------------------------------------------------------------------