Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ a(c(b(x1))) -> a(a(b(c(b(a(x1))))))
, a(b(a(a(x1)))) -> c(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: 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:
{ a(c(b(x1))) -> a(a(b(c(b(a(x1))))))
, a(b(a(a(x1)))) -> c(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(c(b(x1))) -> a(a(b(c(b(a(x1))))))
, a(b(a(a(x1)))) -> c(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:
YES(?,O(n^3))
We consider the following Problem:
Strict Trs:
{ a(c(b(x1))) -> a(a(b(c(b(a(x1))))))
, a(b(a(a(x1)))) -> c(b(a(b(a(x1)))))}
StartTerms: all
Strategy: none
Certificate: YES(?,O(n^3))
Proof:
We have the following triangular matrix interpretation:
Interpretation Functions:
a(x1) = [1 0 2 0 0] x1 + [0]
[0 0 0 1 0] [0]
[0 0 0 1 0] [0]
[0 0 0 0 3] [0]
[0 0 0 0 1] [1]
b(x1) = [1 1 0 0 0] x1 + [0]
[0 0 1 0 0] [0]
[0 0 0 2 0] [0]
[0 0 0 0 1] [0]
[0 0 0 0 0] [0]
c(x1) = [1 2 0 0 0] x1 + [0]
[0 0 0 0 0] [0]
[0 0 1 0 0] [2]
[0 0 0 0 0] [0]
[0 0 0 0 0] [1]
Hurray, we answered YES(?,O(n^3))Tool TRI2
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ a(c(b(x1))) -> a(a(b(c(b(a(x1))))))
, a(b(a(a(x1)))) -> c(b(a(b(a(x1)))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..