interpretations
Execution Time (secs) | - |
Answer | TIMEOUT |
Input | AG01 3.33 |
TIMEOUT
We are left with following problem, upon which TcT provides the
certificate TIMEOUT.
Strict Trs:
{ p(f(f(x))) -> q(f(g(x)))
, p(g(g(x))) -> q(g(f(x)))
, q(f(f(x))) -> p(f(g(x)))
, q(g(g(x))) -> p(g(f(x))) }
Obligation:
innermost runtime complexity
Answer:
TIMEOUT
Computation stopped due to timeout after 20.0 seconds.
Arrrr..
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.33 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ p(f(f(x))) -> q(f(g(x)))
, p(g(g(x))) -> q(g(f(x)))
, q(f(f(x))) -> p(f(g(x)))
, q(g(g(x))) -> p(g(f(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | AG01 3.33 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ p(f(f(x))) -> q(f(g(x)))
, p(g(g(x))) -> q(g(f(x)))
, q(f(f(x))) -> p(f(g(x)))
, q(g(g(x))) -> p(g(f(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.068 |
Answer | MAYBE |
Input | AG01 3.33 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ p(f(f(x))) -> q(f(g(x)))
, p(g(g(x))) -> q(g(f(x)))
, q(f(f(x))) -> p(f(g(x)))
, q(g(g(x))) -> p(g(f(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.134 |
Answer | MAYBE |
Input | AG01 3.33 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ p(f(f(x))) -> q(f(g(x)))
, p(g(g(x))) -> q(g(f(x)))
, q(f(f(x))) -> p(f(g(x)))
, q(g(g(x))) -> p(g(f(x))) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..