Tool Bounds
Execution Time | 60.116566ms |
---|
Answer | TIMEOUT |
---|
Input | AG01 3.12 |
---|
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))
, shuffle(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, reverse(nil()) -> nil()
, app(add(n, x), y) -> add(n, app(x, y))
, app(nil(), y) -> y}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool CDI
Execution Time | 3.1277409ms |
---|
Answer | MAYBE |
---|
Input | AG01 3.12 |
---|
stdout:
MAYBE
Statistics:
Number of monomials: 689
Last formula building started for bound 3
Last SAT solving started for bound 3Tool EDA
Execution Time | 60.030434ms |
---|
Answer | TIMEOUT |
---|
Input | AG01 3.12 |
---|
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))
, shuffle(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, reverse(nil()) -> nil()
, app(add(n, x), y) -> add(n, app(x, y))
, app(nil(), y) -> y}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool IDA
Execution Time | 45.21709ms |
---|
Answer | MAYBE |
---|
Input | AG01 3.12 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))
, shuffle(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, reverse(nil()) -> nil()
, app(add(n, x), y) -> add(n, app(x, y))
, app(nil(), y) -> y}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix-interpretation of dimension 4' 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 4' failed due to the following reason:
The input cannot be shown compatible
4) 'matrix-interpretation of dimension 4' failed due to the following reason:
The input cannot be shown compatible
5) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
6) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
7) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
8) 'matrix-interpretation of dimension 2' failed due to the following reason:
The input cannot be shown compatible
9) 'matrix-interpretation of dimension 2' failed due to the following reason:
The input cannot be shown compatible
10) 'matrix-interpretation of dimension 1' failed due to the following reason:
The input cannot be shown compatible
Arrrr..Tool TRI
Execution Time | 6.268814ms |
---|
Answer | MAYBE |
---|
Input | AG01 3.12 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))
, shuffle(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, reverse(nil()) -> nil()
, app(add(n, x), y) -> add(n, app(x, y))
, app(nil(), y) -> y}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix-interpretation of dimension 6' failed due to the following reason:
The input cannot be shown compatible
2) 'matrix-interpretation of dimension 5' failed due to the following reason:
The input cannot be shown compatible
3) 'matrix-interpretation of dimension 4' failed due to the following reason:
The input cannot be shown compatible
4) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
5) 'matrix-interpretation of dimension 2' failed due to the following reason:
The input cannot be shown compatible
6) 'matrix-interpretation of dimension 1' failed due to the following reason:
The input cannot be shown compatible
Arrrr..Tool TRI2
Execution Time | 0.170578ms |
---|
Answer | MAYBE |
---|
Input | AG01 3.12 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))
, shuffle(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, reverse(nil()) -> nil()
, app(add(n, x), y) -> add(n, app(x, y))
, app(nil(), y) -> y}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..