interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | TCT 09 ma9 |
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ f(0()) -> s(0())
, f(s(x)) -> g(s(s(x)))
, g(0()) -> s(0())
, g(s(0())) -> s(0())
, g(s(s(x))) -> f(x) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[f](x1) = [2] x1 + [3]
[0] = [2]
[s](x1) = [1] x1 + [1]
[g](x1) = [2] x1 + [0]
This order satisfies following ordering constraints
[f(0())] = [7]
> [3]
= [s(0())]
[f(s(x))] = [2] x + [5]
> [2] x + [4]
= [g(s(s(x)))]
[g(0())] = [4]
> [3]
= [s(0())]
[g(s(0()))] = [6]
> [3]
= [s(0())]
[g(s(s(x)))] = [2] x + [4]
> [2] x + [3]
= [f(x)]
Hurray, we answered YES(?,O(n^1))
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> s(0())
, f(s(x)) -> g(s(s(x)))
, g(0()) -> s(0())
, g(s(0())) -> s(0())
, g(s(s(x))) -> f(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:
{ f(0()) -> s(0())
, f(s(x)) -> g(s(s(x)))
, g(0()) -> s(0())
, g(s(0())) -> s(0())
, g(s(s(x))) -> f(x) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.089 |
Answer | MAYBE |
Input | TCT 09 ma9 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> s(0())
, f(s(x)) -> g(s(s(x)))
, g(0()) -> s(0())
, g(s(0())) -> s(0())
, g(s(s(x))) -> f(x) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.098 |
Answer | MAYBE |
Input | TCT 09 ma9 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(0()) -> s(0())
, f(s(x)) -> g(s(s(x)))
, g(0()) -> s(0())
, g(s(0())) -> s(0())
, g(s(s(x))) -> f(x) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..