Problem Strategy outermost added 08 Ex1 GM99 iGM

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex1 GM99 iGM

stdout:

MAYBE

Problem:
active(f(a(),b(),X)) -> mark(f(X,X,X))
active(c()) -> mark(a())
active(c()) -> mark(b())
mark(f(X1,X2,X3)) -> active(f(X1,X2,mark(X3)))
mark(a()) -> active(a())
mark(b()) -> active(b())
mark(c()) -> active(c())
f(mark(X1),X2,X3) -> f(X1,X2,X3)
f(X1,mark(X2),X3) -> f(X1,X2,X3)
f(X1,X2,mark(X3)) -> f(X1,X2,X3)
f(active(X1),X2,X3) -> f(X1,X2,X3)
f(X1,active(X2),X3) -> f(X1,X2,X3)
f(X1,X2,active(X3)) -> f(X1,X2,X3)

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex1 GM99 iGM

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex1 GM99 iGM

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 Ex1 GM99 iGM

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 Ex1 GM99 iGM

stdout:

TIMEOUT

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

Proof Output:
  Computation stopped due to timeout after 60.0 seconds