Problem AProVE 04 rta1

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputAProVE 04 rta1

stdout:

MAYBE

Problem:
 plus(s(s(x)),y) -> s(plus(x,s(y)))
 plus(x,s(s(y))) -> s(plus(s(x),y))
 plus(s(0()),y) -> s(y)
 plus(0(),y) -> y
 ack(0(),y) -> s(y)
 ack(s(x),0()) -> ack(x,s(0()))
 ack(s(x),s(y)) -> ack(x,plus(y,ack(s(x),y)))

Proof:
 Open

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputAProVE 04 rta1

stdout:

MAYBE

Tool IRC2

Execution TimeUnknown
Answer
TIMEOUT
InputAProVE 04 rta1

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  plus(s(s(x)), y) -> s(plus(x, s(y)))
     , plus(x, s(s(y))) -> s(plus(s(x), y))
     , plus(s(0()), y) -> s(y)
     , plus(0(), y) -> y
     , ack(0(), y) -> s(y)
     , ack(s(x), 0()) -> ack(x, s(0()))
     , ack(s(x), s(y)) -> ack(x, plus(y, ack(s(x), y)))}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputAProVE 04 rta1

stdout:

MAYBE

Tool RC2

Execution TimeUnknown
Answer
TIMEOUT
InputAProVE 04 rta1

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  plus(s(s(x)), y) -> s(plus(x, s(y)))
     , plus(x, s(s(y))) -> s(plus(s(x), y))
     , plus(s(0()), y) -> s(y)
     , plus(0(), y) -> y
     , ack(0(), y) -> s(y)
     , ack(s(x), 0()) -> ack(x, s(0()))
     , ack(s(x), s(y)) -> ack(x, plus(y, ack(s(x), y)))}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds