Problem Strategy outermost added 08 Ex9 Luc06 FR

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex9 Luc06 FR

stdout:

MAYBE

Problem:
f(n__a(),X,X) -> f(activate(X),b(),n__b())
b() -> a()
a() -> n__a()
b() -> n__b()
activate(n__a()) -> a()
activate(n__b()) -> b()
activate(X) -> X

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex9 Luc06 FR

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex9 Luc06 FR

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex9 Luc06 FR

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex9 Luc06 FR

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds