YES(O(1), O(n^1)) 0.00/0.69 YES(O(1), O(n^1)) 0.00/0.70 0.00/0.70 0.00/0.70
0.00/0.70 0.00/0.700 CpxTRS0.00/0.70
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID))0.00/0.70
↳2 CdtProblem0.00/0.70
↳3 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))0.00/0.70
↳4 CdtProblem0.00/0.70
↳5 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))0.00/0.70
↳6 CdtProblem0.00/0.70
↳7 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.70
↳8 BOUNDS(O(1), O(1))0.00/0.70
dbl(S(0), S(0)) → S(S(S(S(0)))) 0.00/0.70
unsafe(S(x)) → dbl(unsafe(x), 0) 0.00/0.70
unsafe(0) → 0 0.00/0.70
dbl(0, y) → y
Tuples:
dbl(S(0), S(0)) → S(S(S(S(0)))) 0.00/0.70
dbl(0, z0) → z0 0.00/0.70
unsafe(S(z0)) → dbl(unsafe(z0), 0) 0.00/0.70
unsafe(0) → 0
S tuples:
UNSAFE(S(z0)) → c2(DBL(unsafe(z0), 0), UNSAFE(z0))
K tuples:none
UNSAFE(S(z0)) → c2(DBL(unsafe(z0), 0), UNSAFE(z0))
dbl, unsafe
UNSAFE
c2
Tuples:
dbl(S(0), S(0)) → S(S(S(S(0)))) 0.00/0.70
dbl(0, z0) → z0 0.00/0.70
unsafe(S(z0)) → dbl(unsafe(z0), 0) 0.00/0.70
unsafe(0) → 0
S tuples:
UNSAFE(S(z0)) → c2(UNSAFE(z0))
K tuples:none
UNSAFE(S(z0)) → c2(UNSAFE(z0))
dbl, unsafe
UNSAFE
c2
We considered the (Usable) Rules:none
UNSAFE(S(z0)) → c2(UNSAFE(z0))
The order we found is given by the following interpretation:
UNSAFE(S(z0)) → c2(UNSAFE(z0))
POL(S(x1)) = [1] + x1 0.00/0.70
POL(UNSAFE(x1)) = [3]x1 0.00/0.70
POL(c2(x1)) = x1
Tuples:
dbl(S(0), S(0)) → S(S(S(S(0)))) 0.00/0.70
dbl(0, z0) → z0 0.00/0.70
unsafe(S(z0)) → dbl(unsafe(z0), 0) 0.00/0.70
unsafe(0) → 0
S tuples:none
UNSAFE(S(z0)) → c2(UNSAFE(z0))
Defined Rule Symbols:
UNSAFE(S(z0)) → c2(UNSAFE(z0))
dbl, unsafe
UNSAFE
c2