interpretations
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.54 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, f'(s(x), y, y) -> f'(y, x, s(x)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix interpretation of dimension 3' failed due to the
following reason:
The input cannot be shown compatible
2) 'custom shape polynomial interpretation' 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
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.54 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, 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.54 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, 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.121 |
Answer | MAYBE |
Input | AG01 3.54 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, 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.127 |
Answer | MAYBE |
Input | AG01 3.54 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, f'(s(x), y, y) -> f'(y, x, s(x)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..