YES Problem: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) Proof: DP Processor: DPs: f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(f(a(),f(a(),f(a(),x))),b()) f#(f(f(a(),x),b()),b()) -> f#(x,b()) f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) f#(f(f(a(),x),b()),b()) -> f#(a(),f(f(x,b()),b())) f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) TRS: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) EDG Processor: DPs: f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(f(a(),f(a(),f(a(),x))),b()) f#(f(f(a(),x),b()),b()) -> f#(x,b()) f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) f#(f(f(a(),x),b()),b()) -> f#(a(),f(f(x,b()),b())) f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) TRS: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) graph: f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) -> f#(f(f(a(),x),b()),b()) -> f#(x,b()) f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) -> f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) -> f#(f(f(a(),x),b()),b()) -> f#(a(),f(f(x,b()),b())) f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) -> f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) -> f#(f(f(a(),x),b()),b()) -> f#(x,b()) f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) -> f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) -> f#(f(f(a(),x),b()),b()) -> f#(a(),f(f(x,b()),b())) f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) -> f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) f#(f(f(a(),x),b()),b()) -> f#(x,b()) -> f#(f(f(a(),x),b()),b()) -> f#(x,b()) f#(f(f(a(),x),b()),b()) -> f#(x,b()) -> f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) f#(f(f(a(),x),b()),b()) -> f#(x,b()) -> f#(f(f(a(),x),b()),b()) -> f#(a(),f(f(x,b()),b())) f#(f(f(a(),x),b()),b()) -> f#(x,b()) -> f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(f(a(),f(a(),f(a(),x))),b()) -> f#(f(f(a(),x),b()),b()) -> f#(x,b()) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(f(a(),f(a(),f(a(),x))),b()) -> f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(f(a(),f(a(),f(a(),x))),b()) -> f#(f(f(a(),x),b()),b()) -> f#(a(),f(f(x,b()),b())) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(f(a(),f(a(),f(a(),x))),b()) -> f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(f(a(),f(a(),f(a(),x))),b()) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(f(a(),f(a(),f(a(),x))),b()) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) -> f#(a(),f(a(),f(a(),f(x,b())))) -> f#(f(a(),f(a(),f(a(),x))),b()) SCC Processor: #sccs: 2 #rules: 6 #arcs: 28/64 DPs: f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),x)) f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),x) TRS: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) Semantic Labeling Processor: dimension: 1 usable rules: interpretation: [b] = 0, [a] = 1, [f](x0, x1) = x0 + x1 labeled: f# usable (for model): f# a f b argument filtering: pi(a) = [] pi(b) = [] pi(f) = 1 pi(f#) = [] precedence: f# ~ f ~ b ~ a problem: DPs: f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) TRS: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) Restore Modifier: DPs: f#(a(),f(a(),f(a(),f(x,b())))) -> f#(a(),f(a(),f(a(),x))) TRS: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) Bounds Processor: bound: 1 enrichment: match-dp automaton: final states: {1} transitions: f{#,1}(8,10) -> 1* f230() -> 2* a1() -> 8* f1(2,14) -> 15* f1(3,14) -> 15* f1(14,14) -> 15* f1(8,4) -> 9* f1(10,14) -> 15* f1(15,14) -> 15,10,9 f1(8,2) -> 9* f1(8,9) -> 10* f1(8,3) -> 9* f1(9,14) -> 15* f1(8,10) -> 15* f1(4,14) -> 15* f{#,0}(3,5) -> 1* b0() -> 4* a0() -> 3* b1() -> 14* f0(3,5) -> 3* f0(3,4) -> 3,5 f0(3,2) -> 4* f0(4,4) -> 3* f0(3,3) -> 4* f0(5,4) -> 3* f0(2,4) -> 3* 5 -> 4* problem: DPs: TRS: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) Qed DPs: f#(f(f(a(),x),b()),b()) -> f#(f(a(),f(f(x,b()),b())),b()) f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) f#(f(f(a(),x),b()),b()) -> f#(x,b()) TRS: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) Bounds Processor: bound: 0 enrichment: match-dp automaton: final states: {1} transitions: f{#,0}(7,2) -> 1* f370() -> 3* b0() -> 2* a0() -> 6* f0(6,5) -> 7* f0(7,2) -> 5* f0(3,2) -> 4* f0(2,2) -> 4* f0(4,2) -> 5* 5 -> 4* problem: DPs: f#(f(f(a(),x),b()),b()) -> f#(f(x,b()),b()) f#(f(f(a(),x),b()),b()) -> f#(x,b()) TRS: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) Semantic Labeling Processor: dimension: 1 usable rules: interpretation: [b] = 0, [a] = 1, [f](x0, x1) = x0 + x1 labeled: f# usable (for model): f# f a b argument filtering: pi(a) = [] pi(b) = [] pi(f) = 1 pi(f#) = [] precedence: f# ~ f ~ b ~ a problem: DPs: TRS: f(a(),f(a(),f(a(),f(x,b())))) -> f(f(a(),f(a(),f(a(),x))),b()) f(f(f(a(),x),b()),b()) -> f(f(a(),f(f(x,b()),b())),b()) Qed