# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))))))<=>?[X3]:?[X4]:?[X5]:?[X6]:s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X4),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X5),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X6),s(t_h4s_lists_list(X1),X3)))))))),file('i/f/quantHeuristics/LIST__LENGTH__5_c32', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_5u_c32)).
fof(2, axiom,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))))))<=>?[X3]:?[X4]:?[X5]:?[X6]:s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X4),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X5),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X6),s(t_h4s_lists_list(X1),X3)))))))),file('i/f/quantHeuristics/LIST__LENGTH__5_c32', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_4u_c18)).
# SZS output end CNFRefutation
