%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU637^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 : n003.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:47 AM UTC 2026
% Result : Theorem 15.61s 3.50s
% Output : Refutation 15.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 44
% Number of leaves : 18
% Syntax : Number of formulae : 237 ( 80 unt; 0 typ; 10 def)
% Number of atoms : 2174 ( 633 equ; 0 cnn)
% Maximal formula atoms : 14 ( 9 avg)
% Number of connectives : 2504 ( 61 ~; 294 |; 51 &;1760 @)
% ( 0 <=>; 193 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 101 ( 101 >; 0 *; 0 +; 0 <<)
% Number of symbols : 45 ( 40 usr; 23 con; 0-4 aty)
% ( 138 !!; 7 ??; 0 @@+; 0 @@-)
% Number of variables : 498 ( 215 ^; 268 !; 15 ?; 498 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_2,type,
setadjoin: $i > $i > $i ).
thf(func_def_3,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_4,type,
dsetconstrI: $o ).
thf(func_def_6,type,
dsetconstrEL: $o ).
thf(func_def_7,type,
dsetconstrER: $o ).
thf(func_def_8,type,
setext: $o ).
thf(func_def_9,type,
uniqinunit: $o ).
thf(func_def_10,type,
eqinunit: $o ).
thf(func_def_11,type,
singleton: $i > $o ).
thf(func_def_12,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_13,type,
vIMP: $o > $o > $o ).
thf(func_def_14,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_18,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_19,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_20,type,
vAND: $o > $o > $o ).
thf(func_def_24,type,
sK1: $i > $o ).
thf(func_def_26,type,
sF3: $o ).
thf(func_def_27,type,
sF4: $o ).
thf(func_def_28,type,
sF5: $o ).
thf(func_def_29,type,
sF6: $o ).
thf(func_def_30,type,
sF7: $o ).
thf(func_def_31,type,
sF8: $o ).
thf(func_def_33,type,
sF10: $o ).
thf(func_def_34,type,
sF11: $o ).
thf(func_def_35,type,
sF12: $o ).
thf(func_def_36,type,
vNOT: $o > $o ).
thf(func_def_38,type,
sK14: $i > $o ).
thf(func_def_41,type,
sK17: $i > $o ).
thf(func_def_44,type,
sK20: $i > $o ).
thf(func_def_48,type,
sK24: $i > $i > $i ).
thf(func_def_49,type,
sK25: $i > $i > $i ).
thf(f1,axiom,
( dsetconstrI
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrI) ).
thf(f2,axiom,
( dsetconstrEL
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dsetconstrEL) ).
thf(f3,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(f4,axiom,
( setext
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ X2 @ X0 ) )
=> ( X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setext) ).
thf(f5,axiom,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit) ).
thf(f6,axiom,
( eqinunit
= ( ! [X0: $i,X1: $i] :
( ( X0 = X1 )
=> ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eqinunit) ).
thf(f7,axiom,
( singleton
= ( ^ [X0: $i] :
? [X1: $i] :
( ( X0
= ( setadjoin @ X1 @ emptyset ) )
& ( in @ X1 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton) ).
thf(f8,conjecture,
( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( setext
=> ( uniqinunit
=> ( eqinunit
=> ! [X0: $i,X1: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( X1 @ X2 )
=> ( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) )
=> ( ? [X2: $i] :
( ( X1 @ X2 )
& ( in @ X2 @ X0 ) )
=> ( singleton
@ ( dsetconstr @ X0
@ ^ [X2: $i] : ( X1 @ X2 ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singletonprop) ).
thf(f9,negated_conjecture,
~ ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( setext
=> ( uniqinunit
=> ( eqinunit
=> ! [X0: $i,X1: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( X1 @ X2 )
=> ( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) )
=> ( ? [X2: $i] :
( ( X1 @ X2 )
& ( in @ X2 @ X0 ) )
=> ( singleton
@ ( dsetconstr @ X0
@ ^ [X2: $i] : ( X1 @ X2 ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
thf(f10,plain,
( dsetconstrI
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2 @ X0 )
=> ( ( X1 @ X2 )
=> ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f11,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( dsetconstrEL
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( in @ X2 @ X0 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f13,plain,
( dsetconstrEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f15,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,[],[f14]) ).
thf(f16,plain,
( setext
= ( ! [X0: $i,X1: $i] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ X1 ) )
=> ( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X0 ) )
=> ( X0 = X1 ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f17,plain,
( setext
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f18,plain,
( uniqinunit
= ( ! [X0: $i,X1: $i] :
( ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f19,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(fool_elimination,[],[f18]) ).
thf(f20,plain,
( eqinunit
= ( ! [X0: $i,X1: $i] :
( ( X0 = X1 )
=> ( in @ X0 @ ( setadjoin @ X1 @ emptyset ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f21,plain,
( eqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) ) ) ),
inference(fool_elimination,[],[f20]) ).
thf(f22,plain,
( singleton
= ( ^ [X0: $i] :
? [X1: $i] :
( ( X0
= ( setadjoin @ X1 @ emptyset ) )
& ( in @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f23,plain,
( singleton
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) ) ) ),
inference(fool_elimination,[],[f22]) ).
thf(f24,plain,
~ ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( setext
=> ( uniqinunit
=> ( eqinunit
=> ! [X0: $i,X1: $i > $o] :
( ! [X2: $i] :
( ( in @ X2 @ X0 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ( X1 @ X2 )
=> ( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) )
=> ( ? [X4: $i] :
( ( X1 @ X4 )
& ( in @ X4 @ X0 ) )
=> ( singleton
@ ( dsetconstr @ X0
@ ^ [X5: $i] : ( X1 @ X5 ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f25,plain,
~ ( ( dsetconstrI = $true )
=> ( ( dsetconstrEL = $true )
=> ( ( dsetconstrER = $true )
=> ( ( setext = $true )
=> ( ( uniqinunit = $true )
=> ( ( eqinunit = $true )
=> ! [X0: $i,X1: $i > $o] :
( ! [X2: $i] :
( ( ( in @ X2 @ X0 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( ( ( X1 @ X2 )
= $true )
=> ( ( ( X1 @ X3 )
= $true )
=> ( X2 = X3 ) ) ) ) )
=> ( ? [X4: $i] :
( ( ( X1 @ X4 )
= $true )
& ( ( in @ X4 @ X0 )
= $true ) )
=> ( $true
= ( singleton
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f24]) ).
thf(f26,plain,
( ? [X0: $i,X1: $i > $o] :
( ( $true
!= ( singleton
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
& ? [X4: $i] :
( ( ( X1 @ X4 )
= $true )
& ( ( in @ X4 @ X0 )
= $true ) )
& ! [X2: $i] :
( ! [X3: $i] :
( ( X2 = X3 )
| ( ( X1 @ X3 )
!= $true )
| ( ( X1 @ X2 )
!= $true )
| ( ( in @ X3 @ X0 )
!= $true ) )
| ( ( in @ X2 @ X0 )
!= $true ) ) )
& ( eqinunit = $true )
& ( uniqinunit = $true )
& ( setext = $true )
& ( dsetconstrER = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true ) ),
inference(ennf_transformation,[],[f25]) ).
thf(f27,plain,
( ? [X0: $i,X1: $i > $o] :
( ( $true
!= ( singleton
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
& ? [X4: $i] :
( ( ( X1 @ X4 )
= $true )
& ( ( in @ X4 @ X0 )
= $true ) )
& ! [X2: $i] :
( ! [X3: $i] :
( ( X2 = X3 )
| ( ( X1 @ X3 )
!= $true )
| ( ( X1 @ X2 )
!= $true )
| ( ( in @ X3 @ X0 )
!= $true ) )
| ( ( in @ X2 @ X0 )
!= $true ) ) )
& ( eqinunit = $true )
& ( uniqinunit = $true )
& ( setext = $true )
& ( dsetconstrER = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true ) ),
inference(flattening,[],[f26]) ).
thf(f28,plain,
( ? [X0: $i,X1: $i > $o] :
( ( $true
!= ( singleton
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) ) )
& ? [X2: $i] :
( ( ( X1 @ X2 )
= $true )
& ( ( in @ X2 @ X0 )
= $true ) )
& ! [X3: $i] :
( ! [X4: $i] :
( ( X3 = X4 )
| ( ( X1 @ X4 )
!= $true )
| ( ( X1 @ X3 )
!= $true )
| ( ( in @ X4 @ X0 )
!= $true ) )
| ( ( in @ X3 @ X0 )
!= $true ) ) )
& ( eqinunit = $true )
& ( uniqinunit = $true )
& ( setext = $true )
& ( dsetconstrER = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true ) ),
inference(rectify,[],[f27]) ).
thf(f29,plain,
( ( $true
!= ( singleton
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ) )
& ( $true
= ( sK1 @ sK2 ) )
& ( $true
= ( in @ sK2 @ sK0 ) )
& ! [X3: $i] :
( ! [X4: $i] :
( ( X3 = X4 )
| ( $true
!= ( sK1 @ X4 ) )
| ( $true
!= ( sK1 @ X3 ) )
| ( $true
!= ( in @ X4 @ sK0 ) ) )
| ( $true
!= ( in @ X3 @ sK0 ) ) )
& ( eqinunit = $true )
& ( uniqinunit = $true )
& ( setext = $true )
& ( dsetconstrER = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f28]) ).
thf(f30,plain,
( dsetconstrI
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f31,plain,
( dsetconstrEL
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f32,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,[],[f15]) ).
thf(f33,plain,
( setext
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f34,plain,
( uniqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f35,plain,
( eqinunit
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f36,plain,
( singleton
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f37,plain,
dsetconstrI = $true,
inference(cnf_transformation,[],[f29]) ).
thf(f38,plain,
dsetconstrEL = $true,
inference(cnf_transformation,[],[f29]) ).
thf(f39,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f29]) ).
thf(f40,plain,
setext = $true,
inference(cnf_transformation,[],[f29]) ).
thf(f41,plain,
uniqinunit = $true,
inference(cnf_transformation,[],[f29]) ).
thf(f42,plain,
eqinunit = $true,
inference(cnf_transformation,[],[f29]) ).
thf(f43,plain,
! [X3: $i,X4: $i] :
( ( $true
!= ( in @ X4 @ sK0 ) )
| ( $true
!= ( sK1 @ X4 ) )
| ( $true
!= ( sK1 @ X3 ) )
| ( X3 = X4 )
| ( $true
!= ( in @ X3 @ sK0 ) ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f44,plain,
( $true
= ( in @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f45,plain,
( $true
= ( sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f46,plain,
( $true
!= ( singleton
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f49,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f30,f37]) ).
thf(f50,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f31,f38]) ).
thf(f51,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,[],[f32,f39]) ).
thf(f52,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f33,f40]) ).
thf(f53,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= $true ),
inference(definition_unfolding,[],[f34,f41]) ).
thf(f54,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) ) )
= $true ),
inference(definition_unfolding,[],[f35,f42]) ).
thf(f55,plain,
( $true
!= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) )
@ ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ) ),
inference(definition_unfolding,[],[f46,f36]) ).
thf(f56,definition,
( sF3
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
thf(f57,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) )
= sF3 ),
inference(reorient_equations,[],[f56]) ).
thf(f58,plain,
$true = sF3,
inference(definition_folding,[],[f49,f57]) ).
thf(f59,definition,
( sF4
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
thf(f60,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) )
= sF4 ),
inference(reorient_equations,[],[f59]) ).
thf(f61,plain,
$true = sF4,
inference(definition_folding,[],[f50,f60]) ).
thf(f62,definition,
( sF5
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
thf(f63,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) )
= sF5 ),
inference(reorient_equations,[],[f62]) ).
thf(f64,plain,
$true = sF5,
inference(definition_folding,[],[f51,f63]) ).
thf(f65,definition,
( sF6
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
thf(f66,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) )
= sF6 ),
inference(reorient_equations,[],[f65]) ).
thf(f67,plain,
$true = sF6,
inference(definition_folding,[],[f52,f66]) ).
thf(f68,definition,
( sF7
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
thf(f69,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= sF7 ),
inference(reorient_equations,[],[f68]) ).
thf(f70,plain,
$true = sF7,
inference(definition_folding,[],[f53,f69]) ).
thf(f71,definition,
( sF8
= ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
thf(f72,plain,
( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) ) )
= sF8 ),
inference(reorient_equations,[],[f71]) ).
thf(f73,plain,
$true = sF8,
inference(definition_folding,[],[f54,f72]) ).
thf(f74,definition,
( sF9
= ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK1 @ Y0 ) ) ),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
thf(f75,plain,
( ( dsetconstr @ sK0
@ ^ [Y0: $i] : ( sK1 @ Y0 ) )
= sF9 ),
inference(reorient_equations,[],[f74]) ).
thf(f76,definition,
( sF10
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) )
@ sF9 ) ),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
thf(f77,plain,
( ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) )
@ sF9 )
= sF10 ),
inference(reorient_equations,[],[f76]) ).
thf(f78,plain,
$true != sF10,
inference(definition_folding,[],[f55,f77,f75]) ).
thf(f79,definition,
( sF11
= ( sK1 @ sK2 ) ),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
thf(f80,plain,
( ( sK1 @ sK2 )
= sF11 ),
inference(reorient_equations,[],[f79]) ).
thf(f81,plain,
$true = sF11,
inference(definition_folding,[],[f45,f80]) ).
thf(f82,definition,
( sF12
= ( in @ sK2 @ sK0 ) ),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
thf(f83,plain,
( ( in @ sK2 @ sK0 )
= sF12 ),
inference(reorient_equations,[],[f82]) ).
thf(f84,plain,
$true = sF12,
inference(definition_folding,[],[f44,f83]) ).
thf(f85,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) ) )
= $true )
| ( $false = sF3 ) ),
inference(iff_proxy_clausification,[],[f57]) ).
thf(f97,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0 @ Y2 )
=> ( ( Y1 @ Y0 )
=> ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) ) ) ) ) )
@ X1 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f85]) ).
thf(f98,plain,
! [X1: $i] :
( ( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) ) ) ) ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f97]) ).
thf(f99,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ Y1 )
=> ( ( Y0 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) ) ) ) )
@ X2 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f98]) ).
thf(f100,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) ) ) ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f99]) ).
thf(f101,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ Y0 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) ) ) )
@ X3 ) )
| ( $false = sF3 ) ),
inference(pi_proxy_clausification,[],[f100]) ).
thf(f102,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X1 @ X3 )
=> ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ) )
| ( $false = sF3 ) ),
inference(beta-eta_normalization,[],[f101]) ).
thf(f103,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $false = sF3 )
| ( $true
= ( ( X2 @ X1 )
=> ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ) ),
inference(imp_proxy_clausification,[],[f102]) ).
thf(f104,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ X3 ) )
| ( $false = sF3 )
| ( $false
= ( X2 @ X1 ) )
| ( $true
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ),
inference(imp_proxy_clausification,[],[f103]) ).
thf(f105,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) ) )
= $true )
| ( $false = sF4 ) ),
inference(iff_proxy_clausification,[],[f60]) ).
thf(f115,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( in @ Y0 @ Y2 ) ) ) )
@ X1 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f105]) ).
thf(f116,plain,
! [X1: $i] :
( ( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( in @ X1 @ Y1 ) ) ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f115]) ).
thf(f117,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( in @ X1 @ Y1 ) ) )
@ X2 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f116]) ).
thf(f118,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( in @ X1 @ Y0 ) ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f117]) ).
thf(f119,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( in @ X1 @ Y0 ) )
@ X3 ) )
| ( $false = sF4 ) ),
inference(pi_proxy_clausification,[],[f118]) ).
thf(f120,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( in @ X1 @ X3 ) ) )
| ( $false = sF4 ) ),
inference(beta-eta_normalization,[],[f119]) ).
thf(f121,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $false = sF4 )
| ( $true
= ( in @ X1 @ X3 ) ) ),
inference(imp_proxy_clausification,[],[f120]) ).
thf(f122,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y0
@ ( dsetconstr @ Y2
@ ^ [Y3: $i] : ( Y1 @ Y3 ) ) )
=> ( Y1 @ Y0 ) ) ) ) )
= $true )
| ( $false = sF5 ) ),
inference(iff_proxy_clausification,[],[f63]) ).
thf(f132,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 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f122]) ).
thf(f133,plain,
! [X1: $i] :
( ( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f132]) ).
thf(f134,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( ^ [Y0: $i > $o] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ X1 @ ( dsetconstr @ Y1 @ Y0 ) )
=> ( Y0 @ X1 ) ) )
@ X2 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f133]) ).
thf(f135,plain,
! [X2: $i > $o,X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f134]) ).
thf(f136,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ X1 @ ( dsetconstr @ Y0 @ X2 ) )
=> ( X2 @ X1 ) )
@ X3 ) )
| ( $false = sF5 ) ),
inference(pi_proxy_clausification,[],[f135]) ).
thf(f137,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) )
=> ( X2 @ X1 ) ) )
| ( $false = sF5 ) ),
inference(beta-eta_normalization,[],[f136]) ).
thf(f138,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $false = sF5 )
| ( $true
= ( X2 @ X1 ) ) ),
inference(imp_proxy_clausification,[],[f137]) ).
thf(f139,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) ) )
= $true )
| ( $false = sF6 ) ),
inference(iff_proxy_clausification,[],[f66]) ).
thf(f156,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y1 )
=> ( in @ Y2 @ Y0 ) ) )
=> ( ( !! @ $i
@ ^ [Y2: $i] :
( ( in @ Y2 @ Y0 )
=> ( in @ Y2 @ Y1 ) ) )
=> ( Y1 = Y0 ) ) ) )
@ X1 ) )
| ( $false = sF6 ) ),
inference(pi_proxy_clausification,[],[f139]) ).
thf(f157,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( in @ Y1 @ Y0 ) ) )
=> ( Y0 = X1 ) ) ) ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f156]) ).
thf(f158,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
=> ( in @ Y1 @ X1 ) ) )
=> ( ( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ X1 )
=> ( in @ Y1 @ Y0 ) ) )
=> ( Y0 = X1 ) ) )
@ X2 ) )
| ( $false = sF6 ) ),
inference(pi_proxy_clausification,[],[f157]) ).
thf(f159,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) )
=> ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
=> ( X2 = X1 ) ) ) )
| ( $false = sF6 ) ),
inference(beta-eta_normalization,[],[f158]) ).
thf(f160,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) ) ) )
| ( $false = sF6 )
| ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
=> ( X2 = X1 ) ) ) ),
inference(imp_proxy_clausification,[],[f159]) ).
thf(f161,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK24 @ X1 @ X2 ) ) )
| ( $false = sF6 )
| ( $true
= ( ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) )
=> ( X2 = X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f160]) ).
thf(f162,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK24 @ X1 @ X2 ) ) )
| ( $false = sF6 )
| ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f161]) ).
thf(f163,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK24 @ X1 @ X2 ) ) )
| ( $false = sF6 )
| ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) )
@ ( sK25 @ X1 @ X2 ) ) )
| ( $true
= ( X2 = X1 ) ) ),
inference(sigma_proxy_clausification,[],[f162]) ).
thf(f164,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X2 )
=> ( in @ Y0 @ X1 ) )
@ ( sK24 @ X1 @ X2 ) ) )
| ( $false = sF6 )
| ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ X1 )
=> ( in @ Y0 @ X2 ) )
@ ( sK25 @ X1 @ X2 ) ) )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f163]) ).
thf(f165,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( ( in @ ( sK24 @ X1 @ X2 ) @ X2 )
=> ( in @ ( sK24 @ X1 @ X2 ) @ X1 ) ) )
| ( $false = sF6 )
| ( $false
= ( ( in @ ( sK25 @ X1 @ X2 ) @ X1 )
=> ( in @ ( sK25 @ X1 @ X2 ) @ X2 ) ) )
| ( X1 = X2 ) ),
inference(beta-eta_normalization,[],[f164]) ).
thf(f166,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK24 @ X1 @ X2 ) @ X1 ) )
| ( $false = sF6 )
| ( $false
= ( ( in @ ( sK25 @ X1 @ X2 ) @ X1 )
=> ( in @ ( sK25 @ X1 @ X2 ) @ X2 ) ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f165]) ).
thf(f167,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK24 @ X1 @ X2 ) @ X2 ) )
| ( $false = sF6 )
| ( $false
= ( ( in @ ( sK25 @ X1 @ X2 ) @ X1 )
=> ( in @ ( sK25 @ X1 @ X2 ) @ X2 ) ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f165]) ).
thf(f168,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK24 @ X1 @ X2 ) @ X2 ) )
| ( $false = sF6 )
| ( $false
= ( in @ ( sK25 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f167]) ).
thf(f169,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK24 @ X1 @ X2 ) @ X2 ) )
| ( $false = sF6 )
| ( $true
= ( in @ ( sK25 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f167]) ).
thf(f170,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK24 @ X1 @ X2 ) @ X1 ) )
| ( $false = sF6 )
| ( $false
= ( in @ ( sK25 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f166]) ).
thf(f171,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK24 @ X1 @ X2 ) @ X1 ) )
| ( $false = sF6 )
| ( $true
= ( in @ ( sK25 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(imp_proxy_clausification,[],[f166]) ).
thf(f172,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) ) )
= $true )
| ( $false = sF7 ) ),
inference(iff_proxy_clausification,[],[f69]) ).
thf(f181,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) )
=> ( Y1 = Y0 ) ) )
@ X1 ) )
| ( $false = sF7 ) ),
inference(pi_proxy_clausification,[],[f172]) ).
thf(f182,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) ) ) )
| ( $false = sF7 ) ),
inference(beta-eta_normalization,[],[f181]) ).
thf(f183,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) )
=> ( Y0 = X1 ) )
@ X2 ) )
| ( $false = sF7 ) ),
inference(pi_proxy_clausification,[],[f182]) ).
thf(f184,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) )
=> ( X2 = X1 ) ) )
| ( $false = sF7 ) ),
inference(beta-eta_normalization,[],[f183]) ).
thf(f185,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( $false = sF7 )
| ( $true
= ( X2 = X1 ) ) ),
inference(imp_proxy_clausification,[],[f184]) ).
thf(f186,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( $false = sF7 )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f185]) ).
thf(f187,plain,
( ( ( !! @ $i
@ ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) ) )
= $true )
| ( $false = sF8 ) ),
inference(iff_proxy_clausification,[],[f72]) ).
thf(f196,plain,
! [X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ( Y1 = Y0 )
=> ( in @ Y1 @ ( setadjoin @ Y0 @ emptyset ) ) ) )
@ X1 ) )
| ( $false = sF8 ) ),
inference(pi_proxy_clausification,[],[f187]) ).
thf(f197,plain,
! [X1: $i] :
( ( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( Y0 = X1 )
=> ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) ) ) ) )
| ( $false = sF8 ) ),
inference(beta-eta_normalization,[],[f196]) ).
thf(f198,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ^ [Y0: $i] :
( ( Y0 = X1 )
=> ( in @ Y0 @ ( setadjoin @ X1 @ emptyset ) ) )
@ X2 ) )
| ( $false = sF8 ) ),
inference(pi_proxy_clausification,[],[f197]) ).
thf(f199,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( ( X2 = X1 )
=> ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ) )
| ( $false = sF8 ) ),
inference(beta-eta_normalization,[],[f198]) ).
thf(f200,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( X2 = X1 ) )
| ( $false = sF8 )
| ( $true
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ) ),
inference(imp_proxy_clausification,[],[f199]) ).
thf(f201,plain,
! [X2: $i,X1: $i] :
( ( X1 != X2 )
| ( $false = sF8 )
| ( $true
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ) ),
inference(equality_proxy_clausification,[],[f200]) ).
thf(f202,plain,
( sF9
= ( dsetconstr @ sK0 @ sK1 ) ),
inference(beta-eta_normalization,[],[f75]) ).
thf(f204,plain,
( ( $false
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) )
@ sF9 ) )
| ( $true = sF10 ) ),
inference(iff_proxy_clausification,[],[f77]) ).
thf(f205,plain,
( ( $false
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sF9 )
& ( ( setadjoin @ Y0 @ emptyset )
= sF9 ) ) ) )
| ( $true = sF10 ) ),
inference(beta-eta_normalization,[],[f204]) ).
thf(f206,plain,
! [X1: $i] :
( ( $false
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sF9 )
& ( ( setadjoin @ Y0 @ emptyset )
= sF9 ) )
@ X1 ) )
| ( $true = sF10 ) ),
inference(pi_proxy_clausification,[],[f205]) ).
thf(f207,plain,
! [X1: $i] :
( ( $false
= ( ( in @ X1 @ sF9 )
& ( ( setadjoin @ X1 @ emptyset )
= sF9 ) ) )
| ( $true = sF10 ) ),
inference(beta-eta_normalization,[],[f206]) ).
thf(f208,plain,
! [X1: $i] :
( ( $false
= ( ( setadjoin @ X1 @ emptyset )
= sF9 ) )
| ( $true = sF10 )
| ( $false
= ( in @ X1 @ sF9 ) ) ),
inference(and_proxy_clausification,[],[f207]) ).
thf(f209,plain,
! [X1: $i] :
( ( ( setadjoin @ X1 @ emptyset )
!= sF9 )
| ( $true = sF10 )
| ( $false
= ( in @ X1 @ sF9 ) ) ),
inference(equality_proxy_clausification,[],[f208]) ).
thf(f216,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $false = sF11 ) ),
inference(iff_proxy_clausification,[],[f80]) ).
thf(f218,plain,
( ( $true
= ( in @ sK2 @ sK0 ) )
| ( $false = sF12 ) ),
inference(iff_proxy_clausification,[],[f83]) ).
thf(f220,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X1 @ X3 ) )
| ( $false
= ( X2 @ X1 ) )
| ( $true
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) ) ),
inference(forward_demodulation,[],[f104,f58]) ).
thf(f221,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $false
= ( X2 @ X1 ) )
| ( $false
= ( in @ X1 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f220]) ).
thf(f222,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( in @ X1 @ X3 ) ) ),
inference(forward_demodulation,[],[f121,f61]) ).
thf(f223,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( in @ X1 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f222]) ).
thf(f224,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(forward_demodulation,[],[f138,f64]) ).
thf(f225,plain,
! [X2: $i > $o,X3: $i,X1: $i] :
( ( $false
= ( in @ X1 @ ( dsetconstr @ X3 @ X2 ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f224]) ).
thf(f226,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK24 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( in @ ( sK25 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f169,f67]) ).
thf(f227,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK25 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( in @ ( sK24 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f226]) ).
thf(f228,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK24 @ X1 @ X2 ) @ X2 ) )
| ( $false
= ( in @ ( sK25 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f168,f67]) ).
thf(f229,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK25 @ X1 @ X2 ) @ X2 ) )
| ( $true
= ( in @ ( sK24 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f228]) ).
thf(f230,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK24 @ X1 @ X2 ) @ X1 ) )
| ( $true
= ( in @ ( sK25 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f171,f67]) ).
thf(f231,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ ( sK25 @ X1 @ X2 ) @ X1 ) )
| ( $false
= ( in @ ( sK24 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f230]) ).
thf(f232,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ ( sK24 @ X1 @ X2 ) @ X1 ) )
| ( $false
= ( in @ ( sK25 @ X1 @ X2 ) @ X2 ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f170,f67]) ).
thf(f233,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ ( sK25 @ X1 @ X2 ) @ X2 ) )
| ( $false
= ( in @ ( sK24 @ X1 @ X2 ) @ X1 ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f232]) ).
thf(f234,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 = X2 ) ),
inference(forward_demodulation,[],[f186,f70]) ).
thf(f235,plain,
! [X2: $i,X1: $i] :
( ( $false
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f234]) ).
thf(f236,plain,
! [X2: $i,X1: $i] :
( ( $true = $false )
| ( X1 != X2 )
| ( $true
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ) ),
inference(forward_demodulation,[],[f201,f73]) ).
thf(f237,plain,
! [X2: $i,X1: $i] :
( ( $true
= ( in @ X2 @ ( setadjoin @ X1 @ emptyset ) ) )
| ( X1 != X2 ) ),
inference(trivial_inequality_removal,[],[f236]) ).
thf(f238,plain,
! [X1: $i] :
( ( ( setadjoin @ X1 @ emptyset )
!= sF9 )
| ( $false
= ( in @ X1 @ sF9 ) ) ),
inference(forward_subsumption_resolution,[],[f209,f78]) ).
thf(f239,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK2 ) ) ),
inference(forward_demodulation,[],[f216,f81]) ).
thf(f240,plain,
( $true
= ( sK1 @ sK2 ) ),
inference(trivial_inequality_removal,[],[f239]) ).
thf(f241,plain,
( ( $true = $false )
| ( $true
= ( in @ sK2 @ sK0 ) ) ),
inference(forward_demodulation,[],[f218,f84]) ).
thf(f242,plain,
( $true
= ( in @ sK2 @ sK0 ) ),
inference(trivial_inequality_removal,[],[f241]) ).
thf(f243,plain,
! [X0: $i] :
( ( $true != $true )
| ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK1 @ X0 ) )
| ( sK2 = X0 )
| ( $true
!= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f43,f242]) ).
thf(f244,plain,
! [X0: $i] :
( ( $true
!= ( sK1 @ sK2 ) )
| ( $true
!= ( sK1 @ X0 ) )
| ( sK2 = X0 )
| ( $true
!= ( in @ X0 @ sK0 ) ) ),
inference(trivial_inequality_removal,[],[f243]) ).
thf(f245,plain,
! [X0: $i] :
( ( $true
!= ( in @ X0 @ sK0 ) )
| ( sK2 = X0 )
| ( $true
!= ( sK1 @ X0 ) ) ),
inference(forward_subsumption_resolution,[],[f244,f240]) ).
thf(f273,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sF9 ) )
| ( $true
= ( sK1 @ X0 ) ) ),
inference(constrained_superposition,[],[f225,f202]) ).
thf(f280,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sF9 ) )
| ( $true
= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f223,f202]) ).
thf(f292,plain,
! [X0: $i] :
( ( $true
= ( in @ X0 @ sF9 ) )
| ( $false
= ( sK1 @ X0 ) )
| ( $false
= ( in @ X0 @ sK0 ) ) ),
inference(constrained_superposition,[],[f221,f202]) ).
thf(f367,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $true
= ( in @ ( sK25 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $true
= ( in @ ( sK24 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X2 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(constrained_superposition,[],[f223,f227]) ).
thf(f375,plain,
! [X0: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK25 @ sF9 @ X0 ) @ sK0 ) )
| ( $true
= ( in @ ( sK24 @ sF9 @ X0 ) @ X0 ) )
| ( sF9 = X0 ) ),
inference(constrained_superposition,[],[f280,f227]) ).
thf(f376,plain,
! [X0: $i] :
( ( $true = $false )
| ( $true
= ( sK1 @ ( sK25 @ sF9 @ X0 ) ) )
| ( $true
= ( in @ ( sK24 @ sF9 @ X0 ) @ X0 ) )
| ( sF9 = X0 ) ),
inference(constrained_superposition,[],[f273,f227]) ).
thf(f383,plain,
! [X0: $i] :
( ( $true
= ( in @ ( sK24 @ sF9 @ X0 ) @ X0 ) )
| ( $true
= ( sK1 @ ( sK25 @ sF9 @ X0 ) ) )
| ( sF9 = X0 ) ),
inference(trivial_inequality_removal,[],[f376]) ).
thf(f384,plain,
! [X0: $i] :
( ( $true
= ( in @ ( sK25 @ sF9 @ X0 ) @ sK0 ) )
| ( $true
= ( in @ ( sK24 @ sF9 @ X0 ) @ X0 ) )
| ( sF9 = X0 ) ),
inference(trivial_inequality_removal,[],[f375]) ).
thf(f392,plain,
! [X2: $i,X0: $i,X1: $i > $o] :
( ( $true
= ( in @ ( sK25 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X0 ) )
| ( $true
= ( in @ ( sK24 @ ( dsetconstr @ X0 @ X1 ) @ X2 ) @ X2 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X2 ) ),
inference(trivial_inequality_removal,[],[f367]) ).
thf(f409,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( ( sK25 @ X0 @ ( setadjoin @ X1 @ emptyset ) )
!= X1 )
| ( $true
= ( in @ ( sK24 @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ ( setadjoin @ X1 @ emptyset ) ) )
| ( ( setadjoin @ X1 @ emptyset )
= X0 ) ),
inference(constrained_superposition,[],[f237,f229]) ).
thf(f417,plain,
! [X0: $i,X1: $i] :
( ( ( sK25 @ X0 @ ( setadjoin @ X1 @ emptyset ) )
!= X1 )
| ( $true
= ( in @ ( sK24 @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ ( setadjoin @ X1 @ emptyset ) ) )
| ( ( setadjoin @ X1 @ emptyset )
= X0 ) ),
inference(trivial_inequality_removal,[],[f409]) ).
thf(f469,plain,
! [X0: $i] :
( ( $true = $false )
| ( $true
= ( in @ ( sK25 @ sF9 @ X0 ) @ sK0 ) )
| ( $false
= ( in @ ( sK24 @ sF9 @ X0 ) @ sF9 ) )
| ( sF9 = X0 ) ),
inference(constrained_superposition,[],[f280,f231]) ).
thf(f470,plain,
! [X0: $i] :
( ( $true = $false )
| ( $true
= ( sK1 @ ( sK25 @ sF9 @ X0 ) ) )
| ( $false
= ( in @ ( sK24 @ sF9 @ X0 ) @ sF9 ) )
| ( sF9 = X0 ) ),
inference(constrained_superposition,[],[f273,f231]) ).
thf(f471,plain,
! [X0: $i] :
( ( $false
= ( in @ ( sK24 @ sF9 @ X0 ) @ sF9 ) )
| ( $true
= ( sK1 @ ( sK25 @ sF9 @ X0 ) ) )
| ( sF9 = X0 ) ),
inference(trivial_inequality_removal,[],[f470]) ).
thf(f472,plain,
! [X0: $i] :
( ( $true
= ( in @ ( sK25 @ sF9 @ X0 ) @ sK0 ) )
| ( $false
= ( in @ ( sK24 @ sF9 @ X0 ) @ sF9 ) )
| ( sF9 = X0 ) ),
inference(trivial_inequality_removal,[],[f469]) ).
thf(f503,plain,
! [X0: $i,X1: $i] :
( ( $true = $false )
| ( ( sK25 @ X0 @ ( setadjoin @ X1 @ emptyset ) )
!= X1 )
| ( $false
= ( in @ ( sK24 @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ X0 ) )
| ( ( setadjoin @ X1 @ emptyset )
= X0 ) ),
inference(constrained_superposition,[],[f237,f233]) ).
thf(f515,plain,
! [X0: $i,X1: $i] :
( ( ( sK25 @ X0 @ ( setadjoin @ X1 @ emptyset ) )
!= X1 )
| ( $false
= ( in @ ( sK24 @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ X0 ) )
| ( ( setadjoin @ X1 @ emptyset )
= X0 ) ),
inference(trivial_inequality_removal,[],[f503]) ).
thf(f537,plain,
! [X0: $i] :
( ( $true != $true )
| ( sK2
= ( sK25 @ sF9 @ X0 ) )
| ( $true
!= ( sK1 @ ( sK25 @ sF9 @ X0 ) ) )
| ( $true
= ( in @ ( sK24 @ sF9 @ X0 ) @ X0 ) )
| ( sF9 = X0 ) ),
inference(constrained_superposition,[],[f245,f384]) ).
thf(f546,plain,
! [X0: $i] :
( ( sK2
= ( sK25 @ sF9 @ X0 ) )
| ( $true
!= ( sK1 @ ( sK25 @ sF9 @ X0 ) ) )
| ( $true
= ( in @ ( sK24 @ sF9 @ X0 ) @ X0 ) )
| ( sF9 = X0 ) ),
inference(trivial_inequality_removal,[],[f537]) ).
thf(f566,plain,
! [X0: $i] :
( ( $true
= ( in @ ( sK24 @ sF9 @ X0 ) @ X0 ) )
| ( sK2
= ( sK25 @ sF9 @ X0 ) )
| ( sF9 = X0 ) ),
inference(forward_subsumption_resolution,[],[f546,f383]) ).
thf(f579,plain,
! [X0: $i] :
( ( $true != $true )
| ( sK2
= ( sK25 @ sF9 @ X0 ) )
| ( $true
!= ( sK1 @ ( sK25 @ sF9 @ X0 ) ) )
| ( $false
= ( in @ ( sK24 @ sF9 @ X0 ) @ sF9 ) )
| ( sF9 = X0 ) ),
inference(constrained_superposition,[],[f245,f472]) ).
thf(f582,plain,
! [X0: $i] :
( ( sK2
= ( sK25 @ sF9 @ X0 ) )
| ( $true
!= ( sK1 @ ( sK25 @ sF9 @ X0 ) ) )
| ( $false
= ( in @ ( sK24 @ sF9 @ X0 ) @ sF9 ) )
| ( sF9 = X0 ) ),
inference(trivial_inequality_removal,[],[f579]) ).
thf(f599,plain,
! [X0: $i] :
( ( $false
= ( in @ ( sK24 @ sF9 @ X0 ) @ sF9 ) )
| ( sK2
= ( sK25 @ sF9 @ X0 ) )
| ( sF9 = X0 ) ),
inference(forward_subsumption_resolution,[],[f582,f471]) ).
thf(f689,plain,
! [X0: $i] :
( ( $true = $false )
| ( ( sK24 @ sF9 @ ( setadjoin @ X0 @ emptyset ) )
= X0 )
| ( sK2
= ( sK25 @ sF9 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( sF9
= ( setadjoin @ X0 @ emptyset ) ) ),
inference(constrained_superposition,[],[f235,f566]) ).
thf(f706,plain,
! [X0: $i] :
( ( sK2
= ( sK25 @ sF9 @ ( setadjoin @ X0 @ emptyset ) ) )
| ( ( sK24 @ sF9 @ ( setadjoin @ X0 @ emptyset ) )
= X0 )
| ( sF9
= ( setadjoin @ X0 @ emptyset ) ) ),
inference(trivial_inequality_removal,[],[f689]) ).
thf(f1597,plain,
! [X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $true
= ( in @ ( sK24 @ ( dsetconstr @ X0 @ X1 ) @ X0 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 )
| ( $true
= ( in @ ( sK24 @ ( dsetconstr @ X0 @ X1 ) @ X0 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(constrained_superposition,[],[f229,f392]) ).
thf(f1629,plain,
! [X0: $i,X1: $i > $o] :
( ( $true = $false )
| ( $true
= ( in @ ( sK24 @ ( dsetconstr @ X0 @ X1 ) @ X0 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(duplicate_literal_removal,[],[f1597]) ).
thf(f1630,plain,
! [X0: $i,X1: $i > $o] :
( ( $true
= ( in @ ( sK24 @ ( dsetconstr @ X0 @ X1 ) @ X0 ) @ X0 ) )
| ( ( dsetconstr @ X0 @ X1 )
= X0 ) ),
inference(trivial_inequality_removal,[],[f1629]) ).
thf(f2185,plain,
! [X0: $i > $o] :
( ( $true = $false )
| ( $true
= ( in @ ( sK24 @ ( dsetconstr @ sF9 @ X0 ) @ sF9 ) @ sK0 ) )
| ( sF9
= ( dsetconstr @ sF9 @ X0 ) ) ),
inference(constrained_superposition,[],[f280,f1630]) ).
thf(f2186,plain,
! [X0: $i > $o] :
( ( $true = $false )
| ( $true
= ( sK1 @ ( sK24 @ ( dsetconstr @ sF9 @ X0 ) @ sF9 ) ) )
| ( sF9
= ( dsetconstr @ sF9 @ X0 ) ) ),
inference(constrained_superposition,[],[f273,f1630]) ).
thf(f2193,plain,
! [X0: $i > $o] :
( ( $true
= ( sK1 @ ( sK24 @ ( dsetconstr @ sF9 @ X0 ) @ sF9 ) ) )
| ( sF9
= ( dsetconstr @ sF9 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f2186]) ).
thf(f2194,plain,
! [X0: $i > $o] :
( ( $true
= ( in @ ( sK24 @ ( dsetconstr @ sF9 @ X0 ) @ sF9 ) @ sK0 ) )
| ( sF9
= ( dsetconstr @ sF9 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f2185]) ).
thf(f2667,plain,
! [X0: $i > $o] :
( ( $true != $true )
| ( sK2
= ( sK24 @ ( dsetconstr @ sF9 @ X0 ) @ sF9 ) )
| ( $true
!= ( sK1 @ ( sK24 @ ( dsetconstr @ sF9 @ X0 ) @ sF9 ) ) )
| ( sF9
= ( dsetconstr @ sF9 @ X0 ) ) ),
inference(constrained_superposition,[],[f245,f2194]) ).
thf(f2684,plain,
! [X0: $i > $o] :
( ( sK2
= ( sK24 @ ( dsetconstr @ sF9 @ X0 ) @ sF9 ) )
| ( $true
!= ( sK1 @ ( sK24 @ ( dsetconstr @ sF9 @ X0 ) @ sF9 ) ) )
| ( sF9
= ( dsetconstr @ sF9 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f2667]) ).
thf(f2695,plain,
! [X0: $i > $o] :
( ( sK2
= ( sK24 @ ( dsetconstr @ sF9 @ X0 ) @ sF9 ) )
| ( sF9
= ( dsetconstr @ sF9 @ X0 ) ) ),
inference(forward_subsumption_resolution,[],[f2684,f2193]) ).
thf(f2735,plain,
! [X0: $i > $o] :
( ( $true
= ( in @ sK2 @ sF9 ) )
| ( sF9
= ( dsetconstr @ sF9 @ X0 ) )
| ( sF9
= ( dsetconstr @ sF9 @ X0 ) ) ),
inference(constrained_superposition,[],[f1630,f2695]) ).
thf(f2740,plain,
! [X0: $i > $o] :
( ( sF9
= ( dsetconstr @ sF9 @ X0 ) )
| ( $true
= ( in @ sK2 @ sF9 ) ) ),
inference(duplicate_literal_removal,[],[f2735]) ).
thf(f2772,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( in @ X0 @ sF9 ) )
| ( $true
= ( X1 @ X0 ) )
| ( $true
= ( in @ sK2 @ sF9 ) ) ),
inference(constrained_superposition,[],[f225,f2740]) ).
thf(f2839,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sF9 ) )
| ( $true
= ( ^ [Y0: $i] : $false
@ X0 ) )
| ( $true
= ( in @ sK2 @ sF9 ) ) ),
inference(primitive_instantiation,[],[f2772]) ).
thf(f3310,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sF9 ) )
| ( $true = $false )
| ( $true
= ( in @ sK2 @ sF9 ) ) ),
inference(beta-eta_normalization,[],[f2839]) ).
thf(f3311,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sF9 ) )
| ( $true
= ( in @ sK2 @ sF9 ) ) ),
inference(trivial_inequality_removal,[],[f3310]) ).
thf(f3378,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( sK1 @ X0 ) )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( $true
= ( in @ sK2 @ sF9 ) ) ),
inference(constrained_superposition,[],[f292,f3311]) ).
thf(f3406,plain,
! [X0: $i] :
( ( $true
= ( in @ sK2 @ sF9 ) )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( $false
= ( sK1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f3378]) ).
thf(f15974,plain,
! [X0: $i] :
( ( sK2 != X0 )
| ( $true
= ( in @ ( sK24 @ sF9 @ ( setadjoin @ X0 @ emptyset ) ) @ ( setadjoin @ X0 @ emptyset ) ) )
| ( sF9
= ( setadjoin @ X0 @ emptyset ) )
| ( ( sK24 @ sF9 @ ( setadjoin @ X0 @ emptyset ) )
= X0 )
| ( sF9
= ( setadjoin @ X0 @ emptyset ) ) ),
inference(constrained_superposition,[],[f417,f706]) ).
thf(f16004,plain,
! [X0: $i] :
( ( sK2 != X0 )
| ( $true
= ( in @ ( sK24 @ sF9 @ ( setadjoin @ X0 @ emptyset ) ) @ ( setadjoin @ X0 @ emptyset ) ) )
| ( sF9
= ( setadjoin @ X0 @ emptyset ) )
| ( ( sK24 @ sF9 @ ( setadjoin @ X0 @ emptyset ) )
= X0 ) ),
inference(duplicate_literal_removal,[],[f15974]) ).
thf(f16012,plain,
! [X0: $i] :
( ( sK2 != X0 )
| ( $true
= ( in @ ( sK24 @ sF9 @ ( setadjoin @ X0 @ emptyset ) ) @ ( setadjoin @ X0 @ emptyset ) ) )
| ( sF9
= ( setadjoin @ X0 @ emptyset ) ) ),
inference(forward_subsumption_resolution,[],[f16004,f237]) ).
thf(f17421,plain,
( ( $true
= ( in @ ( sK24 @ sF9 @ ( setadjoin @ sK2 @ emptyset ) ) @ ( setadjoin @ sK2 @ emptyset ) ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) ) ),
inference(equality_resolution,[],[f16012]) ).
thf(f17645,plain,
( ( $true = $false )
| ( sK2
= ( sK24 @ sF9 @ ( setadjoin @ sK2 @ emptyset ) ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) ) ),
inference(constrained_superposition,[],[f235,f17421]) ).
thf(f17662,plain,
( ( sK2
= ( sK24 @ sF9 @ ( setadjoin @ sK2 @ emptyset ) ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) ) ),
inference(trivial_inequality_removal,[],[f17645]) ).
thf(f17944,plain,
( ( $false
= ( in @ sK2 @ sF9 ) )
| ( sK2
= ( sK25 @ sF9 @ ( setadjoin @ sK2 @ emptyset ) ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) ) ),
inference(constrained_superposition,[],[f599,f17662]) ).
thf(f17968,plain,
( ( $false
= ( in @ sK2 @ sF9 ) )
| ( sK2
= ( sK25 @ sF9 @ ( setadjoin @ sK2 @ emptyset ) ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) ) ),
inference(duplicate_literal_removal,[],[f17944]) ).
thf(f17982,plain,
( ( sK2
= ( sK25 @ sF9 @ ( setadjoin @ sK2 @ emptyset ) ) )
| ( $false
= ( in @ sK2 @ sF9 ) ) ),
inference(forward_subsumption_resolution,[],[f17968,f238]) ).
thf(f19218,plain,
( ( sK2 != sK2 )
| ( $false
= ( in @ ( sK24 @ sF9 @ ( setadjoin @ sK2 @ emptyset ) ) @ sF9 ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) )
| ( $false
= ( in @ sK2 @ sF9 ) ) ),
inference(constrained_superposition,[],[f515,f17982]) ).
thf(f19239,plain,
( ( $false
= ( in @ ( sK24 @ sF9 @ ( setadjoin @ sK2 @ emptyset ) ) @ sF9 ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) )
| ( $false
= ( in @ sK2 @ sF9 ) ) ),
inference(trivial_inequality_removal,[],[f19218]) ).
thf(f19244,plain,
( ( $false
= ( in @ ( sK24 @ sF9 @ ( setadjoin @ sK2 @ emptyset ) ) @ sF9 ) )
| ( $false
= ( in @ sK2 @ sF9 ) ) ),
inference(forward_subsumption_resolution,[],[f19239,f238]) ).
thf(f20006,plain,
( ( $false
= ( in @ sK2 @ sF9 ) )
| ( $false
= ( in @ sK2 @ sF9 ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) ) ),
inference(constrained_superposition,[],[f19244,f17662]) ).
thf(f20103,plain,
( ( $false
= ( in @ sK2 @ sF9 ) )
| ( sF9
= ( setadjoin @ sK2 @ emptyset ) ) ),
inference(duplicate_literal_removal,[],[f20006]) ).
thf(f20105,plain,
( $false
= ( in @ sK2 @ sF9 ) ),
inference(forward_subsumption_resolution,[],[f20103,f238]) ).
thf(f20211,plain,
! [X0: $i] :
( ( $true = $false )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( $false
= ( sK1 @ X0 ) ) ),
inference(constrained_superposition,[],[f3406,f20105]) ).
thf(f20257,plain,
! [X0: $i] :
( ( $false
= ( in @ X0 @ sK0 ) )
| ( $false
= ( sK1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f20211]) ).
thf(f21890,plain,
( ( $true = $false )
| ( ( sK1 @ sK2 )
= $false ) ),
inference(constrained_superposition,[],[f242,f20257]) ).
thf(f21963,plain,
( ( sK1 @ sK2 )
= $false ),
inference(trivial_inequality_removal,[],[f21890]) ).
thf(f22173,plain,
$true = $false,
inference(constrained_superposition,[],[f240,f21963]) ).
thf(f22228,plain,
$false,
inference(trivial_inequality_removal,[],[f22173]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU637^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.07/0.19 % Computer : n003.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 14:02:59 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 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
% 6.20/1.16 % (2553375)Will run a generic schedule for satisfiability detection.
% 6.20/1.16 % (2553386)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=582911835:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.20/1.16 % (2553381)% WARNING: option uhcvi not known.
% 6.20/1.16 % (2553380)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1250637108_2999 on theBenchmark for (2999ds/0Mi)
% 6.20/1.16 % (2553381)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=258613800:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.20/1.16 % (2553381)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.20/1.16 % Exception at run slice level
% 6.20/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.20/1.16 % (2553381)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.20/1.16 % (2553382)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3964551595:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.20/1.16 % (2553383)dis+10_1_sil=32000:sp=arity:random_seed=279704303:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.20/1.16 % (2553384)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1194739854:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.20/1.16 % (2553385)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1044079992:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.20/1.16 % (2553384)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.20/1.16 % (2553390)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2010141870:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.20/1.16 % Exception at run slice level
% 6.20/1.16 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.20/1.16 % (2553386)Instruction limit reached!
% 6.20/1.16 % (2553386)------------------------------
% 6.20/1.16 % (2553386)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.20/1.16 % (2553386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.20/1.16 % (2553386)CaDiCaL version: 2.1.3
% 6.20/1.16 % (2553386)Termination reason: Instruction limit
% 6.20/1.16 % (2553386)Termination phase: Saturation
% 6.20/1.16 % (2553386)Time elapsed: 0.045 s
% 6.20/1.16 % (2553386)Peak memory usage: 13 MB
% 6.20/1.16 % (2553386)Instructions burned: 163 (million)
% 6.20/1.16 % (2553396)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4190636188:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.20/1.16 % (2553397)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=35114734:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 6.20/1.16 % (2553397)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.20/1.16 % (2553397)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.20/1.16 % (2553383)Instruction limit reached!
% 6.20/1.16 % (2553383)------------------------------
% 6.20/1.16 % (2553383)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.20/1.16 % (2553383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.20/1.16 % (2553383)CaDiCaL version: 2.1.3
% 6.20/1.16 % (2553383)Termination reason: Instruction limit
% 6.20/1.16 % (2553383)Termination phase: Saturation
% 6.20/1.16 % (2553383)Time elapsed: 0.095 s
% 6.20/1.16 % (2553383)Peak memory usage: 12 MB
% 6.20/1.16 % (2553383)Instructions burned: 103 (million)
% 6.20/1.16 % (2553384)Instruction limit reached!
% 6.20/1.16 % (2553384)------------------------------
% 6.20/1.16 % (2553384)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.20/1.16 % (2553384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.20/1.16 % (2553384)CaDiCaL version: 2.1.3
% 6.20/1.16 % (2553384)Termination reason: Instruction limit
% 6.20/1.16 % (2553384)Termination phase: Saturation
% 6.20/1.16 % (2553384)Time elapsed: 0.099 s
% 6.20/1.16 % (2553384)Peak memory usage: 12 MB
% 6.20/1.16 % (2553384)Instructions burned: 116 (million)
% 6.20/1.16 % (2553396)Instruction limit reached!
% 6.20/1.16 % (2553396)------------------------------
% 6.20/1.16 % (2553396)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.96/3.05 % (2553396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.96/3.05 % (2553396)CaDiCaL version: 2.1.3
% 17.96/3.05 % (2553396)Termination reason: Instruction limit
% 17.96/3.05 % (2553396)Termination phase: Saturation
% 17.96/3.05 % (2553396)Time elapsed: 0.068 s
% 17.96/3.05 % (2553396)Peak memory usage: 12 MB
% 17.96/3.05 % (2553396)Instructions burned: 132 (million)
% 17.96/3.05 % (2553385)Instruction limit reached!
% 17.96/3.05 % (2553385)------------------------------
% 17.96/3.05 % (2553385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.96/3.05 % (2553385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.96/3.05 % (2553385)CaDiCaL version: 2.1.3
% 17.96/3.05 % (2553385)Termination reason: Instruction limit
% 17.96/3.05 % (2553385)Termination phase: Saturation
% 17.96/3.05 % (2553385)Time elapsed: 0.114 s
% 17.96/3.05 % (2553385)Peak memory usage: 12 MB
% 17.96/3.05 % (2553385)Instructions burned: 131 (million)
% 17.96/3.05 % (2553402)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3327890567:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 17.96/3.05 % Exception at run slice level
% 17.96/3.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.96/3.05 % (2553400)ott-21_1_sil=16000:fs=off:random_seed=1253156686:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 17.96/3.05 % (2553401)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3144741183:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 17.96/3.05 % (2553405)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=970691078:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 17.96/3.05 % Exception at run slice level
% 17.96/3.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.96/3.05 % (2553403)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3344909639:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 17.96/3.05 % (2553409)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3829734669:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 17.96/3.05 % (2553409)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 17.96/3.05 % (2553397)Instruction limit reached!
% 17.96/3.05 % (2553397)------------------------------
% 17.96/3.05 % (2553397)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.96/3.05 % (2553397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.96/3.05 % (2553397)CaDiCaL version: 2.1.3
% 17.96/3.05 % (2553397)Termination reason: Instruction limit
% 17.96/3.05 % (2553397)Termination phase: Saturation
% 17.96/3.05 % (2553397)Time elapsed: 0.173 s
% 17.96/3.05 % (2553397)Peak memory usage: 14 MB
% 17.96/3.05 % (2553397)Instructions burned: 686 (million)
% 17.96/3.05 % (2553412)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3616051138:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 17.96/3.05 % (2553412)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 17.96/3.05 % (2553400)Instruction limit reached!
% 17.96/3.05 % (2553400)------------------------------
% 17.96/3.05 % (2553400)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.96/3.05 % (2553400)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.96/3.05 % (2553400)CaDiCaL version: 2.1.3
% 17.96/3.05 % (2553400)Termination reason: Instruction limit
% 17.96/3.05 % (2553400)Termination phase: Saturation
% 17.96/3.05 % (2553400)Time elapsed: 0.115 s
% 17.96/3.05 % (2553400)Peak memory usage: 12 MB
% 17.96/3.05 % (2553400)Instructions burned: 181 (million)
% 17.96/3.05 % (2553414)fmb+10_1_sil=64000:random_seed=3222280397:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 17.96/3.05 % (2553414)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 17.96/3.05 % Exception at run slice level
% 17.96/3.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.96/3.05 % (2553416)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2073707529:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 17.96/3.05 % Exception at run slice level
% 17.96/3.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.61/3.50 % (2553418)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=151954951:fmbsr=1.7:i=920_2996 on theBenchmark for (2996ds/920Mi)
% 15.61/3.50 % Exception at run slice level
% 15.61/3.50 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.61/3.50 % (2553420)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=4005313464:i=5131_2996 on theBenchmark for (2996ds/5131Mi)
% 15.61/3.50 % (2553420)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.61/3.50 % (2553412)Instruction limit reached!
% 15.61/3.50 % (2553412)------------------------------
% 15.61/3.50 % (2553412)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553412)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553412)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553412)Termination reason: Instruction limit
% 15.61/3.50 % (2553412)Termination phase: Saturation
% 15.61/3.50 % (2553412)Time elapsed: 0.233 s
% 15.61/3.50 % (2553412)Peak memory usage: 15 MB
% 15.61/3.50 % (2553412)Instructions burned: 884 (million)
% 15.61/3.50 % (2553424)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=877897897:i=1472:ins=7:fdi=8:gsp=on_2994 on theBenchmark for (2994ds/1472Mi)
% 15.61/3.50 % (2553424)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 15.61/3.50 % (2553424)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.61/3.50 % (2553409)Instruction limit reached!
% 15.61/3.50 % (2553409)------------------------------
% 15.61/3.50 % (2553409)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553409)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553409)Termination reason: Instruction limit
% 15.61/3.50 % (2553409)Termination phase: Saturation
% 15.61/3.50 % (2553409)Time elapsed: 0.344 s
% 15.61/3.50 % (2553409)Peak memory usage: 15 MB
% 15.61/3.50 % (2553409)Instructions burned: 693 (million)
% 15.61/3.50 % (2553426)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3489720219:i=6324_2994 on theBenchmark for (2994ds/6324Mi)
% 15.61/3.50 % Exception at run slice level
% 15.61/3.50 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.61/3.50 % (2553428)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=879668194:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 15.61/3.50 % Exception at run slice level
% 15.61/3.50 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.61/3.50 % (2553401)Instruction limit reached!
% 15.61/3.50 % (2553401)------------------------------
% 15.61/3.50 % (2553401)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553401)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553401)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553401)Termination reason: Instruction limit
% 15.61/3.50 % (2553401)Termination phase: Saturation
% 15.61/3.50 % (2553401)Time elapsed: 0.432 s
% 15.61/3.50 % (2553401)Peak memory usage: 13 MB
% 15.61/3.50 % (2553401)Instructions burned: 477 (million)
% 15.61/3.50 % (2553430)ott-2_1_sil=16000:newcnf=on:random_seed=3485752612:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2993 on theBenchmark for (2993ds/869Mi)
% 15.61/3.50 % (2553430)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.61/3.50 % (2553431)ott+10_1_sil=32000:tgt=ground:random_seed=1360298450:i=5114:av=off_2993 on theBenchmark for (2993ds/5114Mi)
% 15.61/3.50 % (2553403)Instruction limit reached!
% 15.61/3.50 % (2553403)------------------------------
% 15.61/3.50 % (2553403)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553403)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553403)Termination reason: Instruction limit
% 15.61/3.50 % (2553403)Termination phase: Saturation
% 15.61/3.50 % (2553403)Time elapsed: 0.695 s
% 15.61/3.50 % (2553403)Peak memory usage: 15 MB
% 15.61/3.50 % (2553403)Instructions burned: 1179 (million)
% 15.61/3.50 % (2553434)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=571282445:i=54282_2990 on theBenchmark for (2990ds/54282Mi)
% 15.61/3.50 % Exception at run slice level
% 15.61/3.50 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.61/3.50 % (2553436)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=476839028:i=3512:aac=none_2990 on theBenchmark for (2990ds/3512Mi)
% 15.61/3.50 % (2553436)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.61/3.50 % (2553424)Instruction limit reached!
% 15.61/3.50 % (2553424)------------------------------
% 15.61/3.50 % (2553424)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553424)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553424)Termination reason: Instruction limit
% 15.61/3.50 % (2553424)Termination phase: Saturation
% 15.61/3.50 % (2553424)Time elapsed: 0.447 s
% 15.61/3.50 % (2553424)Peak memory usage: 18 MB
% 15.61/3.50 % (2553424)Instructions burned: 1475 (million)
% 15.61/3.50 % (2553438)dis+21_1_sil=32000:sas=cadical:random_seed=1849606391:i=3773:amm=off_2990 on theBenchmark for (2990ds/3773Mi)
% 15.61/3.50 % (2553430)Instruction limit reached!
% 15.61/3.50 % (2553430)------------------------------
% 15.61/3.50 % (2553430)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553430)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553430)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553430)Termination reason: Instruction limit
% 15.61/3.50 % (2553430)Termination phase: Saturation
% 15.61/3.50 % (2553430)Time elapsed: 0.745 s
% 15.61/3.50 % (2553430)Peak memory usage: 15 MB
% 15.61/3.50 % (2553430)Instructions burned: 869 (million)
% 15.61/3.50 % (2553440)ott+11_1_sil=16000:gs=on:random_seed=2935613127:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2986 on theBenchmark for (2986ds/2251Mi)
% 15.61/3.50 % (2553440)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.61/3.50 % (2553438)Instruction limit reached!
% 15.61/3.50 % (2553438)------------------------------
% 15.61/3.50 % (2553438)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553438)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553438)Termination reason: Instruction limit
% 15.61/3.50 % (2553438)Termination phase: Saturation
% 15.61/3.50 % (2553438)Time elapsed: 0.957 s
% 15.61/3.50 % (2553438)Peak memory usage: 21 MB
% 15.61/3.50 % (2553438)Instructions burned: 3777 (million)
% 15.61/3.50 % (2553442)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=3034981531:fmbsr=1.6:i=67534_2980 on theBenchmark for (2980ds/67534Mi)
% 15.61/3.50 % Exception at run slice level
% 15.61/3.50 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.61/3.50 % (2553444)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=3625448491:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2980 on theBenchmark for (2980ds/4591Mi)
% 15.61/3.50 % (2553436)Instruction limit reached!
% 15.61/3.50 % (2553436)------------------------------
% 15.61/3.50 % (2553436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553436)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553436)Termination reason: Instruction limit
% 15.61/3.50 % (2553436)Termination phase: Saturation
% 15.61/3.50 % (2553436)Time elapsed: 1.742 s
% 15.61/3.50 % (2553436)Peak memory usage: 20 MB
% 15.61/3.50 % (2553436)Instructions burned: 3513 (million)
% 15.61/3.50 % (2553448)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=694275999:i=29340_2973 on theBenchmark for (2973ds/29340Mi)
% 15.61/3.50 % (2553440)Instruction limit reached!
% 15.61/3.50 % (2553440)------------------------------
% 15.61/3.50 % (2553440)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553440)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553440)Termination reason: Instruction limit
% 15.61/3.50 % (2553440)Termination phase: Saturation
% 15.61/3.50 % (2553440)Time elapsed: 1.400 s
% 15.61/3.50 % (2553440)Peak memory usage: 18 MB
% 15.61/3.50 % (2553440)Instructions burned: 2252 (million)
% 15.61/3.50 % (2553450)dis-10_1_sil=64000:sas=cadical:cn=on:random_seed=2842463523:i=5211_2972 on theBenchmark for (2972ds/5211Mi)
% 15.61/3.50 % (2553420)Instruction limit reached!
% 15.61/3.50 % (2553420)------------------------------
% 15.61/3.50 % (2553420)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.50 % (2553420)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.50 % (2553420)CaDiCaL version: 2.1.3
% 15.61/3.50 % (2553420)Termination reason: Instruction limit
% 15.61/3.50 % (2553420)Termination phase: Saturation
% 15.61/3.50 % (2553420)Time elapsed: 2.568 s
% 15.61/3.50 % (2553420)Peak memory usage: 21 MB
% 15.61/3.50 % (2553420)Instructions burned: 5134 (million)
% 15.61/3.50 % (2553452)fmb+10_1_sil=32000:sas=cadical:bce=on:fmbss=17:random_seed=797309475:i=5497:nm=2_2970 on theBenchmark for (2970ds/5497Mi)
% 15.61/3.50 % Exception at run slice level
% 15.61/3.50 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.61/3.50 % (2553454)fmb+10_1_fmbas=predicate:sil=64000:tgt=full:sas=cadical:fmbss=15:random_seed=4209654857:fmbsr=2:i=46332_2969 on theBenchmark for (2969ds/46332Mi)
% 15.61/3.50 % Exception at run slice level
% 15.61/3.50 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.61/3.50 % (2553456)fmb+10_1_sil=128000:tgt=full:sas=cadical:fmbss=12:random_seed=326470411:i=14071_2969 on theBenchmark for (2969ds/14071Mi)
% 15.61/3.50 % Exception at run slice level
% 15.61/3.50 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.61/3.50 % (2553458)dis+10_161_sil=128000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=283602868:i=22565:add=on:rawr=on_2969 on theBenchmark for (2969ds/22565Mi)
% 15.61/3.50 % (2553431) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2553375-2553431"...
% 15.61/3.50 % (2553431)...printing done.
% 15.61/3.50 % (2553431)Refutation found. Thanks to Tanya!
% 15.61/3.50 % SZS status Theorem for theBenchmark
% 15.61/3.50 % SZS output start Proof for theBenchmark
% See solution above
% 15.61/3.51 % (2553431)------------------------------
% 15.61/3.51 % (2553431)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.61/3.51 % (2553431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.61/3.51 % (2553431)CaDiCaL version: 2.1.3
% 15.61/3.51 % (2553431)Termination reason: Refutation
% 15.61/3.51 % (2553431)Time elapsed: 2.603 s
% 15.61/3.51 % (2553431)Peak memory usage: 21 MB
% 15.61/3.51 % (2553431)Instructions burned: 3671 (million)
% 15.61/3.51 % (2553375)Success in time 3.27 s
% 15.61/3.51 % Vampire exiting
%------------------------------------------------------------------------------