Problem Der95 27

YES(?,O(n^1))

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

Strict Trs:
  { h(f(x), y) -> f(g(x, y))
  , g(x, y) -> h(x, y) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,O(n^1))

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

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

  [h](x1, x2) = [2] x1 + [0]
                            
      [f](x1) = [1] x1 + [2]
                            
  [g](x1, x2) = [2] x1 + [1]

This order satisfies following ordering constraints

  [h(f(x), y)] = [2] x + [4] 
               > [2] x + [3] 
               = [f(g(x, y))]
                             
     [g(x, y)] = [2] x + [1] 
               > [2] x + [0] 
               = [h(x, y)]   
                             

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

MAYBE

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

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

The input cannot be shown compatible

Arrrr..