%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU645^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 : n001.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:29 AM UTC 2026
% Result : Theorem 0.21s 0.34s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 81 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 800 ( 216 equ; 0 cnn)
% Maximal formula atoms : 6 ( 9 avg)
% Number of connectives : 1074 ( 80 ~; 69 |; 47 &; 837 @)
% ( 9 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 38 ( 35 usr; 19 con; 0-4 aty)
% Number of variables : 203 ( 56 ^; 121 !; 26 ?; 203 :)
% 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,
setukpairinjL1: $o ).
thf(func_def_12,type,
kfstsingleton: $o ).
thf(func_def_13,type,
theprop: $o ).
thf(func_def_14,type,
kfst: $i > $i ).
thf(func_def_17,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_20,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_21,type,
vAND: $o > $o > $o ).
thf(func_def_22,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_23,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_30,type,
sK6: $i > $o ).
thf(func_def_36,type,
vNOT: $o > $o ).
thf(f1,axiom,
( dsetconstrER
= ( ! [X2: $i,X1: $i > $o,X0: $i] :
( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(f3,axiom,
( ( ^ [X0: $i,X1: $i] : ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
= kpair ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpair) ).
thf(f4,axiom,
! [X0: $i,X1: $i] :
( ( iskpair @ ( kpair @ X0 @ X1 ) )
= kpairp ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kpairp) ).
thf(f6,axiom,
! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
=> ( X0 = X2 ) )
= setukpairinjL1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setukpairinjL1) ).
thf(f7,axiom,
! [X0: $i] :
( ( ( iskpair @ X0 )
=> ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [X1: $i] : ( in @ ( setadjoin @ X1 @ emptyset ) @ X0 ) ) ) )
= kfstsingleton ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfstsingleton) ).
thf(f8,axiom,
( theprop
= ( ! [X0: $i] :
( ( singleton @ X0 )
=> ( in @ ( setunion @ X0 ) @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theprop) ).
thf(f9,axiom,
( kfst
= ( ^ [X0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [X1: $i] : ( in @ ( setadjoin @ X1 @ emptyset ) @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfst) ).
thf(f10,conjecture,
( dsetconstrER
=> ( kpairp
=> ( setukpairinjL1
=> ( kfstsingleton
=> ( theprop
=> ! [X1: $i,X0: $i] :
( ( kfst @ ( kpair @ X0 @ X1 ) )
= X0 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfstpairEq) ).
thf(f11,negated_conjecture,
~ ( dsetconstrER
=> ( kpairp
=> ( setukpairinjL1
=> ( kfstsingleton
=> ( theprop
=> ! [X1: $i,X0: $i] :
( ( kfst @ ( kpair @ X0 @ X1 ) )
= X0 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
thf(f12,plain,
! [X0: $i,X1: $i] :
( ( iskpair @ ( kpair @ X0 @ X1 ) )
= kpairp ),
inference(rectify,[],[f4]) ).
thf(f13,plain,
( ( kpairp = $true )
<=> ! [X1: $i,X0: $i] :
( ( iskpair @ ( kpair @ X0 @ X1 ) )
= $true ) ),
inference(fool_elimination,[],[f12]) ).
thf(f14,plain,
( kpair
= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f15,plain,
( dsetconstrER
= ( ! [X0: $i,X1: $i > $o,X2: $i] :
( ( in @ X0
@ ( dsetconstr @ X2
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X0 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f16,plain,
( ( dsetconstrER = $true )
<=> ! [X2: $i,X0: $i,X1: $i > $o] :
( ( ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
= $true )
=> ( ( X1 @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f17,plain,
( theprop
= ( ! [X0: $i] :
( ( singleton @ X0 )
=> ( in @ ( setunion @ X0 ) @ X0 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f18,plain,
( ( theprop = $true )
<=> ! [X0: $i] :
( ( ( singleton @ X0 )
= $true )
=> ( ( in @ ( setunion @ X0 ) @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f17]) ).
thf(f19,plain,
! [X0: $i] :
( ( ( iskpair @ X0 )
=> ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [X1: $i] : ( in @ ( setadjoin @ X1 @ emptyset ) @ X0 ) ) ) )
= kfstsingleton ),
inference(rectify,[],[f7]) ).
thf(f20,plain,
( ! [X0: $i] :
( ( ( iskpair @ X0 )
= $true )
=> ( ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X0 ) ) )
= $true ) )
<=> ( kfstsingleton = $true ) ),
inference(fool_elimination,[],[f19]) ).
thf(f25,plain,
~ ( dsetconstrER
=> ( kpairp
=> ( setukpairinjL1
=> ( kfstsingleton
=> ( theprop
=> ! [X0: $i,X1: $i] :
( ( kfst @ ( kpair @ X1 @ X0 ) )
= X1 ) ) ) ) ) ),
inference(rectify,[],[f11]) ).
thf(f26,plain,
~ ( ( dsetconstrER = $true )
=> ( ( kpairp = $true )
=> ( ( setukpairinjL1 = $true )
=> ( ( kfstsingleton = $true )
=> ( ( theprop = $true )
=> ! [X0: $i,X1: $i] :
( ( kfst @ ( kpair @ X1 @ X0 ) )
= X1 ) ) ) ) ) ),
inference(fool_elimination,[],[f25]) ).
thf(f27,plain,
( kfst
= ( ^ [X0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [X1: $i] : ( in @ ( setadjoin @ X1 @ emptyset ) @ X0 ) ) ) ) ),
inference(rectify,[],[f9]) ).
thf(f28,plain,
( kfst
= ( ^ [Y0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ Y0 )
@ ^ [Y1: $i] : ( in @ ( setadjoin @ Y1 @ emptyset ) @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f27]) ).
thf(f29,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) ) )
=> ( X1 = X2 ) )
= setukpairinjL1 ),
inference(rectify,[],[f6]) ).
thf(f30,plain,
( ( setukpairinjL1 = $true )
<=> ! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) ) )
= $true )
=> ( X1 = X2 ) ) ),
inference(fool_elimination,[],[f29]) ).
thf(f31,plain,
( ( dsetconstrER = $true )
<=> ! [X2: $i,X1: $i > $o,X0: $i] :
( ( ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
!= $true )
| ( ( X1 @ X0 )
= $true ) ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f32,plain,
( ? [X1: $i,X0: $i] :
( ( kfst @ ( kpair @ X1 @ X0 ) )
!= X1 )
& ( theprop = $true )
& ( kfstsingleton = $true )
& ( setukpairinjL1 = $true )
& ( kpairp = $true )
& ( dsetconstrER = $true ) ),
inference(ennf_transformation,[],[f26]) ).
thf(f33,plain,
( ( kfstsingleton = $true )
& ( theprop = $true )
& ( kpairp = $true )
& ( dsetconstrER = $true )
& ? [X1: $i,X0: $i] :
( ( kfst @ ( kpair @ X1 @ X0 ) )
!= X1 )
& ( setukpairinjL1 = $true ) ),
inference(flattening,[],[f32]) ).
thf(f34,plain,
( ! [X2: $i,X1: $i,X0: $i] :
( ( X1 = X2 )
| ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) ) )
!= $true ) )
<=> ( setukpairinjL1 = $true ) ),
inference(ennf_transformation,[],[f30]) ).
thf(f35,plain,
( ( kfstsingleton = $true )
<=> ! [X0: $i] :
( ( ( iskpair @ X0 )
!= $true )
| ( ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X0 ) ) )
= $true ) ) ),
inference(ennf_transformation,[],[f20]) ).
thf(f36,plain,
( ! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true ) )
<=> ( theprop = $true ) ),
inference(ennf_transformation,[],[f18]) ).
thf(f37,plain,
( ( ( kpairp = $true )
| ? [X1: $i,X0: $i] :
( ( iskpair @ ( kpair @ X0 @ X1 ) )
!= $true ) )
& ( ! [X1: $i,X0: $i] :
( ( iskpair @ ( kpair @ X0 @ X1 ) )
= $true )
| ( kpairp != $true ) ) ),
inference(nnf_transformation,[],[f13]) ).
thf(f38,plain,
( ( ( kpairp = $true )
| ? [X0: $i,X1: $i] :
( ( iskpair @ ( kpair @ X1 @ X0 ) )
!= $true ) )
& ( ! [X2: $i,X3: $i] :
( $true
= ( iskpair @ ( kpair @ X3 @ X2 ) ) )
| ( kpairp != $true ) ) ),
inference(rectify,[],[f37]) ).
thf(f39,plain,
( ( ( kpairp = $true )
| ( ( iskpair @ ( kpair @ sK1 @ sK0 ) )
!= $true ) )
& ( ! [X2: $i,X3: $i] :
( $true
= ( iskpair @ ( kpair @ X3 @ X2 ) ) )
| ( kpairp != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f38]) ).
thf(f40,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,[],[f36]) ).
thf(f41,plain,
( ( ! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true ) )
| ( theprop != $true ) )
& ( ( theprop = $true )
| ? [X1: $i] :
( ( ( in @ ( setunion @ X1 ) @ X1 )
!= $true )
& ( $true
= ( singleton @ X1 ) ) ) ) ),
inference(rectify,[],[f40]) ).
thf(f42,plain,
( ( ! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true ) )
| ( theprop != $true ) )
& ( ( theprop = $true )
| ( ( ( in @ ( setunion @ sK2 ) @ sK2 )
!= $true )
& ( ( singleton @ sK2 )
= $true ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2)],[f41]) ).
thf(f43,plain,
( ( kfstsingleton = $true )
& ( theprop = $true )
& ( kpairp = $true )
& ( dsetconstrER = $true )
& ? [X0: $i,X1: $i] :
( ( kfst @ ( kpair @ X0 @ X1 ) )
!= X0 )
& ( setukpairinjL1 = $true ) ),
inference(rectify,[],[f33]) ).
thf(f44,plain,
( ( kfstsingleton = $true )
& ( theprop = $true )
& ( kpairp = $true )
& ( dsetconstrER = $true )
& ( sK3
!= ( kfst @ ( kpair @ sK3 @ sK4 ) ) )
& ( setukpairinjL1 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f43]) ).
thf(f45,plain,
( ( ( dsetconstrER = $true )
| ? [X2: $i,X1: $i > $o,X0: $i] :
( ( ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
= $true )
& ( ( X1 @ X0 )
!= $true ) ) )
& ( ! [X2: $i,X1: $i > $o,X0: $i] :
( ( ( in @ X0
@ ( dsetconstr @ X2
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
!= $true )
| ( ( X1 @ X0 )
= $true ) )
| ( dsetconstrER != $true ) ) ),
inference(nnf_transformation,[],[f31]) ).
thf(f46,plain,
( ( ( dsetconstrER = $true )
| ? [X0: $i,X1: $i > $o,X2: $i] :
( ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X1 @ Y0 ) ) )
= $true )
& ( ( X1 @ X2 )
!= $true ) ) )
& ( ! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true )
| ( ( X4 @ X5 )
= $true ) )
| ( dsetconstrER != $true ) ) ),
inference(rectify,[],[f45]) ).
thf(f47,plain,
( ( ( dsetconstrER = $true )
| ( ( $true
= ( in @ sK7
@ ( dsetconstr @ sK5
@ ^ [Y0: $i] : ( sK6 @ Y0 ) ) ) )
& ( ( sK6 @ sK7 )
!= $true ) ) )
& ( ! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true )
| ( ( X4 @ X5 )
= $true ) )
| ( dsetconstrER != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7)],[f46]) ).
thf(f48,plain,
( ( ! [X2: $i,X1: $i,X0: $i] :
( ( X1 = X2 )
| ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) ) )
!= $true ) )
| ( setukpairinjL1 != $true ) )
& ( ( setukpairinjL1 = $true )
| ? [X2: $i,X1: $i,X0: $i] :
( ( X1 != X2 )
& ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) ) )
= $true ) ) ) ),
inference(nnf_transformation,[],[f34]) ).
thf(f49,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X1 )
| ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
!= $true ) )
| ( setukpairinjL1 != $true ) )
& ( ( setukpairinjL1 = $true )
| ? [X3: $i,X4: $i,X5: $i] :
( ( X3 != X4 )
& ( ( in @ ( setadjoin @ X4 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X5 @ emptyset ) ) @ emptyset ) ) )
= $true ) ) ) ),
inference(rectify,[],[f48]) ).
thf(f50,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X1 )
| ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
!= $true ) )
| ( setukpairinjL1 != $true ) )
& ( ( setukpairinjL1 = $true )
| ( ( sK9 != sK8 )
& ( ( in @ ( setadjoin @ sK9 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK8 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK8 @ ( setadjoin @ sK10 @ emptyset ) ) @ emptyset ) ) )
= $true ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10]),skolemize(X3,sK8),skolemize(X4,sK9),skolemize(X5,sK10)],[f49]) ).
thf(f51,plain,
( ( ( kfstsingleton = $true )
| ? [X0: $i] :
( ( ( iskpair @ X0 )
= $true )
& ( ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X0 ) ) )
!= $true ) ) )
& ( ! [X0: $i] :
( ( ( iskpair @ X0 )
!= $true )
| ( ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X0 ) ) )
= $true ) )
| ( kfstsingleton != $true ) ) ),
inference(nnf_transformation,[],[f35]) ).
thf(f52,plain,
( ( ( kfstsingleton = $true )
| ? [X0: $i] :
( ( ( iskpair @ X0 )
= $true )
& ( ( singleton
@ ( dsetconstr @ ( setunion @ X0 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X0 ) ) )
!= $true ) ) )
& ( ! [X1: $i] :
( ( ( iskpair @ X1 )
!= $true )
| ( ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X1 ) ) )
= $true ) )
| ( kfstsingleton != $true ) ) ),
inference(rectify,[],[f51]) ).
thf(f53,plain,
( ( ( kfstsingleton = $true )
| ( ( ( iskpair @ sK11 )
= $true )
& ( ( singleton
@ ( dsetconstr @ ( setunion @ sK11 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ sK11 ) ) )
!= $true ) ) )
& ( ! [X1: $i] :
( ( ( iskpair @ X1 )
!= $true )
| ( ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X1 ) ) )
= $true ) )
| ( kfstsingleton != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X0,sK11)],[f52]) ).
thf(f54,plain,
! [X2: $i,X3: $i] :
( ( $true
= ( iskpair @ ( kpair @ X3 @ X2 ) ) )
| ( kpairp != $true ) ),
inference(cnf_transformation,[],[f39]) ).
thf(f56,plain,
( kfst
= ( ^ [Y0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ Y0 )
@ ^ [Y1: $i] : ( in @ ( setadjoin @ Y1 @ emptyset ) @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f57,plain,
( kpair
= ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f60,plain,
! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true )
| ( theprop != $true ) ),
inference(cnf_transformation,[],[f42]) ).
thf(f61,plain,
setukpairinjL1 = $true,
inference(cnf_transformation,[],[f44]) ).
thf(f62,plain,
( sK3
!= ( kfst @ ( kpair @ sK3 @ sK4 ) ) ),
inference(cnf_transformation,[],[f44]) ).
thf(f63,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f44]) ).
thf(f64,plain,
kpairp = $true,
inference(cnf_transformation,[],[f44]) ).
thf(f65,plain,
theprop = $true,
inference(cnf_transformation,[],[f44]) ).
thf(f66,plain,
kfstsingleton = $true,
inference(cnf_transformation,[],[f44]) ).
thf(f67,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true )
| ( ( X4 @ X5 )
= $true )
| ( dsetconstrER != $true ) ),
inference(cnf_transformation,[],[f47]) ).
thf(f72,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
!= $true )
| ( setukpairinjL1 != $true ) ),
inference(cnf_transformation,[],[f50]) ).
thf(f73,plain,
! [X1: $i] :
( ( ( iskpair @ X1 )
!= $true )
| ( ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X1 ) ) )
= $true )
| ( kfstsingleton != $true ) ),
inference(cnf_transformation,[],[f53]) ).
thf(f79,plain,
! [X2: $i,X3: $i] :
( ( ( iskpair
@ ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ X3
@ X2 ) )
= $true )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f54,f57,f64]) ).
thf(f80,plain,
! [X0: $i] :
( ( $true != $true )
| ( ( singleton @ X0 )
!= $true )
| ( ( in @ ( setunion @ X0 ) @ X0 )
= $true ) ),
inference(definition_unfolding,[],[f60,f65]) ).
thf(f83,plain,
( sK3
!= ( ^ [Y0: $i] :
( setunion
@ ( dsetconstr @ ( setunion @ Y0 )
@ ^ [Y1: $i] : ( in @ ( setadjoin @ Y1 @ emptyset ) @ Y0 ) ) )
@ ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ sK3
@ sK4 ) ) ),
inference(definition_unfolding,[],[f62,f56,f57]) ).
thf(f86,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( $true != $true )
| ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true )
| ( ( X4 @ X5 )
= $true ) ),
inference(definition_unfolding,[],[f67,f63]) ).
thf(f87,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
!= $true )
| ( $true != $true )
| ( X0 = X1 ) ),
inference(definition_unfolding,[],[f72,f61]) ).
thf(f92,plain,
! [X1: $i] :
( ( $true != $true )
| ( ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X1 ) ) )
= $true )
| ( ( iskpair @ X1 )
!= $true ) ),
inference(definition_unfolding,[],[f73,f66]) ).
thf(f93,plain,
! [X1: $i] :
( ( ( singleton
@ ( dsetconstr @ ( setunion @ X1 )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ X1 ) ) )
= $true )
| ( ( iskpair @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f92]) ).
thf(f94,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( in @ X5
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X4 @ Y0 ) ) )
!= $true )
| ( ( X4 @ X5 )
= $true ) ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f95,plain,
! [X3: $i,X4: $i > $o,X5: $i] :
( ( ( in @ X5 @ ( dsetconstr @ X3 @ X4 ) )
!= $true )
| ( ( X4 @ X5 )
= $true ) ),
inference(beta-eta_normalization,[],[f94]) ).
thf(f96,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
!= $true )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f87]) ).
thf(f97,plain,
! [X0: $i] :
( ( ( in @ ( setunion @ X0 ) @ X0 )
= $true )
| ( ( singleton @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f98,plain,
! [X2: $i,X3: $i] :
( ( iskpair
@ ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
@ X3
@ X2 ) )
= $true ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f99,plain,
! [X2: $i,X3: $i] :
( $true
= ( iskpair @ ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ),
inference(beta-eta_normalization,[],[f98]) ).
thf(f100,plain,
( sK3
!= ( setunion
@ ( dsetconstr @ ( setunion @ ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK4 @ emptyset ) ) @ emptyset ) ) )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK4 @ emptyset ) ) @ emptyset ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f83]) ).
thf(f101,plain,
! [X0: $i,X1: $i] :
( ( singleton
@ ( dsetconstr @ ( setunion @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) ) ) )
= $true ),
inference(unit_resulting_resolution,[],[f93,f99]) ).
thf(f104,plain,
! [X0: $i,X1: $i] :
( $true
= ( in
@ ( setunion
@ ( dsetconstr @ ( setunion @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) ) ) )
@ ( dsetconstr @ ( setunion @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) ) ) ) ),
inference(unit_resulting_resolution,[],[f97,f101]) ).
thf(f108,plain,
! [X0: $i,X1: $i] :
( ( ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
@ ( setunion
@ ( dsetconstr @ ( setunion @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) ) ) ) )
= $true ),
inference(unit_resulting_resolution,[],[f95,f104]) ).
thf(f109,plain,
! [X0: $i,X1: $i] :
( $true
= ( in
@ ( setadjoin
@ ( setunion
@ ( dsetconstr @ ( setunion @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) ) ) )
@ emptyset )
@ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) ) ),
inference(beta-eta_normalization,[],[f108]) ).
thf(f111,plain,
! [X0: $i,X1: $i] :
( ( setunion
@ ( dsetconstr @ ( setunion @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
@ ^ [Y0: $i] : ( in @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) ) ) )
= X0 ),
inference(unit_resulting_resolution,[],[f96,f109]) ).
thf(f112,plain,
sK3 != sK3,
inference(backward_demodulation,[],[f100,f111]) ).
thf(f121,plain,
$false,
inference(trivial_inequality_removal,[],[f112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU645^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.17 % Computer : n001.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:35 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 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 % (1294541)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.34 % (1294551)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1212326257:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.34 % (1294546)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=506125718:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.34 % (1294547)lrs+10_16_si=on:nwc=1.5:random_seed=2880551444:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.34 % (1294548)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2920498639:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.34 % (1294550)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2732379730:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.34 % (1294548)Instruction limit reached!
% 0.21/0.34 % (1294548)------------------------------
% 0.21/0.34 % (1294548)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294548)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294548)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294548)Termination reason: Instruction limit
% 0.21/0.34 % (1294548)Termination phase: Saturation
% 0.21/0.34 % (1294548)Time elapsed: 0.002 s
% 0.21/0.34 % (1294548)Peak memory usage: 10 MB
% 0.21/0.34 % (1294548)Instructions burned: 4 (million)
% 0.21/0.34 % (1294549)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=2195196005: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 % (1294552)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 % (1294552)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 % (1294547)Instruction limit reached!
% 0.21/0.34 % (1294547)------------------------------
% 0.21/0.34 % (1294547)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294547)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294547)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294547)Termination reason: Instruction limit
% 0.21/0.34 % (1294547)Termination phase: Saturation
% 0.21/0.34 % (1294547)Time elapsed: 0.011 s
% 0.21/0.34 % (1294547)Peak memory usage: 12 MB
% 0.21/0.34 % (1294547)Instructions burned: 19 (million)
% 0.21/0.34 % (1294552)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=2308445760:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.34 % (1294550)Instruction limit reached!
% 0.21/0.34 % (1294550)------------------------------
% 0.21/0.34 % (1294550)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294550)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294550)Termination reason: Instruction limit
% 0.21/0.34 % (1294550)Termination phase: Saturation
% 0.21/0.34 % (1294550)Time elapsed: 0.015 s
% 0.21/0.34 % (1294550)Peak memory usage: 11 MB
% 0.21/0.34 % (1294550)Instructions burned: 25 (million)
% 0.21/0.34 % (1294559)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=960334225:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.34 % (1294559)Instruction limit reached!
% 0.21/0.34 % (1294559)------------------------------
% 0.21/0.34 % (1294559)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294559)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294559)Termination reason: Instruction limit
% 0.21/0.34 % (1294559)Termination phase: Property scanning
% 0.21/0.34 % (1294559)Time elapsed: 0.001 s
% 0.21/0.34 % (1294559)Peak memory usage: 11 MB
% 0.21/0.34 % (1294559)Instructions burned: 3 (million)
% 0.21/0.34 % (1294551)Instruction limit reached!
% 0.21/0.34 % (1294551)------------------------------
% 0.21/0.34 % (1294551)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294551)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294551)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294551)Termination reason: Instruction limit
% 0.21/0.34 % (1294551)Termination phase: Saturation
% 0.21/0.34 % (1294551)Time elapsed: 0.032 s
% 0.21/0.34 % (1294551)Peak memory usage: 13 MB
% 0.21/0.34 % (1294551)Instructions burned: 77 (million)
% 0.21/0.34 % (1294564)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2424230812:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.21/0.34 % (1294562)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 % (1294564)Instruction limit reached!
% 0.21/0.34 % (1294564)------------------------------
% 0.21/0.34 % (1294564)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294564)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294564)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294564)Termination reason: Instruction limit
% 0.21/0.34 % (1294564)Termination phase: Saturation
% 0.21/0.34 % (1294564)Time elapsed: 0.004 s
% 0.21/0.34 % (1294564)Peak memory usage: 12 MB
% 0.21/0.34 % (1294564)Instructions burned: 13 (million)
% 0.21/0.34 % (1294561)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=739925114:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.21/0.34 % (1294562)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=432480065: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 % (1294561)Instruction limit reached!
% 0.21/0.34 % (1294561)------------------------------
% 0.21/0.34 % (1294561)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294561)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294561)Termination reason: Instruction limit
% 0.21/0.34 % (1294561)Termination phase: Saturation
% 0.21/0.34 % (1294561)Time elapsed: 0.003 s
% 0.21/0.34 % (1294561)Peak memory usage: 11 MB
% 0.21/0.34 % (1294561)Instructions burned: 5 (million)
% 0.21/0.34 % (1294562)Instruction limit reached!
% 0.21/0.34 % (1294562)------------------------------
% 0.21/0.34 % (1294562)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294562)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294562)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294562)Termination reason: Instruction limit
% 0.21/0.34 % (1294562)Termination phase: Saturation
% 0.21/0.34 % (1294562)Time elapsed: 0.004 s
% 0.21/0.34 % (1294562)Peak memory usage: 12 MB
% 0.21/0.34 % (1294562)Instructions burned: 7 (million)
% 0.21/0.34 % (1294546)Instruction limit reached!
% 0.21/0.34 % (1294546)------------------------------
% 0.21/0.34 % (1294546)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294546)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294546)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294546)Termination reason: Instruction limit
% 0.21/0.34 % (1294546)Termination phase: Saturation
% 0.21/0.34 % (1294546)Time elapsed: 0.044 s
% 0.21/0.34 % (1294546)Peak memory usage: 12 MB
% 0.21/0.34 % (1294546)Instructions burned: 88 (million)
% 0.21/0.34 % (1294568)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=1372034076:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.21/0.34 % (1294566)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 % (1294566)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 % (1294566)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=4252429213: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 % (1294571)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 % (1294570)lrs+10_1_si=on:cs=on:random_seed=2876512708:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.21/0.34 % (1294571)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=785440892:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.34 % (1294571)Instruction limit reached!
% 0.21/0.34 % (1294571)------------------------------
% 0.21/0.34 % (1294571)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294571)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294571)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294571)Termination reason: Instruction limit
% 0.21/0.34 % (1294571)Termination phase: Saturation
% 0.21/0.34 % (1294571)Time elapsed: 0.003 s
% 0.21/0.34 % (1294571)Peak memory usage: 12 MB
% 0.21/0.34 % (1294571)Instructions burned: 6 (million)
% 0.21/0.34 % (1294570)Instruction limit reached!
% 0.21/0.34 % (1294570)------------------------------
% 0.21/0.34 % (1294570)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294570)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294570)Termination reason: Instruction limit
% 0.21/0.34 % (1294570)Termination phase: Saturation
% 0.21/0.34 % (1294570)Time elapsed: 0.004 s
% 0.21/0.34 % (1294570)Peak memory usage: 11 MB
% 0.21/0.34 % (1294570)Instructions burned: 8 (million)
% 0.21/0.34 % (1294572)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=2448306209:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.21/0.34 % (1294566)Instruction limit reached!
% 0.21/0.34 % (1294566)------------------------------
% 0.21/0.34 % (1294566)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294566)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294566)Termination reason: Instruction limit
% 0.21/0.34 % (1294566)Termination phase: Saturation
% 0.21/0.34 % (1294566)Time elapsed: 0.015 s
% 0.21/0.34 % (1294566)Peak memory usage: 12 MB
% 0.21/0.34 % (1294566)Instructions burned: 28 (million)
% 0.21/0.34 % (1294568)Instruction limit reached!
% 0.21/0.34 % (1294568)------------------------------
% 0.21/0.34 % (1294568)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294568)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294568)Termination reason: Instruction limit
% 0.21/0.34 % (1294568)Termination phase: Saturation
% 0.21/0.34 % (1294568)Time elapsed: 0.023 s
% 0.21/0.34 % (1294568)Peak memory usage: 12 MB
% 0.21/0.34 % (1294568)Instructions burned: 87 (million)
% 0.21/0.34 % (1294572) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1294541-1294572"...
% 0.21/0.34 % (1294572)...printing done.
% 0.21/0.34 % (1294572)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 % (1294572)------------------------------
% 0.21/0.34 % (1294572)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.34 % (1294572)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.34 % (1294572)CaDiCaL version: 2.1.3
% 0.21/0.34 % (1294572)Termination reason: Refutation
% 0.21/0.34 % (1294572)Time elapsed: 0.013 s
% 0.21/0.34 % (1294572)Peak memory usage: 12 MB
% 0.21/0.34 % (1294572)Instructions burned: 22 (million)
% 0.21/0.34 % (1294541)Success in time 0.119 s
% 0.21/0.34 % Vampire exiting
%------------------------------------------------------------------------------