%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU520^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 : n020.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:54 AM UTC 2026
% Result : Theorem 0.22s 0.30s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 648 ( 171 equ; 0 cnn)
% Maximal formula atoms : 38 ( 34 avg)
% Number of connectives : 339 ( 15 ~; 8 |; 111 &; 60 @)
% ( 1 <=>; 144 =>; 0 <=; 0 <~>)
% Maximal formula depth : 41 ( 16 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 125 ( 122 usr; 45 con; 0-4 aty)
% Number of variables : 17 ( 0 ^; 13 !; 4 ?; 17 :)
% 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,
emptyinunitempty: $o ).
thf(func_def_42,type,
setadjoinIR: $o ).
thf(func_def_43,type,
setadjoinE: $o ).
thf(func_def_44,type,
setadjoinOr: $o ).
thf(func_def_45,type,
setoftrueEq: $o ).
thf(func_def_46,type,
powersetI: $o ).
thf(func_def_47,type,
emptyinPowerset: $o ).
thf(func_def_50,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_52,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_53,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_54,type,
vNOT: $o > $o ).
thf(func_def_55,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_56,type,
vAND: $o > $o > $o ).
thf(func_def_57,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_58,type,
vIMP: $o > $o > $o ).
thf(func_def_59,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_60,type,
sP0: $i > $i > $o ).
thf(func_def_61,type,
sP1: $i > $o ).
thf(func_def_62,type,
sP2: $i > $i > $o ).
thf(func_def_63,type,
sP3: $i > $i > $o ).
thf(func_def_64,type,
sP4: $o ).
thf(func_def_65,type,
sK5: $i > $i > $i ).
thf(func_def_66,type,
sK6: $i > $i > $i ).
thf(func_def_70,type,
sK10: $i > $o ).
thf(func_def_73,type,
sK13: $i > $o ).
thf(func_def_76,type,
sK16: $i > $o ).
thf(func_def_77,type,
sK17: $i > $i > $i ).
thf(func_def_78,type,
sK18: $i > $i > $i ).
thf(func_def_79,type,
sK19: $i > $i > $i ).
thf(func_def_80,type,
sK20: $i > $i > $i ).
thf(func_def_81,type,
sK21: $i > $i > $i ).
thf(func_def_82,type,
sK22: $i > $i > $i > $i ).
thf(func_def_83,type,
sK23: $i > $i ).
thf(func_def_84,type,
sK24: $i > $i ).
thf(func_def_85,type,
sK25: $i > $i ).
thf(func_def_86,type,
sK26: $i > $i ).
thf(func_def_87,type,
sK27: $i > $i > $i ).
thf(func_def_88,type,
sK28: $i > $i > $i > $i ).
thf(func_def_89,type,
sK29: $i > $i > $i > $i ).
thf(func_def_90,type,
sK30: $i > $i > $i ).
thf(func_def_91,type,
sK31: $i > $i > $i ).
thf(func_def_93,type,
sK33: $i > $i ).
thf(func_def_94,type,
sK34: $i > $i ).
thf(func_def_95,type,
sK35: $i > $i ).
thf(func_def_99,type,
sK39: $i > $i > $i ).
thf(func_def_102,type,
sK42: $i > $i > $o ).
thf(func_def_103,type,
sK43: $i > $i ).
thf(func_def_104,type,
sK44: $i > $i ).
thf(func_def_105,type,
sK45: ( $i > $i > $o ) > $i > $i ).
thf(func_def_106,type,
sK46: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_107,type,
sK47: ( $i > $i > $o ) > $i > $i ).
thf(func_def_112,type,
sK52: $o ).
thf(func_def_117,type,
sK57: $i > $o ).
thf(func_def_118,type,
sK58: $i > $o ).
thf(func_def_125,type,
sK65: $i > $i > $i ).
thf(func_def_139,type,
sK79: $i > $i ).
thf(func_def_141,type,
sK81: $i > $i ).
thf(func_def_143,type,
sK83: $i > $i ).
thf(func_def_145,type,
sK85: $i > $i ).
thf(func_def_149,type,
sK89: $i > $i > $i ).
thf(func_def_153,type,
sK93: $o ).
thf(func_def_154,type,
sK94: $i > $i > $i ).
thf(func_def_159,type,
sK99: $i > $o ).
thf(func_def_160,type,
sK100: $i > $i ).
thf(func_def_162,type,
sK102: ( $i > $o ) > $i ).
thf(func_def_163,type,
sK103: $i > $o ).
thf(func_def_164,type,
sK104: $i > $i ).
thf(func_def_165,type,
sK105: ( $i > $o ) > $i ).
thf(func_def_166,type,
sK106: $i > $o ).
thf(func_def_168,type,
sK108: $i > $i ).
thf(func_def_170,type,
sK110: $o ).
thf(func_def_171,type,
sK111: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_172,type,
sK112: $i > ( $i > $o ) > $i ).
thf(func_def_173,type,
sK113: ( $i > $o ) > $i > $i ).
thf(func_def_174,type,
sK114: $i > $i ).
thf(func_def_175,type,
sK115: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_176,type,
sK116: $i > ( $i > $o ) > $i ).
thf(func_def_177,type,
sK117: $i > ( $i > $i > $o ) > $i > $i ).
thf(func_def_178,type,
sK118: $i > ( $i > $o ) > $i ).
thf(f39,axiom,
! [X0: $i] :
( ( in @ emptyset @ ( powerset @ X0 ) )
= emptyinPowerset ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyinPowerset) ).
thf(f40,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
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ! [X0: $i] : ( in @ emptyset @ ( powerset @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',emptyInPowerset) ).
thf(f41,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
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ! [X0: $i] : ( in @ emptyset @ ( powerset @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
thf(f74,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
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ! [X0: $i] : ( in @ emptyset @ ( powerset @ X0 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f41]) ).
thf(f75,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 )
=> ( ( emptyinunitempty = $true )
=> ( ( setadjoinIR = $true )
=> ( ( setadjoinE = $true )
=> ( ( setadjoinOr = $true )
=> ( ( setoftrueEq = $true )
=> ( ( powersetI = $true )
=> ( ( emptyinPowerset = $true )
=> ! [X0: $i] :
( ( in @ emptyset @ ( powerset @ X0 ) )
= $true ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f74]) ).
thf(f93,plain,
! [X0: $i] :
( ( in @ emptyset @ ( powerset @ X0 ) )
= emptyinPowerset ),
inference(rectify,[],[f39]) ).
thf(f94,plain,
( ( emptyinPowerset = $true )
<=> ! [X0: $i] :
( ( in @ emptyset @ ( powerset @ X0 ) )
= $true ) ),
inference(fool_elimination,[],[f93]) ).
thf(f128,plain,
( ? [X0: $i] :
( ( in @ emptyset @ ( powerset @ X0 ) )
!= $true )
& ( emptyinPowerset = $true )
& ( powersetI = $true )
& ( setoftrueEq = $true )
& ( setadjoinOr = $true )
& ( setadjoinE = $true )
& ( setadjoinIR = $true )
& ( emptyinunitempty = $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,[],[f75]) ).
thf(f129,plain,
( ( setadjoinE = $true )
& ( emptyI = $true )
& ( setext = $true )
& ( setextAx = $true )
& ( nonemptyI = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true )
& ( emptysetimpfalse = $true )
& ( nonemptyI1 = $true )
& ( noeltsimpempty = $true )
& ( powersetAx = $true )
& ? [X0: $i] :
( ( in @ emptyset @ ( powerset @ X0 ) )
!= $true )
& ( omegaIndAx = $true )
& ( emptyinunitempty = $true )
& ( powersetI = $true )
& ( wellorderingAx = $true )
& ( setunionAx = $true )
& ( replAx = $true )
& ( emptyinPowerset = $true )
& ( foundationAx = $true )
& ( emptysetAx = $true )
& ( notinemptyset = $true )
& ( prop2setE = $true )
& ( setbeta = $true )
& ( exuE3e = $true )
& ( emptysetE = $true )
& ( dsetconstrER = $true )
& ( omegaSAx = $true )
& ( setadjoinAx = $true )
& ( setadjoinIL = $true )
& ( descrp = $true )
& ( setadjoinIR = $true )
& ( omega0Ax = $true )
& ( setoftrueEq = $true )
& ( setadjoinOr = $true )
& ( nonemptyE1 = $true )
& ( exuE1 = $true ) ),
inference(flattening,[],[f128]) ).
thf(f204,plain,
( ( ( emptyinPowerset = $true )
| ? [X0: $i] :
( ( in @ emptyset @ ( powerset @ X0 ) )
!= $true ) )
& ( ! [X0: $i] :
( ( in @ emptyset @ ( powerset @ X0 ) )
= $true )
| ( emptyinPowerset != $true ) ) ),
inference(nnf_transformation,[],[f94]) ).
thf(f205,plain,
( ( ( emptyinPowerset = $true )
| ? [X0: $i] :
( ( in @ emptyset @ ( powerset @ X0 ) )
!= $true ) )
& ( ! [X1: $i] :
( $true
= ( in @ emptyset @ ( powerset @ X1 ) ) )
| ( emptyinPowerset != $true ) ) ),
inference(rectify,[],[f204]) ).
thf(f206,plain,
( ( ( emptyinPowerset = $true )
| ( ( in @ emptyset @ ( powerset @ sK40 ) )
!= $true ) )
& ( ! [X1: $i] :
( $true
= ( in @ emptyset @ ( powerset @ X1 ) ) )
| ( emptyinPowerset != $true ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK40]),skolemize(X0,sK40)],[f205]) ).
thf(f217,plain,
( ( setadjoinE = $true )
& ( emptyI = $true )
& ( setext = $true )
& ( setextAx = $true )
& ( nonemptyI = $true )
& ( dsetconstrEL = $true )
& ( dsetconstrI = $true )
& ( emptysetimpfalse = $true )
& ( nonemptyI1 = $true )
& ( noeltsimpempty = $true )
& ( powersetAx = $true )
& ( ( in @ emptyset @ ( powerset @ sK53 ) )
!= $true )
& ( omegaIndAx = $true )
& ( emptyinunitempty = $true )
& ( powersetI = $true )
& ( wellorderingAx = $true )
& ( setunionAx = $true )
& ( replAx = $true )
& ( emptyinPowerset = $true )
& ( foundationAx = $true )
& ( emptysetAx = $true )
& ( notinemptyset = $true )
& ( prop2setE = $true )
& ( setbeta = $true )
& ( exuE3e = $true )
& ( emptysetE = $true )
& ( dsetconstrER = $true )
& ( omegaSAx = $true )
& ( setadjoinAx = $true )
& ( setadjoinIL = $true )
& ( descrp = $true )
& ( setadjoinIR = $true )
& ( omega0Ax = $true )
& ( setoftrueEq = $true )
& ( setadjoinOr = $true )
& ( nonemptyE1 = $true )
& ( exuE1 = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53]),skolemize(X0,sK53)],[f129]) ).
thf(f346,plain,
! [X1: $i] :
( ( $true
= ( in @ emptyset @ ( powerset @ X1 ) ) )
| ( emptyinPowerset != $true ) ),
inference(cnf_transformation,[],[f206]) ).
thf(f389,plain,
emptyinPowerset = $true,
inference(cnf_transformation,[],[f217]) ).
thf(f396,plain,
( ( in @ emptyset @ ( powerset @ sK53 ) )
!= $true ),
inference(cnf_transformation,[],[f217]) ).
thf(f529,plain,
! [X1: $i] :
( ( $true != $true )
| ( $true
= ( in @ emptyset @ ( powerset @ X1 ) ) ) ),
inference(definition_unfolding,[],[f346,f389]) ).
thf(f655,plain,
! [X1: $i] :
( $true
= ( in @ emptyset @ ( powerset @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f529]) ).
thf(f825,plain,
$false,
inference(forward_subsumption_resolution,[],[f396,f655]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU520^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.09/0.19 % Computer : n020.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.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 13:48:35 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.23 Running higher-order theorem proving
% 0.09/0.25 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.22/0.30 % (1077868)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.30 % (1077877)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3944067770:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.30 % (1077879)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.30 % (1077879)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.22/0.30 % (1077877)Instruction limit reached!
% 0.22/0.30 % (1077877)------------------------------
% 0.22/0.30 % (1077877)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (1077877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (1077877)CaDiCaL version: 2.1.3
% 0.22/0.30 % (1077877)Termination reason: Instruction limit
% 0.22/0.30 % (1077877)Termination phase: Saturation
% 0.22/0.30 % (1077877)Time elapsed: 0.006 s
% 0.22/0.30 % (1077877)Peak memory usage: 11 MB
% 0.22/0.30 % (1077877)Instructions burned: 25 (million)
% 0.22/0.30 % (1077874)lrs+10_16_si=on:nwc=1.5:random_seed=1033355805:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.30 % (1077873)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1369625295:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.30 % (1077876)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=2539640875: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.22/0.30 % (1077878)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=489126498:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.30 % (1077875)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2000058963:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.30 % (1077879)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=4091236032:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.30 % (1077875)Instruction limit reached!
% 0.22/0.30 % (1077875)------------------------------
% 0.22/0.30 % (1077875)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (1077875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (1077875)CaDiCaL version: 2.1.3
% 0.22/0.30 % (1077875)Termination reason: Instruction limit
% 0.22/0.30 % (1077875)Termination phase: shuffling
% 0.22/0.30 % (1077875)Time elapsed: 0.002 s
% 0.22/0.30 % (1077875)Peak memory usage: 9 MB
% 0.22/0.30 % (1077875)Instructions burned: 4 (million)
% 0.22/0.30 % (1077874)Instruction limit reached!
% 0.22/0.30 % (1077874)------------------------------
% 0.22/0.30 % (1077874)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (1077874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (1077874)CaDiCaL version: 2.1.3
% 0.22/0.30 % (1077874)Termination reason: Instruction limit
% 0.22/0.30 % (1077874)Termination phase: Saturation
% 0.22/0.30 % (1077874)Time elapsed: 0.008 s
% 0.22/0.30 % (1077874)Peak memory usage: 11 MB
% 0.22/0.30 % (1077874)Instructions burned: 18 (million)
% 0.22/0.30 % (1077886)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3231130769:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.22/0.30 % (1077886)Instruction limit reached!
% 0.22/0.30 % (1077886)------------------------------
% 0.22/0.30 % (1077886)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (1077886)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (1077886)CaDiCaL version: 2.1.3
% 0.22/0.30 % (1077886)Termination reason: Instruction limit
% 0.22/0.30 % (1077886)Termination phase: shuffling
% 0.22/0.30 % (1077886)Time elapsed: 0.001 s
% 0.22/0.30 % (1077886)Peak memory usage: 9 MB
% 0.22/0.30 % (1077886)Instructions burned: 4 (million)
% 0.22/0.30 % (1077878) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1077868-1077878"...
% 0.22/0.30 % (1077873) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1077868-1077873"...
% 0.22/0.30 % (1077878)...printing done.
% 0.22/0.30 % (1077896)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=1821109111:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.22/0.30 % (1077893)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2766483710:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.22/0.30 % (1077878)Refutation found. Thanks to Tanya!
% 0.22/0.30 % SZS status Theorem for theBenchmark
% 0.22/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.31 % (1077878)------------------------------
% 0.22/0.31 % (1077878)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.31 % (1077878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.31 % (1077878)CaDiCaL version: 2.1.3
% 0.22/0.31 % (1077878)Termination reason: Refutation
% 0.22/0.31 % (1077878)Time elapsed: 0.020 s
% 0.22/0.31 % (1077878)Peak memory usage: 12 MB
% 0.22/0.31 % (1077878)Instructions burned: 39 (million)
% 0.22/0.31 % (1077868)Success in time 0.047 s
% 0.22/0.31 % Vampire exiting
%------------------------------------------------------------------------------