YES(?,O(n^1))

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

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