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