Problem Rubio 04 mfp95

YES(?,O(n^1))

We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).

Strict Trs: { f(s(X), Y) -> h(s(f(h(Y), X))) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,O(n^1))

The following argument positions are usable:
  Uargs(f) = {}, Uargs(s) = {}, Uargs(h) = {}

TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).

  [f](x1, x2) = [2] x1 + [3] x2 + [0]
                                     
      [s](x1) = [2]
                   
      [h](x1) = [0]

This order satisfies following ordering constraints

  [f(s(X), Y)] = [3] Y + [4]       
               > [0]               
               = [h(s(f(h(Y), X)))]
                                   

Hurray, we answered YES(?,O(n^1))

MAYBE

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

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

The input cannot be shown compatible

Arrrr..