%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU500^1 : 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 : n017.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:29:49 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 466 ( 139 equ; 0 cnn)
% Maximal formula atoms : 18 ( 14 avg)
% Number of connectives : 324 ( 25 ~; 17 |; 74 &; 135 @)
% ( 2 <=>; 71 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 92 ( 89 usr; 24 con; 0-4 aty)
% Number of variables : 79 ( 26 ^; 41 !; 12 ?; 79 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
exu: ( $i > $o ) > $o ).
thf(func_def_3,type,
setextAx: $o ).
thf(func_def_5,type,
emptysetAx: $o ).
thf(func_def_6,type,
setadjoin: $i > $i > $i ).
thf(func_def_7,type,
setadjoinAx: $o ).
thf(func_def_8,type,
powerset: $i > $i ).
thf(func_def_9,type,
powersetAx: $o ).
thf(func_def_10,type,
setunion: $i > $i ).
thf(func_def_11,type,
setunionAx: $o ).
thf(func_def_13,type,
omega0Ax: $o ).
thf(func_def_14,type,
omegaSAx: $o ).
thf(func_def_15,type,
omegaIndAx: $o ).
thf(func_def_16,type,
replAx: $o ).
thf(func_def_17,type,
foundationAx: $o ).
thf(func_def_18,type,
wellorderingAx: $o ).
thf(func_def_19,type,
descr: ( $i > $o ) > $i ).
thf(func_def_20,type,
descrp: $o ).
thf(func_def_21,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(func_def_22,type,
dsetconstrI: $o ).
thf(func_def_23,type,
dsetconstrEL: $o ).
thf(func_def_24,type,
dsetconstrER: $o ).
thf(func_def_25,type,
exuE1: $o ).
thf(func_def_26,type,
prop2set: $o > $i ).
thf(func_def_29,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_30,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_31,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_32,type,
vAND: $o > $o > $o ).
thf(func_def_33,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_34,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_35,type,
vIMP: $o > $o > $o ).
thf(func_def_36,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_37,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_38,type,
sP0: $o ).
thf(func_def_39,type,
sP1: $i > $i > $o ).
thf(func_def_40,type,
sP2: $i > $o ).
thf(func_def_41,type,
sP3: $i > $i > $o ).
thf(func_def_42,type,
sP4: $i > $i > $o ).
thf(func_def_45,type,
sK7: $i > $o ).
thf(func_def_49,type,
sK11: $i > $i > $i ).
thf(func_def_50,type,
sK12: $i > $o ).
thf(func_def_53,type,
sK15: $i > $o ).
thf(func_def_56,type,
sK18: $i > $o ).
thf(func_def_58,type,
sK20: $o ).
thf(func_def_63,type,
sK25: $i > $i > $i ).
thf(func_def_66,type,
sK28: $i > $i > $i ).
thf(func_def_67,type,
sK29: ( $i > $o ) > $i ).
thf(func_def_68,type,
sK30: $i > $o ).
thf(func_def_69,type,
sK31: $i > $i ).
thf(func_def_74,type,
sK36: $i > $i ).
thf(func_def_76,type,
sK38: $i > $i ).
thf(func_def_77,type,
sK39: $i > $i > $o ).
thf(func_def_79,type,
sK41: $i > $i ).
thf(func_def_80,type,
sK42: $i > $i ).
thf(func_def_81,type,
sK43: $i > ( $i > $i > $o ) > $i ).
thf(func_def_82,type,
sK44: $i > ( $i > $i > $o ) > $i ).
thf(func_def_83,type,
sK45: $i > $i > ( $i > $i > $o ) > $i ).
thf(func_def_85,type,
sK47: $i > $i > $i ).
thf(func_def_86,type,
sK48: $i > $i > $i ).
thf(func_def_87,type,
sK49: $i > $i > $i ).
thf(func_def_88,type,
sK50: $i > $i > $i ).
thf(func_def_89,type,
sK51: $i > $i > $i > $i ).
thf(func_def_90,type,
sK52: $i > $i ).
thf(func_def_91,type,
sK53: $i > $i ).
thf(func_def_92,type,
sK54: $i > $i ).
thf(func_def_93,type,
sK55: $i > $i ).
thf(func_def_94,type,
sK56: $i > $i > $i ).
thf(func_def_95,type,
sK57: $i > $i > $i > $i ).
thf(func_def_96,type,
sK58: $i > $i > $i > $i ).
thf(func_def_97,type,
sK59: $i > $i > $i ).
thf(func_def_98,type,
sK60: $i > $i > $i ).
thf(func_def_100,type,
sK62: $i > $i ).
thf(func_def_101,type,
sK63: $i > $i ).
thf(func_def_102,type,
sK64: $i > $i ).
thf(func_def_103,type,
sK65: $i > $i > $i ).
thf(func_def_106,type,
sK68: $i > $i ).
thf(func_def_107,type,
vNOT: $o > $o ).
thf(func_def_108,type,
sK69: $i > ( $i > $o ) > $i ).
thf(func_def_109,type,
sK70: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_110,type,
sK71: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_111,type,
sK72: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_112,type,
sK73: ( $i > $o ) > $i > $i ).
thf(func_def_113,type,
sK74: $i > $i ).
thf(func_def_114,type,
sK75: $i > ( $i > $o ) > $i ).
thf(f16,axiom,
! [X0: $i,X2: $i,X1: $i > $o] :
( ( ( in @ X2
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X1 @ X3 ) ) )
=> ( X1 @ X2 ) )
= dsetconstrER ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dsetconstrER) ).
thf(f18,axiom,
( prop2set
= ( ^ [X0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [X1: $i] : X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prop2set) ).
thf(f19,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ! [X1: $i,X0: $o] :
( ( in @ X1 @ ( prop2set @ X0 ) )
=> X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prop2setE) ).
thf(f20,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ! [X1: $i,X0: $o] :
( ( in @ X1 @ ( prop2set @ X0 ) )
=> X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
thf(f23,plain,
( prop2set
= ( ^ [X0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [X1: $i] : X0 ) ) ),
inference(rectify,[],[f18]) ).
thf(f24,plain,
( prop2set
= ( ^ [Y0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [Y1: $i] : Y0 ) ) ),
inference(fool_elimination,[],[f23]) ).
thf(f35,plain,
! [X0: $i,X1: $i,X2: $i > $o] :
( ( ( in @ X1
@ ( dsetconstr @ X0
@ ^ [X3: $i] : ( X2 @ X3 ) ) )
=> ( X2 @ X1 ) )
= dsetconstrER ),
inference(rectify,[],[f16]) ).
thf(f36,plain,
( ! [X2: $i > $o,X1: $i,X0: $i] :
( ( $true
= ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
=> ( $true
= ( X2 @ X1 ) ) )
<=> ( dsetconstrER = $true ) ),
inference(fool_elimination,[],[f35]) ).
thf(f45,plain,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ! [X0: $i,X1: $o] :
( ( in @ X0 @ ( prop2set @ X1 ) )
=> X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f20]) ).
thf(f46,plain,
~ ( ( setextAx = $true )
=> ( ( emptysetAx = $true )
=> ( ( setadjoinAx = $true )
=> ( ( powersetAx = $true )
=> ( ( setunionAx = $true )
=> ( ( omega0Ax = $true )
=> ( ( omegaSAx = $true )
=> ( ( omegaIndAx = $true )
=> ( ( replAx = $true )
=> ( ( foundationAx = $true )
=> ( ( wellorderingAx = $true )
=> ( ( descrp = $true )
=> ( ( dsetconstrI = $true )
=> ( ( dsetconstrEL = $true )
=> ( ( dsetconstrER = $true )
=> ( ( exuE1 = $true )
=> ! [X1: $o,X0: $i] :
( ( $true
= ( in @ X0 @ ( prop2set @ X1 ) ) )
=> ( $true = X1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f45]) ).
thf(f61,plain,
( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( $true
!= ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( $true
= ( X2 @ X1 ) ) )
<=> ( dsetconstrER = $true ) ),
inference(ennf_transformation,[],[f36]) ).
thf(f69,plain,
( ? [X1: $o,X0: $i] :
( ( $true
= ( in @ X0 @ ( prop2set @ X1 ) ) )
& ( $true != X1 ) )
& ( exuE1 = $true )
& ( dsetconstrER = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true )
& ( descrp = $true )
& ( wellorderingAx = $true )
& ( foundationAx = $true )
& ( replAx = $true )
& ( omegaIndAx = $true )
& ( omegaSAx = $true )
& ( omega0Ax = $true )
& ( setunionAx = $true )
& ( powersetAx = $true )
& ( setadjoinAx = $true )
& ( emptysetAx = $true )
& ( setextAx = $true ) ),
inference(ennf_transformation,[],[f46]) ).
thf(f70,plain,
( ( setadjoinAx = $true )
& ( dsetconstrEL = $true )
& ( setextAx = $true )
& ( setunionAx = $true )
& ( dsetconstrI = $true )
& ( descrp = $true )
& ( exuE1 = $true )
& ( wellorderingAx = $true )
& ( powersetAx = $true )
& ( emptysetAx = $true )
& ( replAx = $true )
& ( omegaSAx = $true )
& ( foundationAx = $true )
& ( dsetconstrER = $true )
& ( omegaIndAx = $true )
& ( omega0Ax = $true )
& ? [X1: $o,X0: $i] :
( ( $true
= ( in @ X0 @ ( prop2set @ X1 ) ) )
& ( $true != X1 ) ) ),
inference(flattening,[],[f69]) ).
thf(f96,plain,
( ( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( $true
!= ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( $true
= ( X2 @ X1 ) ) )
| ( dsetconstrER != $true ) )
& ( ( dsetconstrER = $true )
| ? [X0: $i,X1: $i,X2: $i > $o] :
( ( $true
= ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
& ( $true
!= ( X2 @ X1 ) ) ) ) ),
inference(nnf_transformation,[],[f61]) ).
thf(f97,plain,
( ( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( $true
!= ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( $true
= ( X2 @ X1 ) ) )
| ( dsetconstrER != $true ) )
& ( ( dsetconstrER = $true )
| ? [X3: $i,X4: $i,X5: $i > $o] :
( ( ( in @ X4
@ ( dsetconstr @ X3
@ ^ [Y0: $i] : ( X5 @ Y0 ) ) )
= $true )
& ( $true
!= ( X5 @ X4 ) ) ) ) ),
inference(rectify,[],[f96]) ).
thf(f98,plain,
( ( ! [X0: $i,X1: $i,X2: $i > $o] :
( ( $true
!= ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( $true
= ( X2 @ X1 ) ) )
| ( dsetconstrER != $true ) )
& ( ( dsetconstrER = $true )
| ( ( $true
= ( in @ sK17
@ ( dsetconstr @ sK16
@ ^ [Y0: $i] : ( sK18 @ Y0 ) ) ) )
& ( $true
!= ( sK18 @ sK17 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17,sK18]),skolemize(X3,sK16),skolemize(X4,sK17),skolemize(X5,sK18)],[f97]) ).
thf(f102,plain,
( ( setadjoinAx = $true )
& ( dsetconstrEL = $true )
& ( setextAx = $true )
& ( setunionAx = $true )
& ( dsetconstrI = $true )
& ( descrp = $true )
& ( exuE1 = $true )
& ( wellorderingAx = $true )
& ( powersetAx = $true )
& ( emptysetAx = $true )
& ( replAx = $true )
& ( omegaSAx = $true )
& ( foundationAx = $true )
& ( dsetconstrER = $true )
& ( omegaIndAx = $true )
& ( omega0Ax = $true )
& ? [X0: $o,X1: $i] :
( ( ( in @ X1 @ ( prop2set @ X0 ) )
= $true )
& ( $true != X0 ) ) ),
inference(rectify,[],[f70]) ).
thf(f103,plain,
( ( setadjoinAx = $true )
& ( dsetconstrEL = $true )
& ( setextAx = $true )
& ( setunionAx = $true )
& ( dsetconstrI = $true )
& ( descrp = $true )
& ( exuE1 = $true )
& ( wellorderingAx = $true )
& ( powersetAx = $true )
& ( emptysetAx = $true )
& ( replAx = $true )
& ( omegaSAx = $true )
& ( foundationAx = $true )
& ( dsetconstrER = $true )
& ( omegaIndAx = $true )
& ( omega0Ax = $true )
& ( $true
= ( in @ sK21 @ ( prop2set @ sK20 ) ) )
& ( $true != sK20 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21]),skolemize(X0,sK20),skolemize(X1,sK21)],[f102]) ).
thf(f164,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( $true
!= ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( $true
= ( X2 @ X1 ) )
| ( dsetconstrER != $true ) ),
inference(cnf_transformation,[],[f98]) ).
thf(f167,plain,
$true != sK20,
inference(cnf_transformation,[],[f103]) ).
thf(f168,plain,
( $true
= ( in @ sK21 @ ( prop2set @ sK20 ) ) ),
inference(cnf_transformation,[],[f103]) ).
thf(f171,plain,
dsetconstrER = $true,
inference(cnf_transformation,[],[f103]) ).
thf(f200,plain,
( prop2set
= ( ^ [Y0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [Y1: $i] : Y0 ) ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f290,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( $true
!= ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( $true != $true )
| ( $true
= ( X2 @ X1 ) ) ),
inference(definition_unfolding,[],[f164,f171]) ).
thf(f295,plain,
( $true
= ( in @ sK21
@ ( ^ [Y0: $o] :
( dsetconstr @ ( powerset @ emptyset )
@ ^ [Y1: $i] : Y0 )
@ sK20 ) ) ),
inference(definition_unfolding,[],[f168,f200]) ).
thf(f380,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( $true
!= ( in @ X1
@ ( dsetconstr @ X0
@ ^ [Y0: $i] : ( X2 @ Y0 ) ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f290]) ).
thf(f381,plain,
! [X2: $i > $o,X0: $i,X1: $i] :
( ( $true
!= ( in @ X1 @ ( dsetconstr @ X0 @ X2 ) ) )
| ( $true
= ( X2 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f380]) ).
thf(f447,plain,
( $true
= ( in @ sK21
@ ( dsetconstr @ ( powerset @ emptyset )
@ ^ [Y0: $i] : sK20 ) ) ),
inference(beta-eta_normalization,[],[f295]) ).
thf(f517,plain,
( ( $true
= ( ^ [Y0: $i] : sK20
@ sK21 ) )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f381,f447]) ).
thf(f519,plain,
( $true
= ( ^ [Y0: $i] : sK20
@ sK21 ) ),
inference(trivial_inequality_removal,[],[f517]) ).
thf(f520,plain,
$true = sK20,
inference(beta-eta_normalization,[],[f519]) ).
thf(f521,plain,
$false,
inference(forward_subsumption_resolution,[],[f520,f167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU500^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n017.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 13:41:52 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.21/0.28 % (356285)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.28 % (356294)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3015262342:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.28 % (356294)Instruction limit reached!
% 0.21/0.28 % (356294)------------------------------
% 0.21/0.28 % (356294)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (356294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (356294)CaDiCaL version: 2.1.3
% 0.21/0.28 % (356294)Termination reason: Instruction limit
% 0.21/0.28 % (356294)Termination phase: Saturation
% 0.21/0.28 % (356294)Time elapsed: 0.006 s
% 0.21/0.28 % (356294)Peak memory usage: 12 MB
% 0.21/0.28 % (356294)Instructions burned: 24 (million)
% 0.21/0.28 % (356292)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2544289277:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.28 % (356291)lrs+10_16_si=on:nwc=1.5:random_seed=737217400:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.28 % (356290)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1724004277:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.28 % (356293)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=1250985846: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.28 % (356292)Instruction limit reached!
% 0.21/0.28 % (356292)------------------------------
% 0.21/0.28 % (356292)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (356292)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (356292)CaDiCaL version: 2.1.3
% 0.21/0.28 % (356292)Termination reason: Instruction limit
% 0.21/0.28 % (356292)Termination phase: Function definition elimination
% 0.21/0.28 % (356292)Time elapsed: 0.003 s
% 0.21/0.28 % (356292)Peak memory usage: 10 MB
% 0.21/0.28 % (356292)Instructions burned: 7 (million)
% 0.21/0.28 % (356295)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3614970343:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.28 % (356296)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.28 % (356296)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.28 % (356291)Instruction limit reached!
% 0.21/0.28 % (356291)------------------------------
% 0.21/0.28 % (356291)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (356291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (356291)CaDiCaL version: 2.1.3
% 0.21/0.28 % (356291)Termination reason: Instruction limit
% 0.21/0.28 % (356291)Termination phase: Saturation
% 0.21/0.28 % (356291)Time elapsed: 0.010 s
% 0.21/0.28 % (356291)Peak memory usage: 11 MB
% 0.21/0.28 % (356291)Instructions burned: 22 (million)
% 0.21/0.28 % (356296)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=878277545:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.28 % (356295) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-356285-356295"...
% 0.21/0.28 % (356290) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-356285-356290"...
% 0.21/0.28 % (356295)...printing done.
% 0.21/0.28 % (356295)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (356295)------------------------------
% 0.21/0.28 % (356295)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (356295)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (356295)CaDiCaL version: 2.1.3
% 0.21/0.28 % (356295)Termination reason: Refutation
% 0.21/0.28 % (356295)Time elapsed: 0.011 s
% 0.21/0.28 % (356295)Peak memory usage: 13 MB
% 0.21/0.28 % (356295)Instructions burned: 41 (million)
% 0.21/0.28 % (356285)Success in time 0.05 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------