# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))),s(t_h4s_nums_num,h4s_nums_0))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__5_c75', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_5u_c75)).
fof(25, axiom,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))),s(t_h4s_nums_num,h4s_nums_0))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__5_c75', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_COMPAREu_u_1u_c3)).
fof(31, axiom,![X1]:![X2]:(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2)))=s(t_h4s_nums_num,h4s_nums_0)<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__5_c75', ah4s_lists_LENGTHu_u_NIL)).
fof(44, axiom,![X11]:p(s(t_bool,h4s_arithmetics_u_3cu_3d(s(t_h4s_nums_num,h4s_nums_0),s(t_h4s_nums_num,X11)))),file('i/f/quantHeuristics/LIST__LENGTH__5_c75', ah4s_arithmetics_ZEROu_u_LESSu_u_EQ)).
# SZS output end CNFRefutation
