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

Tool CaT

Execution Time	Unknown
Answer	YES(?,O(n^1))
Input	Waldmann 07 size11 size-11-alpha-3-num-9

stdout:

YES(?,O(n^1))

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

Proof:
Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {3,2}
   transitions:
    c1(10) -> 11*
    c1(11) -> 12*
    a1(9) -> 10*
    a1(8) -> 9*
    b1(6) -> 7*
    b2(20) -> 21*
    b2(22) -> 23*
    a0(1) -> 2*
    b0(1) -> 3*
    c0(1) -> 1*
    1 -> 6*
    6 -> 21,9,22
    7 -> 8,2
    8 -> 20*
    9 -> 22*
    12 -> 10,2
    20 -> 23*
    21 -> 9*
    23 -> 10*
  problem:

  Qed

Tool IRC1

Execution Time	Unknown
Answer	YES(?,O(n^1))
Input	Waldmann 07 size11 size-11-alpha-3-num-9

stdout:

YES(?,O(n^1))

Tool IRC2

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

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	YES(?,O(n^1))
Input	Waldmann 07 size11 size-11-alpha-3-num-9

stdout:

YES(?,O(n^1))

Tool RC2

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

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds