Problem Strategy outermost added 08 Ex1 GM99 L

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex1 GM99 L

stdout:

MAYBE

Problem:
 f(X) -> f(X)
 c() -> a()
 c() -> b()

Proof:
 Complexity Transformation Processor:
  strict:
   f(X) -> f(X)
   c() -> a()
   c() -> b()
  weak:
   
  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {4,3}
    transitions:
     b1() -> 8*
     f0(2) -> 3*
     f0(1) -> 3*
     c0() -> 4*
     a0() -> 1*
     b0() -> 2*
     1 -> 4*
     8 -> 4*
   problem:
    strict:
     f(X) -> f(X)
     c() -> a()
    weak:
     c() -> b()
   Bounds Processor:
    bound: 1
    enrichment: match
    automaton:
     final states: {4,3}
     transitions:
      a1() -> 7*
      f0(2) -> 3*
      f0(1) -> 3*
      c0() -> 4*
      a0() -> 1*
      b0() -> 2*
      2 -> 4*
      7 -> 4*
    problem:
     strict:
      f(X) -> f(X)
     weak:
      c() -> a()
      c() -> b()
    Open

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex1 GM99 L

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex1 GM99 L

stdout:

TIMEOUT

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

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex1 GM99 L

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool RC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex1 GM99 L

stdout:

TIMEOUT

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

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds