# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:p(s(t_bool,h4s_relations_equivalence(s(t_fun(t_h4s_lists_list(X1),t_fun(t_h4s_lists_list(X1),t_bool)),h4s_sortings_perm)))),file('i/f/sorting/PERM__EQUIVALENCE', ch4s_sortings_PERMu_u_EQUIVALENCE)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/sorting/PERM__EQUIVALENCE', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/sorting/PERM__EQUIVALENCE', aHLu_FALSITY)).
fof(6, axiom,![X1]:![X3]:p(s(t_bool,h4s_relations_equivalence(s(t_fun(X1,t_fun(X1,t_bool)),h4s_relations_eqc(s(t_fun(X1,t_fun(X1,t_bool)),X3)))))),file('i/f/sorting/PERM__EQUIVALENCE', ah4s_relations_EQCu_u_EQUIVALENCE)).
fof(7, axiom,![X2]:(s(t_bool,X2)=s(t_bool,t)|s(t_bool,X2)=s(t_bool,f)),file('i/f/sorting/PERM__EQUIVALENCE', aHLu_BOOLu_CASES)).
fof(8, axiom,![X1]:s(t_fun(t_h4s_lists_list(X1),t_fun(t_h4s_lists_list(X1),t_bool)),h4s_sortings_perm)=s(t_fun(t_h4s_lists_list(X1),t_fun(t_h4s_lists_list(X1),t_bool)),h4s_relations_eqc(s(t_fun(t_h4s_lists_list(X1),t_fun(t_h4s_lists_list(X1),t_bool)),h4s_sortings_permu_u_singleu_u_swap))),file('i/f/sorting/PERM__EQUIVALENCE', ah4s_sortings_PERMu_u_EQC)).
# SZS output end CNFRefutation
