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

Tool CaT

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

stdout:

YES(?,O(n^1))

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

Proof:
Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {3,2}
   transitions:
    b1(6) -> 7*
    c1(8) -> 9*
    a0(1) -> 2*
    b0(1) -> 1*
    c0(1) -> 3*
    1 -> 8,6,2
    7 -> 2*
    9 -> 6*
  problem:

  Qed

Tool IRC1

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

stdout:

YES(?,O(n^1))

Tool IRC2

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

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(b(x1)) -> b(c(x1))
     , c(c(x1)) -> a(c(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-4

stdout:

YES(?,O(n^1))

Tool RC2

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

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(b(x1)) -> b(c(x1))
     , c(c(x1)) -> a(c(a(x1)))}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds