YES Problem: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) Proof: DP Processor: DPs: f#(x,f(y,a())) -> f#(a(),a()) f#(x,f(y,a())) -> f#(f(a(),a()),y) f#(x,f(y,a())) -> f#(f(f(a(),a()),y),h(a())) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) EDG Processor: DPs: f#(x,f(y,a())) -> f#(a(),a()) f#(x,f(y,a())) -> f#(f(a(),a()),y) f#(x,f(y,a())) -> f#(f(f(a(),a()),y),h(a())) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) graph: f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) -> f#(x,f(y,a())) -> f#(a(),a()) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) -> f#(x,f(y,a())) -> f#(f(a(),a()),y) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) -> f#(x,f(y,a())) -> f#(f(f(a(),a()),y),h(a())) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) -> f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) f#(x,f(y,a())) -> f#(f(a(),a()),y) -> f#(x,f(y,a())) -> f#(a(),a()) f#(x,f(y,a())) -> f#(f(a(),a()),y) -> f#(x,f(y,a())) -> f#(f(a(),a()),y) f#(x,f(y,a())) -> f#(f(a(),a()),y) -> f#(x,f(y,a())) -> f#(f(f(a(),a()),y),h(a())) f#(x,f(y,a())) -> f#(f(a(),a()),y) -> f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) SCC Processor: #sccs: 1 #rules: 2 #arcs: 8/16 DPs: f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) f#(x,f(y,a())) -> f#(f(a(),a()),y) TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) Bounds Processor: bound: 2 enrichment: match automaton: final states: {6} transitions: f1(14,16) -> 15* f1(15,13) -> 16* f1(16,14) -> 15* f1(16,16) -> 5* f1(14,5) -> 15* f1(16,5) -> 5* f1(12,12) -> 14* a1() -> 12* h1(12) -> 13* f{#,1}(14,16) -> 6* f{#,1}(16,14) -> 6* f{#,1}(16,16) -> 6* f{#,1}(14,5) -> 6* f{#,1}(16,5) -> 6* f2(19,12) -> 20* f2(21,16) -> 15* f2(17,17) -> 19* f2(20,18) -> 21* f{#,0}(5,5) -> 6* a2() -> 17* f0(5,5) -> 5* h2(17) -> 18* a0() -> 5* f{#,2}(19,12) -> 6* f{#,2}(21,16) -> 6* h0(5) -> 5* problem: DPs: TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) Qed