Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ check(no(x)) -> no(x)
, check(no(x)) -> no(check(x))
, check(rec(x)) -> rec(check(x))
, check(sent(x)) -> sent(check(x))
, check(up(x)) -> up(check(x))
, top(no(up(x))) -> top(check(rec(x)))
, top(sent(up(x))) -> top(check(rec(x)))
, top(rec(up(x))) -> top(check(rec(x)))
, no(up(x)) -> up(no(x))
, sent(up(x)) -> up(sent(x))
, rec(up(x)) -> up(rec(x))
, rec(bot()) -> up(sent(bot()))
, rec(no(x)) -> sent(rec(x))
, rec(sent(x)) -> sent(rec(x))
, rec(rec(x)) -> sent(rec(x))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool CDI
stdout:
MAYBE
Statistics:
Number of monomials: 1186
Last formula building started for bound 3
Last SAT solving started for bound 3Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ check(no(x)) -> no(x)
, check(no(x)) -> no(check(x))
, check(rec(x)) -> rec(check(x))
, check(sent(x)) -> sent(check(x))
, check(up(x)) -> up(check(x))
, top(no(up(x))) -> top(check(rec(x)))
, top(sent(up(x))) -> top(check(rec(x)))
, top(rec(up(x))) -> top(check(rec(x)))
, no(up(x)) -> up(no(x))
, sent(up(x)) -> up(sent(x))
, rec(up(x)) -> up(rec(x))
, rec(bot()) -> up(sent(bot()))
, rec(no(x)) -> sent(rec(x))
, rec(sent(x)) -> sent(rec(x))
, rec(rec(x)) -> sent(rec(x))}
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:
{ check(no(x)) -> no(x)
, check(no(x)) -> no(check(x))
, check(rec(x)) -> rec(check(x))
, check(sent(x)) -> sent(check(x))
, check(up(x)) -> up(check(x))
, top(no(up(x))) -> top(check(rec(x)))
, top(sent(up(x))) -> top(check(rec(x)))
, top(rec(up(x))) -> top(check(rec(x)))
, no(up(x)) -> up(no(x))
, sent(up(x)) -> up(sent(x))
, rec(up(x)) -> up(rec(x))
, rec(bot()) -> up(sent(bot()))
, rec(no(x)) -> sent(rec(x))
, rec(sent(x)) -> sent(rec(x))
, rec(rec(x)) -> sent(rec(x))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix-interpretation of dimension 3' 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 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 2' failed due to the following reason:
The input cannot be shown compatible
6) '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:
{ check(no(x)) -> no(x)
, check(no(x)) -> no(check(x))
, check(rec(x)) -> rec(check(x))
, check(sent(x)) -> sent(check(x))
, check(up(x)) -> up(check(x))
, top(no(up(x))) -> top(check(rec(x)))
, top(sent(up(x))) -> top(check(rec(x)))
, top(rec(up(x))) -> top(check(rec(x)))
, no(up(x)) -> up(no(x))
, sent(up(x)) -> up(sent(x))
, rec(up(x)) -> up(rec(x))
, rec(bot()) -> up(sent(bot()))
, rec(no(x)) -> sent(rec(x))
, rec(sent(x)) -> sent(rec(x))
, rec(rec(x)) -> sent(rec(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:
{ check(no(x)) -> no(x)
, check(no(x)) -> no(check(x))
, check(rec(x)) -> rec(check(x))
, check(sent(x)) -> sent(check(x))
, check(up(x)) -> up(check(x))
, top(no(up(x))) -> top(check(rec(x)))
, top(sent(up(x))) -> top(check(rec(x)))
, top(rec(up(x))) -> top(check(rec(x)))
, no(up(x)) -> up(no(x))
, sent(up(x)) -> up(sent(x))
, rec(up(x)) -> up(rec(x))
, rec(bot()) -> up(sent(bot()))
, rec(no(x)) -> sent(rec(x))
, rec(sent(x)) -> sent(rec(x))
, rec(rec(x)) -> sent(rec(x))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..