# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3e(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__COMPARE__1_c1', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_COMPAREu_u_1u_c1)).
fof(27, axiom,![X1]:![X2]:(p(s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))),s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,h4s_arithmetics_zero))))))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__COMPARE__1_c1', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_COMPAREu_u_1u_c0)).
fof(29, axiom,![X1]:s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),h4s_lists_nil)))=s(t_h4s_nums_num,h4s_nums_0),file('i/f/quantHeuristics/LIST__LENGTH__COMPARE__1_c1', ah4s_lists_LENGTH0u_c0)).
fof(30, axiom,![X1]:s(t_h4s_lists_list(X1),h4s_lists_nil)=s(t_h4s_lists_list(X1),h4s_lists_u_20u_40indu_u_typelist0),file('i/f/quantHeuristics/LIST__LENGTH__COMPARE__1_c1', ah4s_lists_NIL0)).
fof(73, axiom,![X22]:![X25]:s(t_bool,h4s_arithmetics_u_3e(s(t_h4s_nums_num,X25),s(t_h4s_nums_num,X22)))=s(t_bool,h4s_primu_u_recs_u_3c(s(t_h4s_nums_num,X22),s(t_h4s_nums_num,X25))),file('i/f/quantHeuristics/LIST__LENGTH__COMPARE__1_c1', ah4s_arithmetics_GREATERu_u_DEF)).
# SZS output end CNFRefutation
