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