Problem Strategy outermost added 08 Ex1 Zan97 FR

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex1 Zan97 FR

stdout:

MAYBE

Problem:
g(X) -> h(activate(X))
c() -> d()
h(n__d()) -> g(n__c())
d() -> n__d()
c() -> n__c()
activate(n__d()) -> d()
activate(n__c()) -> c()
activate(X) -> X

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex1 Zan97 FR

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex1 Zan97 FR

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  g(X) -> h(activate(X))
     , c() -> d()
     , h(n__d()) -> g(n__c())
     , d() -> n__d()
     , c() -> n__c()
     , activate(n__d()) -> d()
     , activate(n__c()) -> c()
     , 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 Ex1 Zan97 FR

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex1 Zan97 FR

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  g(X) -> h(activate(X))
     , c() -> d()
     , h(n__d()) -> g(n__c())
     , d() -> n__d()
     , c() -> n__c()
     , activate(n__d()) -> d()
     , activate(n__c()) -> c()
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds