# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:p(s(t_bool,h4s_predu_u_sets_finite(s(t_fun(X1,t_bool),h4s_predu_u_sets_empty)))),file('i/f/pred_set/FINITE__EMPTY', ch4s_predu_u_sets_FINITEu_u_EMPTY)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/pred_set/FINITE__EMPTY', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/pred_set/FINITE__EMPTY', aHLu_FALSITY)).
fof(4, axiom,![X1]:![X2]:(p(s(t_bool,h4s_predu_u_sets_finite(s(t_fun(X1,t_bool),X2))))<=>![X3]:((p(s(t_bool,happ(s(t_fun(t_fun(X1,t_bool),t_bool),X3),s(t_fun(X1,t_bool),h4s_predu_u_sets_empty))))&![X4]:(p(s(t_bool,happ(s(t_fun(t_fun(X1,t_bool),t_bool),X3),s(t_fun(X1,t_bool),X4))))=>![X5]:p(s(t_bool,happ(s(t_fun(t_fun(X1,t_bool),t_bool),X3),s(t_fun(X1,t_bool),h4s_predu_u_sets_insert(s(X1,X5),s(t_fun(X1,t_bool),X4))))))))=>p(s(t_bool,happ(s(t_fun(t_fun(X1,t_bool),t_bool),X3),s(t_fun(X1,t_bool),X2)))))),file('i/f/pred_set/FINITE__EMPTY', ah4s_predu_u_sets_FINITEu_u_DEF)).
fof(5, axiom,![X6]:(s(t_bool,X6)=s(t_bool,t)|s(t_bool,X6)=s(t_bool,f)),file('i/f/pred_set/FINITE__EMPTY', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
