YES Problem: f(a(),f(a(),f(b(),f(a(),f(a(),f(b(),f(a(),x))))))) -> f(a(),f(b(),f(a(),f(a(),f(b(),f(a(),f(a(),f(a(),f(b(),x))))))))) Proof: Uncurry Processor: a1(a1(b1(a1(a1(b1(a1(x))))))) -> a1(b1(a1(a1(b1(a1(a1(a1(b1(x))))))))) f(a(),x1) -> a1(x1) f(b(),x1) -> b1(x1) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [b1](x0) = [0 0 1]x0 + [0] [0 0 0] [1], [1 0 0] [a1](x0) = [1 0 0]x0 [0 0 0] , [1 0 0] [1 1 1] [1] [f](x0, x1) = [0 0 0]x0 + [1 1 1]x1 + [0] [0 0 1] [0 1 0] [0], [0] [b] = [0] [1], [0] [a] = [0] [0] orientation: [1 0 0] [1 0 0] a1(a1(b1(a1(a1(b1(a1(x))))))) = [1 0 0]x >= [1 0 0]x = a1(b1(a1(a1(b1(a1(a1(a1(b1(x))))))))) [0 0 0] [0 0 0] [1 1 1] [1] [1 0 0] f(a(),x1) = [1 1 1]x1 + [0] >= [1 0 0]x1 = a1(x1) [0 1 0] [0] [0 0 0] [1 1 1] [1] [1 0 0] [0] f(b(),x1) = [1 1 1]x1 + [0] >= [0 0 1]x1 + [0] = b1(x1) [0 1 0] [1] [0 0 0] [1] problem: a1(a1(b1(a1(a1(b1(a1(x))))))) -> a1(b1(a1(a1(b1(a1(a1(a1(b1(x))))))))) Bounds Processor: bound: 1 enrichment: match automaton: final states: {1} transitions: f50() -> 2* a{1,0}(10) -> 1* a{1,0}(5) -> 6* a{1,0}(7) -> 8* a{1,0}(4) -> 5* a{1,0}(8) -> 9* a{1,0}(3) -> 4* b{1,0}(2) -> 3* b{1,0}(9) -> 10* b{1,0}(6) -> 7* a{1,1}(47) -> 48* a{1,1}(42) -> 43* a{1,1}(17) -> 18* a{1,1}(12) -> 13* a{1,1}(49) -> 50* a{1,1}(44) -> 45* a{1,1}(19) -> 20* a{1,1}(14) -> 15* a{1,1}(46) -> 47* a{1,1}(16) -> 17* a{1,1}(43) -> 44* a{1,1}(13) -> 14* b{1,1}(45) -> 46* b{1,1}(15) -> 16* b{1,1}(57) -> 58* b{1,1}(51) -> 52* b{1,1}(41) -> 42* b{1,1}(11) -> 12* b{1,1}(48) -> 49* b{1,1}(18) -> 19* 1 -> 44,5 5 -> 41* 8 -> 11* 19 -> 51* 20 -> 48,9 49 -> 57* 50 -> 45,6 52 -> 12* 58 -> 42* problem: Qed