# 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),X2),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,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),X2))))))&p(s(t_bool,h4s_arithmetics_u_3cu_3d(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/while/FULL__LEAST__INTRO', ch4s_whiles_FULLu_u_LEASTu_u_INTRO)).
fof(52, axiom,![X14]:![X15]:(~(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X15),s(t_h4s_nums_num,X14)))))<=>p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,X14),s(t_h4s_nums_num,X15))))),file('i/f/while/FULL__LEAST__INTRO', ah4s_arithmetics_NOTu_u_LESS)).
fof(73, axiom,![X1]:![X2]:(p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),X2),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,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),X2))))))),file('i/f/while/FULL__LEAST__INTRO', ah4s_whiles_LEASTu_u_INTRO)).
fof(75, axiom,![X15]:![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X15),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,X15)))))),file('i/f/while/FULL__LEAST__INTRO', ah4s_whiles_LESSu_u_LEAST)).
# SZS output end CNFRefutation
