# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,~(s(t_h4s_prelims_ordering,h4s_prelims_less)=s(t_h4s_prelims_ordering,h4s_prelims_equal)),file('i/f/prelim/ordering__distinct_c0', ch4s_prelims_orderingu_u_distinctu_c0)).
fof(19, axiom,![X3]:![X13]:![X14]:![X15]:s(X3,h4s_prelims_orderingu_u_case(s(t_h4s_prelims_ordering,h4s_prelims_equal),s(X3,X15),s(X3,X14),s(X3,X13)))=s(X3,X14),file('i/f/prelim/ordering__distinct_c0', ah4s_prelims_orderingu_u_caseu_u_defu_c1)).
fof(33, axiom,![X3]:![X13]:![X14]:![X15]:s(X3,h4s_prelims_orderingu_u_case(s(t_h4s_prelims_ordering,h4s_prelims_less),s(X3,X15),s(X3,X14),s(X3,X13)))=s(X3,X15),file('i/f/prelim/ordering__distinct_c0', ah4s_prelims_orderingu_u_caseu_u_defu_c0)).
fof(35, axiom,~(p(s(t_bool,f))),file('i/f/prelim/ordering__distinct_c0', aHLu_FALSITY)).
fof(69, axiom,![X20]:![X22]:(s(t_h4s_nums_num,h4s_arithmetics_bit2(s(t_h4s_nums_num,X20)))=s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,X22)))<=>p(s(t_bool,f))),file('i/f/prelim/ordering__distinct_c0', ah4s_numerals_numeralu_u_equ_c5)).
# SZS output end CNFRefutation
