# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:s(t_h4s_lists_list(X1),h4s_lists_setu_u_tou_u_list(s(t_fun(X1,t_bool),h4s_predu_u_sets_empty)))=s(t_h4s_lists_list(X1),h4s_lists_nil),file('i/f/list/SET__TO__LIST__EMPTY', ch4s_lists_SETu_u_TOu_u_LISTu_u_EMPTY)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/list/SET__TO__LIST__EMPTY', aHLu_TRUTH)).
fof(6, axiom,![X4]:(s(t_bool,X4)=s(t_bool,t)<=>p(s(t_bool,X4))),file('i/f/list/SET__TO__LIST__EMPTY', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(9, axiom,![X1]:![X6]:![X7]:s(X1,h4s_bools_cond(s(t_bool,t),s(X1,X7),s(X1,X6)))=s(X1,X7),file('i/f/list/SET__TO__LIST__EMPTY', ah4s_bools_boolu_u_caseu_u_thmu_c0)).
fof(10, axiom,![X1]:![X12]:(p(s(t_bool,h4s_predu_u_sets_finite(s(t_fun(X1,t_bool),X12))))=>?[X13]:((p(s(t_bool,X13))<=>s(t_fun(X1,t_bool),X12)=s(t_fun(X1,t_bool),h4s_predu_u_sets_empty))&s(t_h4s_lists_list(X1),h4s_lists_setu_u_tou_u_list(s(t_fun(X1,t_bool),X12)))=s(t_h4s_lists_list(X1),h4s_bools_cond(s(t_bool,X13),s(t_h4s_lists_list(X1),h4s_lists_nil),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,h4s_predu_u_sets_choice(s(t_fun(X1,t_bool),X12))),s(t_h4s_lists_list(X1),h4s_lists_setu_u_tou_u_list(s(t_fun(X1,t_bool),h4s_predu_u_sets_rest(s(t_fun(X1,t_bool),X12))))))))))),file('i/f/list/SET__TO__LIST__EMPTY', ah4s_lists_SETu_u_TOu_u_LISTu_u_THM)).
fof(11, axiom,![X1]:p(s(t_bool,h4s_predu_u_sets_finite(s(t_fun(X1,t_bool),h4s_predu_u_sets_empty)))),file('i/f/list/SET__TO__LIST__EMPTY', ah4s_predu_u_sets_FINITEu_u_EMPTY)).
# SZS output end CNFRefutation
