Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ tp(mark(x)) ->
tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, f(mark(x)) -> mark(f(x))
, f(no(x)) -> no(f(x))
, f(active(x)) -> active(f(x))
, mat(f(x), c()) -> no(c())
, chk(no(c())) -> active(c())
, mat(f(x), f(y())) -> f(mat(x, y()))
, chk(no(f(x))) ->
f(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, active(f(x)) -> mark(f(f(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: 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:
{ tp(mark(x)) ->
tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, f(mark(x)) -> mark(f(x))
, f(no(x)) -> no(f(x))
, f(active(x)) -> active(f(x))
, mat(f(x), c()) -> no(c())
, chk(no(c())) -> active(c())
, mat(f(x), f(y())) -> f(mat(x, y()))
, chk(no(f(x))) ->
f(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, active(f(x)) -> mark(f(f(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:
{ tp(mark(x)) ->
tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, f(mark(x)) -> mark(f(x))
, f(no(x)) -> no(f(x))
, f(active(x)) -> active(f(x))
, mat(f(x), c()) -> no(c())
, chk(no(c())) -> active(c())
, mat(f(x), f(y())) -> f(mat(x, y()))
, chk(no(f(x))) ->
f(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, active(f(x)) -> mark(f(f(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:
{ tp(mark(x)) ->
tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, f(mark(x)) -> mark(f(x))
, f(no(x)) -> no(f(x))
, f(active(x)) -> active(f(x))
, mat(f(x), c()) -> no(c())
, chk(no(c())) -> active(c())
, mat(f(x), f(y())) -> f(mat(x, y()))
, chk(no(f(x))) ->
f(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, active(f(x)) -> mark(f(f(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:
{ tp(mark(x)) ->
tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, f(mark(x)) -> mark(f(x))
, f(no(x)) -> no(f(x))
, f(active(x)) -> active(f(x))
, mat(f(x), c()) -> no(c())
, chk(no(c())) -> active(c())
, mat(f(x), f(y())) -> f(mat(x, y()))
, chk(no(f(x))) ->
f(chk(mat(f(f(f(f(f(f(f(f(f(f(X())))))))))), x)))
, active(f(x)) -> mark(f(f(x)))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..