%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP082^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:08:15 AM UTC 2026
% Result : Theorem 0.58s 0.49s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 16 unt; 0 typ; 3 def)
% Number of atoms : 145 ( 27 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 368 ( 29 ~; 23 |; 0 &; 310 @)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 13 ( 12 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 378 ( 375 usr; 29 con; 0-9 aty)
% Number of variables : 41 ( 0 sgn 41 !; 0 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
list_P561207620_edgeD: $tType ).
thf(type_def_6,type,
option_list_val: $tType ).
thf(type_def_7,type,
produc1432036078de_val: $tType ).
thf(type_def_8,type,
list_list_node: $tType ).
thf(type_def_9,type,
set_list_node: $tType ).
thf(type_def_10,type,
list_node: $tType ).
thf(type_def_11,type,
list_val: $tType ).
thf(type_def_12,type,
set_node: $tType ).
thf(type_def_13,type,
set_val: $tType ).
thf(type_def_14,type,
node: $tType ).
thf(type_def_15,type,
val: $tType ).
thf(type_def_16,type,
g: $tType ).
thf(type_def_17,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
graph_1012773594_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > node > list_node > node > $o ).
thf(func_def_1,type,
graph_435229452_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > list_node > $o ).
thf(func_def_2,type,
graph_272749361_edgeD: ( g > node > list_P561207620_edgeD ) > g > node > list_node ).
thf(func_def_3,type,
append_list_node: list_list_node > list_list_node > list_list_node ).
thf(func_def_4,type,
append_node: list_node > list_node > list_node ).
thf(func_def_5,type,
append_val: list_val > list_val > list_val ).
thf(func_def_6,type,
butlast_list_node: list_list_node > list_list_node ).
thf(func_def_7,type,
butlast_node: list_node > list_node ).
thf(func_def_8,type,
butlast_val: list_val > list_val ).
thf(func_def_9,type,
cons_list_node: list_node > list_list_node > list_list_node ).
thf(func_def_10,type,
cons_node: node > list_node > list_node ).
thf(func_def_11,type,
cons_val: val > list_val > list_val ).
thf(func_def_12,type,
nil_list_node: list_list_node ).
thf(func_def_13,type,
nil_node: list_node ).
thf(func_def_14,type,
nil_val: list_val ).
thf(func_def_15,type,
hd_list_node: list_list_node > list_node ).
thf(func_def_16,type,
hd_node: list_node > node ).
thf(func_def_17,type,
hd_val: list_val > val ).
thf(func_def_18,type,
set_list_node2: list_list_node > set_list_node ).
thf(func_def_19,type,
set_node2: list_node > set_node ).
thf(func_def_20,type,
set_val2: list_val > set_val ).
thf(func_def_21,type,
tl_list_node: list_list_node > list_list_node ).
thf(func_def_22,type,
tl_node: list_node > list_node ).
thf(func_def_23,type,
tl_val: list_val > list_val ).
thf(func_def_24,type,
graph_2009891965_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > node > list_node > node > list_node > node > $o ).
thf(func_def_25,type,
ord_less_eq_set_node: set_node > set_node > $o ).
thf(func_def_26,type,
ord_less_eq_set_val: set_val > set_val > $o ).
thf(func_def_27,type,
sSA_CF848637139eD_val: ( g > list_node ) > ( g > node > list_P561207620_edgeD ) > ( g > produc1432036078de_val > option_list_val ) > g > node > set_val ).
thf(func_def_28,type,
sSA_CF551432799de_val: ( g > list_node ) > ( g > node > set_val ) > ( g > produc1432036078de_val > option_list_val ) > g > val > node ).
thf(func_def_29,type,
sSA_CF1252180629de_val: ( g > list_node ) > ( g > node > set_val ) > ( g > produc1432036078de_val > option_list_val ) > g > val > val > $o ).
thf(func_def_30,type,
collect_node: ( node > $o ) > set_node ).
thf(func_def_31,type,
collect_val: ( val > $o ) > set_val ).
thf(func_def_32,type,
prefix_node: list_node > list_node > $o ).
thf(func_def_33,type,
suffix_node: list_node > list_node > $o ).
thf(func_def_34,type,
member_list_node: list_node > set_list_node > $o ).
thf(func_def_35,type,
member_node: node > set_node > $o ).
thf(func_def_36,type,
member_val: val > set_val > $o ).
thf(func_def_37,type,
alpha_n: g > list_node ).
thf(func_def_38,type,
phi_r: val ).
thf(func_def_39,type,
defs: g > node > set_val ).
thf(func_def_40,type,
g2: g ).
thf(func_def_41,type,
i: node ).
thf(func_def_42,type,
inEdges: g > node > list_P561207620_edgeD ).
thf(func_def_43,type,
invar: g > $o ).
thf(func_def_44,type,
m: node ).
thf(func_def_45,type,
ms: list_node ).
thf(func_def_46,type,
ms2: list_node ).
thf(func_def_47,type,
n: node ).
thf(func_def_48,type,
ns: list_node ).
thf(func_def_49,type,
phis: g > produc1432036078de_val > option_list_val ).
thf(func_def_50,type,
pred_phi_r: node ).
thf(func_def_51,type,
r: val ).
thf(func_def_52,type,
ri: list_node ).
thf(func_def_53,type,
rs: list_node ).
thf(func_def_54,type,
rs_rest: list_node ).
thf(func_def_55,type,
rs2: list_node ).
thf(func_def_56,type,
s: val ).
thf(func_def_57,type,
tmp: list_node ).
thf(func_def_61,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_62,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_63,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_64,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_65,type,
vAND: $o > $o > $o ).
thf(func_def_66,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_67,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_68,type,
sP0: list_node > list_node > $o ).
thf(func_def_69,type,
sK1: list_node > ( node > $o ) > node ).
thf(func_def_70,type,
sK2: list_node > ( node > $o ) > list_node ).
thf(func_def_71,type,
sK3: list_node > ( node > $o ) > list_node ).
thf(func_def_72,type,
sK4: ( node > $o ) > list_node > list_node ).
thf(func_def_73,type,
sK5: ( node > $o ) > list_node > node ).
thf(func_def_74,type,
sK6: ( node > $o ) > list_node > list_node ).
thf(func_def_75,type,
sK7: ( list_node > list_node > $o ) > list_node ).
thf(func_def_76,type,
sK8: ( list_node > list_node > $o ) > node ).
thf(func_def_77,type,
sK9: ( list_node > list_node > $o ) > list_node ).
thf(func_def_78,type,
sK10: ( list_node > list_node > $o ) > node ).
thf(func_def_79,type,
sK11: ( list_node > list_node > $o ) > list_node ).
thf(func_def_80,type,
sK12: ( list_node > list_node > $o ) > node ).
thf(func_def_81,type,
sK13: ( list_node > list_node > $o ) > list_node ).
thf(func_def_82,type,
sK14: ( list_node > list_node > $o ) > node ).
thf(func_def_83,type,
sK15: ( list_node > list_node > $o ) > node ).
thf(func_def_84,type,
sK16: ( list_node > list_node > $o ) > list_node ).
thf(func_def_85,type,
sK17: ( list_node > $o ) > node ).
thf(func_def_86,type,
sK18: ( list_node > $o ) > list_node ).
thf(func_def_87,type,
sK19: ( list_node > $o ) > g > node ).
thf(func_def_88,type,
sK20: ( list_node > $o ) > g > node ).
thf(func_def_89,type,
sK21: ( list_node > $o ) > g > list_node ).
thf(func_def_90,type,
sK22: ( ( node > node > $o ) > list_node > $o ) > node ).
thf(func_def_91,type,
sK23: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_92,type,
sK24: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_93,type,
sK25: ( ( node > node > $o ) > list_node > $o ) > list_node ).
thf(func_def_94,type,
sK26: ( ( node > node > $o ) > list_node > $o ) > node ).
thf(func_def_95,type,
sK27: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_96,type,
sK28: ( ( node > node > $o ) > list_node > $o ) > node ).
thf(func_def_97,type,
sK29: list_node > list_node > list_node > list_node > list_node ).
thf(func_def_98,type,
sK30: ( list_node > list_node > $o ) > list_node ).
thf(func_def_99,type,
sK31: ( list_node > list_node > $o ) > node ).
thf(func_def_100,type,
sK32: ( list_node > list_node > $o ) > list_node ).
thf(func_def_101,type,
sK33: ( list_node > list_node > $o ) > list_node ).
thf(func_def_102,type,
sK34: list_node > node > node > list_node ).
thf(func_def_103,type,
sK35: list_node > node > node > list_node ).
thf(func_def_104,type,
sK36: list_node > node > node > list_node ).
thf(func_def_105,type,
sK37: list_node > node > list_node ).
thf(func_def_106,type,
sK38: list_node > node > list_node ).
thf(func_def_107,type,
sK39: list_node > node > node > list_node ).
thf(func_def_108,type,
sK40: list_node > node > node > list_node ).
thf(func_def_109,type,
sK41: list_node > node > node > list_node ).
thf(func_def_110,type,
sK42: list_list_node > list_node ).
thf(func_def_111,type,
sK43: ( list_node > $o ) > node ).
thf(func_def_112,type,
sK44: ( list_node > $o ) > node ).
thf(func_def_113,type,
sK45: ( list_node > $o ) > list_node ).
thf(func_def_114,type,
sK46: ( list_node > $o ) > node ).
thf(func_def_115,type,
sK47: ( ( node > node ) > list_node > list_node > $o ) > list_node ).
thf(func_def_116,type,
sK48: ( ( node > node ) > list_node > list_node > $o ) > node > node ).
thf(func_def_117,type,
sK49: ( ( node > node ) > list_node > list_node > $o ) > list_node ).
thf(func_def_118,type,
sK50: ( ( node > node ) > list_node > list_node > $o ) > list_node ).
thf(func_def_119,type,
sK51: ( ( node > node ) > list_node > list_node > $o ) > node ).
thf(func_def_120,type,
sK52: ( ( node > node ) > list_node > list_node > $o ) > node > node ).
thf(func_def_121,type,
sK53: node > list_node > list_node > list_node ).
thf(func_def_122,type,
sK54: ( node > $o ) > list_node > list_node ).
thf(func_def_123,type,
sK55: ( node > $o ) > list_node > node ).
thf(func_def_124,type,
sK56: ( node > $o ) > list_node > list_node ).
thf(func_def_125,type,
sK57: ( list_node > $o ) > node ).
thf(func_def_126,type,
sK58: ( list_node > $o ) > list_node ).
thf(func_def_127,type,
sK59: list_node > node > list_node ).
thf(func_def_128,type,
sK60: list_node > node > list_node ).
thf(func_def_129,type,
sK61: list_val > val ).
thf(func_def_130,type,
sK62: g > list_node > ( node > $o ) > node > list_node ).
thf(func_def_131,type,
sK63: g > list_node > ( node > $o ) > node > node ).
thf(func_def_132,type,
sK64: list_node > node > list_node ).
thf(func_def_133,type,
sK65: list_node > node > list_node ).
thf(func_def_134,type,
sK66: val > list_val > list_val ).
thf(func_def_135,type,
sK67: val > list_val > list_val ).
thf(func_def_136,type,
sK68: list_node > list_node ).
thf(func_def_137,type,
sK69: list_node > node ).
thf(func_def_138,type,
sK70: list_node > list_node > list_node > list_node > node > node > list_node ).
thf(func_def_139,type,
sK71: list_node > list_node > list_node > list_node > node > node > list_node ).
thf(func_def_140,type,
sK72: list_val > val > list_val ).
thf(func_def_141,type,
sK73: list_val > val > list_val ).
thf(func_def_142,type,
sK74: list_list_node > list_node ).
thf(func_def_143,type,
sK75: list_list_node > node ).
thf(func_def_144,type,
sK76: list_list_node > list_list_node ).
thf(func_def_145,type,
sK77: list_list_node > list_list_node ).
thf(func_def_146,type,
sK78: list_val > val > list_val ).
thf(func_def_147,type,
sK79: list_val > val > list_val ).
thf(func_def_148,type,
sK80: list_val > val > val ).
thf(func_def_149,type,
sK81: list_node > list_node > list_node ).
thf(func_def_150,type,
sK82: ( list_node > list_node > $o ) > node ).
thf(func_def_151,type,
sK83: ( list_node > list_node > $o ) > node ).
thf(func_def_152,type,
sK84: ( list_node > list_node > $o ) > list_node ).
thf(func_def_153,type,
sK85: ( list_node > list_node > $o ) > list_node ).
thf(func_def_154,type,
sK86: ( list_node > list_node > $o ) > node ).
thf(func_def_155,type,
sK87: ( list_node > list_node > $o ) > list_node ).
thf(func_def_156,type,
sK88: ( list_node > list_node > $o ) > node ).
thf(func_def_157,type,
sK89: ( list_node > list_node > $o ) > list_node ).
thf(func_def_158,type,
sK90: list_node > set_node > node ).
thf(func_def_159,type,
sK91: list_node > list_list_node > list_list_node > list_node ).
thf(func_def_160,type,
sK92: node > list_node > list_node > node ).
thf(func_def_161,type,
sK93: set_val > list_val > val ).
thf(func_def_162,type,
sK94: list_list_node > list_node ).
thf(func_def_163,type,
sK95: list_node > node ).
thf(func_def_164,type,
sK96: ( node > $o ) > ( node > $o ) > node ).
thf(func_def_165,type,
sK97: list_node > ( node > $o ) > list_node ).
thf(func_def_166,type,
sK98: list_node > ( node > $o ) > node ).
thf(func_def_167,type,
sK99: list_node > ( node > $o ) > list_node ).
thf(func_def_168,type,
sK100: list_node > node > list_node > node ).
thf(func_def_169,type,
sK101: list_node > list_node ).
thf(func_def_170,type,
sK102: list_node > node ).
thf(func_def_171,type,
sK103: ( list_node > $o ) > list_node ).
thf(func_def_172,type,
sK104: ( list_node > $o ) > node ).
thf(func_def_173,type,
sK105: node > list_node > list_node ).
thf(func_def_174,type,
sK106: node > list_node > node ).
thf(func_def_175,type,
sK107: node > list_node > list_node ).
thf(func_def_176,type,
sK108: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_177,type,
sK109: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_178,type,
sK110: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_179,type,
sK111: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_180,type,
sK112: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_181,type,
sK113: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_182,type,
sK114: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_183,type,
sK115: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_184,type,
sK116: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_185,type,
sK117: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_186,type,
sK118: list_node ).
thf(func_def_187,type,
sK119: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_188,type,
sK120: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_189,type,
sK121: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_190,type,
sK122: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_191,type,
sK123: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_192,type,
sK124: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_193,type,
sK125: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_194,type,
sK126: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_195,type,
sK127: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_196,type,
sK128: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_197,type,
sK129: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_198,type,
sK130: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_199,type,
sK131: ( list_node > list_node > $o ) > list_node ).
thf(func_def_200,type,
sK132: ( list_node > list_node > $o ) > list_node ).
thf(func_def_201,type,
sK133: ( node > node > $o ) > ( list_node > list_node > $o ) > list_node ).
thf(func_def_202,type,
sK134: ( node > node > $o ) > ( list_node > list_node > $o ) > node ).
thf(func_def_203,type,
sK135: ( node > node > $o ) > ( list_node > list_node > $o ) > node ).
thf(func_def_204,type,
sK136: ( node > node > $o ) > ( list_node > list_node > $o ) > list_node ).
thf(func_def_205,type,
sK137: ( node > node > $o ) > ( list_node > list_node > $o ) > list_node ).
thf(func_def_206,type,
sK138: ( node > node > $o ) > ( list_node > list_node > $o ) > list_node ).
thf(func_def_207,type,
sK139: ( node > node > $o ) > ( list_node > list_node > $o ) > node ).
thf(func_def_208,type,
sK140: ( node > node > $o ) > ( list_node > list_node > $o ) > node ).
thf(func_def_209,type,
sK141: list_list_node > list_node ).
thf(func_def_210,type,
sK142: list_node > list_node ).
thf(func_def_211,type,
sK143: list_node > node ).
thf(func_def_212,type,
sK144: list_val > val ).
thf(func_def_213,type,
sK145: node > list_node > list_node > list_node > list_node ).
thf(func_def_214,type,
sK146: list_node > list_node ).
thf(func_def_215,type,
sK147: list_node > node ).
thf(func_def_216,type,
sK148: list_node ).
thf(func_def_217,type,
sK149: ( list_node > $o ) > list_node ).
thf(func_def_218,type,
sK150: ( list_node > $o ) > node ).
thf(func_def_219,type,
sK151: list_val > val > list_val ).
thf(func_def_220,type,
sK152: list_val > val > list_val ).
thf(func_def_221,type,
sK153: list_node > list_node > node > list_node > list_node ).
thf(func_def_222,type,
sK154: ( val > $o ) > ( val > $o ) > val ).
thf(func_def_223,type,
sK155: list_node > g > list_node ).
thf(func_def_224,type,
sK156: list_node > g > node ).
thf(func_def_225,type,
sK157: list_node > g > node ).
thf(func_def_226,type,
sK158: list_node > node > g > node > node > list_node ).
thf(func_def_227,type,
sK159: list_node > node > g > node > node > list_node ).
thf(func_def_228,type,
sK160: ( list_node > list_node > $o ) > list_node ).
thf(func_def_229,type,
sK161: ( list_node > list_node > $o ) > list_node ).
thf(func_def_230,type,
sK162: ( list_node > list_node > $o ) > node ).
thf(func_def_231,type,
sK163: ( list_node > list_node > $o ) > node ).
thf(func_def_232,type,
sK164: ( list_node > list_node > $o ) > node ).
thf(func_def_233,type,
sK165: ( list_node > list_node > $o ) > list_node ).
thf(func_def_234,type,
sK166: ( list_node > list_node > $o ) > node ).
thf(func_def_235,type,
sK167: ( list_node > list_node > $o ) > list_node ).
thf(func_def_236,type,
sK168: list_val > val > list_val ).
thf(func_def_237,type,
sK169: list_val > val > list_val ).
thf(func_def_238,type,
sK170: list_val > val > val > list_val ).
thf(func_def_239,type,
sK171: list_val > val > val > list_val ).
thf(func_def_240,type,
sK172: list_val > val > val > list_val ).
thf(func_def_241,type,
sK173: list_val > val > val > list_val ).
thf(func_def_242,type,
sK174: list_val > val > val > list_val ).
thf(func_def_243,type,
sK175: list_val > val > val > list_val ).
thf(func_def_244,type,
sK176: node > node > list_node > g > list_node ).
thf(func_def_245,type,
sK177: node > list_node > list_node ).
thf(func_def_246,type,
sK178: node > list_node > list_node ).
thf(func_def_247,type,
sK179: ( list_node > $o ) > node ).
thf(func_def_248,type,
sK180: ( list_node > $o ) > node ).
thf(func_def_249,type,
sK181: ( list_node > $o ) > list_node ).
thf(func_def_250,type,
sK182: ( list_node > list_node > $o ) > list_node ).
thf(func_def_251,type,
sK183: ( list_node > list_node > $o ) > list_node ).
thf(func_def_252,type,
sK184: ( list_node > list_node > $o ) > node ).
thf(func_def_253,type,
sK185: ( list_node > list_node > $o ) > list_node ).
thf(func_def_254,type,
sK186: ( list_node > list_node > $o ) > node ).
thf(func_def_255,type,
sK187: ( list_node > list_node > $o ) > list_node ).
thf(func_def_256,type,
sK188: list_node > list_node ).
thf(func_def_257,type,
sK189: list_node > node ).
thf(func_def_258,type,
sK190: list_node > node > list_node ).
thf(func_def_259,type,
sK191: list_node > node > list_node ).
thf(func_def_260,type,
sK192: ( node > $o ) > list_node > node ).
thf(func_def_261,type,
sK193: ( node > $o ) > list_node > list_node ).
thf(func_def_262,type,
sK194: ( node > $o ) > list_node > list_node ).
thf(func_def_263,type,
sK195: ( node > $o ) > list_node > node ).
thf(func_def_264,type,
sK196: list_node > ( node > $o ) > node ).
thf(func_def_265,type,
sK197: set_node > ( node > $o ) > node ).
thf(func_def_266,type,
sK198: node > list_node > list_node ).
thf(func_def_267,type,
sK199: node > list_node > list_node ).
thf(func_def_268,type,
sK200: list_val > val > list_val ).
thf(func_def_269,type,
sK201: list_val > val > list_val ).
thf(func_def_270,type,
sK202: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_271,type,
sK203: ( ( node > node > $o ) > list_node > $o ) > node ).
thf(func_def_272,type,
sK204: ( ( node > node > $o ) > list_node > $o ) > list_node ).
thf(func_def_273,type,
sK205: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_274,type,
sK206: ( list_node > $o ) > node ).
thf(func_def_275,type,
sK207: ( list_node > $o ) > node ).
thf(func_def_276,type,
sK208: ( list_node > $o ) > list_node ).
thf(func_def_277,type,
sK209: ( list_node > $o ) > node ).
thf(func_def_278,type,
sK210: list_node > node > list_node ).
thf(func_def_279,type,
sK211: list_node > node > list_node ).
thf(func_def_280,type,
sK212: ( node > $o ) > list_node > node > g > node ).
thf(func_def_281,type,
sK213: ( node > $o ) > list_node > node > g > list_node ).
thf(func_def_282,type,
sK214: list_node > node ).
thf(func_def_283,type,
sK215: list_node > list_node ).
thf(func_def_284,type,
sK216: list_node > node ).
thf(func_def_285,type,
sK217: list_node > node ).
thf(func_def_286,type,
sK218: list_node > node > list_node > list_node > list_node ).
thf(func_def_287,type,
sK219: ( list_node > $o ) > node ).
thf(func_def_288,type,
sK220: ( list_node > $o ) > node ).
thf(func_def_289,type,
sK221: ( list_node > $o ) > list_node ).
thf(func_def_290,type,
sK222: node > node > g > list_node > node > list_node ).
thf(func_def_291,type,
sK223: node > node > g > list_node > node > list_node ).
thf(func_def_292,type,
sK224: list_node > node ).
thf(func_def_293,type,
sK225: list_node > list_node ).
thf(func_def_294,type,
sK226: list_val > val ).
thf(func_def_295,type,
sK227: ( list_node > list_node > $o ) > list_node ).
thf(func_def_296,type,
sK228: ( list_node > list_node > $o ) > node ).
thf(func_def_297,type,
sK229: ( list_node > list_node > $o ) > list_node ).
thf(func_def_298,type,
sK230: ( list_node > list_node > $o ) > list_node ).
thf(func_def_299,type,
sK231: list_val > val > list_val ).
thf(func_def_300,type,
sK232: list_val > val > list_val ).
thf(func_def_301,type,
sK233: list_node > ( node > $o ) > node ).
thf(func_def_302,type,
sK234: list_node > ( node > $o ) > list_node ).
thf(func_def_303,type,
sK235: list_node > ( node > $o ) > list_node ).
thf(func_def_304,type,
sK236: val > list_val > list_val ).
thf(func_def_305,type,
sK237: val > list_val > list_val ).
thf(func_def_306,type,
sK238: list_node > list_node > list_node ).
thf(func_def_307,type,
sK239: list_node > list_node > list_node ).
thf(func_def_308,type,
sK240: list_node > list_node > list_node ).
thf(func_def_309,type,
sK241: ( list_node > list_node > $o ) > list_node ).
thf(func_def_310,type,
sK242: ( list_node > list_node > $o ) > node ).
thf(func_def_311,type,
sK243: ( list_node > list_node > $o ) > list_node ).
thf(func_def_312,type,
sK244: ( list_node > list_node > $o ) > node ).
thf(func_def_313,type,
sK245: ( list_node > list_node > $o ) > node ).
thf(func_def_314,type,
sK246: ( list_node > list_node > $o ) > node ).
thf(func_def_315,type,
sK247: ( list_node > list_node > $o ) > node ).
thf(func_def_316,type,
sK248: ( list_node > list_node > $o ) > list_node ).
thf(func_def_317,type,
sK249: ( list_node > list_node > $o ) > node ).
thf(func_def_318,type,
sK250: ( list_node > list_node > $o ) > node ).
thf(func_def_319,type,
sK251: ( list_node > list_node > $o ) > list_node ).
thf(func_def_320,type,
sK252: ( list_node > list_node > $o ) > node ).
thf(func_def_321,type,
sK253: node ).
thf(func_def_322,type,
sK254: list_node ).
thf(func_def_323,type,
sK255: g > list_node > list_node ).
thf(func_def_324,type,
sK256: g > list_node > node ).
thf(func_def_325,type,
sK257: g > list_node > node ).
thf(func_def_326,type,
sK258: list_node > node ).
thf(func_def_327,type,
sK259: g > node > list_node > node > list_node ).
thf(func_def_328,type,
sK260: ( node > $o ) > list_node > list_node ).
thf(func_def_329,type,
sK261: ( node > $o ) > list_node > list_node ).
thf(func_def_330,type,
sK262: ( node > $o ) > list_node > node ).
thf(func_def_331,type,
sK263: list_node > list_node ).
thf(func_def_332,type,
sK264: list_node > node ).
thf(func_def_333,type,
sK265: list_node > list_node > list_node > list_node ).
thf(func_def_334,type,
sK266: list_node > list_node > list_node > node > list_node ).
thf(func_def_335,type,
sK267: node > g > ( node > list_node > node > $o ) > list_node ).
thf(func_def_336,type,
sK268: node > g > ( node > list_node > node > $o ) > node ).
thf(func_def_337,type,
sK269: node > g > ( node > list_node > node > $o ) > node ).
thf(func_def_338,type,
sK270: node > g > node > node > list_node > list_node ).
thf(func_def_339,type,
sK271: node > g > node > node > list_node > list_node ).
thf(func_def_340,type,
sK272: node > g > node > node > list_node > list_node ).
thf(func_def_341,type,
sK273: node > list_node > list_node ).
thf(func_def_342,type,
sK274: node > list_node > list_node ).
thf(func_def_343,type,
sK275: list_node > node ).
thf(func_def_344,type,
sK276: list_node > ( node > $o ) > list_node ).
thf(func_def_345,type,
sK277: list_node > ( node > $o ) > node ).
thf(func_def_346,type,
sK278: list_node > ( node > $o ) > list_node ).
thf(func_def_347,type,
sK279: list_node > ( node > $o ) > node ).
thf(func_def_348,type,
sK280: list_node > ( node > $o ) > node ).
thf(func_def_349,type,
sK281: node > g > ( node > list_node > node > $o ) > node ).
thf(func_def_350,type,
sK282: node > g > ( node > list_node > node > $o ) > node ).
thf(func_def_351,type,
sK283: node > g > ( node > list_node > node > $o ) > list_node ).
thf(func_def_352,type,
sK284: ( list_node > $o ) > node ).
thf(func_def_353,type,
sK285: ( list_node > $o ) > node ).
thf(func_def_354,type,
sK286: ( list_node > $o ) > node ).
thf(func_def_355,type,
sK287: ( list_node > $o ) > list_node ).
thf(func_def_356,type,
sK288: ( list_node > list_node > $o ) > list_node ).
thf(func_def_357,type,
sK289: ( list_node > list_node > $o ) > list_node ).
thf(func_def_358,type,
sK290: ( list_node > list_node > $o ) > node ).
thf(func_def_359,type,
sK291: ( list_node > list_node > $o ) > node ).
thf(func_def_360,type,
sK292: ( list_node > list_node > $o ) > list_node ).
thf(func_def_361,type,
sK293: ( list_node > list_node > $o ) > list_node ).
thf(func_def_362,type,
sK294: list_val > val > list_val ).
thf(func_def_363,type,
sK295: list_val > val > list_val ).
thf(func_def_364,type,
sK296: list_node > list_node > list_node ).
thf(func_def_365,type,
sK297: list_node > list_node > node ).
thf(func_def_366,type,
sK298: list_node > list_node > list_node ).
thf(func_def_367,type,
sK299: list_node > list_node > node ).
thf(func_def_368,type,
sK300: list_node > list_node > node ).
thf(func_def_369,type,
sK301: list_node > list_node > list_node ).
thf(func_def_370,type,
sK302: list_node > list_node > node ).
thf(func_def_371,type,
sK303: list_node > list_node > list_node ).
thf(func_def_372,type,
sK304: list_node ).
thf(func_def_373,type,
vNOT: $o > $o ).
thf(f2,axiom,
( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_rs_H__rest__def) ).
thf(f4,axiom,
! [X4: list_node,X1: node,X3: node,X2: list_node,X0: g,X5: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ ( append_node @ X2 @ ( cons_node @ X3 @ X4 ) ) @ X5 )
=> ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X0 @ X3 @ ( cons_node @ X3 @ X4 ) @ X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_old_Opath2__split_I2_J) ).
thf(f6,axiom,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5_rs_H__props_I1_J) ).
thf(f353,conjecture,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(f354,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(negated_conjecture,[status(cth)],[f353]) ).
thf(f514,plain,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(rectify,[],[f354]) ).
thf(f515,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r )
!= $true ),
inference(fool_elimination,[],[f514]) ).
thf(f539,plain,
! [X0: list_node,X1: node,X2: node,X3: list_node,X4: g,X5: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X4 @ X1 @ ( append_node @ X3 @ ( cons_node @ X2 @ X0 ) ) @ X5 )
=> ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X4 @ X2 @ ( cons_node @ X2 @ X0 ) @ X5 ) ),
inference(rectify,[],[f4]) ).
thf(f540,plain,
! [X1: node,X2: node,X4: g,X0: list_node,X3: list_node,X5: node] :
( ( $true
= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X4 @ X1 @ ( append_node @ X3 @ ( cons_node @ X2 @ X0 ) ) @ X5 ) )
=> ( $true
= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X4 @ X2 @ ( cons_node @ X2 @ X0 ) @ X5 ) ) ),
inference(fool_elimination,[],[f539]) ).
thf(f697,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
inference(rectify,[],[f6]) ).
thf(f698,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r )
= $true ),
inference(fool_elimination,[],[f697]) ).
thf(f869,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r )
!= $true ),
inference(flattening,[],[f515]) ).
thf(f1057,plain,
! [X3: list_node,X2: node,X0: list_node,X5: node,X1: node,X4: g] :
( ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X4 @ X1 @ ( append_node @ X3 @ ( cons_node @ X2 @ X0 ) ) @ X5 ) )
| ( $true
= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X4 @ X2 @ ( cons_node @ X2 @ X0 ) @ X5 ) ) ),
inference(ennf_transformation,[],[f540]) ).
thf(f1631,plain,
! [X0: list_node,X1: node,X2: list_node,X3: node,X4: node,X5: g] :
( ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X4 @ ( append_node @ X0 @ ( cons_node @ X1 @ X2 ) ) @ X3 ) )
| ( $true
= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X1 @ ( cons_node @ X1 @ X2 ) @ X3 ) ) ),
inference(rectify,[],[f1057]) ).
thf(f2012,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r )
!= $true ),
inference(cnf_transformation,[],[f869]) ).
thf(f2102,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r )
= $true ),
inference(cnf_transformation,[],[f698]) ).
thf(f2350,plain,
! [X2: list_node,X3: node,X0: list_node,X1: node,X4: node,X5: g] :
( ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X4 @ ( append_node @ X0 @ ( cons_node @ X1 @ X2 ) ) @ X3 ) )
| ( $true
= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X1 @ ( cons_node @ X1 @ X2 ) @ X3 ) ) ),
inference(cnf_transformation,[],[f1631]) ).
thf(f2371,plain,
( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ),
inference(cnf_transformation,[],[f2]) ).
thf(f2853,definition,
( spl305_26
<=> ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl305_26])],[avatar_definition]) ).
thf(f2855,plain,
( ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r )
!= $true )
| spl305_26 ),
inference(avatar_component_clause,[],[f2853]) ).
thf(f2856,plain,
~ spl305_26,
inference(avatar_split_clause,[],[f2012,f2853]) ).
thf(f2908,definition,
( spl305_37
<=> ( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ) ),
introduced(definition,[new_symbols(definition,[spl305_37])],[avatar_definition]) ).
thf(f2910,plain,
( ( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) )
| ~ spl305_37 ),
inference(avatar_component_clause,[],[f2908]) ).
thf(f2911,plain,
spl305_37,
inference(avatar_split_clause,[],[f2371,f2908]) ).
thf(f2968,definition,
( spl305_49
<=> ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl305_49])],[avatar_definition]) ).
thf(f2970,plain,
( ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r )
= $true )
| ~ spl305_49 ),
inference(avatar_component_clause,[],[f2968]) ).
thf(f2971,plain,
spl305_49,
inference(avatar_split_clause,[],[f2102,f2968]) ).
thf(f3207,plain,
( ! [X2: node,X0: g,X1: node] :
( ( $true
= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X0 @ i @ ( cons_node @ i @ rs_rest ) @ X2 ) )
| ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ rs @ X2 ) ) )
| ~ spl305_37 ),
inference(superposition,[],[f2350,f2910]) ).
thf(f3348,plain,
( ! [X0: node] :
( ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ X0 @ rs @ pred_phi_r ) )
| ( $true != $true ) )
| spl305_26
| ~ spl305_37 ),
inference(superposition,[],[f2855,f3207]) ).
thf(f3358,plain,
( ! [X0: node] :
( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ X0 @ rs @ pred_phi_r ) )
| spl305_26
| ~ spl305_37 ),
inference(trivial_inequality_removal,[],[f3348]) ).
thf(f3378,plain,
( ( $true != $true )
| spl305_26
| ~ spl305_37
| ~ spl305_49 ),
inference(superposition,[],[f3358,f2970]) ).
thf(f3379,plain,
( $false
| spl305_26
| ~ spl305_37
| ~ spl305_49 ),
inference(trivial_inequality_removal,[],[f3378]) ).
thf(f3380,plain,
( spl305_26
| ~ spl305_37
| ~ spl305_49 ),
inference(avatar_contradiction_clause,[],[f3379]) ).
cnf(s28,plain,
~ spl305_26,
inference(sat_conversion,[],[f2856]) ).
cnf(s43,plain,
spl305_37,
inference(sat_conversion,[],[f2911]) ).
cnf(s59,plain,
spl305_49,
inference(sat_conversion,[],[f2971]) ).
cnf(s110,plain,
( spl305_26
| ~ spl305_37
| ~ spl305_49 ),
inference(sat_conversion,[],[f3380]) ).
cnf(s122,plain,
spl305_26,
inference(rat,[],[s110,s59,s43]) ).
cnf(s129,plain,
$false,
inference(rat,[],[s28,s122]) ).
thf(f3381,plain,
$false,
inference(avatar_sat_refutation,[],[s129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP082^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n006.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 19:48:39 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.21/0.28 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.58/0.42 % (1223106)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.58/0.42 % (1223116)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=31010141:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.58/0.42 % (1223117)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.58/0.42 % (1223117)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.58/0.42 % (1223111)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=292958369:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.58/0.42 % (1223113)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2034366858:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.58/0.42 % (1223114)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=1812865501: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.58/0.42 % (1223115)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=958915654:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.58/0.42 % (1223117)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=2268640379:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.58/0.42 % (1223113)Instruction limit reached!
% 0.58/0.42 % (1223113)------------------------------
% 0.58/0.42 % (1223113)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.42 % (1223113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.42 % (1223113)CaDiCaL version: 2.1.3
% 0.58/0.42 % (1223113)Termination reason: Instruction limit
% 0.58/0.42 % (1223113)Termination phase: shuffling
% 0.58/0.42 % (1223113)Time elapsed: 0.002 s
% 0.58/0.42 % (1223113)Peak memory usage: 10 MB
% 0.58/0.42 % (1223113)Instructions burned: 4 (million)
% 0.58/0.42 % (1223116)Instruction limit reached!
% 0.58/0.42 % (1223116)------------------------------
% 0.58/0.42 % (1223116)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.42 % (1223116)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.42 % (1223116)CaDiCaL version: 2.1.3
% 0.58/0.42 % (1223116)Termination reason: Instruction limit
% 0.58/0.42 % (1223116)Termination phase: Preprocessing 3
% 0.58/0.42 % (1223116)Time elapsed: 0.018 s
% 0.58/0.42 % (1223116)Peak memory usage: 11 MB
% 0.58/0.42 % (1223116)Instructions burned: 76 (million)
% 0.58/0.42 % (1223115)Instruction limit reached!
% 0.58/0.42 % (1223115)------------------------------
% 0.58/0.42 % (1223115)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.42 % (1223115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.42 % (1223115)CaDiCaL version: 2.1.3
% 0.58/0.42 % (1223115)Termination reason: Instruction limit
% 0.58/0.42 % (1223115)Termination phase: shuffling
% 0.58/0.42 % (1223115)Time elapsed: 0.010 s
% 0.58/0.42 % (1223115)Peak memory usage: 10 MB
% 0.58/0.42 % (1223115)Instructions burned: 24 (million)
% 0.58/0.42 % (1223112)lrs+10_16_si=on:nwc=1.5:random_seed=1519403092:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.58/0.42 % (1223125)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=3910451960:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.58/0.42 % (1223124)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=437507706:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.58/0.42 % (1223125)Instruction limit reached!
% 0.58/0.42 % (1223125)------------------------------
% 0.58/0.42 % (1223125)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.42 % (1223125)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.42 % (1223125)CaDiCaL version: 2.1.3
% 0.58/0.42 % (1223125)Termination reason: Instruction limit
% 0.58/0.42 % (1223125)Termination phase: shuffling
% 0.58/0.42 % (1223125)Time elapsed: 0.002 s
% 0.58/0.42 % (1223125)Peak memory usage: 10 MB
% 0.58/0.42 % (1223125)Instructions burned: 10 (million)
% 0.58/0.46 % (1223124)Instruction limit reached!
% 0.58/0.46 % (1223124)------------------------------
% 0.58/0.46 % (1223124)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.46 % (1223124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.46 % (1223124)CaDiCaL version: 2.1.3
% 0.58/0.46 % (1223124)Termination reason: Instruction limit
% 0.58/0.46 % (1223124)Termination phase: shuffling
% 0.58/0.46 % (1223124)Time elapsed: 0.004 s
% 0.58/0.46 % (1223124)Peak memory usage: 10 MB
% 0.58/0.46 % (1223124)Instructions burned: 7 (million)
% 0.58/0.46 % (1223126)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.58/0.46 % (1223112)Instruction limit reached!
% 0.58/0.46 % (1223112)------------------------------
% 0.58/0.46 % (1223112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.46 % (1223112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.46 % (1223112)CaDiCaL version: 2.1.3
% 0.58/0.46 % (1223112)Termination reason: Instruction limit
% 0.58/0.46 % (1223112)Termination phase: shuffling
% 0.58/0.46 % (1223112)Time elapsed: 0.013 s
% 0.58/0.46 % (1223112)Peak memory usage: 10 MB
% 0.58/0.46 % (1223112)Instructions burned: 18 (million)
% 0.58/0.46 % (1223126)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=3326915343:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.58/0.46 % (1223126)Instruction limit reached!
% 0.58/0.46 % (1223126)------------------------------
% 0.58/0.46 % (1223126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.46 % (1223126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.46 % (1223126)CaDiCaL version: 2.1.3
% 0.58/0.46 % (1223126)Termination reason: Instruction limit
% 0.58/0.46 % (1223126)Termination phase: shuffling
% 0.58/0.46 % (1223126)Time elapsed: 0.004 s
% 0.58/0.46 % (1223126)Peak memory usage: 10 MB
% 0.58/0.46 % (1223126)Instructions burned: 8 (million)
% 0.58/0.46 % (1223130)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=1951887314:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.58/0.46 % (1223111)Instruction limit reached!
% 0.58/0.46 % (1223111)------------------------------
% 0.58/0.46 % (1223111)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.46 % (1223111)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.46 % (1223111)CaDiCaL version: 2.1.3
% 0.58/0.46 % (1223111)Termination reason: Instruction limit
% 0.58/0.46 % (1223111)Termination phase: Preprocessing 3
% 0.58/0.46 % (1223111)Time elapsed: 0.039 s
% 0.58/0.46 % (1223111)Peak memory usage: 12 MB
% 0.58/0.46 % (1223111)Instructions burned: 87 (million)
% 0.58/0.46 % (1223131)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.58/0.46 % (1223131)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.58/0.46 % (1223130)Instruction limit reached!
% 0.58/0.46 % (1223130)------------------------------
% 0.58/0.46 % (1223130)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.46 % (1223130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.46 % (1223130)CaDiCaL version: 2.1.3
% 0.58/0.46 % (1223130)Termination reason: Instruction limit
% 0.58/0.46 % (1223130)Termination phase: shuffling
% 0.58/0.46 % (1223130)Time elapsed: 0.003 s
% 0.58/0.46 % (1223130)Peak memory usage: 10 MB
% 0.58/0.46 % (1223130)Instructions burned: 15 (million)
% 0.58/0.46 % (1223131)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=945650183: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.58/0.46 % (1223132)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=2640667616:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.58/0.46 % (1223137)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=4094892228:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 0.58/0.49 % (1223134)lrs+10_1_si=on:cs=on:random_seed=2568936560:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.58/0.49 % (1223136)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.58/0.49 % (1223131)Instruction limit reached!
% 0.58/0.49 % (1223131)------------------------------
% 0.58/0.49 % (1223131)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223131)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223131)Termination reason: Instruction limit
% 0.58/0.49 % (1223131)Termination phase: shuffling
% 0.58/0.49 % (1223131)Time elapsed: 0.013 s
% 0.58/0.49 % (1223131)Peak memory usage: 10 MB
% 0.58/0.49 % (1223131)Instructions burned: 30 (million)
% 0.58/0.49 % (1223134)Instruction limit reached!
% 0.58/0.49 % (1223134)------------------------------
% 0.58/0.49 % (1223134)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223134)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223134)Termination reason: Instruction limit
% 0.58/0.49 % (1223134)Termination phase: shuffling
% 0.58/0.49 % (1223134)Time elapsed: 0.005 s
% 0.58/0.49 % (1223134)Peak memory usage: 10 MB
% 0.58/0.49 % (1223134)Instructions burned: 10 (million)
% 0.58/0.49 % (1223136)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=1661523320:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.58/0.49 % (1223137)Instruction limit reached!
% 0.58/0.49 % (1223137)------------------------------
% 0.58/0.49 % (1223137)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223137)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223137)Termination reason: Instruction limit
% 0.58/0.49 % (1223137)Termination phase: Property scanning
% 0.58/0.49 % (1223137)Time elapsed: 0.009 s
% 0.58/0.49 % (1223137)Peak memory usage: 10 MB
% 0.58/0.49 % (1223137)Instructions burned: 40 (million)
% 0.58/0.49 % (1223136)Instruction limit reached!
% 0.58/0.49 % (1223136)------------------------------
% 0.58/0.49 % (1223136)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223136)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223136)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223136)Termination reason: Instruction limit
% 0.58/0.49 % (1223136)Termination phase: shuffling
% 0.58/0.49 % (1223136)Time elapsed: 0.003 s
% 0.58/0.49 % (1223136)Peak memory usage: 10 MB
% 0.58/0.49 % (1223136)Instructions burned: 6 (million)
% 0.58/0.49 % (1223117)Instruction limit reached!
% 0.58/0.49 % (1223117)------------------------------
% 0.58/0.49 % (1223117)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223117)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223117)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223117)Termination reason: Instruction limit
% 0.58/0.49 % (1223117)Termination phase: Saturation
% 0.58/0.49 % (1223117)Time elapsed: 0.068 s
% 0.58/0.49 % (1223117)Peak memory usage: 13 MB
% 0.58/0.49 % (1223117)Instructions burned: 159 (million)
% 0.58/0.49 % (1223145)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=475825261:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.58/0.49 % (1223145)Instruction limit reached!
% 0.58/0.49 % (1223145)------------------------------
% 0.58/0.49 % (1223145)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223145)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223145)Termination reason: Instruction limit
% 0.58/0.49 % (1223145)Termination phase: shuffling
% 0.58/0.49 % (1223145)Time elapsed: 0.004 s
% 0.58/0.49 % (1223145)Peak memory usage: 10 MB
% 0.58/0.49 % (1223145)Instructions burned: 18 (million)
% 0.58/0.49 % (1223143)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=4174364308:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 0.58/0.49 % (1223144)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=3861855309:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 0.58/0.49 % (1223146)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=2888658282:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 0.58/0.49 % (1223147)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=441437499:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 0.58/0.49 % (1223132)Instruction limit reached!
% 0.58/0.49 % (1223132)------------------------------
% 0.58/0.49 % (1223132)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223132)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223132)Termination reason: Instruction limit
% 0.58/0.49 % (1223132)Termination phase: Property scanning
% 0.58/0.49 % (1223132)Time elapsed: 0.037 s
% 0.58/0.49 % (1223132)Peak memory usage: 11 MB
% 0.58/0.49 % (1223132)Instructions burned: 88 (million)
% 0.58/0.49 % (1223144)Instruction limit reached!
% 0.58/0.49 % (1223144)------------------------------
% 0.58/0.49 % (1223144)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223144)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223144)Termination reason: Instruction limit
% 0.58/0.49 % (1223144)Termination phase: shuffling
% 0.58/0.49 % (1223144)Time elapsed: 0.011 s
% 0.58/0.49 % (1223144)Peak memory usage: 11 MB
% 0.58/0.49 % (1223144)Instructions burned: 26 (million)
% 0.58/0.49 % (1223147)Instruction limit reached!
% 0.58/0.49 % (1223147)------------------------------
% 0.58/0.49 % (1223147)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223147)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223147)Termination reason: Instruction limit
% 0.58/0.49 % (1223147)Termination phase: shuffling
% 0.58/0.49 % (1223147)Time elapsed: 0.006 s
% 0.58/0.49 % (1223147)Peak memory usage: 10 MB
% 0.58/0.49 % (1223147)Instructions burned: 14 (million)
% 0.58/0.49 % (1223149)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=3636272428:st=4:i=2:add=off:sd=3:nm=16:fsr=off:rtra=on:ss=axioms:sgt=8:ntd=on_2998 on theBenchmark for (2998ds/2Mi)
% 0.58/0.49 % (1223149)Instruction limit reached!
% 0.58/0.49 % (1223149)------------------------------
% 0.58/0.49 % (1223149)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223149)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223149)Termination reason: Instruction limit
% 0.58/0.49 % (1223149)Termination phase: shuffling
% 0.58/0.49 % (1223149)Time elapsed: 0.004 s
% 0.58/0.49 % (1223149)Peak memory usage: 10 MB
% 0.58/0.49 % (1223149)Instructions burned: 7 (million)
% 0.58/0.49 % (1223154)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=1326567642:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 0.58/0.49 % (1223155)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=2971957490:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 0.58/0.49 % (1223157)lrs+1002_1024_sil=128000:tgt=ground:fde=none:e2e=on:si=on:uwa=off:nwc=1:random_seed=1872906667:cond=on:i=60:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/60Mi)
% 0.58/0.49 % (1223158)WARNING Broken Constraint: if sine_to_age_generality_threshold(10) 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.58/0.49 % (1223158)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 0.58/0.49 % (1223158)ott+21_1_to=kbo:sil=128000:cnfonf=lazy_gen:bsd=on:si=on:sp=const_frequency:lma=off:uwa=off:foolp=on:s2agt=10:lwlo=on:random_seed=7936753:i=14:add=off:nm=40:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.58/0.49 % (1223155)Instruction limit reached!
% 0.58/0.49 % (1223155)------------------------------
% 0.58/0.49 % (1223155)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223155)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223155)Termination reason: Instruction limit
% 0.58/0.49 % (1223155)Termination phase: shuffling
% 0.58/0.49 % (1223155)Time elapsed: 0.010 s
% 0.58/0.49 % (1223155)Peak memory usage: 10 MB
% 0.58/0.49 % (1223155)Instructions burned: 24 (million)
% 0.58/0.49 % (1223158)Instruction limit reached!
% 0.58/0.49 % (1223158)------------------------------
% 0.58/0.49 % (1223158)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223158)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223158)Termination reason: Instruction limit
% 0.58/0.49 % (1223158)Termination phase: shuffling
% 0.58/0.49 % (1223158)Time elapsed: 0.007 s
% 0.58/0.49 % (1223158)Peak memory usage: 10 MB
% 0.58/0.49 % (1223158)Instructions burned: 16 (million)
% 0.58/0.49 % (1223154)Instruction limit reached!
% 0.58/0.49 % (1223154)------------------------------
% 0.58/0.49 % (1223154)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223154)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223154)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223154)Termination reason: Instruction limit
% 0.58/0.49 % (1223154)Termination phase: shuffling
% 0.58/0.49 % (1223154)Time elapsed: 0.028 s
% 0.58/0.49 % (1223154)Peak memory usage: 10 MB
% 0.58/0.49 % (1223154)Instructions burned: 26 (million)
% 0.58/0.49 % (1223114) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1223106-1223114"...
% 0.58/0.49 % (1223143)Refutation not found, incomplete strategy
% 0.58/0.49 % (1223143)------------------------------
% 0.58/0.49 % (1223143)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223143)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223143)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.49 % (1223143)Time elapsed: 0.062 s
% 0.58/0.49 % (1223143)Peak memory usage: 14 MB
% 0.58/0.49 % (1223143)Instructions burned: 137 (million)
% 0.58/0.49 % (1223143)------------------------------
% 0.58/0.49 % (1223143)------------------------------
% 0.58/0.49 % (1223157)Instruction limit reached!
% 0.58/0.49 % (1223157)------------------------------
% 0.58/0.49 % (1223157)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223157)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223157)Termination reason: Instruction limit
% 0.58/0.49 % (1223157)Termination phase: Preprocessing 3
% 0.58/0.49 % (1223157)Time elapsed: 0.027 s
% 0.58/0.49 % (1223157)Peak memory usage: 11 MB
% 0.58/0.49 % (1223157)Instructions burned: 61 (million)
% 0.58/0.49 % (1223163)WARNING Broken Constraint: if choice_reasoning(on) has been set then choice_ax(on) is equal to off
% 0.58/0.49 % (1223114)...printing done.
% 0.58/0.49 % (1223164)dis+1004_50_to=lpo:drc=off:fde=unused:cnfonf=lazy_not_gen_be_off:si=on:sp=reverse_arity:spb=units:cbe=off:foolp=on:random_seed=611765214:uwa_fpi=on:i=31:doe=on:bd=preordered:rtra=on:fsd=on_2998 on theBenchmark for (2998ds/31Mi)
% 0.58/0.49 % (1223114)Refutation found. Thanks to Tanya!
% 0.58/0.49 % SZS status Theorem for theBenchmark
% 0.58/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.49 % (1223114)------------------------------
% 0.58/0.49 % (1223114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.49 % (1223114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.49 % (1223114)CaDiCaL version: 2.1.3
% 0.58/0.49 % (1223114)Termination reason: Refutation
% 0.58/0.49 % (1223114)Time elapsed: 0.141 s
% 0.58/0.49 % (1223114)Peak memory usage: 16 MB
% 0.58/0.49 % (1223114)Instructions burned: 298 (million)
% 0.58/0.49 % (1223106)Success in time 0.203 s
% 0.58/0.49 % Vampire exiting
%------------------------------------------------------------------------------