Problem Zantema 08 g 2 f var

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 g 2 f var

stdout:

MAYBE

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

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

  Arctic Interpretation Processor:
   dimension: 1
   interpretation:
    [g](x0) = x0,

    [f](x0) = 1x0
   orientation:
    f(x) = 1x >= 1x = g(f(x))

    g(g(f(x))) = 1x >= x = x
   problem:
    strict:
     f(x) -> g(f(x))
    weak:
     g(g(f(x))) -> x
   Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 g 2 f var

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Zantema 08 g 2 f var

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(f(x))) -> x}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 g 2 f var

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Zantema 08 g 2 f var

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(f(x))) -> x}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds