%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU817^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 : n009.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:33:32 AM UTC 2026
% Result : Theorem 0.08s 0.27s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 45 unt; 0 typ; 0 def)
% Number of atoms : 575 ( 106 equ; 0 cnn)
% Maximal formula atoms : 5 ( 9 avg)
% Number of connectives : 964 ( 23 ~; 35 |; 59 &; 643 @)
% ( 0 <=>; 129 =>; 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 : 32 ( 27 usr; 9 con; 0-4 aty)
% ( 69 !!; 6 ??; 0 @@+; 0 @@-)
% Number of variables : 180 ( 111 ^; 61 !; 8 ?; 180 :)
% 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,
nonempty: $i > $o ).
thf(func_def_4,type,
subset: $i > $i > $o ).
thf(func_def_5,type,
subsetE: $o ).
thf(func_def_7,type,
transitiveset: $i > $o ).
thf(func_def_8,type,
stricttotalorderedByIn: $i > $o ).
thf(func_def_9,type,
wellorderedByIn: $i > $o ).
thf(func_def_10,type,
ordinal: $i > $o ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_13,type,
vNOT: $o > $o ).
thf(func_def_14,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_15,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_16,type,
vIMP: $o > $o > $o ).
thf(func_def_17,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
vAND: $o > $o > $o ).
thf(func_def_20,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_21,type,
vOR: $o > $o > $o ).
thf(func_def_22,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_28,type,
sK3: $i > $i ).
thf(f1,axiom,
( nonempty
= ( ^ [X0: $i] : ( X0 != emptyset ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonempty) ).
thf(f2,axiom,
( subsetE
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE) ).
thf(f3,axiom,
( transitiveset
= ( ^ [X0: $i] :
! [X1: $i] :
( ( in @ X1 @ X0 )
=> ( subset @ X1 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitiveset) ).
thf(f4,axiom,
( stricttotalorderedByIn
= ( ^ [X0: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ~ ( in @ X2 @ X2 ) )
& ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( in @ X3 @ X2 )
| ( in @ X2 @ X3 )
| ( X2 = X3 ) ) ) )
& ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( ( in @ X2 @ X3 )
& ( in @ X1 @ X2 ) )
=> ( in @ X1 @ X3 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',stricttotalorderedByIn) ).
thf(f5,axiom,
( wellorderedByIn
= ( ^ [X0: $i] :
( ! [X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ( ( nonempty @ X1 )
=> ? [X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X2 @ X3 )
| ( X2 = X3 ) ) )
& ( in @ X2 @ X1 ) ) ) )
& ( stricttotalorderedByIn @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wellorderedByIn) ).
thf(f6,axiom,
( ordinal
= ( ^ [X0: $i] :
( ( wellorderedByIn @ X0 )
& ( transitiveset @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordinal) ).
thf(f7,conjecture,
( subsetE
=> ! [X0: $i] :
( ( ordinal @ X0 )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordinalTransSet) ).
thf(f8,negated_conjecture,
~ ( subsetE
=> ! [X0: $i] :
( ( ordinal @ X0 )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ X0 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
thf(f9,plain,
( nonempty
= ( ^ [Y0: $i] : ( emptyset != Y0 ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f10,plain,
( subsetE
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( subset @ X0 @ X1 )
=> ( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f11,plain,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( transitiveset
= ( ^ [X0: $i] :
! [X1: $i] :
( ( in @ X1 @ X0 )
=> ( subset @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f13,plain,
( transitiveset
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( stricttotalorderedByIn
= ( ^ [X0: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X0 )
=> ~ ( in @ X1 @ X1 ) )
& ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( in @ X3 @ X2 )
| ( in @ X2 @ X3 )
| ( X2 = X3 ) ) ) )
& ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ! [X5: $i] :
( ( in @ X5 @ X0 )
=> ! [X6: $i] :
( ( in @ X6 @ X0 )
=> ( ( ( in @ X5 @ X6 )
& ( in @ X4 @ X5 ) )
=> ( in @ X4 @ X6 ) ) ) ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f15,plain,
( stricttotalorderedByIn
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ( ( in @ Y1 @ Y2 )
& ( in @ Y2 @ Y3 ) )
=> ( in @ Y1 @ Y3 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( ( Y1 = Y2 )
| ( in @ Y1 @ Y2 )
| ( in @ Y2 @ Y1 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ~ ( in @ Y1 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f14]) ).
thf(f16,plain,
( wellorderedByIn
= ( ^ [X0: $i] :
( ! [X1: $i] :
( ( in @ X1 @ ( powerset @ X0 ) )
=> ( ( nonempty @ X1 )
=> ? [X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( ( in @ X2 @ X3 )
| ( X2 = X3 ) ) )
& ( in @ X2 @ X1 ) ) ) )
& ( stricttotalorderedByIn @ X0 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f17,plain,
( wellorderedByIn
= ( ^ [Y0: $i] :
( ( stricttotalorderedByIn @ Y0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( powerset @ Y0 ) )
=> ( ( nonempty @ Y1 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ( Y2 = Y3 )
| ( in @ Y2 @ Y3 ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f18,plain,
( ordinal
= ( ^ [X0: $i] :
( ( wellorderedByIn @ X0 )
& ( transitiveset @ X0 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f19,plain,
( ordinal
= ( ^ [Y0: $i] :
( ( transitiveset @ Y0 )
& ( wellorderedByIn @ Y0 ) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f20,plain,
~ ( subsetE
=> ! [X0: $i] :
( ( ordinal @ X0 )
=> ! [X1: $i,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( in @ X1 @ X2 )
=> ( in @ X1 @ X0 ) ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f21,plain,
~ ( ( subsetE = $true )
=> ! [X0: $i] :
( ( ( ordinal @ X0 )
= $true )
=> ! [X1: $i,X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ( ( ( in @ X1 @ X2 )
= $true )
=> ( ( in @ X1 @ X0 )
= $true ) ) ) ) ),
inference(fool_elimination,[],[f20]) ).
thf(f22,plain,
( ? [X0: $i] :
( ? [X1: $i,X2: $i] :
( ( ( in @ X1 @ X0 )
!= $true )
& ( ( in @ X1 @ X2 )
= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( ( ordinal @ X0 )
= $true ) )
& ( subsetE = $true ) ),
inference(ennf_transformation,[],[f21]) ).
thf(f23,plain,
( ? [X0: $i] :
( ? [X1: $i,X2: $i] :
( ( ( in @ X1 @ X0 )
!= $true )
& ( ( in @ X1 @ X2 )
= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
& ( ( ordinal @ X0 )
= $true ) )
& ( subsetE = $true ) ),
inference(flattening,[],[f22]) ).
thf(f24,plain,
( ( $true
!= ( in @ sK1 @ sK0 ) )
& ( $true
= ( in @ sK1 @ sK2 ) )
& ( $true
= ( in @ sK2 @ sK0 ) )
& ( $true
= ( ordinal @ sK0 ) )
& ( subsetE = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f23]) ).
thf(f25,plain,
( nonempty
= ( ^ [Y0: $i] : ( emptyset != Y0 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f26,plain,
( subsetE
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f27,plain,
( transitiveset
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( subset @ Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f28,plain,
( stricttotalorderedByIn
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ( ( in @ Y1 @ Y2 )
& ( in @ Y2 @ Y3 ) )
=> ( in @ Y1 @ Y3 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( ( Y1 = Y2 )
| ( in @ Y1 @ Y2 )
| ( in @ Y2 @ Y1 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ~ ( in @ Y1 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f29,plain,
( wellorderedByIn
= ( ^ [Y0: $i] :
( ( stricttotalorderedByIn @ Y0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( powerset @ Y0 ) )
=> ( ( nonempty @ Y1 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ( Y2 = Y3 )
| ( in @ Y2 @ Y3 ) ) ) ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f30,plain,
( ordinal
= ( ^ [Y0: $i] :
( ( transitiveset @ Y0 )
& ( wellorderedByIn @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f31,plain,
subsetE = $true,
inference(cnf_transformation,[],[f24]) ).
thf(f32,plain,
( $true
= ( ordinal @ sK0 ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f33,plain,
( $true
= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f34,plain,
( $true
= ( in @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f35,plain,
( $true
!= ( in @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f38,plain,
( wellorderedByIn
= ( ^ [Y0: $i] :
( ( ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y1 )
=> ( ( ( in @ Y2 @ Y3 )
& ( in @ Y3 @ Y4 ) )
=> ( in @ Y2 @ Y4 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ( Y2 = Y3 )
| ( in @ Y2 @ Y3 )
| ( in @ Y3 @ Y2 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ~ ( in @ Y2 @ Y2 ) ) ) )
@ Y0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( powerset @ Y0 ) )
=> ( ( ^ [Y2: $i] : ( emptyset != Y2 )
@ Y1 )
=> ( ?? @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y1 )
=> ( ( Y2 = Y3 )
| ( in @ Y2 @ Y3 ) ) ) ) ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f29,f28,f25]) ).
thf(f39,plain,
( ordinal
= ( ^ [Y0: $i] :
( ( ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( subset @ Y2 @ Y1 ) ) )
@ Y0 )
& ( ^ [Y1: $i] :
( ( ^ [Y2: $i] :
( ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( !! @ $i
@ ^ [Y5: $i] :
( ( in @ Y5 @ Y2 )
=> ( ( ( in @ Y3 @ Y4 )
& ( in @ Y4 @ Y5 ) )
=> ( in @ Y3 @ Y5 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( ( Y3 = Y4 )
| ( in @ Y3 @ Y4 )
| ( in @ Y4 @ Y3 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ~ ( in @ Y3 @ Y3 ) ) ) )
@ Y1 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ ( powerset @ Y1 ) )
=> ( ( ^ [Y3: $i] : ( emptyset != Y3 )
@ Y2 )
=> ( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
& ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( ( Y3 = Y4 )
| ( in @ Y3 @ Y4 ) ) ) ) ) ) ) ) ) )
@ Y0 ) ) ) ),
inference(definition_unfolding,[],[f30,f27,f38]) ).
thf(f40,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( subset @ Y2 @ Y1 )
=> ( ( in @ Y0 @ Y2 )
=> ( in @ Y0 @ Y1 ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f26,f31]) ).
thf(f41,plain,
( $true
= ( ^ [Y0: $i] :
( ( ^ [Y1: $i] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( subset @ Y2 @ Y1 ) ) )
@ Y0 )
& ( ^ [Y1: $i] :
( ( ^ [Y2: $i] :
( ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( !! @ $i
@ ^ [Y5: $i] :
( ( in @ Y5 @ Y2 )
=> ( ( ( in @ Y3 @ Y4 )
& ( in @ Y4 @ Y5 ) )
=> ( in @ Y3 @ Y5 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( ( Y3 = Y4 )
| ( in @ Y3 @ Y4 )
| ( in @ Y4 @ Y3 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
=> ~ ( in @ Y3 @ Y3 ) ) ) )
@ Y1 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ ( powerset @ Y1 ) )
=> ( ( ^ [Y3: $i] : ( emptyset != Y3 )
@ Y2 )
=> ( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
& ( !! @ $i
@ ^ [Y4: $i] :
( ( in @ Y4 @ Y2 )
=> ( ( Y3 = Y4 )
| ( in @ Y3 @ Y4 ) ) ) ) ) ) ) ) ) )
@ Y0 ) )
@ sK0 ) ),
inference(definition_unfolding,[],[f32,f39]) ).
thf(f42,plain,
( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( subset @ Y0 @ sK0 ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
=> ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ sK0 )
=> ( ( ( in @ Y0 @ Y1 )
& ( in @ Y1 @ Y2 ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ sK0 )
=> ( ( Y0 = Y1 )
| ( in @ Y0 @ Y1 )
| ( in @ Y1 @ Y0 ) ) ) ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ~ ( in @ Y0 @ Y0 ) ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( powerset @ sK0 ) )
=> ( ( emptyset != Y0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( ( Y1 = Y2 )
| ( in @ Y1 @ Y2 ) ) ) ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f41]) ).
thf(f44,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( subset @ Y0 @ sK0 ) ) ) ),
inference(and_proxy_clausification,[],[f42]) ).
thf(f45,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( subset @ Y0 @ sK0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f44]) ).
thf(f46,plain,
! [X1: $i] :
( $true
= ( ( in @ X1 @ sK0 )
=> ( subset @ X1 @ sK0 ) ) ),
inference(beta-eta_normalization,[],[f45]) ).
thf(f47,plain,
! [X1: $i] :
( ( $true
= ( subset @ X1 @ sK0 ) )
| ( $false
= ( in @ X1 @ sK0 ) ) ),
inference(imp_proxy_clausification,[],[f46]) ).
thf(f93,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,[],[f40]) ).
thf(f94,plain,
! [X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( subset @ Y1 @ Y0 )
=> ( ( in @ X1 @ Y1 )
=> ( in @ X1 @ Y0 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f93]) ).
thf(f95,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,[],[f94]) ).
thf(f96,plain,
! [X2: $i,X1: $i] :
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f95]) ).
thf(f97,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( subset @ Y0 @ X2 )
=> ( ( in @ X1 @ Y0 )
=> ( in @ X1 @ X2 ) ) )
@ X3 ) ),
inference(pi_proxy_clausification,[],[f96]) ).
thf(f98,plain,
! [X2: $i,X3: $i,X1: $i] :
( $true
= ( ( subset @ X3 @ X2 )
=> ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) ),
inference(beta-eta_normalization,[],[f97]) ).
thf(f99,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( $true
= ( ( in @ X1 @ X3 )
=> ( in @ X1 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f98]) ).
thf(f100,plain,
! [X2: $i,X3: $i,X1: $i] :
( ( $false
= ( subset @ X3 @ X2 ) )
| ( ( in @ X1 @ X3 )
= $false )
| ( ( in @ X1 @ X2 )
= $true ) ),
inference(imp_proxy_clausification,[],[f99]) ).
thf(f108,plain,
! [X0: $i] :
( ( $true != $true )
| ( $false
= ( subset @ X0 @ sK0 ) )
| ( $false
= ( in @ sK1 @ X0 ) ) ),
inference(constrained_superposition,[],[f35,f100]) ).
thf(f110,plain,
! [X0: $i] :
( ( $false
= ( subset @ X0 @ sK0 ) )
| ( $false
= ( in @ sK1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f108]) ).
thf(f119,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( $false
= ( in @ sK1 @ X0 ) ) ),
inference(constrained_superposition,[],[f47,f110]) ).
thf(f123,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sK0 ) )
| ( $false
= ( in @ sK1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f119]) ).
thf(f160,plain,
( ( $true = $false )
| ( ( in @ sK1 @ sK2 )
= $false ) ),
inference(constrained_superposition,[],[f33,f123]) ).
thf(f168,plain,
( ( in @ sK1 @ sK2 )
= $false ),
inference(trivial_inequality_removal,[],[f160]) ).
thf(f239,plain,
$true = $false,
inference(constrained_superposition,[],[f34,f168]) ).
thf(f244,plain,
$false,
inference(trivial_inequality_removal,[],[f239]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU817^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n009.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 14:34:15 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 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.08/0.27 % (4086254)Will run a generic schedule for satisfiability detection.
% 0.08/0.27 % (4086264)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1693639433:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.27 % (4086260)% WARNING: option uhcvi not known.
% 0.08/0.27 % (4086260)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3174464010:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.27 % (4086261)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2839475467:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.27 % (4086259)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2969846385_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.27 % (4086262)dis+10_1_sil=32000:sp=arity:random_seed=2068099727:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.27 % (4086264) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4086254-4086264"...
% 0.08/0.27 % (4086260)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.27 % (4086263)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3636071721:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.27 % (4086260)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.27 % Exception at run slice level
% 0.08/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.27 % (4086263)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.27 % (4086264)...printing done.
% 0.08/0.27 % (4086264)Refutation found. Thanks to Tanya!
% 0.08/0.27 % SZS status Theorem for theBenchmark
% 0.08/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.27 % (4086264)------------------------------
% 0.08/0.27 % (4086264)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.27 % (4086264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.27 % (4086264)CaDiCaL version: 2.1.3
% 0.08/0.27 % (4086264)Termination reason: Refutation
% 0.08/0.27 % (4086264)Time elapsed: 0.006 s
% 0.08/0.27 % (4086264)Peak memory usage: 12 MB
% 0.08/0.27 % (4086264)Instructions burned: 22 (million)
% 0.08/0.27 % (4086254)Success in time 0.035 s
% 0.08/0.27 % Vampire exiting
%------------------------------------------------------------------------------