# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:(![X2]:![X3]:(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)),X1),s(t_h4s_nums_num,X2))),s(t_h4s_nums_num,X3))))<=>s(t_h4s_nums_num,X2)=s(t_h4s_nums_num,X3))=>![X2]:s(t_h4s_nums_num,h4s_whiles_least(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)),X1),s(t_h4s_nums_num,X2)))))=s(t_h4s_nums_num,X2)),file('i/f/while/LEAST__EQ_c1', ch4s_whiles_LEASTu_u_EQu_c1)).
fof(58, axiom,![X1]:(![X2]:![X3]:(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)),X1),s(t_h4s_nums_num,X2))),s(t_h4s_nums_num,X3))))<=>s(t_h4s_nums_num,X3)=s(t_h4s_nums_num,X2))=>![X2]:s(t_h4s_nums_num,h4s_whiles_least(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)),X1),s(t_h4s_nums_num,X2)))))=s(t_h4s_nums_num,X2)),file('i/f/while/LEAST__EQ_c1', ah4s_whiles_LEASTu_u_EQu_c0)).
# SZS output end CNFRefutation
