# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:p(s(t_bool,h4s_predu_u_sets_countable(s(t_fun(X1,t_bool),h4s_predu_u_sets_empty)))),file('i/f/pred_set/countable__EMPTY', ch4s_predu_u_sets_countableu_u_EMPTY)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/pred_set/countable__EMPTY', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/pred_set/countable__EMPTY', aHLu_FALSITY)).
fof(7, axiom,![X1]:![X4]:![X5]:![X6]:p(s(t_bool,h4s_predu_u_sets_inj(s(t_fun(X1,X4),X6),s(t_fun(X1,t_bool),h4s_predu_u_sets_empty),s(t_fun(X4,t_bool),X5)))),file('i/f/pred_set/countable__EMPTY', ah4s_predu_u_sets_INJu_u_EMPTYu_c0)).
fof(8, axiom,![X2]:(s(t_bool,X2)=s(t_bool,t)|s(t_bool,X2)=s(t_bool,f)),file('i/f/pred_set/countable__EMPTY', aHLu_BOOLu_CASES)).
fof(9, axiom,![X1]:![X5]:(p(s(t_bool,h4s_predu_u_sets_countable(s(t_fun(X1,t_bool),X5))))<=>?[X6]:p(s(t_bool,h4s_predu_u_sets_inj(s(t_fun(X1,t_h4s_nums_num),X6),s(t_fun(X1,t_bool),X5),s(t_fun(t_h4s_nums_num,t_bool),h4s_predu_u_sets_univ))))),file('i/f/pred_set/countable__EMPTY', ah4s_predu_u_sets_countableu_u_def)).
# SZS output end CNFRefutation
