# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit2(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]:s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X3),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X4),s(t_h4s_lists_list(X1),h4s_lists_nil)))))),file('i/f/quantHeuristics/LIST__LENGTH__3_c15', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_3u_c15)).
fof(5, axiom,![X6]:s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,X6)))=s(t_h4s_nums_num,X6),file('i/f/quantHeuristics/LIST__LENGTH__3_c15', ah4s_arithmetics_NUMERALu_u_DEF)).
fof(15, axiom,![X1]:![X2]:(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit2(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]:s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X3),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X4),s(t_h4s_lists_list(X1),h4s_lists_nil)))))),file('i/f/quantHeuristics/LIST__LENGTH__3_c15', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_2u_c1)).
fof(36, axiom,s(t_h4s_nums_num,h4s_arithmetics_zero)=s(t_h4s_nums_num,h4s_nums_0),file('i/f/quantHeuristics/LIST__LENGTH__3_c15', ah4s_arithmetics_ALTu_u_ZERO)).
# SZS output end CNFRefutation
