interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)
, p(s(x)) -> x
, f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x)))
, f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x)))) }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ -(x, 0()) -> x
, -(s(x), s(y)) -> -(x, y)
, p(s(x)) -> x
, f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
, f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), 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
, -(s(x), s(y)) -> -(x, y)
, p(s(x)) -> x
, f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
, f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), 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
, -(s(x), s(y)) -> -(x, y)
, p(s(x)) -> x
, f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
, f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), 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
, -(s(x), s(y)) -> -(x, y)
, p(s(x)) -> x
, f(s(x), y) -> f(p(-(s(x), y)), p(-(y, s(x))))
, f(x, s(y)) -> f(p(-(x, s(y))), p(-(s(y), x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..