Problem AG01 3.17

Tool Bounds

Execution Time	60.034454ms
Answer	TIMEOUT
Input	AG01 3.17

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  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 CDI

Execution Time	60.042854ms
Answer	TIMEOUT
Input	AG01 3.17

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.031456ms
Answer	TIMEOUT
Input	AG01 3.17

stdout:

Tool IDA

Execution Time	49.901627ms
Answer	MAYBE
Input	AG01 3.17

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  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.

  Details of failed attempt(s):
  -----------------------------
    1) 'matrix-interpretation of dimension 2' failed due to the following reason:
         The input cannot be shown compatible

    2) 'matrix-interpretation of dimension 2' failed due to the following reason:
         The input cannot be shown compatible

    3) 'matrix-interpretation of dimension 1' failed due to the following reason:
         The input cannot be shown compatible


Arrrr..

Tool TRI

Execution Time	37.277435ms
Answer	MAYBE
Input	AG01 3.17

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  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.

  Details of failed attempt(s):
  -----------------------------
    1) 'matrix-interpretation of dimension 5' failed due to the following reason:
         The input cannot be shown compatible

    2) 'matrix-interpretation of dimension 4' failed due to the following reason:
         The input cannot be shown compatible

    3) 'matrix-interpretation of dimension 3' failed due to the following reason:
         The input cannot be shown compatible

    4) 'matrix-interpretation of dimension 2' failed due to the following reason:
         The input cannot be shown compatible

    5) 'matrix-interpretation of dimension 1' failed due to the following reason:
         The input cannot be shown compatible


Arrrr..

Tool TRI2

Execution Time	0.422189ms
Answer	MAYBE
Input	AG01 3.17