Problem Strategy outermost added 08 Ex14 AEGL02 Z

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 Z

stdout:

MAYBE

Problem:
 from(X) -> cons(X,n__from(s(X)))
 length(n__nil()) -> 0()
 length(n__cons(X,Y)) -> s(length1(activate(Y)))
 length1(X) -> length(activate(X))
 from(X) -> n__from(X)
 nil() -> n__nil()
 cons(X1,X2) -> n__cons(X1,X2)
 activate(n__from(X)) -> from(X)
 activate(n__nil()) -> nil()
 activate(n__cons(X1,X2)) -> cons(X1,X2)
 activate(X) -> X

Proof:
 Open

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 Z

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool IRC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex14 AEGL02 Z

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  from(X) -> cons(X, n__from(s(X)))
     , length(n__nil()) -> 0()
     , length(n__cons(X, Y)) -> s(length1(activate(Y)))
     , length1(X) -> length(activate(X))
     , from(X) -> n__from(X)
     , nil() -> n__nil()
     , cons(X1, X2) -> n__cons(X1, X2)
     , activate(n__from(X)) -> from(X)
     , activate(n__nil()) -> nil()
     , activate(n__cons(X1, X2)) -> cons(X1, X2)
     , activate(X) -> X}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 Z

stdout:

MAYBE
 Warning when parsing problem:
                             
                               Unsupported strategy 'OUTERMOST'

Tool RC2

Execution TimeUnknown
Answer
TIMEOUT
InputStrategy outermost added 08 Ex14 AEGL02 Z

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  from(X) -> cons(X, n__from(s(X)))
     , length(n__nil()) -> 0()
     , length(n__cons(X, Y)) -> s(length1(activate(Y)))
     , length1(X) -> length(activate(X))
     , from(X) -> n__from(X)
     , nil() -> n__nil()
     , cons(X1, X2) -> n__cons(X1, X2)
     , activate(n__from(X)) -> from(X)
     , activate(n__nil()) -> nil()
     , activate(n__cons(X1, X2)) -> cons(X1, X2)
     , activate(X) -> X}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds