# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),happ(s(t_fun(t_h4s_nums_num,t_fun(t_h4s_nums_num,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__10_c142', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_10u_c142)).
fof(34, axiom,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3e(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_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__10_c142', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_COMPAREu_u_1u_c1)).
fof(35, 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__10_c142', ah4s_lists_LENGTHu_u_NIL)).
fof(72, axiom,![X31]:![X32]:s(t_bool,h4s_arithmetics_u_3e(s(t_h4s_nums_num,X32),s(t_h4s_nums_num,X31)))=s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),happ(s(t_fun(t_h4s_nums_num,t_fun(t_h4s_nums_num,t_bool)),h4s_primu_u_recs_u_3c),s(t_h4s_nums_num,X31))),s(t_h4s_nums_num,X32))),file('i/f/quantHeuristics/LIST__LENGTH__10_c142', ah4s_arithmetics_GREATERu_u_DEF)).
# SZS output end CNFRefutation
