# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,~(p(s(t_bool,h4s_dividess_prime(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))))),file('i/f/divides/NOT__PRIME__1', ch4s_dividess_NOTu_u_PRIMEu_u_1)).
fof(14, axiom,![X10]:(p(s(t_bool,h4s_dividess_prime(s(t_h4s_nums_num,X10))))<=>(~(s(t_h4s_nums_num,X10)=s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))&![X11]:(p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X11),s(t_h4s_nums_num,X10))))=>(s(t_h4s_nums_num,X11)=s(t_h4s_nums_num,X10)|s(t_h4s_nums_num,X11)=s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))))),file('i/f/divides/NOT__PRIME__1', ah4s_dividess_primeu_u_def)).
# SZS output end CNFRefutation
