/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Problem: a__zeros() -> cons(0(),zeros()) a__and(tt(),X) -> mark(X) a__length(nil()) -> 0() a__length(cons(N,L)) -> s(a__length(mark(L))) a__take(0(),IL) -> nil() a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) mark(zeros()) -> a__zeros() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) a__zeros() -> zeros() a__and(X1,X2) -> and(X1,X2) a__length(X) -> length(X) a__take(X1,X2) -> take(X1,X2) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [1] [length](x0) = [0 0 0]x0 + [0] [0 1 0] [0], [1 0 0] [1 0 0] [and](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 1] , [1 0 1] [1 0 1] [take](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 1] , [1 1 1] [1 0 1] [a__take](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 1 1] , [1 0 0] [s](x0) = [0 0 0]x0 [0 0 1] , [1 0 1] [1] [a__length](x0) = [0 0 0]x0 + [0] [0 1 0] [0], [0] [nil] = [0] [0], [1 0 0] [mark](x0) = [0 0 0]x0 [0 0 1] , [1 0 0] [1 0 0] [a__and](x0, x1) = [0 1 0]x0 + [0 0 0]x1 [0 0 0] [0 0 1] , [1] [tt] = [0] [0], [1 0 0] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 1 1] [0 0 1] , [0] [zeros] = [0] [0], [0] [0] = [0] [0], [0] [a__zeros] = [0] [0] orientation: [0] [0] a__zeros() = [0] >= [0] = cons(0(),zeros()) [0] [0] [1 0 0] [1] [1 0 0] a__and(tt(),X) = [0 0 0]X + [0] >= [0 0 0]X = mark(X) [0 0 1] [0] [0 0 1] [1] [0] a__length(nil()) = [0] >= [0] = 0() [0] [0] [1 0 1] [1 1 1] [1] [1 0 1] [1] a__length(cons(N,L)) = [0 0 0]L + [0 0 0]N + [0] >= [0 0 0]L + [0] = s(a__length(mark(L))) [0 0 0] [0 0 0] [0] [0 0 0] [0] [1 0 1] [0] a__take(0(),IL) = [0 0 0]IL >= [0] = nil() [0 1 1] [0] [1 0 1] [1 0 1] [1 1 1] [1 0 1] [1 0 1] [1 0 0] a__take(s(M),cons(N,IL)) = [0 0 0]IL + [0 0 0]M + [0 0 0]N >= [0 0 0]IL + [0 0 0]M + [0 0 0]N = cons(mark(N),take(M,IL)) [0 0 1] [0 0 0] [0 1 1] [0 0 1] [0 0 0] [0 0 1] [0] [0] mark(zeros()) = [0] >= [0] = a__zeros() [0] [0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] mark(and(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = a__and(mark(X1),X2) [0 0 0] [0 0 1] [0 0 0] [0 0 1] [1 0 1] [1] [1 0 1] [1] mark(length(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = a__length(mark(X)) [0 1 0] [0] [0 0 0] [0] [1 0 1] [1 0 1] [1 0 1] [1 0 1] mark(take(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = a__take(mark(X1),mark(X2)) [0 0 0] [0 0 1] [0 0 0] [0 0 1] [1 0 0] [1 0 0] [1 0 0] [1 0 0] mark(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = cons(mark(X1),X2) [0 1 1] [0 0 1] [0 0 1] [0 0 1] [0] [0] mark(0()) = [0] >= [0] = 0() [0] [0] [1] [1] mark(tt()) = [0] >= [0] = tt() [0] [0] [0] [0] mark(nil()) = [0] >= [0] = nil() [0] [0] [1 0 0] [1 0 0] mark(s(X)) = [0 0 0]X >= [0 0 0]X = s(mark(X)) [0 0 1] [0 0 1] [0] [0] a__zeros() = [0] >= [0] = zeros() [0] [0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] a__and(X1,X2) = [0 1 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = and(X1,X2) [0 0 0] [0 0 1] [0 0 0] [0 0 1] [1 0 1] [1] [1 0 1] [1] a__length(X) = [0 0 0]X + [0] >= [0 0 0]X + [0] = length(X) [0 1 0] [0] [0 1 0] [0] [1 1 1] [1 0 1] [1 0 1] [1 0 1] a__take(X1,X2) = [0 0 0]X1 + [0 0 0]X2 >= [0 0 0]X1 + [0 0 0]X2 = take(X1,X2) [0 0 0] [0 1 1] [0 0 0] [0 0 1] problem: a__zeros() -> cons(0(),zeros()) a__length(cons(N,L)) -> s(a__length(mark(L))) a__take(0(),IL) -> nil() a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) mark(zeros()) -> a__zeros() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) a__zeros() -> zeros() a__and(X1,X2) -> and(X1,X2) a__length(X) -> length(X) a__take(X1,X2) -> take(X1,X2) Matrix Interpretation Processor: dim=1 interpretation: [length](x0) = x0 + 2, [and](x0, x1) = x0 + x1, [take](x0, x1) = x0 + 2x1 + 1, [a__take](x0, x1) = x0 + 2x1 + 1, [s](x0) = x0, [a__length](x0) = x0 + 2, [nil] = 0, [mark](x0) = x0, [a__and](x0, x1) = x0 + x1, [tt] = 0, [cons](x0, x1) = x0 + x1, [zeros] = 0, [0] = 0, [a__zeros] = 0 orientation: a__zeros() = 0 >= 0 = cons(0(),zeros()) a__length(cons(N,L)) = L + N + 2 >= L + 2 = s(a__length(mark(L))) a__take(0(),IL) = 2IL + 1 >= 0 = nil() a__take(s(M),cons(N,IL)) = 2IL + M + 2N + 1 >= 2IL + M + N + 1 = cons(mark(N),take(M,IL)) mark(zeros()) = 0 >= 0 = a__zeros() mark(and(X1,X2)) = X1 + X2 >= X1 + X2 = a__and(mark(X1),X2) mark(length(X)) = X + 2 >= X + 2 = a__length(mark(X)) mark(take(X1,X2)) = X1 + 2X2 + 1 >= X1 + 2X2 + 1 = a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(nil()) = 0 >= 0 = nil() mark(s(X)) = X >= X = s(mark(X)) a__zeros() = 0 >= 0 = zeros() a__and(X1,X2) = X1 + X2 >= X1 + X2 = and(X1,X2) a__length(X) = X + 2 >= X + 2 = length(X) a__take(X1,X2) = X1 + 2X2 + 1 >= X1 + 2X2 + 1 = take(X1,X2) problem: a__zeros() -> cons(0(),zeros()) a__length(cons(N,L)) -> s(a__length(mark(L))) a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) mark(zeros()) -> a__zeros() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) a__zeros() -> zeros() a__and(X1,X2) -> and(X1,X2) a__length(X) -> length(X) a__take(X1,X2) -> take(X1,X2) Matrix Interpretation Processor: dim=3 interpretation: [1 1 0] [1] [length](x0) = [0 0 1]x0 + [0] [0 1 0] [0], [1 0 0] [and](x0, x1) = x0 + [0 0 0]x1 [0 0 0] , [1 1 0] [1 1 0] [take](x0, x1) = [0 0 1]x0 + [0 0 1]x1 [0 1 0] [0 1 0] , [1 1 0] [1 1 0] [a__take](x0, x1) = [0 0 1]x0 + [0 0 1]x1 [0 1 0] [0 1 0] , [1 0 0] [s](x0) = [0 1 1]x0 [0 1 1] , [1 1 0] [1] [a__length](x0) = [0 0 1]x0 + [0] [0 1 0] [0], [0] [nil] = [1] [1], [1 1 0] [mark](x0) = [0 0 1]x0 [0 1 0] , [1 0 0] [a__and](x0, x1) = x0 + [0 0 0]x1 [0 0 0] , [0] [tt] = [0] [0], [1 0 0] [cons](x0, x1) = x0 + [0 1 1]x1 [0 1 1] , [0] [zeros] = [0] [0], [0] [0] = [0] [0], [0] [a__zeros] = [0] [0] orientation: [0] [0] a__zeros() = [0] >= [0] = cons(0(),zeros()) [0] [0] [1 1 1] [1 1 0] [1] [1 1 1] [1] a__length(cons(N,L)) = [0 1 1]L + [0 0 1]N + [0] >= [0 1 1]L + [0] = s(a__length(mark(L))) [0 1 1] [0 1 0] [0] [0 1 1] [0] [1 1 1] [1 1 1] [1 1 0] [1 1 0] [1 1 0] [1 1 0] a__take(s(M),cons(N,IL)) = [0 1 1]IL + [0 1 1]M + [0 0 1]N >= [0 1 1]IL + [0 1 1]M + [0 0 1]N = cons(mark(N),take(M,IL)) [0 1 1] [0 1 1] [0 1 0] [0 1 1] [0 1 1] [0 1 0] [0] [0] mark(zeros()) = [0] >= [0] = a__zeros() [0] [0] [1 1 0] [1 0 0] [1 1 0] [1 0 0] mark(and(X1,X2)) = [0 0 1]X1 + [0 0 0]X2 >= [0 0 1]X1 + [0 0 0]X2 = a__and(mark(X1),X2) [0 1 0] [0 0 0] [0 1 0] [0 0 0] [1 1 1] [1] [1 1 1] [1] mark(length(X)) = [0 1 0]X + [0] >= [0 1 0]X + [0] = a__length(mark(X)) [0 0 1] [0] [0 0 1] [0] [1 1 1] [1 1 1] [1 1 1] [1 1 1] mark(take(X1,X2)) = [0 1 0]X1 + [0 1 0]X2 >= [0 1 0]X1 + [0 1 0]X2 = a__take(mark(X1),mark(X2)) [0 0 1] [0 0 1] [0 0 1] [0 0 1] [1 1 0] [1 1 1] [1 1 0] [1 0 0] mark(cons(X1,X2)) = [0 0 1]X1 + [0 1 1]X2 >= [0 0 1]X1 + [0 1 1]X2 = cons(mark(X1),X2) [0 1 0] [0 1 1] [0 1 0] [0 1 1] [0] [0] mark(0()) = [0] >= [0] = 0() [0] [0] [0] [0] mark(tt()) = [0] >= [0] = tt() [0] [0] [1] [0] mark(nil()) = [1] >= [1] = nil() [1] [1] [1 1 1] [1 1 0] mark(s(X)) = [0 1 1]X >= [0 1 1]X = s(mark(X)) [0 1 1] [0 1 1] [0] [0] a__zeros() = [0] >= [0] = zeros() [0] [0] [1 0 0] [1 0 0] a__and(X1,X2) = X1 + [0 0 0]X2 >= X1 + [0 0 0]X2 = and(X1,X2) [0 0 0] [0 0 0] [1 1 0] [1] [1 1 0] [1] a__length(X) = [0 0 1]X + [0] >= [0 0 1]X + [0] = length(X) [0 1 0] [0] [0 1 0] [0] [1 1 0] [1 1 0] [1 1 0] [1 1 0] a__take(X1,X2) = [0 0 1]X1 + [0 0 1]X2 >= [0 0 1]X1 + [0 0 1]X2 = take(X1,X2) [0 1 0] [0 1 0] [0 1 0] [0 1 0] problem: a__zeros() -> cons(0(),zeros()) a__length(cons(N,L)) -> s(a__length(mark(L))) a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) mark(zeros()) -> a__zeros() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) a__zeros() -> zeros() a__and(X1,X2) -> and(X1,X2) a__length(X) -> length(X) a__take(X1,X2) -> take(X1,X2) Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [length](x0) = [0 0 1]x0 [0 1 0] , [1 0 1] [1 0 0] [0] [and](x0, x1) = [0 0 1]x0 + [0 0 0]x1 + [1] [0 1 0] [0 0 0] [1], [1 0 1] [1 0 1] [take](x0, x1) = [0 0 1]x0 + [0 0 1]x1 [0 1 0] [0 1 0] , [1 0 1] [1 0 1] [a__take](x0, x1) = [0 0 1]x0 + [0 0 1]x1 [0 1 0] [0 1 0] , [1 0 0] [s](x0) = [0 1 1]x0 [0 1 1] , [1 0 1] [a__length](x0) = [0 0 1]x0 [0 1 0] , [1 0 1] [mark](x0) = [0 0 1]x0 [0 1 0] , [1 0 1] [1 0 0] [1] [a__and](x0, x1) = [0 0 1]x0 + [0 0 0]x1 + [1] [0 1 0] [0 0 0] [1], [0] [tt] = [0] [0], [1 0 0] [cons](x0, x1) = x0 + [0 1 1]x1 [0 1 1] , [1] [zeros] = [0] [0], [0] [0] = [0] [0], [1] [a__zeros] = [0] [0] orientation: [1] [1] a__zeros() = [0] >= [0] = cons(0(),zeros()) [0] [0] [1 1 1] [1 0 1] [1 1 1] a__length(cons(N,L)) = [0 1 1]L + [0 0 1]N >= [0 1 1]L = s(a__length(mark(L))) [0 1 1] [0 1 0] [0 1 1] [1 1 1] [1 1 1] [1 0 1] [1 0 1] [1 0 1] [1 0 1] a__take(s(M),cons(N,IL)) = [0 1 1]IL + [0 1 1]M + [0 0 1]N >= [0 1 1]IL + [0 1 1]M + [0 0 1]N = cons(mark(N),take(M,IL)) [0 1 1] [0 1 1] [0 1 0] [0 1 1] [0 1 1] [0 1 0] [1] [1] mark(zeros()) = [0] >= [0] = a__zeros() [0] [0] [1 1 1] [1 0 0] [1] [1 1 1] [1 0 0] [1] mark(and(X1,X2)) = [0 1 0]X1 + [0 0 0]X2 + [1] >= [0 1 0]X1 + [0 0 0]X2 + [1] = a__and(mark(X1),X2) [0 0 1] [0 0 0] [1] [0 0 1] [0 0 0] [1] [1 1 1] [1 1 1] mark(length(X)) = [0 1 0]X >= [0 1 0]X = a__length(mark(X)) [0 0 1] [0 0 1] [1 1 1] [1 1 1] [1 1 1] [1 1 1] mark(take(X1,X2)) = [0 1 0]X1 + [0 1 0]X2 >= [0 1 0]X1 + [0 1 0]X2 = a__take(mark(X1),mark(X2)) [0 0 1] [0 0 1] [0 0 1] [0 0 1] [1 0 1] [1 1 1] [1 0 1] [1 0 0] mark(cons(X1,X2)) = [0 0 1]X1 + [0 1 1]X2 >= [0 0 1]X1 + [0 1 1]X2 = cons(mark(X1),X2) [0 1 0] [0 1 1] [0 1 0] [0 1 1] [0] [0] mark(0()) = [0] >= [0] = 0() [0] [0] [0] [0] mark(tt()) = [0] >= [0] = tt() [0] [0] [1 1 1] [1 0 1] mark(s(X)) = [0 1 1]X >= [0 1 1]X = s(mark(X)) [0 1 1] [0 1 1] [1] [1] a__zeros() = [0] >= [0] = zeros() [0] [0] [1 0 1] [1 0 0] [1] [1 0 1] [1 0 0] [0] a__and(X1,X2) = [0 0 1]X1 + [0 0 0]X2 + [1] >= [0 0 1]X1 + [0 0 0]X2 + [1] = and(X1,X2) [0 1 0] [0 0 0] [1] [0 1 0] [0 0 0] [1] [1 0 1] [1 0 1] a__length(X) = [0 0 1]X >= [0 0 1]X = length(X) [0 1 0] [0 1 0] [1 0 1] [1 0 1] [1 0 1] [1 0 1] a__take(X1,X2) = [0 0 1]X1 + [0 0 1]X2 >= [0 0 1]X1 + [0 0 1]X2 = take(X1,X2) [0 1 0] [0 1 0] [0 1 0] [0 1 0] problem: a__zeros() -> cons(0(),zeros()) a__length(cons(N,L)) -> s(a__length(mark(L))) a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) mark(zeros()) -> a__zeros() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) a__zeros() -> zeros() a__length(X) -> length(X) a__take(X1,X2) -> take(X1,X2) Matrix Interpretation Processor: dim=1 interpretation: [length](x0) = 2x0 + 1, [and](x0, x1) = 4x0 + 4x1 + 2, [take](x0, x1) = 4x0 + 2x1, [a__take](x0, x1) = 4x0 + 2x1, [s](x0) = x0, [a__length](x0) = 2x0 + 1, [mark](x0) = x0, [a__and](x0, x1) = x0 + 2x1, [tt] = 0, [cons](x0, x1) = x0 + x1, [zeros] = 0, [0] = 0, [a__zeros] = 0 orientation: a__zeros() = 0 >= 0 = cons(0(),zeros()) a__length(cons(N,L)) = 2L + 2N + 1 >= 2L + 1 = s(a__length(mark(L))) a__take(s(M),cons(N,IL)) = 2IL + 4M + 2N >= 2IL + 4M + N = cons(mark(N),take(M,IL)) mark(zeros()) = 0 >= 0 = a__zeros() mark(and(X1,X2)) = 4X1 + 4X2 + 2 >= X1 + 2X2 = a__and(mark(X1),X2) mark(length(X)) = 2X + 1 >= 2X + 1 = a__length(mark(X)) mark(take(X1,X2)) = 4X1 + 2X2 >= 4X1 + 2X2 = a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) a__zeros() = 0 >= 0 = zeros() a__length(X) = 2X + 1 >= 2X + 1 = length(X) a__take(X1,X2) = 4X1 + 2X2 >= 4X1 + 2X2 = take(X1,X2) problem: a__zeros() -> cons(0(),zeros()) a__length(cons(N,L)) -> s(a__length(mark(L))) a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) mark(zeros()) -> a__zeros() mark(length(X)) -> a__length(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) a__zeros() -> zeros() a__length(X) -> length(X) a__take(X1,X2) -> take(X1,X2) Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [length](x0) = [0 1 0]x0 [0 0 1] , [1 0 1] [take](x0, x1) = x0 + [0 1 0]x1 [0 0 1] , [1 0 1] [a__take](x0, x1) = x0 + [0 1 0]x1 [0 0 1] , [1 0 0] [s](x0) = [0 1 0]x0 [0 1 1] , [1 0 1] [a__length](x0) = [0 1 0]x0 [0 0 1] , [1 1 0] [mark](x0) = [0 1 0]x0 [0 0 1] , [0] [tt] = [1] [0], [1 0 0] [1 0 0] [cons](x0, x1) = [0 1 0]x0 + [0 1 0]x1 [0 1 1] [0 1 1] , [0] [zeros] = [0] [0], [0] [0] = [0] [0], [0] [a__zeros] = [0] [0] orientation: [0] [0] a__zeros() = [0] >= [0] = cons(0(),zeros()) [0] [0] [1 1 1] [1 1 1] [1 1 1] a__length(cons(N,L)) = [0 1 0]L + [0 1 0]N >= [0 1 0]L = s(a__length(mark(L))) [0 1 1] [0 1 1] [0 1 1] [1 1 1] [1 0 0] [1 1 1] [1 0 1] [1 0 0] [1 1 0] a__take(s(M),cons(N,IL)) = [0 1 0]IL + [0 1 0]M + [0 1 0]N >= [0 1 0]IL + [0 1 0]M + [0 1 0]N = cons(mark(N),take(M,IL)) [0 1 1] [0 1 1] [0 1 1] [0 1 1] [0 1 1] [0 1 1] [0] [0] mark(zeros()) = [0] >= [0] = a__zeros() [0] [0] [1 1 1] [1 1 1] mark(length(X)) = [0 1 0]X >= [0 1 0]X = a__length(mark(X)) [0 0 1] [0 0 1] [1 1 0] [1 1 1] [1 1 0] [1 1 1] mark(take(X1,X2)) = [0 1 0]X1 + [0 1 0]X2 >= [0 1 0]X1 + [0 1 0]X2 = a__take(mark(X1),mark(X2)) [0 0 1] [0 0 1] [0 0 1] [0 0 1] [1 1 0] [1 1 0] [1 1 0] [1 0 0] mark(cons(X1,X2)) = [0 1 0]X1 + [0 1 0]X2 >= [0 1 0]X1 + [0 1 0]X2 = cons(mark(X1),X2) [0 1 1] [0 1 1] [0 1 1] [0 1 1] [0] [0] mark(0()) = [0] >= [0] = 0() [0] [0] [1] [0] mark(tt()) = [1] >= [1] = tt() [0] [0] [1 1 0] [1 1 0] mark(s(X)) = [0 1 0]X >= [0 1 0]X = s(mark(X)) [0 1 1] [0 1 1] [0] [0] a__zeros() = [0] >= [0] = zeros() [0] [0] [1 0 1] [1 0 1] a__length(X) = [0 1 0]X >= [0 1 0]X = length(X) [0 0 1] [0 0 1] [1 0 1] [1 0 1] a__take(X1,X2) = X1 + [0 1 0]X2 >= X1 + [0 1 0]X2 = take(X1,X2) [0 0 1] [0 0 1] problem: a__zeros() -> cons(0(),zeros()) a__length(cons(N,L)) -> s(a__length(mark(L))) a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) mark(zeros()) -> a__zeros() mark(length(X)) -> a__length(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(s(X)) -> s(mark(X)) a__zeros() -> zeros() a__length(X) -> length(X) a__take(X1,X2) -> take(X1,X2) Unfolding Processor: loop length: 3 terms: a__length(cons(N,zeros())) s(a__length(mark(zeros()))) s(a__length(a__zeros())) context: s([]) substitution: N -> 0() Qed