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