Problem Strategy outermost added 08 ExIntrod GM01 Z

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 ExIntrod GM01 Z

stdout:

MAYBE

Problem:
incr(nil()) -> nil()
incr(cons(X,L)) -> cons(s(X),n__incr(activate(L)))
adx(nil()) -> nil()
adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L))))
nats() -> adx(zeros())
zeros() -> cons(0(),n__zeros())
head(cons(X,L)) -> X
tail(cons(X,L)) -> activate(L)
incr(X) -> n__incr(X)
adx(X) -> n__adx(X)
zeros() -> n__zeros()
activate(n__incr(X)) -> incr(X)
activate(n__adx(X)) -> adx(X)
activate(n__zeros()) -> zeros()
activate(X) -> X

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Strategy outermost added 08 ExIntrod GM01 Z

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 ExIntrod GM01 Z

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  incr(nil()) -> nil()
     , incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
     , adx(nil()) -> nil()
     , adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
     , nats() -> adx(zeros())
     , zeros() -> cons(0(), n__zeros())
     , head(cons(X, L)) -> X
     , tail(cons(X, L)) -> activate(L)
     , incr(X) -> n__incr(X)
     , adx(X) -> n__adx(X)
     , zeros() -> n__zeros()
     , activate(n__incr(X)) -> incr(X)
     , activate(n__adx(X)) -> adx(X)
     , activate(n__zeros()) -> zeros()
     , 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 ExIntrod GM01 Z

stdout:

MAYBE
Warning when parsing problem:

Unsupported strategy 'OUTERMOST'

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Strategy outermost added 08 ExIntrod GM01 Z

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  incr(nil()) -> nil()
     , incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
     , adx(nil()) -> nil()
     , adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
     , nats() -> adx(zeros())
     , zeros() -> cons(0(), n__zeros())
     , head(cons(X, L)) -> X
     , tail(cons(X, L)) -> activate(L)
     , incr(X) -> n__incr(X)
     , adx(X) -> n__adx(X)
     , zeros() -> n__zeros()
     , activate(n__incr(X)) -> incr(X)
     , activate(n__adx(X)) -> adx(X)
     , activate(n__zeros()) -> zeros()
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds