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