Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ c(d(x1)) -> d(c(b(a(x1))))
, c(x1) -> a(b(x1))
, b(b(b(x1))) -> c(b(x1))
, a(b(a(x1))) -> b(c(x1))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool CDI
stdout:
MAYBE
Statistics:
Number of monomials: 784
Last formula building started for bound 3
Last SAT solving started for bound 3Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ c(d(x1)) -> d(c(b(a(x1))))
, c(x1) -> a(b(x1))
, b(b(b(x1))) -> c(b(x1))
, a(b(a(x1))) -> b(c(x1))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool IDA
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ c(d(x1)) -> d(c(b(a(x1))))
, c(x1) -> a(b(x1))
, b(b(b(x1))) -> c(b(x1))
, a(b(a(x1))) -> b(c(x1))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
2) 'matrix-interpretation of dimension 3' 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 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 TRI
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ c(d(x1)) -> d(c(b(a(x1))))
, c(x1) -> a(b(x1))
, b(b(b(x1))) -> c(b(x1))
, a(b(a(x1))) -> b(c(x1))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI2
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ c(d(x1)) -> d(c(b(a(x1))))
, c(x1) -> a(b(x1))
, b(b(b(x1))) -> c(b(x1))
, a(b(a(x1))) -> b(c(x1))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..