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 CdtLeafRemovalProof (ComplexityIfPolyImplication)0.00/0.72
↳4 CdtProblem0.00/0.72
↳5 CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))))0.00/0.72
↳6 CdtProblem0.00/0.72
↳7 SIsEmptyProof (BOTH BOUNDS(ID, ID))0.00/0.72
↳8 BOUNDS(O(1), O(1))0.00/0.72
rev(ls) → r1(ls, empty) 0.00/0.72
r1(empty, a) → a 0.00/0.72
r1(cons(x, k), a) → r1(k, cons(x, a))
Tuples:
rev(z0) → r1(z0, empty) 0.00/0.72
r1(empty, z0) → z0 0.00/0.72
r1(cons(z0, z1), z2) → r1(z1, cons(z0, z2))
S tuples:
REV(z0) → c(R1(z0, empty)) 0.00/0.72
R1(cons(z0, z1), z2) → c2(R1(z1, cons(z0, z2)))
K tuples:none
REV(z0) → c(R1(z0, empty)) 0.00/0.72
R1(cons(z0, z1), z2) → c2(R1(z1, cons(z0, z2)))
rev, r1
REV, R1
c, c2
REV(z0) → c(R1(z0, empty))
Tuples:
rev(z0) → r1(z0, empty) 0.00/0.72
r1(empty, z0) → z0 0.00/0.72
r1(cons(z0, z1), z2) → r1(z1, cons(z0, z2))
S tuples:
R1(cons(z0, z1), z2) → c2(R1(z1, cons(z0, z2)))
K tuples:none
R1(cons(z0, z1), z2) → c2(R1(z1, cons(z0, z2)))
rev, r1
R1
c2
We considered the (Usable) Rules:none
R1(cons(z0, z1), z2) → c2(R1(z1, cons(z0, z2)))
The order we found is given by the following interpretation:
R1(cons(z0, z1), z2) → c2(R1(z1, cons(z0, z2)))
POL(R1(x1, x2)) = [4]x1 0.00/0.72
POL(c2(x1)) = x1 0.00/0.72
POL(cons(x1, x2)) = [4] + x1 + x2
Tuples:
rev(z0) → r1(z0, empty) 0.00/0.72
r1(empty, z0) → z0 0.00/0.72
r1(cons(z0, z1), z2) → r1(z1, cons(z0, z2))
S tuples:none
R1(cons(z0, z1), z2) → c2(R1(z1, cons(z0, z2)))
Defined Rule Symbols:
R1(cons(z0, z1), z2) → c2(R1(z1, cons(z0, z2)))
rev, r1
R1
c2