# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X3))))))=>![X4]:(p(s(t_bool,h4s_bools_in(s(X1,X4),s(t_fun(X1,t_bool),h4s_lists_listu_u_tou_u_set(s(t_h4s_lists_list(X1),h4s_richu_u_lists_butlastn(s(t_h4s_nums_num,X2),s(t_h4s_lists_list(X1),X3))))))))=>p(s(t_bool,h4s_bools_in(s(X1,X4),s(t_fun(X1,t_bool),h4s_lists_listu_u_tou_u_set(s(t_h4s_lists_list(X1),X3)))))))),file('i/f/rich_list/MEM__BUTLASTN', ch4s_richu_u_lists_MEMu_u_BUTLASTN)).
fof(2, axiom,![X5]:![X6]:((p(s(t_bool,X6))=>p(s(t_bool,X5)))=>((p(s(t_bool,X5))=>p(s(t_bool,X6)))=>s(t_bool,X6)=s(t_bool,X5))),file('i/f/rich_list/MEM__BUTLASTN', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(31, axiom,![X1]:![X4]:![X3]:s(t_bool,h4s_bools_in(s(X1,X4),s(t_fun(X1,t_bool),h4s_lists_listu_u_tou_u_set(s(t_h4s_lists_list(X1),X3)))))=s(t_bool,h4s_lists_exists(s(t_fun(X1,t_bool),d_equals(s(X1,X4))),s(t_h4s_lists_list(X1),X3))),file('i/f/rich_list/MEM__BUTLASTN', ah4s_richu_u_lists_MEMu_u_EXISTS)).
fof(42, axiom,![X1]:![X2]:![X3]:(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X3))))))=>![X20]:(p(s(t_bool,h4s_lists_exists(s(t_fun(X1,t_bool),X20),s(t_h4s_lists_list(X1),h4s_richu_u_lists_butlastn(s(t_h4s_nums_num,X2),s(t_h4s_lists_list(X1),X3))))))=>p(s(t_bool,h4s_lists_exists(s(t_fun(X1,t_bool),X20),s(t_h4s_lists_list(X1),X3)))))),file('i/f/rich_list/MEM__BUTLASTN', ah4s_richu_u_lists_EXISTSu_u_BUTLASTN)).
# SZS output end CNFRefutation
