YES(?,O(n^1))

Problem:
 f(x,y) -> h(x,y)
 f(x,y) -> h(y,x)
 h(x,x) -> x

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {8,5,4,3,2}
   transitions:
    f0(8,1) -> 2*
    f0(4,4) -> 2*
    f0(4,8) -> 2*
    f0(1,4) -> 2*
    f0(1,8) -> 2*
    f0(8,4) -> 2*
    f0(8,8) -> 2*
    f0(4,1) -> 2*
    f0(1,1) -> 2*
    h0(8,1) -> 3*
    h0(4,4) -> 3*
    h0(4,8) -> 3*
    h0(1,4) -> 3*
    h0(1,8) -> 3*
    h0(8,4) -> 3*
    h0(8,8) -> 3*
    h0(4,1) -> 3*
    h0(1,1) -> 3*
    f40() -> 4,8*,3,1
    h1(8,1) -> 2,3,5*
    h1(4,4) -> 2,3,5*
    h1(4,8) -> 2,3,5*
    h1(1,4) -> 2,3,5*
    h1(1,8) -> 2,3,5*
    h1(8,4) -> 2,3,5*
    h1(8,8) -> 2,3,5*
    h1(4,1) -> 2,3,5*
    h1(1,1) -> 5*,3,2
    1 -> 5,3
    4 -> 5,3
    8 -> 5,3
  problem:
   
  Qed