(0) Obligation:
The Runtime Complexity (innermost) of the given
CpxTRS could be proven to be
BOUNDS(1, n^1).
The TRS R consists of the following rules:
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
from(X) → cons(X, n__from(n__s(X)))
first(X1, X2) → n__first(X1, X2)
from(X) → n__from(X)
s(X) → n__s(X)
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(X) → X
Rewrite Strategy: INNERMOST
(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)
Converted Cpx (relative) TRS to CDT
(2) Obligation:
Complexity Dependency Tuples Problem
Rules:
first(0, z0) → nil
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2)))
first(z0, z1) → n__first(z0, z1)
from(z0) → cons(z0, n__from(n__s(z0)))
from(z0) → n__from(z0)
s(z0) → n__s(z0)
activate(n__first(z0, z1)) → first(activate(z0), activate(z1))
activate(n__from(z0)) → from(activate(z0))
activate(n__s(z0)) → s(activate(z0))
activate(z0) → z0
Tuples:
FIRST(0, z0) → c
FIRST(s(z0), cons(z1, z2)) → c1(ACTIVATE(z2))
FIRST(z0, z1) → c2
FROM(z0) → c3
FROM(z0) → c4
S(z0) → c5
ACTIVATE(n__first(z0, z1)) → c6(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(FROM(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(S(activate(z0)), ACTIVATE(z0))
ACTIVATE(z0) → c9
S tuples:
FIRST(0, z0) → c
FIRST(s(z0), cons(z1, z2)) → c1(ACTIVATE(z2))
FIRST(z0, z1) → c2
FROM(z0) → c3
FROM(z0) → c4
S(z0) → c5
ACTIVATE(n__first(z0, z1)) → c6(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(FROM(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(S(activate(z0)), ACTIVATE(z0))
ACTIVATE(z0) → c9
K tuples:none
Defined Rule Symbols:
first, from, s, activate
Defined Pair Symbols:
FIRST, FROM, S, ACTIVATE
Compound Symbols:
c, c1, c2, c3, c4, c5, c6, c7, c8, c9
(3) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)
Removed 1 leading nodes:
FIRST(s(z0), cons(z1, z2)) → c1(ACTIVATE(z2))
Removed 6 trailing nodes:
FROM(z0) → c3
FIRST(0, z0) → c
FROM(z0) → c4
ACTIVATE(z0) → c9
S(z0) → c5
FIRST(z0, z1) → c2
(4) Obligation:
Complexity Dependency Tuples Problem
Rules:
first(0, z0) → nil
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2)))
first(z0, z1) → n__first(z0, z1)
from(z0) → cons(z0, n__from(n__s(z0)))
from(z0) → n__from(z0)
s(z0) → n__s(z0)
activate(n__first(z0, z1)) → first(activate(z0), activate(z1))
activate(n__from(z0)) → from(activate(z0))
activate(n__s(z0)) → s(activate(z0))
activate(z0) → z0
Tuples:
ACTIVATE(n__first(z0, z1)) → c6(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(FROM(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(S(activate(z0)), ACTIVATE(z0))
S tuples:
ACTIVATE(n__first(z0, z1)) → c6(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(FROM(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(S(activate(z0)), ACTIVATE(z0))
K tuples:none
Defined Rule Symbols:
first, from, s, activate
Defined Pair Symbols:
ACTIVATE
Compound Symbols:
c6, c7, c8
(5) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID) transformation)
Removed 3 trailing tuple parts
(6) Obligation:
Complexity Dependency Tuples Problem
Rules:
first(0, z0) → nil
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2)))
first(z0, z1) → n__first(z0, z1)
from(z0) → cons(z0, n__from(n__s(z0)))
from(z0) → n__from(z0)
s(z0) → n__s(z0)
activate(n__first(z0, z1)) → first(activate(z0), activate(z1))
activate(n__from(z0)) → from(activate(z0))
activate(n__s(z0)) → s(activate(z0))
activate(z0) → z0
Tuples:
ACTIVATE(n__first(z0, z1)) → c6(ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
S tuples:
ACTIVATE(n__first(z0, z1)) → c6(ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
K tuples:none
Defined Rule Symbols:
first, from, s, activate
Defined Pair Symbols:
ACTIVATE
Compound Symbols:
c6, c7, c8
(7) CdtUsableRulesProof (EQUIVALENT transformation)
The following rules are not usable and were removed:
first(0, z0) → nil
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2)))
first(z0, z1) → n__first(z0, z1)
from(z0) → cons(z0, n__from(n__s(z0)))
from(z0) → n__from(z0)
s(z0) → n__s(z0)
activate(n__first(z0, z1)) → first(activate(z0), activate(z1))
activate(n__from(z0)) → from(activate(z0))
activate(n__s(z0)) → s(activate(z0))
activate(z0) → z0
(8) Obligation:
Complexity Dependency Tuples Problem
Rules:none
Tuples:
ACTIVATE(n__first(z0, z1)) → c6(ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
S tuples:
ACTIVATE(n__first(z0, z1)) → c6(ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
K tuples:none
Defined Rule Symbols:none
Defined Pair Symbols:
ACTIVATE
Compound Symbols:
c6, c7, c8
(9) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)
Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.
ACTIVATE(n__first(z0, z1)) → c6(ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
We considered the (Usable) Rules:none
And the Tuples:
ACTIVATE(n__first(z0, z1)) → c6(ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
The order we found is given by the following interpretation:
Polynomial interpretation :
POL(ACTIVATE(x1)) = x1
POL(c6(x1, x2)) = x1 + x2
POL(c7(x1)) = x1
POL(c8(x1)) = x1
POL(n__first(x1, x2)) = [1] + x1 + x2
POL(n__from(x1)) = [1] + x1
POL(n__s(x1)) = [1] + x1
(10) Obligation:
Complexity Dependency Tuples Problem
Rules:none
Tuples:
ACTIVATE(n__first(z0, z1)) → c6(ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
S tuples:none
K tuples:
ACTIVATE(n__first(z0, z1)) → c6(ACTIVATE(z0), ACTIVATE(z1))
ACTIVATE(n__from(z0)) → c7(ACTIVATE(z0))
ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
Defined Rule Symbols:none
Defined Pair Symbols:
ACTIVATE
Compound Symbols:
c6, c7, c8
(11) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)
The set S is empty
(12) BOUNDS(1, 1)