# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(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))))))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__20_c282', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_20u_c282)).
fof(21, axiom,![X7]:s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,X7)))=s(t_h4s_nums_num,X7),file('i/f/quantHeuristics/LIST__LENGTH__20_c282', ah4s_arithmetics_NUMERALu_u_DEF)).
fof(22, axiom,![X1]:![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(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))))))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__20_c282', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_COMPAREu_u_1u_c0)).
fof(32, axiom,![X1]:![X2]:(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2)))=s(t_h4s_nums_num,h4s_nums_0)<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__20_c282', ah4s_lists_LENGTHu_u_NIL)).
fof(69, axiom,s(t_h4s_nums_num,h4s_arithmetics_zero)=s(t_h4s_nums_num,h4s_nums_0),file('i/f/quantHeuristics/LIST__LENGTH__20_c282', ah4s_arithmetics_ALTu_u_ZERO)).
# SZS output end CNFRefutation
