# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(![X3]:p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),X2),s(t_h4s_lists_list(X1),X3))))<=>(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),X2),s(t_h4s_lists_list(X1),h4s_lists_nil))))&![X4]:![X5]:(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),X2),s(t_h4s_lists_list(X1),X5))))=>p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),X2),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X4),s(t_h4s_lists_list(X1),X5))))))))),file('i/f/list/FORALL__LIST0', ch4s_lists_FORALLu_u_LIST0)).
fof(2, axiom,![X6]:![X7]:((p(s(t_bool,X7))=>p(s(t_bool,X6)))=>((p(s(t_bool,X6))=>p(s(t_bool,X7)))=>s(t_bool,X7)=s(t_bool,X6))),file('i/f/list/FORALL__LIST0', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(16, axiom,![X1]:![X2]:((p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),X2),s(t_h4s_lists_list(X1),h4s_lists_nil))))&![X5]:(p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),X2),s(t_h4s_lists_list(X1),X5))))=>![X4]:p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),X2),s(t_h4s_lists_list(X1),h4s_lists_cons(s(X1,X4),s(t_h4s_lists_list(X1),X5))))))))=>![X3]:p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(X1),t_bool),X2),s(t_h4s_lists_list(X1),X3))))),file('i/f/list/FORALL__LIST0', ah4s_lists_listu_u_INDUCT)).
# SZS output end CNFRefutation
