# 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))))))<=>?[X3]:?[X4]:s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),happ(s(t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1)),happ(s(t_fun(X1,t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1))),h4s_lists_cons),s(X1,X4))),s(t_h4s_lists_list(X1),X3)))),file('i/f/quantHeuristics/LIST__LENGTH__5_c58', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_5u_c58)).
fof(4, axiom,![X11]:![X12]:((p(s(t_bool,X12))=>p(s(t_bool,X11)))=>((p(s(t_bool,X11))=>p(s(t_bool,X12)))=>s(t_bool,X12)=s(t_bool,X11))),file('i/f/quantHeuristics/LIST__LENGTH__5_c58', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(45, axiom,![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))))))<=>?[X3]:?[X4]:s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),happ(s(t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1)),happ(s(t_fun(X1,t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1))),h4s_lists_cons),s(X1,X4))),s(t_h4s_lists_list(X1),X3)))),file('i/f/quantHeuristics/LIST__LENGTH__5_c58', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_4u_c44)).
fof(79, axiom,![X23]:p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,h4s_nums_0),s(t_h4s_nums_num,h4s_nums_suc(s(t_h4s_nums_num,X23)))))),file('i/f/quantHeuristics/LIST__LENGTH__5_c58', ah4s_primu_u_recs_LESSu_u_0)).
# SZS output end CNFRefutation
