%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU672^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 : n020.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:56 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 5
% Syntax : Number of formulae : 53 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 472 ( 96 equ; 0 cnn)
% Maximal formula atoms : 4 ( 8 avg)
% Number of connectives : 682 ( 15 ~; 21 |; 29 &; 581 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 37 ( 32 usr; 9 con; 0-4 aty)
% ( 6 !!; 12 ??; 0 @@+; 0 @@-)
% Number of variables : 171 ( 130 ^; 35 !; 6 ?; 171 :)
% 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,
subset: $i > $i > $o ).
thf(func_def_5,type,
kpair: $i > $i > $i ).
thf(func_def_6,type,
cartprod: $i > $i > $i ).
thf(func_def_7,type,
singleton: $i > $o ).
thf(func_def_9,type,
ex1: $i > ( $i > $o ) > $o ).
thf(func_def_10,type,
breln: $i > $i > $i > $o ).
thf(func_def_11,type,
func: $i > $i > $i > $o ).
thf(func_def_12,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_13,type,
vAND: $o > $o > $o ).
thf(func_def_14,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_17,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_18,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_20,type,
vIMP: $o > $o > $o ).
thf(func_def_21,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_28,type,
vNOT: $o > $o ).
thf(func_def_29,type,
sK4: $i > $i ).
thf(func_def_31,type,
sK6: $i > $i ).
thf(func_def_32,type,
sK7: $i > $i ).
thf(func_def_33,type,
sK8: $i > $i ).
thf(func_def_34,type,
sK9: $i > $i ).
thf(f1,axiom,
( singleton
= ( ^ [X0: $i] :
? [X1: $i] :
( ( X0
= ( setadjoin @ X1 @ emptyset ) )
& ( in @ X1 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton) ).
thf(f2,axiom,
( ex1
= ( ^ [X0: $i,X1: $i > $o] :
( singleton
@ ( dsetconstr @ X0
@ ^ [X2: $i] : ( X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ex1) ).
thf(f3,axiom,
( breln
= ( ^ [X0: $i,X1: $i,X2: $i] : ( subset @ X2 @ ( cartprod @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln) ).
thf(f4,axiom,
( func
= ( ^ [X0: $i,X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ex1 @ X1
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) )
& ( breln @ X0 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',func) ).
thf(f5,conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ( func @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( singleton
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',funcImageSingleton) ).
thf(f6,negated_conjecture,
~ ! [X0: $i,X1: $i,X2: $i] :
( ( func @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( singleton
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( singleton
= ( ^ [X0: $i] :
? [X1: $i] :
( ( X0
= ( setadjoin @ X1 @ emptyset ) )
& ( in @ X1 @ X0 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f8,plain,
( singleton
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( ex1
= ( ^ [X0: $i,X1: $i > $o] :
( singleton
@ ( dsetconstr @ X0
@ ^ [X2: $i] : ( X1 @ X2 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f10,plain,
( ex1
= ( ^ [Y0: $i,Y1: $i > $o] :
( singleton
@ ( dsetconstr @ Y0
@ ^ [Y2: $i] : ( Y1 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f12,plain,
( func
= ( ^ [X0: $i,X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( ex1 @ X1
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) )
& ( breln @ X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f13,plain,
( func
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( breln @ Y0 @ Y1 @ Y2 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ex1 @ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
~ ! [X0: $i,X1: $i,X2: $i] :
( ( func @ X0 @ X1 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ( singleton
@ ( dsetconstr @ X1
@ ^ [X4: $i] : ( in @ ( kpair @ X3 @ X4 ) @ X2 ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f15,plain,
~ ! [X0: $i,X1: $i,X2: $i] :
( ( ( func @ X0 @ X1 @ X2 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ( $true
= ( singleton
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( in @ ( kpair @ X3 @ Y0 ) @ X2 ) ) ) ) ) ),
inference(fool_elimination,[],[f14]) ).
thf(f16,plain,
? [X0: $i,X1: $i,X2: $i] :
( ? [X3: $i] :
( ( $true
!= ( singleton
@ ( dsetconstr @ X1
@ ^ [Y0: $i] : ( in @ ( kpair @ X3 @ Y0 ) @ X2 ) ) ) )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( func @ X0 @ X1 @ X2 )
= $true ) ),
inference(ennf_transformation,[],[f15]) ).
thf(f17,plain,
( ( $true
!= ( singleton
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) ) )
& ( $true
= ( in @ sK3 @ sK0 ) )
& ( $true
= ( func @ sK0 @ sK1 @ sK2 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f16]) ).
thf(f18,plain,
( singleton
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f19,plain,
( ex1
= ( ^ [Y0: $i,Y1: $i > $o] :
( singleton
@ ( dsetconstr @ Y0
@ ^ [Y2: $i] : ( Y1 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f20,plain,
( breln
= ( ^ [Y0: $i,Y1: $i,Y2: $i] : ( subset @ Y2 @ ( cartprod @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f21,plain,
( func
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( breln @ Y0 @ Y1 @ Y2 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ex1 @ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f22,plain,
( $true
= ( func @ sK0 @ sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f23,plain,
( $true
= ( in @ sK3 @ sK0 ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f24,plain,
( $true
!= ( singleton
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f27,plain,
( ex1
= ( ^ [Y0: $i,Y1: $i > $o] :
( ^ [Y2: $i] :
( ?? @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y2 )
& ( ( setadjoin @ Y3 @ emptyset )
= Y2 ) ) )
@ ( dsetconstr @ Y0
@ ^ [Y2: $i] : ( Y1 @ Y2 ) ) ) ) ),
inference(definition_unfolding,[],[f19,f18]) ).
thf(f28,plain,
( func
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( ^ [Y3: $i,Y4: $i,Y5: $i] : ( subset @ Y5 @ ( cartprod @ Y3 @ Y4 ) )
@ Y0
@ Y1
@ Y2 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ^ [Y4: $i,Y5: $i > $o] :
( ^ [Y6: $i] :
( ?? @ $i
@ ^ [Y7: $i] :
( ( in @ Y7 @ Y6 )
& ( ( setadjoin @ Y7 @ emptyset )
= Y6 ) ) )
@ ( dsetconstr @ Y4
@ ^ [Y6: $i] : ( Y5 @ Y6 ) ) )
@ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f21,f20,f27]) ).
thf(f29,plain,
( $true
!= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1 @ Y0 )
& ( ( setadjoin @ Y1 @ emptyset )
= Y0 ) ) )
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) ) ),
inference(definition_unfolding,[],[f24,f18]) ).
thf(f30,plain,
( $true
= ( ^ [Y0: $i,Y1: $i,Y2: $i] :
( ( ^ [Y3: $i,Y4: $i,Y5: $i] : ( subset @ Y5 @ ( cartprod @ Y3 @ Y4 ) )
@ Y0
@ Y1
@ Y2 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( in @ Y3 @ Y0 )
=> ( ^ [Y4: $i,Y5: $i > $o] :
( ^ [Y6: $i] :
( ?? @ $i
@ ^ [Y7: $i] :
( ( in @ Y7 @ Y6 )
& ( ( setadjoin @ Y7 @ emptyset )
= Y6 ) ) )
@ ( dsetconstr @ Y4
@ ^ [Y6: $i] : ( Y5 @ Y6 ) ) )
@ Y1
@ ^ [Y4: $i] : ( in @ ( kpair @ Y3 @ Y4 ) @ Y2 ) ) ) ) )
@ sK0
@ sK1
@ sK2 ) ),
inference(definition_unfolding,[],[f22,f28]) ).
thf(f31,plain,
( $true
= ( ( subset @ sK2 @ ( cartprod @ sK0 @ sK1 ) )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1
@ ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) )
& ( ( setadjoin @ Y1 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f30]) ).
thf(f32,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1
@ ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) )
& ( ( setadjoin @ Y1 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) ) ) ) ) ) ),
inference(and_proxy_clausification,[],[f31]) ).
thf(f34,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( in @ Y0 @ sK0 )
=> ( ?? @ $i
@ ^ [Y1: $i] :
( ( in @ Y1
@ ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) )
& ( ( setadjoin @ Y1 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y2: $i] : ( in @ ( kpair @ Y0 @ Y2 ) @ sK2 ) ) ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f32]) ).
thf(f35,plain,
! [X1: $i] :
( $true
= ( ( in @ X1 @ sK0 )
=> ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0
@ ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) )
& ( ( setadjoin @ Y0 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f34]) ).
thf(f36,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0
@ ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) )
& ( ( setadjoin @ Y0 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) ) ) ) ) ),
inference(imp_proxy_clausification,[],[f35]) ).
thf(f37,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( $true
= ( ^ [Y0: $i] :
( ( in @ Y0
@ ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) )
& ( ( setadjoin @ Y0 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ X1 @ Y1 ) @ sK2 ) ) ) )
@ ( sK4 @ X1 ) ) ) ),
inference(sigma_proxy_clausification,[],[f36]) ).
thf(f38,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( $true
= ( ( in @ ( sK4 @ X1 )
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) ) )
& ( ( setadjoin @ ( sK4 @ X1 ) @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f37]) ).
thf(f39,plain,
! [X1: $i] :
( ( $false
= ( in @ X1 @ sK0 ) )
| ( $true
= ( ( setadjoin @ ( sK4 @ X1 ) @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) ) ) ) ),
inference(and_proxy_clausification,[],[f38]) ).
thf(f40,plain,
! [X1: $i] :
( ( $true
= ( in @ ( sK4 @ X1 )
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) ) ) )
| ( $false
= ( in @ X1 @ sK0 ) ) ),
inference(and_proxy_clausification,[],[f38]) ).
thf(f41,plain,
! [X1: $i] :
( ( ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ X1 @ Y0 ) @ sK2 ) )
= ( setadjoin @ ( sK4 @ X1 ) @ emptyset ) )
| ( $false
= ( in @ X1 @ sK0 ) ) ),
inference(equality_proxy_clausification,[],[f39]) ).
thf(f42,plain,
( $true
!= ( ?? @ $i
@ ^ [Y0: $i] :
( ( in @ Y0
@ ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ sK3 @ Y1 ) @ sK2 ) ) )
& ( ( setadjoin @ Y0 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ sK3 @ Y1 ) @ sK2 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f43,plain,
! [X1: $i] :
( $false
= ( ^ [Y0: $i] :
( ( in @ Y0
@ ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ sK3 @ Y1 ) @ sK2 ) ) )
& ( ( setadjoin @ Y0 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y1: $i] : ( in @ ( kpair @ sK3 @ Y1 ) @ sK2 ) ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f42]) ).
thf(f44,plain,
! [X1: $i] :
( $false
= ( ( in @ X1
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) )
& ( ( setadjoin @ X1 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) ) ) ),
inference(beta-eta_normalization,[],[f43]) ).
thf(f45,plain,
! [X1: $i] :
( ( $false
= ( ( setadjoin @ X1 @ emptyset )
= ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) ) )
| ( $false
= ( in @ X1
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) ) ) ),
inference(and_proxy_clausification,[],[f44]) ).
thf(f46,plain,
! [X1: $i] :
( ( ( setadjoin @ X1 @ emptyset )
!= ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) )
| ( $false
= ( in @ X1
@ ( dsetconstr @ sK1
@ ^ [Y0: $i] : ( in @ ( kpair @ sK3 @ Y0 ) @ sK2 ) ) ) ) ),
inference(equality_proxy_clausification,[],[f45]) ).
thf(f107,plain,
! [X0: $i,X1: $i] :
( ( $true
= ( in @ ( sK4 @ X1 ) @ ( setadjoin @ ( sK4 @ X0 ) @ emptyset ) ) )
| ( $false
= ( in @ X1 @ sK0 ) )
| ( $false
= ( in @ X0 @ sK0 ) )
| ( ( ^ [Y0: $i] : X0 )
!= ( ^ [Y0: $i] : X1 ) ) ),
inference(constrained_superposition,[],[f40,f41]) ).
thf(f266,plain,
! [X0: $i] :
( ( ( setadjoin @ X0 @ emptyset )
!= ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) )
| ( $false
= ( in @ X0 @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) )
| ( ( in @ sK3 @ sK0 )
= $false ) ),
inference(constrained_superposition,[],[f46,f41]) ).
thf(f267,plain,
! [X0: $i] :
( ( $true = $false )
| ( ( setadjoin @ X0 @ emptyset )
!= ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) )
| ( $false
= ( in @ X0 @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ) ),
inference(forward_demodulation,[],[f266,f23]) ).
thf(f268,plain,
! [X0: $i] :
( ( ( setadjoin @ X0 @ emptyset )
!= ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) )
| ( $false
= ( in @ X0 @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ) ),
inference(trivial_inequality_removal,[],[f267]) ).
thf(f298,plain,
( $false
= ( in @ ( sK4 @ sK3 ) @ ( setadjoin @ ( sK4 @ sK3 ) @ emptyset ) ) ),
inference(equality_resolution,[],[f268]) ).
thf(f350,plain,
( ( $true = $false )
| ( ( in @ sK3 @ sK0 )
= $false )
| ( ( in @ sK3 @ sK0 )
= $false )
| ( ( ^ [Y0: $i] : sK3 )
!= ( ^ [Y0: $i] : sK3 ) ) ),
inference(constrained_superposition,[],[f107,f298]) ).
thf(f351,plain,
( ( $true = $false )
| ( ( in @ sK3 @ sK0 )
= $false )
| ( ( ^ [Y0: $i] : sK3 )
!= ( ^ [Y0: $i] : sK3 ) ) ),
inference(duplicate_literal_removal,[],[f350]) ).
thf(f352,plain,
( ( in @ sK3 @ sK0 )
= $false ),
inference(trivial_inequality_removal,[],[f351]) ).
thf(f364,plain,
$true = $false,
inference(constrained_superposition,[],[f23,f352]) ).
thf(f365,plain,
$false,
inference(trivial_inequality_removal,[],[f364]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU672^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.10/0.17 % Computer : n020.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 14:07:49 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 Running first-order model finding
% 0.10/0.19 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.10/0.25 % (1107795)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (1107802)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=825599576:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.25 % (1107801)% WARNING: option uhcvi not known.
% 0.10/0.25 % (1107800)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3126780268_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.25 % (1107801)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1031240770:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.25 % (1107803)dis+10_1_sil=32000:sp=arity:random_seed=2073083935:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.25 % (1107804)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4272107046:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.25 % (1107806)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1515245461:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.25 % (1107801)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.25 % (1107804)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.25 % Exception at run slice level
% 0.10/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.10/0.25 % (1107801)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.10/0.25 % (1107802) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1107795-1107802"...
% 0.10/0.25 % (1107804) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1107795-1107804"...
% 0.10/0.25 % (1107802)...printing done.
% 0.10/0.25 % (1107802)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25 % (1107802)------------------------------
% 0.10/0.25 % (1107802)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (1107802)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (1107802)CaDiCaL version: 2.1.3
% 0.10/0.25 % (1107802)Termination reason: Refutation
% 0.10/0.25 % (1107802)Time elapsed: 0.011 s
% 0.10/0.25 % (1107802)Peak memory usage: 12 MB
% 0.10/0.25 % (1107802)Instructions burned: 35 (million)
% 0.10/0.25 % (1107795)Success in time 0.047 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------