# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:s(t_h4s_lists_list(X1),h4s_richu_u_lists_butlastn(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))),s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),X2)))))=s(t_h4s_lists_list(X1),X3),file('i/f/rich_list/BUTLASTN__LENGTH__APPEND', ch4s_richu_u_lists_BUTLASTNu_u_LENGTHu_u_APPEND)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/rich_list/BUTLASTN__LENGTH__APPEND', aHLu_TRUTH)).
fof(4, axiom,![X4]:(s(t_bool,X4)=s(t_bool,t)<=>p(s(t_bool,X4))),file('i/f/rich_list/BUTLASTN__LENGTH__APPEND', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(5, axiom,![X1]:![X5]:s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X5),s(t_h4s_lists_list(X1),h4s_lists_nil)))=s(t_h4s_lists_list(X1),X5),file('i/f/rich_list/BUTLASTN__LENGTH__APPEND', ah4s_richu_u_lists_APPENDu_u_NILu_c0)).
fof(6, axiom,![X1]:![X5]:s(t_h4s_lists_list(X1),h4s_richu_u_lists_butlastn(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X5))),s(t_h4s_lists_list(X1),X5)))=s(t_h4s_lists_list(X1),h4s_lists_nil),file('i/f/rich_list/BUTLASTN__LENGTH__APPEND', ah4s_richu_u_lists_BUTLASTNu_u_LENGTHu_u_NIL0)).
fof(7, axiom,![X1]:![X6]:![X2]:![X3]:(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X6),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))))))=>s(t_h4s_lists_list(X1),h4s_richu_u_lists_butlastn(s(t_h4s_nums_num,X6),s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),X2)))))=s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),h4s_richu_u_lists_butlastn(s(t_h4s_nums_num,X6),s(t_h4s_lists_list(X1),X2)))))),file('i/f/rich_list/BUTLASTN__LENGTH__APPEND', ah4s_richu_u_lists_BUTLASTNu_u_APPEND2)).
fof(8, axiom,![X7]:p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X7),s(t_h4s_nums_num,X7)))),file('i/f/rich_list/BUTLASTN__LENGTH__APPEND', ah4s_arithmetics_LESSu_u_EQu_u_REFL)).
# SZS output end CNFRefutation
