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

TIMEOUT

We are left with following problem, upon which TcT provides the
certificate TIMEOUT.

Strict Trs:
  { a(x1) -> b(x1)
  , a(b(x1)) -> b(b(a(c(c(a(x1))))))
  , c(b(x1)) -> x1 }
Obligation:
  innermost runtime complexity
Answer:
  TIMEOUT

Computation stopped due to timeout after 20.0 seconds.

Arrrr..

MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { a(x1) -> b(x1)
  , a(b(x1)) -> b(b(a(c(c(a(x1))))))
  , c(b(x1)) -> x1 }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..

MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { a(x1) -> b(x1)
  , a(b(x1)) -> b(b(a(c(c(a(x1))))))
  , c(b(x1)) -> x1 }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..

MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { a(x1) -> b(x1)
  , a(b(x1)) -> b(b(a(c(c(a(x1))))))
  , c(b(x1)) -> x1 }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..

MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { a(x1) -> b(x1)
  , a(b(x1)) -> b(b(a(c(c(a(x1))))))
  , c(b(x1)) -> x1 }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..