# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:p(s(t_bool,h4s_llists_lfinite(s(t_h4s_llists_llist(X1),h4s_llists_lnil)))),file('i/f/llist/LFINITE__rules_c0', ch4s_llists_LFINITEu_u_rulesu_c0)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/llist/LFINITE__rules_c0', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/llist/LFINITE__rules_c0', aHLu_FALSITY)).
fof(10, axiom,![X5]:(s(t_bool,f)=s(t_bool,X5)<=>~(p(s(t_bool,X5)))),file('i/f/llist/LFINITE__rules_c0', ah4s_bools_EQu_u_CLAUSESu_c2)).
fof(62, axiom,![X1]:![X2]:(p(s(t_bool,h4s_llists_lfinite(s(t_h4s_llists_llist(X1),X2))))<=>![X25]:(![X26]:((s(t_h4s_llists_llist(X1),X26)=s(t_h4s_llists_llist(X1),h4s_llists_lnil)|?[X27]:?[X5]:(s(t_h4s_llists_llist(X1),X26)=s(t_h4s_llists_llist(X1),h4s_llists_lcons(s(X1,X27),s(t_h4s_llists_llist(X1),X5)))&p(s(t_bool,happ(s(t_fun(t_h4s_llists_llist(X1),t_bool),X25),s(t_h4s_llists_llist(X1),X5))))))=>p(s(t_bool,happ(s(t_fun(t_h4s_llists_llist(X1),t_bool),X25),s(t_h4s_llists_llist(X1),X26)))))=>p(s(t_bool,happ(s(t_fun(t_h4s_llists_llist(X1),t_bool),X25),s(t_h4s_llists_llist(X1),X2)))))),file('i/f/llist/LFINITE__rules_c0', ah4s_llists_LFINITEu_u_def)).
fof(76, axiom,![X5]:(s(t_bool,X5)=s(t_bool,t)|s(t_bool,X5)=s(t_bool,f)),file('i/f/llist/LFINITE__rules_c0', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
