# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:p(s(t_bool,h4s_predu_u_sets_subset(s(t_fun(X1,t_bool),h4s_predu_u_sets_empty),s(t_fun(X1,t_bool),X2)))),file('i/f/pred_set/EMPTY__SUBSET', ch4s_predu_u_sets_EMPTYu_u_SUBSET)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/pred_set/EMPTY__SUBSET', aHLu_FALSITY)).
fof(4, axiom,![X4]:![X5]:((p(s(t_bool,X5))=>p(s(t_bool,X4)))=>((p(s(t_bool,X4))=>p(s(t_bool,X5)))=>s(t_bool,X5)=s(t_bool,X4))),file('i/f/pred_set/EMPTY__SUBSET', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(6, axiom,![X3]:(s(t_bool,X3)=s(t_bool,f)<=>~(p(s(t_bool,X3)))),file('i/f/pred_set/EMPTY__SUBSET', ah4s_bools_EQu_u_CLAUSESu_c3)).
fof(33, axiom,(p(s(t_bool,f))<=>![X3]:p(s(t_bool,X3))),file('i/f/pred_set/EMPTY__SUBSET', ah4s_bools_Fu_u_DEF)).
fof(42, axiom,![X1]:![X3]:![X2]:(p(s(t_bool,h4s_predu_u_sets_subset(s(t_fun(X1,t_bool),X2),s(t_fun(X1,t_bool),X3))))<=>![X6]:(p(s(t_bool,h4s_bools_in(s(X1,X6),s(t_fun(X1,t_bool),X2))))=>p(s(t_bool,h4s_bools_in(s(X1,X6),s(t_fun(X1,t_bool),X3)))))),file('i/f/pred_set/EMPTY__SUBSET', ah4s_predu_u_sets_SUBSETu_u_DEF)).
fof(47, axiom,![X1]:![X6]:![X14]:s(t_bool,h4s_bools_in(s(X1,X6),s(t_fun(X1,t_bool),X14)))=s(t_bool,happ(s(t_fun(X1,t_bool),X14),s(X1,X6))),file('i/f/pred_set/EMPTY__SUBSET', ah4s_predu_u_sets_SPECIFICATION)).
fof(50, axiom,![X1]:![X6]:s(t_bool,happ(s(t_fun(X1,t_bool),h4s_predu_u_sets_empty),s(X1,X6)))=s(t_bool,f),file('i/f/pred_set/EMPTY__SUBSET', ah4s_predu_u_sets_EMPTYu_u_DEF)).
# SZS output end CNFRefutation
