YES(O(1), O(n^1)) 0.00/0.70 YES(O(1), O(n^1)) 0.00/0.71 0.00/0.71 0.00/0.71
0.00/0.71 0.00/0.710 CpxTRS0.00/0.71
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.71
↳2 CdtProblem0.00/0.71
↳3 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))0.00/0.71
↳4 CdtProblem0.00/0.71
↳5 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.71
↳6 BOUNDS(O(1), O(1))0.00/0.71
a(b(x)) → b(b(a(x)))
Tuples:
a(b(z0)) → b(b(a(z0)))
S tuples:
A(b(z0)) → c(A(z0))
K tuples:none
A(b(z0)) → c(A(z0))
a
A
c
We considered the (Usable) Rules:none
A(b(z0)) → c(A(z0))
The order we found is given by the following interpretation:
A(b(z0)) → c(A(z0))
POL(A(x1)) = [3]x1 0.00/0.71
POL(b(x1)) = [1] + x1 0.00/0.71
POL(c(x1)) = x1
Tuples:
a(b(z0)) → b(b(a(z0)))
S tuples:none
A(b(z0)) → c(A(z0))
Defined Rule Symbols:
A(b(z0)) → c(A(z0))
a
A
c