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