YES(?,O(n^1))

Problem:
 div(X,e()) -> i(X)
 i(div(X,Y)) -> div(Y,X)
 div(div(X,Y),Z) -> div(Y,div(i(X),Z))

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {3,2}
   transitions:
    i1(1) -> 2*
    div0(1,1) -> 2*
    e0() -> 1*
    i0(1) -> 3*
  problem:
   
  Qed