interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | SK90 4.18 |
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ gcd(x, 0()) -> x
, gcd(0(), y) -> y
, gcd(s(x), s(y)) ->
if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y))) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(gcd) = {}, Uargs(s) = {}, Uargs(if) = {}, Uargs(<) = {},
Uargs(-) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[gcd](x1, x2) = [2] x1 + [2] x2 + [1]
[0] = [0]
[s](x1) = [0]
[if](x1, x2, x3) = [1] x1 + [0]
[<](x1, x2) = [0]
[-](x1, x2) = [0]
This order satisfies following ordering constraints
[gcd(x, 0())] = [2] x + [1]
> [1] x + [0]
= [x]
[gcd(0(), y)] = [2] y + [1]
> [1] y + [0]
= [y]
[gcd(s(x), s(y))] = [1]
> [0]
= [if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y)))]
Hurray, we answered YES(?,O(n^1))
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 4.18 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ gcd(x, 0()) -> x
, gcd(0(), y) -> y
, gcd(s(x), s(y)) ->
if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 4.18 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ gcd(x, 0()) -> x
, gcd(0(), y) -> y
, gcd(s(x), s(y)) ->
if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.205 |
Answer | MAYBE |
Input | SK90 4.18 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ gcd(x, 0()) -> x
, gcd(0(), y) -> y
, gcd(s(x), s(y)) ->
if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.240 |
Answer | MAYBE |
Input | SK90 4.18 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ gcd(x, 0()) -> x
, gcd(0(), y) -> y
, gcd(s(x), s(y)) ->
if(<(x, y), gcd(s(x), -(y, x)), gcd(-(x, y), s(y))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..