YES

Problem:
 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(x1))))))))))
 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(x1)))))))))))))

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {12,1}
   transitions:
    20(2) -> 3*
    20(5) -> 6*
    20(17) -> 18*
    20(10) -> 11*
    20(8) -> 13*
    11(31) -> 32*
    11(34) -> 35*
    11(60) -> 61*
    11(57) -> 58*
    11(39) -> 40*
    11(62) -> 63*
    11(37) -> 38*
    11(63) -> 64*
    11(36) -> 37*
    11(65) -> 66*
    00(4) -> 5*
    00(7) -> 8*
    00(14) -> 15*
    10(13) -> 14*
    10(3) -> 4*
    10(11) -> 1*
    10(6) -> 7*
    10(16) -> 17*
    10(18) -> 12*
    10(15) -> 16*
    10(8) -> 9*
    10(9) -> 10*
    f30() -> 2*
    21(67) -> 68*
    21(71) -> 72*
    21(64) -> 65*
    21(56) -> 57*
    21(38) -> 39*
    21(59) -> 60*
    21(30) -> 31*
    21(41) -> 42*
    21(33) -> 34*
    01(61) -> 62*
    01(58) -> 59*
    01(32) -> 33*
    01(35) -> 36*
    68 -> 60*
    42 -> 34*
    12 -> 5*
    66 -> 15*
    11 -> 30*
    72 -> 31*
    36 -> 41*
    40 -> 8*
    1 -> 5*
    62 -> 67*
    39 -> 56*
    18 -> 71*
  problem:
   
  Qed