# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),X2))))=>s(t_fun(X1,t_bool),h4s_lists_listu_u_tou_u_set(s(t_h4s_lists_list(X1),X3)))=s(t_fun(X1,t_bool),h4s_lists_listu_u_tou_u_set(s(t_h4s_lists_list(X1),X2)))),file('i/f/sorting/PERM__LIST__TO__SET', ch4s_sortings_PERMu_u_LISTu_u_TOu_u_SET)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/sorting/PERM__LIST__TO__SET', aHLu_TRUTH)).
fof(7, axiom,![X4]:(s(t_bool,X4)=s(t_bool,t)<=>p(s(t_bool,X4))),file('i/f/sorting/PERM__LIST__TO__SET', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(10, axiom,![X1]:![X2]:![X3]:(p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),X2))))=>![X5]:s(t_bool,h4s_bools_in(s(X1,X5),s(t_fun(X1,t_bool),h4s_lists_listu_u_tou_u_set(s(t_h4s_lists_list(X1),X3)))))=s(t_bool,h4s_bools_in(s(X1,X5),s(t_fun(X1,t_bool),h4s_lists_listu_u_tou_u_set(s(t_h4s_lists_list(X1),X2)))))),file('i/f/sorting/PERM__LIST__TO__SET', ah4s_sortings_PERMu_u_MEMu_u_EQ)).
fof(12, axiom,![X1]:![X4]:![X16]:(s(t_fun(X1,t_bool),X16)=s(t_fun(X1,t_bool),X4)<=>![X5]:s(t_bool,h4s_bools_in(s(X1,X5),s(t_fun(X1,t_bool),X16)))=s(t_bool,h4s_bools_in(s(X1,X5),s(t_fun(X1,t_bool),X4)))),file('i/f/sorting/PERM__LIST__TO__SET', ah4s_predu_u_sets_EXTENSION)).
# SZS output end CNFRefutation
