Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ g(0()) -> 0()
, g(s(x)) -> s(g(x))
, f(g(x), s(0()), y) -> f(g(s(0())), y, g(x))}
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: 2008
Last formula building started for bound 3
Last SAT solving started for bound 3Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ g(0()) -> 0()
, g(s(x)) -> s(g(x))
, f(g(x), s(0()), y) -> f(g(s(0())), y, g(x))}
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(0()) -> 0()
, g(s(x)) -> s(g(x))
, f(g(x), s(0()), y) -> f(g(s(0())), y, g(x))}
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:
{ g(0()) -> 0()
, g(s(x)) -> s(g(x))
, f(g(x), s(0()), y) -> f(g(s(0())), y, g(x))}
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:
{ g(0()) -> 0()
, g(s(x)) -> s(g(x))
, f(g(x), s(0()), y) -> f(g(s(0())), y, g(x))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..