# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X3)))=s(t_h4s_nums_num,h4s_nums_suc(s(t_h4s_nums_num,X2)))<=>?[X4]:?[X5]:(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X4)))=s(t_h4s_nums_num,X2)&s(t_h4s_lists_list(X1),X3)=s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X5),s(t_h4s_lists_list(X1),X4))))),file('i/f/quantHeuristics/LIST__LENGTH__COMPARE__SUC_c2', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_COMPAREu_u_SUCu_c2)).
fof(7, axiom,![X1]:![X2]:![X3]:(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X3)))=s(t_h4s_nums_num,h4s_arithmetics_u_2b(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero)))))))<=>?[X4]:?[X5]:(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X4)))=s(t_h4s_nums_num,X2)&s(t_h4s_lists_list(X1),X3)=s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X5),s(t_h4s_lists_list(X1),X4))))),file('i/f/quantHeuristics/LIST__LENGTH__COMPARE__SUC_c2', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_1u_c12)).
fof(10, axiom,![X8]:s(t_h4s_nums_num,h4s_nums_suc(s(t_h4s_nums_num,X8)))=s(t_h4s_nums_num,h4s_arithmetics_u_2b(s(t_h4s_nums_num,X8),s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))),file('i/f/quantHeuristics/LIST__LENGTH__COMPARE__SUC_c2', ah4s_arithmetics_ADD1)).
# SZS output end CNFRefutation
