# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,s(t_h4s_nums_num,h4s_gcdsets_gcdset(s(t_fun(t_h4s_nums_num,t_bool),h4s_predu_u_sets_empty)))=s(t_h4s_nums_num,h4s_nums_0),file('i/f/gcdset/gcdset__EMPTY', ch4s_gcdsets_gcdsetu_u_EMPTY)).
fof(35, axiom,![X17]:(p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,h4s_nums_0),s(t_h4s_nums_num,X17))))<=>s(t_h4s_nums_num,X17)=s(t_h4s_nums_num,h4s_nums_0)),file('i/f/gcdset/gcdset__EMPTY', ah4s_dividess_ZEROu_u_DIVIDES)).
fof(38, axiom,s(t_fun(t_h4s_nums_num,t_bool),h4s_predu_u_sets_count(s(t_h4s_nums_num,h4s_nums_0)))=s(t_fun(t_h4s_nums_num,t_bool),h4s_predu_u_sets_empty),file('i/f/gcdset/gcdset__EMPTY', ah4s_predu_u_sets_COUNTu_u_ZERO)).
fof(45, axiom,![X22]:![X27]:(![X25]:(p(s(t_bool,h4s_bools_in(s(t_h4s_nums_num,X25),s(t_fun(t_h4s_nums_num,t_bool),X22))))=>p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X27),s(t_h4s_nums_num,X25)))))=>p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X27),s(t_h4s_nums_num,h4s_gcdsets_gcdset(s(t_fun(t_h4s_nums_num,t_bool),X22))))))),file('i/f/gcdset/gcdset__EMPTY', ah4s_gcdsets_gcdsetu_u_greatest)).
fof(47, axiom,![X3]:![X5]:~(p(s(t_bool,h4s_bools_in(s(X3,X5),s(t_fun(X3,t_bool),h4s_predu_u_sets_empty))))),file('i/f/gcdset/gcdset__EMPTY', ah4s_predu_u_sets_NOTu_u_INu_u_EMPTY)).
# SZS output end CNFRefutation
