Problem Waldmann 07 size12 size-12-alpha-3-num-14

Tool CaT

Execution Time	Unknown
Answer	YES(?,O(n^1))
Input	Waldmann 07 size12 size-12-alpha-3-num-14

stdout:

YES(?,O(n^1))

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

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

  Qed

Tool IRC1

Execution Time	Unknown
Answer	YES(?,O(n^1))
Input	Waldmann 07 size12 size-12-alpha-3-num-14

stdout:

YES(?,O(n^1))

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Waldmann 07 size12 size-12-alpha-3-num-14

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(x1)
     , a(c(x1)) -> c(c(a(b(x1))))
     , b(b(x1)) -> a(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 size12 size-12-alpha-3-num-14

stdout:

YES(?,O(n^1))

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Waldmann 07 size12 size-12-alpha-3-num-14

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds