# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X3))))))<=>?[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_append(s(t_h4s_lists_list(X1),X4),s(t_h4s_lists_list(X1),X5))))),file('i/f/quantHeuristics/LENGTH__LE__NUM', ch4s_quantHeuristicss_LENGTHu_u_LEu_u_NUM)).
fof(4, axiom,![X1]:![X10]:![X11]:![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,X11),s(t_h4s_nums_num,X10)))<=>?[X4]:?[X5]:(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X4)))=s(t_h4s_nums_num,X11)&(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X5)))=s(t_h4s_nums_num,X10)&s(t_h4s_lists_list(X1),X3)=s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X4),s(t_h4s_lists_list(X1),X5)))))),file('i/f/quantHeuristics/LENGTH__LE__NUM', ah4s_lists_LENGTHu_u_EQu_u_NUMu_c2)).
fof(5, axiom,![X2]:![X12]:(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X12),s(t_h4s_nums_num,X2))))<=>?[X13]:s(t_h4s_nums_num,X2)=s(t_h4s_nums_num,h4s_arithmetics_u_2b(s(t_h4s_nums_num,X12),s(t_h4s_nums_num,X13)))),file('i/f/quantHeuristics/LENGTH__LE__NUM', ah4s_arithmetics_LESSu_u_EQu_u_EXISTS)).
# SZS output end CNFRefutation
