Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
  Strict Trs:
    {  b(a(x1)) -> a(c(b(x1)))
     , b(c(x1)) -> c(b(b(x1)))
     , a(b(x1)) -> b(c(a(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: 438
Last formula building started for bound 3
Last SAT solving started for bound 3Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
  Strict Trs:
    {  b(a(x1)) -> a(c(b(x1)))
     , b(c(x1)) -> c(b(b(x1)))
     , a(b(x1)) -> b(c(a(x1)))}
  StartTerms: all
  Strategy: none
Certificate: TIMEOUT
Proof:
  Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool IDA
stdout:
TIMEOUT
We consider the following Problem:
  Strict Trs:
    {  b(a(x1)) -> a(c(b(x1)))
     , b(c(x1)) -> c(b(b(x1)))
     , a(b(x1)) -> b(c(a(x1)))}
  StartTerms: all
  Strategy: none
Certificate: TIMEOUT
Proof:
  Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI
stdout:
TIMEOUT
We consider the following Problem:
  Strict Trs:
    {  b(a(x1)) -> a(c(b(x1)))
     , b(c(x1)) -> c(b(b(x1)))
     , a(b(x1)) -> b(c(a(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:
    {  b(a(x1)) -> a(c(b(x1)))
     , b(c(x1)) -> c(b(b(x1)))
     , a(b(x1)) -> b(c(a(x1)))}
  StartTerms: all
  Strategy: none
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..