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