YES(?,O(n^1))

Problem:
 1(1(x1)) -> 4(3(x1))
 1(2(x1)) -> 2(1(x1))
 2(2(x1)) -> 1(1(1(x1)))
 3(3(x1)) -> 5(6(x1))
 3(4(x1)) -> 1(1(x1))
 4(4(x1)) -> 3(x1)
 5(5(x1)) -> 6(2(x1))
 5(6(x1)) -> 1(2(x1))
 6(6(x1)) -> 2(1(x1))

Proof:
 Bounds Processor:
  bound: 0
  enrichment: match
  automaton:
   final states: {7,6,5,4,3,2}
   transitions:
    10(1) -> 2*
    40(1) -> 5*
    30(1) -> 4*
    20(1) -> 3*
    50(1) -> 6*
    60(1) -> 7*
    f120() -> 1*
  problem:
   
  Qed