# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:p(s(t_bool,h4s_richu_u_lists_isu_u_suffix(s(t_h4s_lists_list(X1),X2),s(t_h4s_lists_list(X1),X2)))),file('i/f/rich_list/IS__SUFFIX__REFL', ch4s_richu_u_lists_ISu_u_SUFFIXu_u_REFL)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/rich_list/IS__SUFFIX__REFL', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/rich_list/IS__SUFFIX__REFL', aHLu_FALSITY)).
fof(6, axiom,![X1]:![X4]:![X5]:(p(s(t_bool,h4s_richu_u_lists_isu_u_suffix(s(t_h4s_lists_list(X1),X5),s(t_h4s_lists_list(X1),X4))))<=>?[X2]:s(t_h4s_lists_list(X1),X5)=s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X2),s(t_h4s_lists_list(X1),X4)))),file('i/f/rich_list/IS__SUFFIX__REFL', ah4s_richu_u_lists_ISu_u_SUFFIXu_u_APPEND)).
fof(10, axiom,![X1]:![X2]:s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),h4s_lists_nil),s(t_h4s_lists_list(X1),X2)))=s(t_h4s_lists_list(X1),X2),file('i/f/rich_list/IS__SUFFIX__REFL', ah4s_lists_APPEND0u_c0)).
fof(11, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)|s(t_bool,X3)=s(t_bool,f)),file('i/f/rich_list/IS__SUFFIX__REFL', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
