# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:p(s(t_bool,h4s_predu_u_sets_finite(s(t_fun(t_h4s_nums_num,t_bool),h4s_patricias_numsetu_u_ofu_u_ptree(s(t_h4s_patricias_ptree(t_h4s_ones_one),X1)))))),file('i/f/patricia/FINITE__NUMSET__OF__PTREE', ch4s_patricias_FINITEu_u_NUMSETu_u_OFu_u_PTREE)).
fof(2, axiom,p(s(t_bool,t0)),file('i/f/patricia/FINITE__NUMSET__OF__PTREE', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/patricia/FINITE__NUMSET__OF__PTREE', aHLu_FALSITY)).
fof(6, axiom,![X2]:![X3]:p(s(t_bool,h4s_predu_u_sets_finite(s(t_fun(X2,t_bool),h4s_lists_listu_u_tou_u_set(s(t_h4s_lists_list(X2),X3)))))),file('i/f/patricia/FINITE__NUMSET__OF__PTREE', ah4s_lists_FINITEu_u_LISTu_u_TOu_u_SET)).
fof(7, axiom,![X1]:(s(t_bool,X1)=s(t_bool,t0)|s(t_bool,X1)=s(t_bool,f)),file('i/f/patricia/FINITE__NUMSET__OF__PTREE', aHLu_BOOLu_CASES)).
fof(8, axiom,![X1]:s(t_fun(t_h4s_nums_num,t_bool),h4s_patricias_numsetu_u_ofu_u_ptree(s(t_h4s_patricias_ptree(t_h4s_ones_one),X1)))=s(t_fun(t_h4s_nums_num,t_bool),h4s_lists_listu_u_tou_u_set(s(t_h4s_lists_list(t_h4s_nums_num),h4s_patricias_traverse(s(t_h4s_patricias_ptree(t_h4s_ones_one),X1))))),file('i/f/patricia/FINITE__NUMSET__OF__PTREE', ah4s_patricias_NUMSETu_u_OFu_u_PTREEu_u_def)).
# SZS output end CNFRefutation
