Problem: f(a()) -> f(g(b(),b())) a() -> g(c(),c()) c() -> d() d() -> b() b() -> d() Proof: Uncurry Processor: f6(f(),a()) -> f6(f(),f6(f6(g(),b()),b())) a() -> f6(f6(g(),c()),c()) c() -> d() d() -> b() b() -> d() Church Rosser Transformation Processor: strict: weak: critical peaks: 0 Qed