# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_dividess_prime(s(t_h4s_nums_num,X1))))=>(p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X2))))|s(t_h4s_nums_num,h4s_gcds_gcd(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X2)))=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/gcd/PRIME__GCD', ch4s_gcds_PRIMEu_u_GCD)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/gcd/PRIME__GCD', aHLu_FALSITY)).
fof(22, axiom,![X1]:![X2]:(p(s(t_bool,h4s_dividess_prime(s(t_h4s_nums_num,X1))))=>(p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X2))))|p(s(t_bool,h4s_gcds_isu_u_gcd(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X2),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/gcd/PRIME__GCD', ah4s_gcds_PRIMEu_u_ISu_u_GCD)).
fof(23, axiom,![X14]:![X15]:![X2]:![X16]:((p(s(t_bool,h4s_gcds_isu_u_gcd(s(t_h4s_nums_num,X16),s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X15))))&p(s(t_bool,h4s_gcds_isu_u_gcd(s(t_h4s_nums_num,X16),s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X14)))))=>s(t_h4s_nums_num,X15)=s(t_h4s_nums_num,X14)),file('i/f/gcd/PRIME__GCD', ah4s_gcds_ISu_u_GCDu_u_UNIQUE)).
fof(24, axiom,![X2]:![X16]:p(s(t_bool,h4s_gcds_isu_u_gcd(s(t_h4s_nums_num,X16),s(t_h4s_nums_num,X2),s(t_h4s_nums_num,h4s_gcds_gcd(s(t_h4s_nums_num,X16),s(t_h4s_nums_num,X2)))))),file('i/f/gcd/PRIME__GCD', ah4s_gcds_GCDu_u_ISu_u_GCD)).
fof(25, axiom,![X5]:(s(t_bool,X5)=s(t_bool,t)|s(t_bool,X5)=s(t_bool,f)),file('i/f/gcd/PRIME__GCD', aHLu_BOOLu_CASES)).
fof(26, axiom,p(s(t_bool,t)),file('i/f/gcd/PRIME__GCD', aHLu_TRUTH)).
fof(28, axiom,![X5]:(s(t_bool,X5)=s(t_bool,t)<=>p(s(t_bool,X5))),file('i/f/gcd/PRIME__GCD', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
