%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU668^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:30:37 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 5
% Syntax : Number of formulae : 69 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 587 ( 195 equ; 0 cnn)
% Maximal formula atoms : 7 ( 8 avg)
% Number of connectives : 787 ( 57 ~; 49 |; 82 &; 543 @)
% ( 6 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 37 ( 37 >; 0 *; 0 +; 0 <<)
% Number of symbols : 41 ( 37 usr; 22 con; 0-4 aty)
% ( 0 !!; 17 ??; 0 @@+; 0 @@-)
% Number of variables : 253 ( 75 ^; 137 !; 41 ?; 253 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_2,type,
dsetconstrER: $o ).
thf(func_def_4,type,
kpair: $i > $i > $i ).
thf(func_def_5,type,
cartprod: $i > $i > $i ).
thf(func_def_6,type,
setukpairinjL: $o ).
thf(func_def_7,type,
setukpairinjR: $o ).
thf(func_def_8,type,
dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_11,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_14,type,
vAND: $o > $o > $o ).
thf(func_def_15,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_17,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_25,type,
sK5: $i > $o ).
thf(func_def_30,type,
sK10: $i > $i > $o ).
thf(func_def_36,type,
vNOT: $o > $o ).
thf(f1,axiom,
! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) )
= dsetconstrER ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(f2,axiom,
( setukpairinjL
= ( ! [X0: $i,X1: $i,X3: $i,X2: $i] :
( ( ( kpair @ X0 @ X1 )
= ( kpair @ X2 @ X3 ) )
=> ( X0 = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL) ).
thf(f3,axiom,
! [X1: $i,X3: $i,X2: $i,X0: $i] :
( ( ( ( kpair @ X0 @ X1 )
= ( kpair @ X2 @ X3 ) )
=> ( X1 = X3 ) )
= setukpairinjR ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjR) ).
thf(f4,axiom,
( ( ^ [X0: $i,X1: $i,X2: $i > $i > $o] :
( dsetconstr @ ( cartprod @ X0 @ X1 )
@ ^ [X3: $i] :
? [X4: $i] :
( ( in @ X4 @ X0 )
& ? [X5: $i] :
( ( X2 @ X4 @ X5 )
& ( in @ X5 @ X1 )
& ( X3
= ( kpair @ X4 @ X5 ) ) ) ) ) )
= dpsetconstr ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstr) ).
thf(f5,conjecture,
( dsetconstrER
=> ( setukpairinjL
=> ( setukpairinjR
=> ! [X1: $i,X0: $i,X3: $i,X2: $i > $i > $o] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( in @ ( kpair @ X3 @ X4 )
@ ( dpsetconstr @ X0 @ X1
@ ^ [X5: $i,X6: $i] : ( X2 @ X5 @ X6 ) ) )
=> ( X2 @ X3 @ X4 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dpsetconstrERa) ).
thf(f6,negated_conjecture,
~ ( dsetconstrER
=> ( setukpairinjL
=> ( setukpairinjR
=> ! [X1: $i,X0: $i,X3: $i,X2: $i > $i > $o] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X1 )
=> ( ( in @ ( kpair @ X3 @ X4 )
@ ( dpsetconstr @ X0 @ X1
@ ^ [X5: $i,X6: $i] : ( X2 @ X5 @ X6 ) ) )
=> ( X2 @ X3 @ X4 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
thf(f7,plain,
( setukpairinjL
= ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( kpair @ X0 @ X1 )
= ( kpair @ X3 @ X2 ) )
=> ( X0 = X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( ( setukpairinjL = $true )
<=> ! [X2: $i,X1: $i,X3: $i,X0: $i] :
( ( ( kpair @ X0 @ X1 )
= ( kpair @ X3 @ X2 ) )
=> ( X0 = X3 ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( ( ^ [X0: $i,X1: $i,X2: $i > $i > $o] :
( dsetconstr @ ( cartprod @ X0 @ X1 )
@ ^ [X3: $i] :
? [X4: $i] :
( ( in @ X4 @ X0 )
& ? [X5: $i] :
( ( X2 @ X4 @ X5 )
& ( in @ X5 @ X1 )
& ( X3
= ( kpair @ X4 @ X5 ) ) ) ) ) )
= dpsetconstr ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
( dpsetconstr
= ( ^ [Y0: $i,Y1: $i,Y2: $i > $i > $o] :
( dsetconstr @ ( cartprod @ Y0 @ Y1 )
@ ^ [Y3: $i] :
( ?? @ $i
@ ^ [Y4: $i] :
( ( ?? @ $i
@ ^ [Y5: $i] :
( ( ( kpair @ Y4 @ Y5 )
= Y3 )
& ( in @ Y5 @ Y1 )
& ( Y2 @ Y4 @ Y5 ) ) )
& ( in @ Y4 @ Y0 ) ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
~ ( dsetconstrER
=> ( setukpairinjL
=> ( setukpairinjR
=> ! [X0: $i,X1: $i,X2: $i,X3: $i > $i > $o] :
( ( in @ X2 @ X1 )
=> ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ( ( in @ ( kpair @ X2 @ X4 )
@ ( dpsetconstr @ X1 @ X0
@ ^ [X5: $i,X6: $i] : ( X3 @ X5 @ X6 ) ) )
=> ( X3 @ X2 @ X4 ) ) ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f12,plain,
~ ( ( dsetconstrER = $true )
=> ( ( setukpairinjL = $true )
=> ( ( setukpairinjR = $true )
=> ! [X3: $i > $i > $o,X0: $i,X1: $i,X2: $i] :
( ( $true
= ( in @ X2 @ X1 ) )
=> ! [X4: $i] :
( ( ( in @ X4 @ X0 )
= $true )
=> ( ( ( in @ ( kpair @ X2 @ X4 )
@ ( dpsetconstr @ X1 @ X0
@ ^ [Y0: $i,Y1: $i] : ( X3 @ Y0 @ Y1 ) ) )
= $true )
=> ( ( X3 @ X2 @ X4 )
= $true ) ) ) ) ) ) ),
inference(fool_elimination,[],[f11]) ).
thf(f13,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( ( kpair @ X2 @ X1 )
= ( kpair @ X3 @ X0 ) )
=> ( X0 = X1 ) )
= setukpairinjR ),
inference(rectify,[],[f3]) ).
thf(f14,plain,
( ( setukpairinjR = $true )
<=> ! [X1: $i,X0: $i,X2: $i,X3: $i] :
( ( ( kpair @ X2 @ X1 )
= ( kpair @ X3 @ X0 ) )
=> ( X0 = X1 ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f15,plain,
! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) )
= dsetconstrER ),
inference(rectify,[],[f1]) ).
thf(f16,plain,
( ! [X1: $i > $o,X2: $i,X0: $i] :
( ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
= $true )
=> ( ( X1 @ X2 )
= $true ) )
<=> ( dsetconstrER = $true ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( ! [X1: $i,X0: $i,X3: $i,X2: $i] :
( ( ( kpair @ X2 @ X1 )
!= ( kpair @ X3 @ X0 ) )
| ( X0 = X1 ) )
<=> ( setukpairinjR = $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f18,plain,
( ! [X3: $i,X0: $i,X2: $i,X1: $i] :
( ( X0 = X3 )
| ( ( kpair @ X0 @ X1 )
!= ( kpair @ X3 @ X2 ) ) )
<=> ( setukpairinjL = $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f19,plain,
( ? [X3: $i > $i > $o,X0: $i,X1: $i,X2: $i] :
( ? [X4: $i] :
( ( ( X3 @ X2 @ X4 )
!= $true )
& ( ( in @ ( kpair @ X2 @ X4 )
@ ( dpsetconstr @ X1 @ X0
@ ^ [Y0: $i,Y1: $i] : ( X3 @ Y0 @ Y1 ) ) )
= $true )
& ( ( in @ X4 @ X0 )
= $true ) )
& ( $true
= ( in @ X2 @ X1 ) ) )
& ( setukpairinjR = $true )
& ( setukpairinjL = $true )
& ( dsetconstrER = $true ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f20,plain,
( ( setukpairinjL = $true )
& ( dsetconstrER = $true )
& ? [X1: $i,X2: $i,X0: $i,X3: $i > $i > $o] :
( ( $true
= ( in @ X2 @ X1 ) )
& ? [X4: $i] :
( ( ( X3 @ X2 @ X4 )
!= $true )
& ( ( in @ X4 @ X0 )
= $true )
& ( ( in @ ( kpair @ X2 @ X4 )
@ ( dpsetconstr @ X1 @ X0
@ ^ [Y0: $i,Y1: $i] : ( X3 @ Y0 @ Y1 ) ) )
= $true ) ) )
& ( setukpairinjR = $true ) ),
inference(flattening,[],[f19]) ).
thf(f21,plain,
( ( dsetconstrER = $true )
<=> ! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( X1 @ X2 )
= $true )
| ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
!= $true ) ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f22,plain,
( ( ! [X1: $i,X0: $i,X3: $i,X2: $i] :
( ( ( kpair @ X2 @ X1 )
!= ( kpair @ X3 @ X0 ) )
| ( X0 = X1 ) )
| ( setukpairinjR != $true ) )
& ( ( setukpairinjR = $true )
| ? [X1: $i,X0: $i,X3: $i,X2: $i] :
( ( ( kpair @ X2 @ X1 )
= ( kpair @ X3 @ X0 ) )
& ( X0 != X1 ) ) ) ),
inference(nnf_transformation,[],[f17]) ).
thf(f23,plain,
( ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( kpair @ X2 @ X1 )
!= ( kpair @ X3 @ X0 ) )
| ( X0 = X1 ) )
| ( setukpairinjR != $true ) )
& ( ( setukpairinjR = $true )
| ? [X4: $i,X5: $i,X6: $i,X7: $i] :
( ( ( kpair @ X7 @ X4 )
= ( kpair @ X6 @ X5 ) )
& ( X4 != X5 ) ) ) ),
inference(rectify,[],[f22]) ).
thf(f24,plain,
( ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( kpair @ X2 @ X1 )
!= ( kpair @ X3 @ X0 ) )
| ( X0 = X1 ) )
| ( setukpairinjR != $true ) )
& ( ( setukpairinjR = $true )
| ( ( ( kpair @ sK3 @ sK0 )
= ( kpair @ sK2 @ sK1 ) )
& ( sK0 != sK1 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X4,sK0),skolemize(X5,sK1),skolemize(X6,sK2),skolemize(X7,sK3)],[f23]) ).
thf(f25,plain,
( ( ( dsetconstrER = $true )
| ? [X0: $i,X1: $i > $o,X2: $i] :
( ( ( X1 @ X2 )
!= $true )
& ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
= $true ) ) )
& ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( ( X1 @ X2 )
= $true )
| ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
!= $true ) )
| ( dsetconstrER != $true ) ) ),
inference(nnf_transformation,[],[f21]) ).
thf(f26,plain,
( ( ( dsetconstrER = $true )
| ? [X0: $i,X1: $i > $o,X2: $i] :
( ( ( X1 @ X2 )
!= $true )
& ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
= $true ) ) )
& ( ! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( X4 @ X5 )
= $true )
| ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true ) )
| ( dsetconstrER != $true ) ) ),
inference(rectify,[],[f25]) ).
thf(f27,plain,
( ( ( dsetconstrER = $true )
| ( ( ( sK5 @ sK6 )
!= $true )
& ( ( in @ sK6
@ ( dsetconstr @ sK4
@ ^ [Y0: $i] : ( sK5 @ Y0 ) ) )
= $true ) ) )
& ( ! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( X4 @ X5 )
= $true )
| ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true ) )
| ( dsetconstrER != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f26]) ).
thf(f28,plain,
( ( setukpairinjL = $true )
& ( dsetconstrER = $true )
& ? [X0: $i,X1: $i,X2: $i,X3: $i > $i > $o] :
( ( $true
= ( in @ X1 @ X0 ) )
& ? [X4: $i] :
( ( ( X3 @ X1 @ X4 )
!= $true )
& ( $true
= ( in @ X4 @ X2 ) )
& ( $true
= ( in @ ( kpair @ X1 @ X4 )
@ ( dpsetconstr @ X0 @ X2
@ ^ [Y0: $i,Y1: $i] : ( X3 @ Y0 @ Y1 ) ) ) ) ) )
& ( setukpairinjR = $true ) ),
inference(rectify,[],[f20]) ).
thf(f29,plain,
( ( setukpairinjL = $true )
& ( dsetconstrER = $true )
& ( $true
= ( in @ sK8 @ sK7 ) )
& ( ( sK10 @ sK8 @ sK11 )
!= $true )
& ( $true
= ( in @ sK11 @ sK9 ) )
& ( ( in @ ( kpair @ sK8 @ sK11 )
@ ( dpsetconstr @ sK7 @ sK9
@ ^ [Y0: $i,Y1: $i] : ( sK10 @ Y0 @ Y1 ) ) )
= $true )
& ( setukpairinjR = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10,sK11]),skolemize(X0,sK7),skolemize(X1,sK8),skolemize(X2,sK9),skolemize(X3,sK10),skolemize(X4,sK11)],[f28]) ).
thf(f30,plain,
( ( ! [X3: $i,X0: $i,X2: $i,X1: $i] :
( ( X0 = X3 )
| ( ( kpair @ X0 @ X1 )
!= ( kpair @ X3 @ X2 ) ) )
| ( setukpairinjL != $true ) )
& ( ( setukpairinjL = $true )
| ? [X3: $i,X0: $i,X2: $i,X1: $i] :
( ( X0 != X3 )
& ( ( kpair @ X0 @ X1 )
= ( kpair @ X3 @ X2 ) ) ) ) ),
inference(nnf_transformation,[],[f18]) ).
thf(f31,plain,
( ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X1 )
| ( ( kpair @ X0 @ X2 )
!= ( kpair @ X1 @ X3 ) ) )
| ( setukpairinjL != $true ) )
& ( ( setukpairinjL = $true )
| ? [X4: $i,X5: $i,X6: $i,X7: $i] :
( ( X4 != X5 )
& ( ( kpair @ X4 @ X6 )
= ( kpair @ X5 @ X7 ) ) ) ) ),
inference(rectify,[],[f30]) ).
thf(f32,plain,
( ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X1 )
| ( ( kpair @ X0 @ X2 )
!= ( kpair @ X1 @ X3 ) ) )
| ( setukpairinjL != $true ) )
& ( ( setukpairinjL = $true )
| ( ( sK13 != sK12 )
& ( ( kpair @ sK12 @ sK14 )
= ( kpair @ sK13 @ sK15 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15]),skolemize(X4,sK12),skolemize(X5,sK13),skolemize(X6,sK14),skolemize(X7,sK15)],[f31]) ).
thf(f35,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( kpair @ X2 @ X1 )
!= ( kpair @ X3 @ X0 ) )
| ( X0 = X1 )
| ( setukpairinjR != $true ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f36,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( X4 @ X5 )
= $true )
| ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true )
| ( dsetconstrER != $true ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f39,plain,
setukpairinjR = $true,
inference(cnf_transformation,[],[f29]) ).
thf(f40,plain,
( ( in @ ( kpair @ sK8 @ sK11 )
@ ( dpsetconstr @ sK7 @ sK9
@ ^ [Y0: $i,Y1: $i] : ( sK10 @ Y0 @ Y1 ) ) )
= $true ),
inference(cnf_transformation,[],[f29]) ).
thf(f42,plain,
( ( sK10 @ sK8 @ sK11 )
!= $true ),
inference(cnf_transformation,[],[f29]) ).
thf(f44,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f29]) ).
thf(f45,plain,
setukpairinjL = $true,
inference(cnf_transformation,[],[f29]) ).
thf(f48,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( kpair @ X0 @ X2 )
!= ( kpair @ X1 @ X3 ) )
| ( setukpairinjL != $true ) ),
inference(cnf_transformation,[],[f32]) ).
thf(f49,plain,
( dpsetconstr
= ( ^ [Y0: $i,Y1: $i,Y2: $i > $i > $o] :
( dsetconstr @ ( cartprod @ Y0 @ Y1 )
@ ^ [Y3: $i] :
( ?? @ $i
@ ^ [Y4: $i] :
( ( ?? @ $i
@ ^ [Y5: $i] :
( ( ( kpair @ Y4 @ Y5 )
= Y3 )
& ( in @ Y5 @ Y1 )
& ( Y2 @ Y4 @ Y5 ) ) )
& ( in @ Y4 @ Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f52,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( $true != $true )
| ( ( kpair @ X2 @ X1 )
!= ( kpair @ X3 @ X0 ) )
| ( X0 = X1 ) ),
inference(definition_unfolding,[],[f35,f39]) ).
thf(f57,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( X4 @ X5 )
= $true )
| ( $true != $true )
| ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true ) ),
inference(definition_unfolding,[],[f36,f44]) ).
thf(f58,plain,
( ( in @ ( kpair @ sK8 @ sK11 )
@ ( ^ [Y0: $i,Y1: $i,Y2: $i > $i > $o] :
( dsetconstr @ ( cartprod @ Y0 @ Y1 )
@ ^ [Y3: $i] :
( ?? @ $i
@ ^ [Y4: $i] :
( ( ?? @ $i
@ ^ [Y5: $i] :
( ( ( kpair @ Y4 @ Y5 )
= Y3 )
& ( in @ Y5 @ Y1 )
& ( Y2 @ Y4 @ Y5 ) ) )
& ( in @ Y4 @ Y0 ) ) ) )
@ sK7
@ sK9
@ ^ [Y0: $i,Y1: $i] : ( sK10 @ Y0 @ Y1 ) ) )
= $true ),
inference(definition_unfolding,[],[f40,f49]) ).
thf(f59,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( kpair @ X0 @ X2 )
!= ( kpair @ X1 @ X3 ) )
| ( $true != $true )
| ( X0 = X1 ) ),
inference(definition_unfolding,[],[f48,f45]) ).
thf(f62,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( kpair @ X0 @ X2 )
!= ( kpair @ X1 @ X3 ) )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f59]) ).
thf(f63,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true )
| ( ( X4 @ X5 )
= $true ) ),
inference(trivial_inequality_removal,[],[f57]) ).
thf(f64,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( $true
!= ( in @ X5 @ ( dsetconstr @ X3 @ X4 ) ) )
| ( ( X4 @ X5 )
= $true ) ),
inference(beta-eta_normalization,[],[f63]) ).
thf(f65,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( kpair @ X2 @ X1 )
!= ( kpair @ X3 @ X0 ) )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f66,plain,
( $true
= ( in @ ( kpair @ sK8 @ sK11 )
@ ( dsetconstr @ ( cartprod @ sK7 @ sK9 )
@ ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( ?? @ $i
@ ^ [Y2: $i] :
( ( ( kpair @ Y1 @ Y2 )
= Y0 )
& ( in @ Y2 @ sK9 )
& ( sK10 @ Y1 @ Y2 ) ) )
& ( in @ Y1 @ sK7 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f58]) ).
thf(f69,plain,
( ( ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( ?? @ $i
@ ^ [Y2: $i] :
( ( ( kpair @ Y1 @ Y2 )
= Y0 )
& ( in @ Y2 @ sK9 )
& ( sK10 @ Y1 @ Y2 ) ) )
& ( in @ Y1 @ sK7 ) ) )
@ ( kpair @ sK8 @ sK11 ) )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f64,f66]) ).
thf(f70,plain,
( ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( ?? @ $i
@ ^ [Y2: $i] :
( ( ( kpair @ Y1 @ Y2 )
= Y0 )
& ( in @ Y2 @ sK9 )
& ( sK10 @ Y1 @ Y2 ) ) )
& ( in @ Y1 @ sK7 ) ) )
@ ( kpair @ sK8 @ sK11 ) )
= $true ),
inference(trivial_inequality_removal,[],[f69]) ).
thf(f71,plain,
( ( ?? @ $i
@ ^ [Y0: $i] :
( ( ?? @ $i
@ ^ [Y1: $i] :
( ( ( kpair @ Y0 @ Y1 )
= ( kpair @ sK8 @ sK11 ) )
& ( in @ Y1 @ sK9 )
& ( sK10 @ Y0 @ Y1 ) ) )
& ( in @ Y0 @ sK7 ) ) )
= $true ),
inference(beta-eta_normalization,[],[f70]) ).
thf(f72,plain,
( ( ^ [Y0: $i] :
( ( ?? @ $i
@ ^ [Y1: $i] :
( ( ( kpair @ Y0 @ Y1 )
= ( kpair @ sK8 @ sK11 ) )
& ( in @ Y1 @ sK9 )
& ( sK10 @ Y0 @ Y1 ) ) )
& ( in @ Y0 @ sK7 ) )
@ sK16 )
= $true ),
inference(sigma_proxy_clausification,[],[f71]) ).
thf(f73,plain,
( ( ( ?? @ $i
@ ^ [Y0: $i] :
( ( ( kpair @ sK16 @ Y0 )
= ( kpair @ sK8 @ sK11 ) )
& ( in @ Y0 @ sK9 )
& ( sK10 @ sK16 @ Y0 ) ) )
& ( in @ sK16 @ sK7 ) )
= $true ),
inference(beta-eta_normalization,[],[f72]) ).
thf(f75,plain,
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( ( kpair @ sK16 @ Y0 )
= ( kpair @ sK8 @ sK11 ) )
& ( in @ Y0 @ sK9 )
& ( sK10 @ sK16 @ Y0 ) ) ) ),
inference(and_proxy_clausification,[],[f73]) ).
thf(f76,plain,
( $true
= ( ^ [Y0: $i] :
( ( ( kpair @ sK16 @ Y0 )
= ( kpair @ sK8 @ sK11 ) )
& ( in @ Y0 @ sK9 )
& ( sK10 @ sK16 @ Y0 ) )
@ sK17 ) ),
inference(sigma_proxy_clausification,[],[f75]) ).
thf(f77,plain,
( ( ( ( kpair @ sK16 @ sK17 )
= ( kpair @ sK8 @ sK11 ) )
& ( in @ sK17 @ sK9 )
& ( sK10 @ sK16 @ sK17 ) )
= $true ),
inference(beta-eta_normalization,[],[f76]) ).
thf(f78,plain,
( $true
= ( sK10 @ sK16 @ sK17 ) ),
inference(and_proxy_clausification,[],[f77]) ).
thf(f79,plain,
( ( ( ( kpair @ sK16 @ sK17 )
= ( kpair @ sK8 @ sK11 ) )
& ( in @ sK17 @ sK9 ) )
= $true ),
inference(and_proxy_clausification,[],[f77]) ).
thf(f81,plain,
( $true
= ( ( kpair @ sK16 @ sK17 )
= ( kpair @ sK8 @ sK11 ) ) ),
inference(and_proxy_clausification,[],[f79]) ).
thf(f82,plain,
( ( kpair @ sK16 @ sK17 )
= ( kpair @ sK8 @ sK11 ) ),
inference(equality_proxy_clausification,[],[f81]) ).
thf(f83,plain,
! [X0: $i,X1: $i] :
( ( ( kpair @ X0 @ X1 )
!= ( kpair @ sK8 @ sK11 ) )
| ( sK17 = X1 ) ),
inference(constrained_superposition,[],[f65,f82]) ).
thf(f86,plain,
! [X0: $i,X1: $i] :
( ( ( kpair @ X0 @ X1 )
!= ( kpair @ sK8 @ sK11 ) )
| ( sK16 = X0 ) ),
inference(constrained_superposition,[],[f62,f82]) ).
thf(f87,plain,
sK17 = sK11,
inference(equality_resolution,[],[f83]) ).
thf(f90,plain,
( $true
= ( sK10 @ sK16 @ sK11 ) ),
inference(constrained_superposition,[],[f78,f87]) ).
thf(f97,plain,
sK16 = sK8,
inference(equality_resolution,[],[f86]) ).
thf(f98,plain,
( ( sK10 @ sK8 @ sK11 )
= $true ),
inference(constrained_superposition,[],[f90,f97]) ).
thf(f102,plain,
$false,
inference(forward_subsumption_resolution,[],[f98,f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU668^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n006.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 14:06:24 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.28 % (770994)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.28 % (771002)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=2507997466:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.20/0.28 % (770999)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=588316848:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.28 % (771000)lrs+10_16_si=on:nwc=1.5:random_seed=1220017557:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.28 % (771003)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1230658033:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.28 % (771001)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1101308309:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.28 % (771005)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.28 % (771005)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.20/0.28 % (771001)Instruction limit reached!
% 0.20/0.28 % (771001)------------------------------
% 0.20/0.28 % (771001)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (771001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (771001)CaDiCaL version: 2.1.3
% 0.20/0.28 % (771001)Termination reason: Instruction limit
% 0.20/0.28 % (771001)Termination phase: Saturation
% 0.20/0.28 % (771001)Time elapsed: 0.002 s
% 0.20/0.28 % (771001)Peak memory usage: 11 MB
% 0.20/0.28 % (771001)Instructions burned: 3 (million)
% 0.20/0.28 % (770999) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-770994-770999"...
% 0.20/0.28 % (771004)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1140259754:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.28 % (771005)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=4046333075:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.28 % (771000) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-770994-771000"...
% 0.20/0.28 % (770999)...printing done.
% 0.20/0.28 % (770999)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (770999)------------------------------
% 0.20/0.28 % (770999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (770999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (770999)CaDiCaL version: 2.1.3
% 0.20/0.28 % (770999)Termination reason: Refutation
% 0.20/0.28 % (770999)Time elapsed: 0.007 s
% 0.20/0.28 % (770999)Peak memory usage: 12 MB
% 0.20/0.28 % (770999)Instructions burned: 11 (million)
% 0.20/0.28 % (770994)Success in time 0.046 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------