interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | AG01 3.29 |
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs: { f(s(x), y, y) -> f(y, x, s(x)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(f) = {}, Uargs(s) = {}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[f](x1, x2, x3) = [1] x1 + [1] x2 + [3]
[s](x1) = [1] x1 + [2]
This order satisfies following ordering constraints
[f(s(x), y, y)] = [1] x + [1] y + [5]
> [1] x + [1] y + [3]
= [f(y, x, s(x))]
Hurray, we answered YES(?,O(n^1))
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.29 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs: { f(s(x), y, y) -> f(y, x, s(x)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.29 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs: { f(s(x), y, y) -> f(y, x, s(x)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.041 |
Answer | MAYBE |
Input | AG01 3.29 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs: { f(s(x), y, y) -> f(y, x, s(x)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.090 |
Answer | YES(?,POLY) |
Input | AG01 3.29 |
YES(?,POLY)
We are left with following problem, upon which TcT provides the
certificate YES(?,POLY).
Strict Trs: { f(s(x), y, y) -> f(y, x, s(x)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,POLY)
The input was oriented with the instance of 'Polynomial Path Order
(PS)' as induced by the safe mapping
safe(f) = {3}, safe(s) = {1}
and precedence
empty .
Following symbols are considered recursive:
{f}
The recursion depth is 1.
For your convenience, here are the oriented rules in predicative
notation, possibly applying argument filtering:
Strict DPs:
Weak DPs :
Strict Trs: { f(s(; x), y; y) -> f(y, x; s(; x)) }
Weak Trs :
Hurray, we answered YES(?,POLY)