interpretations
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ max(L(x)) -> x
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z)))))
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y)))) }
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:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z))))) }
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:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z))))) }
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:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z))))) }
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:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z))))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..