# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:s(t_fun(t_h4s_lists_list(X1),t_h4s_nums_num),h4s_combins_o(s(t_fun(t_h4s_lists_list(X1),t_h4s_nums_num),h4s_lists_length),s(t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1)),h4s_lists_reverse)))=s(t_fun(t_h4s_lists_list(X1),t_h4s_nums_num),h4s_lists_length),file('i/f/list/LENGTH__o__REVERSE_c0', ch4s_lists_LENGTHu_u_ou_u_REVERSEu_c0)).
fof(2, axiom,![X1]:![X2]:s(t_h4s_nums_num,happ(s(t_fun(t_h4s_lists_list(X1),t_h4s_nums_num),h4s_lists_length),s(t_h4s_lists_list(X1),happ(s(t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1)),h4s_lists_reverse),s(t_h4s_lists_list(X1),X2)))))=s(t_h4s_nums_num,happ(s(t_fun(t_h4s_lists_list(X1),t_h4s_nums_num),h4s_lists_length),s(t_h4s_lists_list(X1),X2))),file('i/f/list/LENGTH__o__REVERSE_c0', ah4s_lists_LENGTHu_u_REVERSE)).
fof(3, axiom,![X3]:![X4]:![X5]:![X6]:(![X7]:s(X4,happ(s(t_fun(X3,X4),X5),s(X3,X7)))=s(X4,happ(s(t_fun(X3,X4),X6),s(X3,X7)))=>s(t_fun(X3,X4),X5)=s(t_fun(X3,X4),X6)),file('i/f/list/LENGTH__o__REVERSE_c0', aHLu_EXT)).
fof(5, axiom,![X8]:![X1]:![X9]:![X7]:![X6]:![X5]:s(X8,happ(s(t_fun(X9,X8),h4s_combins_o(s(t_fun(X1,X8),X5),s(t_fun(X9,X1),X6))),s(X9,X7)))=s(X8,happ(s(t_fun(X1,X8),X5),s(X1,happ(s(t_fun(X9,X1),X6),s(X9,X7))))),file('i/f/list/LENGTH__o__REVERSE_c0', ah4s_combins_ou_u_THM)).
# SZS output end CNFRefutation
