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