interpretations
| Execution Time (secs) | - |
| Answer | MAYBE |
| Input | SK90 2.27 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(x))) -> sp(g(x))
, fib(s(s(0()))) -> s(0())
, sp(pair(x, y)) -> +(x, y)
, g(0()) -> pair(s(0()), 0())
, g(s(x)) -> np(g(x))
, g(s(0())) -> pair(s(0()), s(0()))
, np(pair(x, y)) -> pair(+(x, y), x)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(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 | MAYBE |
| Input | SK90 2.27 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(0()))) -> s(0())
, fib(s(s(x))) -> sp(g(x))
, g(0()) -> pair(s(0()), 0())
, g(s(0())) -> pair(s(0()), s(0()))
, g(s(x)) -> np(g(x))
, sp(pair(x, y)) -> +(x, y)
, np(pair(x, y)) -> pair(+(x, y), x)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
| Execution Time (secs) | - |
| Answer | YES(?,PRIMREC) |
| Input | SK90 2.27 |
YES(?,PRIMREC)
We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(0()))) -> s(0())
, fib(s(s(x))) -> sp(g(x))
, g(0()) -> pair(s(0()), 0())
, g(s(0())) -> pair(s(0()), s(0()))
, g(s(x)) -> np(g(x))
, sp(pair(x, y)) -> +(x, y)
, np(pair(x, y)) -> pair(+(x, y), x)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(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
fib > sp, fib > g, sp > +, g > s, g > pair, g > np, np > pair,
np > +, + > s .
Hurray, we answered YES(?,PRIMREC)
popstar
| Execution Time (secs) | 0.217 |
| Answer | MAYBE |
| Input | SK90 2.27 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(0()))) -> s(0())
, fib(s(s(x))) -> sp(g(x))
, g(0()) -> pair(s(0()), 0())
, g(s(0())) -> pair(s(0()), s(0()))
, g(s(x)) -> np(g(x))
, sp(pair(x, y)) -> +(x, y)
, np(pair(x, y)) -> pair(+(x, y), x)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
| Execution Time (secs) | 0.182 |
| Answer | MAYBE |
| Input | SK90 2.27 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(0()))) -> s(0())
, fib(s(s(x))) -> sp(g(x))
, g(0()) -> pair(s(0()), 0())
, g(s(0())) -> pair(s(0()), s(0()))
, g(s(x)) -> np(g(x))
, sp(pair(x, y)) -> +(x, y)
, np(pair(x, y)) -> pair(+(x, y), x)
, +(x, 0()) -> x
, +(x, s(y)) -> s(+(x, y)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..