0.00/0.53
0.00/0.53
(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
first(0, X) → nil
0.00/0.53
first(s(X), cons(Y)) → cons(Y)
0.00/0.53
from(X) → cons(X)
Rewrite Strategy: INNERMOST
0.00/0.53
0.00/0.53
(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted CpxTRS to CDT
0.00/0.53
0.00/0.53
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
first(0, z0) → nil
0.00/0.53
first(s(z0), cons(z1)) → cons(z1)
0.00/0.53
from(z0) → cons(z0)
Tuples:none
S tuples:none
K tuples:none
Defined Rule Symbols:
first, from
Defined Pair Symbols:none
Compound Symbols:none
0.00/0.53
0.00/0.53
(3) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)
The set S is empty
0.00/0.53
0.00/0.53
(4) BOUNDS(O(1), O(1))
0.00/0.53