Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ g(a(), g(x, g(b(), g(a(), g(x, y))))) ->
g(a(), g(a(), g(a(), g(x, g(b(), g(b(), y))))))
, h(i(x, y)) -> i(i(c(), h(h(y))), x)
, h(g(x, s(y))) -> h(g(s(x), y))
, f(g(s(x), y)) -> f(g(x, s(y)))
, f(s(x)) -> s(s(f(h(s(x)))))
, h(s(f(x))) -> h(f(x))
, g(x, x) -> g(a(), b())
, i(x, x) -> i(a(), b())}
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:
{ g(a(), g(x, g(b(), g(a(), g(x, y))))) ->
g(a(), g(a(), g(a(), g(x, g(b(), g(b(), y))))))
, h(i(x, y)) -> i(i(c(), h(h(y))), x)
, h(g(x, s(y))) -> h(g(s(x), y))
, f(g(s(x), y)) -> f(g(x, s(y)))
, f(s(x)) -> s(s(f(h(s(x)))))
, h(s(f(x))) -> h(f(x))
, g(x, x) -> g(a(), b())
, i(x, x) -> i(a(), b())}
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:
{ g(a(), g(x, g(b(), g(a(), g(x, y))))) ->
g(a(), g(a(), g(a(), g(x, g(b(), g(b(), y))))))
, h(i(x, y)) -> i(i(c(), h(h(y))), x)
, h(g(x, s(y))) -> h(g(s(x), y))
, f(g(s(x), y)) -> f(g(x, s(y)))
, f(s(x)) -> s(s(f(h(s(x)))))
, h(s(f(x))) -> h(f(x))
, g(x, x) -> g(a(), b())
, i(x, x) -> i(a(), b())}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ g(a(), g(x, g(b(), g(a(), g(x, y))))) ->
g(a(), g(a(), g(a(), g(x, g(b(), g(b(), y))))))
, h(i(x, y)) -> i(i(c(), h(h(y))), x)
, h(g(x, s(y))) -> h(g(s(x), y))
, f(g(s(x), y)) -> f(g(x, s(y)))
, f(s(x)) -> s(s(f(h(s(x)))))
, h(s(f(x))) -> h(f(x))
, g(x, x) -> g(a(), b())
, i(x, x) -> i(a(), b())}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix-interpretation of dimension 4' failed due to the following reason:
The input cannot be shown compatible
2) 'matrix-interpretation of dimension 3' failed due to the following reason:
The input cannot be shown compatible
3) 'matrix-interpretation of dimension 2' failed due to the following reason:
The input cannot be shown compatible
4) 'matrix-interpretation of dimension 1' failed due to the following reason:
The input cannot be shown compatible
Arrrr..Tool TRI2
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ g(a(), g(x, g(b(), g(a(), g(x, y))))) ->
g(a(), g(a(), g(a(), g(x, g(b(), g(b(), y))))))
, h(i(x, y)) -> i(i(c(), h(h(y))), x)
, h(g(x, s(y))) -> h(g(s(x), y))
, f(g(s(x), y)) -> f(g(x, s(y)))
, f(s(x)) -> s(s(f(h(s(x)))))
, h(s(f(x))) -> h(f(x))
, g(x, x) -> g(a(), b())
, i(x, x) -> i(a(), b())}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..