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