# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,h4s_nums_0),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))))))<=>~(p(s(t_bool,h4s_lists_null(s(t_h4s_lists_list(X1),X2)))))),file('i/f/rich_list/LENGTH__NOT__NULL', ch4s_richu_u_lists_LENGTHu_u_NOTu_u_NULL)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/rich_list/LENGTH__NOT__NULL', aHLu_FALSITY)).
fof(9, axiom,![X3]:(s(t_bool,f)=s(t_bool,X3)<=>~(p(s(t_bool,X3)))),file('i/f/rich_list/LENGTH__NOT__NULL', ah4s_bools_EQu_u_CLAUSESu_c2)).
fof(57, axiom,![X1]:![X2]:(p(s(t_bool,h4s_lists_null(s(t_h4s_lists_list(X1),X2))))<=>s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2)))=s(t_h4s_nums_num,h4s_nums_0)),file('i/f/rich_list/LENGTH__NOT__NULL', ah4s_lists_NULLu_u_LENGTH)).
fof(74, axiom,![X31]:p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,h4s_nums_0),s(t_h4s_nums_num,happ(s(t_fun(t_h4s_nums_num,t_h4s_nums_num),h4s_nums_suc),s(t_h4s_nums_num,X31)))))),file('i/f/rich_list/LENGTH__NOT__NULL', ah4s_primu_u_recs_LESSu_u_0)).
fof(75, axiom,![X31]:~(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X31),s(t_h4s_nums_num,h4s_nums_0))))),file('i/f/rich_list/LENGTH__NOT__NULL', ah4s_primu_u_recs_NOTu_u_LESSu_u_0)).
fof(81, axiom,![X35]:(s(t_h4s_nums_num,X35)=s(t_h4s_nums_num,h4s_nums_0)|?[X31]:s(t_h4s_nums_num,X35)=s(t_h4s_nums_num,happ(s(t_fun(t_h4s_nums_num,t_h4s_nums_num),h4s_nums_suc),s(t_h4s_nums_num,X31)))),file('i/f/rich_list/LENGTH__NOT__NULL', ah4s_arithmetics_numu_u_CASES)).
# SZS output end CNFRefutation
