YES(?,O(n^1))

Problem:
 +(x,+(y,z)) -> +(+(x,y),z)
 +(*(x,y),+(x,z)) -> *(x,+(y,z))
 +(*(x,y),+(*(x,z),u)) -> +(*(x,+(y,z)),u)

Proof:
 Bounds Processor:
  bound: 0
  enrichment: match
  automaton:
   final states: {2}
   transitions:
    +0(1,1) -> 2*
    *0(1,1) -> 1*
  problem:
   
  Qed