# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:p(s(t_bool,h4s_sortings_permu_u_singleu_u_swap(s(t_h4s_lists_list(X1),X2),s(t_h4s_lists_list(X1),X2)))),file('i/f/sorting/PERM__SINGLE__SWAP__REFL', ch4s_sortings_PERMu_u_SINGLEu_u_SWAPu_u_REFL)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/sorting/PERM__SINGLE__SWAP__REFL', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/sorting/PERM__SINGLE__SWAP__REFL', aHLu_FALSITY)).
fof(7, axiom,![X1]:![X5]:![X6]:(p(s(t_bool,h4s_sortings_permu_u_singleu_u_swap(s(t_h4s_lists_list(X1),X6),s(t_h4s_lists_list(X1),X5))))<=>?[X7]:?[X8]:?[X9]:(s(t_h4s_lists_list(X1),X6)=s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X7),s(t_h4s_lists_list(X1),X8))),s(t_h4s_lists_list(X1),X9)))&s(t_h4s_lists_list(X1),X5)=s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X7),s(t_h4s_lists_list(X1),X9))),s(t_h4s_lists_list(X1),X8))))),file('i/f/sorting/PERM__SINGLE__SWAP__REFL', ah4s_sortings_PERMu_u_SINGLEu_u_SWAPu_u_DEF)).
fof(8, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)|s(t_bool,X3)=s(t_bool,f)),file('i/f/sorting/PERM__SINGLE__SWAP__REFL', aHLu_BOOLu_CASES)).
fof(9, axiom,![X1]:![X2]:s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X2),s(t_h4s_lists_list(X1),h4s_lists_nil)))=s(t_h4s_lists_list(X1),X2),file('i/f/sorting/PERM__SINGLE__SWAP__REFL', ah4s_lists_APPENDu_u_NIL)).
# SZS output end CNFRefutation
