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