# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:(p(s(t_bool,h4s_dividess_prime(s(t_h4s_nums_num,X1))))<=>?[X2]:s(t_h4s_nums_num,X1)=s(t_h4s_nums_num,h4s_dividess_primes(s(t_h4s_nums_num,X2)))),file('i/f/divides/PRIME__INDEX', ch4s_dividess_PRIMEu_u_INDEX)).
fof(31, axiom,![X1]:(p(s(t_bool,h4s_dividess_prime(s(t_h4s_nums_num,X1))))=>?[X2]:s(t_h4s_nums_num,h4s_dividess_primes(s(t_h4s_nums_num,X2)))=s(t_h4s_nums_num,X1)),file('i/f/divides/PRIME__INDEX', ah4s_dividess_PRIMESu_u_ONTO)).
fof(32, axiom,![X17]:p(s(t_bool,h4s_dividess_prime(s(t_h4s_nums_num,h4s_dividess_primes(s(t_h4s_nums_num,X17)))))),file('i/f/divides/PRIME__INDEX', ah4s_dividess_primePRIMES)).
fof(45, axiom,~(p(s(t_bool,f))),file('i/f/divides/PRIME__INDEX', aHLu_FALSITY)).
fof(56, axiom,![X3]:(s(t_bool,X3)=s(t_bool,f)<=>~(p(s(t_bool,X3)))),file('i/f/divides/PRIME__INDEX', ah4s_bools_EQu_u_CLAUSESu_c3)).
fof(66, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)|s(t_bool,X3)=s(t_bool,f)),file('i/f/divides/PRIME__INDEX', aHLu_BOOLu_CASES)).
fof(67, axiom,(~(p(s(t_bool,f)))<=>p(s(t_bool,t))),file('i/f/divides/PRIME__INDEX', ah4s_bools_NOTu_u_CLAUSESu_c2)).
# SZS output end CNFRefutation
