interpretations
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 2.21 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ bin(x, 0()) -> s(0())
, bin(0(), s(y)) -> 0()
, bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x, y)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix interpretation of dimension 3' failed due to the
following reason:
The input cannot be shown compatible
2) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
3) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
4) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
Execution Time (secs) | - |
Answer | YES(?,ELEMENTARY) |
Input | SK90 2.21 |
YES(?,ELEMENTARY)
We are left with following problem, upon which TcT provides the
certificate YES(?,ELEMENTARY).
Strict Trs:
{ bin(x, 0()) -> s(0())
, bin(0(), s(y)) -> 0()
, bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x, y)) }
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(bin) = {2}, safe(0) = {}, safe(s) = {1}, safe(+) = {1, 2}
and precedence
empty .
Following symbols are considered recursive:
{bin}
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:
{ bin(x; 0()) -> s(; 0())
, bin(0(); s(; y)) -> 0()
, bin(s(; x); s(; y)) -> +(; bin(x; s(; y)), bin(x; y)) }
Weak Trs :
Hurray, we answered YES(?,ELEMENTARY)
mpo
Execution Time (secs) | - |
Answer | YES(?,PRIMREC) |
Input | SK90 2.21 |
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ bin(x, 0()) -> s(0())
, bin(0(), s(y)) -> 0()
, bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x, y)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,PRIMREC)
The input was oriented with the instance of'multiset path orders'
as induced by the precedence
bin > s, bin > + .
Hurray, we answered YES(?,PRIMREC)
popstar
Execution Time (secs) | 0.115 |
Answer | MAYBE |
Input | SK90 2.21 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ bin(x, 0()) -> s(0())
, bin(0(), s(y)) -> 0()
, bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x, y)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.113 |
Answer | MAYBE |
Input | SK90 2.21 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ bin(x, 0()) -> s(0())
, bin(0(), s(y)) -> 0()
, bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x, y)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..