%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU500^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:12 AM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 132 ( 35 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 191 ( 6 ~; 2 |; 4 &; 145 @)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 7 con; 0-4 aty)
% ( 15 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 68 ( 37 ^; 29 !; 2 ?; 68 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
powerset: $i > $i ).
thf(func_def_3,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_4,type,
dsetconstrER: $o ).
thf(func_def_6,type,
prop2set: $o > $i ).
thf(func_def_7,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_8,type,
vIMP: $o > $o > $o ).
thf(func_def_9,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
sK0: $o ).
thf(func_def_17,type,
vNOT: $o > $o ).
thf(f1,axiom,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrER) ).
thf(f2,axiom,
( prop2set
= ( ^ [X0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [X1: $i] : X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop2set) ).
thf(f3,conjecture,
( dsetconstrER
=> ! [X0: $o,X1: $i] :
( ( in @ X1 @ ( prop2set @ X0 ) )
=> X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop2setE) ).
thf(f4,negated_conjecture,
~ ( dsetconstrER
=> ! [X0: $o,X1: $i] :
( ( in @ X1 @ ( prop2set @ X0 ) )
=> X0 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( prop2set
= ( ^ [X0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [X1: $i] : X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( prop2set
= ( ^ [Y0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [Y1: $i] : Y0 ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( dsetconstrER
=> ! [X0: $o,X1: $i] :
( ( in @ X1 @ ( prop2set @ X0 ) )
=> X0 ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( dsetconstrER = $true )
=> ! [X0: $o,X1: $i] :
( ( ( in @ X1 @ ( prop2set @ X0 ) )
= $true )
=> ( $true = X0 ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ? [X0: $o,X1: $i] :
( ( $true != X0 )
& ( ( in @ X1 @ ( prop2set @ X0 ) )
= $true ) )
& ( dsetconstrER = $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ( $true != sK0 )
& ( $true
= ( in @ sK1 @ ( prop2set @ sK0 ) ) )
& ( dsetconstrER = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f11]) ).
thf(f13,plain,
( dsetconstrER
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f14,plain,
( prop2set
= ( ^ [Y0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [Y1: $i] : Y0 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f15,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f12]) ).
thf(f16,plain,
( $true
= ( in @ sK1 @ ( prop2set @ sK0 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f17,plain,
$true != sK0,
inference(cnf_transformation,[],[f12]) ).
thf(f20,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f13,f15]) ).
thf(f21,plain,
( $true
= ( in @ sK1
@ ( ^ [Y0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [Y1: $i] : Y0 )
@ sK0 ) ) ),
inference(definition_unfolding,[],[f16,f14]) ).
thf(f22,plain,
( $true
= ( in @ sK1
@ ( dsetconstr @ ( powerset @ emptyset )
@ ^ [Y0: $i] : sK0 ) ) ),
inference(beta-eta_normalization,[],[f21]) ).
thf(f23,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f20]) ).
thf(f24,plain,
! [X1: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f25,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) )
@ X2 ) ),
inference(pi_proxy_clausification,[],[f24]) ).
thf(f26,plain,
! [X2: $i > $o,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f27]) ).
thf(f29,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f28]) ).
thf(f31,plain,
( ( $true = $false )
| ( $true
= ( ^ [Y0: $i] : sK0
@ sK1 ) ) ),
inference(constrained_superposition,[],[f22,f29]) ).
thf(f36,plain,
( $true
= ( ^ [Y0: $i] : sK0
@ sK1 ) ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f37,plain,
$true = sK0,
inference(beta-eta_normalization,[],[f36]) ).
thf(f40,plain,
$false,
inference(forward_subsumption_resolution,[],[f37,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU500^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.08/0.17 % Computer : n016.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:51:35 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.08/0.24 % (376688)Will run a generic schedule for satisfiability detection.
% 0.08/0.24 % (376693)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1676343486_3000 on theBenchmark for (3000ds/0Mi)
% 0.08/0.24 % Exception at run slice level
% 0.08/0.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.24 % (376694)% WARNING: option uhcvi not known.
% 0.08/0.24 % (376697)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=491983382:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.08/0.24 % (376695)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2572128179:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.08/0.24 % (376696)dis+10_1_sil=32000:sp=arity:random_seed=2919380792:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.08/0.24 % (376698)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=834807185:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.08/0.24 % (376697)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.24 % (376699)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2900270806:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.08/0.24 % (376694)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3155103668:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.08/0.24 % (376694)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.24 % (376701)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3952412788:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.08/0.24 % (376697) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-376688-376697"...
% 0.08/0.24 % (376696) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-376688-376696"...
% 0.08/0.24 % (376694)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.24 % (376695) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-376688-376695"...
% 0.08/0.24 % Exception at run slice level
% 0.08/0.24 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.24 % (376694) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-376688-376694"...
% 0.08/0.24 % (376698) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-376688-376698"...
% 0.08/0.24 % (376696)...printing done.
% 0.08/0.24 % (376697)...printing done.
% 0.08/0.24 % (376695)...printing done.
% 0.08/0.24 % (376699) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-376688-376699"...
% 0.08/0.24 % (376697)Refutation found. Thanks to Tanya!
% 0.08/0.24 % SZS status Theorem for theBenchmark
% 0.08/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.24 % (376697)------------------------------
% 0.08/0.24 % (376697)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.24 % (376697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.24 % (376697)CaDiCaL version: 2.1.3
% 0.08/0.24 % (376697)Termination reason: Refutation
% 0.08/0.24 % (376697)Time elapsed: 0.003 s
% 0.08/0.24 % (376697)Peak memory usage: 12 MB
% 0.08/0.24 % (376697)Instructions burned: 3 (million)
% 0.08/0.24 % (376688)Success in time 0.026 s
% 0.08/0.24 % Vampire exiting
%------------------------------------------------------------------------------