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