%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU656^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 : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:30:33 AM UTC 2026
% Result : Theorem 0.21s 0.34s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 78 ( 31 unt; 0 typ; 0 def)
% Number of atoms : 627 ( 243 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 756 ( 80 ~; 69 |; 47 &; 519 @)
% ( 9 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 39 ( 36 usr; 19 con; 0-4 aty)
% Number of variables : 204 ( 45 ^; 131 !; 28 ?; 204 :)
% 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,
setunion: $i > $i ).
thf(func_def_4,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_5,type,
dsetconstrER: $o ).
thf(func_def_7,type,
iskpair: $i > $o ).
thf(func_def_8,type,
kpair: $i > $i > $i ).
thf(func_def_9,type,
kpairp: $o ).
thf(func_def_10,type,
singleton: $i > $o ).
thf(func_def_11,type,
theprop: $o ).
thf(func_def_12,type,
kfst: $i > $i ).
thf(func_def_13,type,
setukpairinjR: $o ).
thf(func_def_14,type,
ksndsingleton: $o ).
thf(func_def_15,type,
ksnd: $i > $i ).
thf(func_def_18,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_20,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_21,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_22,type,
vAND: $o > $o > $o ).
thf(func_def_23,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_24,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_30,type,
sK5: $i > $o ).
thf(func_def_38,type,
vNOT: $o > $o ).
thf(f1,axiom,
( dsetconstrER
= ( ! [X1: $i > $o,X2: $i,X0: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(f4,axiom,
! [X1: $i,X0: $i] :
( ( iskpair @ ( kpair @ X0 @ X1 ) )
= kpairp ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpairp) ).
thf(f6,axiom,
( theprop
= ( ! [X0: $i] :
( ( singleton @ X0 )
=> ( in @ ( setunion @ X0 ) @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theprop) ).
thf(f7,axiom,
! [X0: $i,X3: $i,X1: $i,X2: $i] :
( ( ( ( kpair @ X0 @ X1 )
= ( kpair @ X2 @ X3 ) )
=> ( X1 = X3 ) )
= setukpairinjR ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjR) ).
thf(f8,axiom,
! [X0: $i] :
( ( ( iskpair @ X0 )
=> ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [X1: $i] :
( X0
= ( kpair @ ( kfst @ X0 ) @ X1 ) ) ) ) )
= ksndsingleton ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ksndsingleton) ).
thf(f9,axiom,
( ksnd
= ( ^ [X0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [X1: $i] :
( X0
= ( kpair @ ( kfst @ X0 ) @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ksnd) ).
thf(f10,conjecture,
( dsetconstrER
=> ( kpairp
=> ( theprop
=> ( setukpairinjR
=> ( ksndsingleton
=> ! [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
= X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ksndpairEq) ).
thf(f11,negated_conjecture,
~ ( dsetconstrER
=> ( kpairp
=> ( theprop
=> ( setukpairinjR
=> ( ksndsingleton
=> ! [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
= X1 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
thf(f12,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( ( kpair @ X3 @ X1 )
= ( kpair @ X0 @ X2 ) )
=> ( X1 = X2 ) )
= setukpairinjR ),
inference(rectify,[],[f7]) ).
thf(f13,plain,
( ( setukpairinjR = $true )
<=> ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( kpair @ X3 @ X1 )
= ( kpair @ X0 @ X2 ) )
=> ( X1 = X2 ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f17,plain,
! [X0: $i] :
( ( ( iskpair @ X0 )
=> ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [X1: $i] :
( X0
= ( kpair @ ( kfst @ X0 ) @ X1 ) ) ) ) )
= ksndsingleton ),
inference(rectify,[],[f8]) ).
thf(f18,plain,
( ( ksndsingleton = $true )
<=> ! [X0: $i] :
( ( ( iskpair @ X0 )
= $true )
=> ( $true
= ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X0 ) @ Y0 )
= X0 ) ) ) ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f19,plain,
( dsetconstrER
= ( ! [X0: $i > $o,X1: $i,X2: $i] :
( ( in @ X1
@ ( dsetconstr @ X2
@ ^ [X3: $i] : ( X0 @ X3 ) ) )
=> ( X0 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f20,plain,
( ! [X2: $i,X0: $i > $o,X1: $i] :
( ( $true
= ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) ) )
=> ( ( X0 @ X1 )
= $true ) )
<=> ( dsetconstrER = $true ) ),
inference(fool_elimination,[],[f19]) ).
thf(f23,plain,
~ ( dsetconstrER
=> ( kpairp
=> ( theprop
=> ( setukpairinjR
=> ( ksndsingleton
=> ! [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
= X1 ) ) ) ) ) ),
inference(rectify,[],[f11]) ).
thf(f24,plain,
~ ( ( dsetconstrER = $true )
=> ( ( kpairp = $true )
=> ( ( theprop = $true )
=> ( ( setukpairinjR = $true )
=> ( ( ksndsingleton = $true )
=> ! [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
= X1 ) ) ) ) ) ),
inference(fool_elimination,[],[f23]) ).
thf(f25,plain,
( ksnd
= ( ^ [X0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [X1: $i] :
( X0
= ( kpair @ ( kfst @ X0 ) @ X1 ) ) ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f26,plain,
( ksnd
= ( ^ [Y0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ Y0 )
@ ^ [Y1: $i] :
( ( kpair @ ( kfst @ Y0 ) @ Y1 )
= Y0 ) ) ) ) ),
inference(fool_elimination,[],[f25]) ).
thf(f27,plain,
( theprop
= ( ! [X0: $i] :
( ( singleton @ X0 )
=> ( in @ ( setunion @ X0 ) @ X0 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f28,plain,
( ! [X0: $i] :
( ( ( singleton @ X0 )
= $true )
=> ( ( in @ ( setunion @ X0 ) @ X0 )
= $true ) )
<=> ( theprop = $true ) ),
inference(fool_elimination,[],[f27]) ).
thf(f29,plain,
! [X0: $i,X1: $i] :
( ( iskpair @ ( kpair @ X1 @ X0 ) )
= kpairp ),
inference(rectify,[],[f4]) ).
thf(f30,plain,
( ( kpairp = $true )
<=> ! [X0: $i,X1: $i] :
( ( iskpair @ ( kpair @ X1 @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f29]) ).
thf(f31,plain,
( ? [X1: $i,X0: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
!= X1 )
& ( ksndsingleton = $true )
& ( setukpairinjR = $true )
& ( theprop = $true )
& ( kpairp = $true )
& ( dsetconstrER = $true ) ),
inference(ennf_transformation,[],[f24]) ).
thf(f32,plain,
( ( theprop = $true )
& ( setukpairinjR = $true )
& ( kpairp = $true )
& ( ksndsingleton = $true )
& ( dsetconstrER = $true )
& ? [X1: $i,X0: $i] :
( ( ksnd @ ( kpair @ X0 @ X1 ) )
!= X1 ) ),
inference(flattening,[],[f31]) ).
thf(f33,plain,
( ! [X2: $i,X1: $i,X0: $i > $o] :
( ( $true
!= ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) ) )
| ( ( X0 @ X1 )
= $true ) )
<=> ( dsetconstrER = $true ) ),
inference(ennf_transformation,[],[f20]) ).
thf(f34,plain,
( ( ksndsingleton = $true )
<=> ! [X0: $i] :
( ( ( iskpair @ X0 )
!= $true )
| ( $true
= ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X0 ) @ Y0 )
= X0 ) ) ) ) ) ),
inference(ennf_transformation,[],[f18]) ).
thf(f35,plain,
( ! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true ) )
<=> ( theprop = $true ) ),
inference(ennf_transformation,[],[f28]) ).
thf(f36,plain,
( ! [X2: $i,X1: $i,X0: $i,X3: $i] :
( ( X1 = X2 )
| ( ( kpair @ X3 @ X1 )
!= ( kpair @ X0 @ X2 ) ) )
<=> ( setukpairinjR = $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f37,plain,
( ( ( kpairp = $true )
| ? [X0: $i,X1: $i] :
( ( iskpair @ ( kpair @ X1 @ X0 ) )
!= $true ) )
& ( ! [X0: $i,X1: $i] :
( ( iskpair @ ( kpair @ X1 @ X0 ) )
= $true )
| ( kpairp != $true ) ) ),
inference(nnf_transformation,[],[f30]) ).
thf(f38,plain,
( ( ( kpairp = $true )
| ? [X0: $i,X1: $i] :
( ( iskpair @ ( kpair @ X1 @ X0 ) )
!= $true ) )
& ( ! [X2: $i,X3: $i] :
( ( iskpair @ ( kpair @ X3 @ X2 ) )
= $true )
| ( kpairp != $true ) ) ),
inference(rectify,[],[f37]) ).
thf(f39,plain,
( ( ( kpairp = $true )
| ( ( iskpair @ ( kpair @ sK1 @ sK0 ) )
!= $true ) )
& ( ! [X2: $i,X3: $i] :
( ( iskpair @ ( kpair @ X3 @ X2 ) )
= $true )
| ( kpairp != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f38]) ).
thf(f40,plain,
( ( ( ksndsingleton = $true )
| ? [X0: $i] :
( ( ( iskpair @ X0 )
= $true )
& ( $true
!= ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X0 ) @ Y0 )
= X0 ) ) ) ) ) )
& ( ! [X0: $i] :
( ( ( iskpair @ X0 )
!= $true )
| ( $true
= ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X0 ) @ Y0 )
= X0 ) ) ) ) )
| ( ksndsingleton != $true ) ) ),
inference(nnf_transformation,[],[f34]) ).
thf(f41,plain,
( ( ( ksndsingleton = $true )
| ? [X0: $i] :
( ( ( iskpair @ X0 )
= $true )
& ( $true
!= ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X0 ) @ Y0 )
= X0 ) ) ) ) ) )
& ( ! [X1: $i] :
( ( $true
!= ( iskpair @ X1 ) )
| ( $true
= ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X1 ) @ Y0 )
= X1 ) ) ) ) )
| ( ksndsingleton != $true ) ) ),
inference(rectify,[],[f40]) ).
thf(f42,plain,
( ( ( ksndsingleton = $true )
| ( ( $true
= ( iskpair @ sK2 ) )
& ( $true
!= ( singleton
@ ( dsetconstr @ ( setunion @ sK2 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ sK2 ) @ Y0 )
= sK2 ) ) ) ) ) )
& ( ! [X1: $i] :
( ( $true
!= ( iskpair @ X1 ) )
| ( $true
= ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X1 ) @ Y0 )
= X1 ) ) ) ) )
| ( ksndsingleton != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f41]) ).
thf(f43,plain,
( ( ! [X2: $i,X1: $i,X0: $i > $o] :
( ( $true
!= ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) ) )
| ( ( X0 @ X1 )
= $true ) )
| ( dsetconstrER != $true ) )
& ( ( dsetconstrER = $true )
| ? [X2: $i,X1: $i,X0: $i > $o] :
( ( $true
= ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X0 @ Y0 ) ) ) )
& ( ( X0 @ X1 )
!= $true ) ) ) ),
inference(nnf_transformation,[],[f33]) ).
thf(f44,plain,
( ( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
!= $true )
| ( ( X2 @ X1 )
= $true ) )
| ( dsetconstrER != $true ) )
& ( ( dsetconstrER = $true )
| ? [X3: $i,X4: $i,X5: $i > $o] :
( ( $true
= ( in @ X4
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X5 @ Y0 ) ) ) )
& ( $true
!= ( X5 @ X4 ) ) ) ) ),
inference(rectify,[],[f43]) ).
thf(f45,plain,
( ( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
!= $true )
| ( ( X2 @ X1 )
= $true ) )
| ( dsetconstrER != $true ) )
& ( ( dsetconstrER = $true )
| ( ( ( in @ sK4
@ ( dsetconstr @ sK3
@ ^ [Y0: $i] : ( sK5 @ Y0 ) ) )
= $true )
& ( $true
!= ( sK5 @ sK4 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f44]) ).
thf(f46,plain,
( ( theprop = $true )
& ( setukpairinjR = $true )
& ( kpairp = $true )
& ( ksndsingleton = $true )
& ( dsetconstrER = $true )
& ? [X0: $i,X1: $i] :
( ( ksnd @ ( kpair @ X1 @ X0 ) )
!= X0 ) ),
inference(rectify,[],[f32]) ).
thf(f47,plain,
( ( theprop = $true )
& ( setukpairinjR = $true )
& ( kpairp = $true )
& ( ksndsingleton = $true )
& ( dsetconstrER = $true )
& ( ( ksnd @ ( kpair @ sK7 @ sK6 ) )
!= sK6 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f46]) ).
thf(f48,plain,
( ( ! [X2: $i,X1: $i,X0: $i,X3: $i] :
( ( X1 = X2 )
| ( ( kpair @ X3 @ X1 )
!= ( kpair @ X0 @ X2 ) ) )
| ( setukpairinjR != $true ) )
& ( ( setukpairinjR = $true )
| ? [X2: $i,X1: $i,X0: $i,X3: $i] :
( ( X1 != X2 )
& ( ( kpair @ X3 @ X1 )
= ( kpair @ X0 @ X2 ) ) ) ) ),
inference(nnf_transformation,[],[f36]) ).
thf(f49,plain,
( ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X1 )
| ( ( kpair @ X3 @ X1 )
!= ( kpair @ X2 @ X0 ) ) )
| ( setukpairinjR != $true ) )
& ( ( setukpairinjR = $true )
| ? [X4: $i,X5: $i,X6: $i,X7: $i] :
( ( X4 != X5 )
& ( ( kpair @ X6 @ X4 )
= ( kpair @ X7 @ X5 ) ) ) ) ),
inference(rectify,[],[f48]) ).
thf(f50,plain,
( ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X1 )
| ( ( kpair @ X3 @ X1 )
!= ( kpair @ X2 @ X0 ) ) )
| ( setukpairinjR != $true ) )
& ( ( setukpairinjR = $true )
| ( ( sK9 != sK8 )
& ( ( kpair @ sK10 @ sK8 )
= ( kpair @ sK11 @ sK9 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11]),skolemize(X4,sK8),skolemize(X5,sK9),skolemize(X6,sK10),skolemize(X7,sK11)],[f49]) ).
thf(f51,plain,
( ( ! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true ) )
| ( theprop != $true ) )
& ( ( theprop = $true )
| ? [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
!= $true )
& ( ( singleton @ X0 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f35]) ).
thf(f52,plain,
( ( ! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true ) )
| ( theprop != $true ) )
& ( ( theprop = $true )
| ? [X1: $i] :
( ( $true
!= ( in @ ( setunion @ X1 ) @ X1 ) )
& ( ( singleton @ X1 )
= $true ) ) ) ),
inference(rectify,[],[f51]) ).
thf(f53,plain,
( ( ! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true ) )
| ( theprop != $true ) )
& ( ( theprop = $true )
| ( ( $true
!= ( in @ ( setunion @ sK12 ) @ sK12 ) )
& ( ( singleton @ sK12 )
= $true ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X1,sK12)],[f52]) ).
thf(f54,plain,
! [X2: $i,X3: $i] :
( ( ( iskpair @ ( kpair @ X3 @ X2 ) )
= $true )
| ( kpairp != $true ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f56,plain,
! [X1: $i] :
( ( $true
!= ( iskpair @ X1 ) )
| ( $true
= ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X1 ) @ Y0 )
= X1 ) ) ) )
| ( ksndsingleton != $true ) ),
inference(cnf_transformation,[],[f42]) ).
thf(f61,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
!= $true )
| ( ( X2 @ X1 )
= $true )
| ( dsetconstrER != $true ) ),
inference(cnf_transformation,[],[f45]) ).
thf(f62,plain,
( ksnd
= ( ^ [Y0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ Y0 )
@ ^ [Y1: $i] :
( ( kpair @ ( kfst @ Y0 ) @ Y1 )
= Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f63,plain,
( ( ksnd @ ( kpair @ sK7 @ sK6 ) )
!= sK6 ),
inference(cnf_transformation,[],[f47]) ).
thf(f64,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f47]) ).
thf(f65,plain,
ksndsingleton = $true,
inference(cnf_transformation,[],[f47]) ).
thf(f66,plain,
kpairp = $true,
inference(cnf_transformation,[],[f47]) ).
thf(f67,plain,
setukpairinjR = $true,
inference(cnf_transformation,[],[f47]) ).
thf(f68,plain,
theprop = $true,
inference(cnf_transformation,[],[f47]) ).
thf(f71,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( kpair @ X3 @ X1 )
!= ( kpair @ X2 @ X0 ) )
| ( setukpairinjR != $true ) ),
inference(cnf_transformation,[],[f50]) ).
thf(f74,plain,
! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true )
| ( theprop != $true ) ),
inference(cnf_transformation,[],[f53]) ).
thf(f78,plain,
! [X2: $i,X3: $i] :
( ( $true != $true )
| ( ( iskpair @ ( kpair @ X3 @ X2 ) )
= $true ) ),
inference(definition_unfolding,[],[f54,f66]) ).
thf(f81,plain,
! [X1: $i] :
( ( $true != $true )
| ( $true
!= ( iskpair @ X1 ) )
| ( $true
= ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X1 ) @ Y0 )
= X1 ) ) ) ) ),
inference(definition_unfolding,[],[f56,f65]) ).
thf(f82,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
!= $true )
| ( ( X2 @ X1 )
= $true )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f61,f64]) ).
thf(f85,plain,
( sK6
!= ( ^ [Y0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ Y0 )
@ ^ [Y1: $i] :
( ( kpair @ ( kfst @ Y0 ) @ Y1 )
= Y0 ) ) )
@ ( kpair @ sK7 @ sK6 ) ) ),
inference(definition_unfolding,[],[f63,f62]) ).
thf(f86,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( $true != $true )
| ( ( kpair @ X3 @ X1 )
!= ( kpair @ X2 @ X0 ) )
| ( X0 = X1 ) ),
inference(definition_unfolding,[],[f71,f67]) ).
thf(f89,plain,
! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( $true != $true )
| ( ( singleton @ X0 )
!= $true ) ),
inference(definition_unfolding,[],[f74,f68]) ).
thf(f92,plain,
! [X1: $i] :
( ( $true
= ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ X1 ) @ Y0 )
= X1 ) ) ) )
| ( $true
!= ( iskpair @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f81]) ).
thf(f93,plain,
! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f94,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( ( X2 @ X1 )
= $true )
| ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) )
!= $true ) ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f95,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( $true
!= ( in @ X1 @ ( dsetconstr @ X0 @ X2 ) ) )
| ( ( X2 @ X1 )
= $true ) ),
inference(beta-eta_normalization,[],[f94]) ).
thf(f96,plain,
( ( setunion
@ ( dsetconstr @ ( setunion @ ( kpair @ sK7 @ sK6 ) )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ ( kpair @ sK7 @ sK6 ) ) @ Y0 )
= ( kpair @ sK7 @ sK6 ) ) ) )
!= sK6 ),
inference(beta-eta_normalization,[],[f85]) ).
thf(f97,plain,
! [X2: $i,X3: $i] :
( ( iskpair @ ( kpair @ X3 @ X2 ) )
= $true ),
inference(trivial_inequality_removal,[],[f78]) ).
thf(f98,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ( ( kpair @ X3 @ X1 )
!= ( kpair @ X2 @ X0 ) )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f100,plain,
! [X0: $i,X1: $i] :
( $true
= ( singleton
@ ( dsetconstr @ ( setunion @ ( kpair @ X0 @ X1 ) )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) ) @ Y0 )
= ( kpair @ X0 @ X1 ) ) ) ) ),
inference(unit_resulting_resolution,[],[f92,f97]) ).
thf(f103,plain,
! [X0: $i,X1: $i] :
( $true
= ( in
@ ( setunion
@ ( dsetconstr @ ( setunion @ ( kpair @ X0 @ X1 ) )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) ) @ Y0 )
= ( kpair @ X0 @ X1 ) ) ) )
@ ( dsetconstr @ ( setunion @ ( kpair @ X0 @ X1 ) )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) ) @ Y0 )
= ( kpair @ X0 @ X1 ) ) ) ) ),
inference(unit_resulting_resolution,[],[f93,f100]) ).
thf(f110,plain,
! [X0: $i,X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) ) @ Y0 )
= ( kpair @ X0 @ X1 ) )
@ ( setunion
@ ( dsetconstr @ ( setunion @ ( kpair @ X0 @ X1 ) )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) ) @ Y0 )
= ( kpair @ X0 @ X1 ) ) ) ) ) ),
inference(unit_resulting_resolution,[],[f95,f103]) ).
thf(f111,plain,
! [X0: $i,X1: $i] :
( ( ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) )
@ ( setunion
@ ( dsetconstr @ ( setunion @ ( kpair @ X0 @ X1 ) )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) ) @ Y0 )
= ( kpair @ X0 @ X1 ) ) ) ) )
= ( kpair @ X0 @ X1 ) )
= $true ),
inference(beta-eta_normalization,[],[f110]) ).
thf(f112,plain,
! [X0: $i,X1: $i] :
( ( kpair @ X0 @ X1 )
= ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) )
@ ( setunion
@ ( dsetconstr @ ( setunion @ ( kpair @ X0 @ X1 ) )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) ) @ Y0 )
= ( kpair @ X0 @ X1 ) ) ) ) ) ),
inference(equality_proxy_clausification,[],[f111]) ).
thf(f114,plain,
! [X0: $i,X1: $i] :
( ( setunion
@ ( dsetconstr @ ( setunion @ ( kpair @ X0 @ X1 ) )
@ ^ [Y0: $i] :
( ( kpair @ ( kfst @ ( kpair @ X0 @ X1 ) ) @ Y0 )
= ( kpair @ X0 @ X1 ) ) ) )
= X1 ),
inference(unit_resulting_resolution,[],[f98,f112]) ).
thf(f119,plain,
sK6 != sK6,
inference(backward_demodulation,[],[f96,f114]) ).
thf(f122,plain,
$false,
inference(trivial_inequality_removal,[],[f119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU656^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n009.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 14:03:30 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 Running higher-order theorem proving
% 0.10/0.21 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.21/0.34 % (4051011)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.34 % (4051018)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3019643739:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.34 % (4051018)Instruction limit reached!
% 0.21/0.34 % (4051018)------------------------------
% 0.21/0.34 % (4051018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051018)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051018)Termination reason: Instruction limit
% 0.21/0.34 % (4051018)Termination phase: Saturation
% 0.21/0.34 % (4051018)Time elapsed: 0.002 s
% 0.21/0.34 % (4051018)Peak memory usage: 11 MB
% 0.21/0.34 % (4051018)Instructions burned: 6 (million)
% 0.21/0.34 % (4051017)lrs+10_16_si=on:nwc=1.5:random_seed=3119146422:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.34 % (4051016)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2877535059:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.34 % (4051019)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=672842913: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.21/0.34 % (4051020)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1879069252:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.34 % (4051021)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3356784440:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.34 % (4051024)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=1499889886:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.34 % (4051024)Instruction limit reached!
% 0.21/0.34 % (4051024)------------------------------
% 0.21/0.34 % (4051024)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051024)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051024)Termination reason: Instruction limit
% 0.21/0.34 % (4051024)Termination phase: Property scanning
% 0.21/0.34 % (4051024)Time elapsed: 0.001 s
% 0.21/0.34 % (4051024)Peak memory usage: 10 MB
% 0.21/0.34 % (4051024)Instructions burned: 4 (million)
% 0.21/0.34 % (4051022)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.21/0.34 % (4051022)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.21/0.34 % (4051017)Instruction limit reached!
% 0.21/0.34 % (4051017)------------------------------
% 0.21/0.34 % (4051017)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051017)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051017)Termination reason: Instruction limit
% 0.21/0.34 % (4051017)Termination phase: Saturation
% 0.21/0.34 % (4051017)Time elapsed: 0.010 s
% 0.21/0.34 % (4051017)Peak memory usage: 12 MB
% 0.21/0.34 % (4051017)Instructions burned: 20 (million)
% 0.21/0.34 % (4051022)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=455071112:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.34 % (4051020)Instruction limit reached!
% 0.21/0.34 % (4051020)------------------------------
% 0.21/0.34 % (4051020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051020)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051020)Termination reason: Instruction limit
% 0.21/0.34 % (4051020)Termination phase: Saturation
% 0.21/0.34 % (4051020)Time elapsed: 0.015 s
% 0.21/0.34 % (4051020)Peak memory usage: 12 MB
% 0.21/0.34 % (4051020)Instructions burned: 24 (million)
% 0.21/0.34 % (4051031)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=1022384678:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.21/0.34 % (4051031)Instruction limit reached!
% 0.21/0.34 % (4051031)------------------------------
% 0.21/0.34 % (4051031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051031)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051031)Termination reason: Instruction limit
% 0.21/0.34 % (4051031)Termination phase: Saturation
% 0.21/0.34 % (4051031)Time elapsed: 0.002 s
% 0.21/0.34 % (4051031)Peak memory usage: 11 MB
% 0.21/0.34 % (4051031)Instructions burned: 8 (million)
% 0.21/0.34 % (4051032)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.21/0.34 % (4051036)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.21/0.34 % (4051036)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.21/0.34 % (4051032)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=279919938:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.21/0.34 % (4051036)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=4123716542:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.21/0.34 % (4051032)Instruction limit reached!
% 0.21/0.34 % (4051032)------------------------------
% 0.21/0.34 % (4051032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051032)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051032)Termination reason: Instruction limit
% 0.21/0.34 % (4051032)Termination phase: Saturation
% 0.21/0.34 % (4051032)Time elapsed: 0.004 s
% 0.21/0.34 % (4051032)Peak memory usage: 12 MB
% 0.21/0.34 % (4051032)Instructions burned: 8 (million)
% 0.21/0.34 % (4051034)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=3373415983:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.21/0.34 % (4051036)Instruction limit reached!
% 0.21/0.34 % (4051036)------------------------------
% 0.21/0.34 % (4051036)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051036)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051036)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051036)Termination reason: Instruction limit
% 0.21/0.34 % (4051036)Termination phase: Saturation
% 0.21/0.34 % (4051036)Time elapsed: 0.007 s
% 0.21/0.34 % (4051036)Peak memory usage: 12 MB
% 0.21/0.34 % (4051036)Instructions burned: 29 (million)
% 0.21/0.34 % (4051021)Instruction limit reached!
% 0.21/0.34 % (4051021)------------------------------
% 0.21/0.34 % (4051021)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051021)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051021)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051021)Termination reason: Instruction limit
% 0.21/0.34 % (4051021)Termination phase: Saturation
% 0.21/0.34 % (4051021)Time elapsed: 0.038 s
% 0.21/0.34 % (4051021)Peak memory usage: 13 MB
% 0.21/0.34 % (4051021)Instructions burned: 76 (million)
% 0.21/0.34 % (4051034)Instruction limit reached!
% 0.21/0.34 % (4051034)------------------------------
% 0.21/0.34 % (4051034)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051034)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051034)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051034)Termination reason: Instruction limit
% 0.21/0.34 % (4051034)Termination phase: Saturation
% 0.21/0.34 % (4051034)Time elapsed: 0.007 s
% 0.21/0.34 % (4051034)Peak memory usage: 12 MB
% 0.21/0.34 % (4051034)Instructions burned: 13 (million)
% 0.21/0.34 % (4051016)Instruction limit reached!
% 0.21/0.34 % (4051016)------------------------------
% 0.21/0.34 % (4051016)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051016)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051016)Termination reason: Instruction limit
% 0.21/0.34 % (4051016)Termination phase: Saturation
% 0.21/0.34 % (4051016)Time elapsed: 0.043 s
% 0.21/0.34 % (4051016)Peak memory usage: 12 MB
% 0.21/0.34 % (4051016)Instructions burned: 88 (million)
% 0.21/0.34 % (4051039)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=228939713:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.21/0.34 % (4051042)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.21/0.34 % (4051041)lrs+10_1_si=on:cs=on:random_seed=2338108509:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.21/0.34 % (4051042)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=1938007539:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.34 % (4051041)Instruction limit reached!
% 0.21/0.34 % (4051041)------------------------------
% 0.21/0.34 % (4051041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051041)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051041)Termination reason: Instruction limit
% 0.21/0.34 % (4051041)Termination phase: Saturation
% 0.21/0.34 % (4051041)Time elapsed: 0.004 s
% 0.21/0.34 % (4051041)Peak memory usage: 12 MB
% 0.21/0.34 % (4051041)Instructions burned: 8 (million)
% 0.21/0.34 % (4051044)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=3899805775:st=2:i=249:sd=1:rtra=on:ss=axioms_2999 on theBenchmark for (2999ds/249Mi)
% 0.21/0.34 % (4051042)Instruction limit reached!
% 0.21/0.34 % (4051042)------------------------------
% 0.21/0.34 % (4051042)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051042)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051042)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051042)Termination reason: Instruction limit
% 0.21/0.34 % (4051042)Termination phase: Saturation
% 0.21/0.34 % (4051042)Time elapsed: 0.003 s
% 0.21/0.34 % (4051042)Peak memory usage: 11 MB
% 0.21/0.34 % (4051042)Instructions burned: 6 (million)
% 0.21/0.34 % (4051043)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=1855374386:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.21/0.34 % (4051044)Refutation not found, incomplete strategy
% 0.21/0.34 % (4051044)------------------------------
% 0.21/0.34 % (4051044)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051044)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051044)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.34 % (4051044)Time elapsed: 0.005 s
% 0.21/0.34 % (4051044)Peak memory usage: 12 MB
% 0.21/0.34 % (4051044)Instructions burned: 9 (million)
% 0.21/0.34 % (4051044)------------------------------
% 0.21/0.34 % (4051044)------------------------------
% 0.21/0.34 % (4051043) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4051011-4051043"...
% 0.21/0.34 % (4051039)Refutation not found, incomplete strategy
% 0.21/0.34 % (4051039)------------------------------
% 0.21/0.34 % (4051039)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051039)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051039)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.34 % (4051039)Time elapsed: 0.017 s
% 0.21/0.34 % (4051039)Peak memory usage: 12 MB
% 0.21/0.34 % (4051039)Instructions burned: 36 (million)
% 0.21/0.34 % (4051039)------------------------------
% 0.21/0.34 % (4051039)------------------------------
% 0.21/0.34 % (4051043)...printing done.
% 0.21/0.34 % (4051043)Refutation found. Thanks to Tanya!
% 0.21/0.34 % SZS status Theorem for theBenchmark
% 0.21/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.34 % (4051043)------------------------------
% 0.21/0.34 % (4051043)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (4051043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (4051043)CaDiCaL version: 2.1.3
% 0.21/0.34 % (4051043)Termination reason: Refutation
% 0.21/0.34 % (4051043)Time elapsed: 0.009 s
% 0.21/0.34 % (4051043)Peak memory usage: 12 MB
% 0.21/0.34 % (4051043)Instructions burned: 15 (million)
% 0.21/0.34 % (4051011)Success in time 0.12 s
% 0.21/0.34 % Vampire exiting
%------------------------------------------------------------------------------