Tool CaT
stdout:
MAYBE
Problem:
f(g(x)) -> x
g(b()) -> f(g(b()))
Proof:
Complexity Transformation Processor:
strict:
f(g(x)) -> x
g(b()) -> f(g(b()))
weak:
Arctic Interpretation Processor:
dimension: 1
interpretation:
[b] = 9,
[f](x0) = x0,
[g](x0) = 8x0
orientation:
f(g(x)) = 8x >= x = x
g(b()) = 17 >= 17 = f(g(b()))
problem:
strict:
g(b()) -> f(g(b()))
weak:
f(g(x)) -> x
OpenTool IRC1
stdout:
MAYBE
Warning when parsing problem:
Unsupported strategy 'OUTERMOST'Tool IRC2
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: innermost runtime-complexity with respect to
Rules:
{ f(g(x)) -> x
, g(b()) -> f(g(b()))}
Proof Output:
Computation stopped due to timeout after 60.0 secondsTool RC1
stdout:
MAYBE
Warning when parsing problem:
Unsupported strategy 'OUTERMOST'Tool RC2
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: runtime-complexity with respect to
Rules:
{ f(g(x)) -> x
, g(b()) -> f(g(b()))}
Proof Output:
Computation stopped due to timeout after 60.0 seconds