# 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__2_c16', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_2u_c16)).
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__2_c16', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_1u_c2)).
fof(53, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/LIST__LENGTH__2_c16', aHLu_TRUTH)).
fof(57, axiom,![X17]:(s(t_bool,X17)=s(t_bool,t)<=>p(s(t_bool,X17))),file('i/f/quantHeuristics/LIST__LENGTH__2_c16', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
