interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ minus(X, s(Y)) -> pred(minus(X, Y))
, minus(X, 0()) -> X
, pred(s(X)) -> X
, le(s(X), s(Y)) -> le(X, Y)
, le(s(X), 0()) -> false()
, le(0(), Y) -> true()
, gcd(s(X), s(Y)) -> if(le(Y, X), s(X), s(Y))
, gcd(s(X), 0()) -> s(X)
, gcd(0(), Y) -> 0()
, if(false(), s(X), s(Y)) -> gcd(minus(Y, X), s(X))
, if(true(), s(X), s(Y)) -> gcd(minus(X, Y), s(Y)) }
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:
The input cannot be shown compatible
2) 'matrix interpretation of dimension 3' 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
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ minus(X, s(Y)) -> pred(minus(X, Y))
, minus(X, 0()) -> X
, pred(s(X)) -> X
, le(s(X), s(Y)) -> le(X, Y)
, le(s(X), 0()) -> false()
, le(0(), Y) -> true()
, gcd(0(), Y) -> 0()
, gcd(s(X), 0()) -> s(X)
, gcd(s(X), s(Y)) -> if(le(Y, X), s(X), s(Y))
, if(true(), s(X), s(Y)) -> gcd(minus(X, Y), s(Y))
, if(false(), s(X), s(Y)) -> gcd(minus(Y, X), s(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:
{ minus(X, s(Y)) -> pred(minus(X, Y))
, minus(X, 0()) -> X
, pred(s(X)) -> X
, le(s(X), s(Y)) -> le(X, Y)
, le(s(X), 0()) -> false()
, le(0(), Y) -> true()
, gcd(0(), Y) -> 0()
, gcd(s(X), 0()) -> s(X)
, gcd(s(X), s(Y)) -> if(le(Y, X), s(X), s(Y))
, if(true(), s(X), s(Y)) -> gcd(minus(X, Y), s(Y))
, if(false(), s(X), s(Y)) -> gcd(minus(Y, X), s(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:
{ minus(X, s(Y)) -> pred(minus(X, Y))
, minus(X, 0()) -> X
, pred(s(X)) -> X
, le(s(X), s(Y)) -> le(X, Y)
, le(s(X), 0()) -> false()
, le(0(), Y) -> true()
, gcd(0(), Y) -> 0()
, gcd(s(X), 0()) -> s(X)
, gcd(s(X), s(Y)) -> if(le(Y, X), s(X), s(Y))
, if(true(), s(X), s(Y)) -> gcd(minus(X, Y), s(Y))
, if(false(), s(X), s(Y)) -> gcd(minus(Y, X), s(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:
{ minus(X, s(Y)) -> pred(minus(X, Y))
, minus(X, 0()) -> X
, pred(s(X)) -> X
, le(s(X), s(Y)) -> le(X, Y)
, le(s(X), 0()) -> false()
, le(0(), Y) -> true()
, gcd(0(), Y) -> 0()
, gcd(s(X), 0()) -> s(X)
, gcd(s(X), s(Y)) -> if(le(Y, X), s(X), s(Y))
, if(true(), s(X), s(Y)) -> gcd(minus(X, Y), s(Y))
, if(false(), s(X), s(Y)) -> gcd(minus(Y, X), s(X)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..