%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP043^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:10:29 AM UTC 2026
% Result : Theorem 0.98s 0.42s
% Output : Refutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 13 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 102 ( 6 ~; 0 |; 0 &; 96 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 8 ( 7 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 284 ( 282 usr; 14 con; 0-4 aty)
% Number of variables : 4 ( 0 ^; 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
list_list_nat: $tType ).
thf(type_def_6,type,
list_list_a: $tType ).
thf(type_def_7,type,
list_nat: $tType ).
thf(type_def_8,type,
list_a: $tType ).
thf(type_def_9,type,
nat: $tType ).
thf(type_def_10,type,
int: $tType ).
thf(type_def_11,type,
a: $tType ).
thf(type_def_12,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
descar226543321ms_nat: list_nat > list_nat ).
thf(func_def_1,type,
descar1375166517sums_a: list_a > list_a ).
thf(func_def_2,type,
plus_plus_int: int > int > int ).
thf(func_def_3,type,
plus_plus_nat: nat > nat > nat ).
thf(func_def_4,type,
plus_plus_a: a > a > a ).
thf(func_def_5,type,
zero_zero_int: int ).
thf(func_def_6,type,
zero_zero_nat: nat ).
thf(func_def_7,type,
zero_zero_a: a ).
thf(func_def_8,type,
append_nat: list_nat > list_nat > list_nat ).
thf(func_def_9,type,
append_a: list_a > list_a > list_a ).
thf(func_def_10,type,
last_nat: list_nat > nat ).
thf(func_def_11,type,
last_a: list_a > a ).
thf(func_def_12,type,
cons_list_nat: list_nat > list_list_nat > list_list_nat ).
thf(func_def_13,type,
cons_list_a: list_a > list_list_a > list_list_a ).
thf(func_def_14,type,
cons_nat: nat > list_nat > list_nat ).
thf(func_def_15,type,
cons_a: a > list_a > list_a ).
thf(func_def_16,type,
nil_list_nat: list_list_nat ).
thf(func_def_17,type,
nil_list_a: list_list_a ).
thf(func_def_18,type,
nil_nat: list_nat ).
thf(func_def_19,type,
nil_a: list_a ).
thf(func_def_20,type,
nth_nat: list_nat > nat > nat ).
thf(func_def_21,type,
nth_a: list_a > nat > a ).
thf(func_def_22,type,
replicate_nat: nat > nat > list_nat ).
thf(func_def_23,type,
replicate_a: nat > a > list_a ).
thf(func_def_24,type,
take_a: nat > list_a > list_a ).
thf(func_def_25,type,
size_size_list_nat: list_nat > nat ).
thf(func_def_26,type,
size_size_list_a: list_a > nat ).
thf(func_def_27,type,
ord_less_int: int > int > $o ).
thf(func_def_28,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_29,type,
ord_less_a: a > a > $o ).
thf(func_def_30,type,
ord_less_eq_int: int > int > $o ).
thf(func_def_31,type,
ord_less_eq_nat: nat > nat > $o ).
thf(func_def_32,type,
ord_less_eq_a: a > a > $o ).
thf(func_def_33,type,
p: nat ).
thf(func_def_34,type,
v: list_a > int ).
thf(func_def_35,type,
xa: a ).
thf(func_def_36,type,
xs: list_a ).
thf(func_def_37,type,
xs1: list_a ).
thf(func_def_38,type,
xs2: list_a ).
thf(func_def_39,type,
xsa: list_a ).
thf(func_def_43,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_44,type,
vAND: $o > $o > $o ).
thf(func_def_45,type,
vIMP: $o > $o > $o ).
thf(func_def_46,type,
vNOT: $o > $o ).
thf(func_def_47,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_48,type,
vOR: $o > $o > $o ).
thf(func_def_49,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_50,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_51,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_52,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_53,type,
sK0: list_a > list_a > nat ).
thf(func_def_54,type,
sK1: list_list_a > a ).
thf(func_def_55,type,
sK2: list_list_a > list_a ).
thf(func_def_56,type,
sK3: list_list_a > list_list_a ).
thf(func_def_57,type,
sK4: list_list_a > list_list_a ).
thf(func_def_58,type,
sK5: list_list_nat > nat ).
thf(func_def_59,type,
sK6: list_list_nat > list_nat ).
thf(func_def_60,type,
sK7: list_list_nat > list_list_nat ).
thf(func_def_61,type,
sK8: list_list_nat > list_list_nat ).
thf(func_def_62,type,
sK9: list_nat > list_nat > list_nat ).
thf(func_def_63,type,
sK10: list_nat > list_nat > list_nat ).
thf(func_def_64,type,
sK11: list_nat > list_nat > list_nat ).
thf(func_def_65,type,
sK12: list_a > list_a > list_a ).
thf(func_def_66,type,
sK13: list_a > list_a > list_a ).
thf(func_def_67,type,
sK14: list_a > list_a > list_a ).
thf(func_def_68,type,
sK15: ( list_a > $o ) > a ).
thf(func_def_69,type,
sK16: ( list_a > $o ) > list_a ).
thf(func_def_70,type,
sK17: ( list_nat > $o ) > nat ).
thf(func_def_71,type,
sK18: ( list_nat > $o ) > list_nat ).
thf(func_def_72,type,
sK19: list_a > a ).
thf(func_def_73,type,
sK20: list_a > list_a ).
thf(func_def_74,type,
sK21: list_nat > nat ).
thf(func_def_75,type,
sK22: list_nat > list_nat ).
thf(func_def_76,type,
sK23: ( ( a > a ) > list_a > list_a > $o ) > a > a ).
thf(func_def_77,type,
sK24: ( ( a > a ) > list_a > list_a > $o ) > a ).
thf(func_def_78,type,
sK25: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_79,type,
sK26: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_80,type,
sK27: ( ( a > a ) > list_a > list_a > $o ) > a > a ).
thf(func_def_81,type,
sK28: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_82,type,
sK29: ( ( nat > a ) > list_nat > list_a > $o ) > nat > a ).
thf(func_def_83,type,
sK30: ( ( nat > a ) > list_nat > list_a > $o ) > nat ).
thf(func_def_84,type,
sK31: ( ( nat > a ) > list_nat > list_a > $o ) > list_nat ).
thf(func_def_85,type,
sK32: ( ( nat > a ) > list_nat > list_a > $o ) > list_a ).
thf(func_def_86,type,
sK33: ( ( nat > a ) > list_nat > list_a > $o ) > nat > a ).
thf(func_def_87,type,
sK34: ( ( nat > a ) > list_nat > list_a > $o ) > list_a ).
thf(func_def_88,type,
sK35: ( ( a > nat ) > list_a > list_nat > $o ) > a > nat ).
thf(func_def_89,type,
sK36: ( ( a > nat ) > list_a > list_nat > $o ) > a ).
thf(func_def_90,type,
sK37: ( ( a > nat ) > list_a > list_nat > $o ) > list_a ).
thf(func_def_91,type,
sK38: ( ( a > nat ) > list_a > list_nat > $o ) > list_nat ).
thf(func_def_92,type,
sK39: ( ( a > nat ) > list_a > list_nat > $o ) > a > nat ).
thf(func_def_93,type,
sK40: ( ( a > nat ) > list_a > list_nat > $o ) > list_nat ).
thf(func_def_94,type,
sK41: ( ( nat > nat ) > list_nat > list_nat > $o ) > nat > nat ).
thf(func_def_95,type,
sK42: ( ( nat > nat ) > list_nat > list_nat > $o ) > nat ).
thf(func_def_96,type,
sK43: ( ( nat > nat ) > list_nat > list_nat > $o ) > list_nat ).
thf(func_def_97,type,
sK44: ( ( nat > nat ) > list_nat > list_nat > $o ) > list_nat ).
thf(func_def_98,type,
sK45: ( ( nat > nat ) > list_nat > list_nat > $o ) > nat > nat ).
thf(func_def_99,type,
sK46: ( ( nat > nat ) > list_nat > list_nat > $o ) > list_nat ).
thf(func_def_100,type,
sK47: ( list_a > $o ) > a ).
thf(func_def_101,type,
sK48: ( list_a > $o ) > list_a ).
thf(func_def_102,type,
sK49: ( list_a > $o ) > a ).
thf(func_def_103,type,
sK50: ( list_nat > $o ) > nat ).
thf(func_def_104,type,
sK51: ( list_nat > $o ) > list_nat ).
thf(func_def_105,type,
sK52: ( list_nat > $o ) > nat ).
thf(func_def_106,type,
sK53: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_107,type,
sK54: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_108,type,
sK55: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_109,type,
sK56: ( ( a > a > $o ) > list_a > $o ) > list_a ).
thf(func_def_110,type,
sK57: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_111,type,
sK58: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_112,type,
sK59: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_113,type,
sK60: ( ( nat > nat > $o ) > list_nat > $o ) > nat > nat > $o ).
thf(func_def_114,type,
sK61: ( ( nat > nat > $o ) > list_nat > $o ) > nat ).
thf(func_def_115,type,
sK62: ( ( nat > nat > $o ) > list_nat > $o ) > nat ).
thf(func_def_116,type,
sK63: ( ( nat > nat > $o ) > list_nat > $o ) > list_nat ).
thf(func_def_117,type,
sK64: ( ( nat > nat > $o ) > list_nat > $o ) > nat > nat > $o ).
thf(func_def_118,type,
sK65: ( ( nat > nat > $o ) > list_nat > $o ) > nat ).
thf(func_def_119,type,
sK66: ( ( nat > nat > $o ) > list_nat > $o ) > nat > nat > $o ).
thf(func_def_120,type,
sK67: ( list_a > $o ) > a ).
thf(func_def_121,type,
sK68: ( list_a > $o ) > a ).
thf(func_def_122,type,
sK69: ( list_a > $o ) > list_a ).
thf(func_def_123,type,
sK70: ( list_a > $o ) > a ).
thf(func_def_124,type,
sK71: ( list_nat > $o ) > nat ).
thf(func_def_125,type,
sK72: ( list_nat > $o ) > nat ).
thf(func_def_126,type,
sK73: ( list_nat > $o ) > list_nat ).
thf(func_def_127,type,
sK74: ( list_nat > $o ) > nat ).
thf(func_def_128,type,
sK75: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_129,type,
sK76: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_130,type,
sK77: ( ( a > a > $o ) > list_a > $o ) > list_a ).
thf(func_def_131,type,
sK78: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_132,type,
sK79: ( ( nat > nat > $o ) > list_nat > $o ) > nat > nat > $o ).
thf(func_def_133,type,
sK80: ( ( nat > nat > $o ) > list_nat > $o ) > nat ).
thf(func_def_134,type,
sK81: ( ( nat > nat > $o ) > list_nat > $o ) > list_nat ).
thf(func_def_135,type,
sK82: ( ( nat > nat > $o ) > list_nat > $o ) > nat > nat > $o ).
thf(func_def_136,type,
sK83: list_a > a ).
thf(func_def_137,type,
sK84: list_a > a ).
thf(func_def_138,type,
sK85: list_a > list_a ).
thf(func_def_139,type,
sK86: list_a > a ).
thf(func_def_140,type,
sK87: list_nat > nat ).
thf(func_def_141,type,
sK88: list_nat > nat ).
thf(func_def_142,type,
sK89: list_nat > list_nat ).
thf(func_def_143,type,
sK90: list_nat > nat ).
thf(func_def_144,type,
sK91: ( list_a > list_a > $o ) > a ).
thf(func_def_145,type,
sK92: ( list_a > list_a > $o ) > list_a ).
thf(func_def_146,type,
sK93: ( list_a > list_a > $o ) > a ).
thf(func_def_147,type,
sK94: ( list_a > list_a > $o ) > list_a ).
thf(func_def_148,type,
sK95: ( list_a > list_a > $o ) > list_a ).
thf(func_def_149,type,
sK96: ( list_a > list_a > $o ) > list_a ).
thf(func_def_150,type,
sK97: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_151,type,
sK98: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_152,type,
sK99: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_153,type,
sK100: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_154,type,
sK101: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_155,type,
sK102: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_156,type,
sK103: ( list_a > $o ) > a ).
thf(func_def_157,type,
sK104: ( list_a > $o ) > list_a ).
thf(func_def_158,type,
sK105: ( list_nat > $o ) > nat ).
thf(func_def_159,type,
sK106: ( list_nat > $o ) > list_nat ).
thf(func_def_160,type,
sK107: list_a > a ).
thf(func_def_161,type,
sK108: list_a > list_a ).
thf(func_def_162,type,
sK109: list_nat > nat ).
thf(func_def_163,type,
sK110: list_nat > list_nat ).
thf(func_def_164,type,
sK111: ( list_a > $o ) > a ).
thf(func_def_165,type,
sK112: ( list_a > $o ) > a ).
thf(func_def_166,type,
sK113: ( list_a > $o ) > list_a ).
thf(func_def_167,type,
sK114: ( list_a > $o ) > a ).
thf(func_def_168,type,
sK115: ( list_nat > $o ) > nat ).
thf(func_def_169,type,
sK116: ( list_nat > $o ) > nat ).
thf(func_def_170,type,
sK117: ( list_nat > $o ) > list_nat ).
thf(func_def_171,type,
sK118: ( list_nat > $o ) > nat ).
thf(func_def_172,type,
sK119: ( list_a > list_a > $o ) > a ).
thf(func_def_173,type,
sK120: ( list_a > list_a > $o ) > list_a ).
thf(func_def_174,type,
sK121: ( list_a > list_a > $o ) > list_a ).
thf(func_def_175,type,
sK122: ( list_a > list_a > $o ) > list_a ).
thf(func_def_176,type,
sK123: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_177,type,
sK124: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_178,type,
sK125: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_179,type,
sK126: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_180,type,
sK127: ( list_a > list_a > $o ) > a ).
thf(func_def_181,type,
sK128: ( list_a > list_a > $o ) > list_a ).
thf(func_def_182,type,
sK129: ( list_a > list_a > $o ) > a ).
thf(func_def_183,type,
sK130: ( list_a > list_a > $o ) > list_a ).
thf(func_def_184,type,
sK131: ( list_a > list_a > $o ) > a ).
thf(func_def_185,type,
sK132: ( list_a > list_a > $o ) > list_a ).
thf(func_def_186,type,
sK133: ( list_a > list_a > $o ) > a ).
thf(func_def_187,type,
sK134: ( list_a > list_a > $o ) > list_a ).
thf(func_def_188,type,
sK135: ( list_a > list_nat > $o ) > a ).
thf(func_def_189,type,
sK136: ( list_a > list_nat > $o ) > list_a ).
thf(func_def_190,type,
sK137: ( list_a > list_nat > $o ) > nat ).
thf(func_def_191,type,
sK138: ( list_a > list_nat > $o ) > list_nat ).
thf(func_def_192,type,
sK139: ( list_a > list_nat > $o ) > nat ).
thf(func_def_193,type,
sK140: ( list_a > list_nat > $o ) > list_nat ).
thf(func_def_194,type,
sK141: ( list_a > list_nat > $o ) > a ).
thf(func_def_195,type,
sK142: ( list_a > list_nat > $o ) > list_a ).
thf(func_def_196,type,
sK143: ( list_nat > list_a > $o ) > nat ).
thf(func_def_197,type,
sK144: ( list_nat > list_a > $o ) > list_nat ).
thf(func_def_198,type,
sK145: ( list_nat > list_a > $o ) > a ).
thf(func_def_199,type,
sK146: ( list_nat > list_a > $o ) > list_a ).
thf(func_def_200,type,
sK147: ( list_nat > list_a > $o ) > a ).
thf(func_def_201,type,
sK148: ( list_nat > list_a > $o ) > list_a ).
thf(func_def_202,type,
sK149: ( list_nat > list_a > $o ) > nat ).
thf(func_def_203,type,
sK150: ( list_nat > list_a > $o ) > list_nat ).
thf(func_def_204,type,
sK151: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_205,type,
sK152: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_206,type,
sK153: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_207,type,
sK154: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_208,type,
sK155: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_209,type,
sK156: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_210,type,
sK157: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_211,type,
sK158: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_212,type,
sK159: ( list_a > $o ) > a ).
thf(func_def_213,type,
sK160: ( list_a > $o ) > list_a ).
thf(func_def_214,type,
sK161: ( list_nat > $o ) > nat ).
thf(func_def_215,type,
sK162: ( list_nat > $o ) > list_nat ).
thf(func_def_216,type,
sK163: list_a > a ).
thf(func_def_217,type,
sK164: list_a > list_a ).
thf(func_def_218,type,
sK165: list_nat > nat ).
thf(func_def_219,type,
sK166: list_nat > list_nat ).
thf(func_def_220,type,
sK167: list_a > a ).
thf(func_def_221,type,
sK168: list_a > a ).
thf(func_def_222,type,
sK169: list_a > list_a ).
thf(func_def_223,type,
sK170: list_a > a ).
thf(func_def_224,type,
sK171: list_nat > nat ).
thf(func_def_225,type,
sK172: list_nat > nat ).
thf(func_def_226,type,
sK173: list_nat > list_nat ).
thf(func_def_227,type,
sK174: list_nat > nat ).
thf(func_def_228,type,
sK175: ( list_a > $o ) > a ).
thf(func_def_229,type,
sK176: ( list_a > $o ) > list_a ).
thf(func_def_230,type,
sK177: ( list_a > $o ) > a ).
thf(func_def_231,type,
sK178: ( list_nat > $o ) > nat ).
thf(func_def_232,type,
sK179: ( list_nat > $o ) > list_nat ).
thf(func_def_233,type,
sK180: ( list_nat > $o ) > nat ).
thf(func_def_234,type,
sK181: list_a > list_a ).
thf(func_def_235,type,
sK182: list_a > a ).
thf(func_def_236,type,
sK183: list_nat > list_nat ).
thf(func_def_237,type,
sK184: list_nat > nat ).
thf(func_def_238,type,
sK185: ( list_a > $o ) > a ).
thf(func_def_239,type,
sK186: ( list_a > $o ) > list_a ).
thf(func_def_240,type,
sK187: ( list_nat > $o ) > nat ).
thf(func_def_241,type,
sK188: ( list_nat > $o ) > list_nat ).
thf(func_def_242,type,
sK189: ( list_a > list_a > $o ) > a ).
thf(func_def_243,type,
sK190: ( list_a > list_a > $o ) > list_a ).
thf(func_def_244,type,
sK191: ( list_a > list_a > $o ) > list_a ).
thf(func_def_245,type,
sK192: ( list_a > list_a > $o ) > a ).
thf(func_def_246,type,
sK193: ( list_a > list_a > $o ) > list_a ).
thf(func_def_247,type,
sK194: ( list_a > list_a > $o ) > a ).
thf(func_def_248,type,
sK195: ( list_a > list_a > $o ) > list_a ).
thf(func_def_249,type,
sK196: ( list_a > list_a > $o ) > a ).
thf(func_def_250,type,
sK197: ( list_a > list_a > $o ) > list_a ).
thf(func_def_251,type,
sK198: ( list_a > list_a > $o ) > a ).
thf(func_def_252,type,
sK199: ( list_a > list_a > $o ) > list_a ).
thf(func_def_253,type,
sK200: ( list_a > list_a > $o ) > a ).
thf(func_def_254,type,
sK201: ( list_a > list_a > $o ) > list_a ).
thf(func_def_255,type,
sK202: ( list_a > list_a > $o ) > list_a ).
thf(func_def_256,type,
sK203: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_257,type,
sK204: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_258,type,
sK205: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_259,type,
sK206: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_260,type,
sK207: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_261,type,
sK208: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_262,type,
sK209: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_263,type,
sK210: a > a ).
thf(func_def_264,type,
sK211: nat > nat ).
thf(func_def_265,type,
sK212: a > a ).
thf(func_def_266,type,
sK213: nat > nat ).
thf(func_def_267,type,
sK214: nat > list_a ).
thf(func_def_268,type,
sK215: ( nat > nat ) > nat ).
thf(func_def_269,type,
sK216: ( nat > nat ) > nat ).
thf(func_def_270,type,
sK217: nat > ( nat > $o ) > nat ).
thf(func_def_271,type,
sK218: nat > nat > nat ).
thf(func_def_272,type,
sK219: ( list_a > $o ) > list_a ).
thf(func_def_273,type,
sK220: list_a > list_a > nat > nat ).
thf(func_def_274,type,
sK221: list_nat > list_nat > list_nat > list_nat > list_nat ).
thf(func_def_275,type,
sK222: list_a > list_a > list_a > list_a > list_a ).
thf(func_def_276,type,
sK223: list_nat > list_nat > list_nat > nat > list_nat ).
thf(func_def_277,type,
sK224: list_a > list_a > list_a > a > list_a ).
thf(func_def_278,type,
sK225: list_nat > nat > list_nat > list_nat > list_nat ).
thf(func_def_279,type,
sK226: list_a > a > list_a > list_a > list_a ).
thf(func_def_280,type,
sK227: list_nat > list_nat ).
thf(func_def_281,type,
sK228: list_nat > nat ).
thf(func_def_282,type,
sK229: list_a > list_a ).
thf(func_def_283,type,
sK230: list_a > a ).
thf(f6,axiom,
( xs1
= ( replicate_a @ p @ zero_zero_a ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_xs1__def) ).
thf(f7,axiom,
( xsa
= ( append_a @ xs1 @ ( cons_a @ ( nth_a @ xsa @ p ) @ xs2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_xs__decompose) ).
thf(f9,axiom,
! [X0: nat,X1: list_a] :
( ( descar1375166517sums_a @ ( append_a @ ( replicate_a @ X0 @ zero_zero_a ) @ X1 ) )
= ( append_a @ ( replicate_a @ X0 @ zero_zero_a ) @ ( descar1375166517sums_a @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_8_psums__replicate__0__append) ).
thf(f352,conjecture,
( ( descar1375166517sums_a @ xsa )
= ( append_a @ ( replicate_a @ p @ zero_zero_a ) @ ( descar1375166517sums_a @ ( cons_a @ ( nth_a @ xsa @ p ) @ xs2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f353,negated_conjecture,
( ( descar1375166517sums_a @ xsa )
!= ( append_a @ ( replicate_a @ p @ zero_zero_a ) @ ( descar1375166517sums_a @ ( cons_a @ ( nth_a @ xsa @ p ) @ xs2 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f352]) ).
thf(f670,plain,
( ( descar1375166517sums_a @ xsa )
!= ( append_a @ ( replicate_a @ p @ zero_zero_a ) @ ( descar1375166517sums_a @ ( cons_a @ ( nth_a @ xsa @ p ) @ xs2 ) ) ) ),
inference(flattening,[],[f353]) ).
thf(f996,plain,
( xs1
= ( replicate_a @ p @ zero_zero_a ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f997,plain,
( xsa
= ( append_a @ xs1 @ ( cons_a @ ( nth_a @ xsa @ p ) @ xs2 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f999,plain,
! [X0: nat,X1: list_a] :
( ( descar1375166517sums_a @ ( append_a @ ( replicate_a @ X0 @ zero_zero_a ) @ X1 ) )
= ( append_a @ ( replicate_a @ X0 @ zero_zero_a ) @ ( descar1375166517sums_a @ X1 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f1403,plain,
( ( descar1375166517sums_a @ xsa )
!= ( append_a @ ( replicate_a @ p @ zero_zero_a ) @ ( descar1375166517sums_a @ ( cons_a @ ( nth_a @ xsa @ p ) @ xs2 ) ) ) ),
inference(cnf_transformation,[],[f670]) ).
thf(f4306,plain,
( ( descar1375166517sums_a @ xsa )
!= ( descar1375166517sums_a @ ( append_a @ ( replicate_a @ p @ zero_zero_a ) @ ( cons_a @ ( nth_a @ xsa @ p ) @ xs2 ) ) ) ),
inference(constrained_superposition,[],[f1403,f999]) ).
thf(f4307,plain,
( ( descar1375166517sums_a @ xsa )
!= ( descar1375166517sums_a @ ( append_a @ xs1 @ ( cons_a @ ( nth_a @ xsa @ p ) @ xs2 ) ) ) ),
inference(forward_demodulation,[],[f4306,f996]) ).
thf(f4310,plain,
( ( descar1375166517sums_a @ xsa )
!= ( descar1375166517sums_a @ xsa ) ),
inference(forward_demodulation,[],[f4307,f997]) ).
thf(f4311,plain,
$false,
inference(trivial_inequality_removal,[],[f4310]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP043^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17 % Computer : n001.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 19:46:36 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.98/0.42 % (1726067)Will run a generic schedule for satisfiability detection.
% 0.98/0.42 % (1726081)% WARNING: option uhcvi not known.
% 0.98/0.42 % (1726085)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3925459727:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.98/0.42 % (1726080)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2098236583_2999 on theBenchmark for (2999ds/0Mi)
% 0.98/0.42 % (1726081)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3305698913:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.98/0.42 % (1726083)dis+10_1_sil=32000:sp=arity:random_seed=2970219065:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.98/0.42 % (1726086)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=321026331:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.98/0.42 % (1726082)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2576939606:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.98/0.42 % (1726081)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.98/0.42 % (1726084)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2254357941:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.98/0.42 % (1726085)Instruction limit reached!
% 0.98/0.42 % (1726085)------------------------------
% 0.98/0.42 % (1726085)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (1726085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (1726085)CaDiCaL version: 2.1.3
% 0.98/0.42 % (1726085)Termination reason: Instruction limit
% 0.98/0.42 % (1726085)Termination phase: Saturation
% 0.98/0.42 % (1726085)Time elapsed: 0.034 s
% 0.98/0.42 % (1726085)Peak memory usage: 13 MB
% 0.98/0.42 % (1726085)Instructions burned: 132 (million)
% 0.98/0.42 % (1726081)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.98/0.42 % Exception at run slice level
% 0.98/0.42 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.98/0.42 % (1726084)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.98/0.42 % (1726094)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=435771611:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.98/0.42 % (1726083)Instruction limit reached!
% 0.98/0.42 % (1726083)------------------------------
% 0.98/0.42 % (1726083)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (1726083)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (1726083)CaDiCaL version: 2.1.3
% 0.98/0.42 % (1726083)Termination reason: Instruction limit
% 0.98/0.42 % (1726083)Termination phase: Saturation
% 0.98/0.42 % (1726083)Time elapsed: 0.045 s
% 0.98/0.42 % (1726083)Peak memory usage: 13 MB
% 0.98/0.42 % (1726083)Instructions burned: 104 (million)
% 0.98/0.42 % (1726095)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1921978545:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.98/0.42 % (1726097)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1851936383:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.98/0.42 % Exception at run slice level
% 0.98/0.42 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.98/0.42 % (1726097)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.98/0.42 % (1726100)ott-21_1_sil=16000:fs=off:random_seed=2251150583:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.98/0.42 % (1726097)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.98/0.42 % (1726084)Instruction limit reached!
% 0.98/0.42 % (1726084)------------------------------
% 0.98/0.42 % (1726084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (1726084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (1726084)CaDiCaL version: 2.1.3
% 0.98/0.42 % (1726084)Termination reason: Instruction limit
% 0.98/0.42 % (1726084)Termination phase: Saturation
% 0.98/0.42 % (1726084)Time elapsed: 0.093 s
% 0.98/0.42 % (1726084)Peak memory usage: 13 MB
% 0.98/0.42 % (1726084)Instructions burned: 116 (million)
% 0.98/0.42 % (1726086)Instruction limit reached!
% 0.98/0.42 % (1726086)------------------------------
% 0.98/0.42 % (1726086)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (1726086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (1726086)CaDiCaL version: 2.1.3
% 0.98/0.42 % (1726086)Termination reason: Instruction limit
% 0.98/0.42 % (1726086)Termination phase: Saturation
% 0.98/0.42 % (1726086)Time elapsed: 0.099 s
% 0.98/0.42 % (1726086)Peak memory usage: 14 MB
% 0.98/0.42 % (1726086)Instructions burned: 159 (million)
% 0.98/0.42 % (1726095)Instruction limit reached!
% 0.98/0.42 % (1726095)------------------------------
% 0.98/0.42 % (1726095)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (1726095)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (1726095)CaDiCaL version: 2.1.3
% 0.98/0.42 % (1726095)Termination reason: Instruction limit
% 0.98/0.42 % (1726095)Termination phase: Saturation
% 0.98/0.42 % (1726095)Time elapsed: 0.060 s
% 0.98/0.42 % (1726095)Peak memory usage: 13 MB
% 0.98/0.42 % (1726095)Instructions burned: 132 (million)
% 0.98/0.42 % (1726102)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=958067678:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.98/0.42 % (1726103)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3252777764:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.98/0.42 % (1726104)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2995424471:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 0.98/0.42 % (1726081) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1726067-1726081"...
% 0.98/0.42 % (1726081)...printing done.
% 0.98/0.42 % (1726081)Refutation found. Thanks to Tanya!
% 0.98/0.42 % SZS status Theorem for theBenchmark
% 0.98/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.98/0.42 % (1726081)------------------------------
% 0.98/0.42 % (1726081)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.42 % (1726081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.42 % (1726081)CaDiCaL version: 2.1.3
% 0.98/0.42 % (1726081)Termination reason: Refutation
% 0.98/0.42 % (1726081)Time elapsed: 0.144 s
% 0.98/0.42 % (1726081)Peak memory usage: 15 MB
% 0.98/0.42 % (1726081)Instructions burned: 283 (million)
% 0.98/0.42 % (1726067)Success in time 0.196 s
% 0.98/0.42 % Vampire exiting
%------------------------------------------------------------------------------