Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ C(C(c(c(x1)))) -> x1
, c(c(C(C(x1)))) -> x1
, B(B(b(b(x1)))) -> x1
, b(b(B(B(x1)))) -> x1
, c(c(B(B(c(c(b(b(c(c(x1)))))))))) ->
B(B(c(c(b(b(c(c(B(B(c(c(b(b(x1))))))))))))))
, B(B(B(B(x1)))) -> b(b(x1))
, b(b(b(b(x1)))) -> B(B(x1))
, c(c(c(c(x1)))) -> x1
, C(C(x1)) -> c(c(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: 0
Last formula building started for bound 0
Last SAT solving started for bound 0Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ C(C(c(c(x1)))) -> x1
, c(c(C(C(x1)))) -> x1
, B(B(b(b(x1)))) -> x1
, b(b(B(B(x1)))) -> x1
, c(c(B(B(c(c(b(b(c(c(x1)))))))))) ->
B(B(c(c(b(b(c(c(B(B(c(c(b(b(x1))))))))))))))
, B(B(B(B(x1)))) -> b(b(x1))
, b(b(b(b(x1)))) -> B(B(x1))
, c(c(c(c(x1)))) -> x1
, C(C(x1)) -> c(c(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:
{ C(C(c(c(x1)))) -> x1
, c(c(C(C(x1)))) -> x1
, B(B(b(b(x1)))) -> x1
, b(b(B(B(x1)))) -> x1
, c(c(B(B(c(c(b(b(c(c(x1)))))))))) ->
B(B(c(c(b(b(c(c(B(B(c(c(b(b(x1))))))))))))))
, B(B(B(B(x1)))) -> b(b(x1))
, b(b(b(b(x1)))) -> B(B(x1))
, c(c(c(c(x1)))) -> x1
, C(C(x1)) -> c(c(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:
{ C(C(c(c(x1)))) -> x1
, c(c(C(C(x1)))) -> x1
, B(B(b(b(x1)))) -> x1
, b(b(B(B(x1)))) -> x1
, c(c(B(B(c(c(b(b(c(c(x1)))))))))) ->
B(B(c(c(b(b(c(c(B(B(c(c(b(b(x1))))))))))))))
, B(B(B(B(x1)))) -> b(b(x1))
, b(b(b(b(x1)))) -> B(B(x1))
, c(c(c(c(x1)))) -> x1
, C(C(x1)) -> c(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(C(c(c(x1)))) -> x1
, c(c(C(C(x1)))) -> x1
, B(B(b(b(x1)))) -> x1
, b(b(B(B(x1)))) -> x1
, c(c(B(B(c(c(b(b(c(c(x1)))))))))) ->
B(B(c(c(b(b(c(c(B(B(c(c(b(b(x1))))))))))))))
, B(B(B(B(x1)))) -> b(b(x1))
, b(b(b(b(x1)))) -> B(B(x1))
, c(c(c(c(x1)))) -> x1
, C(C(x1)) -> c(c(x1))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..