%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ITP100^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 : 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:20 AM UTC 2026
% Result : Theorem 1.02s 0.50s
% Output : Refutation 1.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 14 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 128 ( 6 ~; 0 |; 0 &; 122 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 10 ( 9 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 495 ( 493 usr; 10 con; 0-4 aty)
% Number of variables : 18 ( 0 ^; 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
list_list_list_a: $tType ).
thf(type_def_6,type,
set_list_list_a: $tType ).
thf(type_def_7,type,
list_list_a: $tType ).
thf(type_def_8,type,
set_list_a: $tType ).
thf(type_def_9,type,
list_nat: $tType ).
thf(type_def_10,type,
list_a: $tType ).
thf(type_def_11,type,
set_a: $tType ).
thf(type_def_12,type,
nat: $tType ).
thf(type_def_13,type,
a: $tType ).
thf(type_def_14,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
bNF_Gr1972240547list_a: set_list_list_a > list_a > set_list_list_a ).
thf(func_def_1,type,
bNF_Greatest_Shift_a: set_list_a > a > set_list_a ).
thf(func_def_2,type,
bNF_Gr1046450207list_a: set_list_list_a > list_list_a > set_list_a ).
thf(func_def_3,type,
bNF_Greatest_Succ_a: set_list_a > list_a > set_a ).
thf(func_def_4,type,
if_list_a: $o > list_a > list_a > list_a ).
thf(func_def_5,type,
list_ord_nat: ( nat > nat > $o ) > list_nat > $o ).
thf(func_def_6,type,
list_strict_asc_nat: list_nat > $o ).
thf(func_def_7,type,
map2_a_a_a: ( a > a > a ) > list_a > list_a > list_a ).
thf(func_def_8,type,
listIn1753026346list_a: list_list_a > ( nat > list_a ) > nat > list_a ).
thf(func_def_9,type,
listIn1312259492pend_a: list_a > ( nat > a ) > nat > a ).
thf(func_def_10,type,
append_list_list_a: list_list_list_a > list_list_list_a > list_list_list_a ).
thf(func_def_11,type,
append_list_a: list_list_a > list_list_a > list_list_a ).
thf(func_def_12,type,
append_nat: list_nat > list_nat > list_nat ).
thf(func_def_13,type,
append_a: list_a > list_a > list_a ).
thf(func_def_14,type,
bind_list_a_list_a: list_list_a > ( list_a > list_list_a ) > list_list_a ).
thf(func_def_15,type,
bind_list_a_a: list_list_a > ( list_a > list_a ) > list_a ).
thf(func_def_16,type,
bind_a_list_a: list_a > ( a > list_list_a ) > list_list_a ).
thf(func_def_17,type,
bind_a_a: list_a > ( a > list_a ) > list_a ).
thf(func_def_18,type,
butlast_list_a: list_list_a > list_list_a ).
thf(func_def_19,type,
butlast_a: list_a > list_a ).
thf(func_def_20,type,
concat_list_a: list_list_list_a > list_list_a ).
thf(func_def_21,type,
concat_a: list_list_a > list_a ).
thf(func_def_22,type,
distinct_adj_list_a: list_list_a > $o ).
thf(func_def_23,type,
distinct_adj_a: list_a > $o ).
thf(func_def_24,type,
foldr_769741863list_a: ( list_list_a > list_list_a > list_list_a ) > list_list_list_a > list_list_a > list_list_a ).
thf(func_def_25,type,
foldr_list_a_list_a: ( list_a > list_a > list_a ) > list_list_a > list_a > list_a ).
thf(func_def_26,type,
insert_list_a: list_a > list_list_a > list_list_a ).
thf(func_def_27,type,
insert_a: a > list_a > list_a ).
thf(func_def_28,type,
last_list_a: list_list_a > list_a ).
thf(func_def_29,type,
last_a: list_a > a ).
thf(func_def_30,type,
cons_list_list_a: list_list_a > list_list_list_a > list_list_list_a ).
thf(func_def_31,type,
cons_list_a: list_a > list_list_a > list_list_a ).
thf(func_def_32,type,
cons_nat: nat > list_nat > list_nat ).
thf(func_def_33,type,
cons_a: a > list_a > list_a ).
thf(func_def_34,type,
nil_list_list_a: list_list_list_a ).
thf(func_def_35,type,
nil_list_a: list_list_a ).
thf(func_def_36,type,
nil_nat: list_nat ).
thf(func_def_37,type,
nil_a: list_a ).
thf(func_def_38,type,
hd_list_list_a: list_list_list_a > list_list_a ).
thf(func_def_39,type,
hd_list_a: list_list_a > list_a ).
thf(func_def_40,type,
hd_a: list_a > a ).
thf(func_def_41,type,
tl_list_a: list_list_a > list_list_a ).
thf(func_def_42,type,
tl_a: list_a > list_a ).
thf(func_def_43,type,
list_ex1_list_a: ( list_a > $o ) > list_list_a > $o ).
thf(func_def_44,type,
list_ex1_a: ( a > $o ) > list_a > $o ).
thf(func_def_45,type,
listre1221556159list_a: ( list_a > list_a > $o ) > list_list_a > list_list_a > $o ).
thf(func_def_46,type,
listrelp_list_a_a: ( list_a > a > $o ) > list_list_a > list_a > $o ).
thf(func_def_47,type,
listrelp_a_list_a: ( a > list_a > $o ) > list_a > list_list_a > $o ).
thf(func_def_48,type,
listrelp_a_a: ( a > a > $o ) > list_a > list_a > $o ).
thf(func_def_49,type,
map_ta982122357list_a: ( list_a > list_a ) > list_list_a > list_list_a > list_list_a ).
thf(func_def_50,type,
map_ta2002079599st_a_a: ( list_a > a ) > list_list_a > list_a > list_a ).
thf(func_def_51,type,
map_ta41997947list_a: ( a > list_a ) > list_a > list_list_a > list_list_a ).
thf(func_def_52,type,
map_tailrec_rev_a_a: ( a > a ) > list_a > list_a > list_a ).
thf(func_def_53,type,
maps_list_a_list_a: ( list_a > list_list_a ) > list_list_a > list_list_a ).
thf(func_def_54,type,
maps_list_a_a: ( list_a > list_a ) > list_list_a > list_a ).
thf(func_def_55,type,
maps_a_list_a: ( a > list_list_a ) > list_a > list_list_a ).
thf(func_def_56,type,
maps_a_a: ( a > list_a ) > list_a > list_a ).
thf(func_def_57,type,
member_list_a: list_list_a > list_a > $o ).
thf(func_def_58,type,
member_a: list_a > a > $o ).
thf(func_def_59,type,
lexordp_eq_list_a: ( list_a > list_a > $o ) > list_list_a > list_list_a > $o ).
thf(func_def_60,type,
lexordp_eq_a: ( a > a > $o ) > list_a > list_a > $o ).
thf(func_def_61,type,
ord_lexordp_nat: list_nat > list_nat > $o ).
thf(func_def_62,type,
ord_lexordp_eq_nat: list_nat > list_nat > $o ).
thf(func_def_63,type,
product_lists_list_a: list_list_list_a > list_list_list_a ).
thf(func_def_64,type,
product_lists_a: list_list_a > list_list_a ).
thf(func_def_65,type,
remdups_adj_a: list_a > list_a ).
thf(func_def_66,type,
rotate1_list_a: list_list_a > list_list_a ).
thf(func_def_67,type,
rotate1_a: list_a > list_a ).
thf(func_def_68,type,
shuffles_a: list_a > list_a > set_list_a ).
thf(func_def_69,type,
splice_list_a: list_list_a > list_list_a > list_list_a ).
thf(func_def_70,type,
splice_a: list_a > list_a > list_a ).
thf(func_def_71,type,
subseqs_list_a: list_list_a > list_list_list_a ).
thf(func_def_72,type,
subseqs_a: list_a > list_list_a ).
thf(func_def_73,type,
successively_list_a: ( list_a > list_a > $o ) > list_list_a > $o ).
thf(func_def_74,type,
successively_a: ( a > a > $o ) > list_a > $o ).
thf(func_def_75,type,
size_size_list_a: list_a > nat ).
thf(func_def_76,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_77,type,
collect_list_a: ( list_a > $o ) > set_list_a ).
thf(func_def_78,type,
collect_a: ( a > $o ) > set_a ).
thf(func_def_79,type,
member_list_list_a: list_list_a > set_list_list_a > $o ).
thf(func_def_80,type,
member_list_a2: list_a > set_list_a > $o ).
thf(func_def_81,type,
member_a2: a > set_a > $o ).
thf(func_def_82,type,
f: nat > a ).
thf(func_def_83,type,
x: a ).
thf(func_def_84,type,
xs: list_a ).
thf(func_def_88,type,
vOR: $o > $o > $o ).
thf(func_def_89,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_90,type,
vAND: $o > $o > $o ).
thf(func_def_91,type,
vNOT: $o > $o ).
thf(func_def_92,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_93,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_94,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_95,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_96,type,
db6:
!>[X0: $tType] : X0 ).
thf(func_def_97,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_98,type,
db4:
!>[X0: $tType] : X0 ).
thf(func_def_99,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_100,type,
db5:
!>[X0: $tType] : X0 ).
thf(func_def_101,type,
vIMP: $o > $o > $o ).
thf(func_def_102,type,
sP0: list_list_a > ( list_a > list_a > $o ) > list_list_a > $o ).
thf(func_def_103,type,
sP1: ( a > a > $o ) > ( list_a > list_a > $o ) > $o ).
thf(func_def_104,type,
sP2: list_nat > list_nat > $o ).
thf(func_def_105,type,
sP3: ( list_list_a > list_list_a > $o ) > ( list_a > list_a > $o ) > $o ).
thf(func_def_106,type,
sP4: ( list_nat > list_nat > $o ) > $o ).
thf(func_def_107,type,
sP5: list_a > list_a > ( a > a > $o ) > $o ).
thf(func_def_108,type,
sP6: ( list_nat > list_nat > $o ) > $o ).
thf(func_def_109,type,
sP7: list_nat > list_nat > $o ).
thf(func_def_110,type,
sP8: list_nat > list_nat > $o ).
thf(func_def_111,type,
sK9: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_112,type,
sK10: ( list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_113,type,
sK11: ( list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_114,type,
sK12: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_115,type,
sK13: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_116,type,
sK14: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_117,type,
sK15: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_118,type,
sK16: ( list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_119,type,
sK17: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_120,type,
sK18: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_121,type,
sK19: ( list_a > list_list_a > $o ) > list_a ).
thf(func_def_122,type,
sK20: ( list_a > list_list_a > $o ) > a ).
thf(func_def_123,type,
sK21: ( list_a > list_list_a > $o ) > list_a ).
thf(func_def_124,type,
sK22: ( list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_125,type,
sK23: ( list_a > list_list_a > $o ) > list_a ).
thf(func_def_126,type,
sK24: ( list_a > list_list_a > $o ) > a ).
thf(func_def_127,type,
sK25: ( list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_128,type,
sK26: ( list_a > list_list_a > $o ) > list_a ).
thf(func_def_129,type,
sK27: list_list_a > ( list_a > list_a > $o ) > list_list_a > list_list_a ).
thf(func_def_130,type,
sK28: list_list_a > ( list_a > list_a > $o ) > list_list_a > list_a ).
thf(func_def_131,type,
sK29: list_list_a > ( list_a > list_a > $o ) > list_list_a > list_a ).
thf(func_def_132,type,
sK30: list_list_a > ( list_a > list_a > $o ) > list_list_a > list_list_a ).
thf(func_def_133,type,
sK31: list_list_a > ( list_a > list_a > $o ) > list_list_a > list_a ).
thf(func_def_134,type,
sK32: list_list_a > ( list_a > list_a > $o ) > list_list_a > list_list_a ).
thf(func_def_135,type,
sK33: list_list_a > ( list_a > list_a > $o ) > list_list_a > list_a ).
thf(func_def_136,type,
sK34: list_list_a > ( list_a > list_a > $o ) > list_list_a > list_list_a ).
thf(func_def_137,type,
sK35: ( a > a > $o ) > ( list_a > list_a > $o ) > a ).
thf(func_def_138,type,
sK36: ( a > a > $o ) > ( list_a > list_a > $o ) > list_a ).
thf(func_def_139,type,
sK37: ( a > a > $o ) > ( list_a > list_a > $o ) > list_a ).
thf(func_def_140,type,
sK38: ( a > a > $o ) > ( list_a > list_a > $o ) > a ).
thf(func_def_141,type,
sK39: ( list_a > list_a > $o ) > list_a ).
thf(func_def_142,type,
sK40: ( list_a > list_a > $o ) > ( a > a > $o ) > a ).
thf(func_def_143,type,
sK41: ( list_a > list_a > $o ) > ( a > a > $o ) > list_a ).
thf(func_def_144,type,
sK42: ( list_a > list_a > $o ) > ( a > a > $o ) > a ).
thf(func_def_145,type,
sK43: ( list_a > list_a > $o ) > ( a > a > $o ) > list_a ).
thf(func_def_146,type,
sK44: ( list_list_a > $o ) > list_a ).
thf(func_def_147,type,
sK45: ( list_list_a > $o ) > list_list_a ).
thf(func_def_148,type,
sK46: ( list_list_a > $o ) > list_a ).
thf(func_def_149,type,
sK47: ( list_list_a > $o ) > list_a ).
thf(func_def_150,type,
sK48: ( list_a > $o ) > list_a ).
thf(func_def_151,type,
sK49: ( list_a > $o ) > a ).
thf(func_def_152,type,
sK50: ( list_list_a > $o ) > list_a ).
thf(func_def_153,type,
sK51: ( list_list_a > $o ) > list_list_a ).
thf(func_def_154,type,
sK52: ( list_list_a > $o ) > list_a ).
thf(func_def_155,type,
sK53: list_nat > list_nat > nat ).
thf(func_def_156,type,
sK54: list_nat > list_nat > list_nat ).
thf(func_def_157,type,
sK55: list_nat > list_nat > nat ).
thf(func_def_158,type,
sK56: list_nat > list_nat > list_nat ).
thf(func_def_159,type,
sK57: list_nat > list_nat > nat ).
thf(func_def_160,type,
sK58: list_nat > list_nat > nat ).
thf(func_def_161,type,
sK59: list_nat > list_nat > list_nat ).
thf(func_def_162,type,
sK60: list_nat > list_nat > list_nat ).
thf(func_def_163,type,
sK61: list_nat > list_nat ).
thf(func_def_164,type,
sK62: list_nat > nat ).
thf(func_def_165,type,
sK63: list_list_a > list_a ).
thf(func_def_166,type,
sK64: list_list_a > list_list_a ).
thf(func_def_167,type,
sK65: nat ).
thf(func_def_168,type,
sK66: ( list_list_a > $o ) > list_a ).
thf(func_def_169,type,
sK67: ( list_list_a > $o ) > list_a ).
thf(func_def_170,type,
sK68: ( list_list_a > $o ) > list_list_a ).
thf(func_def_171,type,
sK69: ( list_list_a > list_list_a > $o ) > ( list_a > list_a > $o ) > list_list_a ).
thf(func_def_172,type,
sK70: ( list_list_a > list_list_a > $o ) > ( list_a > list_a > $o ) > list_a ).
thf(func_def_173,type,
sK71: ( list_list_a > list_list_a > $o ) > ( list_a > list_a > $o ) > list_list_a ).
thf(func_def_174,type,
sK72: ( list_list_a > list_list_a > $o ) > ( list_a > list_a > $o ) > list_a ).
thf(func_def_175,type,
sK73: ( list_a > list_a > $o ) > ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_176,type,
sK74: ( list_a > list_a > $o ) > ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_177,type,
sK75: ( list_a > list_a > $o ) > ( list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_178,type,
sK76: ( list_a > list_a > $o ) > ( list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_179,type,
sK77: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_180,type,
sK78: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_181,type,
sK79: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_182,type,
sK80: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_183,type,
sK81: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_184,type,
sK82: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_185,type,
sK83: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_186,type,
sK84: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_187,type,
sK85: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_188,type,
sK86: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_189,type,
sK87: list_a > list_a > ( a > a > $o ) > list_a ).
thf(func_def_190,type,
sK88: list_a > list_a > ( a > a > $o ) > a ).
thf(func_def_191,type,
sK89: list_a > list_a > ( a > a > $o ) > a ).
thf(func_def_192,type,
sK90: list_a > list_a > ( a > a > $o ) > list_a ).
thf(func_def_193,type,
sK91: list_a > ( a > a > $o ) > list_a > a ).
thf(func_def_194,type,
sK92: list_a > ( a > a > $o ) > list_a > list_a ).
thf(func_def_195,type,
sK93: list_a > ( a > a > $o ) > list_a > a ).
thf(func_def_196,type,
sK94: list_a > ( a > a > $o ) > list_a > list_a ).
thf(func_def_197,type,
sK95: ( list_list_a > $o ) > list_list_a ).
thf(func_def_198,type,
sK96: ( list_list_a > $o ) > list_a ).
thf(func_def_199,type,
sK97: ( ( a > list_a ) > list_a > list_list_a > $o ) > list_a ).
thf(func_def_200,type,
sK98: ( ( a > list_a ) > list_a > list_list_a > $o ) > a ).
thf(func_def_201,type,
sK99: ( ( a > list_a ) > list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_202,type,
sK100: ( ( a > list_a ) > list_a > list_list_a > $o ) > a > list_a ).
thf(func_def_203,type,
sK101: ( ( a > list_a ) > list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_204,type,
sK102: ( ( a > list_a ) > list_a > list_list_a > $o ) > a > list_a ).
thf(func_def_205,type,
sK103: ( list_list_a > $o ) > list_list_a ).
thf(func_def_206,type,
sK104: ( list_list_a > $o ) > list_a ).
thf(func_def_207,type,
sK105: list_a > list_a > list_a ).
thf(func_def_208,type,
sK106: list_a > list_a > list_a ).
thf(func_def_209,type,
sK107: list_a > list_a > list_a ).
thf(func_def_210,type,
sK108: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_211,type,
sK109: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_212,type,
sK110: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_213,type,
sK111: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_214,type,
sK112: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_215,type,
sK113: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_216,type,
sK114: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_217,type,
sK115: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_218,type,
sK116: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_219,type,
sK117: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_220,type,
sK118: list_list_a > list_a ).
thf(func_def_221,type,
sK119: list_list_a > list_a ).
thf(func_def_222,type,
sK120: list_list_a > list_a ).
thf(func_def_223,type,
sK121: list_list_a > list_list_a ).
thf(func_def_224,type,
sK122: list_a > a ).
thf(func_def_225,type,
sK123: list_a > list_a ).
thf(func_def_226,type,
sK124: ( list_a > list_a > $o ) > list_a ).
thf(func_def_227,type,
sK125: ( list_a > list_a > $o ) > list_a ).
thf(func_def_228,type,
sK126: ( list_a > list_a > $o ) > a ).
thf(func_def_229,type,
sK127: ( list_a > list_a > $o ) > list_a ).
thf(func_def_230,type,
sK128: list_a > list_a > list_a ).
thf(func_def_231,type,
sK129: list_a > list_a > list_a ).
thf(func_def_232,type,
sK130: list_a > list_a > list_a ).
thf(func_def_233,type,
sK131: ( list_list_a > list_a > $o ) > list_list_a ).
thf(func_def_234,type,
sK132: ( list_list_a > list_a > $o ) > list_a ).
thf(func_def_235,type,
sK133: ( list_list_a > list_a > $o ) > list_a ).
thf(func_def_236,type,
sK134: ( list_list_a > list_a > $o ) > a ).
thf(func_def_237,type,
sK135: ( list_list_a > list_a > $o ) > list_list_a ).
thf(func_def_238,type,
sK136: ( list_list_a > list_a > $o ) > list_a ).
thf(func_def_239,type,
sK137: ( list_list_a > list_a > $o ) > list_a ).
thf(func_def_240,type,
sK138: ( list_list_a > list_a > $o ) > a ).
thf(func_def_241,type,
sK139: ( list_a > list_a > $o ) > list_a ).
thf(func_def_242,type,
sK140: ( list_a > list_a > $o ) > a ).
thf(func_def_243,type,
sK141: ( list_a > list_a > $o ) > list_a ).
thf(func_def_244,type,
sK142: ( list_a > list_a > $o ) > a ).
thf(func_def_245,type,
sK143: ( list_a > list_a > $o ) > a ).
thf(func_def_246,type,
sK144: ( list_a > list_a > $o ) > a ).
thf(func_def_247,type,
sK145: ( list_a > list_a > $o ) > list_a ).
thf(func_def_248,type,
sK146: ( list_a > list_a > $o ) > list_a ).
thf(func_def_249,type,
sK147: list_list_a > list_list_a ).
thf(func_def_250,type,
sK148: list_list_a > list_a ).
thf(func_def_251,type,
sK149: list_list_a > a ).
thf(func_def_252,type,
sK150: list_list_a > list_list_a ).
thf(func_def_253,type,
sK151: list_a > a ).
thf(func_def_254,type,
sK152: list_a > ( a > a > $o ) > $o > a ).
thf(func_def_255,type,
sK153: list_a > ( a > a > $o ) > $o > a ).
thf(func_def_256,type,
sK154: list_a > ( a > a > $o ) > $o > list_a ).
thf(func_def_257,type,
sK155: ( list_a > $o ) > list_a ).
thf(func_def_258,type,
sK156: ( list_a > $o ) > a ).
thf(func_def_259,type,
sK157: ( list_a > $o ) > a ).
thf(func_def_260,type,
sK158: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_261,type,
sK159: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_262,type,
sK160: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_263,type,
sK161: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_264,type,
sK162: ( ( a > a > $o ) > list_a > $o ) > list_a ).
thf(func_def_265,type,
sK163: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_266,type,
sK164: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_267,type,
sK165: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_268,type,
sK166: ( ( a > a > $o ) > list_a > $o ) > a ).
thf(func_def_269,type,
sK167: ( ( a > a > $o ) > list_a > $o ) > a > a > $o ).
thf(func_def_270,type,
sK168: ( ( a > a > $o ) > list_a > $o ) > list_a ).
thf(func_def_271,type,
sK169: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_272,type,
sK170: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_273,type,
sK171: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_274,type,
sK172: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_275,type,
sK173: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_276,type,
sK174: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_277,type,
sK175: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_278,type,
sK176: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_279,type,
sK177: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_280,type,
sK178: ( list_a > $o ) > a ).
thf(func_def_281,type,
sK179: ( list_a > $o ) > list_a ).
thf(func_def_282,type,
sK180: ( list_a > $o ) > a ).
thf(func_def_283,type,
sK181: list_nat > list_nat > nat ).
thf(func_def_284,type,
sK182: list_nat > list_nat > list_nat ).
thf(func_def_285,type,
sK183: list_nat > list_nat > nat ).
thf(func_def_286,type,
sK184: list_nat > list_nat > list_nat ).
thf(func_def_287,type,
sK185: list_nat > list_nat > nat ).
thf(func_def_288,type,
sK186: list_nat > list_nat > nat ).
thf(func_def_289,type,
sK187: list_nat > list_nat > list_nat ).
thf(func_def_290,type,
sK188: list_nat > list_nat > list_nat ).
thf(func_def_291,type,
sK189: ( list_a > $o ) > a ).
thf(func_def_292,type,
sK190: ( list_a > $o ) > list_a ).
thf(func_def_293,type,
sK191: ( list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_294,type,
sK192: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_295,type,
sK193: ( list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_296,type,
sK194: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_297,type,
sK195: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_298,type,
sK196: ( list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_299,type,
sK197: ( list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_300,type,
sK198: ( list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_301,type,
sK199: list_nat > list_nat > nat ).
thf(func_def_302,type,
sK200: list_nat > list_nat > list_nat ).
thf(func_def_303,type,
sK201: list_nat > list_nat > list_nat ).
thf(func_def_304,type,
sK202: list_nat > list_nat ).
thf(func_def_305,type,
sK203: list_nat > nat ).
thf(func_def_306,type,
sK204: list_nat > list_nat > nat ).
thf(func_def_307,type,
sK205: list_nat > list_nat > list_nat ).
thf(func_def_308,type,
sK206: list_nat > list_nat > nat ).
thf(func_def_309,type,
sK207: list_nat > list_nat > list_nat ).
thf(func_def_310,type,
sK208: list_a > a ).
thf(func_def_311,type,
sK209: list_a > a ).
thf(func_def_312,type,
sK210: list_a > list_a ).
thf(func_def_313,type,
sK211: list_a > a ).
thf(func_def_314,type,
sK212: list_a > a ).
thf(func_def_315,type,
sK213: list_a > list_a ).
thf(func_def_316,type,
sK214: ( ( list_a > a ) > list_list_a > list_a > $o ) > list_a ).
thf(func_def_317,type,
sK215: ( ( list_a > a ) > list_list_a > list_a > $o ) > list_a > a ).
thf(func_def_318,type,
sK216: ( ( list_a > a ) > list_list_a > list_a > $o ) > list_a ).
thf(func_def_319,type,
sK217: ( ( list_a > a ) > list_list_a > list_a > $o ) > list_a > a ).
thf(func_def_320,type,
sK218: ( ( list_a > a ) > list_list_a > list_a > $o ) > list_a ).
thf(func_def_321,type,
sK219: ( ( list_a > a ) > list_list_a > list_a > $o ) > list_list_a ).
thf(func_def_322,type,
sK220: list_list_a > list_list_a ).
thf(func_def_323,type,
sK221: list_list_a > list_a ).
thf(func_def_324,type,
sK222: ( list_a > list_a > $o ) > list_a ).
thf(func_def_325,type,
sK223: ( list_a > list_a > $o ) > list_a ).
thf(func_def_326,type,
sK224: ( list_a > list_a > $o ) > a ).
thf(func_def_327,type,
sK225: ( list_a > list_a > $o ) > list_a ).
thf(func_def_328,type,
sK226: ( list_a > list_a > $o ) > a ).
thf(func_def_329,type,
sK227: ( list_a > list_a > $o ) > list_a ).
thf(func_def_330,type,
sK228: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_a > list_a > $o ).
thf(func_def_331,type,
sK229: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_a ).
thf(func_def_332,type,
sK230: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_list_a ).
thf(func_def_333,type,
sK231: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_a > list_a > $o ).
thf(func_def_334,type,
sK232: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_335,type,
sK233: ( ( a > a ) > list_a > list_a > $o ) > a > a ).
thf(func_def_336,type,
sK234: ( ( a > a ) > list_a > list_a > $o ) > a ).
thf(func_def_337,type,
sK235: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_338,type,
sK236: ( ( a > a ) > list_a > list_a > $o ) > list_a ).
thf(func_def_339,type,
sK237: ( ( a > a ) > list_a > list_a > $o ) > a > a ).
thf(func_def_340,type,
sK238: ( ( list_a > list_a ) > list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_341,type,
sK239: ( ( list_a > list_a ) > list_list_a > list_list_a > $o ) > list_a > list_a ).
thf(func_def_342,type,
sK240: ( ( list_a > list_a ) > list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_343,type,
sK241: ( ( list_a > list_a ) > list_list_a > list_list_a > $o ) > list_a ).
thf(func_def_344,type,
sK242: ( ( list_a > list_a ) > list_list_a > list_list_a > $o ) > list_a > list_a ).
thf(func_def_345,type,
sK243: ( ( list_a > list_a ) > list_list_a > list_list_a > $o ) > list_list_a ).
thf(func_def_346,type,
sK244: ( list_a > $o ) > a ).
thf(func_def_347,type,
sK245: ( list_a > $o ) > a ).
thf(func_def_348,type,
sK246: ( list_a > $o ) > a ).
thf(func_def_349,type,
sK247: ( list_a > $o ) > list_a ).
thf(func_def_350,type,
sK248: ( list_list_a > $o ) > list_a ).
thf(func_def_351,type,
sK249: ( list_list_a > $o ) > list_list_a ).
thf(func_def_352,type,
sK250: ( list_list_a > $o ) > list_a ).
thf(func_def_353,type,
sK251: ( list_list_a > $o ) > list_a ).
thf(func_def_354,type,
sK252: list_a > ( a > a > $o ) > a ).
thf(func_def_355,type,
sK253: list_a > ( a > a > $o ) > list_a ).
thf(func_def_356,type,
sK254: list_a > ( a > a > $o ) > a ).
thf(func_def_357,type,
sK255: ( a > a > $o ) > list_a > a ).
thf(func_def_358,type,
sK256: ( a > a > $o ) > list_a > a ).
thf(func_def_359,type,
sK257: ( a > a > $o ) > list_a > list_a ).
thf(func_def_360,type,
sK258: list_a > a ).
thf(func_def_361,type,
sK259: ( list_a > $o ) > a ).
thf(func_def_362,type,
sK260: ( list_a > $o ) > a ).
thf(func_def_363,type,
sK261: ( list_a > $o ) > list_a ).
thf(func_def_364,type,
sK262: ( list_a > $o ) > a ).
thf(func_def_365,type,
sK263: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_a > list_a > $o ).
thf(func_def_366,type,
sK264: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_a > list_a > $o ).
thf(func_def_367,type,
sK265: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_a ).
thf(func_def_368,type,
sK266: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_list_a ).
thf(func_def_369,type,
sK267: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_a ).
thf(func_def_370,type,
sK268: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_a > list_a > $o ).
thf(func_def_371,type,
sK269: ( ( list_a > list_a > $o ) > list_list_a > $o ) > list_a ).
thf(func_def_372,type,
sK270: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_373,type,
sK271: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_374,type,
sK272: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_375,type,
sK273: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_376,type,
sK274: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_377,type,
sK275: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_378,type,
sK276: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_379,type,
sK277: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_380,type,
sK278: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_381,type,
sK279: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_382,type,
sK280: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_383,type,
sK281: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_384,type,
sK282: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_385,type,
sK283: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_386,type,
sK284: list_a > list_a > list_a > list_a > list_a ).
thf(func_def_387,type,
sK285: list_a > a > list_a > list_a > list_a ).
thf(func_def_388,type,
sK286: list_a > list_a > list_a > a > list_a ).
thf(func_def_389,type,
sK287: list_list_a > list_a > list_list_a > list_list_a > list_list_a ).
thf(func_def_390,type,
sK288: list_list_a > list_a > list_list_a > list_list_a > list_list_a ).
thf(func_def_391,type,
sK289: list_a > a ).
thf(func_def_392,type,
sK290: list_list_a > list_list_a > list_list_a > list_list_a > list_list_a ).
thf(func_def_393,type,
sK291: list_list_a > list_list_a ).
thf(func_def_394,type,
sK292: list_list_a > list_a ).
thf(func_def_395,type,
db8:
!>[X0: $tType] : X0 ).
thf(func_def_396,type,
sK293: nat > nat > list_nat > list_nat > list_nat ).
thf(func_def_397,type,
sK294: nat > nat > list_nat > list_nat > list_nat ).
thf(func_def_398,type,
sK295: nat > nat > list_nat > list_nat > nat ).
thf(func_def_399,type,
sK296: nat > nat > list_nat > list_nat > nat ).
thf(func_def_400,type,
sK297: nat > nat > list_nat > list_nat > list_nat ).
thf(func_def_401,type,
sK298: nat > nat > list_nat > list_nat > list_nat ).
thf(func_def_402,type,
sK299: nat > nat > list_nat > list_nat > nat ).
thf(func_def_403,type,
sK300: nat > nat > list_nat > list_nat > list_nat ).
thf(func_def_404,type,
sK301: nat > nat > list_nat > list_nat > list_nat ).
thf(func_def_405,type,
sK302: nat > nat > list_nat > list_nat > nat ).
thf(func_def_406,type,
sK303: nat > nat > list_nat > list_nat > nat ).
thf(func_def_407,type,
sK304: nat > nat > list_nat > list_nat > list_nat ).
thf(func_def_408,type,
sK305: nat > nat > list_nat > list_nat > list_nat ).
thf(func_def_409,type,
sK306: nat > nat > list_nat > list_nat > nat ).
thf(func_def_410,type,
sK307: list_list_a > list_a ).
thf(func_def_411,type,
sK308: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_412,type,
sK309: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_413,type,
sK310: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_414,type,
sK311: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_415,type,
sK312: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_416,type,
sK313: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_417,type,
sK314: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_418,type,
sK315: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_419,type,
sK316: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_420,type,
sK317: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_421,type,
sK318: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_422,type,
sK319: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_423,type,
sK320: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_424,type,
sK321: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_425,type,
sK322: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_426,type,
sK323: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_427,type,
sK324: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_428,type,
sK325: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_429,type,
sK326: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_430,type,
sK327: ( list_nat > list_nat > $o ) > list_nat ).
thf(func_def_431,type,
sK328: ( list_nat > list_nat > $o ) > nat ).
thf(func_def_432,type,
sK329: list_nat > list_nat > list_nat ).
thf(func_def_433,type,
sK330: list_nat > list_nat > list_nat ).
thf(func_def_434,type,
sK331: list_nat > list_nat > nat ).
thf(func_def_435,type,
sK332: list_nat > list_nat > nat ).
thf(func_def_436,type,
sK333: list_nat > list_nat > list_nat ).
thf(func_def_437,type,
sK334: list_nat > list_nat > list_nat ).
thf(func_def_438,type,
sK335: list_nat > list_nat > nat ).
thf(func_def_439,type,
sK336: list_list_a > list_list_a > list_list_a > list_a > list_list_a ).
thf(func_def_440,type,
sK337: list_a > a ).
thf(func_def_441,type,
sK338: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_442,type,
sK339: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_443,type,
sK340: list_nat > list_nat > nat > nat > nat ).
thf(func_def_444,type,
sK341: list_nat > nat > list_nat > nat > nat ).
thf(func_def_445,type,
sK342: list_nat > list_nat > nat > nat > list_nat ).
thf(func_def_446,type,
sK343: list_nat > list_nat > nat > nat > list_nat ).
thf(func_def_447,type,
sK344: list_nat > list_nat > nat > nat > nat ).
thf(func_def_448,type,
sK345: list_a > list_a ).
thf(func_def_449,type,
sK346: list_a > a ).
thf(func_def_450,type,
sK347: list_nat > list_nat > list_nat ).
thf(func_def_451,type,
sK348: list_nat > list_nat > list_nat ).
thf(func_def_452,type,
sK349: list_nat > list_nat > nat ).
thf(func_def_453,type,
sK350: list_nat > list_nat > nat ).
thf(func_def_454,type,
sK351: list_nat > list_nat > list_nat ).
thf(func_def_455,type,
sK352: list_nat > list_nat > list_nat ).
thf(func_def_456,type,
sK353: list_nat > list_nat > nat ).
thf(func_def_457,type,
sK354: list_list_a > list_a ).
thf(func_def_458,type,
sK355: list_nat > list_nat > list_nat ).
thf(func_def_459,type,
sK356: list_nat > list_nat > list_nat ).
thf(func_def_460,type,
sK357: list_nat > list_nat > nat ).
thf(func_def_461,type,
sK358: list_nat > list_nat > nat ).
thf(func_def_462,type,
sK359: list_nat > list_nat > list_nat ).
thf(func_def_463,type,
sK360: list_nat > list_nat > list_nat ).
thf(func_def_464,type,
sK361: list_nat > list_nat > nat ).
thf(func_def_465,type,
sK362: list_nat > list_nat > list_nat ).
thf(func_def_466,type,
sK363: list_nat > list_nat > list_nat ).
thf(func_def_467,type,
sK364: list_nat > list_nat > nat ).
thf(func_def_468,type,
sK365: list_nat > list_nat > nat ).
thf(func_def_469,type,
sK366: list_nat > list_nat > list_nat ).
thf(func_def_470,type,
sK367: list_nat > list_nat > list_nat ).
thf(func_def_471,type,
sK368: list_nat > list_nat > nat ).
thf(func_def_472,type,
sK369: list_nat > nat > nat > list_nat > list_nat ).
thf(func_def_473,type,
sK370: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_474,type,
sK371: list_nat > nat > list_nat > nat > nat ).
thf(func_def_475,type,
sK372: list_nat > nat > nat > list_nat > nat ).
thf(func_def_476,type,
sK373: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_477,type,
sK374: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_478,type,
sK375: list_nat > nat > list_nat > nat > nat ).
thf(func_def_479,type,
sK376: list_nat > nat > nat > list_nat > list_nat ).
thf(func_def_480,type,
sK377: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_481,type,
sK378: list_nat > nat > nat > list_nat > nat ).
thf(func_def_482,type,
sK379: list_nat > nat > list_nat > nat > nat ).
thf(func_def_483,type,
sK380: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_484,type,
sK381: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_485,type,
sK382: list_nat > nat > list_nat > nat > nat ).
thf(func_def_486,type,
sK383: list_nat > nat > nat > list_nat > list_nat ).
thf(func_def_487,type,
sK384: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_488,type,
sK385: list_nat > nat > list_nat > nat > nat ).
thf(func_def_489,type,
sK386: list_nat > nat > nat > list_nat > nat ).
thf(func_def_490,type,
sK387: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_491,type,
sK388: list_nat > nat > list_nat > nat > list_nat ).
thf(func_def_492,type,
sK389: list_nat > nat > list_nat > nat > nat ).
thf(func_def_494,type,
sK391: nat ).
thf(func_def_495,type,
sK392: nat ).
thf(f152,axiom,
! [X2: nat > a,X0: list_a,X1: list_a] :
( ( listIn1312259492pend_a @ X0 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
= ( listIn1312259492pend_a @ ( append_a @ X0 @ X1 ) @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_151_i__append__assoc) ).
thf(f187,axiom,
! [X1: list_a,X0: a] :
( ( append_a @ ( cons_a @ X0 @ nil_a ) @ X1 )
= ( cons_a @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_186_append__eq__Cons) ).
thf(f356,conjecture,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(f357,negated_conjecture,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
inference(negated_conjecture,[status(cth)],[f356]) ).
thf(f717,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
inference(flattening,[],[f357]) ).
thf(f718,plain,
! [X1: list_a,X2: list_a,X0: nat > a] :
( ( listIn1312259492pend_a @ X1 @ ( listIn1312259492pend_a @ X2 @ X0 ) )
= ( listIn1312259492pend_a @ ( append_a @ X1 @ X2 ) @ X0 ) ),
inference(rectify,[],[f152]) ).
thf(f725,plain,
! [X0: list_a,X1: a] :
( ( cons_a @ X1 @ X0 )
= ( append_a @ ( cons_a @ X1 @ nil_a ) @ X0 ) ),
inference(rectify,[],[f187]) ).
thf(f1085,plain,
! [X0: list_a,X1: list_a,X2: nat > a] :
( ( listIn1312259492pend_a @ X0 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
= ( listIn1312259492pend_a @ ( append_a @ X0 @ X1 ) @ X2 ) ),
inference(rectify,[],[f718]) ).
thf(f1125,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
inference(cnf_transformation,[],[f717]) ).
thf(f1277,plain,
! [X0: list_a,X1: a] :
( ( cons_a @ X1 @ X0 )
= ( append_a @ ( cons_a @ X1 @ nil_a ) @ X0 ) ),
inference(cnf_transformation,[],[f725]) ).
thf(f1382,plain,
! [X2: nat > a,X0: list_a,X1: list_a] :
( ( listIn1312259492pend_a @ X0 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
= ( listIn1312259492pend_a @ ( append_a @ X0 @ X1 ) @ X2 ) ),
inference(cnf_transformation,[],[f1085]) ).
thf(f3303,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( append_a @ ( cons_a @ x @ nil_a ) @ xs ) @ f ) ),
inference(superposition,[],[f1125,f1382]) ).
thf(f3306,plain,
( ( listIn1312259492pend_a @ ( append_a @ ( cons_a @ x @ nil_a ) @ xs ) @ f @ sK392 )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f @ sK392 ) ),
inference(negative_extensionality,[],[f3303]) ).
thf(f3849,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f @ sK392 )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f @ sK392 ) ),
inference(superposition,[],[f3306,f1277]) ).
thf(f3853,plain,
$false,
inference(trivial_inequality_removal,[],[f3849]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP100^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.10/0.20 % Computer : n007.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 19:51:26 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 Running higher-order theorem proving
% 0.20/0.30 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.29/0.44 % (3841944)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.29/0.44 % (3841949)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3909702770:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.29/0.44 % (3841955)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.29/0.44 % (3841955)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.29/0.44 % (3841950)lrs+10_16_si=on:nwc=1.5:random_seed=431000165:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.29/0.44 % (3841951)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=4211989048:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.29/0.44 % (3841953)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=2901914018:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.29/0.44 % (3841952)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=3243005608: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.29/0.44 % (3841954)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1042845137:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.29/0.44 % (3841955)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=4044120070:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.29/0.44 % (3841951)Instruction limit reached!
% 0.29/0.44 % (3841951)------------------------------
% 0.29/0.44 % (3841951)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (3841951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (3841951)CaDiCaL version: 2.1.3
% 0.29/0.44 % (3841951)Termination reason: Instruction limit
% 0.29/0.44 % (3841951)Termination phase: shuffling
% 0.29/0.44 % (3841951)Time elapsed: 0.002 s
% 0.29/0.44 % (3841951)Peak memory usage: 10 MB
% 0.29/0.44 % (3841951)Instructions burned: 3 (million)
% 0.29/0.44 % (3841950)Instruction limit reached!
% 0.29/0.44 % (3841950)------------------------------
% 0.29/0.44 % (3841950)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (3841950)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (3841950)CaDiCaL version: 2.1.3
% 0.29/0.44 % (3841950)Termination reason: Instruction limit
% 0.29/0.44 % (3841950)Termination phase: shuffling
% 0.29/0.44 % (3841950)Time elapsed: 0.009 s
% 0.29/0.44 % (3841950)Peak memory usage: 10 MB
% 0.29/0.44 % (3841950)Instructions burned: 20 (million)
% 0.29/0.44 % (3841953)Instruction limit reached!
% 0.29/0.44 % (3841953)------------------------------
% 0.29/0.44 % (3841953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (3841953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (3841953)CaDiCaL version: 2.1.3
% 0.29/0.44 % (3841953)Termination reason: Instruction limit
% 0.29/0.44 % (3841953)Termination phase: Property scanning
% 0.29/0.44 % (3841953)Time elapsed: 0.011 s
% 0.29/0.44 % (3841953)Peak memory usage: 11 MB
% 0.29/0.44 % (3841953)Instructions burned: 25 (million)
% 0.29/0.44 % (3841949)Instruction limit reached!
% 0.29/0.44 % (3841949)------------------------------
% 0.29/0.44 % (3841949)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.44 % (3841949)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.44 % (3841949)CaDiCaL version: 2.1.3
% 0.29/0.44 % (3841949)Termination reason: Instruction limit
% 0.29/0.44 % (3841949)Termination phase: Property scanning
% 0.29/0.44 % (3841949)Time elapsed: 0.023 s
% 0.29/0.44 % (3841949)Peak memory usage: 13 MB
% 0.29/0.44 % (3841949)Instructions burned: 89 (million)
% 0.29/0.44 % (3841963)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=394921033:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.29/0.44 % (3841963)Instruction limit reached!
% 0.29/0.44 % (3841963)------------------------------
% 0.29/0.44 % (3841963)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.48 % (3841963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.48 % (3841963)CaDiCaL version: 2.1.3
% 1.02/0.48 % (3841963)Termination reason: Instruction limit
% 1.02/0.48 % (3841963)Termination phase: shuffling
% 1.02/0.48 % (3841963)Time elapsed: 0.002 s
% 1.02/0.48 % (3841963)Peak memory usage: 10 MB
% 1.02/0.48 % (3841963)Instructions burned: 3 (million)
% 1.02/0.48 % (3841966)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=2353610637:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 1.02/0.48 % (3841965)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.02/0.48 % (3841964)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=1567529559:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 1.02/0.48 % (3841966)Instruction limit reached!
% 1.02/0.48 % (3841966)------------------------------
% 1.02/0.48 % (3841966)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.48 % (3841966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.48 % (3841966)CaDiCaL version: 2.1.3
% 1.02/0.48 % (3841966)Termination reason: Instruction limit
% 1.02/0.48 % (3841966)Termination phase: shuffling
% 1.02/0.48 % (3841966)Time elapsed: 0.004 s
% 1.02/0.48 % (3841966)Peak memory usage: 10 MB
% 1.02/0.48 % (3841966)Instructions burned: 16 (million)
% 1.02/0.48 % (3841965)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=759796220:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 1.02/0.48 % (3841964)Instruction limit reached!
% 1.02/0.48 % (3841964)------------------------------
% 1.02/0.48 % (3841964)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.48 % (3841964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.48 % (3841964)CaDiCaL version: 2.1.3
% 1.02/0.48 % (3841964)Termination reason: Instruction limit
% 1.02/0.48 % (3841964)Termination phase: shuffling
% 1.02/0.48 % (3841964)Time elapsed: 0.003 s
% 1.02/0.48 % (3841964)Peak memory usage: 10 MB
% 1.02/0.48 % (3841964)Instructions burned: 5 (million)
% 1.02/0.48 % (3841965)Instruction limit reached!
% 1.02/0.48 % (3841965)------------------------------
% 1.02/0.48 % (3841965)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.48 % (3841965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.48 % (3841965)CaDiCaL version: 2.1.3
% 1.02/0.48 % (3841965)Termination reason: Instruction limit
% 1.02/0.48 % (3841965)Termination phase: shuffling
% 1.02/0.48 % (3841965)Time elapsed: 0.004 s
% 1.02/0.48 % (3841965)Peak memory usage: 10 MB
% 1.02/0.48 % (3841965)Instructions burned: 8 (million)
% 1.02/0.48 % (3841954)Instruction limit reached!
% 1.02/0.48 % (3841954)------------------------------
% 1.02/0.48 % (3841954)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.48 % (3841954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.48 % (3841954)CaDiCaL version: 2.1.3
% 1.02/0.48 % (3841954)Termination reason: Instruction limit
% 1.02/0.48 % (3841954)Termination phase: Preprocessing 3
% 1.02/0.48 % (3841954)Time elapsed: 0.037 s
% 1.02/0.48 % (3841954)Peak memory usage: 12 MB
% 1.02/0.48 % (3841954)Instructions burned: 76 (million)
% 1.02/0.48 % (3841968)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
% 1.02/0.48 % (3841968)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 1.02/0.48 % (3841971)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=159001093:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 1.02/0.48 % (3841968)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=1313192899:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 1.02/0.48 % (3841974)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 1.02/0.50 % (3841973)lrs+10_1_si=on:cs=on:random_seed=1087929408:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 1.02/0.50 % (3841974)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=1716543332:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 1.02/0.50 % (3841973)Instruction limit reached!
% 1.02/0.50 % (3841973)------------------------------
% 1.02/0.50 % (3841973)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841973)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841973)Termination reason: Instruction limit
% 1.02/0.50 % (3841973)Termination phase: shuffling
% 1.02/0.50 % (3841973)Time elapsed: 0.004 s
% 1.02/0.50 % (3841973)Peak memory usage: 10 MB
% 1.02/0.50 % (3841973)Instructions burned: 8 (million)
% 1.02/0.50 % (3841975)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=2382177309:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2999 on theBenchmark for (2999ds/38Mi)
% 1.02/0.50 % (3841968)Instruction limit reached!
% 1.02/0.50 % (3841968)------------------------------
% 1.02/0.50 % (3841968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841968)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841968)Termination reason: Instruction limit
% 1.02/0.50 % (3841968)Termination phase: shuffling
% 1.02/0.50 % (3841968)Time elapsed: 0.014 s
% 1.02/0.50 % (3841968)Peak memory usage: 11 MB
% 1.02/0.50 % (3841968)Instructions burned: 30 (million)
% 1.02/0.50 % (3841974)Instruction limit reached!
% 1.02/0.50 % (3841974)------------------------------
% 1.02/0.50 % (3841974)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841974)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841974)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841974)Termination reason: Instruction limit
% 1.02/0.50 % (3841974)Termination phase: shuffling
% 1.02/0.50 % (3841974)Time elapsed: 0.002 s
% 1.02/0.50 % (3841974)Peak memory usage: 10 MB
% 1.02/0.50 % (3841974)Instructions burned: 3 (million)
% 1.02/0.50 % (3841971)Instruction limit reached!
% 1.02/0.50 % (3841971)------------------------------
% 1.02/0.50 % (3841971)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841971)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841971)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841971)Termination reason: Instruction limit
% 1.02/0.50 % (3841971)Termination phase: Property scanning
% 1.02/0.50 % (3841971)Time elapsed: 0.020 s
% 1.02/0.50 % (3841971)Peak memory usage: 11 MB
% 1.02/0.50 % (3841971)Instructions burned: 89 (million)
% 1.02/0.50 % (3841955)Instruction limit reached!
% 1.02/0.50 % (3841955)------------------------------
% 1.02/0.50 % (3841955)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841955)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841955)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841955)Termination reason: Instruction limit
% 1.02/0.50 % (3841955)Termination phase: Property scanning
% 1.02/0.50 % (3841955)Time elapsed: 0.070 s
% 1.02/0.50 % (3841955)Peak memory usage: 13 MB
% 1.02/0.50 % (3841955)Instructions burned: 157 (million)
% 1.02/0.50 % (3841984)dis+1010_1_sil=128000:si=on:uwa=off:random_seed=14905121:st=3:s2a=on:i=327:sd=3:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/327Mi)
% 1.02/0.50 % (3841975)Instruction limit reached!
% 1.02/0.50 % (3841975)------------------------------
% 1.02/0.50 % (3841975)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841975)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841975)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841975)Termination reason: Instruction limit
% 1.02/0.50 % (3841975)Termination phase: Property scanning
% 1.02/0.50 % (3841975)Time elapsed: 0.017 s
% 1.02/0.50 % (3841975)Peak memory usage: 11 MB
% 1.02/0.50 % (3841975)Instructions burned: 39 (million)
% 1.02/0.50 % (3841981)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=2710499342:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 1.02/0.50 % (3841982)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=943178557:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 1.02/0.50 % (3841983)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=2821594440:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.02/0.50 % (3841983)Instruction limit reached!
% 1.02/0.50 % (3841983)------------------------------
% 1.02/0.50 % (3841983)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841983)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841983)Termination reason: Instruction limit
% 1.02/0.50 % (3841983)Termination phase: shuffling
% 1.02/0.50 % (3841983)Time elapsed: 0.007 s
% 1.02/0.50 % (3841983)Peak memory usage: 10 MB
% 1.02/0.50 % (3841983)Instructions burned: 14 (million)
% 1.02/0.50 % (3841982)Instruction limit reached!
% 1.02/0.50 % (3841982)------------------------------
% 1.02/0.50 % (3841982)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841982)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841982)Termination reason: Instruction limit
% 1.02/0.50 % (3841982)Termination phase: Property scanning
% 1.02/0.50 % (3841982)Time elapsed: 0.012 s
% 1.02/0.50 % (3841982)Peak memory usage: 11 MB
% 1.02/0.50 % (3841982)Instructions burned: 26 (million)
% 1.02/0.50 % (3841985)dis+10_1_anc=all_dependent:to=kbo:sil=128000:si=on:chr=on:random_seed=1045263704:uwa_fpi=on:i=14:aac=none:rtra=on:fe=abstraction_2998 on theBenchmark for (2998ds/14Mi)
% 1.02/0.50 % (3841987)ott+21_20_to=lpo:sil=128000:tgt=ground:si=on:sp=arity:lma=off:uwa=off:foolp=on:random_seed=537810409: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)
% 1.02/0.50 % (3841987)Instruction limit reached!
% 1.02/0.50 % (3841987)------------------------------
% 1.02/0.50 % (3841987)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841987)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841987)Termination reason: Instruction limit
% 1.02/0.50 % (3841987)Termination phase: shuffling
% 1.02/0.50 % (3841987)Time elapsed: 0.003 s
% 1.02/0.50 % (3841987)Peak memory usage: 10 MB
% 1.02/0.50 % (3841987)Instructions burned: 5 (million)
% 1.02/0.50 % (3841985)Instruction limit reached!
% 1.02/0.50 % (3841985)------------------------------
% 1.02/0.50 % (3841985)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841985)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841985)Termination reason: Instruction limit
% 1.02/0.50 % (3841985)Termination phase: shuffling
% 1.02/0.50 % (3841985)Time elapsed: 0.007 s
% 1.02/0.50 % (3841985)Peak memory usage: 10 MB
% 1.02/0.50 % (3841985)Instructions burned: 15 (million)
% 1.02/0.50 % (3841991)ott+1004_1_sil=128000:cnfonf=lazy_pi_sigma_gen:si=on:sp=unary_frequency:cbe=off:uwa=off:nwc=1:random_seed=99970809:i=26:ep=R:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/26Mi)
% 1.02/0.50 % (3841993)dis+1002_16_sil=128000:si=on:sp=occurrence:random_seed=1132608236:cond=fast:i=23:hud=1:av=off:rtra=on:fe=abstraction:ntd=on_2998 on theBenchmark for (2998ds/23Mi)
% 1.02/0.50 % (3841981)Refutation not found, incomplete strategy
% 1.02/0.50 % (3841981)------------------------------
% 1.02/0.50 % (3841981)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841981)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841981)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841981)Termination reason: Refutation not found, incomplete strategy
% 1.02/0.50 % (3841981)Time elapsed: 0.034 s
% 1.02/0.50 % (3841981)Peak memory usage: 13 MB
% 1.02/0.50 % (3841981)Instructions burned: 72 (million)
% 1.02/0.50 % (3841981)------------------------------
% 1.02/0.50 % (3841981)------------------------------
% 1.02/0.50 % (3841996)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
% 1.02/0.50 % (3841996)WARNING Broken Constraint: if lrs_weight_limit_only(on) has been set then saturation_algorithm(otter) is equal to lrs
% 1.02/0.50 % (3841995)lrs+1002_1024_sil=128000:tgt=ground:fde=none:e2e=on:si=on:uwa=off:nwc=1:random_seed=326953488:cond=on:i=60:rtra=on:ntd=on_2998 on theBenchmark for (2998ds/60Mi)
% 1.02/0.50 % (3841991)Instruction limit reached!
% 1.02/0.50 % (3841991)------------------------------
% 1.02/0.50 % (3841991)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841996)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=3483721426:i=14:add=off:nm=40:rtra=on:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.02/0.50 % (3841991)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841991)Termination reason: Instruction limit
% 1.02/0.50 % (3841991)Termination phase: shuffling
% 1.02/0.50 % (3841991)Time elapsed: 0.013 s
% 1.02/0.50 % (3841991)Peak memory usage: 11 MB
% 1.02/0.50 % (3841991)Instructions burned: 28 (million)
% 1.02/0.50 % (3841993)Instruction limit reached!
% 1.02/0.50 % (3841993)------------------------------
% 1.02/0.50 % (3841993)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841993)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841993)Termination reason: Instruction limit
% 1.02/0.50 % (3841993)Termination phase: shuffling
% 1.02/0.50 % (3841993)Time elapsed: 0.012 s
% 1.02/0.50 % (3841993)Peak memory usage: 11 MB
% 1.02/0.50 % (3841993)Instructions burned: 25 (million)
% 1.02/0.50 % (3841996)Instruction limit reached!
% 1.02/0.50 % (3841996)------------------------------
% 1.02/0.50 % (3841996)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841996)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841996)Termination reason: Instruction limit
% 1.02/0.50 % (3841996)Termination phase: shuffling
% 1.02/0.50 % (3841996)Time elapsed: 0.007 s
% 1.02/0.50 % (3841996)Peak memory usage: 10 MB
% 1.02/0.50 % (3841996)Instructions burned: 15 (million)
% 1.02/0.50 % (3841999)WARNING Broken Constraint: if choice_reasoning(on) has been set then choice_ax(on) is equal to off
% 1.02/0.50 % (3841999)lrs+1010_4:1_slsqr=8,1:to=kbo:cha=on:drc=off:si=on:sp=arity:lcm=predicate:uwa=off:fd=preordered:gs=on:nwc=5:s2agt=32:slsqc=1:kmz=on:updr=off:chr=on:pe=on:slsq=on:random_seed=3869300141:i=8:nm=2:rtra=on:fe=abstraction:inj=on_2998 on theBenchmark for (2998ds/8Mi)
% 1.02/0.50 % (3841984) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3841944-3841984"...
% 1.02/0.50 % (3841984)...printing done.
% 1.02/0.50 % (3842002)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=3767152602:uwa_fpi=on:i=31:doe=on:bd=preordered:rtra=on:fsd=on_2998 on theBenchmark for (2998ds/31Mi)
% 1.02/0.50 % (3841999)Instruction limit reached!
% 1.02/0.50 % (3841999)------------------------------
% 1.02/0.50 % (3841999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.50 % (3841999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.50 % (3841999)CaDiCaL version: 2.1.3
% 1.02/0.50 % (3841999)Termination reason: Instruction limit
% 1.02/0.50 % (3841999)Termination phase: shuffling
% 1.02/0.50 % (3841999)Time elapsed: 0.004 s
% 1.02/0.50 % (3841999)Peak memory usage: 10 MB
% 1.02/0.50 % (3841999)Instructions burned: 8 (million)
% 1.02/0.50 % (3841984)Refutation found. Thanks to Tanya!
% 1.02/0.50 % SZS status Theorem for theBenchmark
% 1.02/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 1.02/0.51 % (3841984)------------------------------
% 1.02/0.51 % (3841984)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.02/0.51 % (3841984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.02/0.51 % (3841984)CaDiCaL version: 2.1.3
% 1.02/0.51 % (3841984)Termination reason: Refutation
% 1.02/0.51 % (3841984)Time elapsed: 0.062 s
% 1.02/0.51 % (3841984)Peak memory usage: 15 MB
% 1.02/0.51 % (3841984)Instructions burned: 239 (million)
% 1.02/0.51 % (3841944)Success in time 0.192 s
% 1.02/0.51 % Vampire exiting
%------------------------------------------------------------------------------