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