ceta_eq: termination proof not accepted 1: error below switch to dependency pairs 1.1: error below the dependency graph processor 1.1.2: error below the reduction pair processor 1.1.2.1: error below the reduction pair processor 1.1.2.1.1: error below the reduction pair processor 1.1.2.1.1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem pairs: active#(first(X1, X2)) -> active#(X1) active#(first(X1, X2)) -> active#(X2) rules: active(first(0, X)) -> mark(nil) active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z))) active(from(X)) -> mark(cons(X, from(s(X)))) active(first(X1, X2)) -> first(active(X1), X2) active(first(X1, X2)) -> first(X1, active(X2)) active(s(X)) -> s(active(X)) active(cons(X1, X2)) -> cons(active(X1), X2) active(from(X)) -> from(active(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) first(mark(X1), X2) -> mark(first(X1, X2)) first(X1, mark(X2)) -> mark(first(X1, X2)) first(ok(X1), ok(X2)) -> ok(first(X1, X2)) from(mark(X)) -> mark(from(X)) from(ok(X)) -> ok(from(X)) proper(first(X1, X2)) -> first(proper(X1), proper(X2)) proper(0) -> ok(0) proper(nil) -> ok(nil) proper(s(X)) -> s(proper(X)) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(from(X)) -> from(proper(X)) s(mark(X)) -> mark(s(X)) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) the pairs active#(first(X1, X2)) -> active#(X1) active#(first(X1, X2)) -> active#(X2) could not apply the generic root reduction pair processor with the following SCNP-version with mu = MS and the level mapping defined by pi(active#) = [(epsilon,0),(1,0)] polynomial interpretration over naturals with negative constants Pol(active#(x_1)) = 1 Pol(first(x_1, x_2)) = 1 + x_2 + x_1 problem when orienting DPs cannot orient pair active#(first(X1, X2)) -> active#(X1) strictly: [(active#(first(X1, X2)),0),(first(X1, X2),0)] >mu [(active#(X1),0),(X1,0)] could not be ensured