Problem Rubio 04 nestrec

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Rubio 04 nestrec

stdout:

MAYBE

Problem:
f(g(X)) -> g(f(f(X)))
f(h(X)) -> h(g(X))

Proof:
Complexity Transformation Processor:
  strict:
   f(g(X)) -> g(f(f(X)))
   f(h(X)) -> h(g(X))
  weak:

  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [h](x0) = x0 + 179,

     [f](x0) = x0 + 12,

     [g](x0) = x0 + 5
    orientation:
     f(g(X)) = X + 17 >= X + 29 = g(f(f(X)))

     f(h(X)) = X + 191 >= X + 184 = h(g(X))
    problem:
     strict:
      f(g(X)) -> g(f(f(X)))
     weak:
      f(h(X)) -> h(g(X))
    Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Rubio 04 nestrec

stdout:

MAYBE

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Rubio 04 nestrec

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  f(g(X)) -> g(f(f(X)))
     , f(h(X)) -> h(g(X))}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Rubio 04 nestrec

stdout:

MAYBE

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Rubio 04 nestrec

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  f(g(X)) -> g(f(f(X)))
     , f(h(X)) -> h(g(X))}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds