Tool CaT
stdout:
MAYBE
Problem:
b(c(x1)) -> a(b(b(x1)))
b(a(x1)) -> a(c(b(x1)))
Proof:
Complexity Transformation Processor:
strict:
b(c(x1)) -> a(b(b(x1)))
b(a(x1)) -> a(c(b(x1)))
weak:
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[a](x0) = x0 + 1,
[b](x0) = x0 + 44,
[c](x0) = x0 + 148
orientation:
b(c(x1)) = x1 + 192 >= x1 + 89 = a(b(b(x1)))
b(a(x1)) = x1 + 45 >= x1 + 193 = a(c(b(x1)))
problem:
strict:
b(a(x1)) -> a(c(b(x1)))
weak:
b(c(x1)) -> a(b(b(x1)))
Open
Tool IRC1
stdout:
MAYBE
Tool IRC2
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: innermost runtime-complexity with respect to
Rules:
{ b(c(x1)) -> a(b(b(x1)))
, b(a(x1)) -> a(c(b(x1)))}
Proof Output:
Computation stopped due to timeout after 60.0 secondsTool RC1
stdout:
MAYBE
Tool RC2
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: runtime-complexity with respect to
Rules:
{ b(c(x1)) -> a(b(b(x1)))
, b(a(x1)) -> a(c(b(x1)))}
Proof Output:
Computation stopped due to timeout after 60.0 seconds