Tool CaT
stdout:
MAYBE
Problem:
f(x) -> g(f(x))
g(f(x)) -> x
g(x) -> a()
Proof:
Complexity Transformation Processor:
strict:
f(x) -> g(f(x))
g(f(x)) -> x
g(x) -> a()
weak:
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[a] = 0,
[g](x0) = x0 + 73,
[f](x0) = x0 + 232
orientation:
f(x) = x + 232 >= x + 305 = g(f(x))
g(f(x)) = x + 305 >= x = x
g(x) = x + 73 >= 0 = a()
problem:
strict:
f(x) -> g(f(x))
weak:
g(f(x)) -> x
g(x) -> a()
Open
Tool 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(x) -> g(f(x))
, g(f(x)) -> x
, g(x) -> a()}
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(x) -> g(f(x))
, g(f(x)) -> x
, g(x) -> a()}
Proof Output:
Computation stopped due to timeout after 60.0 seconds