# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(~(p(s(t_bool,h4s_predu_u_sets_finite(s(t_fun(X1,t_bool),X2)))))=>?[X3]:p(s(t_bool,h4s_bools_in(s(X1,X3),s(t_fun(X1,t_bool),X2))))),file('i/f/pred_set/INFINITE__INHAB', ch4s_predu_u_sets_INFINITEu_u_INHAB)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/pred_set/INFINITE__INHAB', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/pred_set/INFINITE__INHAB', aHLu_FALSITY)).
fof(7, axiom,![X4]:(s(t_bool,X4)=s(t_bool,t)<=>p(s(t_bool,X4))),file('i/f/pred_set/INFINITE__INHAB', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(8, axiom,![X1]:![X5]:(?[X3]:p(s(t_bool,h4s_bools_in(s(X1,X3),s(t_fun(X1,t_bool),X5))))<=>~(s(t_fun(X1,t_bool),X5)=s(t_fun(X1,t_bool),h4s_predu_u_sets_empty))),file('i/f/pred_set/INFINITE__INHAB', ah4s_predu_u_sets_MEMBERu_u_NOTu_u_EMPTY)).
fof(9, 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/pred_set/INFINITE__INHAB', ah4s_predu_u_sets_FINITEu_u_EMPTY)).
fof(10, axiom,![X4]:(s(t_bool,X4)=s(t_bool,t)|s(t_bool,X4)=s(t_bool,f)),file('i/f/pred_set/INFINITE__INHAB', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
