Problem AG01 3.17a

Tool Bounds

Execution Time	38.439785ms
Answer	MAYBE
Input	AG01 3.17a

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  pred(cons(s(x), nil())) -> cons(x, nil())
     , sum(plus(cons(0(), x), cons(y, l))) ->
       pred(sum(cons(s(x), cons(y, l))))
     , plus(s(x), y) -> s(plus(x, y))
     , plus(0(), y) -> y
     , sum(app(l, cons(x, cons(y, k)))) ->
       sum(app(l, sum(cons(x, cons(y, k)))))
     , sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))
     , sum(cons(x, nil())) -> cons(x, nil())
     , app(cons(x, l), k) -> cons(x, app(l, k))
     , app(l, nil()) -> l
     , app(nil(), k) -> k}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  None of the processors succeeded.


Arrrr..

Tool CDI

Execution Time	60.03995ms
Answer	TIMEOUT
Input	AG01 3.17a

stdout:

TIMEOUT

Statistics:
Number of monomials: 0
Last formula building started for bound 0
Last SAT solving started for bound 0

Tool EDA

Execution Time	60.034824ms
Answer	TIMEOUT
Input	AG01 3.17a

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  pred(cons(s(x), nil())) -> cons(x, nil())
     , sum(plus(cons(0(), x), cons(y, l))) ->
       pred(sum(cons(s(x), cons(y, l))))
     , plus(s(x), y) -> s(plus(x, y))
     , plus(0(), y) -> y
     , sum(app(l, cons(x, cons(y, k)))) ->
       sum(app(l, sum(cons(x, cons(y, k)))))
     , sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l))
     , sum(cons(x, nil())) -> cons(x, nil())
     , app(cons(x, l), k) -> cons(x, app(l, k))
     , app(l, nil()) -> l
     , app(nil(), k) -> k}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.043896ms
Answer	TIMEOUT
Input	AG01 3.17a

stdout:

Tool TRI

Execution Time	60.033707ms
Answer	TIMEOUT
Input	AG01 3.17a

stdout:

Tool TRI2

Execution Time	0.66561604ms
Answer	MAYBE
Input	AG01 3.17a