interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, f(0()) -> 0()
, f(s(x)) -> -(s(x), g(f(x)))
, g(0()) -> s(0())
, g(s(x)) -> -(s(x), f(g(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'custom shape polynomial interpretation' failed due to the
following reason:
Following exception was raised:
stack overflow
2) 'custom shape polynomial interpretation' failed due to the
following reason:
Following exception was raised:
stack overflow
3) 'matrix interpretation of dimension 3' 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
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, f(0()) -> 0()
, f(s(x)) -> -(s(x), g(f(x)))
, g(0()) -> s(0())
, g(s(x)) -> -(s(x), f(g(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, f(0()) -> 0()
, f(s(x)) -> -(s(x), g(f(x)))
, g(0()) -> s(0())
, g(s(x)) -> -(s(x), f(g(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, f(0()) -> 0()
, f(s(x)) -> -(s(x), g(f(x)))
, g(0()) -> s(0())
, g(s(x)) -> -(s(x), f(g(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ -(x, 0()) -> x
, -(0(), s(y)) -> 0()
, -(s(x), s(y)) -> -(x, y)
, f(0()) -> 0()
, f(s(x)) -> -(s(x), g(f(x)))
, g(0()) -> s(0())
, g(s(x)) -> -(s(x), f(g(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..