%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP081^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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.30s 0.46s
% Output : Refutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 151 ( 33 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 466 ( 22 ~; 12 |; 0 &; 426 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 13 ( 12 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 305 ( 302 usr; 19 con; 0-7 aty)
% Number of variables : 44 ( 0 ^; 44 !; 0 ?; 44 :)
% 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,
finite_finite_node: set_node > $o ).
thf(func_def_1,type,
finite_finite_val: set_val > $o ).
thf(func_def_2,type,
graph_1012773594_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > node > list_node > node > $o ).
thf(func_def_3,type,
graph_435229452_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > list_node > $o ).
thf(func_def_4,type,
graph_272749361_edgeD: ( g > node > list_P561207620_edgeD ) > g > node > list_node ).
thf(func_def_5,type,
append_list_node: list_list_node > list_list_node > list_list_node ).
thf(func_def_6,type,
append_node: list_node > list_node > list_node ).
thf(func_def_7,type,
append_val: list_val > list_val > list_val ).
thf(func_def_8,type,
butlast_list_node: list_list_node > list_list_node ).
thf(func_def_9,type,
butlast_node: list_node > list_node ).
thf(func_def_10,type,
butlast_val: list_val > list_val ).
thf(func_def_11,type,
cons_list_node: list_node > list_list_node > list_list_node ).
thf(func_def_12,type,
cons_node: node > list_node > list_node ).
thf(func_def_13,type,
cons_val: val > list_val > list_val ).
thf(func_def_14,type,
nil_list_node: list_list_node ).
thf(func_def_15,type,
nil_node: list_node ).
thf(func_def_16,type,
nil_val: list_val ).
thf(func_def_17,type,
hd_node: list_node > node ).
thf(func_def_18,type,
hd_val: list_val > val ).
thf(func_def_19,type,
set_list_node2: list_list_node > set_list_node ).
thf(func_def_20,type,
set_node2: list_node > set_node ).
thf(func_def_21,type,
set_val2: list_val > set_val ).
thf(func_def_22,type,
tl_list_node: list_list_node > list_list_node ).
thf(func_def_23,type,
tl_node: list_node > list_node ).
thf(func_def_24,type,
tl_val: list_val > list_val ).
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,
rs2: list_node ).
thf(func_def_55,type,
s: val ).
thf(func_def_59,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_60,type,
vAND: $o > $o > $o ).
thf(func_def_61,type,
vOR: $o > $o > $o ).
thf(func_def_62,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_63,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_64,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_65,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_66,type,
vNOT: $o > $o ).
thf(func_def_67,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_68,type,
vIMP: $o > $o > $o ).
thf(func_def_69,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_70,type,
sP0: ( node > node > $o ) > ( list_node > list_node > $o ) > $o ).
thf(func_def_71,type,
sP1: ( list_node > list_val > $o ) > ( node > val > $o ) > $o ).
thf(func_def_72,type,
sP2: ( list_val > list_val > $o ) > ( val > val > $o ) > $o ).
thf(func_def_73,type,
sP3: list_node > list_node > list_node > list_node > node > node > $o ).
thf(func_def_74,type,
sP4: ( list_node > list_node > $o ) > $o ).
thf(func_def_75,type,
sK5: ( list_node > $o ) > node ).
thf(func_def_76,type,
sK6: ( list_node > $o ) > list_node ).
thf(func_def_77,type,
sK7: ( list_node > $o ) > node ).
thf(func_def_78,type,
sK8: ( list_node > $o ) > node ).
thf(func_def_79,type,
sK9: list_node > list_node > node > list_node > list_node ).
thf(func_def_80,type,
sK10: ( list_node > $o ) > list_node ).
thf(func_def_81,type,
sK11: ( list_node > $o ) > node ).
thf(func_def_82,type,
sK12: ( list_node > $o ) > list_node ).
thf(func_def_83,type,
sK13: ( list_node > $o ) > node ).
thf(func_def_84,type,
sK14: ( list_node > $o ) > node ).
thf(func_def_85,type,
sK15: ( list_node > list_node > $o ) > list_node ).
thf(func_def_86,type,
sK16: ( list_node > list_node > $o ) > list_node ).
thf(func_def_87,type,
sK17: ( list_node > list_node > $o ) > node ).
thf(func_def_88,type,
sK18: ( list_node > list_node > $o ) > list_node ).
thf(func_def_89,type,
sK19: ( list_node > list_node > $o ) > list_node ).
thf(func_def_90,type,
sK20: ( list_node > list_node > $o ) > node ).
thf(func_def_91,type,
sK21: list_node > node ).
thf(func_def_92,type,
sK22: list_node > node ).
thf(func_def_93,type,
sK23: list_node > list_node ).
thf(func_def_94,type,
sK24: list_node > node ).
thf(func_def_95,type,
sK25: node > g > node > list_node > node > list_node ).
thf(func_def_96,type,
sK26: node > g > node > list_node > node > list_node ).
thf(func_def_97,type,
sK27: node > g > node > list_node > node > list_node ).
thf(func_def_98,type,
sK28: ( ( node > node > $o ) > list_node > $o ) > node ).
thf(func_def_99,type,
sK29: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_100,type,
sK30: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_101,type,
sK31: ( ( node > node > $o ) > list_node > $o ) > node ).
thf(func_def_102,type,
sK32: ( ( node > node > $o ) > list_node > $o ) > node ).
thf(func_def_103,type,
sK33: ( ( node > node > $o ) > list_node > $o ) > list_node ).
thf(func_def_104,type,
sK34: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_105,type,
sK35: list_node > node ).
thf(func_def_106,type,
sK36: list_node > list_node ).
thf(func_def_107,type,
sK37: list_val > val > list_val ).
thf(func_def_108,type,
sK38: list_val > val > val ).
thf(func_def_109,type,
sK39: list_val > val > list_val ).
thf(func_def_110,type,
sK40: ( node > node > $o ) > ( list_node > list_node > $o ) > node ).
thf(func_def_111,type,
sK41: ( node > node > $o ) > ( list_node > list_node > $o ) > list_node ).
thf(func_def_112,type,
sK42: ( node > node > $o ) > ( list_node > list_node > $o ) > list_node ).
thf(func_def_113,type,
sK43: ( node > node > $o ) > ( list_node > list_node > $o ) > node ).
thf(func_def_114,type,
sK44: ( list_node > list_node > $o ) > list_node ).
thf(func_def_115,type,
sK45: ( node > node > $o ) > ( list_node > list_node > $o ) > list_node ).
thf(func_def_116,type,
sK46: ( node > node > $o ) > ( list_node > list_node > $o ) > node ).
thf(func_def_117,type,
sK47: ( node > node > $o ) > ( list_node > list_node > $o ) > node ).
thf(func_def_118,type,
sK48: ( node > node > $o ) > ( list_node > list_node > $o ) > list_node ).
thf(func_def_119,type,
sK49: ( list_node > list_node > $o ) > list_node ).
thf(func_def_120,type,
sK50: list_node > node > list_node ).
thf(func_def_121,type,
sK51: list_node > node > list_node ).
thf(func_def_122,type,
sK52: ( node > $o ) > list_node > list_node ).
thf(func_def_123,type,
sK53: ( node > $o ) > list_node > node ).
thf(func_def_124,type,
sK54: ( node > $o ) > list_node > list_node ).
thf(func_def_125,type,
sK55: list_val > val > list_val ).
thf(func_def_126,type,
sK56: list_val > val > list_val ).
thf(func_def_127,type,
sK57: val > val > list_val > list_val ).
thf(func_def_128,type,
sK58: val > val > list_val > list_val ).
thf(func_def_129,type,
sK59: val > val > list_val > list_val ).
thf(func_def_130,type,
sK60: val > list_val > list_val ).
thf(func_def_131,type,
sK61: val > list_val > list_val ).
thf(func_def_132,type,
sK62: val > val > list_val > list_val ).
thf(func_def_133,type,
sK63: val > val > list_val > list_val ).
thf(func_def_134,type,
sK64: val > val > list_val > list_val ).
thf(func_def_135,type,
sK65: ( list_node > list_val > $o ) > ( node > val > $o ) > val ).
thf(func_def_136,type,
sK66: ( list_node > list_val > $o ) > ( node > val > $o ) > list_val ).
thf(func_def_137,type,
sK67: ( list_node > list_val > $o ) > ( node > val > $o ) > node ).
thf(func_def_138,type,
sK68: ( list_node > list_val > $o ) > ( node > val > $o ) > list_node ).
thf(func_def_139,type,
sK69: ( list_node > list_val > $o ) > ( node > val > $o ) > list_val ).
thf(func_def_140,type,
sK70: ( list_node > list_val > $o ) > ( node > val > $o ) > list_node ).
thf(func_def_141,type,
sK71: ( list_node > list_val > $o ) > ( node > val > $o ) > val ).
thf(func_def_142,type,
sK72: ( list_node > list_val > $o ) > ( node > val > $o ) > node ).
thf(func_def_143,type,
sK73: ( list_node > list_val > $o ) > list_node ).
thf(func_def_144,type,
sK74: ( list_node > list_val > $o ) > list_val ).
thf(func_def_145,type,
sK75: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_146,type,
sK76: ( ( node > node > $o ) > list_node > $o ) > node > node > $o ).
thf(func_def_147,type,
sK77: ( ( node > node > $o ) > list_node > $o ) > list_node ).
thf(func_def_148,type,
sK78: ( ( node > node > $o ) > list_node > $o ) > node ).
thf(func_def_149,type,
sK79: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_150,type,
sK80: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_151,type,
sK81: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_152,type,
sK82: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_153,type,
sK83: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_154,type,
sK84: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_155,type,
sK85: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_156,type,
sK86: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_157,type,
sK87: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_158,type,
sK88: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_159,type,
sK89: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_160,type,
sK90: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_161,type,
sK91: node > g > node > node > list_node > list_node ).
thf(func_def_162,type,
sK92: node > g > node > node > list_node > list_node ).
thf(func_def_163,type,
sK93: list_node > node > list_node ).
thf(func_def_164,type,
sK94: list_node > node > list_node ).
thf(func_def_165,type,
sK95: ( ( node > node ) > list_node > list_node > $o ) > list_node ).
thf(func_def_166,type,
sK96: ( ( node > node ) > list_node > list_node > $o ) > node > node ).
thf(func_def_167,type,
sK97: ( ( node > node ) > list_node > list_node > $o ) > list_node ).
thf(func_def_168,type,
sK98: ( ( node > node ) > list_node > list_node > $o ) > node ).
thf(func_def_169,type,
sK99: ( ( node > node ) > list_node > list_node > $o ) > node > node ).
thf(func_def_170,type,
sK100: ( ( node > node ) > list_node > list_node > $o ) > list_node ).
thf(func_def_171,type,
sK101: ( list_node > list_node > $o ) > node ).
thf(func_def_172,type,
sK102: ( list_node > list_node > $o ) > list_node ).
thf(func_def_173,type,
sK103: ( list_node > list_node > $o ) > node ).
thf(func_def_174,type,
sK104: ( list_node > list_node > $o ) > list_node ).
thf(func_def_175,type,
sK105: ( list_node > list_node > $o ) > list_node ).
thf(func_def_176,type,
sK106: ( list_node > list_node > $o ) > node ).
thf(func_def_177,type,
sK107: ( list_node > list_node > $o ) > list_node ).
thf(func_def_178,type,
sK108: ( list_node > list_node > $o ) > node ).
thf(func_def_179,type,
sK109: ( list_val > list_val > $o ) > ( val > val > $o ) > list_val ).
thf(func_def_180,type,
sK110: ( list_val > list_val > $o ) > ( val > val > $o ) > val ).
thf(func_def_181,type,
sK111: ( list_val > list_val > $o ) > ( val > val > $o ) > list_val ).
thf(func_def_182,type,
sK112: ( list_val > list_val > $o ) > ( val > val > $o ) > val ).
thf(func_def_183,type,
sK113: ( list_val > list_val > $o ) > ( val > val > $o ) > val ).
thf(func_def_184,type,
sK114: ( list_val > list_val > $o ) > ( val > val > $o ) > list_val ).
thf(func_def_185,type,
sK115: ( list_val > list_val > $o ) > ( val > val > $o ) > val ).
thf(func_def_186,type,
sK116: ( list_val > list_val > $o ) > ( val > val > $o ) > list_val ).
thf(func_def_187,type,
sK117: ( list_val > list_val > $o ) > list_val ).
thf(func_def_188,type,
sK118: ( list_val > list_val > $o ) > list_val ).
thf(func_def_189,type,
sK119: ( list_node > list_node > $o ) > list_node ).
thf(func_def_190,type,
sK120: ( list_node > list_node > $o ) > node ).
thf(func_def_191,type,
sK121: ( list_node > list_node > $o ) > list_node ).
thf(func_def_192,type,
sK122: ( list_node > list_node > $o ) > list_node ).
thf(func_def_193,type,
sK123: ( list_node > list_node > $o ) > list_node ).
thf(func_def_194,type,
sK124: ( list_node > list_node > $o ) > node ).
thf(func_def_195,type,
sK125: list_node > node > g > node > list_node ).
thf(func_def_196,type,
sK126: list_node > ( node > $o ) > list_node ).
thf(func_def_197,type,
sK127: list_node > ( node > $o ) > node ).
thf(func_def_198,type,
sK128: list_node > ( node > $o ) > list_node ).
thf(func_def_199,type,
sK129: list_node > list_node ).
thf(func_def_200,type,
sK130: list_node > node ).
thf(func_def_201,type,
sK131: ( node > $o ) > list_node > node > g > list_node ).
thf(func_def_202,type,
sK132: ( node > $o ) > list_node > node > g > node ).
thf(func_def_203,type,
sK133: node > list_node > g > ( node > $o ) > list_node ).
thf(func_def_204,type,
sK134: node > list_node > g > ( node > $o ) > node ).
thf(func_def_205,type,
sK135: list_node > node ).
thf(func_def_206,type,
sK136: list_node > node ).
thf(func_def_207,type,
sK137: list_node > list_node ).
thf(func_def_208,type,
sK138: list_node > node ).
thf(func_def_209,type,
sK139: list_node > list_node ).
thf(func_def_210,type,
sK140: list_node > ( node > $o ) > node ).
thf(func_def_211,type,
sK141: list_node > ( node > $o ) > list_node ).
thf(func_def_212,type,
sK142: list_node > ( node > $o ) > list_node ).
thf(func_def_213,type,
sK143: ( list_node > $o ) > list_node ).
thf(func_def_214,type,
sK144: ( list_node > $o ) > node ).
thf(func_def_215,type,
sK145: list_val > val > list_val ).
thf(func_def_216,type,
sK146: list_val > val > list_val ).
thf(func_def_217,type,
sK147: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_218,type,
sK148: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_219,type,
sK149: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_220,type,
sK150: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_221,type,
sK151: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_222,type,
sK152: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_223,type,
sK153: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_224,type,
sK154: ( ( node > node > $o ) > list_node > list_node > $o ) > node ).
thf(func_def_225,type,
sK155: ( ( node > node > $o ) > list_node > list_node > $o ) > list_node ).
thf(func_def_226,type,
sK156: ( ( node > node > $o ) > list_node > list_node > $o ) > node > node > $o ).
thf(func_def_227,type,
sK157: node > g > list_node > node > node > list_node ).
thf(func_def_228,type,
sK158: node > g > list_node > node > node > list_node ).
thf(func_def_229,type,
sK159: ( list_node > $o ) > node ).
thf(func_def_230,type,
sK160: ( list_node > $o ) > node ).
thf(func_def_231,type,
sK161: ( list_node > $o ) > node ).
thf(func_def_232,type,
sK162: ( list_node > $o ) > list_node ).
thf(func_def_233,type,
sK163: list_val > val > list_val ).
thf(func_def_234,type,
sK164: list_val > val > list_val ).
thf(func_def_235,type,
sK165: list_val > val > list_val ).
thf(func_def_236,type,
sK166: list_val > val > list_val ).
thf(func_def_237,type,
sK167: list_node > node > list_node ).
thf(func_def_238,type,
sK168: list_node > node > list_node ).
thf(func_def_239,type,
sK169: list_node > node > list_node ).
thf(func_def_240,type,
sK170: list_node > node > list_node ).
thf(func_def_241,type,
sK171: ( node > $o ) > list_node > node ).
thf(func_def_242,type,
sK172: ( node > $o ) > list_node > list_node ).
thf(func_def_243,type,
sK173: ( node > $o ) > list_node > list_node ).
thf(func_def_244,type,
sK174: ( list_node > list_node > $o ) > list_node ).
thf(func_def_245,type,
sK175: ( list_node > list_node > $o ) > list_node ).
thf(func_def_246,type,
sK176: ( list_node > list_node > $o ) > list_node ).
thf(func_def_247,type,
sK177: ( list_node > list_node > $o ) > node ).
thf(func_def_248,type,
sK178: list_node > node > list_node > list_node > node > list_node > list_node ).
thf(func_def_249,type,
sK179: list_node > node > list_node > list_node > node > list_node > list_node ).
thf(func_def_250,type,
sK180: node > list_node > node > list_node ).
thf(func_def_251,type,
sK181: node > list_node > node > list_node ).
thf(func_def_252,type,
sK182: node > list_node > node > list_node ).
thf(func_def_253,type,
sK183: node > list_node > list_node ).
thf(func_def_254,type,
sK184: node > list_node > list_node ).
thf(func_def_255,type,
sK185: node > list_node > node > list_node ).
thf(func_def_256,type,
sK186: node > list_node > node > list_node ).
thf(func_def_257,type,
sK187: node > list_node > node > list_node ).
thf(func_def_258,type,
sK188: ( list_node > list_node > $o ) > list_node ).
thf(func_def_259,type,
sK189: ( list_node > list_node > $o ) > list_node ).
thf(func_def_260,type,
sK190: ( list_node > list_node > $o ) > node ).
thf(func_def_261,type,
sK191: ( list_node > list_node > $o ) > list_node ).
thf(func_def_262,type,
sK192: ( list_val > $o ) > val ).
thf(func_def_263,type,
sK193: ( list_val > $o ) > list_val ).
thf(func_def_264,type,
sK194: ( list_node > list_node > $o ) > list_node ).
thf(func_def_265,type,
sK195: ( list_node > list_node > $o ) > list_node ).
thf(func_def_266,type,
sK196: ( list_node > list_node > $o ) > node ).
thf(func_def_267,type,
sK197: ( list_node > list_node > $o ) > node ).
thf(func_def_268,type,
sK198: ( list_node > list_node > $o ) > list_node ).
thf(func_def_269,type,
sK199: ( list_node > list_node > $o ) > node ).
thf(func_def_270,type,
sK200: ( list_node > list_node > $o ) > node ).
thf(func_def_271,type,
sK201: ( list_node > list_node > $o ) > list_node ).
thf(func_def_272,type,
sK202: ( list_node > list_node > $o ) > node ).
thf(func_def_273,type,
sK203: ( list_node > list_node > $o ) > node ).
thf(func_def_274,type,
sK204: ( list_node > list_node > $o ) > node ).
thf(func_def_275,type,
sK205: ( list_node > list_node > $o ) > node ).
thf(func_def_276,type,
sK206: list_node > list_node > node > list_node > list_node ).
thf(func_def_277,type,
sK207: list_node > node ).
thf(func_def_278,type,
sK208: list_node > list_node ).
thf(func_def_279,type,
sK209: ( list_node > $o ) > node ).
thf(func_def_280,type,
sK210: ( list_node > $o ) > list_node ).
thf(func_def_281,type,
sK211: ( list_node > $o ) > list_node ).
thf(func_def_282,type,
sK212: ( list_node > $o ) > node ).
thf(func_def_283,type,
sK213: ( list_node > $o ) > list_node ).
thf(func_def_284,type,
sK214: ( list_node > $o ) > node ).
thf(func_def_285,type,
sK215: ( list_node > $o ) > node ).
thf(func_def_286,type,
sK216: ( list_node > $o ) > node ).
thf(func_def_287,type,
sK217: ( list_node > $o ) > node ).
thf(func_def_288,type,
sK218: ( list_node > $o ) > list_node ).
thf(func_def_289,type,
sK219: ( list_node > $o ) > node ).
thf(func_def_290,type,
sK220: ( list_node > list_node > $o ) > node ).
thf(func_def_291,type,
sK221: ( list_node > list_node > $o ) > list_node ).
thf(func_def_292,type,
sK222: ( list_node > list_node > $o ) > list_node ).
thf(func_def_293,type,
sK223: ( list_node > list_node > $o ) > node ).
thf(func_def_294,type,
sK224: ( list_node > list_node > $o ) > list_node ).
thf(func_def_295,type,
sK225: ( list_node > list_node > $o ) > node ).
thf(func_def_296,type,
sK226: ( list_node > list_node > $o ) > list_node ).
thf(func_def_297,type,
sK227: ( list_node > list_node > $o ) > node ).
thf(func_def_298,type,
sK228: list_node > ( node > $o ) > node ).
thf(func_def_299,type,
sK229: list_node > ( node > $o ) > list_node ).
thf(func_def_300,type,
sK230: list_node > ( node > $o ) > list_node ).
thf(func_def_301,type,
sK231: ( node > $o ) > list_node > list_node ).
thf(func_def_302,type,
sK232: ( node > $o ) > list_node > node ).
thf(func_def_303,type,
sK233: ( node > $o ) > list_node > list_node ).
thf(f2,axiom,
( i
= ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_ri__is__valid) ).
thf(f4,axiom,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_assms_I7_J) ).
thf(f5,axiom,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ri @ i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_ri__props_I1_J) ).
thf(f6,axiom,
! [X3: node,X1: node,X2: list_node,X0: g,X4: list_node,X5: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ X2 @ X3 )
=> ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X0 @ X3 @ X4 @ X5 )
=> ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X0 @ X1 @ ( append_node @ X2 @ ( tl_node @ X4 ) ) @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_old_Opath2__app) ).
thf(f351,conjecture,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ( append_node @ ns @ ( tl_node @ ri ) ) @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f352,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ( append_node @ ns @ ( tl_node @ ri ) ) @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r ) ),
inference(negated_conjecture,[status(cth)],[f351]) ).
thf(f410,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ri @ i,
inference(rectify,[],[f5]) ).
thf(f411,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ri @ i )
= $true ),
inference(fool_elimination,[],[f410]) ).
thf(f483,plain,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ( append_node @ ns @ ( tl_node @ ri ) ) @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r ) ),
inference(rectify,[],[f352]) ).
thf(f484,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ( append_node @ ns @ ( tl_node @ ri ) ) @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r ) )
!= $true ),
inference(fool_elimination,[],[f483]) ).
thf(f573,plain,
! [X0: node,X1: node,X2: list_node,X3: g,X4: list_node,X5: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X1 @ X2 @ X0 )
=> ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X0 @ X4 @ X5 )
=> ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X1 @ ( append_node @ X2 @ ( tl_node @ X4 ) ) @ X5 ) ) ),
inference(rectify,[],[f6]) ).
thf(f574,plain,
! [X5: node,X0: node,X1: node,X3: g,X4: list_node,X2: list_node] :
( ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X1 @ X2 @ X0 )
= $true )
=> ( ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X0 @ X4 @ X5 )
= $true )
=> ( $true
= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X1 @ ( append_node @ X2 @ ( tl_node @ X4 ) ) @ X5 ) ) ) ),
inference(fool_elimination,[],[f573]) ).
thf(f870,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ),
inference(rectify,[],[f4]) ).
thf(f871,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) )
= $true ),
inference(fool_elimination,[],[f870]) ).
thf(f876,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ( append_node @ ns @ ( tl_node @ ri ) ) @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r ) )
!= $true ),
inference(flattening,[],[f484]) ).
thf(f937,plain,
! [X5: node,X0: node,X1: node,X3: g,X4: list_node,X2: list_node] :
( ( $true
= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X1 @ ( append_node @ X2 @ ( tl_node @ X4 ) ) @ X5 ) )
| ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X0 @ X4 @ X5 )
!= $true )
| ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X1 @ X2 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f574]) ).
thf(f938,plain,
! [X2: list_node,X5: node,X1: node,X4: list_node,X0: node,X3: g] :
( ( $true
= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X1 @ ( append_node @ X2 @ ( tl_node @ X4 ) ) @ X5 ) )
| ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X0 @ X4 @ X5 )
!= $true )
| ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X3 @ X1 @ X2 @ X0 )
!= $true ) ),
inference(flattening,[],[f937]) ).
thf(f1118,plain,
! [X0: list_node,X1: node,X2: node,X3: list_node,X4: node,X5: g] :
( ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X2 @ ( append_node @ X0 @ ( tl_node @ X3 ) ) @ X1 )
= $true )
| ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X4 @ X3 @ X1 )
!= $true )
| ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X2 @ X0 @ X4 ) ) ),
inference(rectify,[],[f938]) ).
thf(f1312,plain,
! [X2: node,X3: list_node,X0: list_node,X1: node,X4: node,X5: g] :
( ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X2 @ ( append_node @ X0 @ ( tl_node @ X3 ) ) @ X1 )
= $true )
| ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X2 @ X0 @ X4 ) )
| ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X5 @ X4 @ X3 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f1118]) ).
thf(f1437,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ri @ i )
= $true ),
inference(cnf_transformation,[],[f411]) ).
thf(f1445,plain,
( i
= ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r ) ),
inference(cnf_transformation,[],[f2]) ).
thf(f1490,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ( append_node @ ns @ ( tl_node @ ri ) ) @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ phi_r ) )
!= $true ),
inference(cnf_transformation,[],[f876]) ).
thf(f1511,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) )
= $true ),
inference(cnf_transformation,[],[f871]) ).
thf(f1568,plain,
( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ( append_node @ ns @ ( tl_node @ ri ) ) @ i ) ),
inference(forward_demodulation,[],[f1490,f1445]) ).
thf(f1569,plain,
! [X0: node] :
( ( $true != $true )
| ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ X0 @ ri @ i ) )
| ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ X0 ) ) ),
inference(superposition,[],[f1568,f1312]) ).
thf(f1572,plain,
! [X0: node] :
( ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ n @ ns @ X0 ) )
| ( $true
!= ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ X0 @ ri @ i ) ) ),
inference(trivial_inequality_removal,[],[f1569]) ).
thf(f1600,plain,
( ( $true != $true )
| ( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ri @ i )
!= $true ) ),
inference(superposition,[],[f1572,f1511]) ).
thf(f1613,plain,
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ri @ i )
!= $true ),
inference(trivial_inequality_removal,[],[f1600]) ).
thf(f1616,plain,
$false,
inference(forward_subsumption_resolution,[],[f1613,f1437]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP081^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n007.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:46:56 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.22/0.29 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.30/0.44 % (3836326)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.30/0.44 % (3836348)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1230281272:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.30/0.44 % (3836350)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.30/0.44 % (3836350)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.30/0.44 % (3836348)Instruction limit reached!
% 0.30/0.44 % (3836348)------------------------------
% 0.30/0.44 % (3836348)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.44 % (3836348)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.44 % (3836348)CaDiCaL version: 2.1.3
% 0.30/0.44 % (3836348)Termination reason: Instruction limit
% 0.30/0.44 % (3836348)Termination phase: shuffling
% 0.30/0.44 % (3836348)Time elapsed: 0.006 s
% 0.30/0.44 % (3836348)Peak memory usage: 10 MB
% 0.30/0.44 % (3836348)Instructions burned: 25 (million)
% 0.30/0.44 % (3836344)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3897176594:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.30/0.44 % (3836346)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=3966915108:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.30/0.44 % (3836345)lrs+10_16_si=on:nwc=1.5:random_seed=554871896:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.30/0.44 % (3836347)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=2818939977: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.30/0.44 % (3836349)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=620530489:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.30/0.44 % (3836350)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=87800121:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.30/0.44 % (3836346)Instruction limit reached!
% 0.30/0.44 % (3836346)------------------------------
% 0.30/0.44 % (3836346)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.44 % (3836346)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.44 % (3836346)CaDiCaL version: 2.1.3
% 0.30/0.44 % (3836346)Termination reason: Instruction limit
% 0.30/0.44 % (3836346)Termination phase: shuffling
% 0.30/0.44 % (3836346)Time elapsed: 0.002 s
% 0.30/0.44 % (3836346)Peak memory usage: 10 MB
% 0.30/0.44 % (3836346)Instructions burned: 3 (million)
% 0.30/0.44 % (3836345)Instruction limit reached!
% 0.30/0.44 % (3836345)------------------------------
% 0.30/0.44 % (3836345)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.44 % (3836345)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.44 % (3836345)CaDiCaL version: 2.1.3
% 0.30/0.44 % (3836345)Termination reason: Instruction limit
% 0.30/0.44 % (3836345)Termination phase: shuffling
% 0.30/0.44 % (3836345)Time elapsed: 0.009 s
% 0.30/0.44 % (3836345)Peak memory usage: 10 MB
% 0.30/0.44 % (3836345)Instructions burned: 21 (million)
% 0.30/0.44 % (3836359)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=1181671318:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.30/0.44 % (3836359)Instruction limit reached!
% 0.30/0.44 % (3836359)------------------------------
% 0.30/0.44 % (3836359)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.44 % (3836359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.44 % (3836359)CaDiCaL version: 2.1.3
% 0.30/0.44 % (3836359)Termination reason: Instruction limit
% 0.30/0.44 % (3836359)Termination phase: shuffling
% 0.30/0.44 % (3836359)Time elapsed: 0.001 s
% 0.30/0.44 % (3836359)Peak memory usage: 10 MB
% 0.30/0.44 % (3836359)Instructions burned: 3 (million)
% 0.30/0.44 % (3836363)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=124343042:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.30/0.46 % (3836371)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=4071912415:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.30/0.46 % (3836369)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.30/0.46 % (3836363)Instruction limit reached!
% 0.30/0.46 % (3836363)------------------------------
% 0.30/0.46 % (3836363)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836363)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836363)Termination reason: Instruction limit
% 0.30/0.46 % (3836363)Termination phase: shuffling
% 0.30/0.46 % (3836363)Time elapsed: 0.003 s
% 0.30/0.46 % (3836363)Peak memory usage: 10 MB
% 0.30/0.46 % (3836363)Instructions burned: 6 (million)
% 0.30/0.46 % (3836371)Instruction limit reached!
% 0.30/0.46 % (3836371)------------------------------
% 0.30/0.46 % (3836371)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836371)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836371)Termination reason: Instruction limit
% 0.30/0.46 % (3836371)Termination phase: shuffling
% 0.30/0.46 % (3836371)Time elapsed: 0.003 s
% 0.30/0.46 % (3836371)Peak memory usage: 10 MB
% 0.30/0.46 % (3836371)Instructions burned: 14 (million)
% 0.30/0.46 % (3836369)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=1523857732:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.30/0.46 % (3836369)Instruction limit reached!
% 0.30/0.46 % (3836369)------------------------------
% 0.30/0.46 % (3836369)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836369)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836369)Termination reason: Instruction limit
% 0.30/0.46 % (3836369)Termination phase: shuffling
% 0.30/0.46 % (3836369)Time elapsed: 0.004 s
% 0.30/0.46 % (3836369)Peak memory usage: 10 MB
% 0.30/0.46 % (3836369)Instructions burned: 8 (million)
% 0.30/0.46 % (3836380)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.30/0.46 % (3836380)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.30/0.46 % (3836349)Instruction limit reached!
% 0.30/0.46 % (3836349)------------------------------
% 0.30/0.46 % (3836349)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836349)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836349)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836349)Termination reason: Instruction limit
% 0.30/0.46 % (3836349)Termination phase: Naming
% 0.30/0.46 % (3836349)Time elapsed: 0.035 s
% 0.30/0.46 % (3836349)Peak memory usage: 11 MB
% 0.30/0.46 % (3836349)Instructions burned: 76 (million)
% 0.30/0.46 % (3836380)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=558150398: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.30/0.46 % (3836344)Instruction limit reached!
% 0.30/0.46 % (3836344)------------------------------
% 0.30/0.46 % (3836344)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836344)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836344)Termination reason: Instruction limit
% 0.30/0.46 % (3836344)Termination phase: Preprocessing 3
% 0.30/0.46 % (3836344)Time elapsed: 0.041 s
% 0.30/0.46 % (3836344)Peak memory usage: 12 MB
% 0.30/0.46 % (3836344)Instructions burned: 87 (million)
% 0.30/0.46 % (3836380)Instruction limit reached!
% 0.30/0.46 % (3836380)------------------------------
% 0.30/0.46 % (3836380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836380)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836380)Termination reason: Instruction limit
% 0.30/0.46 % (3836380)Termination phase: shuffling
% 0.30/0.46 % (3836380)Time elapsed: 0.007 s
% 0.30/0.46 % (3836380)Peak memory usage: 10 MB
% 0.30/0.46 % (3836380)Instructions burned: 31 (million)
% 0.30/0.46 % (3836381)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=2421813291:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.30/0.46 % (3836385)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.30/0.46 % (3836384)lrs+10_1_si=on:cs=on:random_seed=2773404584:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.30/0.46 % (3836390)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=750610018:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 0.30/0.46 % (3836385)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=2029164660:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.30/0.46 % (3836385)Instruction limit reached!
% 0.30/0.46 % (3836385)------------------------------
% 0.30/0.46 % (3836385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836385)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836385)Termination reason: Instruction limit
% 0.30/0.46 % (3836385)Termination phase: shuffling
% 0.30/0.46 % (3836385)Time elapsed: 0.002 s
% 0.30/0.46 % (3836385)Peak memory usage: 10 MB
% 0.30/0.46 % (3836385)Instructions burned: 3 (million)
% 0.30/0.46 % (3836384)Instruction limit reached!
% 0.30/0.46 % (3836384)------------------------------
% 0.30/0.46 % (3836384)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836384)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836384)Termination reason: Instruction limit
% 0.30/0.46 % (3836384)Termination phase: shuffling
% 0.30/0.46 % (3836384)Time elapsed: 0.004 s
% 0.30/0.46 % (3836384)Peak memory usage: 10 MB
% 0.30/0.46 % (3836384)Instructions burned: 8 (million)
% 0.30/0.46 % (3836387)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=1910059664:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/38Mi)
% 0.30/0.46 % (3836350)Instruction limit reached!
% 0.30/0.46 % (3836350)------------------------------
% 0.30/0.46 % (3836350)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836350)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836350)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836350)Termination reason: Instruction limit
% 0.30/0.46 % (3836350)Termination phase: Property scanning
% 0.30/0.46 % (3836350)Time elapsed: 0.070 s
% 0.30/0.46 % (3836350)Peak memory usage: 13 MB
% 0.30/0.46 % (3836350)Instructions burned: 159 (million)
% 0.30/0.46 % (3836387)Instruction limit reached!
% 0.30/0.46 % (3836387)------------------------------
% 0.30/0.46 % (3836387)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836387)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836387)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836387)Termination reason: Instruction limit
% 0.30/0.46 % (3836387)Termination phase: Property scanning
% 0.30/0.46 % (3836387)Time elapsed: 0.016 s
% 0.30/0.46 % (3836387)Peak memory usage: 10 MB
% 0.30/0.46 % (3836387)Instructions burned: 38 (million)
% 0.30/0.46 % (3836396)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=3324072938:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 0.30/0.46 % (3836397)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=2064080693:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.30/0.46 % (3836381)Instruction limit reached!
% 0.30/0.46 % (3836381)------------------------------
% 0.30/0.46 % (3836381)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836381)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836381)Termination reason: Instruction limit
% 0.30/0.46 % (3836381)Termination phase: Property scanning
% 0.30/0.46 % (3836381)Time elapsed: 0.037 s
% 0.30/0.46 % (3836381)Peak memory usage: 11 MB
% 0.30/0.46 % (3836381)Instructions burned: 86 (million)
% 0.30/0.46 % (3836397)Instruction limit reached!
% 0.30/0.46 % (3836397)------------------------------
% 0.30/0.46 % (3836397)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836397)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836397)Termination reason: Instruction limit
% 0.30/0.46 % (3836397)Termination phase: shuffling
% 0.30/0.46 % (3836397)Time elapsed: 0.007 s
% 0.30/0.46 % (3836397)Peak memory usage: 10 MB
% 0.30/0.46 % (3836397)Instructions burned: 15 (million)
% 0.30/0.46 % (3836396)Instruction limit reached!
% 0.30/0.46 % (3836396)------------------------------
% 0.30/0.46 % (3836396)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.46 % (3836396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.46 % (3836396)CaDiCaL version: 2.1.3
% 0.30/0.46 % (3836396)Termination reason: Instruction limit
% 0.30/0.46 % (3836396)Termination phase: shuffling
% 0.30/0.46 % (3836396)Time elapsed: 0.011 s
% 0.30/0.46 % (3836396)Peak memory usage: 10 MB
% 0.30/0.46 % (3836396)Instructions burned: 25 (million)
% 0.30/0.46 % (3836402)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=4257072203:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 0.30/0.46 % (3836405)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=4186720673:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 0.30/0.46 % (3836390) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3836326-3836390"...
% 0.30/0.46 % (3836390)...printing done.
% 0.30/0.46 % (3836390)Refutation found. Thanks to Tanya!
% 0.30/0.46 % SZS status Theorem for theBenchmark
% 0.30/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.47 % (3836390)------------------------------
% 0.27/0.47 % (3836390)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.47 % (3836390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.47 % (3836390)CaDiCaL version: 2.1.3
% 0.27/0.47 % (3836390)Termination reason: Refutation
% 0.27/0.47 % (3836390)Time elapsed: 0.045 s
% 0.27/0.47 % (3836390)Peak memory usage: 15 MB
% 0.27/0.47 % (3836390)Instructions burned: 181 (million)
% 0.27/0.47 % (3836326)Success in time 0.167 s
% 0.27/0.47 % Vampire exiting
%------------------------------------------------------------------------------