# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))))))=>(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))))))=>(s(t_h4s_prelims_ordering,h4s_prelims_num2ordering(s(t_h4s_nums_num,X2)))=s(t_h4s_prelims_ordering,h4s_prelims_num2ordering(s(t_h4s_nums_num,X1)))<=>s(t_h4s_nums_num,X2)=s(t_h4s_nums_num,X1)))),file('i/f/prelim/num2ordering__11', ch4s_prelims_num2orderingu_u_11)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/prelim/num2ordering__11', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/prelim/num2ordering__11', aHLu_FALSITY)).
fof(4, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)|s(t_bool,X3)=s(t_bool,f)),file('i/f/prelim/num2ordering__11', aHLu_BOOLu_CASES)).
fof(6, axiom,![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))))))<=>s(t_h4s_nums_num,h4s_prelims_ordering2num(s(t_h4s_prelims_ordering,h4s_prelims_num2ordering(s(t_h4s_nums_num,X2)))))=s(t_h4s_nums_num,X2)),file('i/f/prelim/num2ordering__11', ah4s_prelims_orderingu_u_BIJu_c1)).
# SZS output end CNFRefutation
