Problem Zantema 08 ffb SL

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 ffb SL

stdout:

MAYBE

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

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

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

     [b] = 0
    orientation:
     b() = 0 >= 2 = f(f(b()))

     f(b()) = 1 >= 0 = b()

     f(f(f(x))) = x + 3 >= 0 = b()
    problem:
     strict:
      b() -> f(f(b()))
     weak:
      f(b()) -> b()
      f(f(f(x))) -> b()
    Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 ffb SL

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Zantema 08 ffb SL

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Zantema 08 ffb SL

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Zantema 08 ffb SL

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds