interpretations
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y)
, from(X) -> cons(X) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(first) = {}, Uargs(s) = {}, Uargs(cons) = {},
Uargs(from) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[first](x1, x2) = [1]
[0] = [0]
[nil] = [0]
[s](x1) = [1] x1 + [0]
[cons](x1) = [0]
[from](x1) = [1] x1 + [3]
This order satisfies following ordering constraints
[first(0(), X)] = [1]
> [0]
= [nil()]
[first(s(X), cons(Y))] = [1]
> [0]
= [cons(Y)]
[from(X)] = [1] X + [3]
> [0]
= [cons(X)]
Hurray, we answered YES(?,O(n^1))
lmpo
YES(?,ELEMENTARY)
We are left with following problem, upon which TcT provides the
certificate YES(?,ELEMENTARY).
Strict Trs:
{ first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y)
, from(X) -> cons(X) }
Obligation:
innermost runtime complexity
Answer:
YES(?,ELEMENTARY)
The input was oriented with the instance of 'Lightweight Multiset
Path Order' as induced by the safe mapping
safe(first) = {}, safe(0) = {}, safe(nil) = {}, safe(s) = {1},
safe(cons) = {1}, safe(from) = {1}
and precedence
empty .
Following symbols are considered recursive:
{}
The recursion depth is 0.
For your convenience, here are the oriented rules in predicative
notation, possibly applying argument filtering:
Strict DPs:
Weak DPs :
Strict Trs:
{ first(0(), X;) -> nil()
, first(s(; X), cons(; Y);) -> cons(; Y)
, from(; X) -> cons(; X) }
Weak Trs :
Hurray, we answered YES(?,ELEMENTARY)
mpo
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y)
, from(X) -> cons(X) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
0 > nil, from > cons .
Hurray, we answered YES(?,PRIMREC)
popstar
YES(?,POLY)
We are left with following problem, upon which TcT provides the
certificate YES(?,POLY).
Strict Trs:
{ first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y)
, from(X) -> cons(X) }
Obligation:
innermost runtime complexity
Answer:
YES(?,POLY)
The input was oriented with the instance of 'Polynomial Path Order'
as induced by the safe mapping
safe(first) = {}, safe(0) = {}, safe(nil) = {}, safe(s) = {1},
safe(cons) = {1}, safe(from) = {1}
and precedence
empty .
Following symbols are considered recursive:
{}
The recursion depth is 0.
For your convenience, here are the oriented rules in predicative
notation, possibly applying argument filtering:
Strict DPs:
Weak DPs :
Strict Trs:
{ first(0(), X;) -> nil()
, first(s(; X), cons(; Y);) -> cons(; Y)
, from(; X) -> cons(; X) }
Weak Trs :
Hurray, we answered YES(?,POLY)
popstar-ps
YES(?,POLY)
We are left with following problem, upon which TcT provides the
certificate YES(?,POLY).
Strict Trs:
{ first(0(), X) -> nil()
, first(s(X), cons(Y)) -> cons(Y)
, from(X) -> cons(X) }
Obligation:
innermost runtime complexity
Answer:
YES(?,POLY)
The input was oriented with the instance of 'Polynomial Path Order
(PS)' as induced by the safe mapping
safe(first) = {}, safe(0) = {}, safe(nil) = {}, safe(s) = {1},
safe(cons) = {1}, safe(from) = {1}
and precedence
empty .
Following symbols are considered recursive:
{}
The recursion depth is 0.
For your convenience, here are the oriented rules in predicative
notation, possibly applying argument filtering:
Strict DPs:
Weak DPs :
Strict Trs:
{ first(0(), X;) -> nil()
, first(s(; X), cons(; Y);) -> cons(; Y)
, from(; X) -> cons(; X) }
Weak Trs :
Hurray, we answered YES(?,POLY)