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