# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3e(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))),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))))))))))<=>?[X3]:?[X4]:?[X5]:?[X6]:?[X7]: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),h4s_lists_cons(s(X1,X7),s(t_h4s_lists_list(X1),X3)))))))))),file('i/f/quantHeuristics/LIST__LENGTH__5_c17', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_5u_c17)).
fof(4, axiom,![X12]:![X13]:((p(s(t_bool,X13))=>p(s(t_bool,X12)))=>((p(s(t_bool,X12))=>p(s(t_bool,X13)))=>s(t_bool,X13)=s(t_bool,X12))),file('i/f/quantHeuristics/LIST__LENGTH__5_c17', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(39, axiom,![X8]:![X14]:(s(t_h4s_nums_num,X14)=s(t_h4s_nums_num,X8)<=>(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X14),s(t_h4s_nums_num,X8))))&p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X8),s(t_h4s_nums_num,X14)))))),file('i/f/quantHeuristics/LIST__LENGTH__5_c17', ah4s_arithmetics_EQu_u_LESSu_u_EQ)).
fof(50, axiom,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3e(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))),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))))))))))<=>?[X3]:?[X4]:?[X5]:?[X6]:?[X7]: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),h4s_lists_cons(s(X1,X7),s(t_h4s_lists_list(X1),X3)))))))))),file('i/f/quantHeuristics/LIST__LENGTH__5_c17', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_4u_c3)).
# SZS output end CNFRefutation
