Problem Waldmann 07 size11 size-11-alpha-3-num-12

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Waldmann 07 size11 size-11-alpha-3-num-12

stdout:

MAYBE

Problem:
a(x1) -> x1
a(x1) -> b(c(x1))
a(b(b(x1))) -> b(b(a(a(x1))))

Proof:
Complexity Transformation Processor:
  strict:
   a(x1) -> x1
   a(x1) -> b(c(x1))
   a(b(b(x1))) -> b(b(a(a(x1))))
  weak:

  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [b](x0) = x0 + 96,

     [c](x0) = x0 + 18,

     [a](x0) = x0 + 76
    orientation:
     a(x1) = x1 + 76 >= x1 = x1

     a(x1) = x1 + 76 >= x1 + 114 = b(c(x1))

     a(b(b(x1))) = x1 + 268 >= x1 + 344 = b(b(a(a(x1))))
    problem:
     strict:
      a(x1) -> b(c(x1))
      a(b(b(x1))) -> b(b(a(a(x1))))
     weak:
      a(x1) -> x1
    Matrix Interpretation Processor:
     dimension: 1
     max_matrix:
      1
      interpretation:
       [b](x0) = x0 + 48,

       [c](x0) = x0 + 2,

       [a](x0) = x0 + 51
      orientation:
       a(x1) = x1 + 51 >= x1 + 50 = b(c(x1))

       a(b(b(x1))) = x1 + 147 >= x1 + 198 = b(b(a(a(x1))))

       a(x1) = x1 + 51 >= x1 = x1
      problem:
       strict:
        a(b(b(x1))) -> b(b(a(a(x1))))
       weak:
        a(x1) -> b(c(x1))
        a(x1) -> x1
      Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Waldmann 07 size11 size-11-alpha-3-num-12

stdout:

MAYBE

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Waldmann 07 size11 size-11-alpha-3-num-12

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  a(x1) -> x1
     , a(x1) -> b(c(x1))
     , a(b(b(x1))) -> b(b(a(a(x1))))}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Waldmann 07 size11 size-11-alpha-3-num-12

stdout:

MAYBE

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Waldmann 07 size11 size-11-alpha-3-num-12

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  a(x1) -> x1
     , a(x1) -> b(c(x1))
     , a(b(b(x1))) -> b(b(a(a(x1))))}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds