Problem AG01 3.26

MAYBE

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

Strict Trs:
  { f(x) -> s(x)
  , f(s(s(x))) -> s(f(f(x))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'matrix interpretation of dimension 3' failed due to the
   following reason:
   
   The input cannot be shown compatible

2) 'custom shape polynomial interpretation' failed due to the
   following reason:
   
   The input cannot be shown compatible

3) 'custom shape polynomial interpretation' failed due to the
   following reason:
   
   The input cannot be shown compatible

4) 'matrix interpretation of dimension 1' failed due to the
   following reason:
   
   The input cannot be shown compatible


Arrrr..

MAYBE

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

Strict Trs:
  { f(x) -> s(x)
  , f(s(s(x))) -> s(f(f(x))) }
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:
  { f(x) -> s(x)
  , f(s(s(x))) -> s(f(f(x))) }
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:
  { f(x) -> s(x)
  , f(s(s(x))) -> s(f(f(x))) }
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:
  { f(x) -> s(x)
  , f(s(s(x))) -> s(f(f(x))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..