MAYBE Problem: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Proof: DP Processor: DPs: active#(f(b(),X,c())) -> f#(X,c(),X) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) active#(c()) -> mark#(b()) mark#(f(X1,X2,X3)) -> mark#(X2) mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) mark#(b()) -> active#(b()) mark#(c()) -> active#(c()) f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,active(X3)) -> f#(X1,X2,X3) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) TDG Processor: DPs: active#(f(b(),X,c())) -> f#(X,c(),X) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) active#(c()) -> mark#(b()) mark#(f(X1,X2,X3)) -> mark#(X2) mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) mark#(b()) -> active#(b()) mark#(c()) -> active#(c()) f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,active(X3)) -> f#(X1,X2,X3) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) graph: mark#(f(X1,X2,X3)) -> mark#(X2) -> mark#(c()) -> active#(c()) mark#(f(X1,X2,X3)) -> mark#(X2) -> mark#(b()) -> active#(b()) mark#(f(X1,X2,X3)) -> mark#(X2) -> mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) mark#(f(X1,X2,X3)) -> mark#(X2) -> mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) mark#(f(X1,X2,X3)) -> mark#(X2) -> mark#(f(X1,X2,X3)) -> mark#(X2) mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) -> f#(X1,X2,active(X3)) -> f#(X1,X2,X3) mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) -> f#(X1,active(X2),X3) -> f#(X1,X2,X3) mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) -> f#(active(X1),X2,X3) -> f#(X1,X2,X3) mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) -> f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) -> f#(X1,mark(X2),X3) -> f#(X1,X2,X3) mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) -> f#(mark(X1),X2,X3) -> f#(X1,X2,X3) mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) -> active#(c()) -> mark#(b()) mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) -> active#(f(b(),X,c())) -> mark#(f(X,c(),X)) mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) -> active#(f(b(),X,c())) -> f#(X,c(),X) mark#(c()) -> active#(c()) -> active#(c()) -> mark#(b()) mark#(c()) -> active#(c()) -> active#(f(b(),X,c())) -> mark#(f(X,c(),X)) mark#(c()) -> active#(c()) -> active#(f(b(),X,c())) -> f#(X,c(),X) mark#(b()) -> active#(b()) -> active#(c()) -> mark#(b()) mark#(b()) -> active#(b()) -> active#(f(b(),X,c())) -> mark#(f(X,c(),X)) mark#(b()) -> active#(b()) -> active#(f(b(),X,c())) -> f#(X,c(),X) f#(mark(X1),X2,X3) -> f#(X1,X2,X3) -> f#(X1,X2,active(X3)) -> f#(X1,X2,X3) f#(mark(X1),X2,X3) -> f#(X1,X2,X3) -> f#(X1,active(X2),X3) -> f#(X1,X2,X3) f#(mark(X1),X2,X3) -> f#(X1,X2,X3) -> f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(mark(X1),X2,X3) -> f#(X1,X2,X3) -> f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) f#(mark(X1),X2,X3) -> f#(X1,X2,X3) -> f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(mark(X1),X2,X3) -> f#(X1,X2,X3) -> f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) -> f#(X1,X2,active(X3)) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) -> f#(X1,active(X2),X3) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) -> f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) -> f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) -> f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) -> f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) -> f#(X1,X2,active(X3)) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) -> f#(X1,active(X2),X3) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) -> f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) -> f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) -> f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) -> f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) -> f#(X1,X2,active(X3)) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) -> f#(X1,active(X2),X3) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) -> f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) -> f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) -> f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) -> f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) -> f#(X1,X2,active(X3)) -> f#(X1,X2,X3) f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) -> f#(X1,active(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) -> f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) -> f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) -> f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) -> f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,X2,active(X3)) -> f#(X1,X2,X3) -> f#(X1,X2,active(X3)) -> f#(X1,X2,X3) f#(X1,X2,active(X3)) -> f#(X1,X2,X3) -> f#(X1,active(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,active(X3)) -> f#(X1,X2,X3) -> f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,X2,active(X3)) -> f#(X1,X2,X3) -> f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) f#(X1,X2,active(X3)) -> f#(X1,X2,X3) -> f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,active(X3)) -> f#(X1,X2,X3) -> f#(mark(X1),X2,X3) -> f#(X1,X2,X3) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) -> mark#(c()) -> active#(c()) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) -> mark#(b()) -> active#(b()) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) -> mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) -> mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) -> mark#(f(X1,X2,X3)) -> mark#(X2) active#(f(b(),X,c())) -> f#(X,c(),X) -> f#(X1,X2,active(X3)) -> f#(X1,X2,X3) active#(f(b(),X,c())) -> f#(X,c(),X) -> f#(X1,active(X2),X3) -> f#(X1,X2,X3) active#(f(b(),X,c())) -> f#(X,c(),X) -> f#(active(X1),X2,X3) -> f#(X1,X2,X3) active#(f(b(),X,c())) -> f#(X,c(),X) -> f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) active#(f(b(),X,c())) -> f#(X,c(),X) -> f#(X1,mark(X2),X3) -> f#(X1,X2,X3) active#(f(b(),X,c())) -> f#(X,c(),X) -> f#(mark(X1),X2,X3) -> f#(X1,X2,X3) active#(c()) -> mark#(b()) -> mark#(c()) -> active#(c()) active#(c()) -> mark#(b()) -> mark#(b()) -> active#(b()) active#(c()) -> mark#(b()) -> mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) active#(c()) -> mark#(b()) -> mark#(f(X1,X2,X3)) -> f#(X1,mark(X2),X3) active#(c()) -> mark#(b()) -> mark#(f(X1,X2,X3)) -> mark#(X2) SCC Processor: #sccs: 2 #rules: 12 #arcs: 72/196 DPs: mark#(f(X1,X2,X3)) -> mark#(X2) mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) mark#(b()) -> active#(b()) active#(c()) -> mark#(b()) mark#(c()) -> active#(c()) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Matrix Interpretation Processor: dimension: 1 interpretation: [mark#](x0) = x0, [active#](x0) = x0, [mark](x0) = x0, [active](x0) = x0, [f](x0, x1, x2) = x1 + x2, [c] = 1, [b] = 0 orientation: mark#(f(X1,X2,X3)) = X2 + X3 >= X2 = mark#(X2) mark#(f(X1,X2,X3)) = X2 + X3 >= X2 + X3 = active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) = X + 1 >= X + 1 = mark#(f(X,c(),X)) mark#(b()) = 0 >= 0 = active#(b()) active#(c()) = 1 >= 0 = mark#(b()) mark#(c()) = 1 >= 1 = active#(c()) active(f(b(),X,c())) = X + 1 >= X + 1 = mark(f(X,c(),X)) active(c()) = 1 >= 0 = mark(b()) mark(f(X1,X2,X3)) = X2 + X3 >= X2 + X3 = active(f(X1,mark(X2),X3)) mark(b()) = 0 >= 0 = active(b()) mark(c()) = 1 >= 1 = active(c()) f(mark(X1),X2,X3) = X2 + X3 >= X2 + X3 = f(X1,X2,X3) f(X1,mark(X2),X3) = X2 + X3 >= X2 + X3 = f(X1,X2,X3) f(X1,X2,mark(X3)) = X2 + X3 >= X2 + X3 = f(X1,X2,X3) f(active(X1),X2,X3) = X2 + X3 >= X2 + X3 = f(X1,X2,X3) f(X1,active(X2),X3) = X2 + X3 >= X2 + X3 = f(X1,X2,X3) f(X1,X2,active(X3)) = X2 + X3 >= X2 + X3 = f(X1,X2,X3) problem: DPs: mark#(f(X1,X2,X3)) -> mark#(X2) mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) mark#(b()) -> active#(b()) mark#(c()) -> active#(c()) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Matrix Interpretation Processor: dimension: 1 interpretation: [mark#](x0) = x0, [active#](x0) = x0, [mark](x0) = x0, [active](x0) = x0, [f](x0, x1, x2) = x1 + x2 + 1, [c] = 1, [b] = 0 orientation: mark#(f(X1,X2,X3)) = X2 + X3 + 1 >= X2 = mark#(X2) mark#(f(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) = X + 2 >= X + 2 = mark#(f(X,c(),X)) mark#(b()) = 0 >= 0 = active#(b()) mark#(c()) = 1 >= 1 = active#(c()) active(f(b(),X,c())) = X + 2 >= X + 2 = mark(f(X,c(),X)) active(c()) = 1 >= 0 = mark(b()) mark(f(X1,X2,X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = active(f(X1,mark(X2),X3)) mark(b()) = 0 >= 0 = active(b()) mark(c()) = 1 >= 1 = active(c()) f(mark(X1),X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = f(X1,X2,X3) f(X1,mark(X2),X3) = X2 + X3 + 1 >= X2 + X3 + 1 = f(X1,X2,X3) f(X1,X2,mark(X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = f(X1,X2,X3) f(active(X1),X2,X3) = X2 + X3 + 1 >= X2 + X3 + 1 = f(X1,X2,X3) f(X1,active(X2),X3) = X2 + X3 + 1 >= X2 + X3 + 1 = f(X1,X2,X3) f(X1,X2,active(X3)) = X2 + X3 + 1 >= X2 + X3 + 1 = f(X1,X2,X3) problem: DPs: mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) mark#(b()) -> active#(b()) mark#(c()) -> active#(c()) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Matrix Interpretation Processor: dimension: 1 interpretation: [mark#](x0) = x0, [active#](x0) = 0, [mark](x0) = 0, [active](x0) = 0, [f](x0, x1, x2) = 0, [c] = 1, [b] = 0 orientation: mark#(f(X1,X2,X3)) = 0 >= 0 = active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) = 0 >= 0 = mark#(f(X,c(),X)) mark#(b()) = 0 >= 0 = active#(b()) mark#(c()) = 1 >= 0 = active#(c()) active(f(b(),X,c())) = 0 >= 0 = mark(f(X,c(),X)) active(c()) = 0 >= 0 = mark(b()) mark(f(X1,X2,X3)) = 0 >= 0 = active(f(X1,mark(X2),X3)) mark(b()) = 0 >= 0 = active(b()) mark(c()) = 0 >= 0 = active(c()) f(mark(X1),X2,X3) = 0 >= 0 = f(X1,X2,X3) f(X1,mark(X2),X3) = 0 >= 0 = f(X1,X2,X3) f(X1,X2,mark(X3)) = 0 >= 0 = f(X1,X2,X3) f(active(X1),X2,X3) = 0 >= 0 = f(X1,X2,X3) f(X1,active(X2),X3) = 0 >= 0 = f(X1,X2,X3) f(X1,X2,active(X3)) = 0 >= 0 = f(X1,X2,X3) problem: DPs: mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) mark#(b()) -> active#(b()) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Matrix Interpretation Processor: dimension: 1 interpretation: [mark#](x0) = x0, [active#](x0) = 0, [mark](x0) = 0, [active](x0) = 0, [f](x0, x1, x2) = 0, [c] = 0, [b] = 1 orientation: mark#(f(X1,X2,X3)) = 0 >= 0 = active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) = 0 >= 0 = mark#(f(X,c(),X)) mark#(b()) = 1 >= 0 = active#(b()) active(f(b(),X,c())) = 0 >= 0 = mark(f(X,c(),X)) active(c()) = 0 >= 0 = mark(b()) mark(f(X1,X2,X3)) = 0 >= 0 = active(f(X1,mark(X2),X3)) mark(b()) = 0 >= 0 = active(b()) mark(c()) = 0 >= 0 = active(c()) f(mark(X1),X2,X3) = 0 >= 0 = f(X1,X2,X3) f(X1,mark(X2),X3) = 0 >= 0 = f(X1,X2,X3) f(X1,X2,mark(X3)) = 0 >= 0 = f(X1,X2,X3) f(active(X1),X2,X3) = 0 >= 0 = f(X1,X2,X3) f(X1,active(X2),X3) = 0 >= 0 = f(X1,X2,X3) f(X1,X2,active(X3)) = 0 >= 0 = f(X1,X2,X3) problem: DPs: mark#(f(X1,X2,X3)) -> active#(f(X1,mark(X2),X3)) active#(f(b(),X,c())) -> mark#(f(X,c(),X)) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Open DPs: f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,mark(X3)) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) f#(X1,X2,active(X3)) -> f#(X1,X2,X3) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Matrix Interpretation Processor: dimension: 1 interpretation: [f#](x0, x1, x2) = x2, [mark](x0) = x0 + 1, [active](x0) = x0 + 1, [f](x0, x1, x2) = 0, [c] = 0, [b] = 0 orientation: f#(mark(X1),X2,X3) = X3 >= X3 = f#(X1,X2,X3) f#(X1,mark(X2),X3) = X3 >= X3 = f#(X1,X2,X3) f#(X1,X2,mark(X3)) = X3 + 1 >= X3 = f#(X1,X2,X3) f#(active(X1),X2,X3) = X3 >= X3 = f#(X1,X2,X3) f#(X1,active(X2),X3) = X3 >= X3 = f#(X1,X2,X3) f#(X1,X2,active(X3)) = X3 + 1 >= X3 = f#(X1,X2,X3) active(f(b(),X,c())) = 1 >= 1 = mark(f(X,c(),X)) active(c()) = 1 >= 1 = mark(b()) mark(f(X1,X2,X3)) = 1 >= 1 = active(f(X1,mark(X2),X3)) mark(b()) = 1 >= 1 = active(b()) mark(c()) = 1 >= 1 = active(c()) f(mark(X1),X2,X3) = 0 >= 0 = f(X1,X2,X3) f(X1,mark(X2),X3) = 0 >= 0 = f(X1,X2,X3) f(X1,X2,mark(X3)) = 0 >= 0 = f(X1,X2,X3) f(active(X1),X2,X3) = 0 >= 0 = f(X1,X2,X3) f(X1,active(X2),X3) = 0 >= 0 = f(X1,X2,X3) f(X1,X2,active(X3)) = 0 >= 0 = f(X1,X2,X3) problem: DPs: f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,mark(X2),X3) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) f#(X1,active(X2),X3) -> f#(X1,X2,X3) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Matrix Interpretation Processor: dimension: 1 interpretation: [f#](x0, x1, x2) = x1, [mark](x0) = x0 + 1, [active](x0) = x0 + 1, [f](x0, x1, x2) = 1, [c] = 0, [b] = 0 orientation: f#(mark(X1),X2,X3) = X2 >= X2 = f#(X1,X2,X3) f#(X1,mark(X2),X3) = X2 + 1 >= X2 = f#(X1,X2,X3) f#(active(X1),X2,X3) = X2 >= X2 = f#(X1,X2,X3) f#(X1,active(X2),X3) = X2 + 1 >= X2 = f#(X1,X2,X3) active(f(b(),X,c())) = 2 >= 2 = mark(f(X,c(),X)) active(c()) = 1 >= 1 = mark(b()) mark(f(X1,X2,X3)) = 2 >= 2 = active(f(X1,mark(X2),X3)) mark(b()) = 1 >= 1 = active(b()) mark(c()) = 1 >= 1 = active(c()) f(mark(X1),X2,X3) = 1 >= 1 = f(X1,X2,X3) f(X1,mark(X2),X3) = 1 >= 1 = f(X1,X2,X3) f(X1,X2,mark(X3)) = 1 >= 1 = f(X1,X2,X3) f(active(X1),X2,X3) = 1 >= 1 = f(X1,X2,X3) f(X1,active(X2),X3) = 1 >= 1 = f(X1,X2,X3) f(X1,X2,active(X3)) = 1 >= 1 = f(X1,X2,X3) problem: DPs: f#(mark(X1),X2,X3) -> f#(X1,X2,X3) f#(active(X1),X2,X3) -> f#(X1,X2,X3) TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Matrix Interpretation Processor: dimension: 1 interpretation: [f#](x0, x1, x2) = x0 + 1, [mark](x0) = x0 + 1, [active](x0) = x0 + 1, [f](x0, x1, x2) = 0, [c] = 0, [b] = 0 orientation: f#(mark(X1),X2,X3) = X1 + 2 >= X1 + 1 = f#(X1,X2,X3) f#(active(X1),X2,X3) = X1 + 2 >= X1 + 1 = f#(X1,X2,X3) active(f(b(),X,c())) = 1 >= 1 = mark(f(X,c(),X)) active(c()) = 1 >= 1 = mark(b()) mark(f(X1,X2,X3)) = 1 >= 1 = active(f(X1,mark(X2),X3)) mark(b()) = 1 >= 1 = active(b()) mark(c()) = 1 >= 1 = active(c()) f(mark(X1),X2,X3) = 0 >= 0 = f(X1,X2,X3) f(X1,mark(X2),X3) = 0 >= 0 = f(X1,X2,X3) f(X1,X2,mark(X3)) = 0 >= 0 = f(X1,X2,X3) f(active(X1),X2,X3) = 0 >= 0 = f(X1,X2,X3) f(X1,active(X2),X3) = 0 >= 0 = f(X1,X2,X3) f(X1,X2,active(X3)) = 0 >= 0 = f(X1,X2,X3) problem: DPs: TRS: active(f(b(),X,c())) -> mark(f(X,c(),X)) active(c()) -> mark(b()) mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) mark(b()) -> active(b()) mark(c()) -> active(c()) f(mark(X1),X2,X3) -> f(X1,X2,X3) f(X1,mark(X2),X3) -> f(X1,X2,X3) f(X1,X2,mark(X3)) -> f(X1,X2,X3) f(active(X1),X2,X3) -> f(X1,X2,X3) f(X1,active(X2),X3) -> f(X1,X2,X3) f(X1,X2,active(X3)) -> f(X1,X2,X3) Qed