# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:((![X3]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X3),s(t_h4s_nums_num,X1))))=>~(p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),X2),s(t_h4s_nums_num,X3))))))&p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),X2),s(t_h4s_nums_num,X1)))))=>s(t_h4s_nums_num,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),X2)))=s(t_h4s_nums_num,X1)),file('i/f/bit/LEAST__THM', ch4s_bits_LEASTu_u_THM)).
fof(36, axiom,![X1]:![X3]:(s(t_h4s_nums_num,X3)=s(t_h4s_nums_num,X1)|(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X3),s(t_h4s_nums_num,X1))))|p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X3)))))),file('i/f/bit/LEAST__THM', ah4s_arithmetics_LESSu_u_LESSu_u_CASES)).
fof(42, axiom,![X14]:(?[X1]:p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),X14),s(t_h4s_nums_num,X1))))<=>(p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),X14),s(t_h4s_nums_num,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),X14))))))&![X1]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),X14))))))=>~(p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),X14),s(t_h4s_nums_num,X1)))))))),file('i/f/bit/LEAST__THM', ah4s_whiles_LEASTu_u_EXISTS)).
fof(43, axiom,![X3]:![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X3),s(t_h4s_nums_num,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),X2))))))=>~(p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),X2),s(t_h4s_nums_num,X3)))))),file('i/f/bit/LEAST__THM', ah4s_whiles_LESSu_u_LEAST)).
# SZS output end CNFRefutation
