Problem Zantema 08 g 2 const

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 g 2 const

stdout:

MAYBE

Problem:
f(x) -> g(f(x))
g(g(x)) -> c()

Proof:
Complexity Transformation Processor:
  strict:
   f(x) -> g(f(x))
   g(g(x)) -> c()
  weak:

  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [c] = 0,

     [g](x0) = x0 + 232,

     [f](x0) = x0 + 84
    orientation:
     f(x) = x + 84 >= x + 316 = g(f(x))

     g(g(x)) = x + 464 >= 0 = c()
    problem:
     strict:
      f(x) -> g(f(x))
     weak:
      g(g(x)) -> c()
    Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 g 2 const

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Zantema 08 g 2 const

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 g 2 const

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Zantema 08 g 2 const

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds