YES Problem: a__f(a(),X,X) -> a__f(X,a__b(),b()) a__b() -> a() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) mark(b()) -> a__b() mark(a()) -> a() a__f(X1,X2,X3) -> f(X1,X2,X3) a__b() -> b() Proof: DP Processor: DPs: a__f#(a(),X,X) -> a__b#() a__f#(a(),X,X) -> a__f#(X,a__b(),b()) mark#(f(X1,X2,X3)) -> mark#(X2) mark#(f(X1,X2,X3)) -> a__f#(X1,mark(X2),X3) mark#(b()) -> a__b#() TRS: a__f(a(),X,X) -> a__f(X,a__b(),b()) a__b() -> a() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) mark(b()) -> a__b() mark(a()) -> a() a__f(X1,X2,X3) -> f(X1,X2,X3) a__b() -> b() EDG Processor: DPs: a__f#(a(),X,X) -> a__b#() a__f#(a(),X,X) -> a__f#(X,a__b(),b()) mark#(f(X1,X2,X3)) -> mark#(X2) mark#(f(X1,X2,X3)) -> a__f#(X1,mark(X2),X3) mark#(b()) -> a__b#() TRS: a__f(a(),X,X) -> a__f(X,a__b(),b()) a__b() -> a() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) mark(b()) -> a__b() mark(a()) -> a() a__f(X1,X2,X3) -> f(X1,X2,X3) a__b() -> b() graph: mark#(f(X1,X2,X3)) -> mark#(X2) -> mark#(f(X1,X2,X3)) -> mark#(X2) mark#(f(X1,X2,X3)) -> mark#(X2) -> mark#(f(X1,X2,X3)) -> a__f#(X1,mark(X2),X3) mark#(f(X1,X2,X3)) -> mark#(X2) -> mark#(b()) -> a__b#() mark#(f(X1,X2,X3)) -> a__f#(X1,mark(X2),X3) -> a__f#(a(),X,X) -> a__b#() mark#(f(X1,X2,X3)) -> a__f#(X1,mark(X2),X3) -> a__f#(a(),X,X) -> a__f#(X,a__b(),b()) a__f#(a(),X,X) -> a__f#(X,a__b(),b()) -> a__f#(a(),X,X) -> a__b#() a__f#(a(),X,X) -> a__f#(X,a__b(),b()) -> a__f#(a(),X,X) -> a__f#(X,a__b(),b()) SCC Processor: #sccs: 2 #rules: 2 #arcs: 7/25 DPs: mark#(f(X1,X2,X3)) -> mark#(X2) TRS: a__f(a(),X,X) -> a__f(X,a__b(),b()) a__b() -> a() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) mark(b()) -> a__b() mark(a()) -> a() a__f(X1,X2,X3) -> f(X1,X2,X3) a__b() -> b() Matrix Interpretation Processor: dimension: 1 interpretation: [mark#](x0) = x0, [mark](x0) = x0, [f](x0, x1, x2) = x0 + x1 + 1, [b] = 0, [a__b] = 0, [a__f](x0, x1, x2) = x0 + x1 + 1, [a] = 0 orientation: mark#(f(X1,X2,X3)) = X1 + X2 + 1 >= X2 = mark#(X2) a__f(a(),X,X) = X + 1 >= X + 1 = a__f(X,a__b(),b()) a__b() = 0 >= 0 = a() mark(f(X1,X2,X3)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__f(X1,mark(X2),X3) mark(b()) = 0 >= 0 = a__b() mark(a()) = 0 >= 0 = a() a__f(X1,X2,X3) = X1 + X2 + 1 >= X1 + X2 + 1 = f(X1,X2,X3) a__b() = 0 >= 0 = b() problem: DPs: TRS: a__f(a(),X,X) -> a__f(X,a__b(),b()) a__b() -> a() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) mark(b()) -> a__b() mark(a()) -> a() a__f(X1,X2,X3) -> f(X1,X2,X3) a__b() -> b() Qed DPs: a__f#(a(),X,X) -> a__f#(X,a__b(),b()) TRS: a__f(a(),X,X) -> a__f(X,a__b(),b()) a__b() -> a() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) mark(b()) -> a__b() mark(a()) -> a() a__f(X1,X2,X3) -> f(X1,X2,X3) a__b() -> b() Matrix Interpretation Processor: dimension: 1 interpretation: [a__f#](x0, x1, x2) = x0 + x2, [mark](x0) = 1, [f](x0, x1, x2) = 1, [b] = 0, [a__b] = 1, [a__f](x0, x1, x2) = 1, [a] = 1 orientation: a__f#(a(),X,X) = X + 1 >= X = a__f#(X,a__b(),b()) a__f(a(),X,X) = 1 >= 1 = a__f(X,a__b(),b()) a__b() = 1 >= 1 = a() mark(f(X1,X2,X3)) = 1 >= 1 = a__f(X1,mark(X2),X3) mark(b()) = 1 >= 1 = a__b() mark(a()) = 1 >= 1 = a() a__f(X1,X2,X3) = 1 >= 1 = f(X1,X2,X3) a__b() = 1 >= 0 = b() problem: DPs: TRS: a__f(a(),X,X) -> a__f(X,a__b(),b()) a__b() -> a() mark(f(X1,X2,X3)) -> a__f(X1,mark(X2),X3) mark(b()) -> a__b() mark(a()) -> a() a__f(X1,X2,X3) -> f(X1,X2,X3) a__b() -> b() Qed