# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:p(s(t_bool,h4s_lbtrees_finite(s(t_h4s_lbtrees_lbtree(X1),h4s_lbtrees_lf)))),file('i/f/lbtree/finite__rules_c0', ch4s_lbtrees_finiteu_u_rulesu_c0)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/lbtree/finite__rules_c0', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/lbtree/finite__rules_c0', aHLu_FALSITY)).
fof(5, axiom,![X2]:![X3]:((p(s(t_bool,X3))=>p(s(t_bool,X2)))=>((p(s(t_bool,X2))=>p(s(t_bool,X3)))=>s(t_bool,X3)=s(t_bool,X2))),file('i/f/lbtree/finite__rules_c0', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(12, axiom,![X1]:![X7]:(p(s(t_bool,h4s_lbtrees_finite(s(t_h4s_lbtrees_lbtree(X1),X7))))<=>![X16]:(![X17]:((s(t_h4s_lbtrees_lbtree(X1),X17)=s(t_h4s_lbtrees_lbtree(X1),h4s_lbtrees_lf)|?[X18]:?[X3]:?[X2]:(s(t_h4s_lbtrees_lbtree(X1),X17)=s(t_h4s_lbtrees_lbtree(X1),h4s_lbtrees_nd(s(X1,X18),s(t_h4s_lbtrees_lbtree(X1),X3),s(t_h4s_lbtrees_lbtree(X1),X2)))&(p(s(t_bool,happ(s(t_fun(t_h4s_lbtrees_lbtree(X1),t_bool),X16),s(t_h4s_lbtrees_lbtree(X1),X3))))&p(s(t_bool,happ(s(t_fun(t_h4s_lbtrees_lbtree(X1),t_bool),X16),s(t_h4s_lbtrees_lbtree(X1),X2)))))))=>p(s(t_bool,happ(s(t_fun(t_h4s_lbtrees_lbtree(X1),t_bool),X16),s(t_h4s_lbtrees_lbtree(X1),X17)))))=>p(s(t_bool,happ(s(t_fun(t_h4s_lbtrees_lbtree(X1),t_bool),X16),s(t_h4s_lbtrees_lbtree(X1),X7)))))),file('i/f/lbtree/finite__rules_c0', ah4s_lbtrees_finiteu_u_def)).
fof(13, axiom,![X4]:(s(t_bool,X4)=s(t_bool,t)|s(t_bool,X4)=s(t_bool,f)),file('i/f/lbtree/finite__rules_c0', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
