Tool Bounds
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{p(a(x0), p(b(x1), p(a(x2), x3))) ->
p(x2, p(a(a(x0)), p(b(x1), x3)))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
None of the processors succeeded.
Arrrr..Tool CDI
stdout:
TIMEOUT
Statistics:
Number of monomials: 1807
Last formula building started for bound 3
Last SAT solving started for bound 3Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{p(a(x0), p(b(x1), p(a(x2), x3))) ->
p(x2, p(a(a(x0)), p(b(x1), x3)))}
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:
{p(a(x0), p(b(x1), p(a(x2), x3))) ->
p(x2, p(a(a(x0)), p(b(x1), x3)))}
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:
{p(a(x0), p(b(x1), p(a(x2), x3))) ->
p(x2, p(a(a(x0)), p(b(x1), x3)))}
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:
{p(a(x0), p(b(x1), p(a(x2), x3))) ->
p(x2, p(a(a(x0)), p(b(x1), x3)))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..