# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(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_zero)))))<=>?[X3]:s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),happ(s(t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1)),happ(s(t_fun(X1,t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1))),h4s_lists_cons),s(X1,X3))),s(t_h4s_lists_list(X1),h4s_lists_nil)))),file('i/f/quantHeuristics/LIST__LENGTH__5_c56', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_5u_c56)).
fof(5, axiom,![X1]:![X2]:(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_zero)))))<=>?[X3]:s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),happ(s(t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1)),happ(s(t_fun(X1,t_fun(t_h4s_lists_list(X1),t_h4s_lists_list(X1))),h4s_lists_cons),s(X1,X3))),s(t_h4s_lists_list(X1),h4s_lists_nil)))),file('i/f/quantHeuristics/LIST__LENGTH__5_c56', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_1u_c0)).
# SZS output end CNFRefutation
