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
f(x, a) → x 0.00/0.71
f(x, g(y)) → f(g(x), y)
Tuples:
f(z0, a) → z0 0.00/0.71
f(z0, g(z1)) → f(g(z0), z1)
S tuples:
F(z0, g(z1)) → c1(F(g(z0), z1))
K tuples:none
F(z0, g(z1)) → c1(F(g(z0), z1))
f
F
c1
We considered the (Usable) Rules:none
F(z0, g(z1)) → c1(F(g(z0), z1))
The order we found is given by the following interpretation:
F(z0, g(z1)) → c1(F(g(z0), z1))
POL(F(x1, x2)) = x2 0.00/0.71
POL(c1(x1)) = x1 0.00/0.71
POL(g(x1)) = [1] + x1
Tuples:
f(z0, a) → z0 0.00/0.71
f(z0, g(z1)) → f(g(z0), z1)
S tuples:none
F(z0, g(z1)) → c1(F(g(z0), z1))
Defined Rule Symbols:
F(z0, g(z1)) → c1(F(g(z0), z1))
f
F
c1