interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | SK90 4.25 |
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ rev(a()) -> a()
, rev(b()) -> b()
, rev(++(x, x)) -> rev(x)
, rev(++(x, y)) -> ++(rev(y), rev(x)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(rev) = {}, Uargs(++) = {1, 2}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[rev](x1) = [2] x1 + [1]
[a] = [0]
[b] = [0]
[++](x1, x2) = [1] x1 + [1] x2 + [2]
This order satisfies following ordering constraints
[rev(a())] = [1]
> [0]
= [a()]
[rev(b())] = [1]
> [0]
= [b()]
[rev(++(x, x))] = [4] x + [5]
> [2] x + [1]
= [rev(x)]
[rev(++(x, y))] = [2] x + [2] y + [5]
> [2] x + [2] y + [4]
= [++(rev(y), rev(x))]
Hurray, we answered YES(?,O(n^1))
lmpo
Execution Time (secs) | - |
Answer | YES(?,ELEMENTARY) |
Input | SK90 4.25 |
YES(?,ELEMENTARY)
We are left with following problem, upon which TcT provides the
certificate YES(?,ELEMENTARY).
Strict Trs:
{ rev(a()) -> a()
, rev(b()) -> b()
, rev(++(x, y)) -> ++(rev(y), rev(x))
, rev(++(x, x)) -> rev(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(rev) = {}, safe(a) = {}, safe(b) = {}, safe(++) = {1, 2}
and precedence
empty .
Following symbols are considered recursive:
{rev}
The recursion depth is 1.
For your convenience, here are the oriented rules in predicative
notation, possibly applying argument filtering:
Strict DPs:
Weak DPs :
Strict Trs:
{ rev(a();) -> a()
, rev(b();) -> b()
, rev(++(; x, y);) -> ++(; rev(y;), rev(x;))
, rev(++(; x, x);) -> rev(x;) }
Weak Trs :
Hurray, we answered YES(?,ELEMENTARY)
mpo
Execution Time (secs) | - |
Answer | YES(?,PRIMREC) |
Input | SK90 4.25 |
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ rev(a()) -> a()
, rev(b()) -> b()
, rev(++(x, y)) -> ++(rev(y), rev(x))
, rev(++(x, x)) -> rev(x) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
rev > ++ .
Hurray, we answered YES(?,PRIMREC)
popstar
Execution Time (secs) | 0.086 |
Answer | MAYBE |
Input | SK90 4.25 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(a()) -> a()
, rev(b()) -> b()
, rev(++(x, y)) -> ++(rev(y), rev(x))
, rev(++(x, x)) -> rev(x) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.125 |
Answer | MAYBE |
Input | SK90 4.25 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ rev(a()) -> a()
, rev(b()) -> b()
, rev(++(x, y)) -> ++(rev(y), rev(x))
, rev(++(x, x)) -> rev(x) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..