# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(s(t_h4s_prelims_ordering,h4s_prelims_listu_u_compare(s(t_fun(t_h4s_quotes_index,t_fun(t_h4s_quotes_index,t_h4s_prelims_ordering)),h4s_quotes_indexu_u_compare),s(t_h4s_lists_list(t_h4s_quotes_index),X2),s(t_h4s_lists_list(t_h4s_quotes_index),X1)))=s(t_h4s_prelims_ordering,h4s_prelims_equal)<=>s(t_h4s_lists_list(t_h4s_quotes_index),X2)=s(t_h4s_lists_list(t_h4s_quotes_index),X1)),file('i/f/quote/compare__list__index', ch4s_quotes_compareu_u_listu_u_index)).
fof(3, axiom,![X3]:![X6]:(![X5]:![X4]:(s(t_h4s_prelims_ordering,happ(s(t_fun(X3,t_h4s_prelims_ordering),happ(s(t_fun(X3,t_fun(X3,t_h4s_prelims_ordering)),X6),s(X3,X5))),s(X3,X4)))=s(t_h4s_prelims_ordering,h4s_prelims_equal)<=>s(X3,X5)=s(X3,X4))=>![X2]:![X1]:(s(t_h4s_prelims_ordering,h4s_prelims_listu_u_compare(s(t_fun(X3,t_fun(X3,t_h4s_prelims_ordering)),X6),s(t_h4s_lists_list(X3),X2),s(t_h4s_lists_list(X3),X1)))=s(t_h4s_prelims_ordering,h4s_prelims_equal)<=>s(t_h4s_lists_list(X3),X2)=s(t_h4s_lists_list(X3),X1))),file('i/f/quote/compare__list__index', ah4s_prelims_compareu_u_equal)).
fof(4, axiom,![X7]:![X8]:(s(t_h4s_prelims_ordering,happ(s(t_fun(t_h4s_quotes_index,t_h4s_prelims_ordering),happ(s(t_fun(t_h4s_quotes_index,t_fun(t_h4s_quotes_index,t_h4s_prelims_ordering)),h4s_quotes_indexu_u_compare),s(t_h4s_quotes_index,X8))),s(t_h4s_quotes_index,X7)))=s(t_h4s_prelims_ordering,h4s_prelims_equal)<=>s(t_h4s_quotes_index,X8)=s(t_h4s_quotes_index,X7)),file('i/f/quote/compare__list__index', ah4s_quotes_compareu_u_indexu_u_equal)).
# SZS output end CNFRefutation
