Problem: b(b(0(),y),x) -> y c(c(c(y))) -> c(c(a(a(c(b(0(),y)),0()),0()))) a(y,0()) -> b(y,0()) Proof: Bounds Processor: bound: 1 enrichment: match automaton: final states: {4,3,2} transitions: b1(1,5) -> 4* 01() -> 5* b0(1,1) -> 2* 00() -> 1* c0(1) -> 3* a0(1,1) -> 4* problem: Qed