# 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(6, axiom,![X9]:![X10]:(![X8]:![X11]:(s(t_h4s_prelims_ordering,happ(s(t_fun(X9,t_h4s_prelims_ordering),happ(s(t_fun(X9,t_fun(X9,t_h4s_prelims_ordering)),X10),s(X9,X8))),s(X9,X11)))=s(t_h4s_prelims_ordering,h4s_prelims_equal)<=>s(X9,X8)=s(X9,X11))=>![X2]:![X1]:(s(t_h4s_prelims_ordering,h4s_prelims_listu_u_compare(s(t_fun(X9,t_fun(X9,t_h4s_prelims_ordering)),X10),s(t_h4s_lists_list(X9),X2),s(t_h4s_lists_list(X9),X1)))=s(t_h4s_prelims_ordering,h4s_prelims_equal)<=>s(t_h4s_lists_list(X9),X2)=s(t_h4s_lists_list(X9),X1))),file('i/f/quote/compare__list__index', ah4s_prelims_compareu_u_equal)).
fof(7, axiom,![X12]:![X13]:(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,X13))),s(t_h4s_quotes_index,X12)))=s(t_h4s_prelims_ordering,h4s_prelims_equal)<=>s(t_h4s_quotes_index,X13)=s(t_h4s_quotes_index,X12)),file('i/f/quote/compare__list__index', ah4s_quotes_compareu_u_indexu_u_equal)).
# SZS output end CNFRefutation
