Problem Strategy outermost added 08 Ex16 Luc06 L

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex16 Luc06 L

stdout:

MAYBE

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

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

  Bounds Processor:
   bound: 1
   enrichment: match
   automaton:
    final states: {3,2}
    transitions:
     a1() -> 6*
     f0(1) -> 2*
     a0() -> 1*
     b0() -> 3*
     6 -> 3*
   problem:
    strict:
     f(X) -> f(a())
    weak:
     b() -> a()
   Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex16 Luc06 L

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex16 Luc06 L

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex16 Luc06 L

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex16 Luc06 L

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds