%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU513^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 : n002.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:52 AM UTC 2026
% Result : Theorem 0.21s 0.31s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 581 ( 165 equ; 0 cnn)
% Maximal formula atoms : 33 ( 29 avg)
% Number of connectives : 435 ( 39 ~; 40 |; 78 &; 158 @)
% ( 4 <=>; 116 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 13 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 117 ( 114 usr; 38 con; 0-4 aty)
% Number of variables : 40 ( 0 ^; 31 !; 9 ?; 40 :)
% 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_27,type,
prop2setE: $o ).
thf(func_def_28,type,
emptysetE: $o ).
thf(func_def_29,type,
emptysetimpfalse: $o ).
thf(func_def_30,type,
notinemptyset: $o ).
thf(func_def_31,type,
exuE3e: $o ).
thf(func_def_32,type,
setext: $o ).
thf(func_def_33,type,
emptyI: $o ).
thf(func_def_34,type,
noeltsimpempty: $o ).
thf(func_def_35,type,
setbeta: $o ).
thf(func_def_36,type,
nonempty: $i > $o ).
thf(func_def_37,type,
nonemptyE1: $o ).
thf(func_def_38,type,
nonemptyI: $o ).
thf(func_def_39,type,
nonemptyI1: $o ).
thf(func_def_40,type,
setadjoinIL: $o ).
thf(func_def_41,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_42,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_45,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_46,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_47,type,
vAND: $o > $o > $o ).
thf(func_def_48,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_49,type,
vIMP: $o > $o > $o ).
thf(func_def_50,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_52,type,
vNOT: $o > $o ).
thf(func_def_53,type,
sP0: $i > $i > $o ).
thf(func_def_54,type,
sP1: $i > $o ).
thf(func_def_55,type,
sP2: $i > $i > $o ).
thf(func_def_56,type,
sP3: $i > $i > $o ).
thf(func_def_57,type,
sP4: $o ).
thf(func_def_59,type,
sK6: $i > $o ).
thf(func_def_64,type,
sK11: $i > $o ).
thf(func_def_65,type,
sK12: $i > $o ).
thf(func_def_66,type,
sK13: ( $i > $o ) > $i ).
thf(func_def_71,type,
sK18: $i > $i > $i ).
thf(func_def_73,type,
sK20: $o ).
thf(func_def_74,type,
sK21: $i > $i > $i ).
thf(func_def_75,type,
sK22: $i > $i > $i ).
thf(func_def_76,type,
sK23: $i > $i > $i ).
thf(func_def_77,type,
sK24: $i > $i > $i ).
thf(func_def_78,type,
sK25: $i > $i > $i > $i ).
thf(func_def_79,type,
sK26: $i > $i ).
thf(func_def_80,type,
sK27: $i > $i ).
thf(func_def_81,type,
sK28: $i > $i ).
thf(func_def_82,type,
sK29: $i > $i ).
thf(func_def_83,type,
sK30: $i > $i > $i ).
thf(func_def_84,type,
sK31: $i > $i > $i > $i ).
thf(func_def_85,type,
sK32: $i > $i > $i > $i ).
thf(func_def_86,type,
sK33: $i > $i > $i ).
thf(func_def_87,type,
sK34: $i > $i > $i ).
thf(func_def_89,type,
sK36: $i > $i ).
thf(func_def_90,type,
sK37: $i > $i ).
thf(func_def_91,type,
sK38: $i > $i ).
thf(func_def_92,type,
sK39: $i > $i > $i ).
thf(func_def_95,type,
sK42: ( $i > $o ) > $i ).
thf(func_def_96,type,
sK43: $i > $o ).
thf(func_def_97,type,
sK44: $i > $i ).
thf(func_def_98,type,
sK45: $i > $i ).
thf(func_def_100,type,
sK47: $i > $i > $i ).
thf(func_def_101,type,
sK48: $i > $i > $i ).
thf(func_def_104,type,
sK51: $i > $i ).
thf(func_def_106,type,
sK53: $o ).
thf(func_def_110,type,
sK57: $i > $i > $o ).
thf(func_def_111,type,
sK58: $i > $i ).
thf(func_def_112,type,
sK59: $i > $i ).
thf(func_def_113,type,
sK60: ( $i > $i > $o ) > $i > $i ).
thf(func_def_114,type,
sK61: ( $i > $i > $o ) > $i > $i ).
thf(func_def_115,type,
sK62: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_116,type,
sK63: $i > $i > $i ).
thf(func_def_121,type,
sK68: $i > $i ).
thf(func_def_122,type,
sK69: $i > $o ).
thf(func_def_127,type,
sK74: $i > $i ).
thf(func_def_129,type,
sK76: $i > $i ).
thf(func_def_131,type,
sK78: $i > $i ).
thf(func_def_134,type,
sK81: $i > $o ).
thf(func_def_135,type,
sK82: $i > $o ).
thf(func_def_141,type,
sK88: $i > $i > $i ).
thf(func_def_144,type,
sK91: $i > $o ).
thf(func_def_148,type,
sK95: $i > ( $i > $o ) > $i ).
thf(func_def_149,type,
sK96: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_150,type,
sK97: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_151,type,
sK98: $i > ( $i > $o ) > $i ).
thf(func_def_152,type,
sK99: $i > $i ).
thf(func_def_153,type,
sK100: $i > ( $i > $o ) > $i ).
thf(func_def_154,type,
sK101: $i > ( $i > $o ) > $i ).
thf(func_def_155,type,
sK102: $i > ( $i > $i > $o ) > $i > $i ).
thf(f4,axiom,
( setadjoinAx
= ( ! [X0: $i,X2: $i,X1: $i] :
( ( ( X2 = X0 )
| ( in @ X2 @ X1 ) )
<=> ( in @ X2 @ ( setadjoin @ X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setadjoinAx) ).
thf(f33,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( in @ emptyset @ ( setadjoin @ emptyset @ emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyinunitempty) ).
thf(f34,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( in @ emptyset @ ( setadjoin @ emptyset @ emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f33]) ).
thf(f69,plain,
( setadjoinAx
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( X0 = X1 )
| ( in @ X1 @ X2 ) )
<=> ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f70,plain,
( ! [X2: $i,X1: $i,X0: $i] :
( ( ( X0 = X1 )
| ( ( in @ X1 @ X2 )
= $true ) )
<=> ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) )
<=> ( setadjoinAx = $true ) ),
inference(fool_elimination,[],[f69]) ).
thf(f94,plain,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( in @ emptyset @ ( setadjoin @ emptyset @ emptyset ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f34]) ).
thf(f95,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 )
=> ( ( prop2setE = $true )
=> ( ( emptysetE = $true )
=> ( ( emptysetimpfalse = $true )
=> ( ( notinemptyset = $true )
=> ( ( exuE3e = $true )
=> ( ( setext = $true )
=> ( ( emptyI = $true )
=> ( ( noeltsimpempty = $true )
=> ( ( setbeta = $true )
=> ( ( nonemptyE1 = $true )
=> ( ( nonemptyI = $true )
=> ( ( nonemptyI1 = $true )
=> ( ( setadjoinIL = $true )
=> ( ( in @ emptyset @ ( setadjoin @ emptyset @ emptyset ) )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f94]) ).
thf(f120,plain,
( ( ( in @ emptyset @ ( setadjoin @ emptyset @ emptyset ) )
!= $true )
& ( setadjoinIL = $true )
& ( nonemptyI1 = $true )
& ( nonemptyI = $true )
& ( nonemptyE1 = $true )
& ( setbeta = $true )
& ( noeltsimpempty = $true )
& ( emptyI = $true )
& ( setext = $true )
& ( exuE3e = $true )
& ( notinemptyset = $true )
& ( emptysetimpfalse = $true )
& ( emptysetE = $true )
& ( prop2setE = $true )
& ( 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,[],[f95]) ).
thf(f121,plain,
( ( noeltsimpempty = $true )
& ( powersetAx = $true )
& ( setunionAx = $true )
& ( exuE3e = $true )
& ( setextAx = $true )
& ( nonemptyE1 = $true )
& ( emptysetAx = $true )
& ( omegaIndAx = $true )
& ( dsetconstrI = $true )
& ( nonemptyI = $true )
& ( nonemptyI1 = $true )
& ( omega0Ax = $true )
& ( emptysetimpfalse = $true )
& ( exuE1 = $true )
& ( descrp = $true )
& ( replAx = $true )
& ( emptyI = $true )
& ( prop2setE = $true )
& ( emptysetE = $true )
& ( omegaSAx = $true )
& ( foundationAx = $true )
& ( setext = $true )
& ( setbeta = $true )
& ( dsetconstrEL = $true )
& ( notinemptyset = $true )
& ( setadjoinIL = $true )
& ( wellorderingAx = $true )
& ( ( in @ emptyset @ ( setadjoin @ emptyset @ emptyset ) )
!= $true )
& ( setadjoinAx = $true )
& ( dsetconstrER = $true ) ),
inference(flattening,[],[f120]) ).
thf(f146,plain,
( ( ! [X2: $i,X1: $i,X0: $i] :
( ( ( X0 = X1 )
| ( ( in @ X1 @ X2 )
= $true )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) )
& ( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( ( X0 != X1 )
& ( ( in @ X1 @ X2 )
!= $true ) ) ) )
| ( setadjoinAx != $true ) )
& ( ( setadjoinAx = $true )
| ? [X2: $i,X1: $i,X0: $i] :
( ( ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( ( X0 != X1 )
& ( ( in @ X1 @ X2 )
!= $true ) ) )
& ( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( X0 = X1 )
| ( ( in @ X1 @ X2 )
= $true ) ) ) ) ),
inference(nnf_transformation,[],[f70]) ).
thf(f147,plain,
( ( ! [X2: $i,X1: $i,X0: $i] :
( ( ( X0 = X1 )
| ( ( in @ X1 @ X2 )
= $true )
| ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) ) )
& ( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( ( X0 != X1 )
& ( ( in @ X1 @ X2 )
!= $true ) ) ) )
| ( setadjoinAx != $true ) )
& ( ( setadjoinAx = $true )
| ? [X2: $i,X1: $i,X0: $i] :
( ( ( $true
!= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( ( X0 != X1 )
& ( ( in @ X1 @ X2 )
!= $true ) ) )
& ( ( $true
= ( in @ X1 @ ( setadjoin @ X0 @ X2 ) ) )
| ( X0 = X1 )
| ( ( in @ X1 @ X2 )
= $true ) ) ) ) ),
inference(flattening,[],[f146]) ).
thf(f148,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( X1 = X2 )
| ( ( in @ X1 @ X0 )
= $true )
| ( ( in @ X1 @ ( setadjoin @ X2 @ X0 ) )
!= $true ) )
& ( ( ( in @ X1 @ ( setadjoin @ X2 @ X0 ) )
= $true )
| ( ( X1 != X2 )
& ( ( in @ X1 @ X0 )
!= $true ) ) ) )
| ( setadjoinAx != $true ) )
& ( ( setadjoinAx = $true )
| ? [X3: $i,X4: $i,X5: $i] :
( ( ( $true
!= ( in @ X4 @ ( setadjoin @ X5 @ X3 ) ) )
| ( ( X4 != X5 )
& ( $true
!= ( in @ X4 @ X3 ) ) ) )
& ( ( $true
= ( in @ X4 @ ( setadjoin @ X5 @ X3 ) ) )
| ( X4 = X5 )
| ( $true
= ( in @ X4 @ X3 ) ) ) ) ) ),
inference(rectify,[],[f147]) ).
thf(f149,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( X1 = X2 )
| ( ( in @ X1 @ X0 )
= $true )
| ( ( in @ X1 @ ( setadjoin @ X2 @ X0 ) )
!= $true ) )
& ( ( ( in @ X1 @ ( setadjoin @ X2 @ X0 ) )
= $true )
| ( ( X1 != X2 )
& ( ( in @ X1 @ X0 )
!= $true ) ) ) )
| ( setadjoinAx != $true ) )
& ( ( setadjoinAx = $true )
| ( ( ( $true
!= ( in @ sK9 @ ( setadjoin @ sK10 @ sK8 ) ) )
| ( ( sK10 != sK9 )
& ( $true
!= ( in @ sK9 @ sK8 ) ) ) )
& ( ( $true
= ( in @ sK9 @ ( setadjoin @ sK10 @ sK8 ) ) )
| ( sK10 = sK9 )
| ( $true
= ( in @ sK9 @ sK8 ) ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10]),skolemize(X3,sK8),skolemize(X4,sK9),skolemize(X5,sK10)],[f148]) ).
thf(f249,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X1 @ ( setadjoin @ X2 @ X0 ) )
= $true )
| ( X1 != X2 )
| ( setadjoinAx != $true ) ),
inference(cnf_transformation,[],[f149]) ).
thf(f327,plain,
setadjoinAx = $true,
inference(cnf_transformation,[],[f121]) ).
thf(f328,plain,
( ( in @ emptyset @ ( setadjoin @ emptyset @ emptyset ) )
!= $true ),
inference(cnf_transformation,[],[f121]) ).
thf(f427,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X1 @ ( setadjoin @ X2 @ X0 ) )
= $true )
| ( X1 != X2 )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f249,f327]) ).
thf(f535,plain,
! [X2: $i,X0: $i] :
( ( $true
= ( in @ X2 @ ( setadjoin @ X2 @ X0 ) ) )
| ( $true != $true ) ),
inference(equality_resolution,[],[f427]) ).
thf(f558,plain,
! [X2: $i,X0: $i] :
( $true
= ( in @ X2 @ ( setadjoin @ X2 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f535]) ).
thf(f711,plain,
$false,
inference(forward_subsumption_resolution,[],[f328,f558]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU513^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n002.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:50:07 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.24 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.31 % (1311847)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.31 % (1311862)lrs+10_16_si=on:nwc=1.5:random_seed=3954840820:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.31 % (1311867)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.31 % (1311867)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.31 % (1311862)Instruction limit reached!
% 0.21/0.31 % (1311862)------------------------------
% 0.21/0.31 % (1311862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.31 % (1311862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.31 % (1311862)CaDiCaL version: 2.1.3
% 0.21/0.31 % (1311862)Termination reason: Instruction limit
% 0.21/0.31 % (1311862)Termination phase: Saturation
% 0.21/0.31 % (1311862)Time elapsed: 0.005 s
% 0.21/0.31 % (1311862)Peak memory usage: 11 MB
% 0.21/0.31 % (1311862)Instructions burned: 22 (million)
% 0.21/0.31 % (1311861)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=18059486:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.31 % (1311865)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=97589764:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.31 % (1311863)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1184681711:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.31 % (1311864)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=497440022: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.31 % (1311866)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1879589686:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.21/0.31 % (1311867)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=1582696243:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.21/0.31 % (1311863)Instruction limit reached!
% 0.21/0.31 % (1311863)------------------------------
% 0.21/0.31 % (1311863)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.31 % (1311863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.31 % (1311863)CaDiCaL version: 2.1.3
% 0.21/0.31 % (1311863)Termination reason: Instruction limit
% 0.21/0.31 % (1311863)Termination phase: Property scanning
% 0.21/0.31 % (1311863)Time elapsed: 0.002 s
% 0.21/0.31 % (1311863)Peak memory usage: 10 MB
% 0.21/0.31 % (1311863)Instructions burned: 4 (million)
% 0.21/0.31 % (1311876)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=2239813943:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.21/0.31 % (1311876)Instruction limit reached!
% 0.21/0.31 % (1311876)------------------------------
% 0.21/0.31 % (1311876)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.31 % (1311876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.31 % (1311876)CaDiCaL version: 2.1.3
% 0.21/0.31 % (1311876)Termination reason: Instruction limit
% 0.21/0.31 % (1311876)Termination phase: Property scanning
% 0.21/0.31 % (1311876)Time elapsed: 0.001 s
% 0.21/0.31 % (1311876)Peak memory usage: 10 MB
% 0.21/0.31 % (1311876)Instructions burned: 4 (million)
% 0.21/0.31 % (1311865)Instruction limit reached!
% 0.21/0.31 % (1311865)------------------------------
% 0.21/0.31 % (1311865)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.31 % (1311865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.31 % (1311865)CaDiCaL version: 2.1.3
% 0.21/0.31 % (1311865)Termination reason: Instruction limit
% 0.21/0.31 % (1311865)Termination phase: Saturation
% 0.21/0.31 % (1311865)Time elapsed: 0.011 s
% 0.21/0.31 % (1311865)Peak memory usage: 11 MB
% 0.21/0.31 % (1311865)Instructions burned: 25 (million)
% 0.21/0.31 % (1311861) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1311847-1311861"...
% 0.21/0.31 % (1311890)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.31 % (1311890)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=403138666: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.31 % (1311861)...printing done.
% 0.21/0.31 % (1311861)Refutation found. Thanks to Tanya!
% 0.21/0.31 % SZS status Theorem for theBenchmark
% 0.21/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.31 % (1311861)------------------------------
% 0.21/0.31 % (1311861)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.31 % (1311861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.31 % (1311861)CaDiCaL version: 2.1.3
% 0.21/0.31 % (1311861)Termination reason: Refutation
% 0.21/0.31 % (1311861)Time elapsed: 0.018 s
% 0.21/0.31 % (1311861)Peak memory usage: 12 MB
% 0.21/0.31 % (1311861)Instructions burned: 36 (million)
% 0.21/0.31 % (1311847)Success in time 0.066 s
% 0.21/0.31 % Vampire exiting
%------------------------------------------------------------------------------