Problem Zantema 08 f 2 1

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputZantema 08 f 2 1

stdout:

MAYBE

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

Proof:
 Complexity Transformation Processor:
  strict:
   a() -> f(a())
   g(f(x)) -> f(g(x))
   f(f(x)) -> b()
  weak:
   
  Bounds Processor:
   bound: 0
   enrichment: match
   automaton:
    final states: {4,3,2}
    transitions:
     a0() -> 2*
     f0(7) -> 8*
     f0(1) -> 4*
     g0(1) -> 3*
     b0() -> 1*
     1 -> 8*
     2 -> 7*
     8 -> 2*
   problem:
    strict:
     a() -> f(a())
     f(f(x)) -> b()
    weak:
     g(f(x)) -> f(g(x))
   Matrix Interpretation Processor:
    dimension: 1
    max_matrix:
     1
     interpretation:
      [b] = 0,
      
      [g](x0) = x0 + 14,
      
      [f](x0) = x0 + 1,
      
      [a] = 2
     orientation:
      a() = 2 >= 3 = f(a())
      
      f(f(x)) = x + 2 >= 0 = b()
      
      g(f(x)) = x + 15 >= x + 15 = f(g(x))
     problem:
      strict:
       a() -> f(a())
      weak:
       f(f(x)) -> b()
       g(f(x)) -> f(g(x))
     Open
 

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputZantema 08 f 2 1

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution TimeUnknown
Answer
TIMEOUT
InputZantema 08 f 2 1

stdout:

TIMEOUT

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

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputZantema 08 f 2 1

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool RC2

Execution TimeUnknown
Answer
TIMEOUT
InputZantema 08 f 2 1

stdout:

TIMEOUT

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

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds