YES(O(1), O(n^1)) 0.00/0.71 YES(O(1), O(n^1)) 0.00/0.72 0.00/0.72 0.00/0.72
0.00/0.72 0.00/0.720 CpxTRS0.00/0.72
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.72
↳2 CdtProblem0.00/0.72
↳3 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))0.00/0.72
↳4 CdtProblem0.00/0.72
↳5 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.72
↳6 BOUNDS(O(1), O(1))0.00/0.72
f(x, g(x)) → x 0.00/0.72
f(x, h(y)) → f(h(x), y)
Tuples:
f(z0, g(z0)) → z0 0.00/0.72
f(z0, h(z1)) → f(h(z0), z1)
S tuples:
F(z0, h(z1)) → c1(F(h(z0), z1))
K tuples:none
F(z0, h(z1)) → c1(F(h(z0), z1))
f
F
c1
We considered the (Usable) Rules:none
F(z0, h(z1)) → c1(F(h(z0), z1))
The order we found is given by the following interpretation:
F(z0, h(z1)) → c1(F(h(z0), z1))
POL(F(x1, x2)) = x2 0.00/0.72
POL(c1(x1)) = x1 0.00/0.72
POL(h(x1)) = [1] + x1
Tuples:
f(z0, g(z0)) → z0 0.00/0.72
f(z0, h(z1)) → f(h(z0), z1)
S tuples:none
F(z0, h(z1)) → c1(F(h(z0), z1))
Defined Rule Symbols:
F(z0, h(z1)) → c1(F(h(z0), z1))
f
F
c1