# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:(p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X4),s(t_h4s_lists_list(X1),X3))),s(t_h4s_lists_list(X1),X2))))=>p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X3),s(t_h4s_lists_list(X1),X4))),s(t_h4s_lists_list(X1),X2))))),file('i/f/sorting/APPEND__PERM__SYM', ch4s_sortings_APPENDu_u_PERMu_u_SYM)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/sorting/APPEND__PERM__SYM', aHLu_FALSITY)).
fof(22, axiom,![X1]:![X13]:![X11]:![X12]:((p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X12),s(t_h4s_lists_list(X1),X11))))&p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X11),s(t_h4s_lists_list(X1),X13)))))=>p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),X12),s(t_h4s_lists_list(X1),X13))))),file('i/f/sorting/APPEND__PERM__SYM', ah4s_sortings_PERMu_u_TRANS)).
fof(23, axiom,![X1]:![X14]:![X15]:p(s(t_bool,h4s_sortings_perm(s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X15),s(t_h4s_lists_list(X1),X14))),s(t_h4s_lists_list(X1),h4s_lists_append(s(t_h4s_lists_list(X1),X14),s(t_h4s_lists_list(X1),X15)))))),file('i/f/sorting/APPEND__PERM__SYM', ah4s_sortings_PERMu_u_APPEND)).
fof(24, axiom,![X7]:(s(t_bool,X7)=s(t_bool,t)|s(t_bool,X7)=s(t_bool,f)),file('i/f/sorting/APPEND__PERM__SYM', aHLu_BOOLu_CASES)).
fof(25, axiom,p(s(t_bool,t)),file('i/f/sorting/APPEND__PERM__SYM', aHLu_TRUTH)).
fof(27, axiom,![X7]:(s(t_bool,X7)=s(t_bool,t)<=>p(s(t_bool,X7))),file('i/f/sorting/APPEND__PERM__SYM', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
